Store VECTOR_CST_NELTS directly in tree_node
[official-gcc.git] / gcc / cp / call.c
blob88af0d31446d511f49c407c0017dd33d2fe84d26
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 = build_identity_conv (argtype, NULL_TREE);
2282 t = build_conv (ck_user, totype, t);
2283 /* Leave the 'cand' field null; we'll figure out the conversion in
2284 convert_like_real if this candidate is chosen. */
2285 convert_type = totype;
2287 else if (parmnode == void_list_node)
2288 break;
2289 else if (parmnode)
2291 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2292 /*c_cast_p=*/false, flags, complain);
2293 convert_type = TREE_VALUE (parmnode);
2295 else
2297 t = build_identity_conv (argtype, arg);
2298 t->ellipsis_p = true;
2299 convert_type = argtype;
2302 convs[i] = t;
2303 if (! t)
2304 break;
2306 if (t->bad_p)
2308 viable = -1;
2309 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2312 if (i == 0)
2313 continue;
2315 if (parmnode)
2316 parmnode = TREE_CHAIN (parmnode);
2319 if (i < len
2320 || ! sufficient_parms_p (parmnode))
2322 int remaining = remaining_arguments (parmnode);
2323 viable = 0;
2324 reason = arity_rejection (NULL_TREE, i + remaining, len);
2327 return add_candidate (candidates, totype, obj, arglist, len, convs,
2328 access_path, conversion_path, viable, reason, flags);
2331 static void
2332 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2333 tree type1, tree type2, tree *args, tree *argtypes,
2334 int flags, tsubst_flags_t complain)
2336 conversion *t;
2337 conversion **convs;
2338 size_t num_convs;
2339 int viable = 1, i;
2340 tree types[2];
2341 struct rejection_reason *reason = NULL;
2343 types[0] = type1;
2344 types[1] = type2;
2346 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2347 convs = alloc_conversions (num_convs);
2349 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2350 conversion ops are allowed. We handle that here by just checking for
2351 boolean_type_node because other operators don't ask for it. COND_EXPR
2352 also does contextual conversion to bool for the first operand, but we
2353 handle that in build_conditional_expr, and type1 here is operand 2. */
2354 if (type1 != boolean_type_node)
2355 flags |= LOOKUP_ONLYCONVERTING;
2357 for (i = 0; i < 2; ++i)
2359 if (! args[i])
2360 break;
2362 t = implicit_conversion (types[i], argtypes[i], args[i],
2363 /*c_cast_p=*/false, flags, complain);
2364 if (! t)
2366 viable = 0;
2367 /* We need something for printing the candidate. */
2368 t = build_identity_conv (types[i], NULL_TREE);
2369 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2370 types[i]);
2372 else if (t->bad_p)
2374 viable = 0;
2375 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2376 types[i]);
2378 convs[i] = t;
2381 /* For COND_EXPR we rearranged the arguments; undo that now. */
2382 if (args[2])
2384 convs[2] = convs[1];
2385 convs[1] = convs[0];
2386 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2387 /*c_cast_p=*/false, flags,
2388 complain);
2389 if (t)
2390 convs[0] = t;
2391 else
2393 viable = 0;
2394 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2395 boolean_type_node);
2399 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2400 num_convs, convs,
2401 /*access_path=*/NULL_TREE,
2402 /*conversion_path=*/NULL_TREE,
2403 viable, reason, flags);
2406 static bool
2407 is_complete (tree t)
2409 return COMPLETE_TYPE_P (complete_type (t));
2412 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2414 static bool
2415 promoted_arithmetic_type_p (tree type)
2417 /* [over.built]
2419 In this section, the term promoted integral type is used to refer
2420 to those integral types which are preserved by integral promotion
2421 (including e.g. int and long but excluding e.g. char).
2422 Similarly, the term promoted arithmetic type refers to promoted
2423 integral types plus floating types. */
2424 return ((CP_INTEGRAL_TYPE_P (type)
2425 && same_type_p (type_promotes_to (type), type))
2426 || TREE_CODE (type) == REAL_TYPE);
2429 /* Create any builtin operator overload candidates for the operator in
2430 question given the converted operand types TYPE1 and TYPE2. The other
2431 args are passed through from add_builtin_candidates to
2432 build_builtin_candidate.
2434 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2435 If CODE is requires candidates operands of the same type of the kind
2436 of which TYPE1 and TYPE2 are, we add both candidates
2437 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2439 static void
2440 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2441 enum tree_code code2, tree fnname, tree type1,
2442 tree type2, tree *args, tree *argtypes, int flags,
2443 tsubst_flags_t complain)
2445 switch (code)
2447 case POSTINCREMENT_EXPR:
2448 case POSTDECREMENT_EXPR:
2449 args[1] = integer_zero_node;
2450 type2 = integer_type_node;
2451 break;
2452 default:
2453 break;
2456 switch (code)
2459 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2460 and VQ is either volatile or empty, there exist candidate operator
2461 functions of the form
2462 VQ T& operator++(VQ T&);
2463 T operator++(VQ T&, int);
2464 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2465 type other than bool, and VQ is either volatile or empty, there exist
2466 candidate operator functions of the form
2467 VQ T& operator--(VQ T&);
2468 T operator--(VQ T&, int);
2469 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2470 complete object type, and VQ is either volatile or empty, there exist
2471 candidate operator functions of the form
2472 T*VQ& operator++(T*VQ&);
2473 T*VQ& operator--(T*VQ&);
2474 T* operator++(T*VQ&, int);
2475 T* operator--(T*VQ&, int); */
2477 case POSTDECREMENT_EXPR:
2478 case PREDECREMENT_EXPR:
2479 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2480 return;
2481 /* FALLTHRU */
2482 case POSTINCREMENT_EXPR:
2483 case PREINCREMENT_EXPR:
2484 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2486 type1 = build_reference_type (type1);
2487 break;
2489 return;
2491 /* 7 For every cv-qualified or cv-unqualified object type T, there
2492 exist candidate operator functions of the form
2494 T& operator*(T*);
2496 8 For every function type T, there exist candidate operator functions of
2497 the form
2498 T& operator*(T*); */
2500 case INDIRECT_REF:
2501 if (TYPE_PTR_P (type1)
2502 && (TYPE_PTROB_P (type1)
2503 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2504 break;
2505 return;
2507 /* 9 For every type T, there exist candidate operator functions of the form
2508 T* operator+(T*);
2510 10For every promoted arithmetic type T, there exist candidate operator
2511 functions of the form
2512 T operator+(T);
2513 T operator-(T); */
2515 case UNARY_PLUS_EXPR: /* unary + */
2516 if (TYPE_PTR_P (type1))
2517 break;
2518 /* FALLTHRU */
2519 case NEGATE_EXPR:
2520 if (ARITHMETIC_TYPE_P (type1))
2521 break;
2522 return;
2524 /* 11For every promoted integral type T, there exist candidate operator
2525 functions of the form
2526 T operator~(T); */
2528 case BIT_NOT_EXPR:
2529 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2530 break;
2531 return;
2533 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2534 is the same type as C2 or is a derived class of C2, T is a complete
2535 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2536 there exist candidate operator functions of the form
2537 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2538 where CV12 is the union of CV1 and CV2. */
2540 case MEMBER_REF:
2541 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2543 tree c1 = TREE_TYPE (type1);
2544 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2546 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2547 && (TYPE_PTRMEMFUNC_P (type2)
2548 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2549 break;
2551 return;
2553 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2554 didate operator functions of the form
2555 LR operator*(L, R);
2556 LR operator/(L, R);
2557 LR operator+(L, R);
2558 LR operator-(L, R);
2559 bool operator<(L, R);
2560 bool operator>(L, R);
2561 bool operator<=(L, R);
2562 bool operator>=(L, R);
2563 bool operator==(L, R);
2564 bool operator!=(L, R);
2565 where LR is the result of the usual arithmetic conversions between
2566 types L and R.
2568 14For every pair of types T and I, where T is a cv-qualified or cv-
2569 unqualified complete object type and I is a promoted integral type,
2570 there exist candidate operator functions of the form
2571 T* operator+(T*, I);
2572 T& operator[](T*, I);
2573 T* operator-(T*, I);
2574 T* operator+(I, T*);
2575 T& operator[](I, T*);
2577 15For every T, where T is a pointer to complete object type, there exist
2578 candidate operator functions of the form112)
2579 ptrdiff_t operator-(T, T);
2581 16For every pointer or enumeration type T, there exist candidate operator
2582 functions of the form
2583 bool operator<(T, T);
2584 bool operator>(T, T);
2585 bool operator<=(T, T);
2586 bool operator>=(T, T);
2587 bool operator==(T, T);
2588 bool operator!=(T, T);
2590 17For every pointer to member type T, there exist candidate operator
2591 functions of the form
2592 bool operator==(T, T);
2593 bool operator!=(T, T); */
2595 case MINUS_EXPR:
2596 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2597 break;
2598 if (TYPE_PTROB_P (type1)
2599 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2601 type2 = ptrdiff_type_node;
2602 break;
2604 /* FALLTHRU */
2605 case MULT_EXPR:
2606 case TRUNC_DIV_EXPR:
2607 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2608 break;
2609 return;
2611 case EQ_EXPR:
2612 case NE_EXPR:
2613 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2614 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2615 break;
2616 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2618 type2 = type1;
2619 break;
2621 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2623 type1 = type2;
2624 break;
2626 /* Fall through. */
2627 case LT_EXPR:
2628 case GT_EXPR:
2629 case LE_EXPR:
2630 case GE_EXPR:
2631 case MAX_EXPR:
2632 case MIN_EXPR:
2633 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2634 break;
2635 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2636 break;
2637 if (TREE_CODE (type1) == ENUMERAL_TYPE
2638 && TREE_CODE (type2) == ENUMERAL_TYPE)
2639 break;
2640 if (TYPE_PTR_P (type1)
2641 && null_ptr_cst_p (args[1]))
2643 type2 = type1;
2644 break;
2646 if (null_ptr_cst_p (args[0])
2647 && TYPE_PTR_P (type2))
2649 type1 = type2;
2650 break;
2652 return;
2654 case PLUS_EXPR:
2655 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2656 break;
2657 /* FALLTHRU */
2658 case ARRAY_REF:
2659 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2661 type1 = ptrdiff_type_node;
2662 break;
2664 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2666 type2 = ptrdiff_type_node;
2667 break;
2669 return;
2671 /* 18For every pair of promoted integral types L and R, there exist candi-
2672 date operator functions of the form
2673 LR operator%(L, R);
2674 LR operator&(L, R);
2675 LR operator^(L, R);
2676 LR operator|(L, R);
2677 L operator<<(L, R);
2678 L operator>>(L, R);
2679 where LR is the result of the usual arithmetic conversions between
2680 types L and R. */
2682 case TRUNC_MOD_EXPR:
2683 case BIT_AND_EXPR:
2684 case BIT_IOR_EXPR:
2685 case BIT_XOR_EXPR:
2686 case LSHIFT_EXPR:
2687 case RSHIFT_EXPR:
2688 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2689 break;
2690 return;
2692 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2693 type, VQ is either volatile or empty, and R is a promoted arithmetic
2694 type, there exist candidate operator functions of the form
2695 VQ L& operator=(VQ L&, R);
2696 VQ L& operator*=(VQ L&, R);
2697 VQ L& operator/=(VQ L&, R);
2698 VQ L& operator+=(VQ L&, R);
2699 VQ L& operator-=(VQ L&, R);
2701 20For every pair T, VQ), where T is any type and VQ is either volatile
2702 or empty, there exist candidate operator functions of the form
2703 T*VQ& operator=(T*VQ&, T*);
2705 21For every pair T, VQ), where T is a pointer to member type and VQ is
2706 either volatile or empty, there exist candidate operator functions of
2707 the form
2708 VQ T& operator=(VQ T&, T);
2710 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2711 unqualified complete object type, VQ is either volatile or empty, and
2712 I is a promoted integral type, there exist candidate operator func-
2713 tions of the form
2714 T*VQ& operator+=(T*VQ&, I);
2715 T*VQ& operator-=(T*VQ&, I);
2717 23For every triple L, VQ, R), where L is an integral or enumeration
2718 type, VQ is either volatile or empty, and R is a promoted integral
2719 type, there exist candidate operator functions of the form
2721 VQ L& operator%=(VQ L&, R);
2722 VQ L& operator<<=(VQ L&, R);
2723 VQ L& operator>>=(VQ L&, R);
2724 VQ L& operator&=(VQ L&, R);
2725 VQ L& operator^=(VQ L&, R);
2726 VQ L& operator|=(VQ L&, R); */
2728 case MODIFY_EXPR:
2729 switch (code2)
2731 case PLUS_EXPR:
2732 case MINUS_EXPR:
2733 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2735 type2 = ptrdiff_type_node;
2736 break;
2738 /* FALLTHRU */
2739 case MULT_EXPR:
2740 case TRUNC_DIV_EXPR:
2741 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2742 break;
2743 return;
2745 case TRUNC_MOD_EXPR:
2746 case BIT_AND_EXPR:
2747 case BIT_IOR_EXPR:
2748 case BIT_XOR_EXPR:
2749 case LSHIFT_EXPR:
2750 case RSHIFT_EXPR:
2751 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2752 break;
2753 return;
2755 case NOP_EXPR:
2756 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2757 break;
2758 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2759 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2760 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2761 || ((TYPE_PTRMEMFUNC_P (type1)
2762 || TYPE_PTR_P (type1))
2763 && null_ptr_cst_p (args[1])))
2765 type2 = type1;
2766 break;
2768 return;
2770 default:
2771 gcc_unreachable ();
2773 type1 = build_reference_type (type1);
2774 break;
2776 case COND_EXPR:
2777 /* [over.built]
2779 For every pair of promoted arithmetic types L and R, there
2780 exist candidate operator functions of the form
2782 LR operator?(bool, L, R);
2784 where LR is the result of the usual arithmetic conversions
2785 between types L and R.
2787 For every type T, where T is a pointer or pointer-to-member
2788 type, there exist candidate operator functions of the form T
2789 operator?(bool, T, T); */
2791 if (promoted_arithmetic_type_p (type1)
2792 && promoted_arithmetic_type_p (type2))
2793 /* That's OK. */
2794 break;
2796 /* Otherwise, the types should be pointers. */
2797 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2798 return;
2800 /* We don't check that the two types are the same; the logic
2801 below will actually create two candidates; one in which both
2802 parameter types are TYPE1, and one in which both parameter
2803 types are TYPE2. */
2804 break;
2806 case REALPART_EXPR:
2807 case IMAGPART_EXPR:
2808 if (ARITHMETIC_TYPE_P (type1))
2809 break;
2810 return;
2812 default:
2813 gcc_unreachable ();
2816 /* Make sure we don't create builtin candidates with dependent types. */
2817 bool u1 = uses_template_parms (type1);
2818 bool u2 = type2 ? uses_template_parms (type2) : false;
2819 if (u1 || u2)
2821 /* Try to recover if one of the types is non-dependent. But if
2822 there's only one type, there's nothing we can do. */
2823 if (!type2)
2824 return;
2825 /* And we lose if both are dependent. */
2826 if (u1 && u2)
2827 return;
2828 /* Or if they have different forms. */
2829 if (TREE_CODE (type1) != TREE_CODE (type2))
2830 return;
2832 if (u1 && !u2)
2833 type1 = type2;
2834 else if (u2 && !u1)
2835 type2 = type1;
2838 /* If we're dealing with two pointer types or two enumeral types,
2839 we need candidates for both of them. */
2840 if (type2 && !same_type_p (type1, type2)
2841 && TREE_CODE (type1) == TREE_CODE (type2)
2842 && (TREE_CODE (type1) == REFERENCE_TYPE
2843 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2844 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2845 || TYPE_PTRMEMFUNC_P (type1)
2846 || MAYBE_CLASS_TYPE_P (type1)
2847 || TREE_CODE (type1) == ENUMERAL_TYPE))
2849 if (TYPE_PTR_OR_PTRMEM_P (type1))
2851 tree cptype = composite_pointer_type (type1, type2,
2852 error_mark_node,
2853 error_mark_node,
2854 CPO_CONVERSION,
2855 tf_none);
2856 if (cptype != error_mark_node)
2858 build_builtin_candidate
2859 (candidates, fnname, cptype, cptype, args, argtypes,
2860 flags, complain);
2861 return;
2865 build_builtin_candidate
2866 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2867 build_builtin_candidate
2868 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2869 return;
2872 build_builtin_candidate
2873 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2876 tree
2877 type_decays_to (tree type)
2879 if (TREE_CODE (type) == ARRAY_TYPE)
2880 return build_pointer_type (TREE_TYPE (type));
2881 if (TREE_CODE (type) == FUNCTION_TYPE)
2882 return build_pointer_type (type);
2883 return type;
2886 /* There are three conditions of builtin candidates:
2888 1) bool-taking candidates. These are the same regardless of the input.
2889 2) pointer-pair taking candidates. These are generated for each type
2890 one of the input types converts to.
2891 3) arithmetic candidates. According to the standard, we should generate
2892 all of these, but I'm trying not to...
2894 Here we generate a superset of the possible candidates for this particular
2895 case. That is a subset of the full set the standard defines, plus some
2896 other cases which the standard disallows. add_builtin_candidate will
2897 filter out the invalid set. */
2899 static void
2900 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2901 enum tree_code code2, tree fnname, tree *args,
2902 int flags, tsubst_flags_t complain)
2904 int ref1, i;
2905 int enum_p = 0;
2906 tree type, argtypes[3], t;
2907 /* TYPES[i] is the set of possible builtin-operator parameter types
2908 we will consider for the Ith argument. */
2909 vec<tree, va_gc> *types[2];
2910 unsigned ix;
2912 for (i = 0; i < 3; ++i)
2914 if (args[i])
2915 argtypes[i] = unlowered_expr_type (args[i]);
2916 else
2917 argtypes[i] = NULL_TREE;
2920 switch (code)
2922 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2923 and VQ is either volatile or empty, there exist candidate operator
2924 functions of the form
2925 VQ T& operator++(VQ T&); */
2927 case POSTINCREMENT_EXPR:
2928 case PREINCREMENT_EXPR:
2929 case POSTDECREMENT_EXPR:
2930 case PREDECREMENT_EXPR:
2931 case MODIFY_EXPR:
2932 ref1 = 1;
2933 break;
2935 /* 24There also exist candidate operator functions of the form
2936 bool operator!(bool);
2937 bool operator&&(bool, bool);
2938 bool operator||(bool, bool); */
2940 case TRUTH_NOT_EXPR:
2941 build_builtin_candidate
2942 (candidates, fnname, boolean_type_node,
2943 NULL_TREE, args, argtypes, flags, complain);
2944 return;
2946 case TRUTH_ORIF_EXPR:
2947 case TRUTH_ANDIF_EXPR:
2948 build_builtin_candidate
2949 (candidates, fnname, boolean_type_node,
2950 boolean_type_node, args, argtypes, flags, complain);
2951 return;
2953 case ADDR_EXPR:
2954 case COMPOUND_EXPR:
2955 case COMPONENT_REF:
2956 return;
2958 case COND_EXPR:
2959 case EQ_EXPR:
2960 case NE_EXPR:
2961 case LT_EXPR:
2962 case LE_EXPR:
2963 case GT_EXPR:
2964 case GE_EXPR:
2965 enum_p = 1;
2966 /* Fall through. */
2968 default:
2969 ref1 = 0;
2972 types[0] = make_tree_vector ();
2973 types[1] = make_tree_vector ();
2975 for (i = 0; i < 2; ++i)
2977 if (! args[i])
2979 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2981 tree convs;
2983 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2984 return;
2986 convs = lookup_conversions (argtypes[i]);
2988 if (code == COND_EXPR)
2990 if (lvalue_p (args[i]))
2991 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2993 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2996 else if (! convs)
2997 return;
2999 for (; convs; convs = TREE_CHAIN (convs))
3001 type = TREE_TYPE (convs);
3003 if (i == 0 && ref1
3004 && (TREE_CODE (type) != REFERENCE_TYPE
3005 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3006 continue;
3008 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3009 vec_safe_push (types[i], type);
3011 type = non_reference (type);
3012 if (i != 0 || ! ref1)
3014 type = cv_unqualified (type_decays_to (type));
3015 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3016 vec_safe_push (types[i], type);
3017 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3018 type = type_promotes_to (type);
3021 if (! vec_member (type, types[i]))
3022 vec_safe_push (types[i], type);
3025 else
3027 if (code == COND_EXPR && lvalue_p (args[i]))
3028 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3029 type = non_reference (argtypes[i]);
3030 if (i != 0 || ! ref1)
3032 type = cv_unqualified (type_decays_to (type));
3033 if (enum_p && UNSCOPED_ENUM_P (type))
3034 vec_safe_push (types[i], type);
3035 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3036 type = type_promotes_to (type);
3038 vec_safe_push (types[i], type);
3042 /* Run through the possible parameter types of both arguments,
3043 creating candidates with those parameter types. */
3044 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3046 unsigned jx;
3047 tree u;
3049 if (!types[1]->is_empty ())
3050 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3051 add_builtin_candidate
3052 (candidates, code, code2, fnname, t,
3053 u, args, argtypes, flags, complain);
3054 else
3055 add_builtin_candidate
3056 (candidates, code, code2, fnname, t,
3057 NULL_TREE, args, argtypes, flags, complain);
3060 release_tree_vector (types[0]);
3061 release_tree_vector (types[1]);
3065 /* If TMPL can be successfully instantiated as indicated by
3066 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3068 TMPL is the template. EXPLICIT_TARGS are any explicit template
3069 arguments. ARGLIST is the arguments provided at the call-site.
3070 This does not change ARGLIST. The RETURN_TYPE is the desired type
3071 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3072 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3073 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3075 static struct z_candidate*
3076 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3077 tree ctype, tree explicit_targs, tree first_arg,
3078 const vec<tree, va_gc> *arglist, tree return_type,
3079 tree access_path, tree conversion_path,
3080 int flags, tree obj, unification_kind_t strict,
3081 tsubst_flags_t complain)
3083 int ntparms = DECL_NTPARMS (tmpl);
3084 tree targs = make_tree_vec (ntparms);
3085 unsigned int len = vec_safe_length (arglist);
3086 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3087 unsigned int skip_without_in_chrg = 0;
3088 tree first_arg_without_in_chrg = first_arg;
3089 tree *args_without_in_chrg;
3090 unsigned int nargs_without_in_chrg;
3091 unsigned int ia, ix;
3092 tree arg;
3093 struct z_candidate *cand;
3094 tree fn;
3095 struct rejection_reason *reason = NULL;
3096 int errs;
3098 /* We don't do deduction on the in-charge parameter, the VTT
3099 parameter or 'this'. */
3100 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3102 if (first_arg_without_in_chrg != NULL_TREE)
3103 first_arg_without_in_chrg = NULL_TREE;
3104 else if (return_type && strict == DEDUCE_CALL)
3105 /* We're deducing for a call to the result of a template conversion
3106 function, so the args don't contain 'this'; leave them alone. */;
3107 else
3108 ++skip_without_in_chrg;
3111 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3112 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3113 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3115 if (first_arg_without_in_chrg != NULL_TREE)
3116 first_arg_without_in_chrg = NULL_TREE;
3117 else
3118 ++skip_without_in_chrg;
3121 if (len < skip_without_in_chrg)
3122 return NULL;
3124 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3125 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3126 TREE_TYPE ((*arglist)[0])))
3128 /* 12.8/6 says, "A declaration of a constructor for a class X is
3129 ill-formed if its first parameter is of type (optionally cv-qualified)
3130 X and either there are no other parameters or else all other
3131 parameters have default arguments. A member function template is never
3132 instantiated to produce such a constructor signature."
3134 So if we're trying to copy an object of the containing class, don't
3135 consider a template constructor that has a first parameter type that
3136 is just a template parameter, as we would deduce a signature that we
3137 would then reject in the code below. */
3138 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3140 firstparm = TREE_VALUE (firstparm);
3141 if (PACK_EXPANSION_P (firstparm))
3142 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3143 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3145 gcc_assert (!explicit_targs);
3146 reason = invalid_copy_with_fn_template_rejection ();
3147 goto fail;
3152 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3153 + (len - skip_without_in_chrg));
3154 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3155 ia = 0;
3156 if (first_arg_without_in_chrg != NULL_TREE)
3158 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3159 ++ia;
3161 for (ix = skip_without_in_chrg;
3162 vec_safe_iterate (arglist, ix, &arg);
3163 ++ix)
3165 args_without_in_chrg[ia] = arg;
3166 ++ia;
3168 gcc_assert (ia == nargs_without_in_chrg);
3170 errs = errorcount+sorrycount;
3171 fn = fn_type_unification (tmpl, explicit_targs, targs,
3172 args_without_in_chrg,
3173 nargs_without_in_chrg,
3174 return_type, strict, flags, false,
3175 complain & tf_decltype);
3177 if (fn == error_mark_node)
3179 /* Don't repeat unification later if it already resulted in errors. */
3180 if (errorcount+sorrycount == errs)
3181 reason = template_unification_rejection (tmpl, explicit_targs,
3182 targs, args_without_in_chrg,
3183 nargs_without_in_chrg,
3184 return_type, strict, flags);
3185 else
3186 reason = template_unification_error_rejection ();
3187 goto fail;
3190 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3192 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3193 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3194 ctype))
3196 /* We're trying to produce a constructor with a prohibited signature,
3197 as discussed above; handle here any cases we didn't catch then,
3198 such as X(X<T>). */
3199 reason = invalid_copy_with_fn_template_rejection ();
3200 goto fail;
3204 if (obj != NULL_TREE)
3205 /* Aha, this is a conversion function. */
3206 cand = add_conv_candidate (candidates, fn, obj, arglist,
3207 access_path, conversion_path, complain);
3208 else
3209 cand = add_function_candidate (candidates, fn, ctype,
3210 first_arg, arglist, access_path,
3211 conversion_path, flags, complain);
3212 if (DECL_TI_TEMPLATE (fn) != tmpl)
3213 /* This situation can occur if a member template of a template
3214 class is specialized. Then, instantiate_template might return
3215 an instantiation of the specialization, in which case the
3216 DECL_TI_TEMPLATE field will point at the original
3217 specialization. For example:
3219 template <class T> struct S { template <class U> void f(U);
3220 template <> void f(int) {}; };
3221 S<double> sd;
3222 sd.f(3);
3224 Here, TMPL will be template <class U> S<double>::f(U).
3225 And, instantiate template will give us the specialization
3226 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3227 for this will point at template <class T> template <> S<T>::f(int),
3228 so that we can find the definition. For the purposes of
3229 overload resolution, however, we want the original TMPL. */
3230 cand->template_decl = build_template_info (tmpl, targs);
3231 else
3232 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3233 cand->explicit_targs = explicit_targs;
3235 return cand;
3236 fail:
3237 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3238 access_path, conversion_path, 0, reason, flags);
3242 static struct z_candidate *
3243 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3244 tree explicit_targs, tree first_arg,
3245 const vec<tree, va_gc> *arglist, tree return_type,
3246 tree access_path, tree conversion_path, int flags,
3247 unification_kind_t strict, tsubst_flags_t complain)
3249 return
3250 add_template_candidate_real (candidates, tmpl, ctype,
3251 explicit_targs, first_arg, arglist,
3252 return_type, access_path, conversion_path,
3253 flags, NULL_TREE, strict, complain);
3256 /* Create an overload candidate for the conversion function template TMPL,
3257 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3258 pointer-to-function which will in turn be called with the argument list
3259 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3260 passed on to implicit_conversion. */
3262 static struct z_candidate *
3263 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3264 tree obj,
3265 const vec<tree, va_gc> *arglist,
3266 tree return_type, tree access_path,
3267 tree conversion_path, tsubst_flags_t complain)
3269 /* Making this work broke PR 71117, so until the committee resolves core
3270 issue 2189, let's disable this candidate if there are any viable call
3271 operators. */
3272 if (any_strictly_viable (*candidates))
3273 return NULL;
3275 return
3276 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3277 NULL_TREE, arglist, return_type, access_path,
3278 conversion_path, 0, obj, DEDUCE_CALL,
3279 complain);
3282 /* The CANDS are the set of candidates that were considered for
3283 overload resolution. Return the set of viable candidates, or CANDS
3284 if none are viable. If any of the candidates were viable, set
3285 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3286 considered viable only if it is strictly viable. */
3288 static struct z_candidate*
3289 splice_viable (struct z_candidate *cands,
3290 bool strict_p,
3291 bool *any_viable_p)
3293 struct z_candidate *viable;
3294 struct z_candidate **last_viable;
3295 struct z_candidate **cand;
3296 bool found_strictly_viable = false;
3298 /* Be strict inside templates, since build_over_call won't actually
3299 do the conversions to get pedwarns. */
3300 if (processing_template_decl)
3301 strict_p = true;
3303 viable = NULL;
3304 last_viable = &viable;
3305 *any_viable_p = false;
3307 cand = &cands;
3308 while (*cand)
3310 struct z_candidate *c = *cand;
3311 if (!strict_p
3312 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3314 /* Be strict in the presence of a viable candidate. Also if
3315 there are template candidates, so that we get deduction errors
3316 for them instead of silently preferring a bad conversion. */
3317 strict_p = true;
3318 if (viable && !found_strictly_viable)
3320 /* Put any spliced near matches back onto the main list so
3321 that we see them if there is no strict match. */
3322 *any_viable_p = false;
3323 *last_viable = cands;
3324 cands = viable;
3325 viable = NULL;
3326 last_viable = &viable;
3330 if (strict_p ? c->viable == 1 : c->viable)
3332 *last_viable = c;
3333 *cand = c->next;
3334 c->next = NULL;
3335 last_viable = &c->next;
3336 *any_viable_p = true;
3337 if (c->viable == 1)
3338 found_strictly_viable = true;
3340 else
3341 cand = &c->next;
3344 return viable ? viable : cands;
3347 static bool
3348 any_strictly_viable (struct z_candidate *cands)
3350 for (; cands; cands = cands->next)
3351 if (cands->viable == 1)
3352 return true;
3353 return false;
3356 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3357 words, it is about to become the "this" pointer for a member
3358 function call. Take the address of the object. */
3360 static tree
3361 build_this (tree obj)
3363 /* In a template, we are only concerned about the type of the
3364 expression, so we can take a shortcut. */
3365 if (processing_template_decl)
3366 return build_address (obj);
3368 return cp_build_addr_expr (obj, tf_warning_or_error);
3371 /* Returns true iff functions are equivalent. Equivalent functions are
3372 not '==' only if one is a function-local extern function or if
3373 both are extern "C". */
3375 static inline int
3376 equal_functions (tree fn1, tree fn2)
3378 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3379 return 0;
3380 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3381 return fn1 == fn2;
3382 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3383 || DECL_EXTERN_C_FUNCTION_P (fn1))
3384 return decls_match (fn1, fn2);
3385 return fn1 == fn2;
3388 /* Print information about a candidate being rejected due to INFO. */
3390 static void
3391 print_conversion_rejection (location_t loc, struct conversion_info *info)
3393 tree from = info->from;
3394 if (!TYPE_P (from))
3395 from = lvalue_type (from);
3396 if (info->n_arg == -1)
3398 /* Conversion of implicit `this' argument failed. */
3399 if (!TYPE_P (info->from))
3400 /* A bad conversion for 'this' must be discarding cv-quals. */
3401 inform (loc, " passing %qT as %<this%> "
3402 "argument discards qualifiers",
3403 from);
3404 else
3405 inform (loc, " no known conversion for implicit "
3406 "%<this%> parameter from %qH to %qI",
3407 from, info->to_type);
3409 else if (!TYPE_P (info->from))
3411 if (info->n_arg >= 0)
3412 inform (loc, " conversion of argument %d would be ill-formed:",
3413 info->n_arg + 1);
3414 perform_implicit_conversion (info->to_type, info->from,
3415 tf_warning_or_error);
3417 else if (info->n_arg == -2)
3418 /* Conversion of conversion function return value failed. */
3419 inform (loc, " no known conversion from %qH to %qI",
3420 from, info->to_type);
3421 else
3422 inform (loc, " no known conversion for argument %d from %qH to %qI",
3423 info->n_arg + 1, from, info->to_type);
3426 /* Print information about a candidate with WANT parameters and we found
3427 HAVE. */
3429 static void
3430 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3432 inform_n (loc, want,
3433 " candidate expects %d argument, %d provided",
3434 " candidate expects %d arguments, %d provided",
3435 want, have);
3438 /* Print information about one overload candidate CANDIDATE. MSGSTR
3439 is the text to print before the candidate itself.
3441 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3442 to have been run through gettext by the caller. This wart makes
3443 life simpler in print_z_candidates and for the translators. */
3445 static void
3446 print_z_candidate (location_t loc, const char *msgstr,
3447 struct z_candidate *candidate)
3449 const char *msg = (msgstr == NULL
3450 ? ""
3451 : ACONCAT ((msgstr, " ", NULL)));
3452 tree fn = candidate->fn;
3453 if (flag_new_inheriting_ctors)
3454 fn = strip_inheriting_ctors (fn);
3455 location_t cloc = location_of (fn);
3457 if (identifier_p (fn))
3459 cloc = loc;
3460 if (candidate->num_convs == 3)
3461 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3462 candidate->convs[0]->type,
3463 candidate->convs[1]->type,
3464 candidate->convs[2]->type);
3465 else if (candidate->num_convs == 2)
3466 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3467 candidate->convs[0]->type,
3468 candidate->convs[1]->type);
3469 else
3470 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3471 candidate->convs[0]->type);
3473 else if (TYPE_P (fn))
3474 inform (cloc, "%s%qT <conversion>", msg, fn);
3475 else if (candidate->viable == -1)
3476 inform (cloc, "%s%#qD <near match>", msg, fn);
3477 else if (DECL_DELETED_FN (fn))
3478 inform (cloc, "%s%#qD <deleted>", msg, fn);
3479 else
3480 inform (cloc, "%s%#qD", msg, fn);
3481 if (fn != candidate->fn)
3483 cloc = location_of (candidate->fn);
3484 inform (cloc, " inherited here");
3486 /* Give the user some information about why this candidate failed. */
3487 if (candidate->reason != NULL)
3489 struct rejection_reason *r = candidate->reason;
3491 switch (r->code)
3493 case rr_arity:
3494 print_arity_information (cloc, r->u.arity.actual,
3495 r->u.arity.expected);
3496 break;
3497 case rr_arg_conversion:
3498 print_conversion_rejection (cloc, &r->u.conversion);
3499 break;
3500 case rr_bad_arg_conversion:
3501 print_conversion_rejection (cloc, &r->u.bad_conversion);
3502 break;
3503 case rr_explicit_conversion:
3504 inform (cloc, " return type %qT of explicit conversion function "
3505 "cannot be converted to %qT with a qualification "
3506 "conversion", r->u.conversion.from,
3507 r->u.conversion.to_type);
3508 break;
3509 case rr_template_conversion:
3510 inform (cloc, " conversion from return type %qT of template "
3511 "conversion function specialization to %qT is not an "
3512 "exact match", r->u.conversion.from,
3513 r->u.conversion.to_type);
3514 break;
3515 case rr_template_unification:
3516 /* We use template_unification_error_rejection if unification caused
3517 actual non-SFINAE errors, in which case we don't need to repeat
3518 them here. */
3519 if (r->u.template_unification.tmpl == NULL_TREE)
3521 inform (cloc, " substitution of deduced template arguments "
3522 "resulted in errors seen above");
3523 break;
3525 /* Re-run template unification with diagnostics. */
3526 inform (cloc, " template argument deduction/substitution failed:");
3527 fn_type_unification (r->u.template_unification.tmpl,
3528 r->u.template_unification.explicit_targs,
3529 (make_tree_vec
3530 (r->u.template_unification.num_targs)),
3531 r->u.template_unification.args,
3532 r->u.template_unification.nargs,
3533 r->u.template_unification.return_type,
3534 r->u.template_unification.strict,
3535 r->u.template_unification.flags,
3536 true, false);
3537 break;
3538 case rr_invalid_copy:
3539 inform (cloc,
3540 " a constructor taking a single argument of its own "
3541 "class type is invalid");
3542 break;
3543 case rr_constraint_failure:
3545 tree tmpl = r->u.template_instantiation.tmpl;
3546 tree args = r->u.template_instantiation.targs;
3547 diagnose_constraints (cloc, tmpl, args);
3549 break;
3550 case rr_inherited_ctor:
3551 inform (cloc, " an inherited constructor is not a candidate for "
3552 "initialization from an expression of the same or derived "
3553 "type");
3554 break;
3555 case rr_none:
3556 default:
3557 /* This candidate didn't have any issues or we failed to
3558 handle a particular code. Either way... */
3559 gcc_unreachable ();
3564 static void
3565 print_z_candidates (location_t loc, struct z_candidate *candidates)
3567 struct z_candidate *cand1;
3568 struct z_candidate **cand2;
3570 if (!candidates)
3571 return;
3573 /* Remove non-viable deleted candidates. */
3574 cand1 = candidates;
3575 for (cand2 = &cand1; *cand2; )
3577 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3578 && !(*cand2)->viable
3579 && DECL_DELETED_FN ((*cand2)->fn))
3580 *cand2 = (*cand2)->next;
3581 else
3582 cand2 = &(*cand2)->next;
3584 /* ...if there are any non-deleted ones. */
3585 if (cand1)
3586 candidates = cand1;
3588 /* There may be duplicates in the set of candidates. We put off
3589 checking this condition as long as possible, since we have no way
3590 to eliminate duplicates from a set of functions in less than n^2
3591 time. Now we are about to emit an error message, so it is more
3592 permissible to go slowly. */
3593 for (cand1 = candidates; cand1; cand1 = cand1->next)
3595 tree fn = cand1->fn;
3596 /* Skip builtin candidates and conversion functions. */
3597 if (!DECL_P (fn))
3598 continue;
3599 cand2 = &cand1->next;
3600 while (*cand2)
3602 if (DECL_P ((*cand2)->fn)
3603 && equal_functions (fn, (*cand2)->fn))
3604 *cand2 = (*cand2)->next;
3605 else
3606 cand2 = &(*cand2)->next;
3610 for (; candidates; candidates = candidates->next)
3611 print_z_candidate (loc, "candidate:", candidates);
3614 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3615 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3616 the result of the conversion function to convert it to the final
3617 desired type. Merge the two sequences into a single sequence,
3618 and return the merged sequence. */
3620 static conversion *
3621 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3623 conversion **t;
3624 bool bad = user_seq->bad_p;
3626 gcc_assert (user_seq->kind == ck_user);
3628 /* Find the end of the second conversion sequence. */
3629 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3631 /* The entire sequence is a user-conversion sequence. */
3632 (*t)->user_conv_p = true;
3633 if (bad)
3634 (*t)->bad_p = true;
3637 /* Replace the identity conversion with the user conversion
3638 sequence. */
3639 *t = user_seq;
3641 return std_seq;
3644 /* Handle overload resolution for initializing an object of class type from
3645 an initializer list. First we look for a suitable constructor that
3646 takes a std::initializer_list; if we don't find one, we then look for a
3647 non-list constructor.
3649 Parameters are as for add_candidates, except that the arguments are in
3650 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3651 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3653 static void
3654 add_list_candidates (tree fns, tree first_arg,
3655 const vec<tree, va_gc> *args, tree totype,
3656 tree explicit_targs, bool template_only,
3657 tree conversion_path, tree access_path,
3658 int flags,
3659 struct z_candidate **candidates,
3660 tsubst_flags_t complain)
3662 gcc_assert (*candidates == NULL);
3664 /* We're looking for a ctor for list-initialization. */
3665 flags |= LOOKUP_LIST_INIT_CTOR;
3666 /* And we don't allow narrowing conversions. We also use this flag to
3667 avoid the copy constructor call for copy-list-initialization. */
3668 flags |= LOOKUP_NO_NARROWING;
3670 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3671 tree init_list = (*args)[nart];
3673 /* Always use the default constructor if the list is empty (DR 990). */
3674 if (CONSTRUCTOR_NELTS (init_list) == 0
3675 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3677 /* If the class has a list ctor, try passing the list as a single
3678 argument first, but only consider list ctors. */
3679 else if (TYPE_HAS_LIST_CTOR (totype))
3681 flags |= LOOKUP_LIST_ONLY;
3682 add_candidates (fns, first_arg, args, NULL_TREE,
3683 explicit_targs, template_only, conversion_path,
3684 access_path, flags, candidates, complain);
3685 if (any_strictly_viable (*candidates))
3686 return;
3689 /* Expand the CONSTRUCTOR into a new argument vec. */
3690 vec<tree, va_gc> *new_args;
3691 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3692 for (unsigned i = 0; i < nart; ++i)
3693 new_args->quick_push ((*args)[i]);
3694 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3695 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3697 /* We aren't looking for list-ctors anymore. */
3698 flags &= ~LOOKUP_LIST_ONLY;
3699 /* We allow more user-defined conversions within an init-list. */
3700 flags &= ~LOOKUP_NO_CONVERSION;
3702 add_candidates (fns, first_arg, new_args, NULL_TREE,
3703 explicit_targs, template_only, conversion_path,
3704 access_path, flags, candidates, complain);
3707 /* Returns the best overload candidate to perform the requested
3708 conversion. This function is used for three the overloading situations
3709 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3710 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3711 per [dcl.init.ref], so we ignore temporary bindings. */
3713 static struct z_candidate *
3714 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3715 tsubst_flags_t complain)
3717 struct z_candidate *candidates, *cand;
3718 tree fromtype;
3719 tree ctors = NULL_TREE;
3720 tree conv_fns = NULL_TREE;
3721 conversion *conv = NULL;
3722 tree first_arg = NULL_TREE;
3723 vec<tree, va_gc> *args = NULL;
3724 bool any_viable_p;
3725 int convflags;
3727 if (!expr)
3728 return NULL;
3730 fromtype = TREE_TYPE (expr);
3732 /* We represent conversion within a hierarchy using RVALUE_CONV and
3733 BASE_CONV, as specified by [over.best.ics]; these become plain
3734 constructor calls, as specified in [dcl.init]. */
3735 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3736 || !DERIVED_FROM_P (totype, fromtype));
3738 if (CLASS_TYPE_P (totype))
3739 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3740 creating a garbage BASELINK; constructors can't be inherited. */
3741 ctors = get_class_binding (totype, complete_ctor_identifier);
3743 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3744 a single element. For now, let's handle constructors as before and also
3745 consider conversion operators from the element. */
3746 if (cxx_dialect >= cxx1z
3747 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3748 && CONSTRUCTOR_NELTS (expr) == 1)
3749 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3751 if (MAYBE_CLASS_TYPE_P (fromtype))
3753 tree to_nonref = non_reference (totype);
3754 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3755 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3756 && DERIVED_FROM_P (to_nonref, fromtype)))
3758 /* [class.conv.fct] A conversion function is never used to
3759 convert a (possibly cv-qualified) object to the (possibly
3760 cv-qualified) same object type (or a reference to it), to a
3761 (possibly cv-qualified) base class of that type (or a
3762 reference to it)... */
3764 else
3765 conv_fns = lookup_conversions (fromtype);
3768 candidates = 0;
3769 flags |= LOOKUP_NO_CONVERSION;
3770 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3771 flags |= LOOKUP_NO_NARROWING;
3773 /* It's OK to bind a temporary for converting constructor arguments, but
3774 not in converting the return value of a conversion operator. */
3775 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3776 | (flags & LOOKUP_NO_NARROWING));
3777 flags &= ~LOOKUP_NO_TEMP_BIND;
3779 if (ctors)
3781 int ctorflags = flags;
3783 first_arg = build_dummy_object (totype);
3785 /* We should never try to call the abstract or base constructor
3786 from here. */
3787 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3788 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3790 args = make_tree_vector_single (expr);
3791 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3793 /* List-initialization. */
3794 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3795 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3796 ctorflags, &candidates, complain);
3798 else
3800 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3801 TYPE_BINFO (totype), TYPE_BINFO (totype),
3802 ctorflags, &candidates, complain);
3805 for (cand = candidates; cand; cand = cand->next)
3807 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3809 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3810 set, then this is copy-initialization. In that case, "The
3811 result of the call is then used to direct-initialize the
3812 object that is the destination of the copy-initialization."
3813 [dcl.init]
3815 We represent this in the conversion sequence with an
3816 rvalue conversion, which means a constructor call. */
3817 if (TREE_CODE (totype) != REFERENCE_TYPE
3818 && !(convflags & LOOKUP_NO_TEMP_BIND))
3819 cand->second_conv
3820 = build_conv (ck_rvalue, totype, cand->second_conv);
3824 if (conv_fns)
3826 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3827 /* FIXME see above about C++17. */
3828 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3829 else
3830 first_arg = expr;
3833 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3835 tree conversion_path = TREE_PURPOSE (conv_fns);
3836 struct z_candidate *old_candidates;
3838 /* If we are called to convert to a reference type, we are trying to
3839 find a direct binding, so don't even consider temporaries. If
3840 we don't find a direct binding, the caller will try again to
3841 look for a temporary binding. */
3842 if (TREE_CODE (totype) == REFERENCE_TYPE)
3843 convflags |= LOOKUP_NO_TEMP_BIND;
3845 old_candidates = candidates;
3846 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3847 NULL_TREE, false,
3848 conversion_path, TYPE_BINFO (fromtype),
3849 flags, &candidates, complain);
3851 for (cand = candidates; cand != old_candidates; cand = cand->next)
3853 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3854 conversion *ics
3855 = implicit_conversion (totype,
3856 rettype,
3858 /*c_cast_p=*/false, convflags,
3859 complain);
3861 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3862 copy-initialization. In that case, "The result of the
3863 call is then used to direct-initialize the object that is
3864 the destination of the copy-initialization." [dcl.init]
3866 We represent this in the conversion sequence with an
3867 rvalue conversion, which means a constructor call. But
3868 don't add a second rvalue conversion if there's already
3869 one there. Which there really shouldn't be, but it's
3870 harmless since we'd add it here anyway. */
3871 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3872 && !(convflags & LOOKUP_NO_TEMP_BIND))
3873 ics = build_conv (ck_rvalue, totype, ics);
3875 cand->second_conv = ics;
3877 if (!ics)
3879 cand->viable = 0;
3880 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3881 rettype, totype);
3883 else if (DECL_NONCONVERTING_P (cand->fn)
3884 && ics->rank > cr_exact)
3886 /* 13.3.1.5: For direct-initialization, those explicit
3887 conversion functions that are not hidden within S and
3888 yield type T or a type that can be converted to type T
3889 with a qualification conversion (4.4) are also candidate
3890 functions. */
3891 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3892 I've raised this issue with the committee. --jason 9/2011 */
3893 cand->viable = -1;
3894 cand->reason = explicit_conversion_rejection (rettype, totype);
3896 else if (cand->viable == 1 && ics->bad_p)
3898 cand->viable = -1;
3899 cand->reason
3900 = bad_arg_conversion_rejection (NULL_TREE, -2,
3901 rettype, totype);
3903 else if (primary_template_instantiation_p (cand->fn)
3904 && ics->rank > cr_exact)
3906 /* 13.3.3.1.2: If the user-defined conversion is specified by
3907 a specialization of a conversion function template, the
3908 second standard conversion sequence shall have exact match
3909 rank. */
3910 cand->viable = -1;
3911 cand->reason = template_conversion_rejection (rettype, totype);
3916 candidates = splice_viable (candidates, false, &any_viable_p);
3917 if (!any_viable_p)
3919 if (args)
3920 release_tree_vector (args);
3921 return NULL;
3924 cand = tourney (candidates, complain);
3925 if (cand == 0)
3927 if (complain & tf_error)
3929 error ("conversion from %qH to %qI is ambiguous",
3930 fromtype, totype);
3931 print_z_candidates (location_of (expr), candidates);
3934 cand = candidates; /* any one will do */
3935 cand->second_conv = build_ambiguous_conv (totype, expr);
3936 cand->second_conv->user_conv_p = true;
3937 if (!any_strictly_viable (candidates))
3938 cand->second_conv->bad_p = true;
3939 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3940 ambiguous conversion is no worse than another user-defined
3941 conversion. */
3943 return cand;
3946 tree convtype;
3947 if (!DECL_CONSTRUCTOR_P (cand->fn))
3948 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3949 else if (cand->second_conv->kind == ck_rvalue)
3950 /* DR 5: [in the first step of copy-initialization]...if the function
3951 is a constructor, the call initializes a temporary of the
3952 cv-unqualified version of the destination type. */
3953 convtype = cv_unqualified (totype);
3954 else
3955 convtype = totype;
3956 /* Build the user conversion sequence. */
3957 conv = build_conv
3958 (ck_user,
3959 convtype,
3960 build_identity_conv (TREE_TYPE (expr), expr));
3961 conv->cand = cand;
3962 if (cand->viable == -1)
3963 conv->bad_p = true;
3965 /* Remember that this was a list-initialization. */
3966 if (flags & LOOKUP_NO_NARROWING)
3967 conv->check_narrowing = true;
3969 /* Combine it with the second conversion sequence. */
3970 cand->second_conv = merge_conversion_sequences (conv,
3971 cand->second_conv);
3973 return cand;
3976 /* Wrapper for above. */
3978 tree
3979 build_user_type_conversion (tree totype, tree expr, int flags,
3980 tsubst_flags_t complain)
3982 struct z_candidate *cand;
3983 tree ret;
3985 bool subtime = timevar_cond_start (TV_OVERLOAD);
3986 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3988 if (cand)
3990 if (cand->second_conv->kind == ck_ambig)
3991 ret = error_mark_node;
3992 else
3994 expr = convert_like (cand->second_conv, expr, complain);
3995 ret = convert_from_reference (expr);
3998 else
3999 ret = NULL_TREE;
4001 timevar_cond_stop (TV_OVERLOAD, subtime);
4002 return ret;
4005 /* Subroutine of convert_nontype_argument.
4007 EXPR is an expression used in a context that requires a converted
4008 constant-expression, such as a template non-type parameter. Do any
4009 necessary conversions (that are permitted for converted
4010 constant-expressions) to convert it to the desired type.
4012 If conversion is successful, returns the converted expression;
4013 otherwise, returns error_mark_node. */
4015 tree
4016 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4018 conversion *conv;
4019 void *p;
4020 tree t;
4021 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4023 if (error_operand_p (expr))
4024 return error_mark_node;
4026 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4027 p = conversion_obstack_alloc (0);
4029 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4030 /*c_cast_p=*/false,
4031 LOOKUP_IMPLICIT, complain);
4033 /* A converted constant expression of type T is an expression, implicitly
4034 converted to type T, where the converted expression is a constant
4035 expression and the implicit conversion sequence contains only
4037 * user-defined conversions,
4038 * lvalue-to-rvalue conversions (7.1),
4039 * array-to-pointer conversions (7.2),
4040 * function-to-pointer conversions (7.3),
4041 * qualification conversions (7.5),
4042 * integral promotions (7.6),
4043 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4044 * null pointer conversions (7.11) from std::nullptr_t,
4045 * null member pointer conversions (7.12) from std::nullptr_t, and
4046 * function pointer conversions (7.13),
4048 and where the reference binding (if any) binds directly. */
4050 for (conversion *c = conv;
4051 conv && c->kind != ck_identity;
4052 c = next_conversion (c))
4054 switch (c->kind)
4056 /* A conversion function is OK. If it isn't constexpr, we'll
4057 complain later that the argument isn't constant. */
4058 case ck_user:
4059 /* The lvalue-to-rvalue conversion is OK. */
4060 case ck_rvalue:
4061 /* Array-to-pointer and function-to-pointer. */
4062 case ck_lvalue:
4063 /* Function pointer conversions. */
4064 case ck_fnptr:
4065 /* Qualification conversions. */
4066 case ck_qual:
4067 break;
4069 case ck_ref_bind:
4070 if (c->need_temporary_p)
4072 if (complain & tf_error)
4073 error_at (loc, "initializing %qH with %qI in converted "
4074 "constant expression does not bind directly",
4075 type, next_conversion (c)->type);
4076 conv = NULL;
4078 break;
4080 case ck_base:
4081 case ck_pmem:
4082 case ck_ptr:
4083 case ck_std:
4084 t = next_conversion (c)->type;
4085 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4086 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4087 /* Integral promotion or conversion. */
4088 break;
4089 if (NULLPTR_TYPE_P (t))
4090 /* Conversion from nullptr to pointer or pointer-to-member. */
4091 break;
4093 if (complain & tf_error)
4094 error_at (loc, "conversion from %qH to %qI in a "
4095 "converted constant expression", t, type);
4096 /* fall through. */
4098 default:
4099 conv = NULL;
4100 break;
4104 /* Avoid confusing convert_nontype_argument by introducing
4105 a redundant conversion to the same reference type. */
4106 if (conv && conv->kind == ck_ref_bind
4107 && REFERENCE_REF_P (expr))
4109 tree ref = TREE_OPERAND (expr, 0);
4110 if (same_type_p (type, TREE_TYPE (ref)))
4111 return ref;
4114 if (conv)
4115 expr = convert_like (conv, expr, complain);
4116 else
4117 expr = error_mark_node;
4119 /* Free all the conversions we allocated. */
4120 obstack_free (&conversion_obstack, p);
4122 return expr;
4125 /* Do any initial processing on the arguments to a function call. */
4127 static vec<tree, va_gc> *
4128 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4130 unsigned int ix;
4131 tree arg;
4133 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4135 if (error_operand_p (arg))
4136 return NULL;
4137 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4139 if (complain & tf_error)
4140 error ("invalid use of void expression");
4141 return NULL;
4143 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4144 return NULL;
4146 return args;
4149 /* Perform overload resolution on FN, which is called with the ARGS.
4151 Return the candidate function selected by overload resolution, or
4152 NULL if the event that overload resolution failed. In the case
4153 that overload resolution fails, *CANDIDATES will be the set of
4154 candidates considered, and ANY_VIABLE_P will be set to true or
4155 false to indicate whether or not any of the candidates were
4156 viable.
4158 The ARGS should already have gone through RESOLVE_ARGS before this
4159 function is called. */
4161 static struct z_candidate *
4162 perform_overload_resolution (tree fn,
4163 const vec<tree, va_gc> *args,
4164 struct z_candidate **candidates,
4165 bool *any_viable_p, tsubst_flags_t complain)
4167 struct z_candidate *cand;
4168 tree explicit_targs;
4169 int template_only;
4171 bool subtime = timevar_cond_start (TV_OVERLOAD);
4173 explicit_targs = NULL_TREE;
4174 template_only = 0;
4176 *candidates = NULL;
4177 *any_viable_p = true;
4179 /* Check FN. */
4180 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4181 || TREE_CODE (fn) == TEMPLATE_DECL
4182 || TREE_CODE (fn) == OVERLOAD
4183 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4185 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4187 explicit_targs = TREE_OPERAND (fn, 1);
4188 fn = TREE_OPERAND (fn, 0);
4189 template_only = 1;
4192 /* Add the various candidate functions. */
4193 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4194 explicit_targs, template_only,
4195 /*conversion_path=*/NULL_TREE,
4196 /*access_path=*/NULL_TREE,
4197 LOOKUP_NORMAL,
4198 candidates, complain);
4200 *candidates = splice_viable (*candidates, false, any_viable_p);
4201 if (*any_viable_p)
4202 cand = tourney (*candidates, complain);
4203 else
4204 cand = NULL;
4206 timevar_cond_stop (TV_OVERLOAD, subtime);
4207 return cand;
4210 /* Print an error message about being unable to build a call to FN with
4211 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4212 be located; CANDIDATES is a possibly empty list of such
4213 functions. */
4215 static void
4216 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4217 struct z_candidate *candidates)
4219 tree targs = NULL_TREE;
4220 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4222 targs = TREE_OPERAND (fn, 1);
4223 fn = TREE_OPERAND (fn, 0);
4225 tree name = OVL_NAME (fn);
4226 location_t loc = location_of (name);
4227 if (targs)
4228 name = lookup_template_function (name, targs);
4230 if (!any_strictly_viable (candidates))
4231 error_at (loc, "no matching function for call to %<%D(%A)%>",
4232 name, build_tree_list_vec (args));
4233 else
4234 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4235 name, build_tree_list_vec (args));
4236 if (candidates)
4237 print_z_candidates (loc, candidates);
4240 /* Return an expression for a call to FN (a namespace-scope function,
4241 or a static member function) with the ARGS. This may change
4242 ARGS. */
4244 tree
4245 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4246 tsubst_flags_t complain)
4248 struct z_candidate *candidates, *cand;
4249 bool any_viable_p;
4250 void *p;
4251 tree result;
4253 if (args != NULL && *args != NULL)
4255 *args = resolve_args (*args, complain);
4256 if (*args == NULL)
4257 return error_mark_node;
4260 if (flag_tm)
4261 tm_malloc_replacement (fn);
4263 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4264 p = conversion_obstack_alloc (0);
4266 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4267 complain);
4269 if (!cand)
4271 if (complain & tf_error)
4273 // If there is a single (non-viable) function candidate,
4274 // let the error be diagnosed by cp_build_function_call_vec.
4275 if (!any_viable_p && candidates && ! candidates->next
4276 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4277 return cp_build_function_call_vec (candidates->fn, args, complain);
4279 // Otherwise, emit notes for non-viable candidates.
4280 print_error_for_call_failure (fn, *args, candidates);
4282 result = error_mark_node;
4284 else
4286 int flags = LOOKUP_NORMAL;
4287 /* If fn is template_id_expr, the call has explicit template arguments
4288 (e.g. func<int>(5)), communicate this info to build_over_call
4289 through flags so that later we can use it to decide whether to warn
4290 about peculiar null pointer conversion. */
4291 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4293 /* If overload resolution selects a specialization of a
4294 function concept for non-dependent template arguments,
4295 the expression is true if the constraints are satisfied
4296 and false otherwise.
4298 NOTE: This is an extension of Concepts Lite TS that
4299 allows constraints to be used in expressions. */
4300 if (flag_concepts && !processing_template_decl)
4302 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4303 tree targs = DECL_TI_ARGS (cand->fn);
4304 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4305 if (DECL_DECLARED_CONCEPT_P (decl))
4306 return evaluate_function_concept (decl, targs);
4309 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4312 result = build_over_call (cand, flags, complain);
4315 /* Free all the conversions we allocated. */
4316 obstack_free (&conversion_obstack, p);
4318 return result;
4321 /* Build a call to a global operator new. FNNAME is the name of the
4322 operator (either "operator new" or "operator new[]") and ARGS are
4323 the arguments provided. This may change ARGS. *SIZE points to the
4324 total number of bytes required by the allocation, and is updated if
4325 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4326 be used. If this function determines that no cookie should be
4327 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4328 is not NULL_TREE, it is evaluated before calculating the final
4329 array size, and if it fails, the array size is replaced with
4330 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4331 is non-NULL, it will be set, upon return, to the allocation
4332 function called. */
4334 tree
4335 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4336 tree *size, tree *cookie_size,
4337 tree align_arg, tree size_check,
4338 tree *fn, tsubst_flags_t complain)
4340 tree original_size = *size;
4341 tree fns;
4342 struct z_candidate *candidates;
4343 struct z_candidate *cand = NULL;
4344 bool any_viable_p;
4346 if (fn)
4347 *fn = NULL_TREE;
4348 /* Set to (size_t)-1 if the size check fails. */
4349 if (size_check != NULL_TREE)
4351 tree errval = TYPE_MAX_VALUE (sizetype);
4352 if (cxx_dialect >= cxx11 && flag_exceptions)
4353 errval = throw_bad_array_new_length ();
4354 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4355 original_size, errval);
4357 vec_safe_insert (*args, 0, *size);
4358 *args = resolve_args (*args, complain);
4359 if (*args == NULL)
4360 return error_mark_node;
4362 /* Based on:
4364 [expr.new]
4366 If this lookup fails to find the name, or if the allocated type
4367 is not a class type, the allocation function's name is looked
4368 up in the global scope.
4370 we disregard block-scope declarations of "operator new". */
4371 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4372 fns = lookup_arg_dependent (fnname, fns, *args);
4374 if (align_arg)
4376 vec<tree, va_gc>* align_args
4377 = vec_copy_and_insert (*args, align_arg, 1);
4378 cand = perform_overload_resolution (fns, align_args, &candidates,
4379 &any_viable_p, tf_none);
4380 /* If no aligned allocation function matches, try again without the
4381 alignment. */
4384 /* Figure out what function is being called. */
4385 if (!cand)
4386 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4387 complain);
4389 /* If no suitable function could be found, issue an error message
4390 and give up. */
4391 if (!cand)
4393 if (complain & tf_error)
4394 print_error_for_call_failure (fns, *args, candidates);
4395 return error_mark_node;
4398 /* If a cookie is required, add some extra space. Whether
4399 or not a cookie is required cannot be determined until
4400 after we know which function was called. */
4401 if (*cookie_size)
4403 bool use_cookie = true;
4404 tree arg_types;
4406 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4407 /* Skip the size_t parameter. */
4408 arg_types = TREE_CHAIN (arg_types);
4409 /* Check the remaining parameters (if any). */
4410 if (arg_types
4411 && TREE_CHAIN (arg_types) == void_list_node
4412 && same_type_p (TREE_VALUE (arg_types),
4413 ptr_type_node))
4414 use_cookie = false;
4415 /* If we need a cookie, adjust the number of bytes allocated. */
4416 if (use_cookie)
4418 /* Update the total size. */
4419 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4420 if (size_check)
4422 /* Set to (size_t)-1 if the size check fails. */
4423 gcc_assert (size_check != NULL_TREE);
4424 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4425 *size, TYPE_MAX_VALUE (sizetype));
4427 /* Update the argument list to reflect the adjusted size. */
4428 (**args)[0] = *size;
4430 else
4431 *cookie_size = NULL_TREE;
4434 /* Tell our caller which function we decided to call. */
4435 if (fn)
4436 *fn = cand->fn;
4438 /* Build the CALL_EXPR. */
4439 return build_over_call (cand, LOOKUP_NORMAL, complain);
4442 /* Build a new call to operator(). This may change ARGS. */
4444 static tree
4445 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4447 struct z_candidate *candidates = 0, *cand;
4448 tree fns, convs, first_mem_arg = NULL_TREE;
4449 tree type = TREE_TYPE (obj);
4450 bool any_viable_p;
4451 tree result = NULL_TREE;
4452 void *p;
4454 if (error_operand_p (obj))
4455 return error_mark_node;
4457 obj = prep_operand (obj);
4459 if (TYPE_PTRMEMFUNC_P (type))
4461 if (complain & tf_error)
4462 /* It's no good looking for an overloaded operator() on a
4463 pointer-to-member-function. */
4464 error ("pointer-to-member function %qE cannot be called without "
4465 "an object; consider using %<.*%> or %<->*%>", obj);
4466 return error_mark_node;
4469 if (TYPE_BINFO (type))
4471 fns = lookup_fnfields (TYPE_BINFO (type), cp_operator_id (CALL_EXPR), 1);
4472 if (fns == error_mark_node)
4473 return error_mark_node;
4475 else
4476 fns = NULL_TREE;
4478 if (args != NULL && *args != NULL)
4480 *args = resolve_args (*args, complain);
4481 if (*args == NULL)
4482 return error_mark_node;
4485 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4486 p = conversion_obstack_alloc (0);
4488 if (fns)
4490 first_mem_arg = obj;
4492 add_candidates (BASELINK_FUNCTIONS (fns),
4493 first_mem_arg, *args, NULL_TREE,
4494 NULL_TREE, false,
4495 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4496 LOOKUP_NORMAL, &candidates, complain);
4499 convs = lookup_conversions (type);
4501 for (; convs; convs = TREE_CHAIN (convs))
4503 tree totype = TREE_TYPE (convs);
4505 if (TYPE_PTRFN_P (totype)
4506 || TYPE_REFFN_P (totype)
4507 || (TREE_CODE (totype) == REFERENCE_TYPE
4508 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4509 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4511 tree fn = *iter;
4513 if (DECL_NONCONVERTING_P (fn))
4514 continue;
4516 if (TREE_CODE (fn) == TEMPLATE_DECL)
4517 add_template_conv_candidate
4518 (&candidates, fn, obj, *args, totype,
4519 /*access_path=*/NULL_TREE,
4520 /*conversion_path=*/NULL_TREE, complain);
4521 else
4522 add_conv_candidate (&candidates, fn, obj,
4523 *args, /*conversion_path=*/NULL_TREE,
4524 /*access_path=*/NULL_TREE, complain);
4528 /* Be strict here because if we choose a bad conversion candidate, the
4529 errors we get won't mention the call context. */
4530 candidates = splice_viable (candidates, true, &any_viable_p);
4531 if (!any_viable_p)
4533 if (complain & tf_error)
4535 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4536 build_tree_list_vec (*args));
4537 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4539 result = error_mark_node;
4541 else
4543 cand = tourney (candidates, complain);
4544 if (cand == 0)
4546 if (complain & tf_error)
4548 error ("call of %<(%T) (%A)%> is ambiguous",
4549 TREE_TYPE (obj), build_tree_list_vec (*args));
4550 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4552 result = error_mark_node;
4554 /* Since cand->fn will be a type, not a function, for a conversion
4555 function, we must be careful not to unconditionally look at
4556 DECL_NAME here. */
4557 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4558 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4559 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4560 else
4562 if (DECL_P (cand->fn))
4563 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4564 -1, complain);
4565 else
4566 obj = convert_like (cand->convs[0], obj, complain);
4567 obj = convert_from_reference (obj);
4568 result = cp_build_function_call_vec (obj, args, complain);
4572 /* Free all the conversions we allocated. */
4573 obstack_free (&conversion_obstack, p);
4575 return result;
4578 /* Wrapper for above. */
4580 tree
4581 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4583 tree ret;
4584 bool subtime = timevar_cond_start (TV_OVERLOAD);
4585 ret = build_op_call_1 (obj, args, complain);
4586 timevar_cond_stop (TV_OVERLOAD, subtime);
4587 return ret;
4590 /* Called by op_error to prepare format strings suitable for the error
4591 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4592 and a suffix (controlled by NTYPES). */
4594 static const char *
4595 op_error_string (const char *errmsg, int ntypes, bool match)
4597 const char *msg;
4599 const char *msgp = concat (match ? G_("ambiguous overload for ")
4600 : G_("no match for "), errmsg, NULL);
4602 if (ntypes == 3)
4603 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4604 else if (ntypes == 2)
4605 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4606 else
4607 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4609 return msg;
4612 static void
4613 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4614 tree arg1, tree arg2, tree arg3, bool match)
4616 const char *opname;
4618 if (code == MODIFY_EXPR)
4619 opname = assignment_operator_name_info[code2].name;
4620 else
4621 opname = operator_name_info[code].name;
4623 switch (code)
4625 case COND_EXPR:
4626 if (flag_diagnostics_show_caret)
4627 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4628 3, match),
4629 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4630 else
4631 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4632 "in %<%E ? %E : %E%>"), 3, match),
4633 arg1, arg2, arg3,
4634 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4635 break;
4637 case POSTINCREMENT_EXPR:
4638 case POSTDECREMENT_EXPR:
4639 if (flag_diagnostics_show_caret)
4640 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4641 opname, TREE_TYPE (arg1));
4642 else
4643 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4644 1, match),
4645 opname, arg1, opname, TREE_TYPE (arg1));
4646 break;
4648 case ARRAY_REF:
4649 if (flag_diagnostics_show_caret)
4650 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4651 TREE_TYPE (arg1), TREE_TYPE (arg2));
4652 else
4653 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4654 2, match),
4655 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4656 break;
4658 case REALPART_EXPR:
4659 case IMAGPART_EXPR:
4660 if (flag_diagnostics_show_caret)
4661 error_at (loc, op_error_string (G_("%qs"), 1, match),
4662 opname, TREE_TYPE (arg1));
4663 else
4664 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4665 opname, opname, arg1, TREE_TYPE (arg1));
4666 break;
4668 default:
4669 if (arg2)
4670 if (flag_diagnostics_show_caret)
4671 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4672 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4673 else
4674 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4675 2, match),
4676 opname, arg1, opname, arg2,
4677 TREE_TYPE (arg1), TREE_TYPE (arg2));
4678 else
4679 if (flag_diagnostics_show_caret)
4680 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4681 opname, TREE_TYPE (arg1));
4682 else
4683 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4684 1, match),
4685 opname, opname, arg1, TREE_TYPE (arg1));
4686 break;
4690 /* Return the implicit conversion sequence that could be used to
4691 convert E1 to E2 in [expr.cond]. */
4693 static conversion *
4694 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4696 tree t1 = non_reference (TREE_TYPE (e1));
4697 tree t2 = non_reference (TREE_TYPE (e2));
4698 conversion *conv;
4699 bool good_base;
4701 /* [expr.cond]
4703 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4704 implicitly converted (clause _conv_) to the type "lvalue reference to
4705 T2", subject to the constraint that in the conversion the
4706 reference must bind directly (_dcl.init.ref_) to an lvalue.
4708 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4709 implicitly converted to the type "rvalue reference to T2", subject to
4710 the constraint that the reference must bind directly. */
4711 if (glvalue_p (e2))
4713 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4714 conv = implicit_conversion (rtype,
4717 /*c_cast_p=*/false,
4718 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4719 |LOOKUP_ONLYCONVERTING,
4720 complain);
4721 if (conv && !conv->bad_p)
4722 return conv;
4725 /* If E2 is a prvalue or if neither of the conversions above can be done
4726 and at least one of the operands has (possibly cv-qualified) class
4727 type: */
4728 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4729 return NULL;
4731 /* [expr.cond]
4733 If E1 and E2 have class type, and the underlying class types are
4734 the same or one is a base class of the other: E1 can be converted
4735 to match E2 if the class of T2 is the same type as, or a base
4736 class of, the class of T1, and the cv-qualification of T2 is the
4737 same cv-qualification as, or a greater cv-qualification than, the
4738 cv-qualification of T1. If the conversion is applied, E1 is
4739 changed to an rvalue of type T2 that still refers to the original
4740 source class object (or the appropriate subobject thereof). */
4741 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4742 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4744 if (good_base && at_least_as_qualified_p (t2, t1))
4746 conv = build_identity_conv (t1, e1);
4747 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4748 TYPE_MAIN_VARIANT (t2)))
4749 conv = build_conv (ck_base, t2, conv);
4750 else
4751 conv = build_conv (ck_rvalue, t2, conv);
4752 return conv;
4754 else
4755 return NULL;
4757 else
4758 /* [expr.cond]
4760 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4761 converted to the type that expression E2 would have if E2 were
4762 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4763 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4764 LOOKUP_IMPLICIT, complain);
4767 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4768 arguments to the conditional expression. */
4770 static tree
4771 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4772 tsubst_flags_t complain)
4774 tree arg2_type;
4775 tree arg3_type;
4776 tree result = NULL_TREE;
4777 tree result_type = NULL_TREE;
4778 bool is_lvalue = true;
4779 struct z_candidate *candidates = 0;
4780 struct z_candidate *cand;
4781 void *p;
4782 tree orig_arg2, orig_arg3;
4784 /* As a G++ extension, the second argument to the conditional can be
4785 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4786 c'.) If the second operand is omitted, make sure it is
4787 calculated only once. */
4788 if (!arg2)
4790 if (complain & tf_error)
4791 pedwarn (loc, OPT_Wpedantic,
4792 "ISO C++ forbids omitting the middle term of a ?: expression");
4794 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4795 warn_for_omitted_condop (loc, arg1);
4797 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4798 if (lvalue_p (arg1))
4799 arg2 = arg1 = cp_stabilize_reference (arg1);
4800 else
4801 arg2 = arg1 = save_expr (arg1);
4804 /* If something has already gone wrong, just pass that fact up the
4805 tree. */
4806 if (error_operand_p (arg1)
4807 || error_operand_p (arg2)
4808 || error_operand_p (arg3))
4809 return error_mark_node;
4811 orig_arg2 = arg2;
4812 orig_arg3 = arg3;
4814 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4816 tree arg1_type = TREE_TYPE (arg1);
4818 /* If arg1 is another cond_expr choosing between -1 and 0,
4819 then we can use its comparison. It may help to avoid
4820 additional comparison, produce more accurate diagnostics
4821 and enables folding. */
4822 if (TREE_CODE (arg1) == VEC_COND_EXPR
4823 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4824 && integer_zerop (TREE_OPERAND (arg1, 2)))
4825 arg1 = TREE_OPERAND (arg1, 0);
4827 arg1 = force_rvalue (arg1, complain);
4828 arg2 = force_rvalue (arg2, complain);
4829 arg3 = force_rvalue (arg3, complain);
4831 /* force_rvalue can return error_mark on valid arguments. */
4832 if (error_operand_p (arg1)
4833 || error_operand_p (arg2)
4834 || error_operand_p (arg3))
4835 return error_mark_node;
4837 arg2_type = TREE_TYPE (arg2);
4838 arg3_type = TREE_TYPE (arg3);
4840 if (!VECTOR_TYPE_P (arg2_type)
4841 && !VECTOR_TYPE_P (arg3_type))
4843 /* Rely on the error messages of the scalar version. */
4844 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4845 orig_arg2, orig_arg3, complain);
4846 if (scal == error_mark_node)
4847 return error_mark_node;
4848 tree stype = TREE_TYPE (scal);
4849 tree ctype = TREE_TYPE (arg1_type);
4850 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4851 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4853 if (complain & tf_error)
4854 error_at (loc, "inferred scalar type %qT is not an integer or "
4855 "floating point type of the same size as %qT", stype,
4856 COMPARISON_CLASS_P (arg1)
4857 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4858 : ctype);
4859 return error_mark_node;
4862 tree vtype = build_opaque_vector_type (stype,
4863 TYPE_VECTOR_SUBPARTS (arg1_type));
4864 /* We could pass complain & tf_warning to unsafe_conversion_p,
4865 but the warnings (like Wsign-conversion) have already been
4866 given by the scalar build_conditional_expr_1. We still check
4867 unsafe_conversion_p to forbid truncating long long -> float. */
4868 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4870 if (complain & tf_error)
4871 error_at (loc, "conversion of scalar %qH to vector %qI "
4872 "involves truncation", arg2_type, vtype);
4873 return error_mark_node;
4875 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4877 if (complain & tf_error)
4878 error_at (loc, "conversion of scalar %qH to vector %qI "
4879 "involves truncation", arg3_type, vtype);
4880 return error_mark_node;
4883 arg2 = cp_convert (stype, arg2, complain);
4884 arg2 = save_expr (arg2);
4885 arg2 = build_vector_from_val (vtype, arg2);
4886 arg2_type = vtype;
4887 arg3 = cp_convert (stype, arg3, complain);
4888 arg3 = save_expr (arg3);
4889 arg3 = build_vector_from_val (vtype, arg3);
4890 arg3_type = vtype;
4893 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4895 enum stv_conv convert_flag =
4896 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4897 complain & tf_error);
4899 switch (convert_flag)
4901 case stv_error:
4902 return error_mark_node;
4903 case stv_firstarg:
4905 arg2 = save_expr (arg2);
4906 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4907 arg2 = build_vector_from_val (arg3_type, arg2);
4908 arg2_type = TREE_TYPE (arg2);
4909 break;
4911 case stv_secondarg:
4913 arg3 = save_expr (arg3);
4914 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4915 arg3 = build_vector_from_val (arg2_type, arg3);
4916 arg3_type = TREE_TYPE (arg3);
4917 break;
4919 default:
4920 break;
4924 if (!same_type_p (arg2_type, arg3_type)
4925 || TYPE_VECTOR_SUBPARTS (arg1_type)
4926 != TYPE_VECTOR_SUBPARTS (arg2_type)
4927 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4929 if (complain & tf_error)
4930 error_at (loc,
4931 "incompatible vector types in conditional expression: "
4932 "%qT, %qT and %qT", TREE_TYPE (arg1),
4933 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4934 return error_mark_node;
4937 if (!COMPARISON_CLASS_P (arg1))
4939 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4940 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4942 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4945 /* [expr.cond]
4947 The first expression is implicitly converted to bool (clause
4948 _conv_). */
4949 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4950 LOOKUP_NORMAL);
4951 if (error_operand_p (arg1))
4952 return error_mark_node;
4954 /* [expr.cond]
4956 If either the second or the third operand has type (possibly
4957 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4958 array-to-pointer (_conv.array_), and function-to-pointer
4959 (_conv.func_) standard conversions are performed on the second
4960 and third operands. */
4961 arg2_type = unlowered_expr_type (arg2);
4962 arg3_type = unlowered_expr_type (arg3);
4963 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4965 /* Do the conversions. We don't these for `void' type arguments
4966 since it can't have any effect and since decay_conversion
4967 does not handle that case gracefully. */
4968 if (!VOID_TYPE_P (arg2_type))
4969 arg2 = decay_conversion (arg2, complain);
4970 if (!VOID_TYPE_P (arg3_type))
4971 arg3 = decay_conversion (arg3, complain);
4972 arg2_type = TREE_TYPE (arg2);
4973 arg3_type = TREE_TYPE (arg3);
4975 /* [expr.cond]
4977 One of the following shall hold:
4979 --The second or the third operand (but not both) is a
4980 throw-expression (_except.throw_); the result is of the
4981 type of the other and is an rvalue.
4983 --Both the second and the third operands have type void; the
4984 result is of type void and is an rvalue.
4986 We must avoid calling force_rvalue for expressions of type
4987 "void" because it will complain that their value is being
4988 used. */
4989 if (TREE_CODE (arg2) == THROW_EXPR
4990 && TREE_CODE (arg3) != THROW_EXPR)
4992 if (!VOID_TYPE_P (arg3_type))
4994 arg3 = force_rvalue (arg3, complain);
4995 if (arg3 == error_mark_node)
4996 return error_mark_node;
4998 arg3_type = TREE_TYPE (arg3);
4999 result_type = arg3_type;
5001 else if (TREE_CODE (arg2) != THROW_EXPR
5002 && TREE_CODE (arg3) == THROW_EXPR)
5004 if (!VOID_TYPE_P (arg2_type))
5006 arg2 = force_rvalue (arg2, complain);
5007 if (arg2 == error_mark_node)
5008 return error_mark_node;
5010 arg2_type = TREE_TYPE (arg2);
5011 result_type = arg2_type;
5013 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5014 result_type = void_type_node;
5015 else
5017 if (complain & tf_error)
5019 if (VOID_TYPE_P (arg2_type))
5020 error_at (EXPR_LOC_OR_LOC (arg3, loc),
5021 "second operand to the conditional operator "
5022 "is of type %<void%>, but the third operand is "
5023 "neither a throw-expression nor of type %<void%>");
5024 else
5025 error_at (EXPR_LOC_OR_LOC (arg2, loc),
5026 "third operand to the conditional operator "
5027 "is of type %<void%>, but the second operand is "
5028 "neither a throw-expression nor of type %<void%>");
5030 return error_mark_node;
5033 is_lvalue = false;
5034 goto valid_operands;
5036 /* [expr.cond]
5038 Otherwise, if the second and third operand have different types,
5039 and either has (possibly cv-qualified) class type, or if both are
5040 glvalues of the same value category and the same type except for
5041 cv-qualification, an attempt is made to convert each of those operands
5042 to the type of the other. */
5043 else if (!same_type_p (arg2_type, arg3_type)
5044 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5045 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5046 arg3_type)
5047 && glvalue_p (arg2) && glvalue_p (arg3)
5048 && lvalue_p (arg2) == lvalue_p (arg3))))
5050 conversion *conv2;
5051 conversion *conv3;
5052 bool converted = false;
5054 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5055 p = conversion_obstack_alloc (0);
5057 conv2 = conditional_conversion (arg2, arg3, complain);
5058 conv3 = conditional_conversion (arg3, arg2, complain);
5060 /* [expr.cond]
5062 If both can be converted, or one can be converted but the
5063 conversion is ambiguous, the program is ill-formed. If
5064 neither can be converted, the operands are left unchanged and
5065 further checking is performed as described below. If exactly
5066 one conversion is possible, that conversion is applied to the
5067 chosen operand and the converted operand is used in place of
5068 the original operand for the remainder of this section. */
5069 if ((conv2 && !conv2->bad_p
5070 && conv3 && !conv3->bad_p)
5071 || (conv2 && conv2->kind == ck_ambig)
5072 || (conv3 && conv3->kind == ck_ambig))
5074 if (complain & tf_error)
5076 error_at (loc, "operands to ?: have different types %qT and %qT",
5077 arg2_type, arg3_type);
5078 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5079 inform (loc, " and each type can be converted to the other");
5080 else if (conv2 && conv2->kind == ck_ambig)
5081 convert_like (conv2, arg2, complain);
5082 else
5083 convert_like (conv3, arg3, complain);
5085 result = error_mark_node;
5087 else if (conv2 && !conv2->bad_p)
5089 arg2 = convert_like (conv2, arg2, complain);
5090 arg2 = convert_from_reference (arg2);
5091 arg2_type = TREE_TYPE (arg2);
5092 /* Even if CONV2 is a valid conversion, the result of the
5093 conversion may be invalid. For example, if ARG3 has type
5094 "volatile X", and X does not have a copy constructor
5095 accepting a "volatile X&", then even if ARG2 can be
5096 converted to X, the conversion will fail. */
5097 if (error_operand_p (arg2))
5098 result = error_mark_node;
5099 converted = true;
5101 else if (conv3 && !conv3->bad_p)
5103 arg3 = convert_like (conv3, arg3, complain);
5104 arg3 = convert_from_reference (arg3);
5105 arg3_type = TREE_TYPE (arg3);
5106 if (error_operand_p (arg3))
5107 result = error_mark_node;
5108 converted = true;
5111 /* Free all the conversions we allocated. */
5112 obstack_free (&conversion_obstack, p);
5114 if (result)
5115 return result;
5117 /* If, after the conversion, both operands have class type,
5118 treat the cv-qualification of both operands as if it were the
5119 union of the cv-qualification of the operands.
5121 The standard is not clear about what to do in this
5122 circumstance. For example, if the first operand has type
5123 "const X" and the second operand has a user-defined
5124 conversion to "volatile X", what is the type of the second
5125 operand after this step? Making it be "const X" (matching
5126 the first operand) seems wrong, as that discards the
5127 qualification without actually performing a copy. Leaving it
5128 as "volatile X" seems wrong as that will result in the
5129 conditional expression failing altogether, even though,
5130 according to this step, the one operand could be converted to
5131 the type of the other. */
5132 if (converted
5133 && CLASS_TYPE_P (arg2_type)
5134 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5135 arg2_type = arg3_type =
5136 cp_build_qualified_type (arg2_type,
5137 cp_type_quals (arg2_type)
5138 | cp_type_quals (arg3_type));
5141 /* [expr.cond]
5143 If the second and third operands are glvalues of the same value
5144 category and have the same type, the result is of that type and
5145 value category. */
5146 if (((lvalue_p (arg2) && lvalue_p (arg3))
5147 || (xvalue_p (arg2) && xvalue_p (arg3)))
5148 && same_type_p (arg2_type, arg3_type))
5150 result_type = arg2_type;
5151 arg2 = mark_lvalue_use (arg2);
5152 arg3 = mark_lvalue_use (arg3);
5153 goto valid_operands;
5156 /* [expr.cond]
5158 Otherwise, the result is an rvalue. If the second and third
5159 operand do not have the same type, and either has (possibly
5160 cv-qualified) class type, overload resolution is used to
5161 determine the conversions (if any) to be applied to the operands
5162 (_over.match.oper_, _over.built_). */
5163 is_lvalue = false;
5164 if (!same_type_p (arg2_type, arg3_type)
5165 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5167 tree args[3];
5168 conversion *conv;
5169 bool any_viable_p;
5171 /* Rearrange the arguments so that add_builtin_candidate only has
5172 to know about two args. In build_builtin_candidate, the
5173 arguments are unscrambled. */
5174 args[0] = arg2;
5175 args[1] = arg3;
5176 args[2] = arg1;
5177 add_builtin_candidates (&candidates,
5178 COND_EXPR,
5179 NOP_EXPR,
5180 cp_operator_id (COND_EXPR),
5181 args,
5182 LOOKUP_NORMAL, complain);
5184 /* [expr.cond]
5186 If the overload resolution fails, the program is
5187 ill-formed. */
5188 candidates = splice_viable (candidates, false, &any_viable_p);
5189 if (!any_viable_p)
5191 if (complain & tf_error)
5192 error_at (loc, "operands to ?: have different types %qT and %qT",
5193 arg2_type, arg3_type);
5194 return error_mark_node;
5196 cand = tourney (candidates, complain);
5197 if (!cand)
5199 if (complain & tf_error)
5201 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5202 print_z_candidates (loc, candidates);
5204 return error_mark_node;
5207 /* [expr.cond]
5209 Otherwise, the conversions thus determined are applied, and
5210 the converted operands are used in place of the original
5211 operands for the remainder of this section. */
5212 conv = cand->convs[0];
5213 arg1 = convert_like (conv, arg1, complain);
5214 conv = cand->convs[1];
5215 arg2 = convert_like (conv, arg2, complain);
5216 arg2_type = TREE_TYPE (arg2);
5217 conv = cand->convs[2];
5218 arg3 = convert_like (conv, arg3, complain);
5219 arg3_type = TREE_TYPE (arg3);
5222 /* [expr.cond]
5224 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5225 and function-to-pointer (_conv.func_) standard conversions are
5226 performed on the second and third operands.
5228 We need to force the lvalue-to-rvalue conversion here for class types,
5229 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5230 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5231 regions. */
5233 arg2 = force_rvalue (arg2, complain);
5234 if (!CLASS_TYPE_P (arg2_type))
5235 arg2_type = TREE_TYPE (arg2);
5237 arg3 = force_rvalue (arg3, complain);
5238 if (!CLASS_TYPE_P (arg3_type))
5239 arg3_type = TREE_TYPE (arg3);
5241 if (arg2 == error_mark_node || arg3 == error_mark_node)
5242 return error_mark_node;
5244 /* [expr.cond]
5246 After those conversions, one of the following shall hold:
5248 --The second and third operands have the same type; the result is of
5249 that type. */
5250 if (same_type_p (arg2_type, arg3_type))
5251 result_type = arg2_type;
5252 /* [expr.cond]
5254 --The second and third operands have arithmetic or enumeration
5255 type; the usual arithmetic conversions are performed to bring
5256 them to a common type, and the result is of that type. */
5257 else if ((ARITHMETIC_TYPE_P (arg2_type)
5258 || UNSCOPED_ENUM_P (arg2_type))
5259 && (ARITHMETIC_TYPE_P (arg3_type)
5260 || UNSCOPED_ENUM_P (arg3_type)))
5262 /* In this case, there is always a common type. */
5263 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5264 arg3_type);
5265 if (complain & tf_warning)
5266 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5267 "implicit conversion from %qH to %qI to "
5268 "match other result of conditional",
5269 loc);
5271 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5272 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5274 if (TREE_CODE (orig_arg2) == CONST_DECL
5275 && TREE_CODE (orig_arg3) == CONST_DECL
5276 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5277 /* Two enumerators from the same enumeration can have different
5278 types when the enumeration is still being defined. */;
5279 else if (complain & tf_warning)
5280 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5281 "conditional expression: %qT vs %qT",
5282 arg2_type, arg3_type);
5284 else if (extra_warnings
5285 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5286 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5287 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5288 && !same_type_p (arg2_type,
5289 type_promotes_to (arg3_type)))))
5291 if (complain & tf_warning)
5292 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5293 "conditional expression");
5296 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5297 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5299 /* [expr.cond]
5301 --The second and third operands have pointer type, or one has
5302 pointer type and the other is a null pointer constant; pointer
5303 conversions (_conv.ptr_) and qualification conversions
5304 (_conv.qual_) are performed to bring them to their composite
5305 pointer type (_expr.rel_). The result is of the composite
5306 pointer type.
5308 --The second and third operands have pointer to member type, or
5309 one has pointer to member type and the other is a null pointer
5310 constant; pointer to member conversions (_conv.mem_) and
5311 qualification conversions (_conv.qual_) are performed to bring
5312 them to a common type, whose cv-qualification shall match the
5313 cv-qualification of either the second or the third operand.
5314 The result is of the common type. */
5315 else if ((null_ptr_cst_p (arg2)
5316 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5317 || (null_ptr_cst_p (arg3)
5318 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5319 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5320 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5321 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5323 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5324 arg3, CPO_CONDITIONAL_EXPR,
5325 complain);
5326 if (result_type == error_mark_node)
5327 return error_mark_node;
5328 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5329 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5332 if (!result_type)
5334 if (complain & tf_error)
5335 error_at (loc, "operands to ?: have different types %qT and %qT",
5336 arg2_type, arg3_type);
5337 return error_mark_node;
5340 if (arg2 == error_mark_node || arg3 == error_mark_node)
5341 return error_mark_node;
5343 valid_operands:
5344 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5346 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5347 warn here, because the COND_EXPR will be turned into ARG2. */
5348 if (warn_duplicated_branches
5349 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5350 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5351 "this condition has identical branches");
5353 /* We can't use result_type below, as fold might have returned a
5354 throw_expr. */
5356 if (!is_lvalue)
5358 /* Expand both sides into the same slot, hopefully the target of
5359 the ?: expression. We used to check for TARGET_EXPRs here,
5360 but now we sometimes wrap them in NOP_EXPRs so the test would
5361 fail. */
5362 if (CLASS_TYPE_P (TREE_TYPE (result)))
5363 result = get_target_expr_sfinae (result, complain);
5364 /* If this expression is an rvalue, but might be mistaken for an
5365 lvalue, we must add a NON_LVALUE_EXPR. */
5366 result = rvalue (result);
5368 else
5369 result = force_paren_expr (result);
5371 return result;
5374 /* Wrapper for above. */
5376 tree
5377 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5378 tsubst_flags_t complain)
5380 tree ret;
5381 bool subtime = timevar_cond_start (TV_OVERLOAD);
5382 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5383 timevar_cond_stop (TV_OVERLOAD, subtime);
5384 return ret;
5387 /* OPERAND is an operand to an expression. Perform necessary steps
5388 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5389 returned. */
5391 static tree
5392 prep_operand (tree operand)
5394 if (operand)
5396 if (CLASS_TYPE_P (TREE_TYPE (operand))
5397 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5398 /* Make sure the template type is instantiated now. */
5399 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5402 return operand;
5405 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5406 OVERLOAD) to the CANDIDATES, returning an updated list of
5407 CANDIDATES. The ARGS are the arguments provided to the call;
5408 if FIRST_ARG is non-null it is the implicit object argument,
5409 otherwise the first element of ARGS is used if needed. The
5410 EXPLICIT_TARGS are explicit template arguments provided.
5411 TEMPLATE_ONLY is true if only template functions should be
5412 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5413 add_function_candidate. */
5415 static void
5416 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5417 tree return_type,
5418 tree explicit_targs, bool template_only,
5419 tree conversion_path, tree access_path,
5420 int flags,
5421 struct z_candidate **candidates,
5422 tsubst_flags_t complain)
5424 tree ctype;
5425 const vec<tree, va_gc> *non_static_args;
5426 bool check_list_ctor = false;
5427 bool check_converting = false;
5428 unification_kind_t strict;
5430 if (!fns)
5431 return;
5433 /* Precalculate special handling of constructors and conversion ops. */
5434 tree fn = OVL_FIRST (fns);
5435 if (DECL_CONV_FN_P (fn))
5437 check_list_ctor = false;
5438 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5439 if (flags & LOOKUP_NO_CONVERSION)
5440 /* We're doing return_type(x). */
5441 strict = DEDUCE_CONV;
5442 else
5443 /* We're doing x.operator return_type(). */
5444 strict = DEDUCE_EXACT;
5445 /* [over.match.funcs] For conversion functions, the function
5446 is considered to be a member of the class of the implicit
5447 object argument for the purpose of defining the type of
5448 the implicit object parameter. */
5449 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5451 else
5453 if (DECL_CONSTRUCTOR_P (fn))
5455 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5456 /* For list-initialization we consider explicit constructors
5457 and complain if one is chosen. */
5458 check_converting
5459 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5460 == LOOKUP_ONLYCONVERTING);
5462 strict = DEDUCE_CALL;
5463 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5466 if (first_arg)
5467 non_static_args = args;
5468 else
5469 /* Delay creating the implicit this parameter until it is needed. */
5470 non_static_args = NULL;
5472 for (lkp_iterator iter (fns); iter; ++iter)
5474 fn = *iter;
5476 if (check_converting && DECL_NONCONVERTING_P (fn))
5477 continue;
5478 if (check_list_ctor && !is_list_ctor (fn))
5479 continue;
5481 tree fn_first_arg = NULL_TREE;
5482 const vec<tree, va_gc> *fn_args = args;
5484 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5486 /* Figure out where the object arg comes from. If this
5487 function is a non-static member and we didn't get an
5488 implicit object argument, move it out of args. */
5489 if (first_arg == NULL_TREE)
5491 unsigned int ix;
5492 tree arg;
5493 vec<tree, va_gc> *tempvec;
5494 vec_alloc (tempvec, args->length () - 1);
5495 for (ix = 1; args->iterate (ix, &arg); ++ix)
5496 tempvec->quick_push (arg);
5497 non_static_args = tempvec;
5498 first_arg = (*args)[0];
5501 fn_first_arg = first_arg;
5502 fn_args = non_static_args;
5505 if (TREE_CODE (fn) == TEMPLATE_DECL)
5506 add_template_candidate (candidates,
5508 ctype,
5509 explicit_targs,
5510 fn_first_arg,
5511 fn_args,
5512 return_type,
5513 access_path,
5514 conversion_path,
5515 flags,
5516 strict,
5517 complain);
5518 else if (!template_only)
5519 add_function_candidate (candidates,
5521 ctype,
5522 fn_first_arg,
5523 fn_args,
5524 access_path,
5525 conversion_path,
5526 flags,
5527 complain);
5531 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5532 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5534 static int
5535 op_is_ordered (tree_code code)
5537 switch (code)
5539 // 5. b @= a
5540 case MODIFY_EXPR:
5541 return (flag_strong_eval_order > 1 ? -1 : 0);
5543 // 6. a[b]
5544 case ARRAY_REF:
5545 return (flag_strong_eval_order > 1 ? 1 : 0);
5547 // 1. a.b
5548 // Not overloadable (yet).
5549 // 2. a->b
5550 // Only one argument.
5551 // 3. a->*b
5552 case MEMBER_REF:
5553 // 7. a << b
5554 case LSHIFT_EXPR:
5555 // 8. a >> b
5556 case RSHIFT_EXPR:
5557 return (flag_strong_eval_order ? 1 : 0);
5559 default:
5560 return 0;
5564 static tree
5565 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5566 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5568 struct z_candidate *candidates = 0, *cand;
5569 vec<tree, va_gc> *arglist;
5570 tree fnname;
5571 tree args[3];
5572 tree result = NULL_TREE;
5573 bool result_valid_p = false;
5574 enum tree_code code2 = NOP_EXPR;
5575 enum tree_code code_orig_arg1 = ERROR_MARK;
5576 enum tree_code code_orig_arg2 = ERROR_MARK;
5577 conversion *conv;
5578 void *p;
5579 bool strict_p;
5580 bool any_viable_p;
5582 if (error_operand_p (arg1)
5583 || error_operand_p (arg2)
5584 || error_operand_p (arg3))
5585 return error_mark_node;
5587 if (code == MODIFY_EXPR)
5589 code2 = TREE_CODE (arg3);
5590 arg3 = NULL_TREE;
5591 fnname = cp_assignment_operator_id (code2);
5593 else
5594 fnname = cp_operator_id (code);
5596 arg1 = prep_operand (arg1);
5598 bool memonly = false;
5599 switch (code)
5601 case NEW_EXPR:
5602 case VEC_NEW_EXPR:
5603 case VEC_DELETE_EXPR:
5604 case DELETE_EXPR:
5605 /* Use build_op_new_call and build_op_delete_call instead. */
5606 gcc_unreachable ();
5608 case CALL_EXPR:
5609 /* Use build_op_call instead. */
5610 gcc_unreachable ();
5612 case TRUTH_ORIF_EXPR:
5613 case TRUTH_ANDIF_EXPR:
5614 case TRUTH_AND_EXPR:
5615 case TRUTH_OR_EXPR:
5616 /* These are saved for the sake of warn_logical_operator. */
5617 code_orig_arg1 = TREE_CODE (arg1);
5618 code_orig_arg2 = TREE_CODE (arg2);
5619 break;
5620 case GT_EXPR:
5621 case LT_EXPR:
5622 case GE_EXPR:
5623 case LE_EXPR:
5624 case EQ_EXPR:
5625 case NE_EXPR:
5626 /* These are saved for the sake of maybe_warn_bool_compare. */
5627 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5628 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5629 break;
5631 /* =, ->, [], () must be non-static member functions. */
5632 case MODIFY_EXPR:
5633 if (code2 != NOP_EXPR)
5634 break;
5635 /* FALLTHRU */
5636 case COMPONENT_REF:
5637 case ARRAY_REF:
5638 memonly = true;
5639 break;
5641 default:
5642 break;
5645 arg2 = prep_operand (arg2);
5646 arg3 = prep_operand (arg3);
5648 if (code == COND_EXPR)
5649 /* Use build_conditional_expr instead. */
5650 gcc_unreachable ();
5651 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5652 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5653 goto builtin;
5655 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5656 arg2 = integer_zero_node;
5658 vec_alloc (arglist, 3);
5659 arglist->quick_push (arg1);
5660 if (arg2 != NULL_TREE)
5661 arglist->quick_push (arg2);
5662 if (arg3 != NULL_TREE)
5663 arglist->quick_push (arg3);
5665 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5666 p = conversion_obstack_alloc (0);
5668 /* Add namespace-scope operators to the list of functions to
5669 consider. */
5670 if (!memonly)
5672 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5673 fns = lookup_arg_dependent (fnname, fns, arglist);
5674 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5675 NULL_TREE, false, NULL_TREE, NULL_TREE,
5676 flags, &candidates, complain);
5679 args[0] = arg1;
5680 args[1] = arg2;
5681 args[2] = NULL_TREE;
5683 /* Add class-member operators to the candidate set. */
5684 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5686 tree fns;
5688 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5689 if (fns == error_mark_node)
5691 result = error_mark_node;
5692 goto user_defined_result_ready;
5694 if (fns)
5695 add_candidates (BASELINK_FUNCTIONS (fns),
5696 NULL_TREE, arglist, NULL_TREE,
5697 NULL_TREE, false,
5698 BASELINK_BINFO (fns),
5699 BASELINK_ACCESS_BINFO (fns),
5700 flags, &candidates, complain);
5702 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5703 only non-member functions that have type T1 or reference to
5704 cv-qualified-opt T1 for the first argument, if the first argument
5705 has an enumeration type, or T2 or reference to cv-qualified-opt
5706 T2 for the second argument, if the second argument has an
5707 enumeration type. Filter out those that don't match. */
5708 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5710 struct z_candidate **candp, **next;
5712 for (candp = &candidates; *candp; candp = next)
5714 tree parmlist, parmtype;
5715 int i, nargs = (arg2 ? 2 : 1);
5717 cand = *candp;
5718 next = &cand->next;
5720 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5722 for (i = 0; i < nargs; ++i)
5724 parmtype = TREE_VALUE (parmlist);
5726 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5727 parmtype = TREE_TYPE (parmtype);
5728 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5729 && (same_type_ignoring_top_level_qualifiers_p
5730 (TREE_TYPE (args[i]), parmtype)))
5731 break;
5733 parmlist = TREE_CHAIN (parmlist);
5736 /* No argument has an appropriate type, so remove this
5737 candidate function from the list. */
5738 if (i == nargs)
5740 *candp = cand->next;
5741 next = candp;
5746 add_builtin_candidates (&candidates, code, code2, fnname, args,
5747 flags, complain);
5749 switch (code)
5751 case COMPOUND_EXPR:
5752 case ADDR_EXPR:
5753 /* For these, the built-in candidates set is empty
5754 [over.match.oper]/3. We don't want non-strict matches
5755 because exact matches are always possible with built-in
5756 operators. The built-in candidate set for COMPONENT_REF
5757 would be empty too, but since there are no such built-in
5758 operators, we accept non-strict matches for them. */
5759 strict_p = true;
5760 break;
5762 default:
5763 strict_p = false;
5764 break;
5767 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5768 if (!any_viable_p)
5770 switch (code)
5772 case POSTINCREMENT_EXPR:
5773 case POSTDECREMENT_EXPR:
5774 /* Don't try anything fancy if we're not allowed to produce
5775 errors. */
5776 if (!(complain & tf_error))
5777 return error_mark_node;
5779 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5780 distinguish between prefix and postfix ++ and
5781 operator++() was used for both, so we allow this with
5782 -fpermissive. */
5783 else
5785 const char *msg = (flag_permissive)
5786 ? G_("no %<%D(int)%> declared for postfix %qs,"
5787 " trying prefix operator instead")
5788 : G_("no %<%D(int)%> declared for postfix %qs");
5789 permerror (loc, msg, fnname, operator_name_info[code].name);
5792 if (!flag_permissive)
5793 return error_mark_node;
5795 if (code == POSTINCREMENT_EXPR)
5796 code = PREINCREMENT_EXPR;
5797 else
5798 code = PREDECREMENT_EXPR;
5799 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5800 NULL_TREE, overload, complain);
5801 break;
5803 /* The caller will deal with these. */
5804 case ADDR_EXPR:
5805 case COMPOUND_EXPR:
5806 case COMPONENT_REF:
5807 result = NULL_TREE;
5808 result_valid_p = true;
5809 break;
5811 default:
5812 if (complain & tf_error)
5814 /* If one of the arguments of the operator represents
5815 an invalid use of member function pointer, try to report
5816 a meaningful error ... */
5817 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5818 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5819 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5820 /* We displayed the error message. */;
5821 else
5823 /* ... Otherwise, report the more generic
5824 "no matching operator found" error */
5825 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5826 print_z_candidates (loc, candidates);
5829 result = error_mark_node;
5830 break;
5833 else
5835 cand = tourney (candidates, complain);
5836 if (cand == 0)
5838 if (complain & tf_error)
5840 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5841 print_z_candidates (loc, candidates);
5843 result = error_mark_node;
5845 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5847 if (overload)
5848 *overload = cand->fn;
5850 if (resolve_args (arglist, complain) == NULL)
5851 result = error_mark_node;
5852 else
5853 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5855 if (trivial_fn_p (cand->fn))
5856 /* There won't be a CALL_EXPR. */;
5857 else if (result && result != error_mark_node)
5859 tree call = extract_call_expr (result);
5860 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5862 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5863 /* This prevents build_new_function_call from discarding this
5864 function during instantiation of the enclosing template. */
5865 KOENIG_LOOKUP_P (call) = 1;
5867 /* Specify evaluation order as per P0145R2. */
5868 CALL_EXPR_ORDERED_ARGS (call) = false;
5869 switch (op_is_ordered (code))
5871 case -1:
5872 CALL_EXPR_REVERSE_ARGS (call) = true;
5873 break;
5875 case 1:
5876 CALL_EXPR_ORDERED_ARGS (call) = true;
5877 break;
5879 default:
5880 break;
5884 else
5886 /* Give any warnings we noticed during overload resolution. */
5887 if (cand->warnings && (complain & tf_warning))
5889 struct candidate_warning *w;
5890 for (w = cand->warnings; w; w = w->next)
5891 joust (cand, w->loser, 1, complain);
5894 /* Check for comparison of different enum types. */
5895 switch (code)
5897 case GT_EXPR:
5898 case LT_EXPR:
5899 case GE_EXPR:
5900 case LE_EXPR:
5901 case EQ_EXPR:
5902 case NE_EXPR:
5903 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5904 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5905 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5906 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5907 && (complain & tf_warning))
5909 warning (OPT_Wenum_compare,
5910 "comparison between %q#T and %q#T",
5911 TREE_TYPE (arg1), TREE_TYPE (arg2));
5913 break;
5914 default:
5915 break;
5918 /* We need to strip any leading REF_BIND so that bitfields
5919 don't cause errors. This should not remove any important
5920 conversions, because builtins don't apply to class
5921 objects directly. */
5922 conv = cand->convs[0];
5923 if (conv->kind == ck_ref_bind)
5924 conv = next_conversion (conv);
5925 arg1 = convert_like (conv, arg1, complain);
5927 if (arg2)
5929 conv = cand->convs[1];
5930 if (conv->kind == ck_ref_bind)
5931 conv = next_conversion (conv);
5932 else
5933 arg2 = decay_conversion (arg2, complain);
5935 /* We need to call warn_logical_operator before
5936 converting arg2 to a boolean_type, but after
5937 decaying an enumerator to its value. */
5938 if (complain & tf_warning)
5939 warn_logical_operator (loc, code, boolean_type_node,
5940 code_orig_arg1, arg1,
5941 code_orig_arg2, arg2);
5943 arg2 = convert_like (conv, arg2, complain);
5945 if (arg3)
5947 conv = cand->convs[2];
5948 if (conv->kind == ck_ref_bind)
5949 conv = next_conversion (conv);
5950 arg3 = convert_like (conv, arg3, complain);
5956 user_defined_result_ready:
5958 /* Free all the conversions we allocated. */
5959 obstack_free (&conversion_obstack, p);
5961 if (result || result_valid_p)
5962 return result;
5964 builtin:
5965 switch (code)
5967 case MODIFY_EXPR:
5968 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5970 case INDIRECT_REF:
5971 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5973 case TRUTH_ANDIF_EXPR:
5974 case TRUTH_ORIF_EXPR:
5975 case TRUTH_AND_EXPR:
5976 case TRUTH_OR_EXPR:
5977 if (complain & tf_warning)
5978 warn_logical_operator (loc, code, boolean_type_node,
5979 code_orig_arg1, arg1,
5980 code_orig_arg2, arg2);
5981 /* Fall through. */
5982 case GT_EXPR:
5983 case LT_EXPR:
5984 case GE_EXPR:
5985 case LE_EXPR:
5986 case EQ_EXPR:
5987 case NE_EXPR:
5988 if ((complain & tf_warning)
5989 && ((code_orig_arg1 == BOOLEAN_TYPE)
5990 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5991 maybe_warn_bool_compare (loc, code, arg1, arg2);
5992 if (complain & tf_warning && warn_tautological_compare)
5993 warn_tautological_cmp (loc, code, arg1, arg2);
5994 /* Fall through. */
5995 case PLUS_EXPR:
5996 case MINUS_EXPR:
5997 case MULT_EXPR:
5998 case TRUNC_DIV_EXPR:
5999 case MAX_EXPR:
6000 case MIN_EXPR:
6001 case LSHIFT_EXPR:
6002 case RSHIFT_EXPR:
6003 case TRUNC_MOD_EXPR:
6004 case BIT_AND_EXPR:
6005 case BIT_IOR_EXPR:
6006 case BIT_XOR_EXPR:
6007 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6009 case UNARY_PLUS_EXPR:
6010 case NEGATE_EXPR:
6011 case BIT_NOT_EXPR:
6012 case TRUTH_NOT_EXPR:
6013 case PREINCREMENT_EXPR:
6014 case POSTINCREMENT_EXPR:
6015 case PREDECREMENT_EXPR:
6016 case POSTDECREMENT_EXPR:
6017 case REALPART_EXPR:
6018 case IMAGPART_EXPR:
6019 case ABS_EXPR:
6020 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6022 case ARRAY_REF:
6023 return cp_build_array_ref (input_location, arg1, arg2, complain);
6025 case MEMBER_REF:
6026 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6027 complain),
6028 arg2, complain);
6030 /* The caller will deal with these. */
6031 case ADDR_EXPR:
6032 case COMPONENT_REF:
6033 case COMPOUND_EXPR:
6034 return NULL_TREE;
6036 default:
6037 gcc_unreachable ();
6039 return NULL_TREE;
6042 /* Wrapper for above. */
6044 tree
6045 build_new_op (location_t loc, enum tree_code code, int flags,
6046 tree arg1, tree arg2, tree arg3,
6047 tree *overload, tsubst_flags_t complain)
6049 tree ret;
6050 bool subtime = timevar_cond_start (TV_OVERLOAD);
6051 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6052 overload, complain);
6053 timevar_cond_stop (TV_OVERLOAD, subtime);
6054 return ret;
6057 /* CALL was returned by some call-building function; extract the actual
6058 CALL_EXPR from any bits that have been tacked on, e.g. by
6059 convert_from_reference. */
6061 tree
6062 extract_call_expr (tree call)
6064 while (TREE_CODE (call) == COMPOUND_EXPR)
6065 call = TREE_OPERAND (call, 1);
6066 if (REFERENCE_REF_P (call))
6067 call = TREE_OPERAND (call, 0);
6068 if (TREE_CODE (call) == TARGET_EXPR)
6069 call = TARGET_EXPR_INITIAL (call);
6070 gcc_assert (TREE_CODE (call) == CALL_EXPR
6071 || TREE_CODE (call) == AGGR_INIT_EXPR
6072 || call == error_mark_node);
6073 return call;
6076 /* Returns true if FN has two parameters, of which the second has type
6077 size_t. */
6079 static bool
6080 second_parm_is_size_t (tree fn)
6082 tree t = FUNCTION_ARG_CHAIN (fn);
6083 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6084 return false;
6085 t = TREE_CHAIN (t);
6086 if (t == void_list_node)
6087 return true;
6088 if (aligned_new_threshold && t
6089 && same_type_p (TREE_VALUE (t), align_type_node)
6090 && TREE_CHAIN (t) == void_list_node)
6091 return true;
6092 return false;
6095 /* True if T, an allocation function, has std::align_val_t as its second
6096 argument. */
6098 bool
6099 aligned_allocation_fn_p (tree t)
6101 if (!aligned_new_threshold)
6102 return false;
6104 tree a = FUNCTION_ARG_CHAIN (t);
6105 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6108 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6109 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6110 std::align_val_t. */
6112 static bool
6113 aligned_deallocation_fn_p (tree t)
6115 if (!aligned_new_threshold)
6116 return false;
6118 /* A template instance is never a usual deallocation function,
6119 regardless of its signature. */
6120 if (TREE_CODE (t) == TEMPLATE_DECL
6121 || primary_template_instantiation_p (t))
6122 return false;
6124 tree a = FUNCTION_ARG_CHAIN (t);
6125 if (same_type_p (TREE_VALUE (a), align_type_node)
6126 && TREE_CHAIN (a) == void_list_node)
6127 return true;
6128 if (!same_type_p (TREE_VALUE (a), size_type_node))
6129 return false;
6130 a = TREE_CHAIN (a);
6131 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6132 && TREE_CHAIN (a) == void_list_node)
6133 return true;
6134 return false;
6137 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6138 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6140 bool
6141 usual_deallocation_fn_p (tree t)
6143 /* A template instance is never a usual deallocation function,
6144 regardless of its signature. */
6145 if (TREE_CODE (t) == TEMPLATE_DECL
6146 || primary_template_instantiation_p (t))
6147 return false;
6149 /* If a class T has a member deallocation function named operator delete
6150 with exactly one parameter, then that function is a usual
6151 (non-placement) deallocation function. If class T does not declare
6152 such an operator delete but does declare a member deallocation
6153 function named operator delete with exactly two parameters, the second
6154 of which has type std::size_t (18.2), then this function is a usual
6155 deallocation function. */
6156 bool global = DECL_NAMESPACE_SCOPE_P (t);
6157 tree chain = FUNCTION_ARG_CHAIN (t);
6158 if (!chain)
6159 return false;
6160 if (chain == void_list_node
6161 || ((!global || flag_sized_deallocation)
6162 && second_parm_is_size_t (t)))
6163 return true;
6164 if (aligned_deallocation_fn_p (t))
6165 return true;
6166 return false;
6169 /* Build a call to operator delete. This has to be handled very specially,
6170 because the restrictions on what signatures match are different from all
6171 other call instances. For a normal delete, only a delete taking (void *)
6172 or (void *, size_t) is accepted. For a placement delete, only an exact
6173 match with the placement new is accepted.
6175 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6176 ADDR is the pointer to be deleted.
6177 SIZE is the size of the memory block to be deleted.
6178 GLOBAL_P is true if the delete-expression should not consider
6179 class-specific delete operators.
6180 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6182 If this call to "operator delete" is being generated as part to
6183 deallocate memory allocated via a new-expression (as per [expr.new]
6184 which requires that if the initialization throws an exception then
6185 we call a deallocation function), then ALLOC_FN is the allocation
6186 function. */
6188 tree
6189 build_op_delete_call (enum tree_code code, tree addr, tree size,
6190 bool global_p, tree placement,
6191 tree alloc_fn, tsubst_flags_t complain)
6193 tree fn = NULL_TREE;
6194 tree fns, fnname, type, t;
6196 if (addr == error_mark_node)
6197 return error_mark_node;
6199 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6201 fnname = cp_operator_id (code);
6203 if (CLASS_TYPE_P (type)
6204 && COMPLETE_TYPE_P (complete_type (type))
6205 && !global_p)
6206 /* In [class.free]
6208 If the result of the lookup is ambiguous or inaccessible, or if
6209 the lookup selects a placement deallocation function, the
6210 program is ill-formed.
6212 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6214 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6215 if (fns == error_mark_node)
6216 return error_mark_node;
6218 else
6219 fns = NULL_TREE;
6221 if (fns == NULL_TREE)
6222 fns = lookup_name_nonclass (fnname);
6224 /* Strip const and volatile from addr. */
6225 addr = cp_convert (ptr_type_node, addr, complain);
6227 if (placement)
6229 /* "A declaration of a placement deallocation function matches the
6230 declaration of a placement allocation function if it has the same
6231 number of parameters and, after parameter transformations (8.3.5),
6232 all parameter types except the first are identical."
6234 So we build up the function type we want and ask instantiate_type
6235 to get it for us. */
6236 t = FUNCTION_ARG_CHAIN (alloc_fn);
6237 t = tree_cons (NULL_TREE, ptr_type_node, t);
6238 t = build_function_type (void_type_node, t);
6240 fn = instantiate_type (t, fns, tf_none);
6241 if (fn == error_mark_node)
6242 return NULL_TREE;
6244 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6246 /* "If the lookup finds the two-parameter form of a usual deallocation
6247 function (3.7.4.2) and that function, considered as a placement
6248 deallocation function, would have been selected as a match for the
6249 allocation function, the program is ill-formed." */
6250 if (second_parm_is_size_t (fn))
6252 const char *const msg1
6253 = G_("exception cleanup for this placement new selects "
6254 "non-placement operator delete");
6255 const char *const msg2
6256 = G_("%qD is a usual (non-placement) deallocation "
6257 "function in C++14 (or with -fsized-deallocation)");
6259 /* But if the class has an operator delete (void *), then that is
6260 the usual deallocation function, so we shouldn't complain
6261 about using the operator delete (void *, size_t). */
6262 if (DECL_CLASS_SCOPE_P (fn))
6263 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6264 iter; ++iter)
6266 tree elt = *iter;
6267 if (usual_deallocation_fn_p (elt)
6268 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6269 goto ok;
6271 /* Before C++14 a two-parameter global deallocation function is
6272 always a placement deallocation function, but warn if
6273 -Wc++14-compat. */
6274 else if (!flag_sized_deallocation)
6276 if ((complain & tf_warning)
6277 && warning (OPT_Wc__14_compat, msg1))
6278 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6279 goto ok;
6282 if (complain & tf_warning_or_error)
6284 if (permerror (input_location, msg1))
6286 /* Only mention C++14 for namespace-scope delete. */
6287 if (DECL_NAMESPACE_SCOPE_P (fn))
6288 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6289 else
6290 inform (DECL_SOURCE_LOCATION (fn),
6291 "%qD is a usual (non-placement) deallocation "
6292 "function", fn);
6295 else
6296 return error_mark_node;
6297 ok:;
6300 else
6301 /* "Any non-placement deallocation function matches a non-placement
6302 allocation function. If the lookup finds a single matching
6303 deallocation function, that function will be called; otherwise, no
6304 deallocation function will be called." */
6305 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6307 tree elt = *iter;
6308 if (usual_deallocation_fn_p (elt))
6310 if (!fn)
6312 fn = elt;
6313 continue;
6316 /* -- If the type has new-extended alignment, a function with a
6317 parameter of type std::align_val_t is preferred; otherwise a
6318 function without such a parameter is preferred. If exactly one
6319 preferred function is found, that function is selected and the
6320 selection process terminates. If more than one preferred
6321 function is found, all non-preferred functions are eliminated
6322 from further consideration. */
6323 if (aligned_new_threshold)
6325 bool want_align = type_has_new_extended_alignment (type);
6326 bool fn_align = aligned_deallocation_fn_p (fn);
6327 bool elt_align = aligned_deallocation_fn_p (elt);
6329 if (elt_align != fn_align)
6331 if (want_align == elt_align)
6332 fn = elt;
6333 continue;
6337 /* -- If the deallocation functions have class scope, the one
6338 without a parameter of type std::size_t is selected. */
6339 bool want_size;
6340 if (DECL_CLASS_SCOPE_P (fn))
6341 want_size = false;
6343 /* -- If the type is complete and if, for the second alternative
6344 (delete array) only, the operand is a pointer to a class type
6345 with a non-trivial destructor or a (possibly multi-dimensional)
6346 array thereof, the function with a parameter of type std::size_t
6347 is selected.
6349 -- Otherwise, it is unspecified whether a deallocation function
6350 with a parameter of type std::size_t is selected. */
6351 else
6353 want_size = COMPLETE_TYPE_P (type);
6354 if (code == VEC_DELETE_EXPR
6355 && !TYPE_VEC_NEW_USES_COOKIE (type))
6356 /* We need a cookie to determine the array size. */
6357 want_size = false;
6359 bool fn_size = second_parm_is_size_t (fn);
6360 bool elt_size = second_parm_is_size_t (elt);
6361 gcc_assert (fn_size != elt_size);
6362 if (want_size == elt_size)
6363 fn = elt;
6367 /* If we have a matching function, call it. */
6368 if (fn)
6370 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6372 /* If the FN is a member function, make sure that it is
6373 accessible. */
6374 if (BASELINK_P (fns))
6375 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6376 complain);
6378 /* Core issue 901: It's ok to new a type with deleted delete. */
6379 if (DECL_DELETED_FN (fn) && alloc_fn)
6380 return NULL_TREE;
6382 if (placement)
6384 /* The placement args might not be suitable for overload
6385 resolution at this point, so build the call directly. */
6386 int nargs = call_expr_nargs (placement);
6387 tree *argarray = XALLOCAVEC (tree, nargs);
6388 int i;
6389 argarray[0] = addr;
6390 for (i = 1; i < nargs; i++)
6391 argarray[i] = CALL_EXPR_ARG (placement, i);
6392 if (!mark_used (fn, complain) && !(complain & tf_error))
6393 return error_mark_node;
6394 return build_cxx_call (fn, nargs, argarray, complain);
6396 else
6398 tree ret;
6399 vec<tree, va_gc> *args = make_tree_vector ();
6400 args->quick_push (addr);
6401 if (second_parm_is_size_t (fn))
6402 args->quick_push (size);
6403 if (aligned_deallocation_fn_p (fn))
6405 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6406 args->quick_push (al);
6408 ret = cp_build_function_call_vec (fn, &args, complain);
6409 release_tree_vector (args);
6410 return ret;
6414 /* [expr.new]
6416 If no unambiguous matching deallocation function can be found,
6417 propagating the exception does not cause the object's memory to
6418 be freed. */
6419 if (alloc_fn)
6421 if ((complain & tf_warning)
6422 && !placement)
6423 warning (0, "no corresponding deallocation function for %qD",
6424 alloc_fn);
6425 return NULL_TREE;
6428 if (complain & tf_error)
6429 error ("no suitable %<operator %s%> for %qT",
6430 operator_name_info[(int)code].name, type);
6431 return error_mark_node;
6434 /* If the current scope isn't allowed to access DECL along
6435 BASETYPE_PATH, give an error. The most derived class in
6436 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6437 the declaration to use in the error diagnostic. */
6439 bool
6440 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6441 tsubst_flags_t complain, access_failure_info *afi)
6443 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6445 if (flag_new_inheriting_ctors
6446 && DECL_INHERITED_CTOR (decl))
6448 /* 7.3.3/18: The additional constructors are accessible if they would be
6449 accessible when used to construct an object of the corresponding base
6450 class. */
6451 decl = strip_inheriting_ctors (decl);
6452 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6453 ba_any, NULL, complain);
6456 if (!accessible_p (basetype_path, decl, true))
6458 if (complain & tf_error)
6460 if (flag_new_inheriting_ctors)
6461 diag_decl = strip_inheriting_ctors (diag_decl);
6462 if (TREE_PRIVATE (decl))
6464 error ("%q#D is private within this context", diag_decl);
6465 inform (DECL_SOURCE_LOCATION (diag_decl),
6466 "declared private here");
6467 if (afi)
6468 afi->record_access_failure (basetype_path, diag_decl);
6470 else if (TREE_PROTECTED (decl))
6472 error ("%q#D is protected within this context", diag_decl);
6473 inform (DECL_SOURCE_LOCATION (diag_decl),
6474 "declared protected here");
6475 if (afi)
6476 afi->record_access_failure (basetype_path, diag_decl);
6478 else
6480 error ("%q#D is inaccessible within this context", diag_decl);
6481 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6482 if (afi)
6483 afi->record_access_failure (basetype_path, diag_decl);
6486 return false;
6489 return true;
6492 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6493 bitwise or of LOOKUP_* values. If any errors are warnings are
6494 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6495 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6496 to NULL. */
6498 static tree
6499 build_temp (tree expr, tree type, int flags,
6500 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6502 int savew, savee;
6503 vec<tree, va_gc> *args;
6505 *diagnostic_kind = DK_UNSPECIFIED;
6507 /* If the source is a packed field, calling the copy constructor will require
6508 binding the field to the reference parameter to the copy constructor, and
6509 we'll end up with an infinite loop. If we can use a bitwise copy, then
6510 do that now. */
6511 if ((lvalue_kind (expr) & clk_packed)
6512 && CLASS_TYPE_P (TREE_TYPE (expr))
6513 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6514 return get_target_expr_sfinae (expr, complain);
6516 savew = warningcount + werrorcount, savee = errorcount;
6517 args = make_tree_vector_single (expr);
6518 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6519 &args, type, flags, complain);
6520 release_tree_vector (args);
6521 if (warningcount + werrorcount > savew)
6522 *diagnostic_kind = DK_WARNING;
6523 else if (errorcount > savee)
6524 *diagnostic_kind = DK_ERROR;
6525 return expr;
6528 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6529 EXPR is implicitly converted to type TOTYPE.
6530 FN and ARGNUM are used for diagnostics. */
6532 static void
6533 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6535 /* Issue warnings about peculiar, but valid, uses of NULL. */
6536 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
6537 && ARITHMETIC_TYPE_P (totype))
6539 source_location loc =
6540 expansion_point_location_if_in_system_header (input_location);
6542 if (fn)
6543 warning_at (loc, OPT_Wconversion_null,
6544 "passing NULL to non-pointer argument %P of %qD",
6545 argnum, fn);
6546 else
6547 warning_at (loc, OPT_Wconversion_null,
6548 "converting to non-pointer type %qT from NULL", totype);
6551 /* Issue warnings if "false" is converted to a NULL pointer */
6552 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6553 && TYPE_PTR_P (totype))
6555 if (fn)
6556 warning_at (input_location, OPT_Wconversion_null,
6557 "converting %<false%> to pointer type for argument %P "
6558 "of %qD", argnum, fn);
6559 else
6560 warning_at (input_location, OPT_Wconversion_null,
6561 "converting %<false%> to pointer type %qT", totype);
6565 /* We gave a diagnostic during a conversion. If this was in the second
6566 standard conversion sequence of a user-defined conversion sequence, say
6567 which user-defined conversion. */
6569 static void
6570 maybe_print_user_conv_context (conversion *convs)
6572 if (convs->user_conv_p)
6573 for (conversion *t = convs; t; t = next_conversion (t))
6574 if (t->kind == ck_user)
6576 print_z_candidate (0, " after user-defined conversion:",
6577 t->cand);
6578 break;
6582 /* Perform the conversions in CONVS on the expression EXPR. FN and
6583 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6584 indicates the `this' argument of a method. INNER is nonzero when
6585 being called to continue a conversion chain. It is negative when a
6586 reference binding will be applied, positive otherwise. If
6587 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6588 conversions will be emitted if appropriate. If C_CAST_P is true,
6589 this conversion is coming from a C-style cast; in that case,
6590 conversions to inaccessible bases are permitted. */
6592 static tree
6593 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6594 bool issue_conversion_warnings,
6595 bool c_cast_p, tsubst_flags_t complain)
6597 tree totype = convs->type;
6598 diagnostic_t diag_kind;
6599 int flags;
6600 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6602 if (convs->bad_p && !(complain & tf_error))
6603 return error_mark_node;
6605 if (convs->bad_p
6606 && convs->kind != ck_user
6607 && convs->kind != ck_list
6608 && convs->kind != ck_ambig
6609 && (convs->kind != ck_ref_bind
6610 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6611 && (convs->kind != ck_rvalue
6612 || SCALAR_TYPE_P (totype))
6613 && convs->kind != ck_base)
6615 bool complained = false;
6616 conversion *t = convs;
6618 /* Give a helpful error if this is bad because of excess braces. */
6619 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6620 && SCALAR_TYPE_P (totype)
6621 && CONSTRUCTOR_NELTS (expr) > 0
6622 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6624 complained = permerror (loc, "too many braces around initializer "
6625 "for %qT", totype);
6626 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6627 && CONSTRUCTOR_NELTS (expr) == 1)
6628 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6631 /* Give a helpful error if this is bad because a conversion to bool
6632 from std::nullptr_t requires direct-initialization. */
6633 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6634 && TREE_CODE (totype) == BOOLEAN_TYPE)
6635 complained = permerror (loc, "converting to %qH from %qI requires "
6636 "direct-initialization",
6637 totype, TREE_TYPE (expr));
6639 for (; t ; t = next_conversion (t))
6641 if (t->kind == ck_user && t->cand->reason)
6643 complained = permerror (loc, "invalid user-defined conversion "
6644 "from %qH to %qI", TREE_TYPE (expr),
6645 totype);
6646 if (complained)
6647 print_z_candidate (loc, "candidate is:", t->cand);
6648 expr = convert_like_real (t, expr, fn, argnum,
6649 /*issue_conversion_warnings=*/false,
6650 /*c_cast_p=*/false,
6651 complain);
6652 if (convs->kind == ck_ref_bind)
6653 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6654 LOOKUP_NORMAL, NULL_TREE,
6655 complain);
6656 else
6657 expr = cp_convert (totype, expr, complain);
6658 if (complained && fn)
6659 inform (DECL_SOURCE_LOCATION (fn),
6660 " initializing argument %P of %qD", argnum, fn);
6661 return expr;
6663 else if (t->kind == ck_user || !t->bad_p)
6665 expr = convert_like_real (t, expr, fn, argnum,
6666 /*issue_conversion_warnings=*/false,
6667 /*c_cast_p=*/false,
6668 complain);
6669 break;
6671 else if (t->kind == ck_ambig)
6672 return convert_like_real (t, expr, fn, argnum,
6673 /*issue_conversion_warnings=*/false,
6674 /*c_cast_p=*/false,
6675 complain);
6676 else if (t->kind == ck_identity)
6677 break;
6679 if (!complained)
6680 complained = permerror (loc, "invalid conversion from %qH to %qI",
6681 TREE_TYPE (expr), totype);
6682 if (complained && fn)
6683 inform (DECL_SOURCE_LOCATION (fn),
6684 " initializing argument %P of %qD", argnum, fn);
6686 return cp_convert (totype, expr, complain);
6689 if (issue_conversion_warnings && (complain & tf_warning))
6690 conversion_null_warnings (totype, expr, fn, argnum);
6692 switch (convs->kind)
6694 case ck_user:
6696 struct z_candidate *cand = convs->cand;
6698 if (cand == NULL)
6699 /* We chose the surrogate function from add_conv_candidate, now we
6700 actually need to build the conversion. */
6701 cand = build_user_type_conversion_1 (totype, expr,
6702 LOOKUP_NO_CONVERSION, complain);
6704 tree convfn = cand->fn;
6706 /* When converting from an init list we consider explicit
6707 constructors, but actually trying to call one is an error. */
6708 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6709 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6710 /* Unless this is for direct-list-initialization. */
6711 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6712 /* And in C++98 a default constructor can't be explicit. */
6713 && cxx_dialect >= cxx11)
6715 if (!(complain & tf_error))
6716 return error_mark_node;
6717 location_t loc = location_of (expr);
6718 if (CONSTRUCTOR_NELTS (expr) == 0
6719 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6721 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6722 "would use explicit constructor %qD",
6723 totype, convfn))
6724 inform (loc, "in C++11 and above a default constructor "
6725 "can be explicit");
6727 else
6728 error ("converting to %qT from initializer list would use "
6729 "explicit constructor %qD", totype, convfn);
6732 /* If we're initializing from {}, it's value-initialization. */
6733 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6734 && CONSTRUCTOR_NELTS (expr) == 0
6735 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6737 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6738 expr = build_value_init (totype, complain);
6739 expr = get_target_expr_sfinae (expr, complain);
6740 if (expr != error_mark_node)
6742 TARGET_EXPR_LIST_INIT_P (expr) = true;
6743 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6745 return expr;
6748 expr = mark_rvalue_use (expr);
6750 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6751 any more UDCs. */
6752 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6753 complain);
6755 /* If this is a constructor or a function returning an aggr type,
6756 we need to build up a TARGET_EXPR. */
6757 if (DECL_CONSTRUCTOR_P (convfn))
6759 expr = build_cplus_new (totype, expr, complain);
6761 /* Remember that this was list-initialization. */
6762 if (convs->check_narrowing && expr != error_mark_node)
6763 TARGET_EXPR_LIST_INIT_P (expr) = true;
6766 return expr;
6768 case ck_identity:
6769 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6771 int nelts = CONSTRUCTOR_NELTS (expr);
6772 if (nelts == 0)
6773 expr = build_value_init (totype, complain);
6774 else if (nelts == 1)
6775 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6776 else
6777 gcc_unreachable ();
6779 expr = mark_rvalue_use (expr);
6781 if (type_unknown_p (expr))
6782 expr = instantiate_type (totype, expr, complain);
6783 return expr;
6784 case ck_ambig:
6785 /* We leave bad_p off ck_ambig because overload resolution considers
6786 it valid, it just fails when we try to perform it. So we need to
6787 check complain here, too. */
6788 if (complain & tf_error)
6790 /* Call build_user_type_conversion again for the error. */
6791 build_user_type_conversion (totype, convs->u.expr, LOOKUP_IMPLICIT,
6792 complain);
6793 if (fn)
6794 inform (DECL_SOURCE_LOCATION (fn),
6795 " initializing argument %P of %qD", argnum, fn);
6797 return error_mark_node;
6799 case ck_list:
6801 /* Conversion to std::initializer_list<T>. */
6802 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6803 tree new_ctor = build_constructor (init_list_type_node, NULL);
6804 unsigned len = CONSTRUCTOR_NELTS (expr);
6805 tree array, val, field;
6806 vec<constructor_elt, va_gc> *vec = NULL;
6807 unsigned ix;
6809 /* Convert all the elements. */
6810 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6812 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6813 false, false, complain);
6814 if (sub == error_mark_node)
6815 return sub;
6816 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6817 && !check_narrowing (TREE_TYPE (sub), val, complain))
6818 return error_mark_node;
6819 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6820 if (!TREE_CONSTANT (sub))
6821 TREE_CONSTANT (new_ctor) = false;
6823 /* Build up the array. */
6824 elttype = cp_build_qualified_type
6825 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6826 array = build_array_of_n_type (elttype, len);
6827 array = finish_compound_literal (array, new_ctor, complain);
6828 /* Take the address explicitly rather than via decay_conversion
6829 to avoid the error about taking the address of a temporary. */
6830 array = cp_build_addr_expr (array, complain);
6831 array = cp_convert (build_pointer_type (elttype), array, complain);
6832 if (array == error_mark_node)
6833 return error_mark_node;
6835 /* Build up the initializer_list object. */
6836 totype = complete_type (totype);
6837 field = next_initializable_field (TYPE_FIELDS (totype));
6838 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6839 field = next_initializable_field (DECL_CHAIN (field));
6840 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6841 new_ctor = build_constructor (totype, vec);
6842 return get_target_expr_sfinae (new_ctor, complain);
6845 case ck_aggr:
6846 if (TREE_CODE (totype) == COMPLEX_TYPE)
6848 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6849 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6850 real = perform_implicit_conversion (TREE_TYPE (totype),
6851 real, complain);
6852 imag = perform_implicit_conversion (TREE_TYPE (totype),
6853 imag, complain);
6854 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6855 return expr;
6857 expr = reshape_init (totype, expr, complain);
6858 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6859 complain);
6860 if (expr != error_mark_node)
6861 TARGET_EXPR_LIST_INIT_P (expr) = true;
6862 return expr;
6864 default:
6865 break;
6868 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6869 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6870 c_cast_p,
6871 complain);
6872 if (expr == error_mark_node)
6873 return error_mark_node;
6875 switch (convs->kind)
6877 case ck_rvalue:
6878 expr = decay_conversion (expr, complain);
6879 if (expr == error_mark_node)
6881 if (complain & tf_error)
6883 maybe_print_user_conv_context (convs);
6884 if (fn)
6885 inform (DECL_SOURCE_LOCATION (fn),
6886 " initializing argument %P of %qD", argnum, fn);
6888 return error_mark_node;
6891 if (! MAYBE_CLASS_TYPE_P (totype))
6892 return expr;
6894 /* Don't introduce copies when passing arguments along to the inherited
6895 constructor. */
6896 if (current_function_decl
6897 && flag_new_inheriting_ctors
6898 && DECL_INHERITED_CTOR (current_function_decl))
6899 return expr;
6901 /* Fall through. */
6902 case ck_base:
6903 if (convs->kind == ck_base && !convs->need_temporary_p)
6905 /* We are going to bind a reference directly to a base-class
6906 subobject of EXPR. */
6907 /* Build an expression for `*((base*) &expr)'. */
6908 expr = convert_to_base (expr, totype,
6909 !c_cast_p, /*nonnull=*/true, complain);
6910 return expr;
6913 /* Copy-initialization where the cv-unqualified version of the source
6914 type is the same class as, or a derived class of, the class of the
6915 destination [is treated as direct-initialization]. [dcl.init] */
6916 flags = LOOKUP_NORMAL;
6917 if (convs->user_conv_p)
6918 /* This conversion is being done in the context of a user-defined
6919 conversion (i.e. the second step of copy-initialization), so
6920 don't allow any more. */
6921 flags |= LOOKUP_NO_CONVERSION;
6922 else
6923 flags |= LOOKUP_ONLYCONVERTING;
6924 if (convs->rvaluedness_matches_p)
6925 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6926 flags |= LOOKUP_PREFER_RVALUE;
6927 if (TREE_CODE (expr) == TARGET_EXPR
6928 && TARGET_EXPR_LIST_INIT_P (expr))
6929 /* Copy-list-initialization doesn't actually involve a copy. */
6930 return expr;
6931 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6932 if (diag_kind && complain)
6934 maybe_print_user_conv_context (convs);
6935 if (fn)
6936 inform (DECL_SOURCE_LOCATION (fn),
6937 " initializing argument %P of %qD", argnum, fn);
6940 return build_cplus_new (totype, expr, complain);
6942 case ck_ref_bind:
6944 tree ref_type = totype;
6946 if (convs->bad_p && !next_conversion (convs)->bad_p)
6948 tree extype = TREE_TYPE (expr);
6949 if (TYPE_REF_IS_RVALUE (ref_type)
6950 && lvalue_p (expr))
6951 error_at (loc, "cannot bind rvalue reference of type %qH to "
6952 "lvalue of type %qI", totype, extype);
6953 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6954 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6955 error_at (loc, "cannot bind non-const lvalue reference of "
6956 "type %qH to an rvalue of type %qI", totype, extype);
6957 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6958 error_at (loc, "binding reference of type %qH to %qI "
6959 "discards qualifiers", totype, extype);
6960 else
6961 gcc_unreachable ();
6962 maybe_print_user_conv_context (convs);
6963 if (fn)
6964 inform (DECL_SOURCE_LOCATION (fn),
6965 " initializing argument %P of %qD", argnum, fn);
6966 return error_mark_node;
6969 /* If necessary, create a temporary.
6971 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6972 that need temporaries, even when their types are reference
6973 compatible with the type of reference being bound, so the
6974 upcoming call to cp_build_addr_expr doesn't fail. */
6975 if (convs->need_temporary_p
6976 || TREE_CODE (expr) == CONSTRUCTOR
6977 || TREE_CODE (expr) == VA_ARG_EXPR)
6979 /* Otherwise, a temporary of type "cv1 T1" is created and
6980 initialized from the initializer expression using the rules
6981 for a non-reference copy-initialization (8.5). */
6983 tree type = TREE_TYPE (ref_type);
6984 cp_lvalue_kind lvalue = lvalue_kind (expr);
6986 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6987 (type, next_conversion (convs)->type));
6988 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
6989 && !TYPE_REF_IS_RVALUE (ref_type))
6991 /* If the reference is volatile or non-const, we
6992 cannot create a temporary. */
6993 if (lvalue & clk_bitfield)
6994 error_at (loc, "cannot bind bitfield %qE to %qT",
6995 expr, ref_type);
6996 else if (lvalue & clk_packed)
6997 error_at (loc, "cannot bind packed field %qE to %qT",
6998 expr, ref_type);
6999 else
7000 error_at (loc, "cannot bind rvalue %qE to %qT",
7001 expr, ref_type);
7002 return error_mark_node;
7004 /* If the source is a packed field, and we must use a copy
7005 constructor, then building the target expr will require
7006 binding the field to the reference parameter to the
7007 copy constructor, and we'll end up with an infinite
7008 loop. If we can use a bitwise copy, then we'll be
7009 OK. */
7010 if ((lvalue & clk_packed)
7011 && CLASS_TYPE_P (type)
7012 && type_has_nontrivial_copy_init (type))
7014 error_at (loc, "cannot bind packed field %qE to %qT",
7015 expr, ref_type);
7016 return error_mark_node;
7018 if (lvalue & clk_bitfield)
7020 expr = convert_bitfield_to_declared_type (expr);
7021 expr = fold_convert (type, expr);
7023 expr = build_target_expr_with_type (expr, type, complain);
7026 /* Take the address of the thing to which we will bind the
7027 reference. */
7028 expr = cp_build_addr_expr (expr, complain);
7029 if (expr == error_mark_node)
7030 return error_mark_node;
7032 /* Convert it to a pointer to the type referred to by the
7033 reference. This will adjust the pointer if a derived to
7034 base conversion is being performed. */
7035 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7036 expr, complain);
7037 /* Convert the pointer to the desired reference type. */
7038 return build_nop (ref_type, expr);
7041 case ck_lvalue:
7042 return decay_conversion (expr, complain);
7044 case ck_fnptr:
7045 /* ??? Should the address of a transaction-safe pointer point to the TM
7046 clone, and this conversion look up the primary function? */
7047 return build_nop (totype, expr);
7049 case ck_qual:
7050 /* Warn about deprecated conversion if appropriate. */
7051 string_conv_p (totype, expr, 1);
7052 break;
7054 case ck_ptr:
7055 if (convs->base_p)
7056 expr = convert_to_base (expr, totype, !c_cast_p,
7057 /*nonnull=*/false, complain);
7058 return build_nop (totype, expr);
7060 case ck_pmem:
7061 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7062 c_cast_p, complain);
7064 default:
7065 break;
7068 if (convs->check_narrowing
7069 && !check_narrowing (totype, expr, complain))
7070 return error_mark_node;
7072 if (issue_conversion_warnings)
7073 expr = cp_convert_and_check (totype, expr, complain);
7074 else
7075 expr = cp_convert (totype, expr, complain);
7077 return expr;
7080 /* ARG is being passed to a varargs function. Perform any conversions
7081 required. Return the converted value. */
7083 tree
7084 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7086 tree arg_type;
7087 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7089 /* [expr.call]
7091 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7092 standard conversions are performed. */
7093 arg = decay_conversion (arg, complain);
7094 arg_type = TREE_TYPE (arg);
7095 /* [expr.call]
7097 If the argument has integral or enumeration type that is subject
7098 to the integral promotions (_conv.prom_), or a floating point
7099 type that is subject to the floating point promotion
7100 (_conv.fpprom_), the value of the argument is converted to the
7101 promoted type before the call. */
7102 if (TREE_CODE (arg_type) == REAL_TYPE
7103 && (TYPE_PRECISION (arg_type)
7104 < TYPE_PRECISION (double_type_node))
7105 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7107 if ((complain & tf_warning)
7108 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7109 warning_at (loc, OPT_Wdouble_promotion,
7110 "implicit conversion from %qH to %qI when passing "
7111 "argument to function",
7112 arg_type, double_type_node);
7113 arg = convert_to_real_nofold (double_type_node, arg);
7115 else if (NULLPTR_TYPE_P (arg_type))
7116 arg = null_pointer_node;
7117 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7119 if (SCOPED_ENUM_P (arg_type))
7121 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7122 complain);
7123 prom = cp_perform_integral_promotions (prom, complain);
7124 if (abi_version_crosses (6)
7125 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7126 && (complain & tf_warning))
7127 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7128 "%qT before -fabi-version=6, %qT after", arg_type,
7129 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7130 if (!abi_version_at_least (6))
7131 arg = prom;
7133 else
7134 arg = cp_perform_integral_promotions (arg, complain);
7137 arg = require_complete_type_sfinae (arg, complain);
7138 arg_type = TREE_TYPE (arg);
7140 if (arg != error_mark_node
7141 /* In a template (or ill-formed code), we can have an incomplete type
7142 even after require_complete_type_sfinae, in which case we don't know
7143 whether it has trivial copy or not. */
7144 && COMPLETE_TYPE_P (arg_type))
7146 /* Build up a real lvalue-to-rvalue conversion in case the
7147 copy constructor is trivial but not callable. */
7148 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
7149 force_rvalue (arg, complain);
7151 /* [expr.call] 5.2.2/7:
7152 Passing a potentially-evaluated argument of class type (Clause 9)
7153 with a non-trivial copy constructor or a non-trivial destructor
7154 with no corresponding parameter is conditionally-supported, with
7155 implementation-defined semantics.
7157 We support it as pass-by-invisible-reference, just like a normal
7158 value parameter.
7160 If the call appears in the context of a sizeof expression,
7161 it is not potentially-evaluated. */
7162 if (cp_unevaluated_operand == 0
7163 && (type_has_nontrivial_copy_init (arg_type)
7164 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
7166 if (complain & tf_warning)
7167 warning (OPT_Wconditionally_supported,
7168 "passing objects of non-trivially-copyable "
7169 "type %q#T through %<...%> is conditionally supported",
7170 arg_type);
7171 return cp_build_addr_expr (arg, complain);
7175 return arg;
7178 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7180 tree
7181 build_x_va_arg (source_location loc, tree expr, tree type)
7183 if (processing_template_decl)
7185 tree r = build_min (VA_ARG_EXPR, type, expr);
7186 SET_EXPR_LOCATION (r, loc);
7187 return r;
7190 type = complete_type_or_else (type, NULL_TREE);
7192 if (expr == error_mark_node || !type)
7193 return error_mark_node;
7195 expr = mark_lvalue_use (expr);
7197 if (TREE_CODE (type) == REFERENCE_TYPE)
7199 error ("cannot receive reference type %qT through %<...%>", type);
7200 return error_mark_node;
7203 if (type_has_nontrivial_copy_init (type)
7204 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7206 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7207 it as pass by invisible reference. */
7208 warning_at (loc, OPT_Wconditionally_supported,
7209 "receiving objects of non-trivially-copyable type %q#T "
7210 "through %<...%> is conditionally-supported", type);
7212 tree ref = cp_build_reference_type (type, false);
7213 expr = build_va_arg (loc, expr, ref);
7214 return convert_from_reference (expr);
7217 tree ret = build_va_arg (loc, expr, type);
7218 if (CLASS_TYPE_P (type))
7219 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7220 know how to handle it. */
7221 ret = get_target_expr (ret);
7222 return ret;
7225 /* TYPE has been given to va_arg. Apply the default conversions which
7226 would have happened when passed via ellipsis. Return the promoted
7227 type, or the passed type if there is no change. */
7229 tree
7230 cxx_type_promotes_to (tree type)
7232 tree promote;
7234 /* Perform the array-to-pointer and function-to-pointer
7235 conversions. */
7236 type = type_decays_to (type);
7238 promote = type_promotes_to (type);
7239 if (same_type_p (type, promote))
7240 promote = type;
7242 return promote;
7245 /* ARG is a default argument expression being passed to a parameter of
7246 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7247 zero-based argument number. Do any required conversions. Return
7248 the converted value. */
7250 static GTY(()) vec<tree, va_gc> *default_arg_context;
7251 void
7252 push_defarg_context (tree fn)
7253 { vec_safe_push (default_arg_context, fn); }
7255 void
7256 pop_defarg_context (void)
7257 { default_arg_context->pop (); }
7259 tree
7260 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7261 tsubst_flags_t complain)
7263 int i;
7264 tree t;
7266 /* See through clones. */
7267 fn = DECL_ORIGIN (fn);
7268 /* And inheriting ctors. */
7269 if (flag_new_inheriting_ctors)
7270 fn = strip_inheriting_ctors (fn);
7272 /* Detect recursion. */
7273 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7274 if (t == fn)
7276 if (complain & tf_error)
7277 error ("recursive evaluation of default argument for %q#D", fn);
7278 return error_mark_node;
7281 /* If the ARG is an unparsed default argument expression, the
7282 conversion cannot be performed. */
7283 if (TREE_CODE (arg) == DEFAULT_ARG)
7285 if (complain & tf_error)
7286 error ("call to %qD uses the default argument for parameter %P, which "
7287 "is not yet defined", fn, parmnum);
7288 return error_mark_node;
7291 push_defarg_context (fn);
7293 if (fn && DECL_TEMPLATE_INFO (fn))
7294 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7296 /* Due to:
7298 [dcl.fct.default]
7300 The names in the expression are bound, and the semantic
7301 constraints are checked, at the point where the default
7302 expressions appears.
7304 we must not perform access checks here. */
7305 push_deferring_access_checks (dk_no_check);
7306 /* We must make a copy of ARG, in case subsequent processing
7307 alters any part of it. */
7308 arg = break_out_target_exprs (arg);
7309 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7310 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7311 complain);
7312 arg = convert_for_arg_passing (type, arg, complain);
7313 pop_deferring_access_checks();
7315 pop_defarg_context ();
7317 return arg;
7320 /* Returns the type which will really be used for passing an argument of
7321 type TYPE. */
7323 tree
7324 type_passed_as (tree type)
7326 /* Pass classes with copy ctors by invisible reference. */
7327 if (TREE_ADDRESSABLE (type))
7329 type = build_reference_type (type);
7330 /* There are no other pointers to this temporary. */
7331 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7333 else if (targetm.calls.promote_prototypes (type)
7334 && INTEGRAL_TYPE_P (type)
7335 && COMPLETE_TYPE_P (type)
7336 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7337 type = integer_type_node;
7339 return type;
7342 /* Actually perform the appropriate conversion. */
7344 tree
7345 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7347 tree bitfield_type;
7349 /* If VAL is a bitfield, then -- since it has already been converted
7350 to TYPE -- it cannot have a precision greater than TYPE.
7352 If it has a smaller precision, we must widen it here. For
7353 example, passing "int f:3;" to a function expecting an "int" will
7354 not result in any conversion before this point.
7356 If the precision is the same we must not risk widening. For
7357 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7358 often have type "int", even though the C++ type for the field is
7359 "long long". If the value is being passed to a function
7360 expecting an "int", then no conversions will be required. But,
7361 if we call convert_bitfield_to_declared_type, the bitfield will
7362 be converted to "long long". */
7363 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7364 if (bitfield_type
7365 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7366 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7368 if (val == error_mark_node)
7370 /* Pass classes with copy ctors by invisible reference. */
7371 else if (TREE_ADDRESSABLE (type))
7372 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7373 else if (targetm.calls.promote_prototypes (type)
7374 && INTEGRAL_TYPE_P (type)
7375 && COMPLETE_TYPE_P (type)
7376 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7377 val = cp_perform_integral_promotions (val, complain);
7378 if (complain & tf_warning)
7380 if (warn_suggest_attribute_format)
7382 tree rhstype = TREE_TYPE (val);
7383 const enum tree_code coder = TREE_CODE (rhstype);
7384 const enum tree_code codel = TREE_CODE (type);
7385 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7386 && coder == codel
7387 && check_missing_format_attribute (type, rhstype))
7388 warning (OPT_Wsuggest_attribute_format,
7389 "argument of function call might be a candidate "
7390 "for a format attribute");
7392 maybe_warn_parm_abi (type, EXPR_LOC_OR_LOC (val, input_location));
7394 return val;
7397 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7398 which just decay_conversion or no conversions at all should be done.
7399 This is true for some builtins which don't act like normal functions.
7400 Return 2 if no conversions at all should be done, 1 if just
7401 decay_conversion. Return 3 for special treatment of the 3rd argument
7402 for __builtin_*_overflow_p. */
7405 magic_varargs_p (tree fn)
7407 if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE)
7408 return 2;
7410 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7411 switch (DECL_FUNCTION_CODE (fn))
7413 case BUILT_IN_CLASSIFY_TYPE:
7414 case BUILT_IN_CONSTANT_P:
7415 case BUILT_IN_NEXT_ARG:
7416 case BUILT_IN_VA_START:
7417 return 1;
7419 case BUILT_IN_ADD_OVERFLOW_P:
7420 case BUILT_IN_SUB_OVERFLOW_P:
7421 case BUILT_IN_MUL_OVERFLOW_P:
7422 return 3;
7424 default:;
7425 return lookup_attribute ("type generic",
7426 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7429 return 0;
7432 /* Returns the decl of the dispatcher function if FN is a function version. */
7434 tree
7435 get_function_version_dispatcher (tree fn)
7437 tree dispatcher_decl = NULL;
7439 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7440 && DECL_FUNCTION_VERSIONED (fn));
7442 gcc_assert (targetm.get_function_versions_dispatcher);
7443 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7445 if (dispatcher_decl == NULL)
7447 error_at (input_location, "use of multiversioned function "
7448 "without a default");
7449 return NULL;
7452 retrofit_lang_decl (dispatcher_decl);
7453 gcc_assert (dispatcher_decl != NULL);
7454 return dispatcher_decl;
7457 /* fn is a function version dispatcher that is marked used. Mark all the
7458 semantically identical function versions it will dispatch as used. */
7460 void
7461 mark_versions_used (tree fn)
7463 struct cgraph_node *node;
7464 struct cgraph_function_version_info *node_v;
7465 struct cgraph_function_version_info *it_v;
7467 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7469 node = cgraph_node::get (fn);
7470 if (node == NULL)
7471 return;
7473 gcc_assert (node->dispatcher_function);
7475 node_v = node->function_version ();
7476 if (node_v == NULL)
7477 return;
7479 /* All semantically identical versions are chained. Traverse and mark each
7480 one of them as used. */
7481 it_v = node_v->next;
7482 while (it_v != NULL)
7484 mark_used (it_v->this_node->decl);
7485 it_v = it_v->next;
7489 /* Build a call to "the copy constructor" for the type of A, even if it
7490 wouldn't be selected by normal overload resolution. Used for
7491 diagnostics. */
7493 static tree
7494 call_copy_ctor (tree a, tsubst_flags_t complain)
7496 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7497 tree binfo = TYPE_BINFO (ctype);
7498 tree copy = get_copy_ctor (ctype, complain);
7499 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7500 tree ob = build_dummy_object (ctype);
7501 vec<tree, va_gc>* args = make_tree_vector_single (a);
7502 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7503 LOOKUP_NORMAL, NULL, complain);
7504 release_tree_vector (args);
7505 return r;
7508 /* Return true iff T refers to a base field. */
7510 static bool
7511 is_base_field_ref (tree t)
7513 STRIP_NOPS (t);
7514 if (TREE_CODE (t) == ADDR_EXPR)
7515 t = TREE_OPERAND (t, 0);
7516 if (TREE_CODE (t) == COMPONENT_REF)
7517 t = TREE_OPERAND (t, 1);
7518 if (TREE_CODE (t) == FIELD_DECL)
7519 return DECL_FIELD_IS_BASE (t);
7520 return false;
7523 /* We can't elide a copy from a function returning by value to a base
7524 subobject, as the callee might clobber tail padding. Return true iff this
7525 could be that case. */
7527 static bool
7528 unsafe_copy_elision_p (tree target, tree exp)
7530 /* Copy elision only happens with a TARGET_EXPR. */
7531 if (TREE_CODE (exp) != TARGET_EXPR)
7532 return false;
7533 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7534 /* It's safe to elide the copy for a class with no tail padding. */
7535 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7536 return false;
7537 /* It's safe to elide the copy if we aren't initializing a base object. */
7538 if (!is_base_field_ref (target))
7539 return false;
7540 tree init = TARGET_EXPR_INITIAL (exp);
7541 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7542 while (TREE_CODE (init) == COMPOUND_EXPR)
7543 init = TREE_OPERAND (init, 1);
7544 return (TREE_CODE (init) == AGGR_INIT_EXPR
7545 && !AGGR_INIT_VIA_CTOR_P (init));
7548 /* Subroutine of the various build_*_call functions. Overload resolution
7549 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7550 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7551 bitmask of various LOOKUP_* flags which apply to the call itself. */
7553 static tree
7554 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7556 tree fn = cand->fn;
7557 const vec<tree, va_gc> *args = cand->args;
7558 tree first_arg = cand->first_arg;
7559 conversion **convs = cand->convs;
7560 conversion *conv;
7561 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7562 int parmlen;
7563 tree val;
7564 int i = 0;
7565 int j = 0;
7566 unsigned int arg_index = 0;
7567 int is_method = 0;
7568 int nargs;
7569 tree *argarray;
7570 bool already_used = false;
7572 /* In a template, there is no need to perform all of the work that
7573 is normally done. We are only interested in the type of the call
7574 expression, i.e., the return type of the function. Any semantic
7575 errors will be deferred until the template is instantiated. */
7576 if (processing_template_decl)
7578 tree expr, addr;
7579 tree return_type;
7580 const tree *argarray;
7581 unsigned int nargs;
7583 if (undeduced_auto_decl (fn))
7584 mark_used (fn, complain);
7586 return_type = TREE_TYPE (TREE_TYPE (fn));
7587 nargs = vec_safe_length (args);
7588 if (first_arg == NULL_TREE)
7589 argarray = args->address ();
7590 else
7592 tree *alcarray;
7593 unsigned int ix;
7594 tree arg;
7596 ++nargs;
7597 alcarray = XALLOCAVEC (tree, nargs);
7598 alcarray[0] = build_this (first_arg);
7599 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7600 alcarray[ix + 1] = arg;
7601 argarray = alcarray;
7604 addr = build_addr_func (fn, complain);
7605 if (addr == error_mark_node)
7606 return error_mark_node;
7607 expr = build_call_array_loc (input_location, return_type,
7608 addr, nargs, argarray);
7609 if (TREE_THIS_VOLATILE (fn) && cfun)
7610 current_function_returns_abnormally = 1;
7611 return convert_from_reference (expr);
7614 /* Give any warnings we noticed during overload resolution. */
7615 if (cand->warnings && (complain & tf_warning))
7617 struct candidate_warning *w;
7618 for (w = cand->warnings; w; w = w->next)
7619 joust (cand, w->loser, 1, complain);
7622 /* OK, we're actually calling this inherited constructor; set its deletedness
7623 appropriately. We can get away with doing this here because calling is
7624 the only way to refer to a constructor. */
7625 if (DECL_INHERITED_CTOR (fn))
7626 deduce_inheriting_ctor (fn);
7628 /* Make =delete work with SFINAE. */
7629 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7630 return error_mark_node;
7632 if (DECL_FUNCTION_MEMBER_P (fn))
7634 tree access_fn;
7635 /* If FN is a template function, two cases must be considered.
7636 For example:
7638 struct A {
7639 protected:
7640 template <class T> void f();
7642 template <class T> struct B {
7643 protected:
7644 void g();
7646 struct C : A, B<int> {
7647 using A::f; // #1
7648 using B<int>::g; // #2
7651 In case #1 where `A::f' is a member template, DECL_ACCESS is
7652 recorded in the primary template but not in its specialization.
7653 We check access of FN using its primary template.
7655 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7656 because it is a member of class template B, DECL_ACCESS is
7657 recorded in the specialization `B<int>::g'. We cannot use its
7658 primary template because `B<T>::g' and `B<int>::g' may have
7659 different access. */
7660 if (DECL_TEMPLATE_INFO (fn)
7661 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7662 access_fn = DECL_TI_TEMPLATE (fn);
7663 else
7664 access_fn = fn;
7665 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7666 fn, complain))
7667 return error_mark_node;
7670 /* If we're checking for implicit delete, don't bother with argument
7671 conversions. */
7672 if (flags & LOOKUP_SPECULATIVE)
7674 if (DECL_DELETED_FN (fn))
7676 if (complain & tf_error)
7677 mark_used (fn);
7678 return error_mark_node;
7680 if (cand->viable == 1)
7681 return fn;
7682 else if (!(complain & tf_error))
7683 /* Reject bad conversions now. */
7684 return error_mark_node;
7685 /* else continue to get conversion error. */
7688 /* N3276 magic doesn't apply to nested calls. */
7689 int decltype_flag = (complain & tf_decltype);
7690 complain &= ~tf_decltype;
7692 /* Find maximum size of vector to hold converted arguments. */
7693 parmlen = list_length (parm);
7694 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7695 if (parmlen > nargs)
7696 nargs = parmlen;
7697 argarray = XALLOCAVEC (tree, nargs);
7699 /* The implicit parameters to a constructor are not considered by overload
7700 resolution, and must be of the proper type. */
7701 if (DECL_CONSTRUCTOR_P (fn))
7703 tree object_arg;
7704 if (first_arg != NULL_TREE)
7706 object_arg = first_arg;
7707 first_arg = NULL_TREE;
7709 else
7711 object_arg = (*args)[arg_index];
7712 ++arg_index;
7714 argarray[j++] = build_this (object_arg);
7715 parm = TREE_CHAIN (parm);
7716 /* We should never try to call the abstract constructor. */
7717 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7719 if (DECL_HAS_VTT_PARM_P (fn))
7721 argarray[j++] = (*args)[arg_index];
7722 ++arg_index;
7723 parm = TREE_CHAIN (parm);
7726 if (flags & LOOKUP_PREFER_RVALUE)
7728 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7729 the first parameter of the selected constructor is not an rvalue
7730 reference to the object’s type (possibly cv-qualified)...." */
7731 gcc_assert (!(complain & tf_error));
7732 tree ptype = convs[0]->type;
7733 if (TREE_CODE (ptype) != REFERENCE_TYPE
7734 || !TYPE_REF_IS_RVALUE (ptype)
7735 || CONVERSION_RANK (convs[0]) > cr_exact)
7736 return error_mark_node;
7739 /* Bypass access control for 'this' parameter. */
7740 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7742 tree parmtype = TREE_VALUE (parm);
7743 tree arg = build_this (first_arg != NULL_TREE
7744 ? first_arg
7745 : (*args)[arg_index]);
7746 tree argtype = TREE_TYPE (arg);
7747 tree converted_arg;
7748 tree base_binfo;
7750 if (convs[i]->bad_p)
7752 if (complain & tf_error)
7754 if (permerror (input_location, "passing %qT as %<this%> "
7755 "argument discards qualifiers",
7756 TREE_TYPE (argtype)))
7757 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7759 else
7760 return error_mark_node;
7763 /* See if the function member or the whole class type is declared
7764 final and the call can be devirtualized. */
7765 if (DECL_FINAL_P (fn)
7766 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7767 flags |= LOOKUP_NONVIRTUAL;
7769 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7770 X is called for an object that is not of type X, or of a type
7771 derived from X, the behavior is undefined.
7773 So we can assume that anything passed as 'this' is non-null, and
7774 optimize accordingly. */
7775 gcc_assert (TYPE_PTR_P (parmtype));
7776 /* Convert to the base in which the function was declared. */
7777 gcc_assert (cand->conversion_path != NULL_TREE);
7778 converted_arg = build_base_path (PLUS_EXPR,
7779 arg,
7780 cand->conversion_path,
7781 1, complain);
7782 /* Check that the base class is accessible. */
7783 if (!accessible_base_p (TREE_TYPE (argtype),
7784 BINFO_TYPE (cand->conversion_path), true))
7786 if (complain & tf_error)
7787 error ("%qT is not an accessible base of %qT",
7788 BINFO_TYPE (cand->conversion_path),
7789 TREE_TYPE (argtype));
7790 else
7791 return error_mark_node;
7793 /* If fn was found by a using declaration, the conversion path
7794 will be to the derived class, not the base declaring fn. We
7795 must convert from derived to base. */
7796 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7797 TREE_TYPE (parmtype), ba_unique,
7798 NULL, complain);
7799 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7800 base_binfo, 1, complain);
7802 argarray[j++] = converted_arg;
7803 parm = TREE_CHAIN (parm);
7804 if (first_arg != NULL_TREE)
7805 first_arg = NULL_TREE;
7806 else
7807 ++arg_index;
7808 ++i;
7809 is_method = 1;
7812 gcc_assert (first_arg == NULL_TREE);
7813 for (; arg_index < vec_safe_length (args) && parm;
7814 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7816 tree type = TREE_VALUE (parm);
7817 tree arg = (*args)[arg_index];
7818 bool conversion_warning = true;
7820 conv = convs[i];
7822 /* If the argument is NULL and used to (implicitly) instantiate a
7823 template function (and bind one of the template arguments to
7824 the type of 'long int'), we don't want to warn about passing NULL
7825 to non-pointer argument.
7826 For example, if we have this template function:
7828 template<typename T> void func(T x) {}
7830 we want to warn (when -Wconversion is enabled) in this case:
7832 void foo() {
7833 func<int>(NULL);
7836 but not in this case:
7838 void foo() {
7839 func(NULL);
7842 if (arg == null_node
7843 && DECL_TEMPLATE_INFO (fn)
7844 && cand->template_decl
7845 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7846 conversion_warning = false;
7848 /* Warn about initializer_list deduction that isn't currently in the
7849 working draft. */
7850 if (cxx_dialect > cxx98
7851 && flag_deduce_init_list
7852 && cand->template_decl
7853 && is_std_init_list (non_reference (type))
7854 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7856 tree tmpl = TI_TEMPLATE (cand->template_decl);
7857 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7858 tree patparm = get_pattern_parm (realparm, tmpl);
7859 tree pattype = TREE_TYPE (patparm);
7860 if (PACK_EXPANSION_P (pattype))
7861 pattype = PACK_EXPANSION_PATTERN (pattype);
7862 pattype = non_reference (pattype);
7864 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7865 && (cand->explicit_targs == NULL_TREE
7866 || (TREE_VEC_LENGTH (cand->explicit_targs)
7867 <= TEMPLATE_TYPE_IDX (pattype))))
7869 pedwarn (input_location, 0, "deducing %qT as %qT",
7870 non_reference (TREE_TYPE (patparm)),
7871 non_reference (type));
7872 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7873 " in call to %qD", cand->fn);
7874 pedwarn (input_location, 0,
7875 " (you can disable this with -fno-deduce-init-list)");
7879 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7880 knows not to allow any more UDCs. This needs to happen after we
7881 process cand->warnings. */
7882 if (flags & LOOKUP_NO_CONVERSION)
7883 conv->user_conv_p = true;
7885 tsubst_flags_t arg_complain = complain & (~tf_no_cleanup);
7886 if (!conversion_warning)
7887 arg_complain &= ~tf_warning;
7889 val = convert_like_with_context (conv, arg, fn, i - is_method,
7890 arg_complain);
7891 val = convert_for_arg_passing (type, val, arg_complain);
7893 if (val == error_mark_node)
7894 return error_mark_node;
7895 else
7896 argarray[j++] = val;
7899 /* Default arguments */
7900 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7902 if (TREE_VALUE (parm) == error_mark_node)
7903 return error_mark_node;
7904 val = convert_default_arg (TREE_VALUE (parm),
7905 TREE_PURPOSE (parm),
7906 fn, i - is_method,
7907 complain);
7908 if (val == error_mark_node)
7909 return error_mark_node;
7910 argarray[j++] = val;
7913 /* Ellipsis */
7914 int magic = magic_varargs_p (fn);
7915 for (; arg_index < vec_safe_length (args); ++arg_index)
7917 tree a = (*args)[arg_index];
7918 if ((magic == 3 && arg_index == 2) || magic == 2)
7920 /* Do no conversions for certain magic varargs. */
7921 a = mark_type_use (a);
7922 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7923 return error_mark_node;
7925 else if (magic != 0)
7926 /* For other magic varargs only do decay_conversion. */
7927 a = decay_conversion (a, complain);
7928 else if (DECL_CONSTRUCTOR_P (fn)
7929 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7930 TREE_TYPE (a)))
7932 /* Avoid infinite recursion trying to call A(...). */
7933 if (complain & tf_error)
7934 /* Try to call the actual copy constructor for a good error. */
7935 call_copy_ctor (a, complain);
7936 return error_mark_node;
7938 else
7939 a = convert_arg_to_ellipsis (a, complain);
7940 if (a == error_mark_node)
7941 return error_mark_node;
7942 argarray[j++] = a;
7945 gcc_assert (j <= nargs);
7946 nargs = j;
7948 /* Avoid to do argument-transformation, if warnings for format, and for
7949 nonnull are disabled. Just in case that at least one of them is active
7950 the check_function_arguments function might warn about something. */
7952 bool warned_p = false;
7953 if (warn_nonnull
7954 || warn_format
7955 || warn_suggest_attribute_format
7956 || warn_restrict)
7958 tree *fargs = (!nargs ? argarray
7959 : (tree *) alloca (nargs * sizeof (tree)));
7960 for (j = 0; j < nargs; j++)
7961 fargs[j] = maybe_constant_value (argarray[j]);
7963 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
7964 nargs, fargs, NULL);
7967 if (DECL_INHERITED_CTOR (fn))
7969 /* Check for passing ellipsis arguments to an inherited constructor. We
7970 could handle this by open-coding the inherited constructor rather than
7971 defining it, but let's not bother now. */
7972 if (!cp_unevaluated_operand
7973 && cand->num_convs
7974 && cand->convs[cand->num_convs-1]->ellipsis_p)
7976 if (complain & tf_error)
7978 sorry ("passing arguments to ellipsis of inherited constructor "
7979 "%qD", cand->fn);
7980 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
7982 return error_mark_node;
7985 /* A base constructor inheriting from a virtual base doesn't get the
7986 inherited arguments, just this and __vtt. */
7987 if (ctor_omit_inherited_parms (fn))
7988 nargs = 2;
7991 /* Avoid actually calling copy constructors and copy assignment operators,
7992 if possible. */
7994 if (! flag_elide_constructors)
7995 /* Do things the hard way. */;
7996 else if (cand->num_convs == 1
7997 && (DECL_COPY_CONSTRUCTOR_P (fn)
7998 || DECL_MOVE_CONSTRUCTOR_P (fn))
7999 /* It's unsafe to elide the constructor when handling
8000 a noexcept-expression, it may evaluate to the wrong
8001 value (c++/53025). */
8002 && cp_noexcept_operand == 0)
8004 tree targ;
8005 tree arg = argarray[num_artificial_parms_for (fn)];
8006 tree fa;
8007 bool trivial = trivial_fn_p (fn);
8009 /* Pull out the real argument, disregarding const-correctness. */
8010 targ = arg;
8011 /* Strip the reference binding for the constructor parameter. */
8012 if (CONVERT_EXPR_P (targ)
8013 && TREE_CODE (TREE_TYPE (targ)) == REFERENCE_TYPE)
8014 targ = TREE_OPERAND (targ, 0);
8015 /* But don't strip any other reference bindings; binding a temporary to a
8016 reference prevents copy elision. */
8017 while ((CONVERT_EXPR_P (targ)
8018 && TREE_CODE (TREE_TYPE (targ)) != REFERENCE_TYPE)
8019 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8020 targ = TREE_OPERAND (targ, 0);
8021 if (TREE_CODE (targ) == ADDR_EXPR)
8023 targ = TREE_OPERAND (targ, 0);
8024 if (!same_type_ignoring_top_level_qualifiers_p
8025 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8026 targ = NULL_TREE;
8028 else
8029 targ = NULL_TREE;
8031 if (targ)
8032 arg = targ;
8033 else
8034 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8036 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8037 subobject. */
8038 if (CHECKING_P && cxx_dialect >= cxx1z)
8039 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8040 /* It's from binding the ref parm to a packed field. */
8041 || convs[0]->need_temporary_p
8042 || seen_error ()
8043 /* See unsafe_copy_elision_p. */
8044 || DECL_BASE_CONSTRUCTOR_P (fn));
8046 /* [class.copy]: the copy constructor is implicitly defined even if
8047 the implementation elided its use. */
8048 if (!trivial || DECL_DELETED_FN (fn))
8050 if (!mark_used (fn, complain) && !(complain & tf_error))
8051 return error_mark_node;
8052 already_used = true;
8055 /* If we're creating a temp and we already have one, don't create a
8056 new one. If we're not creating a temp but we get one, use
8057 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8058 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8059 temp or an INIT_EXPR otherwise. */
8060 fa = argarray[0];
8061 if (is_dummy_object (fa))
8063 if (TREE_CODE (arg) == TARGET_EXPR)
8064 return arg;
8065 else if (trivial)
8066 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8068 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8069 && !unsafe_copy_elision_p (fa, arg))
8071 tree to = cp_stabilize_reference (cp_build_indirect_ref (fa,
8072 RO_NULL,
8073 complain));
8075 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8076 return val;
8079 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
8080 && trivial_fn_p (fn)
8081 && !DECL_DELETED_FN (fn))
8083 tree to = cp_stabilize_reference
8084 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
8085 tree type = TREE_TYPE (to);
8086 tree as_base = CLASSTYPE_AS_BASE (type);
8087 tree arg = argarray[1];
8089 if (is_really_empty_class (type))
8091 /* Avoid copying empty classes. */
8092 val = build2 (COMPOUND_EXPR, type, arg, to);
8093 TREE_NO_WARNING (val) = 1;
8095 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8097 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8098 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8099 /* Handle NSDMI that refer to the object being initialized. */
8100 replace_placeholders (arg, to);
8102 else
8104 /* We must only copy the non-tail padding parts. */
8105 tree arg0, arg2, t;
8106 tree array_type, alias_set;
8108 arg2 = TYPE_SIZE_UNIT (as_base);
8109 arg0 = cp_build_addr_expr (to, complain);
8111 array_type = build_array_type (unsigned_char_type_node,
8112 build_index_type
8113 (size_binop (MINUS_EXPR,
8114 arg2, size_int (1))));
8115 alias_set = build_int_cst (build_pointer_type (type), 0);
8116 t = build2 (MODIFY_EXPR, void_type_node,
8117 build2 (MEM_REF, array_type, arg0, alias_set),
8118 build2 (MEM_REF, array_type, arg, alias_set));
8119 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8120 TREE_NO_WARNING (val) = 1;
8123 return val;
8125 else if (!DECL_DELETED_FN (fn)
8126 && trivial_fn_p (fn))
8128 if (DECL_DESTRUCTOR_P (fn))
8129 return fold_convert (void_type_node, argarray[0]);
8130 else if (default_ctor_p (fn))
8132 if (is_dummy_object (argarray[0]))
8133 return force_target_expr (DECL_CONTEXT (fn), void_node, complain);
8134 else
8135 return cp_build_indirect_ref (argarray[0], RO_NULL, complain);
8139 /* For calls to a multi-versioned function, overload resolution
8140 returns the function with the highest target priority, that is,
8141 the version that will checked for dispatching first. If this
8142 version is inlinable, a direct call to this version can be made
8143 otherwise the call should go through the dispatcher. */
8145 if (DECL_FUNCTION_VERSIONED (fn)
8146 && (current_function_decl == NULL
8147 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8149 fn = get_function_version_dispatcher (fn);
8150 if (fn == NULL)
8151 return NULL;
8152 if (!already_used)
8153 mark_versions_used (fn);
8156 if (!already_used
8157 && !mark_used (fn, complain))
8158 return error_mark_node;
8160 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8161 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8162 virtual functions can't be constexpr. */
8163 && !in_template_function ())
8165 tree t;
8166 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8167 DECL_CONTEXT (fn),
8168 ba_any, NULL, complain);
8169 gcc_assert (binfo && binfo != error_mark_node);
8171 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8172 complain);
8173 if (TREE_SIDE_EFFECTS (argarray[0]))
8174 argarray[0] = save_expr (argarray[0]);
8175 t = build_pointer_type (TREE_TYPE (fn));
8176 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8177 TREE_TYPE (fn) = t;
8179 else
8181 fn = build_addr_func (fn, complain);
8182 if (fn == error_mark_node)
8183 return error_mark_node;
8186 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8187 if (call == error_mark_node)
8188 return call;
8189 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8191 tree c = extract_call_expr (call);
8192 /* build_new_op_1 will clear this when appropriate. */
8193 CALL_EXPR_ORDERED_ARGS (c) = true;
8195 if (warned_p)
8197 tree c = extract_call_expr (call);
8198 if (TREE_CODE (c) == CALL_EXPR)
8199 TREE_NO_WARNING (c) = 1;
8201 return call;
8204 /* Return the DECL of the first non-public data member of class TYPE
8205 or null if none can be found. */
8207 static tree
8208 first_non_public_field (tree type)
8210 if (!CLASS_TYPE_P (type))
8211 return NULL_TREE;
8213 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8215 if (TREE_CODE (field) != FIELD_DECL)
8216 continue;
8217 if (TREE_STATIC (field))
8218 continue;
8219 if (TREE_PRIVATE (field) || TREE_PROTECTED (field))
8220 return field;
8223 int i = 0;
8225 for (tree base_binfo, binfo = TYPE_BINFO (type);
8226 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8228 tree base = TREE_TYPE (base_binfo);
8230 if (tree field = first_non_public_field (base))
8231 return field;
8234 return NULL_TREE;
8237 /* Return true if all copy and move assignment operator overloads for
8238 class TYPE are trivial and at least one of them is not deleted and,
8239 when ACCESS is set, accessible. Return false otherwise. Set
8240 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8241 copy or move assignment. */
8243 static bool
8244 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8246 tree fns = get_class_binding (type, cp_assignment_operator_id (NOP_EXPR));
8247 bool all_trivial = true;
8249 /* Iterate over overloads of the assignment operator, checking
8250 accessible copy assignments for triviality. */
8252 for (ovl_iterator oi (fns); oi; ++oi)
8254 tree f = *oi;
8256 /* Skip operators that aren't copy assignments. */
8257 if (!copy_fn_p (f))
8258 continue;
8260 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8261 || accessible_p (TYPE_BINFO (type), f, true));
8263 /* Skip template assignment operators and deleted functions. */
8264 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8265 continue;
8267 if (accessible)
8268 *hasassign = true;
8270 if (!accessible || !trivial_fn_p (f))
8271 all_trivial = false;
8273 /* Break early when both properties have been determined. */
8274 if (*hasassign && !all_trivial)
8275 break;
8278 /* Return true if they're all trivial and one of the expressions
8279 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8280 tree ref = cp_build_reference_type (type, false);
8281 return (all_trivial
8282 && (is_trivially_xible (MODIFY_EXPR, type, type)
8283 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8286 /* Return true if all copy and move ctor overloads for class TYPE are
8287 trivial and at least one of them is not deleted and, when ACCESS is
8288 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8289 to true when the TYPE has a (not necessarily trivial) default and copy
8290 (or move) ctor, respectively. */
8292 static bool
8293 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8295 tree fns = get_class_binding (type, complete_ctor_identifier);
8296 bool all_trivial = true;
8298 for (ovl_iterator oi (fns); oi; ++oi)
8300 tree f = *oi;
8302 /* Skip template constructors. */
8303 if (TREE_CODE (f) != FUNCTION_DECL)
8304 continue;
8306 bool cpy_or_move_ctor_p = copy_fn_p (f);
8308 /* Skip ctors other than default, copy, and move. */
8309 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8310 continue;
8312 if (DECL_DELETED_FN (f))
8313 continue;
8315 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8316 || accessible_p (TYPE_BINFO (type), f, true));
8318 if (accessible)
8319 hasctor[cpy_or_move_ctor_p] = true;
8321 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8322 all_trivial = false;
8324 /* Break early when both properties have been determined. */
8325 if (hasctor[0] && hasctor[1] && !all_trivial)
8326 break;
8329 return all_trivial;
8332 /* Issue a warning on a call to the built-in function FNDECL if it is
8333 a raw memory write whose destination is not an object of (something
8334 like) trivial or standard layout type with a non-deleted assignment
8335 and copy ctor. Detects const correctness violations, corrupting
8336 references, virtual table pointers, and bypassing non-trivial
8337 assignments. */
8339 static void
8340 maybe_warn_class_memaccess (location_t loc, tree fndecl, tree *args)
8342 /* Except for bcopy where it's second, the destination pointer is
8343 the first argument for all functions handled here. Compute
8344 the index of the destination and source arguments. */
8345 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8346 unsigned srcidx = !dstidx;
8348 tree dest = args[dstidx];
8349 if (!dest || !TREE_TYPE (dest) || !POINTER_TYPE_P (TREE_TYPE (dest)))
8350 return;
8352 /* Remove the outermost (usually implicit) conversion to the void*
8353 argument type. */
8354 if (TREE_CODE (dest) == NOP_EXPR)
8355 dest = TREE_OPERAND (dest, 0);
8357 tree srctype = NULL_TREE;
8359 /* Determine the type of the pointed-to object and whether it's
8360 a complete class type. */
8361 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8363 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8364 return;
8366 /* Check to see if the raw memory call is made by a ctor or dtor
8367 with this as the destination argument for the destination type.
8368 If so, be more permissive. */
8369 if (current_function_decl
8370 && (DECL_CONSTRUCTOR_P (current_function_decl)
8371 || DECL_DESTRUCTOR_P (current_function_decl))
8372 && is_this_parameter (tree_strip_nop_conversions (dest)))
8374 tree ctx = DECL_CONTEXT (current_function_decl);
8375 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8377 tree binfo = TYPE_BINFO (ctx);
8379 /* A ctor and dtor for a class with no bases and no virtual functions
8380 can do whatever they want. Bail early with no further checking. */
8381 if (special && !BINFO_VTABLE (binfo) && !BINFO_N_BASE_BINFOS (binfo))
8382 return;
8385 /* True if the class is trivial. */
8386 bool trivial = trivial_type_p (desttype);
8388 /* Set to true if DESTYPE has an accessible copy assignment. */
8389 bool hasassign = false;
8390 /* True if all of the class' overloaded copy assignment operators
8391 are all trivial (and not deleted) and at least one of them is
8392 accessible. */
8393 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8395 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8396 respectively. */
8397 bool hasctors[2] = { false, false };
8399 /* True if all of the class' overloaded copy constructors are all
8400 trivial (and not deleted) and at least one of them is accessible. */
8401 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8403 /* Set FLD to the first private/protected member of the class. */
8404 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8406 /* The warning format string. */
8407 const char *warnfmt = NULL;
8408 /* A suggested alternative to offer instead of the raw memory call.
8409 Empty string when none can be come up with. */
8410 const char *suggest = "";
8411 bool warned = false;
8413 switch (DECL_FUNCTION_CODE (fndecl))
8415 case BUILT_IN_MEMSET:
8416 if (!integer_zerop (args[1]))
8418 /* Diagnose setting non-copy-assignable or non-trivial types,
8419 or types with a private member, to (potentially) non-zero
8420 bytes. Since the value of the bytes being written is unknown,
8421 suggest using assignment instead (if one exists). Also warn
8422 for writes into objects for which zero-initialization doesn't
8423 mean all bits clear (pointer-to-member data, where null is all
8424 bits set). Since the value being written is (most likely)
8425 non-zero, simply suggest assignment (but not copy assignment). */
8426 suggest = "; use assignment instead";
8427 if (!trivassign)
8428 warnfmt = G_("%qD writing to an object of type %#qT with "
8429 "no trivial copy-assignment");
8430 else if (!trivial)
8431 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8432 else if (fld)
8434 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8435 warned = warning_at (loc, OPT_Wclass_memaccess,
8436 "%qD writing to an object of type %#qT with "
8437 "%qs member %qD",
8438 fndecl, desttype, access, fld);
8440 else if (!zero_init_p (desttype))
8441 warnfmt = G_("%qD writing to an object of type %#qT containing "
8442 "a pointer to data member%s");
8444 break;
8446 /* Fall through. */
8448 case BUILT_IN_BZERO:
8449 /* Similarly to the above, diagnose clearing non-trivial or non-
8450 standard layout objects, or objects of types with no assignmenmt.
8451 Since the value being written is known to be zero, suggest either
8452 copy assignment, copy ctor, or default ctor as an alternative,
8453 depending on what's available. */
8455 if (hasassign && hasctors[0])
8456 suggest = G_("; use assignment or value-initialization instead");
8457 else if (hasassign)
8458 suggest = G_("; use assignment instead");
8459 else if (hasctors[0])
8460 suggest = G_("; use value-initialization instead");
8462 if (!trivassign)
8463 warnfmt = G_("%qD clearing an object of type %#qT with "
8464 "no trivial copy-assignment%s");
8465 else if (!trivial)
8466 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8467 else if (!zero_init_p (desttype))
8468 warnfmt = G_("%qD clearing an object of type %#qT containing "
8469 "a pointer-to-member%s");
8470 break;
8472 case BUILT_IN_BCOPY:
8473 case BUILT_IN_MEMCPY:
8474 case BUILT_IN_MEMMOVE:
8475 case BUILT_IN_MEMPCPY:
8476 /* Determine the type of the source object. */
8477 srctype = STRIP_NOPS (args[srcidx]);
8478 srctype = TREE_TYPE (TREE_TYPE (srctype));
8480 /* Since it's impossible to determine wheter the byte copy is
8481 being used in place of assignment to an existing object or
8482 as a substitute for initialization, assume it's the former.
8483 Determine the best alternative to use instead depending on
8484 what's not deleted. */
8485 if (hasassign && hasctors[1])
8486 suggest = G_("; use copy-assignment or copy-initialization instead");
8487 else if (hasassign)
8488 suggest = G_("; use copy-assignment instead");
8489 else if (hasctors[1])
8490 suggest = G_("; use copy-initialization instead");
8492 if (!trivassign)
8493 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8494 "copy-assignment%s");
8495 else if (!trivially_copyable_p (desttype))
8496 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8497 "type %#qT%s");
8498 else if (!trivcopy)
8499 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8501 else if (!trivial
8502 && !VOID_TYPE_P (srctype)
8503 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8504 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8505 srctype))
8507 /* Warn when copying into a non-trivial object from an object
8508 of a different type other than void or char. */
8509 warned = warning_at (loc, OPT_Wclass_memaccess,
8510 "%qD copying an object of non-trivial type "
8511 "%#qT from an array of %#qT",
8512 fndecl, desttype, srctype);
8514 else if (fld
8515 && !VOID_TYPE_P (srctype)
8516 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8517 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8518 srctype))
8520 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8521 warned = warning_at (loc, OPT_Wclass_memaccess,
8522 "%qD copying an object of type %#qT with "
8523 "%qs member %qD from an array of %#qT; use "
8524 "assignment or copy-initialization instead",
8525 fndecl, desttype, access, fld, srctype);
8527 else if (!trivial && TREE_CODE (args[2]) == INTEGER_CST)
8529 /* Finally, warn on partial copies. */
8530 unsigned HOST_WIDE_INT typesize
8531 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8532 if (unsigned HOST_WIDE_INT partial
8533 = tree_to_uhwi (args[2]) % typesize)
8534 warned = warning_at (loc, OPT_Wclass_memaccess,
8535 (typesize - partial > 1
8536 ? G_("%qD writing to an object of "
8537 "a non-trivial type %#qT leaves %wu "
8538 "bytes unchanged")
8539 : G_("%qD writing to an object of "
8540 "a non-trivial type %#qT leaves %wu "
8541 "byte unchanged")),
8542 fndecl, desttype, typesize - partial);
8544 break;
8546 case BUILT_IN_REALLOC:
8548 if (!trivially_copyable_p (desttype))
8549 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8550 "%#qT; use %<new%> and %<delete%> instead");
8551 else if (!trivcopy)
8552 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8553 "constructor; use %<new%> and %<delete%> instead");
8554 else if (!get_dtor (desttype, tf_none))
8555 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8556 "destructor");
8557 else if (!trivial
8558 && TREE_CODE (args[1]) == INTEGER_CST
8559 && tree_int_cst_lt (args[1], TYPE_SIZE_UNIT (desttype)))
8561 /* Finally, warn on reallocation into insufficient space. */
8562 warned = warning_at (loc, OPT_Wclass_memaccess,
8563 "%qD moving an object of non-trivial type "
8564 "%#qT and size %E into a region of size %E",
8565 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8566 args[1]);
8568 break;
8570 default:
8571 return;
8574 if (!warned && !warnfmt)
8575 return;
8577 if (warnfmt)
8579 if (suggest)
8580 warned = warning_at (loc, OPT_Wclass_memaccess,
8581 warnfmt, fndecl, desttype, suggest);
8582 else
8583 warned = warning_at (loc, OPT_Wclass_memaccess,
8584 warnfmt, fndecl, desttype);
8587 if (warned)
8588 inform (location_of (desttype), "%#qT declared here", desttype);
8591 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8592 This function performs no overload resolution, conversion, or other
8593 high-level operations. */
8595 tree
8596 build_cxx_call (tree fn, int nargs, tree *argarray,
8597 tsubst_flags_t complain)
8599 tree fndecl;
8601 /* Remember roughly where this call is. */
8602 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8603 fn = build_call_a (fn, nargs, argarray);
8604 SET_EXPR_LOCATION (fn, loc);
8606 fndecl = get_callee_fndecl (fn);
8608 /* Check that arguments to builtin functions match the expectations. */
8609 if (fndecl
8610 && DECL_BUILT_IN (fndecl)
8611 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8613 int i;
8615 /* We need to take care that values to BUILT_IN_NORMAL
8616 are reduced. */
8617 for (i = 0; i < nargs; i++)
8618 argarray[i] = fold_non_dependent_expr (argarray[i]);
8620 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8621 nargs, argarray))
8622 return error_mark_node;
8624 /* Warn if the built-in writes to an object of a non-trivial type. */
8625 if (nargs)
8626 maybe_warn_class_memaccess (loc, fndecl, argarray);
8629 /* If it is a built-in array notation function, then the return type of
8630 the function is the element type of the array passed in as array
8631 notation (i.e. the first parameter of the function). */
8632 if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR)
8634 enum built_in_function bif =
8635 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn));
8636 if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8637 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8638 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8639 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8640 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE
8641 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING)
8643 if (call_expr_nargs (fn) == 0)
8645 error_at (EXPR_LOCATION (fn), "Invalid builtin arguments");
8646 return error_mark_node;
8648 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8649 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8650 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8651 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8652 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8653 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8654 The pre-defined return-type is the correct one. */
8655 tree array_ntn = CALL_EXPR_ARG (fn, 0);
8656 TREE_TYPE (fn) = TREE_TYPE (array_ntn);
8657 return fn;
8661 if (VOID_TYPE_P (TREE_TYPE (fn)))
8662 return fn;
8664 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8665 function call is either the operand of a decltype-specifier or the
8666 right operand of a comma operator that is the operand of a
8667 decltype-specifier, a temporary object is not introduced for the
8668 prvalue. The type of the prvalue may be incomplete. */
8669 if (!(complain & tf_decltype))
8671 fn = require_complete_type_sfinae (fn, complain);
8672 if (fn == error_mark_node)
8673 return error_mark_node;
8675 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8677 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8678 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8681 return convert_from_reference (fn);
8684 /* Returns the value to use for the in-charge parameter when making a
8685 call to a function with the indicated NAME.
8687 FIXME:Can't we find a neater way to do this mapping? */
8689 tree
8690 in_charge_arg_for_name (tree name)
8692 if (IDENTIFIER_CTOR_P (name))
8694 if (name == complete_ctor_identifier)
8695 return integer_one_node;
8696 gcc_checking_assert (name == base_ctor_identifier);
8698 else
8700 if (name == complete_dtor_identifier)
8701 return integer_two_node;
8702 else if (name == deleting_dtor_identifier)
8703 return integer_three_node;
8704 gcc_checking_assert (name == base_dtor_identifier);
8707 return integer_zero_node;
8710 /* We've built up a constructor call RET. Complain if it delegates to the
8711 constructor we're currently compiling. */
8713 static void
8714 check_self_delegation (tree ret)
8716 if (TREE_CODE (ret) == TARGET_EXPR)
8717 ret = TARGET_EXPR_INITIAL (ret);
8718 tree fn = cp_get_callee_fndecl (ret);
8719 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8720 error ("constructor delegates to itself");
8723 /* Build a call to a constructor, destructor, or an assignment
8724 operator for INSTANCE, an expression with class type. NAME
8725 indicates the special member function to call; *ARGS are the
8726 arguments. ARGS may be NULL. This may change ARGS. BINFO
8727 indicates the base of INSTANCE that is to be passed as the `this'
8728 parameter to the member function called.
8730 FLAGS are the LOOKUP_* flags to use when processing the call.
8732 If NAME indicates a complete object constructor, INSTANCE may be
8733 NULL_TREE. In this case, the caller will call build_cplus_new to
8734 store the newly constructed object into a VAR_DECL. */
8736 tree
8737 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8738 tree binfo, int flags, tsubst_flags_t complain)
8740 tree fns;
8741 /* The type of the subobject to be constructed or destroyed. */
8742 tree class_type;
8743 vec<tree, va_gc> *allocated = NULL;
8744 tree ret;
8746 gcc_assert (IDENTIFIER_CDTOR_P (name)
8747 || name == cp_assignment_operator_id (NOP_EXPR));
8748 if (TYPE_P (binfo))
8750 /* Resolve the name. */
8751 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8752 return error_mark_node;
8754 binfo = TYPE_BINFO (binfo);
8757 gcc_assert (binfo != NULL_TREE);
8759 class_type = BINFO_TYPE (binfo);
8761 /* Handle the special case where INSTANCE is NULL_TREE. */
8762 if (name == complete_ctor_identifier && !instance)
8763 instance = build_dummy_object (class_type);
8764 else
8766 if (IDENTIFIER_DTOR_P (name))
8767 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8769 /* Convert to the base class, if necessary. */
8770 if (!same_type_ignoring_top_level_qualifiers_p
8771 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8773 if (name != cp_assignment_operator_id (NOP_EXPR))
8774 /* For constructors and destructors, either the base is
8775 non-virtual, or it is virtual but we are doing the
8776 conversion from a constructor or destructor for the
8777 complete object. In either case, we can convert
8778 statically. */
8779 instance = convert_to_base_statically (instance, binfo);
8780 else
8781 /* However, for assignment operators, we must convert
8782 dynamically if the base is virtual. */
8783 instance = build_base_path (PLUS_EXPR, instance,
8784 binfo, /*nonnull=*/1, complain);
8788 gcc_assert (instance != NULL_TREE);
8790 /* In C++17, "If the initializer expression is a prvalue and the
8791 cv-unqualified version of the source type is the same class as the class
8792 of the destination, the initializer expression is used to initialize the
8793 destination object." Handle that here to avoid doing overload
8794 resolution. */
8795 if (cxx_dialect >= cxx1z
8796 && args && vec_safe_length (*args) == 1
8797 && name == complete_ctor_identifier)
8799 tree arg = (**args)[0];
8801 /* FIXME P0135 doesn't say how to handle direct initialization from a
8802 type with a suitable conversion operator. Let's handle it like
8803 copy-initialization, but allowing explict conversions. */
8804 tsubst_flags_t sub_complain = tf_warning;
8805 if (!is_dummy_object (instance))
8806 /* If we're using this to initialize a non-temporary object, don't
8807 require the destructor to be accessible. */
8808 sub_complain |= tf_no_cleanup;
8809 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8810 arg = perform_implicit_conversion_flags (class_type, arg,
8811 sub_complain,
8812 flags);
8813 if ((TREE_CODE (arg) == TARGET_EXPR
8814 || TREE_CODE (arg) == CONSTRUCTOR)
8815 && (same_type_ignoring_top_level_qualifiers_p
8816 (class_type, TREE_TYPE (arg))))
8818 if (is_dummy_object (instance))
8819 return arg;
8820 if ((complain & tf_error)
8821 && (flags & LOOKUP_DELEGATING_CONS))
8822 check_self_delegation (arg);
8823 /* Avoid change of behavior on Wunused-var-2.C. */
8824 mark_lvalue_use (instance);
8825 return build2 (INIT_EXPR, class_type, instance, arg);
8829 fns = lookup_fnfields (binfo, name, 1);
8831 /* When making a call to a constructor or destructor for a subobject
8832 that uses virtual base classes, pass down a pointer to a VTT for
8833 the subobject. */
8834 if ((name == base_ctor_identifier
8835 || name == base_dtor_identifier)
8836 && CLASSTYPE_VBASECLASSES (class_type))
8838 tree vtt;
8839 tree sub_vtt;
8841 /* If the current function is a complete object constructor
8842 or destructor, then we fetch the VTT directly.
8843 Otherwise, we look it up using the VTT we were given. */
8844 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8845 vtt = decay_conversion (vtt, complain);
8846 if (vtt == error_mark_node)
8847 return error_mark_node;
8848 vtt = build_if_in_charge (vtt, current_vtt_parm);
8849 if (BINFO_SUBVTT_INDEX (binfo))
8850 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8851 else
8852 sub_vtt = vtt;
8854 if (args == NULL)
8856 allocated = make_tree_vector ();
8857 args = &allocated;
8860 vec_safe_insert (*args, 0, sub_vtt);
8863 ret = build_new_method_call (instance, fns, args,
8864 TYPE_BINFO (BINFO_TYPE (binfo)),
8865 flags, /*fn=*/NULL,
8866 complain);
8868 if (allocated != NULL)
8869 release_tree_vector (allocated);
8871 if ((complain & tf_error)
8872 && (flags & LOOKUP_DELEGATING_CONS)
8873 && name == complete_ctor_identifier)
8874 check_self_delegation (ret);
8876 return ret;
8879 /* Return the NAME, as a C string. The NAME indicates a function that
8880 is a member of TYPE. *FREE_P is set to true if the caller must
8881 free the memory returned.
8883 Rather than go through all of this, we should simply set the names
8884 of constructors and destructors appropriately, and dispense with
8885 ctor_identifier, dtor_identifier, etc. */
8887 static char *
8888 name_as_c_string (tree name, tree type, bool *free_p)
8890 const char *pretty_name;
8892 /* Assume that we will not allocate memory. */
8893 *free_p = false;
8894 /* Constructors and destructors are special. */
8895 if (IDENTIFIER_CDTOR_P (name))
8897 pretty_name
8898 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
8899 /* For a destructor, add the '~'. */
8900 if (IDENTIFIER_DTOR_P (name))
8902 pretty_name = concat ("~", pretty_name, NULL);
8903 /* Remember that we need to free the memory allocated. */
8904 *free_p = true;
8907 else if (IDENTIFIER_CONV_OP_P (name))
8909 pretty_name = concat ("operator ",
8910 type_as_string_translate (TREE_TYPE (name),
8911 TFF_PLAIN_IDENTIFIER),
8912 NULL);
8913 /* Remember that we need to free the memory allocated. */
8914 *free_p = true;
8916 else
8917 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
8919 return CONST_CAST (char *, pretty_name);
8922 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8923 be set, upon return, to the function called. ARGS may be NULL.
8924 This may change ARGS. */
8926 static tree
8927 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8928 tree conversion_path, int flags,
8929 tree *fn_p, tsubst_flags_t complain)
8931 struct z_candidate *candidates = 0, *cand;
8932 tree explicit_targs = NULL_TREE;
8933 tree basetype = NULL_TREE;
8934 tree access_binfo, binfo;
8935 tree optype;
8936 tree first_mem_arg = NULL_TREE;
8937 tree name;
8938 bool skip_first_for_error;
8939 vec<tree, va_gc> *user_args;
8940 tree call;
8941 tree fn;
8942 int template_only = 0;
8943 bool any_viable_p;
8944 tree orig_instance;
8945 tree orig_fns;
8946 vec<tree, va_gc> *orig_args = NULL;
8947 void *p;
8949 gcc_assert (instance != NULL_TREE);
8951 /* We don't know what function we're going to call, yet. */
8952 if (fn_p)
8953 *fn_p = NULL_TREE;
8955 if (error_operand_p (instance)
8956 || !fns || error_operand_p (fns))
8957 return error_mark_node;
8959 if (!BASELINK_P (fns))
8961 if (complain & tf_error)
8962 error ("call to non-function %qD", fns);
8963 return error_mark_node;
8966 orig_instance = instance;
8967 orig_fns = fns;
8969 /* Dismantle the baselink to collect all the information we need. */
8970 if (!conversion_path)
8971 conversion_path = BASELINK_BINFO (fns);
8972 access_binfo = BASELINK_ACCESS_BINFO (fns);
8973 binfo = BASELINK_BINFO (fns);
8974 optype = BASELINK_OPTYPE (fns);
8975 fns = BASELINK_FUNCTIONS (fns);
8976 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8978 explicit_targs = TREE_OPERAND (fns, 1);
8979 fns = TREE_OPERAND (fns, 0);
8980 template_only = 1;
8982 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8983 || TREE_CODE (fns) == TEMPLATE_DECL
8984 || TREE_CODE (fns) == OVERLOAD);
8985 fn = OVL_FIRST (fns);
8986 name = DECL_NAME (fn);
8988 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8989 gcc_assert (CLASS_TYPE_P (basetype));
8991 if (processing_template_decl)
8993 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8994 instance = build_non_dependent_expr (instance);
8995 if (args != NULL)
8996 make_args_non_dependent (*args);
8999 user_args = args == NULL ? NULL : *args;
9000 /* Under DR 147 A::A() is an invalid constructor call,
9001 not a functional cast. */
9002 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
9004 if (! (complain & tf_error))
9005 return error_mark_node;
9007 basetype = DECL_CONTEXT (fn);
9008 name = constructor_name (basetype);
9009 if (permerror (input_location,
9010 "cannot call constructor %<%T::%D%> directly",
9011 basetype, name))
9012 inform (input_location, "for a function-style cast, remove the "
9013 "redundant %<::%D%>", name);
9014 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9015 complain);
9016 return call;
9019 /* Process the argument list. */
9020 if (args != NULL && *args != NULL)
9022 *args = resolve_args (*args, complain);
9023 if (*args == NULL)
9024 return error_mark_node;
9027 /* Consider the object argument to be used even if we end up selecting a
9028 static member function. */
9029 instance = mark_type_use (instance);
9032 /* Figure out whether to skip the first argument for the error
9033 message we will display to users if an error occurs. We don't
9034 want to display any compiler-generated arguments. The "this"
9035 pointer hasn't been added yet. However, we must remove the VTT
9036 pointer if this is a call to a base-class constructor or
9037 destructor. */
9038 skip_first_for_error = false;
9039 if (IDENTIFIER_CDTOR_P (name))
9041 /* Callers should explicitly indicate whether they want to ctor
9042 the complete object or just the part without virtual bases. */
9043 gcc_assert (name != ctor_identifier);
9045 /* Remove the VTT pointer, if present. */
9046 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9047 && CLASSTYPE_VBASECLASSES (basetype))
9048 skip_first_for_error = true;
9050 /* It's OK to call destructors and constructors on cv-qualified
9051 objects. Therefore, convert the INSTANCE to the unqualified
9052 type, if necessary. */
9053 if (!same_type_p (basetype, TREE_TYPE (instance)))
9055 instance = build_this (instance);
9056 instance = build_nop (build_pointer_type (basetype), instance);
9057 instance = build_fold_indirect_ref (instance);
9060 else
9061 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9063 /* For the overload resolution we need to find the actual `this`
9064 that would be captured if the call turns out to be to a
9065 non-static member function. Do not actually capture it at this
9066 point. */
9067 if (DECL_CONSTRUCTOR_P (fn))
9068 /* Constructors don't use the enclosing 'this'. */
9069 first_mem_arg = instance;
9070 else
9071 first_mem_arg = maybe_resolve_dummy (instance, false);
9073 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9074 p = conversion_obstack_alloc (0);
9076 /* The number of arguments artificial parms in ARGS; we subtract one because
9077 there's no 'this' in ARGS. */
9078 unsigned skip = num_artificial_parms_for (fn) - 1;
9080 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9081 initializer, not T({ }). */
9082 if (DECL_CONSTRUCTOR_P (fn)
9083 && vec_safe_length (user_args) > skip
9084 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9086 tree init_list = (*user_args)[skip];
9087 tree init = NULL_TREE;
9089 gcc_assert (user_args->length () == skip + 1
9090 && !(flags & LOOKUP_ONLYCONVERTING));
9092 /* If the initializer list has no elements and T is a class type with
9093 a default constructor, the object is value-initialized. Handle
9094 this here so we don't need to handle it wherever we use
9095 build_special_member_call. */
9096 if (CONSTRUCTOR_NELTS (init_list) == 0
9097 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9098 /* For a user-provided default constructor, use the normal
9099 mechanisms so that protected access works. */
9100 && type_has_non_user_provided_default_constructor (basetype)
9101 && !processing_template_decl)
9102 init = build_value_init (basetype, complain);
9104 /* If BASETYPE is an aggregate, we need to do aggregate
9105 initialization. */
9106 else if (CP_AGGREGATE_TYPE_P (basetype))
9108 init = reshape_init (basetype, init_list, complain);
9109 init = digest_init (basetype, init, complain);
9112 if (init)
9114 if (is_dummy_object (instance))
9115 return get_target_expr_sfinae (init, complain);
9116 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9117 TREE_SIDE_EFFECTS (init) = true;
9118 return init;
9121 /* Otherwise go ahead with overload resolution. */
9122 add_list_candidates (fns, first_mem_arg, user_args,
9123 basetype, explicit_targs, template_only,
9124 conversion_path, access_binfo, flags,
9125 &candidates, complain);
9127 else
9128 add_candidates (fns, first_mem_arg, user_args, optype,
9129 explicit_targs, template_only, conversion_path,
9130 access_binfo, flags, &candidates, complain);
9132 any_viable_p = false;
9133 candidates = splice_viable (candidates, false, &any_viable_p);
9135 if (!any_viable_p)
9137 if (complain & tf_error)
9139 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9140 cxx_incomplete_type_error (instance, basetype);
9141 else if (optype)
9142 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9143 basetype, optype, build_tree_list_vec (user_args),
9144 TREE_TYPE (instance));
9145 else
9147 tree arglist = build_tree_list_vec (user_args);
9148 tree errname = name;
9149 bool twiddle = false;
9150 if (IDENTIFIER_CDTOR_P (errname))
9152 twiddle = IDENTIFIER_DTOR_P (errname);
9153 errname = constructor_name (basetype);
9155 if (explicit_targs)
9156 errname = lookup_template_function (errname, explicit_targs);
9157 if (skip_first_for_error)
9158 arglist = TREE_CHAIN (arglist);
9159 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9160 basetype, &"~"[!twiddle], errname, arglist,
9161 TREE_TYPE (instance));
9163 print_z_candidates (location_of (name), candidates);
9165 call = error_mark_node;
9167 else
9169 cand = tourney (candidates, complain);
9170 if (cand == 0)
9172 char *pretty_name;
9173 bool free_p;
9174 tree arglist;
9176 if (complain & tf_error)
9178 pretty_name = name_as_c_string (name, basetype, &free_p);
9179 arglist = build_tree_list_vec (user_args);
9180 if (skip_first_for_error)
9181 arglist = TREE_CHAIN (arglist);
9182 if (!any_strictly_viable (candidates))
9183 error ("no matching function for call to %<%s(%A)%>",
9184 pretty_name, arglist);
9185 else
9186 error ("call of overloaded %<%s(%A)%> is ambiguous",
9187 pretty_name, arglist);
9188 print_z_candidates (location_of (name), candidates);
9189 if (free_p)
9190 free (pretty_name);
9192 call = error_mark_node;
9194 else
9196 fn = cand->fn;
9197 call = NULL_TREE;
9199 if (!(flags & LOOKUP_NONVIRTUAL)
9200 && DECL_PURE_VIRTUAL_P (fn)
9201 && instance == current_class_ref
9202 && (complain & tf_warning))
9204 /* This is not an error, it is runtime undefined
9205 behavior. */
9206 if (!current_function_decl)
9207 warning (0, "pure virtual %q#D called from "
9208 "non-static data member initializer", fn);
9209 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9210 || DECL_DESTRUCTOR_P (current_function_decl))
9211 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9212 ? G_("pure virtual %q#D called from constructor")
9213 : G_("pure virtual %q#D called from destructor")),
9214 fn);
9217 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9218 && !DECL_CONSTRUCTOR_P (fn)
9219 && is_dummy_object (instance))
9221 instance = maybe_resolve_dummy (instance, true);
9222 if (instance == error_mark_node)
9223 call = error_mark_node;
9224 else if (!is_dummy_object (instance))
9226 /* We captured 'this' in the current lambda now that
9227 we know we really need it. */
9228 cand->first_arg = instance;
9230 else if (any_dependent_bases_p ())
9231 /* We can't tell until instantiation time whether we can use
9232 *this as the implicit object argument. */;
9233 else
9235 if (complain & tf_error)
9236 error ("cannot call member function %qD without object",
9237 fn);
9238 call = error_mark_node;
9242 if (call != error_mark_node)
9244 /* Optimize away vtable lookup if we know that this
9245 function can't be overridden. We need to check if
9246 the context and the type where we found fn are the same,
9247 actually FN might be defined in a different class
9248 type because of a using-declaration. In this case, we
9249 do not want to perform a non-virtual call. */
9250 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9251 && same_type_ignoring_top_level_qualifiers_p
9252 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9253 && resolves_to_fixed_type_p (instance, 0))
9254 flags |= LOOKUP_NONVIRTUAL;
9255 if (explicit_targs)
9256 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9257 /* Now we know what function is being called. */
9258 if (fn_p)
9259 *fn_p = fn;
9260 /* Build the actual CALL_EXPR. */
9261 call = build_over_call (cand, flags, complain);
9262 /* In an expression of the form `a->f()' where `f' turns
9263 out to be a static member function, `a' is
9264 none-the-less evaluated. */
9265 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9266 && !is_dummy_object (instance)
9267 && TREE_SIDE_EFFECTS (instance))
9268 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
9269 instance, call);
9270 else if (call != error_mark_node
9271 && DECL_DESTRUCTOR_P (cand->fn)
9272 && !VOID_TYPE_P (TREE_TYPE (call)))
9273 /* An explicit call of the form "x->~X()" has type
9274 "void". However, on platforms where destructors
9275 return "this" (i.e., those where
9276 targetm.cxx.cdtor_returns_this is true), such calls
9277 will appear to have a return value of pointer type
9278 to the low-level call machinery. We do not want to
9279 change the low-level machinery, since we want to be
9280 able to optimize "delete f()" on such platforms as
9281 "operator delete(~X(f()))" (rather than generating
9282 "t = f(), ~X(t), operator delete (t)"). */
9283 call = build_nop (void_type_node, call);
9288 if (processing_template_decl && call != error_mark_node)
9290 bool cast_to_void = false;
9292 if (TREE_CODE (call) == COMPOUND_EXPR)
9293 call = TREE_OPERAND (call, 1);
9294 else if (TREE_CODE (call) == NOP_EXPR)
9296 cast_to_void = true;
9297 call = TREE_OPERAND (call, 0);
9299 if (INDIRECT_REF_P (call))
9300 call = TREE_OPERAND (call, 0);
9301 call = (build_min_non_dep_call_vec
9302 (call,
9303 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9304 orig_instance, orig_fns, NULL_TREE),
9305 orig_args));
9306 SET_EXPR_LOCATION (call, input_location);
9307 call = convert_from_reference (call);
9308 if (cast_to_void)
9309 call = build_nop (void_type_node, call);
9312 /* Free all the conversions we allocated. */
9313 obstack_free (&conversion_obstack, p);
9315 if (orig_args != NULL)
9316 release_tree_vector (orig_args);
9318 return call;
9321 /* Wrapper for above. */
9323 tree
9324 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9325 tree conversion_path, int flags,
9326 tree *fn_p, tsubst_flags_t complain)
9328 tree ret;
9329 bool subtime = timevar_cond_start (TV_OVERLOAD);
9330 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9331 fn_p, complain);
9332 timevar_cond_stop (TV_OVERLOAD, subtime);
9333 return ret;
9336 /* Returns true iff standard conversion sequence ICS1 is a proper
9337 subsequence of ICS2. */
9339 static bool
9340 is_subseq (conversion *ics1, conversion *ics2)
9342 /* We can assume that a conversion of the same code
9343 between the same types indicates a subsequence since we only get
9344 here if the types we are converting from are the same. */
9346 while (ics1->kind == ck_rvalue
9347 || ics1->kind == ck_lvalue)
9348 ics1 = next_conversion (ics1);
9350 while (1)
9352 while (ics2->kind == ck_rvalue
9353 || ics2->kind == ck_lvalue)
9354 ics2 = next_conversion (ics2);
9356 if (ics2->kind == ck_user
9357 || ics2->kind == ck_ambig
9358 || ics2->kind == ck_aggr
9359 || ics2->kind == ck_list
9360 || ics2->kind == ck_identity)
9361 /* At this point, ICS1 cannot be a proper subsequence of
9362 ICS2. We can get a USER_CONV when we are comparing the
9363 second standard conversion sequence of two user conversion
9364 sequences. */
9365 return false;
9367 ics2 = next_conversion (ics2);
9369 while (ics2->kind == ck_rvalue
9370 || ics2->kind == ck_lvalue)
9371 ics2 = next_conversion (ics2);
9373 if (ics2->kind == ics1->kind
9374 && same_type_p (ics2->type, ics1->type)
9375 && (ics1->kind == ck_identity
9376 || same_type_p (next_conversion (ics2)->type,
9377 next_conversion (ics1)->type)))
9378 return true;
9382 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9383 be any _TYPE nodes. */
9385 bool
9386 is_properly_derived_from (tree derived, tree base)
9388 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9389 return false;
9391 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9392 considers every class derived from itself. */
9393 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9394 && DERIVED_FROM_P (base, derived));
9397 /* We build the ICS for an implicit object parameter as a pointer
9398 conversion sequence. However, such a sequence should be compared
9399 as if it were a reference conversion sequence. If ICS is the
9400 implicit conversion sequence for an implicit object parameter,
9401 modify it accordingly. */
9403 static void
9404 maybe_handle_implicit_object (conversion **ics)
9406 if ((*ics)->this_p)
9408 /* [over.match.funcs]
9410 For non-static member functions, the type of the
9411 implicit object parameter is "reference to cv X"
9412 where X is the class of which the function is a
9413 member and cv is the cv-qualification on the member
9414 function declaration. */
9415 conversion *t = *ics;
9416 tree reference_type;
9418 /* The `this' parameter is a pointer to a class type. Make the
9419 implicit conversion talk about a reference to that same class
9420 type. */
9421 reference_type = TREE_TYPE (t->type);
9422 reference_type = build_reference_type (reference_type);
9424 if (t->kind == ck_qual)
9425 t = next_conversion (t);
9426 if (t->kind == ck_ptr)
9427 t = next_conversion (t);
9428 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9429 t = direct_reference_binding (reference_type, t);
9430 t->this_p = 1;
9431 t->rvaluedness_matches_p = 0;
9432 *ics = t;
9436 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9437 and return the initial reference binding conversion. Otherwise,
9438 leave *ICS unchanged and return NULL. */
9440 static conversion *
9441 maybe_handle_ref_bind (conversion **ics)
9443 if ((*ics)->kind == ck_ref_bind)
9445 conversion *old_ics = *ics;
9446 *ics = next_conversion (old_ics);
9447 (*ics)->user_conv_p = old_ics->user_conv_p;
9448 return old_ics;
9451 return NULL;
9454 /* Compare two implicit conversion sequences according to the rules set out in
9455 [over.ics.rank]. Return values:
9457 1: ics1 is better than ics2
9458 -1: ics2 is better than ics1
9459 0: ics1 and ics2 are indistinguishable */
9461 static int
9462 compare_ics (conversion *ics1, conversion *ics2)
9464 tree from_type1;
9465 tree from_type2;
9466 tree to_type1;
9467 tree to_type2;
9468 tree deref_from_type1 = NULL_TREE;
9469 tree deref_from_type2 = NULL_TREE;
9470 tree deref_to_type1 = NULL_TREE;
9471 tree deref_to_type2 = NULL_TREE;
9472 conversion_rank rank1, rank2;
9474 /* REF_BINDING is nonzero if the result of the conversion sequence
9475 is a reference type. In that case REF_CONV is the reference
9476 binding conversion. */
9477 conversion *ref_conv1;
9478 conversion *ref_conv2;
9480 /* Compare badness before stripping the reference conversion. */
9481 if (ics1->bad_p > ics2->bad_p)
9482 return -1;
9483 else if (ics1->bad_p < ics2->bad_p)
9484 return 1;
9486 /* Handle implicit object parameters. */
9487 maybe_handle_implicit_object (&ics1);
9488 maybe_handle_implicit_object (&ics2);
9490 /* Handle reference parameters. */
9491 ref_conv1 = maybe_handle_ref_bind (&ics1);
9492 ref_conv2 = maybe_handle_ref_bind (&ics2);
9494 /* List-initialization sequence L1 is a better conversion sequence than
9495 list-initialization sequence L2 if L1 converts to
9496 std::initializer_list<X> for some X and L2 does not. */
9497 if (ics1->kind == ck_list && ics2->kind != ck_list)
9498 return 1;
9499 if (ics2->kind == ck_list && ics1->kind != ck_list)
9500 return -1;
9502 /* [over.ics.rank]
9504 When comparing the basic forms of implicit conversion sequences (as
9505 defined in _over.best.ics_)
9507 --a standard conversion sequence (_over.ics.scs_) is a better
9508 conversion sequence than a user-defined conversion sequence
9509 or an ellipsis conversion sequence, and
9511 --a user-defined conversion sequence (_over.ics.user_) is a
9512 better conversion sequence than an ellipsis conversion sequence
9513 (_over.ics.ellipsis_). */
9514 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9515 mismatch. If both ICS are bad, we try to make a decision based on
9516 what would have happened if they'd been good. This is not an
9517 extension, we'll still give an error when we build up the call; this
9518 just helps us give a more helpful error message. */
9519 rank1 = BAD_CONVERSION_RANK (ics1);
9520 rank2 = BAD_CONVERSION_RANK (ics2);
9522 if (rank1 > rank2)
9523 return -1;
9524 else if (rank1 < rank2)
9525 return 1;
9527 if (ics1->ellipsis_p)
9528 /* Both conversions are ellipsis conversions. */
9529 return 0;
9531 /* User-defined conversion sequence U1 is a better conversion sequence
9532 than another user-defined conversion sequence U2 if they contain the
9533 same user-defined conversion operator or constructor and if the sec-
9534 ond standard conversion sequence of U1 is better than the second
9535 standard conversion sequence of U2. */
9537 /* Handle list-conversion with the same code even though it isn't always
9538 ranked as a user-defined conversion and it doesn't have a second
9539 standard conversion sequence; it will still have the desired effect.
9540 Specifically, we need to do the reference binding comparison at the
9541 end of this function. */
9543 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9545 conversion *t1;
9546 conversion *t2;
9548 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9549 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9550 || t1->kind == ck_list)
9551 break;
9552 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9553 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9554 || t2->kind == ck_list)
9555 break;
9557 if (t1->kind != t2->kind)
9558 return 0;
9559 else if (t1->kind == ck_user)
9561 tree f1 = t1->cand ? t1->cand->fn : t1->type;
9562 tree f2 = t2->cand ? t2->cand->fn : t2->type;
9563 if (f1 != f2)
9564 return 0;
9566 else
9568 /* For ambiguous or aggregate conversions, use the target type as
9569 a proxy for the conversion function. */
9570 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9571 return 0;
9574 /* We can just fall through here, after setting up
9575 FROM_TYPE1 and FROM_TYPE2. */
9576 from_type1 = t1->type;
9577 from_type2 = t2->type;
9579 else
9581 conversion *t1;
9582 conversion *t2;
9584 /* We're dealing with two standard conversion sequences.
9586 [over.ics.rank]
9588 Standard conversion sequence S1 is a better conversion
9589 sequence than standard conversion sequence S2 if
9591 --S1 is a proper subsequence of S2 (comparing the conversion
9592 sequences in the canonical form defined by _over.ics.scs_,
9593 excluding any Lvalue Transformation; the identity
9594 conversion sequence is considered to be a subsequence of
9595 any non-identity conversion sequence */
9597 t1 = ics1;
9598 while (t1->kind != ck_identity)
9599 t1 = next_conversion (t1);
9600 from_type1 = t1->type;
9602 t2 = ics2;
9603 while (t2->kind != ck_identity)
9604 t2 = next_conversion (t2);
9605 from_type2 = t2->type;
9608 /* One sequence can only be a subsequence of the other if they start with
9609 the same type. They can start with different types when comparing the
9610 second standard conversion sequence in two user-defined conversion
9611 sequences. */
9612 if (same_type_p (from_type1, from_type2))
9614 if (is_subseq (ics1, ics2))
9615 return 1;
9616 if (is_subseq (ics2, ics1))
9617 return -1;
9620 /* [over.ics.rank]
9622 Or, if not that,
9624 --the rank of S1 is better than the rank of S2 (by the rules
9625 defined below):
9627 Standard conversion sequences are ordered by their ranks: an Exact
9628 Match is a better conversion than a Promotion, which is a better
9629 conversion than a Conversion.
9631 Two conversion sequences with the same rank are indistinguishable
9632 unless one of the following rules applies:
9634 --A conversion that does not a convert a pointer, pointer to member,
9635 or std::nullptr_t to bool is better than one that does.
9637 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9638 so that we do not have to check it explicitly. */
9639 if (ics1->rank < ics2->rank)
9640 return 1;
9641 else if (ics2->rank < ics1->rank)
9642 return -1;
9644 to_type1 = ics1->type;
9645 to_type2 = ics2->type;
9647 /* A conversion from scalar arithmetic type to complex is worse than a
9648 conversion between scalar arithmetic types. */
9649 if (same_type_p (from_type1, from_type2)
9650 && ARITHMETIC_TYPE_P (from_type1)
9651 && ARITHMETIC_TYPE_P (to_type1)
9652 && ARITHMETIC_TYPE_P (to_type2)
9653 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9654 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9656 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9657 return -1;
9658 else
9659 return 1;
9662 if (TYPE_PTR_P (from_type1)
9663 && TYPE_PTR_P (from_type2)
9664 && TYPE_PTR_P (to_type1)
9665 && TYPE_PTR_P (to_type2))
9667 deref_from_type1 = TREE_TYPE (from_type1);
9668 deref_from_type2 = TREE_TYPE (from_type2);
9669 deref_to_type1 = TREE_TYPE (to_type1);
9670 deref_to_type2 = TREE_TYPE (to_type2);
9672 /* The rules for pointers to members A::* are just like the rules
9673 for pointers A*, except opposite: if B is derived from A then
9674 A::* converts to B::*, not vice versa. For that reason, we
9675 switch the from_ and to_ variables here. */
9676 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9677 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9678 || (TYPE_PTRMEMFUNC_P (from_type1)
9679 && TYPE_PTRMEMFUNC_P (from_type2)
9680 && TYPE_PTRMEMFUNC_P (to_type1)
9681 && TYPE_PTRMEMFUNC_P (to_type2)))
9683 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9684 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9685 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9686 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9689 if (deref_from_type1 != NULL_TREE
9690 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9691 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9693 /* This was one of the pointer or pointer-like conversions.
9695 [over.ics.rank]
9697 --If class B is derived directly or indirectly from class A,
9698 conversion of B* to A* is better than conversion of B* to
9699 void*, and conversion of A* to void* is better than
9700 conversion of B* to void*. */
9701 if (VOID_TYPE_P (deref_to_type1)
9702 && VOID_TYPE_P (deref_to_type2))
9704 if (is_properly_derived_from (deref_from_type1,
9705 deref_from_type2))
9706 return -1;
9707 else if (is_properly_derived_from (deref_from_type2,
9708 deref_from_type1))
9709 return 1;
9711 else if (VOID_TYPE_P (deref_to_type1)
9712 || VOID_TYPE_P (deref_to_type2))
9714 if (same_type_p (deref_from_type1, deref_from_type2))
9716 if (VOID_TYPE_P (deref_to_type2))
9718 if (is_properly_derived_from (deref_from_type1,
9719 deref_to_type1))
9720 return 1;
9722 /* We know that DEREF_TO_TYPE1 is `void' here. */
9723 else if (is_properly_derived_from (deref_from_type1,
9724 deref_to_type2))
9725 return -1;
9728 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9729 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9731 /* [over.ics.rank]
9733 --If class B is derived directly or indirectly from class A
9734 and class C is derived directly or indirectly from B,
9736 --conversion of C* to B* is better than conversion of C* to
9739 --conversion of B* to A* is better than conversion of C* to
9740 A* */
9741 if (same_type_p (deref_from_type1, deref_from_type2))
9743 if (is_properly_derived_from (deref_to_type1,
9744 deref_to_type2))
9745 return 1;
9746 else if (is_properly_derived_from (deref_to_type2,
9747 deref_to_type1))
9748 return -1;
9750 else if (same_type_p (deref_to_type1, deref_to_type2))
9752 if (is_properly_derived_from (deref_from_type2,
9753 deref_from_type1))
9754 return 1;
9755 else if (is_properly_derived_from (deref_from_type1,
9756 deref_from_type2))
9757 return -1;
9761 else if (CLASS_TYPE_P (non_reference (from_type1))
9762 && same_type_p (from_type1, from_type2))
9764 tree from = non_reference (from_type1);
9766 /* [over.ics.rank]
9768 --binding of an expression of type C to a reference of type
9769 B& is better than binding an expression of type C to a
9770 reference of type A&
9772 --conversion of C to B is better than conversion of C to A, */
9773 if (is_properly_derived_from (from, to_type1)
9774 && is_properly_derived_from (from, to_type2))
9776 if (is_properly_derived_from (to_type1, to_type2))
9777 return 1;
9778 else if (is_properly_derived_from (to_type2, to_type1))
9779 return -1;
9782 else if (CLASS_TYPE_P (non_reference (to_type1))
9783 && same_type_p (to_type1, to_type2))
9785 tree to = non_reference (to_type1);
9787 /* [over.ics.rank]
9789 --binding of an expression of type B to a reference of type
9790 A& is better than binding an expression of type C to a
9791 reference of type A&,
9793 --conversion of B to A is better than conversion of C to A */
9794 if (is_properly_derived_from (from_type1, to)
9795 && is_properly_derived_from (from_type2, to))
9797 if (is_properly_derived_from (from_type2, from_type1))
9798 return 1;
9799 else if (is_properly_derived_from (from_type1, from_type2))
9800 return -1;
9804 /* [over.ics.rank]
9806 --S1 and S2 differ only in their qualification conversion and yield
9807 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9808 qualification signature of type T1 is a proper subset of the cv-
9809 qualification signature of type T2 */
9810 if (ics1->kind == ck_qual
9811 && ics2->kind == ck_qual
9812 && same_type_p (from_type1, from_type2))
9814 int result = comp_cv_qual_signature (to_type1, to_type2);
9815 if (result != 0)
9816 return result;
9819 /* [over.ics.rank]
9821 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9822 to an implicit object parameter of a non-static member function
9823 declared without a ref-qualifier, and either S1 binds an lvalue
9824 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9825 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9826 draft standard, 13.3.3.2)
9828 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9829 types to which the references refer are the same type except for
9830 top-level cv-qualifiers, and the type to which the reference
9831 initialized by S2 refers is more cv-qualified than the type to
9832 which the reference initialized by S1 refers.
9834 DR 1328 [over.match.best]: the context is an initialization by
9835 conversion function for direct reference binding (13.3.1.6) of a
9836 reference to function type, the return type of F1 is the same kind of
9837 reference (i.e. lvalue or rvalue) as the reference being initialized,
9838 and the return type of F2 is not. */
9840 if (ref_conv1 && ref_conv2)
9842 if (!ref_conv1->this_p && !ref_conv2->this_p
9843 && (ref_conv1->rvaluedness_matches_p
9844 != ref_conv2->rvaluedness_matches_p)
9845 && (same_type_p (ref_conv1->type, ref_conv2->type)
9846 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9847 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9849 if (ref_conv1->bad_p
9850 && !same_type_p (TREE_TYPE (ref_conv1->type),
9851 TREE_TYPE (ref_conv2->type)))
9852 /* Don't prefer a bad conversion that drops cv-quals to a bad
9853 conversion with the wrong rvalueness. */
9854 return 0;
9855 return (ref_conv1->rvaluedness_matches_p
9856 - ref_conv2->rvaluedness_matches_p);
9859 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9861 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9862 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9863 if (ref_conv1->bad_p)
9865 /* Prefer the one that drops fewer cv-quals. */
9866 tree ftype = next_conversion (ref_conv1)->type;
9867 int fquals = cp_type_quals (ftype);
9868 q1 ^= fquals;
9869 q2 ^= fquals;
9871 return comp_cv_qualification (q2, q1);
9875 /* Neither conversion sequence is better than the other. */
9876 return 0;
9879 /* The source type for this standard conversion sequence. */
9881 static tree
9882 source_type (conversion *t)
9884 for (;; t = next_conversion (t))
9886 if (t->kind == ck_user
9887 || t->kind == ck_ambig
9888 || t->kind == ck_identity)
9889 return t->type;
9891 gcc_unreachable ();
9894 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9895 a pointer to LOSER and re-running joust to produce the warning if WINNER
9896 is actually used. */
9898 static void
9899 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9901 candidate_warning *cw = (candidate_warning *)
9902 conversion_obstack_alloc (sizeof (candidate_warning));
9903 cw->loser = loser;
9904 cw->next = winner->warnings;
9905 winner->warnings = cw;
9908 /* Compare two candidates for overloading as described in
9909 [over.match.best]. Return values:
9911 1: cand1 is better than cand2
9912 -1: cand2 is better than cand1
9913 0: cand1 and cand2 are indistinguishable */
9915 static int
9916 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9917 tsubst_flags_t complain)
9919 int winner = 0;
9920 int off1 = 0, off2 = 0;
9921 size_t i;
9922 size_t len;
9924 /* Candidates that involve bad conversions are always worse than those
9925 that don't. */
9926 if (cand1->viable > cand2->viable)
9927 return 1;
9928 if (cand1->viable < cand2->viable)
9929 return -1;
9931 /* If we have two pseudo-candidates for conversions to the same type,
9932 or two candidates for the same function, arbitrarily pick one. */
9933 if (cand1->fn == cand2->fn
9934 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9935 return 1;
9937 /* Prefer a non-deleted function over an implicitly deleted move
9938 constructor or assignment operator. This differs slightly from the
9939 wording for issue 1402 (which says the move op is ignored by overload
9940 resolution), but this way produces better error messages. */
9941 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9942 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9943 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9945 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9946 && move_fn_p (cand1->fn))
9947 return -1;
9948 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9949 && move_fn_p (cand2->fn))
9950 return 1;
9953 /* a viable function F1
9954 is defined to be a better function than another viable function F2 if
9955 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9956 ICSi(F2), and then */
9958 /* for some argument j, ICSj(F1) is a better conversion sequence than
9959 ICSj(F2) */
9961 /* For comparing static and non-static member functions, we ignore
9962 the implicit object parameter of the non-static function. The
9963 standard says to pretend that the static function has an object
9964 parm, but that won't work with operator overloading. */
9965 len = cand1->num_convs;
9966 if (len != cand2->num_convs)
9968 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9969 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9971 if (DECL_CONSTRUCTOR_P (cand1->fn)
9972 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9973 /* We're comparing a near-match list constructor and a near-match
9974 non-list constructor. Just treat them as unordered. */
9975 return 0;
9977 gcc_assert (static_1 != static_2);
9979 if (static_1)
9980 off2 = 1;
9981 else
9983 off1 = 1;
9984 --len;
9988 for (i = 0; i < len; ++i)
9990 conversion *t1 = cand1->convs[i + off1];
9991 conversion *t2 = cand2->convs[i + off2];
9992 int comp = compare_ics (t1, t2);
9994 if (comp != 0)
9996 if ((complain & tf_warning)
9997 && warn_sign_promo
9998 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9999 == cr_std + cr_promotion)
10000 && t1->kind == ck_std
10001 && t2->kind == ck_std
10002 && TREE_CODE (t1->type) == INTEGER_TYPE
10003 && TREE_CODE (t2->type) == INTEGER_TYPE
10004 && (TYPE_PRECISION (t1->type)
10005 == TYPE_PRECISION (t2->type))
10006 && (TYPE_UNSIGNED (next_conversion (t1)->type)
10007 || (TREE_CODE (next_conversion (t1)->type)
10008 == ENUMERAL_TYPE)))
10010 tree type = next_conversion (t1)->type;
10011 tree type1, type2;
10012 struct z_candidate *w, *l;
10013 if (comp > 0)
10014 type1 = t1->type, type2 = t2->type,
10015 w = cand1, l = cand2;
10016 else
10017 type1 = t2->type, type2 = t1->type,
10018 w = cand2, l = cand1;
10020 if (warn)
10022 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10023 type, type1, type2);
10024 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10026 else
10027 add_warning (w, l);
10030 if (winner && comp != winner)
10032 winner = 0;
10033 goto tweak;
10035 winner = comp;
10039 /* warn about confusing overload resolution for user-defined conversions,
10040 either between a constructor and a conversion op, or between two
10041 conversion ops. */
10042 if ((complain & tf_warning)
10043 && winner && warn_conversion && cand1->second_conv
10044 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10045 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10047 struct z_candidate *w, *l;
10048 bool give_warning = false;
10050 if (winner == 1)
10051 w = cand1, l = cand2;
10052 else
10053 w = cand2, l = cand1;
10055 /* We don't want to complain about `X::operator T1 ()'
10056 beating `X::operator T2 () const', when T2 is a no less
10057 cv-qualified version of T1. */
10058 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10059 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10061 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10062 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10064 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
10066 t = TREE_TYPE (t);
10067 f = TREE_TYPE (f);
10069 if (!comp_ptr_ttypes (t, f))
10070 give_warning = true;
10072 else
10073 give_warning = true;
10075 if (!give_warning)
10076 /*NOP*/;
10077 else if (warn)
10079 tree source = source_type (w->convs[0]);
10080 if (! DECL_CONSTRUCTOR_P (w->fn))
10081 source = TREE_TYPE (source);
10082 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10083 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10084 source, w->second_conv->type))
10086 inform (input_location, " because conversion sequence for the argument is better");
10089 else
10090 add_warning (w, l);
10093 if (winner)
10094 return winner;
10096 /* DR 495 moved this tiebreaker above the template ones. */
10097 /* or, if not that,
10098 the context is an initialization by user-defined conversion (see
10099 _dcl.init_ and _over.match.user_) and the standard conversion
10100 sequence from the return type of F1 to the destination type (i.e.,
10101 the type of the entity being initialized) is a better conversion
10102 sequence than the standard conversion sequence from the return type
10103 of F2 to the destination type. */
10105 if (cand1->second_conv)
10107 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10108 if (winner)
10109 return winner;
10112 /* or, if not that,
10113 F1 is a non-template function and F2 is a template function
10114 specialization. */
10116 if (!cand1->template_decl && cand2->template_decl)
10117 return 1;
10118 else if (cand1->template_decl && !cand2->template_decl)
10119 return -1;
10121 /* or, if not that,
10122 F1 and F2 are template functions and the function template for F1 is
10123 more specialized than the template for F2 according to the partial
10124 ordering rules. */
10126 if (cand1->template_decl && cand2->template_decl)
10128 winner = more_specialized_fn
10129 (TI_TEMPLATE (cand1->template_decl),
10130 TI_TEMPLATE (cand2->template_decl),
10131 /* [temp.func.order]: The presence of unused ellipsis and default
10132 arguments has no effect on the partial ordering of function
10133 templates. add_function_candidate() will not have
10134 counted the "this" argument for constructors. */
10135 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10136 if (winner)
10137 return winner;
10140 // C++ Concepts
10141 // or, if not that, F1 is more constrained than F2.
10142 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10144 winner = more_constrained (cand1->fn, cand2->fn);
10145 if (winner)
10146 return winner;
10149 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10150 if (deduction_guide_p (cand1->fn))
10152 gcc_assert (deduction_guide_p (cand2->fn));
10153 /* We distinguish between candidates from an explicit deduction guide and
10154 candidates built from a constructor based on DECL_ARTIFICIAL. */
10155 int art1 = DECL_ARTIFICIAL (cand1->fn);
10156 int art2 = DECL_ARTIFICIAL (cand2->fn);
10157 if (art1 != art2)
10158 return art2 - art1;
10160 if (art1)
10162 /* Prefer the special copy guide over a declared copy/move
10163 constructor. */
10164 if (copy_guide_p (cand1->fn))
10165 return 1;
10166 if (copy_guide_p (cand2->fn))
10167 return -1;
10169 /* Prefer a candidate generated from a non-template constructor. */
10170 int tg1 = template_guide_p (cand1->fn);
10171 int tg2 = template_guide_p (cand2->fn);
10172 if (tg1 != tg2)
10173 return tg2 - tg1;
10177 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10178 for all arguments the corresponding parameters of F1 and F2 have the same
10179 type (CWG 2273/2277). */
10180 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10181 && !DECL_CONV_FN_P (cand1->fn)
10182 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10183 && !DECL_CONV_FN_P (cand2->fn))
10185 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10186 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10188 bool used1 = false;
10189 bool used2 = false;
10190 if (base1 == base2)
10191 /* No difference. */;
10192 else if (DERIVED_FROM_P (base1, base2))
10193 used1 = true;
10194 else if (DERIVED_FROM_P (base2, base1))
10195 used2 = true;
10197 if (int diff = used2 - used1)
10199 for (i = 0; i < len; ++i)
10201 conversion *t1 = cand1->convs[i + off1];
10202 conversion *t2 = cand2->convs[i + off2];
10203 if (!same_type_p (t1->type, t2->type))
10204 break;
10206 if (i == len)
10207 return diff;
10211 /* Check whether we can discard a builtin candidate, either because we
10212 have two identical ones or matching builtin and non-builtin candidates.
10214 (Pedantically in the latter case the builtin which matched the user
10215 function should not be added to the overload set, but we spot it here.
10217 [over.match.oper]
10218 ... the builtin candidates include ...
10219 - do not have the same parameter type list as any non-template
10220 non-member candidate. */
10222 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10224 for (i = 0; i < len; ++i)
10225 if (!same_type_p (cand1->convs[i]->type,
10226 cand2->convs[i]->type))
10227 break;
10228 if (i == cand1->num_convs)
10230 if (cand1->fn == cand2->fn)
10231 /* Two built-in candidates; arbitrarily pick one. */
10232 return 1;
10233 else if (identifier_p (cand1->fn))
10234 /* cand1 is built-in; prefer cand2. */
10235 return -1;
10236 else
10237 /* cand2 is built-in; prefer cand1. */
10238 return 1;
10242 /* For candidates of a multi-versioned function, make the version with
10243 the highest priority win. This version will be checked for dispatching
10244 first. If this version can be inlined into the caller, the front-end
10245 will simply make a direct call to this function. */
10247 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10248 && DECL_FUNCTION_VERSIONED (cand1->fn)
10249 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10250 && DECL_FUNCTION_VERSIONED (cand2->fn))
10252 tree f1 = TREE_TYPE (cand1->fn);
10253 tree f2 = TREE_TYPE (cand2->fn);
10254 tree p1 = TYPE_ARG_TYPES (f1);
10255 tree p2 = TYPE_ARG_TYPES (f2);
10257 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10258 is possible that cand1->fn and cand2->fn are function versions but of
10259 different functions. Check types to see if they are versions of the same
10260 function. */
10261 if (compparms (p1, p2)
10262 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10264 /* Always make the version with the higher priority, more
10265 specialized, win. */
10266 gcc_assert (targetm.compare_version_priority);
10267 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10268 return 1;
10269 else
10270 return -1;
10274 /* If the two function declarations represent the same function (this can
10275 happen with declarations in multiple scopes and arg-dependent lookup),
10276 arbitrarily choose one. But first make sure the default args we're
10277 using match. */
10278 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10279 && equal_functions (cand1->fn, cand2->fn))
10281 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10282 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10284 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10286 for (i = 0; i < len; ++i)
10288 /* Don't crash if the fn is variadic. */
10289 if (!parms1)
10290 break;
10291 parms1 = TREE_CHAIN (parms1);
10292 parms2 = TREE_CHAIN (parms2);
10295 if (off1)
10296 parms1 = TREE_CHAIN (parms1);
10297 else if (off2)
10298 parms2 = TREE_CHAIN (parms2);
10300 for (; parms1; ++i)
10302 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10303 TREE_PURPOSE (parms2)))
10305 if (warn)
10307 if (complain & tf_error)
10309 if (permerror (input_location,
10310 "default argument mismatch in "
10311 "overload resolution"))
10313 inform (DECL_SOURCE_LOCATION (cand1->fn),
10314 " candidate 1: %q#F", cand1->fn);
10315 inform (DECL_SOURCE_LOCATION (cand2->fn),
10316 " candidate 2: %q#F", cand2->fn);
10319 else
10320 return 0;
10322 else
10323 add_warning (cand1, cand2);
10324 break;
10326 parms1 = TREE_CHAIN (parms1);
10327 parms2 = TREE_CHAIN (parms2);
10330 return 1;
10333 tweak:
10335 /* Extension: If the worst conversion for one candidate is worse than the
10336 worst conversion for the other, take the first. */
10337 if (!pedantic && (complain & tf_warning_or_error))
10339 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10340 struct z_candidate *w = 0, *l = 0;
10342 for (i = 0; i < len; ++i)
10344 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10345 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10346 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10347 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10349 if (rank1 < rank2)
10350 winner = 1, w = cand1, l = cand2;
10351 if (rank1 > rank2)
10352 winner = -1, w = cand2, l = cand1;
10353 if (winner)
10355 /* Don't choose a deleted function over ambiguity. */
10356 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10357 return 0;
10358 if (warn)
10360 pedwarn (input_location, 0,
10361 "ISO C++ says that these are ambiguous, even "
10362 "though the worst conversion for the first is better than "
10363 "the worst conversion for the second:");
10364 print_z_candidate (input_location, _("candidate 1:"), w);
10365 print_z_candidate (input_location, _("candidate 2:"), l);
10367 else
10368 add_warning (w, l);
10369 return winner;
10373 gcc_assert (!winner);
10374 return 0;
10377 /* Given a list of candidates for overloading, find the best one, if any.
10378 This algorithm has a worst case of O(2n) (winner is last), and a best
10379 case of O(n/2) (totally ambiguous); much better than a sorting
10380 algorithm. */
10382 static struct z_candidate *
10383 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10385 struct z_candidate *champ = candidates, *challenger;
10386 int fate;
10387 int champ_compared_to_predecessor = 0;
10389 /* Walk through the list once, comparing each current champ to the next
10390 candidate, knocking out a candidate or two with each comparison. */
10392 for (challenger = champ->next; challenger; )
10394 fate = joust (champ, challenger, 0, complain);
10395 if (fate == 1)
10396 challenger = challenger->next;
10397 else
10399 if (fate == 0)
10401 champ = challenger->next;
10402 if (champ == 0)
10403 return NULL;
10404 champ_compared_to_predecessor = 0;
10406 else
10408 champ = challenger;
10409 champ_compared_to_predecessor = 1;
10412 challenger = champ->next;
10416 /* Make sure the champ is better than all the candidates it hasn't yet
10417 been compared to. */
10419 for (challenger = candidates;
10420 challenger != champ
10421 && !(champ_compared_to_predecessor && challenger->next == champ);
10422 challenger = challenger->next)
10424 fate = joust (champ, challenger, 0, complain);
10425 if (fate != 1)
10426 return NULL;
10429 return champ;
10432 /* Returns nonzero if things of type FROM can be converted to TO. */
10434 bool
10435 can_convert (tree to, tree from, tsubst_flags_t complain)
10437 tree arg = NULL_TREE;
10438 /* implicit_conversion only considers user-defined conversions
10439 if it has an expression for the call argument list. */
10440 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10441 arg = build1 (CAST_EXPR, from, NULL_TREE);
10442 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10445 /* Returns nonzero if things of type FROM can be converted to TO with a
10446 standard conversion. */
10448 bool
10449 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10451 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10454 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10456 bool
10457 can_convert_arg (tree to, tree from, tree arg, int flags,
10458 tsubst_flags_t complain)
10460 conversion *t;
10461 void *p;
10462 bool ok_p;
10464 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10465 p = conversion_obstack_alloc (0);
10466 /* We want to discard any access checks done for this test,
10467 as we might not be in the appropriate access context and
10468 we'll do the check again when we actually perform the
10469 conversion. */
10470 push_deferring_access_checks (dk_deferred);
10472 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10473 flags, complain);
10474 ok_p = (t && !t->bad_p);
10476 /* Discard the access checks now. */
10477 pop_deferring_access_checks ();
10478 /* Free all the conversions we allocated. */
10479 obstack_free (&conversion_obstack, p);
10481 return ok_p;
10484 /* Like can_convert_arg, but allows dubious conversions as well. */
10486 bool
10487 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10488 tsubst_flags_t complain)
10490 conversion *t;
10491 void *p;
10493 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10494 p = conversion_obstack_alloc (0);
10495 /* Try to perform the conversion. */
10496 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10497 flags, complain);
10498 /* Free all the conversions we allocated. */
10499 obstack_free (&conversion_obstack, p);
10501 return t != NULL;
10504 /* Convert EXPR to TYPE. Return the converted expression.
10506 Note that we allow bad conversions here because by the time we get to
10507 this point we are committed to doing the conversion. If we end up
10508 doing a bad conversion, convert_like will complain. */
10510 tree
10511 perform_implicit_conversion_flags (tree type, tree expr,
10512 tsubst_flags_t complain, int flags)
10514 conversion *conv;
10515 void *p;
10516 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10518 if (error_operand_p (expr))
10519 return error_mark_node;
10521 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10522 p = conversion_obstack_alloc (0);
10524 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10525 /*c_cast_p=*/false,
10526 flags, complain);
10528 if (!conv)
10530 if (complain & tf_error)
10532 /* If expr has unknown type, then it is an overloaded function.
10533 Call instantiate_type to get good error messages. */
10534 if (TREE_TYPE (expr) == unknown_type_node)
10535 instantiate_type (type, expr, complain);
10536 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10537 /* We gave an error. */;
10538 else
10539 error_at (loc, "could not convert %qE from %qH to %qI", expr,
10540 TREE_TYPE (expr), type);
10542 expr = error_mark_node;
10544 else if (processing_template_decl && conv->kind != ck_identity)
10546 /* In a template, we are only concerned about determining the
10547 type of non-dependent expressions, so we do not have to
10548 perform the actual conversion. But for initializers, we
10549 need to be able to perform it at instantiation
10550 (or instantiate_non_dependent_expr) time. */
10551 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10552 if (!(flags & LOOKUP_ONLYCONVERTING))
10553 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10555 else
10556 expr = convert_like (conv, expr, complain);
10558 /* Free all the conversions we allocated. */
10559 obstack_free (&conversion_obstack, p);
10561 return expr;
10564 tree
10565 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10567 return perform_implicit_conversion_flags (type, expr, complain,
10568 LOOKUP_IMPLICIT);
10571 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10572 permitted. If the conversion is valid, the converted expression is
10573 returned. Otherwise, NULL_TREE is returned, except in the case
10574 that TYPE is a class type; in that case, an error is issued. If
10575 C_CAST_P is true, then this direct-initialization is taking
10576 place as part of a static_cast being attempted as part of a C-style
10577 cast. */
10579 tree
10580 perform_direct_initialization_if_possible (tree type,
10581 tree expr,
10582 bool c_cast_p,
10583 tsubst_flags_t complain)
10585 conversion *conv;
10586 void *p;
10588 if (type == error_mark_node || error_operand_p (expr))
10589 return error_mark_node;
10590 /* [dcl.init]
10592 If the destination type is a (possibly cv-qualified) class type:
10594 -- If the initialization is direct-initialization ...,
10595 constructors are considered. ... If no constructor applies, or
10596 the overload resolution is ambiguous, the initialization is
10597 ill-formed. */
10598 if (CLASS_TYPE_P (type))
10600 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10601 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10602 &args, type, LOOKUP_NORMAL, complain);
10603 release_tree_vector (args);
10604 return build_cplus_new (type, expr, complain);
10607 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10608 p = conversion_obstack_alloc (0);
10610 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10611 c_cast_p,
10612 LOOKUP_NORMAL, complain);
10613 if (!conv || conv->bad_p)
10614 expr = NULL_TREE;
10615 else
10616 expr = convert_like_real (conv, expr, NULL_TREE, 0,
10617 /*issue_conversion_warnings=*/false,
10618 c_cast_p,
10619 complain);
10621 /* Free all the conversions we allocated. */
10622 obstack_free (&conversion_obstack, p);
10624 return expr;
10627 /* When initializing a reference that lasts longer than a full-expression,
10628 this special rule applies:
10630 [class.temporary]
10632 The temporary to which the reference is bound or the temporary
10633 that is the complete object to which the reference is bound
10634 persists for the lifetime of the reference.
10636 The temporaries created during the evaluation of the expression
10637 initializing the reference, except the temporary to which the
10638 reference is bound, are destroyed at the end of the
10639 full-expression in which they are created.
10641 In that case, we store the converted expression into a new
10642 VAR_DECL in a new scope.
10644 However, we want to be careful not to create temporaries when
10645 they are not required. For example, given:
10647 struct B {};
10648 struct D : public B {};
10649 D f();
10650 const B& b = f();
10652 there is no need to copy the return value from "f"; we can just
10653 extend its lifetime. Similarly, given:
10655 struct S {};
10656 struct T { operator S(); };
10657 T t;
10658 const S& s = t;
10660 we can extend the lifetime of the return value of the conversion
10661 operator.
10663 The next several functions are involved in this lifetime extension. */
10665 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10666 reference is being bound to a temporary. Create and return a new
10667 VAR_DECL with the indicated TYPE; this variable will store the value to
10668 which the reference is bound. */
10670 tree
10671 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10673 tree var = create_temporary_var (type);
10675 /* Register the variable. */
10676 if (VAR_P (decl)
10677 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10679 /* Namespace-scope or local static; give it a mangled name. */
10680 /* FIXME share comdat with decl? */
10682 TREE_STATIC (var) = TREE_STATIC (decl);
10683 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10684 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10686 tree name = mangle_ref_init_variable (decl);
10687 DECL_NAME (var) = name;
10688 SET_DECL_ASSEMBLER_NAME (var, name);
10690 var = pushdecl (var);
10692 else
10693 /* Create a new cleanup level if necessary. */
10694 maybe_push_cleanup_level (type);
10696 return var;
10699 /* EXPR is the initializer for a variable DECL of reference or
10700 std::initializer_list type. Create, push and return a new VAR_DECL
10701 for the initializer so that it will live as long as DECL. Any
10702 cleanup for the new variable is returned through CLEANUP, and the
10703 code to initialize the new variable is returned through INITP. */
10705 static tree
10706 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10707 tree *initp)
10709 tree init;
10710 tree type;
10711 tree var;
10713 /* Create the temporary variable. */
10714 type = TREE_TYPE (expr);
10715 var = make_temporary_var_for_ref_to_temp (decl, type);
10716 layout_decl (var, 0);
10717 /* If the rvalue is the result of a function call it will be
10718 a TARGET_EXPR. If it is some other construct (such as a
10719 member access expression where the underlying object is
10720 itself the result of a function call), turn it into a
10721 TARGET_EXPR here. It is important that EXPR be a
10722 TARGET_EXPR below since otherwise the INIT_EXPR will
10723 attempt to make a bitwise copy of EXPR to initialize
10724 VAR. */
10725 if (TREE_CODE (expr) != TARGET_EXPR)
10726 expr = get_target_expr (expr);
10728 if (TREE_CODE (decl) == FIELD_DECL
10729 && extra_warnings && !TREE_NO_WARNING (decl))
10731 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10732 "until the constructor exits", decl);
10733 TREE_NO_WARNING (decl) = true;
10736 /* Recursively extend temps in this initializer. */
10737 TARGET_EXPR_INITIAL (expr)
10738 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10740 /* Any reference temp has a non-trivial initializer. */
10741 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10743 /* If the initializer is constant, put it in DECL_INITIAL so we get
10744 static initialization and use in constant expressions. */
10745 init = maybe_constant_init (expr);
10746 if (TREE_CONSTANT (init))
10748 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10750 /* 5.19 says that a constant expression can include an
10751 lvalue-rvalue conversion applied to "a glvalue of literal type
10752 that refers to a non-volatile temporary object initialized
10753 with a constant expression". Rather than try to communicate
10754 that this VAR_DECL is a temporary, just mark it constexpr.
10756 Currently this is only useful for initializer_list temporaries,
10757 since reference vars can't appear in constant expressions. */
10758 DECL_DECLARED_CONSTEXPR_P (var) = true;
10759 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10760 TREE_CONSTANT (var) = true;
10762 DECL_INITIAL (var) = init;
10763 init = NULL_TREE;
10765 else
10766 /* Create the INIT_EXPR that will initialize the temporary
10767 variable. */
10768 init = split_nonconstant_init (var, expr);
10769 if (at_function_scope_p ())
10771 add_decl_expr (var);
10773 if (TREE_STATIC (var))
10774 init = add_stmt_to_compound (init, register_dtor_fn (var));
10775 else
10777 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10778 if (cleanup)
10779 vec_safe_push (*cleanups, cleanup);
10782 /* We must be careful to destroy the temporary only
10783 after its initialization has taken place. If the
10784 initialization throws an exception, then the
10785 destructor should not be run. We cannot simply
10786 transform INIT into something like:
10788 (INIT, ({ CLEANUP_STMT; }))
10790 because emit_local_var always treats the
10791 initializer as a full-expression. Thus, the
10792 destructor would run too early; it would run at the
10793 end of initializing the reference variable, rather
10794 than at the end of the block enclosing the
10795 reference variable.
10797 The solution is to pass back a cleanup expression
10798 which the caller is responsible for attaching to
10799 the statement tree. */
10801 else
10803 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10804 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10806 if (CP_DECL_THREAD_LOCAL_P (var))
10807 tls_aggregates = tree_cons (NULL_TREE, var,
10808 tls_aggregates);
10809 else
10810 static_aggregates = tree_cons (NULL_TREE, var,
10811 static_aggregates);
10813 else
10814 /* Check whether the dtor is callable. */
10815 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10817 /* Avoid -Wunused-variable warning (c++/38958). */
10818 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10819 && VAR_P (decl))
10820 TREE_USED (decl) = DECL_READ_P (decl) = true;
10822 *initp = init;
10823 return var;
10826 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10827 initializing a variable of that TYPE. */
10829 tree
10830 initialize_reference (tree type, tree expr,
10831 int flags, tsubst_flags_t complain)
10833 conversion *conv;
10834 void *p;
10835 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10837 if (type == error_mark_node || error_operand_p (expr))
10838 return error_mark_node;
10840 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10841 p = conversion_obstack_alloc (0);
10843 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10844 flags, complain);
10845 if (!conv || conv->bad_p)
10847 if (complain & tf_error)
10849 if (conv)
10850 convert_like (conv, expr, complain);
10851 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10852 && !TYPE_REF_IS_RVALUE (type)
10853 && !lvalue_p (expr))
10854 error_at (loc, "invalid initialization of non-const reference of "
10855 "type %qH from an rvalue of type %qI",
10856 type, TREE_TYPE (expr));
10857 else
10858 error_at (loc, "invalid initialization of reference of type "
10859 "%qH from expression of type %qI", type,
10860 TREE_TYPE (expr));
10862 return error_mark_node;
10865 if (conv->kind == ck_ref_bind)
10866 /* Perform the conversion. */
10867 expr = convert_like (conv, expr, complain);
10868 else if (conv->kind == ck_ambig)
10869 /* We gave an error in build_user_type_conversion_1. */
10870 expr = error_mark_node;
10871 else
10872 gcc_unreachable ();
10874 /* Free all the conversions we allocated. */
10875 obstack_free (&conversion_obstack, p);
10877 return expr;
10880 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10881 which is bound either to a reference or a std::initializer_list. */
10883 static tree
10884 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10886 tree sub = init;
10887 tree *p;
10888 STRIP_NOPS (sub);
10889 if (TREE_CODE (sub) == COMPOUND_EXPR)
10891 TREE_OPERAND (sub, 1)
10892 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10893 return init;
10895 if (TREE_CODE (sub) != ADDR_EXPR)
10896 return init;
10897 /* Deal with binding to a subobject. */
10898 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10899 p = &TREE_OPERAND (*p, 0);
10900 if (TREE_CODE (*p) == TARGET_EXPR)
10902 tree subinit = NULL_TREE;
10903 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10904 recompute_tree_invariant_for_addr_expr (sub);
10905 if (init != sub)
10906 init = fold_convert (TREE_TYPE (init), sub);
10907 if (subinit)
10908 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10910 return init;
10913 /* INIT is part of the initializer for DECL. If there are any
10914 reference or initializer lists being initialized, extend their
10915 lifetime to match that of DECL. */
10917 tree
10918 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10920 tree type = TREE_TYPE (init);
10921 if (processing_template_decl)
10922 return init;
10923 if (TREE_CODE (type) == REFERENCE_TYPE)
10924 init = extend_ref_init_temps_1 (decl, init, cleanups);
10925 else
10927 tree ctor = init;
10928 if (TREE_CODE (ctor) == TARGET_EXPR)
10929 ctor = TARGET_EXPR_INITIAL (ctor);
10930 if (TREE_CODE (ctor) == CONSTRUCTOR)
10932 if (is_std_init_list (type))
10934 /* The temporary array underlying a std::initializer_list
10935 is handled like a reference temporary. */
10936 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10937 array = extend_ref_init_temps_1 (decl, array, cleanups);
10938 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10940 else
10942 unsigned i;
10943 constructor_elt *p;
10944 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10945 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10946 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10948 recompute_constructor_flags (ctor);
10949 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
10950 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10954 return init;
10957 /* Returns true iff an initializer for TYPE could contain temporaries that
10958 need to be extended because they are bound to references or
10959 std::initializer_list. */
10961 bool
10962 type_has_extended_temps (tree type)
10964 type = strip_array_types (type);
10965 if (TREE_CODE (type) == REFERENCE_TYPE)
10966 return true;
10967 if (CLASS_TYPE_P (type))
10969 if (is_std_init_list (type))
10970 return true;
10971 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10972 f; f = next_initializable_field (DECL_CHAIN (f)))
10973 if (type_has_extended_temps (TREE_TYPE (f)))
10974 return true;
10976 return false;
10979 /* Returns true iff TYPE is some variant of std::initializer_list. */
10981 bool
10982 is_std_init_list (tree type)
10984 if (!TYPE_P (type))
10985 return false;
10986 if (cxx_dialect == cxx98)
10987 return false;
10988 /* Look through typedefs. */
10989 type = TYPE_MAIN_VARIANT (type);
10990 return (CLASS_TYPE_P (type)
10991 && CP_TYPE_CONTEXT (type) == std_node
10992 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
10995 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10996 will accept an argument list of a single std::initializer_list<T>. */
10998 bool
10999 is_list_ctor (tree decl)
11001 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
11002 tree arg;
11004 if (!args || args == void_list_node)
11005 return false;
11007 arg = non_reference (TREE_VALUE (args));
11008 if (!is_std_init_list (arg))
11009 return false;
11011 args = TREE_CHAIN (args);
11013 if (args && args != void_list_node && !TREE_PURPOSE (args))
11014 /* There are more non-defaulted parms. */
11015 return false;
11017 return true;
11020 #include "gt-cp-call.h"