Update LOCAL_PATCHES after libsanitizer merge.
[official-gcc.git] / gcc / cp / call.c
blob6f401567c2e198674204e0d265ed67a57f3e45f2
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
25 #include "config.h"
26 #include "system.h"
27 #include "coretypes.h"
28 #include "target.h"
29 #include "cp-tree.h"
30 #include "timevar.h"
31 #include "stringpool.h"
32 #include "cgraph.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
35 #include "flags.h"
36 #include "toplev.h"
37 #include "intl.h"
38 #include "convert.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
43 #include "attribs.h"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind {
49 ck_identity,
50 ck_lvalue,
51 ck_fnptr,
52 ck_qual,
53 ck_std,
54 ck_ptr,
55 ck_pmem,
56 ck_base,
57 ck_ref_bind,
58 ck_user,
59 ck_ambig,
60 ck_list,
61 ck_aggr,
62 ck_rvalue
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank {
69 cr_identity,
70 cr_exact,
71 cr_promotion,
72 cr_std,
73 cr_pbool,
74 cr_user,
75 cr_ellipsis,
76 cr_bad
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
83 struct conversion {
84 /* The kind of conversion represented by this step. */
85 conversion_kind kind;
86 /* The rank of this conversion. */
87 conversion_rank rank;
88 BOOL_BITFIELD user_conv_p : 1;
89 BOOL_BITFIELD ellipsis_p : 1;
90 BOOL_BITFIELD this_p : 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p : 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig, true if the context is
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p : 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p : 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 ck_identity, we will be binding a reference directly or decaying to
108 a pointer. */
109 BOOL_BITFIELD rvaluedness_matches_p: 1;
110 BOOL_BITFIELD check_narrowing: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only: 1;
114 /* The type of the expression resulting from the conversion. */
115 tree type;
116 union {
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
123 conversion *next;
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. */
126 tree expr;
127 /* The array of conversions for an initializer_list, so this
128 variant is used only when KIN D is ck_list. */
129 conversion **list;
130 } u;
131 /* The function candidate corresponding to this conversion
132 sequence. This field is only used if KIND is ck_user. */
133 struct z_candidate *cand;
136 #define CONVERSION_RANK(NODE) \
137 ((NODE)->bad_p ? cr_bad \
138 : (NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
140 : (NODE)->rank)
142 #define BAD_CONVERSION_RANK(NODE) \
143 ((NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
145 : (NODE)->rank)
147 static struct obstack conversion_obstack;
148 static bool conversion_obstack_initialized;
149 struct rejection_reason;
151 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
152 static int equal_functions (tree, tree);
153 static int joust (struct z_candidate *, struct z_candidate *, bool,
154 tsubst_flags_t);
155 static int compare_ics (conversion *, conversion *);
156 static void maybe_warn_class_memaccess (location_t, tree,
157 const vec<tree, va_gc> *);
158 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree convert_like_real (conversion *, tree, tree, int, bool,
168 bool, tsubst_flags_t);
169 static void op_error (location_t, enum tree_code, enum tree_code, tree,
170 tree, tree, bool);
171 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
172 tsubst_flags_t);
173 static void print_z_candidate (location_t, const char *, struct z_candidate *);
174 static void print_z_candidates (location_t, struct z_candidate *);
175 static tree build_this (tree);
176 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate *);
178 static struct z_candidate *add_template_candidate
179 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
180 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
181 static struct z_candidate *add_template_candidate_real
182 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
183 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
184 static void add_builtin_candidates
185 (struct z_candidate **, enum tree_code, enum tree_code,
186 tree, tree *, int, tsubst_flags_t);
187 static void add_builtin_candidate
188 (struct z_candidate **, enum tree_code, enum tree_code,
189 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
190 static bool is_complete (tree);
191 static void build_builtin_candidate
192 (struct z_candidate **, tree, tree, tree, tree *, tree *,
193 int, tsubst_flags_t);
194 static struct z_candidate *add_conv_candidate
195 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
196 tree, tsubst_flags_t);
197 static struct z_candidate *add_function_candidate
198 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
199 tree, int, conversion**, tsubst_flags_t);
200 static conversion *implicit_conversion (tree, tree, tree, bool, int,
201 tsubst_flags_t);
202 static conversion *reference_binding (tree, tree, tree, bool, int,
203 tsubst_flags_t);
204 static conversion *build_conv (conversion_kind, tree, conversion *);
205 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
206 static conversion *next_conversion (conversion *);
207 static bool is_subseq (conversion *, conversion *);
208 static conversion *maybe_handle_ref_bind (conversion **);
209 static void maybe_handle_implicit_object (conversion **);
210 static struct z_candidate *add_candidate
211 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
212 conversion **, tree, tree, int, struct rejection_reason *, int);
213 static tree source_type (conversion *);
214 static void add_warning (struct z_candidate *, struct z_candidate *);
215 static bool reference_compatible_p (tree, tree);
216 static conversion *direct_reference_binding (tree, conversion *);
217 static bool promoted_arithmetic_type_p (tree);
218 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
219 static char *name_as_c_string (tree, tree, bool *);
220 static tree prep_operand (tree);
221 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
222 bool, tree, tree, int, struct z_candidate **,
223 tsubst_flags_t);
224 static conversion *merge_conversion_sequences (conversion *, conversion *);
225 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
227 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
228 NAME can take many forms... */
230 bool
231 check_dtor_name (tree basetype, tree name)
233 /* Just accept something we've already complained about. */
234 if (name == error_mark_node)
235 return true;
237 if (TREE_CODE (name) == TYPE_DECL)
238 name = TREE_TYPE (name);
239 else if (TYPE_P (name))
240 /* OK */;
241 else if (identifier_p (name))
243 if ((MAYBE_CLASS_TYPE_P (basetype)
244 || TREE_CODE (basetype) == ENUMERAL_TYPE)
245 && name == constructor_name (basetype))
246 return true;
247 else
248 name = get_type_value (name);
250 else
252 /* In the case of:
254 template <class T> struct S { ~S(); };
255 int i;
256 i.~S();
258 NAME will be a class template. */
259 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
260 return false;
263 if (!name || name == error_mark_node)
264 return false;
265 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
268 /* We want the address of a function or method. We avoid creating a
269 pointer-to-member function. */
271 tree
272 build_addr_func (tree function, tsubst_flags_t complain)
274 tree type = TREE_TYPE (function);
276 /* We have to do these by hand to avoid real pointer to member
277 functions. */
278 if (TREE_CODE (type) == METHOD_TYPE)
280 if (TREE_CODE (function) == OFFSET_REF)
282 tree object = build_address (TREE_OPERAND (function, 0));
283 return get_member_function_from_ptrfunc (&object,
284 TREE_OPERAND (function, 1),
285 complain);
287 function = build_address (function);
289 else
290 function = decay_conversion (function, complain, /*reject_builtin=*/false);
292 return function;
295 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
296 POINTER_TYPE to those. Note, pointer to member function types
297 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
298 two variants. build_call_a is the primitive taking an array of
299 arguments, while build_call_n is a wrapper that handles varargs. */
301 tree
302 build_call_n (tree function, int n, ...)
304 if (n == 0)
305 return build_call_a (function, 0, NULL);
306 else
308 tree *argarray = XALLOCAVEC (tree, n);
309 va_list ap;
310 int i;
312 va_start (ap, n);
313 for (i = 0; i < n; i++)
314 argarray[i] = va_arg (ap, tree);
315 va_end (ap);
316 return build_call_a (function, n, argarray);
320 /* Update various flags in cfun and the call itself based on what is being
321 called. Split out of build_call_a so that bot_manip can use it too. */
323 void
324 set_flags_from_callee (tree call)
326 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
327 tree decl = cp_get_callee_fndecl_nofold (call);
329 /* We check both the decl and the type; a function may be known not to
330 throw without being declared throw(). */
331 bool nothrow = decl && TREE_NOTHROW (decl);
332 tree callee = cp_get_callee (call);
333 if (callee)
334 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee)));
335 else if (TREE_CODE (call) == CALL_EXPR
336 && internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
337 nothrow = true;
339 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
340 cp_function_chain->can_throw = 1;
342 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
343 current_function_returns_abnormally = 1;
345 TREE_NOTHROW (call) = nothrow;
348 tree
349 build_call_a (tree function, int n, tree *argarray)
351 tree decl;
352 tree result_type;
353 tree fntype;
354 int i;
356 function = build_addr_func (function, tf_warning_or_error);
358 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
359 fntype = TREE_TYPE (TREE_TYPE (function));
360 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
361 || TREE_CODE (fntype) == METHOD_TYPE);
362 result_type = TREE_TYPE (fntype);
363 /* An rvalue has no cv-qualifiers. */
364 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
365 result_type = cv_unqualified (result_type);
367 function = build_call_array_loc (input_location,
368 result_type, function, n, argarray);
369 set_flags_from_callee (function);
371 decl = get_callee_fndecl (function);
373 if (decl && !TREE_USED (decl))
375 /* We invoke build_call directly for several library
376 functions. These may have been declared normally if
377 we're building libgcc, so we can't just check
378 DECL_ARTIFICIAL. */
379 gcc_assert (DECL_ARTIFICIAL (decl)
380 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
381 "__", 2));
382 mark_used (decl);
385 require_complete_eh_spec_types (fntype, decl);
387 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
389 /* Don't pass empty class objects by value. This is useful
390 for tags in STL, which are used to control overload resolution.
391 We don't need to handle other cases of copying empty classes. */
392 if (!decl || !fndecl_built_in_p (decl))
393 for (i = 0; i < n; i++)
395 tree arg = CALL_EXPR_ARG (function, i);
396 if (is_empty_class (TREE_TYPE (arg))
397 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
399 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
400 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
401 CALL_EXPR_ARG (function, i) = arg;
405 return function;
408 /* New overloading code. */
410 struct z_candidate;
412 struct candidate_warning {
413 z_candidate *loser;
414 candidate_warning *next;
417 /* Information for providing diagnostics about why overloading failed. */
419 enum rejection_reason_code {
420 rr_none,
421 rr_arity,
422 rr_explicit_conversion,
423 rr_template_conversion,
424 rr_arg_conversion,
425 rr_bad_arg_conversion,
426 rr_template_unification,
427 rr_invalid_copy,
428 rr_inherited_ctor,
429 rr_constraint_failure
432 struct conversion_info {
433 /* The index of the argument, 0-based. */
434 int n_arg;
435 /* The actual argument or its type. */
436 tree from;
437 /* The type of the parameter. */
438 tree to_type;
439 /* The location of the argument. */
440 location_t loc;
443 struct rejection_reason {
444 enum rejection_reason_code code;
445 union {
446 /* Information about an arity mismatch. */
447 struct {
448 /* The expected number of arguments. */
449 int expected;
450 /* The actual number of arguments in the call. */
451 int actual;
452 /* Whether the call was a varargs call. */
453 bool call_varargs_p;
454 } arity;
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion;
459 /* Information about template unification failures. These are the
460 parameters passed to fn_type_unification. */
461 struct {
462 tree tmpl;
463 tree explicit_targs;
464 int num_targs;
465 const tree *args;
466 unsigned int nargs;
467 tree return_type;
468 unification_kind_t strict;
469 int flags;
470 } template_unification;
471 /* Information about template instantiation failures. These are the
472 parameters passed to instantiate_template. */
473 struct {
474 tree tmpl;
475 tree targs;
476 } template_instantiation;
477 } u;
480 struct z_candidate {
481 /* The FUNCTION_DECL that will be called if this candidate is
482 selected by overload resolution. */
483 tree fn;
484 /* If not NULL_TREE, the first argument to use when calling this
485 function. */
486 tree first_arg;
487 /* The rest of the arguments to use when calling this function. If
488 there are no further arguments this may be NULL or it may be an
489 empty vector. */
490 const vec<tree, va_gc> *args;
491 /* The implicit conversion sequences for each of the arguments to
492 FN. */
493 conversion **convs;
494 /* The number of implicit conversion sequences. */
495 size_t num_convs;
496 /* If FN is a user-defined conversion, the standard conversion
497 sequence from the type returned by FN to the desired destination
498 type. */
499 conversion *second_conv;
500 struct rejection_reason *reason;
501 /* If FN is a member function, the binfo indicating the path used to
502 qualify the name of FN at the call site. This path is used to
503 determine whether or not FN is accessible if it is selected by
504 overload resolution. The DECL_CONTEXT of FN will always be a
505 (possibly improper) base of this binfo. */
506 tree access_path;
507 /* If FN is a non-static member function, the binfo indicating the
508 subobject to which the `this' pointer should be converted if FN
509 is selected by overload resolution. The type pointed to by
510 the `this' pointer must correspond to the most derived class
511 indicated by the CONVERSION_PATH. */
512 tree conversion_path;
513 tree template_decl;
514 tree explicit_targs;
515 candidate_warning *warnings;
516 z_candidate *next;
517 int viable;
519 /* The flags active in add_candidate. */
520 int flags;
523 /* Returns true iff T is a null pointer constant in the sense of
524 [conv.ptr]. */
526 bool
527 null_ptr_cst_p (tree t)
529 tree type = TREE_TYPE (t);
531 /* [conv.ptr]
533 A null pointer constant is an integral constant expression
534 (_expr.const_) rvalue of integer type that evaluates to zero or
535 an rvalue of type std::nullptr_t. */
536 if (NULLPTR_TYPE_P (type))
537 return true;
539 if (cxx_dialect >= cxx11)
541 STRIP_ANY_LOCATION_WRAPPER (t);
543 /* Core issue 903 says only literal 0 is a null pointer constant. */
544 if (TREE_CODE (type) == INTEGER_TYPE
545 && !char_type_p (type)
546 && TREE_CODE (t) == INTEGER_CST
547 && integer_zerop (t)
548 && !TREE_OVERFLOW (t))
549 return true;
551 else if (CP_INTEGRAL_TYPE_P (type))
553 t = fold_non_dependent_expr (t, tf_none);
554 STRIP_NOPS (t);
555 if (integer_zerop (t) && !TREE_OVERFLOW (t))
556 return true;
559 return false;
562 /* Returns true iff T is a null member pointer value (4.11). */
564 bool
565 null_member_pointer_value_p (tree t)
567 tree type = TREE_TYPE (t);
568 if (!type)
569 return false;
570 else if (TYPE_PTRMEMFUNC_P (type))
571 return (TREE_CODE (t) == CONSTRUCTOR
572 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
573 else if (TYPE_PTRDATAMEM_P (type))
574 return integer_all_onesp (t);
575 else
576 return false;
579 /* Returns nonzero if PARMLIST consists of only default parms,
580 ellipsis, and/or undeduced parameter packs. */
582 bool
583 sufficient_parms_p (const_tree parmlist)
585 for (; parmlist && parmlist != void_list_node;
586 parmlist = TREE_CHAIN (parmlist))
587 if (!TREE_PURPOSE (parmlist)
588 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
589 return false;
590 return true;
593 /* Allocate N bytes of memory from the conversion obstack. The memory
594 is zeroed before being returned. */
596 static void *
597 conversion_obstack_alloc (size_t n)
599 void *p;
600 if (!conversion_obstack_initialized)
602 gcc_obstack_init (&conversion_obstack);
603 conversion_obstack_initialized = true;
605 p = obstack_alloc (&conversion_obstack, n);
606 memset (p, 0, n);
607 return p;
610 /* Allocate rejection reasons. */
612 static struct rejection_reason *
613 alloc_rejection (enum rejection_reason_code code)
615 struct rejection_reason *p;
616 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
617 p->code = code;
618 return p;
621 static struct rejection_reason *
622 arity_rejection (tree first_arg, int expected, int actual)
624 struct rejection_reason *r = alloc_rejection (rr_arity);
625 int adjust = first_arg != NULL_TREE;
626 r->u.arity.expected = expected - adjust;
627 r->u.arity.actual = actual - adjust;
628 return r;
631 static struct rejection_reason *
632 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to,
633 location_t loc)
635 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
636 int adjust = first_arg != NULL_TREE;
637 r->u.conversion.n_arg = n_arg - adjust;
638 r->u.conversion.from = from;
639 r->u.conversion.to_type = to;
640 r->u.conversion.loc = loc;
641 return r;
644 static struct rejection_reason *
645 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to,
646 location_t loc)
648 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
649 int adjust = first_arg != NULL_TREE;
650 r->u.bad_conversion.n_arg = n_arg - adjust;
651 r->u.bad_conversion.from = from;
652 r->u.bad_conversion.to_type = to;
653 r->u.bad_conversion.loc = loc;
654 return r;
657 static struct rejection_reason *
658 explicit_conversion_rejection (tree from, tree to)
660 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
661 r->u.conversion.n_arg = 0;
662 r->u.conversion.from = from;
663 r->u.conversion.to_type = to;
664 r->u.conversion.loc = UNKNOWN_LOCATION;
665 return r;
668 static struct rejection_reason *
669 template_conversion_rejection (tree from, tree to)
671 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
672 r->u.conversion.n_arg = 0;
673 r->u.conversion.from = from;
674 r->u.conversion.to_type = to;
675 r->u.conversion.loc = UNKNOWN_LOCATION;
676 return r;
679 static struct rejection_reason *
680 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
681 const tree *args, unsigned int nargs,
682 tree return_type, unification_kind_t strict,
683 int flags)
685 size_t args_n_bytes = sizeof (*args) * nargs;
686 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
687 struct rejection_reason *r = alloc_rejection (rr_template_unification);
688 r->u.template_unification.tmpl = tmpl;
689 r->u.template_unification.explicit_targs = explicit_targs;
690 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
691 /* Copy args to our own storage. */
692 memcpy (args1, args, args_n_bytes);
693 r->u.template_unification.args = args1;
694 r->u.template_unification.nargs = nargs;
695 r->u.template_unification.return_type = return_type;
696 r->u.template_unification.strict = strict;
697 r->u.template_unification.flags = flags;
698 return r;
701 static struct rejection_reason *
702 template_unification_error_rejection (void)
704 return alloc_rejection (rr_template_unification);
707 static struct rejection_reason *
708 invalid_copy_with_fn_template_rejection (void)
710 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
711 return r;
714 static struct rejection_reason *
715 inherited_ctor_rejection (void)
717 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
718 return r;
721 // Build a constraint failure record, saving information into the
722 // template_instantiation field of the rejection. If FN is not a template
723 // declaration, the TMPL member is the FN declaration and TARGS is empty.
725 static struct rejection_reason *
726 constraint_failure (tree fn)
728 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
729 if (tree ti = DECL_TEMPLATE_INFO (fn))
731 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
732 r->u.template_instantiation.targs = TI_ARGS (ti);
734 else
736 r->u.template_instantiation.tmpl = fn;
737 r->u.template_instantiation.targs = NULL_TREE;
739 return r;
742 /* Dynamically allocate a conversion. */
744 static conversion *
745 alloc_conversion (conversion_kind kind)
747 conversion *c;
748 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
749 c->kind = kind;
750 return c;
753 /* Make sure that all memory on the conversion obstack has been
754 freed. */
756 void
757 validate_conversion_obstack (void)
759 if (conversion_obstack_initialized)
760 gcc_assert ((obstack_next_free (&conversion_obstack)
761 == obstack_base (&conversion_obstack)));
764 /* Dynamically allocate an array of N conversions. */
766 static conversion **
767 alloc_conversions (size_t n)
769 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
772 static conversion *
773 build_conv (conversion_kind code, tree type, conversion *from)
775 conversion *t;
776 conversion_rank rank = CONVERSION_RANK (from);
778 /* Note that the caller is responsible for filling in t->cand for
779 user-defined conversions. */
780 t = alloc_conversion (code);
781 t->type = type;
782 t->u.next = from;
784 switch (code)
786 case ck_ptr:
787 case ck_pmem:
788 case ck_base:
789 case ck_std:
790 if (rank < cr_std)
791 rank = cr_std;
792 break;
794 case ck_qual:
795 case ck_fnptr:
796 if (rank < cr_exact)
797 rank = cr_exact;
798 break;
800 default:
801 break;
803 t->rank = rank;
804 t->user_conv_p = (code == ck_user || from->user_conv_p);
805 t->bad_p = from->bad_p;
806 t->base_p = false;
807 return t;
810 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
811 specialization of std::initializer_list<T>, if such a conversion is
812 possible. */
814 static conversion *
815 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
817 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
818 unsigned len = CONSTRUCTOR_NELTS (ctor);
819 conversion **subconvs = alloc_conversions (len);
820 conversion *t;
821 unsigned i;
822 tree val;
824 /* Within a list-initialization we can have more user-defined
825 conversions. */
826 flags &= ~LOOKUP_NO_CONVERSION;
827 /* But no narrowing conversions. */
828 flags |= LOOKUP_NO_NARROWING;
830 /* Can't make an array of these types. */
831 if (TYPE_REF_P (elttype)
832 || TREE_CODE (elttype) == FUNCTION_TYPE
833 || VOID_TYPE_P (elttype))
834 return NULL;
836 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
838 conversion *sub
839 = implicit_conversion (elttype, TREE_TYPE (val), val,
840 false, flags, complain);
841 if (sub == NULL)
842 return NULL;
844 subconvs[i] = sub;
847 t = alloc_conversion (ck_list);
848 t->type = type;
849 t->u.list = subconvs;
850 t->rank = cr_exact;
852 for (i = 0; i < len; ++i)
854 conversion *sub = subconvs[i];
855 if (sub->rank > t->rank)
856 t->rank = sub->rank;
857 if (sub->user_conv_p)
858 t->user_conv_p = true;
859 if (sub->bad_p)
860 t->bad_p = true;
863 return t;
866 /* Return the next conversion of the conversion chain (if applicable),
867 or NULL otherwise. Please use this function instead of directly
868 accessing fields of struct conversion. */
870 static conversion *
871 next_conversion (conversion *conv)
873 if (conv == NULL
874 || conv->kind == ck_identity
875 || conv->kind == ck_ambig
876 || conv->kind == ck_list)
877 return NULL;
878 return conv->u.next;
881 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
882 is a valid aggregate initializer for array type ATYPE. */
884 static bool
885 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
887 unsigned i;
888 tree elttype = TREE_TYPE (atype);
889 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
891 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
892 bool ok;
893 if (TREE_CODE (elttype) == ARRAY_TYPE
894 && TREE_CODE (val) == CONSTRUCTOR)
895 ok = can_convert_array (elttype, val, flags, complain);
896 else
897 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
898 complain);
899 if (!ok)
900 return false;
902 return true;
905 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
906 aggregate class, if such a conversion is possible. */
908 static conversion *
909 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
911 unsigned HOST_WIDE_INT i = 0;
912 conversion *c;
913 tree field = next_initializable_field (TYPE_FIELDS (type));
914 tree empty_ctor = NULL_TREE;
916 /* We already called reshape_init in implicit_conversion. */
918 /* The conversions within the init-list aren't affected by the enclosing
919 context; they're always simple copy-initialization. */
920 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
922 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
924 tree ftype = TREE_TYPE (field);
925 tree val;
926 bool ok;
928 if (i < CONSTRUCTOR_NELTS (ctor))
929 val = CONSTRUCTOR_ELT (ctor, i)->value;
930 else if (DECL_INITIAL (field))
931 val = get_nsdmi (field, /*ctor*/false, complain);
932 else if (TYPE_REF_P (ftype))
933 /* Value-initialization of reference is ill-formed. */
934 return NULL;
935 else
937 if (empty_ctor == NULL_TREE)
938 empty_ctor = build_constructor (init_list_type_node, NULL);
939 val = empty_ctor;
941 ++i;
943 if (TREE_CODE (ftype) == ARRAY_TYPE
944 && TREE_CODE (val) == CONSTRUCTOR)
945 ok = can_convert_array (ftype, val, flags, complain);
946 else
947 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
948 complain);
950 if (!ok)
951 return NULL;
953 if (TREE_CODE (type) == UNION_TYPE)
954 break;
957 if (i < CONSTRUCTOR_NELTS (ctor))
958 return NULL;
960 c = alloc_conversion (ck_aggr);
961 c->type = type;
962 c->rank = cr_exact;
963 c->user_conv_p = true;
964 c->check_narrowing = true;
965 c->u.next = NULL;
966 return c;
969 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
970 array type, if such a conversion is possible. */
972 static conversion *
973 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
975 conversion *c;
976 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
977 tree elttype = TREE_TYPE (type);
978 unsigned i;
979 tree val;
980 bool bad = false;
981 bool user = false;
982 enum conversion_rank rank = cr_exact;
984 /* We might need to propagate the size from the element to the array. */
985 complete_type (type);
987 if (TYPE_DOMAIN (type)
988 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
990 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
991 if (alen < len)
992 return NULL;
995 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
997 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
999 conversion *sub
1000 = implicit_conversion (elttype, TREE_TYPE (val), val,
1001 false, flags, complain);
1002 if (sub == NULL)
1003 return NULL;
1005 if (sub->rank > rank)
1006 rank = sub->rank;
1007 if (sub->user_conv_p)
1008 user = true;
1009 if (sub->bad_p)
1010 bad = true;
1013 c = alloc_conversion (ck_aggr);
1014 c->type = type;
1015 c->rank = rank;
1016 c->user_conv_p = user;
1017 c->bad_p = bad;
1018 c->u.next = NULL;
1019 return c;
1022 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1023 complex type, if such a conversion is possible. */
1025 static conversion *
1026 build_complex_conv (tree type, tree ctor, int flags,
1027 tsubst_flags_t complain)
1029 conversion *c;
1030 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1031 tree elttype = TREE_TYPE (type);
1032 unsigned i;
1033 tree val;
1034 bool bad = false;
1035 bool user = false;
1036 enum conversion_rank rank = cr_exact;
1038 if (len != 2)
1039 return NULL;
1041 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1043 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1045 conversion *sub
1046 = implicit_conversion (elttype, TREE_TYPE (val), val,
1047 false, flags, complain);
1048 if (sub == NULL)
1049 return NULL;
1051 if (sub->rank > rank)
1052 rank = sub->rank;
1053 if (sub->user_conv_p)
1054 user = true;
1055 if (sub->bad_p)
1056 bad = true;
1059 c = alloc_conversion (ck_aggr);
1060 c->type = type;
1061 c->rank = rank;
1062 c->user_conv_p = user;
1063 c->bad_p = bad;
1064 c->u.next = NULL;
1065 return c;
1068 /* Build a representation of the identity conversion from EXPR to
1069 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1071 static conversion *
1072 build_identity_conv (tree type, tree expr)
1074 conversion *c;
1076 c = alloc_conversion (ck_identity);
1077 c->type = type;
1078 c->u.expr = expr;
1080 return c;
1083 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1084 were multiple user-defined conversions to accomplish the job.
1085 Build a conversion that indicates that ambiguity. */
1087 static conversion *
1088 build_ambiguous_conv (tree type, tree expr)
1090 conversion *c;
1092 c = alloc_conversion (ck_ambig);
1093 c->type = type;
1094 c->u.expr = expr;
1096 return c;
1099 tree
1100 strip_top_quals (tree t)
1102 if (TREE_CODE (t) == ARRAY_TYPE)
1103 return t;
1104 return cp_build_qualified_type (t, 0);
1107 /* Returns the standard conversion path (see [conv]) from type FROM to type
1108 TO, if any. For proper handling of null pointer constants, you must
1109 also pass the expression EXPR to convert from. If C_CAST_P is true,
1110 this conversion is coming from a C-style cast. */
1112 static conversion *
1113 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1114 int flags, tsubst_flags_t complain)
1116 enum tree_code fcode, tcode;
1117 conversion *conv;
1118 bool fromref = false;
1119 tree qualified_to;
1121 to = non_reference (to);
1122 if (TYPE_REF_P (from))
1124 fromref = true;
1125 from = TREE_TYPE (from);
1127 qualified_to = to;
1128 to = strip_top_quals (to);
1129 from = strip_top_quals (from);
1131 if (expr && type_unknown_p (expr))
1133 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1135 tsubst_flags_t tflags = tf_conv;
1136 expr = instantiate_type (to, expr, tflags);
1137 if (expr == error_mark_node)
1138 return NULL;
1139 from = TREE_TYPE (expr);
1141 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1143 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1144 expr = resolve_nondeduced_context (expr, complain);
1145 from = TREE_TYPE (expr);
1149 fcode = TREE_CODE (from);
1150 tcode = TREE_CODE (to);
1152 conv = build_identity_conv (from, expr);
1153 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1155 from = type_decays_to (from);
1156 fcode = TREE_CODE (from);
1157 /* Tell convert_like_real that we're using the address. */
1158 conv->rvaluedness_matches_p = true;
1159 conv = build_conv (ck_lvalue, from, conv);
1161 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1162 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1163 express the copy constructor call required by copy-initialization. */
1164 else if (fromref || (expr && obvalue_p (expr)))
1166 if (expr)
1168 tree bitfield_type;
1169 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1170 if (bitfield_type)
1172 from = strip_top_quals (bitfield_type);
1173 fcode = TREE_CODE (from);
1176 conv = build_conv (ck_rvalue, from, conv);
1177 if (flags & LOOKUP_PREFER_RVALUE)
1178 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1179 conv->rvaluedness_matches_p = true;
1182 /* Allow conversion between `__complex__' data types. */
1183 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1185 /* The standard conversion sequence to convert FROM to TO is
1186 the standard conversion sequence to perform componentwise
1187 conversion. */
1188 conversion *part_conv = standard_conversion
1189 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1190 complain);
1192 if (part_conv)
1194 conv = build_conv (part_conv->kind, to, conv);
1195 conv->rank = part_conv->rank;
1197 else
1198 conv = NULL;
1200 return conv;
1203 if (same_type_p (from, to))
1205 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1206 conv->type = qualified_to;
1207 return conv;
1210 /* [conv.ptr]
1211 A null pointer constant can be converted to a pointer type; ... A
1212 null pointer constant of integral type can be converted to an
1213 rvalue of type std::nullptr_t. */
1214 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1215 || NULLPTR_TYPE_P (to))
1216 && ((expr && null_ptr_cst_p (expr))
1217 || NULLPTR_TYPE_P (from)))
1218 conv = build_conv (ck_std, to, conv);
1219 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1220 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1222 /* For backwards brain damage compatibility, allow interconversion of
1223 pointers and integers with a pedwarn. */
1224 conv = build_conv (ck_std, to, conv);
1225 conv->bad_p = true;
1227 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1229 /* For backwards brain damage compatibility, allow interconversion of
1230 enums and integers with a pedwarn. */
1231 conv = build_conv (ck_std, to, conv);
1232 conv->bad_p = true;
1234 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1235 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1237 tree to_pointee;
1238 tree from_pointee;
1240 if (tcode == POINTER_TYPE)
1242 to_pointee = TREE_TYPE (to);
1243 from_pointee = TREE_TYPE (from);
1245 /* Since this is the target of a pointer, it can't have function
1246 qualifiers, so any TYPE_QUALS must be for attributes const or
1247 noreturn. Strip them. */
1248 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1249 && TYPE_QUALS (to_pointee))
1250 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1251 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1252 && TYPE_QUALS (from_pointee))
1253 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1255 else
1257 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1258 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1261 if (tcode == POINTER_TYPE
1262 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1263 to_pointee))
1265 else if (VOID_TYPE_P (to_pointee)
1266 && !TYPE_PTRDATAMEM_P (from)
1267 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1269 tree nfrom = TREE_TYPE (from);
1270 /* Don't try to apply restrict to void. */
1271 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1272 from_pointee = cp_build_qualified_type (void_type_node, quals);
1273 from = build_pointer_type (from_pointee);
1274 conv = build_conv (ck_ptr, from, conv);
1276 else if (TYPE_PTRDATAMEM_P (from))
1278 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1279 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1281 if (same_type_p (fbase, tbase))
1282 /* No base conversion needed. */;
1283 else if (DERIVED_FROM_P (fbase, tbase)
1284 && (same_type_ignoring_top_level_qualifiers_p
1285 (from_pointee, to_pointee)))
1287 from = build_ptrmem_type (tbase, from_pointee);
1288 conv = build_conv (ck_pmem, from, conv);
1290 else
1291 return NULL;
1293 else if (CLASS_TYPE_P (from_pointee)
1294 && CLASS_TYPE_P (to_pointee)
1295 /* [conv.ptr]
1297 An rvalue of type "pointer to cv D," where D is a
1298 class type, can be converted to an rvalue of type
1299 "pointer to cv B," where B is a base class (clause
1300 _class.derived_) of D. If B is an inaccessible
1301 (clause _class.access_) or ambiguous
1302 (_class.member.lookup_) base class of D, a program
1303 that necessitates this conversion is ill-formed.
1304 Therefore, we use DERIVED_FROM_P, and do not check
1305 access or uniqueness. */
1306 && DERIVED_FROM_P (to_pointee, from_pointee))
1308 from_pointee
1309 = cp_build_qualified_type (to_pointee,
1310 cp_type_quals (from_pointee));
1311 from = build_pointer_type (from_pointee);
1312 conv = build_conv (ck_ptr, from, conv);
1313 conv->base_p = true;
1316 if (same_type_p (from, to))
1317 /* OK */;
1318 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1319 /* In a C-style cast, we ignore CV-qualification because we
1320 are allowed to perform a static_cast followed by a
1321 const_cast. */
1322 conv = build_conv (ck_qual, to, conv);
1323 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1324 conv = build_conv (ck_qual, to, conv);
1325 else if (expr && string_conv_p (to, expr, 0))
1326 /* converting from string constant to char *. */
1327 conv = build_conv (ck_qual, to, conv);
1328 else if (fnptr_conv_p (to, from))
1329 conv = build_conv (ck_fnptr, to, conv);
1330 /* Allow conversions among compatible ObjC pointer types (base
1331 conversions have been already handled above). */
1332 else if (c_dialect_objc ()
1333 && objc_compare_types (to, from, -4, NULL_TREE))
1334 conv = build_conv (ck_ptr, to, conv);
1335 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1337 conv = build_conv (ck_ptr, to, conv);
1338 conv->bad_p = true;
1340 else
1341 return NULL;
1343 from = to;
1345 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1347 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1348 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1349 tree fbase = class_of_this_parm (fromfn);
1350 tree tbase = class_of_this_parm (tofn);
1352 if (!DERIVED_FROM_P (fbase, tbase))
1353 return NULL;
1355 tree fstat = static_fn_type (fromfn);
1356 tree tstat = static_fn_type (tofn);
1357 if (same_type_p (tstat, fstat)
1358 || fnptr_conv_p (tstat, fstat))
1359 /* OK */;
1360 else
1361 return NULL;
1363 if (!same_type_p (fbase, tbase))
1365 from = build_memfn_type (fstat,
1366 tbase,
1367 cp_type_quals (tbase),
1368 type_memfn_rqual (tofn));
1369 from = build_ptrmemfunc_type (build_pointer_type (from));
1370 conv = build_conv (ck_pmem, from, conv);
1371 conv->base_p = true;
1373 if (fnptr_conv_p (tstat, fstat))
1374 conv = build_conv (ck_fnptr, to, conv);
1376 else if (tcode == BOOLEAN_TYPE)
1378 /* [conv.bool]
1380 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1381 to member type can be converted to a prvalue of type bool. ...
1382 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1383 std::nullptr_t can be converted to a prvalue of type bool; */
1384 if (ARITHMETIC_TYPE_P (from)
1385 || UNSCOPED_ENUM_P (from)
1386 || fcode == POINTER_TYPE
1387 || TYPE_PTRMEM_P (from)
1388 || NULLPTR_TYPE_P (from))
1390 conv = build_conv (ck_std, to, conv);
1391 if (fcode == POINTER_TYPE
1392 || TYPE_PTRDATAMEM_P (from)
1393 || (TYPE_PTRMEMFUNC_P (from)
1394 && conv->rank < cr_pbool)
1395 || NULLPTR_TYPE_P (from))
1396 conv->rank = cr_pbool;
1397 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1398 conv->bad_p = true;
1399 if (flags & LOOKUP_NO_NARROWING)
1400 conv->check_narrowing = true;
1401 return conv;
1404 return NULL;
1406 /* We don't check for ENUMERAL_TYPE here because there are no standard
1407 conversions to enum type. */
1408 /* As an extension, allow conversion to complex type. */
1409 else if (ARITHMETIC_TYPE_P (to))
1411 if (! (INTEGRAL_CODE_P (fcode)
1412 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1413 || SCOPED_ENUM_P (from))
1414 return NULL;
1415 conv = build_conv (ck_std, to, conv);
1417 /* Give this a better rank if it's a promotion. */
1418 if (same_type_p (to, type_promotes_to (from))
1419 && next_conversion (conv)->rank <= cr_promotion)
1420 conv->rank = cr_promotion;
1422 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1423 && vector_types_convertible_p (from, to, false))
1424 return build_conv (ck_std, to, conv);
1425 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1426 && is_properly_derived_from (from, to))
1428 if (conv->kind == ck_rvalue)
1429 conv = next_conversion (conv);
1430 conv = build_conv (ck_base, to, conv);
1431 /* The derived-to-base conversion indicates the initialization
1432 of a parameter with base type from an object of a derived
1433 type. A temporary object is created to hold the result of
1434 the conversion unless we're binding directly to a reference. */
1435 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1436 if (flags & LOOKUP_PREFER_RVALUE)
1437 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1438 conv->rvaluedness_matches_p = true;
1440 else
1441 return NULL;
1443 if (flags & LOOKUP_NO_NARROWING)
1444 conv->check_narrowing = true;
1446 return conv;
1449 /* Returns nonzero if T1 is reference-related to T2. */
1451 bool
1452 reference_related_p (tree t1, tree t2)
1454 if (t1 == error_mark_node || t2 == error_mark_node)
1455 return false;
1457 t1 = TYPE_MAIN_VARIANT (t1);
1458 t2 = TYPE_MAIN_VARIANT (t2);
1460 /* [dcl.init.ref]
1462 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1463 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1464 of T2. */
1465 return (same_type_p (t1, t2)
1466 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1467 && DERIVED_FROM_P (t1, t2)));
1470 /* Returns nonzero if T1 is reference-compatible with T2. */
1472 static bool
1473 reference_compatible_p (tree t1, tree t2)
1475 /* [dcl.init.ref]
1477 "cv1 T1" is reference compatible with "cv2 T2" if
1478 * T1 is reference-related to T2 or
1479 * T2 is "noexcept function" and T1 is "function", where the
1480 function types are otherwise the same,
1481 and cv1 is the same cv-qualification as, or greater cv-qualification
1482 than, cv2. */
1483 return ((reference_related_p (t1, t2)
1484 || fnptr_conv_p (t1, t2))
1485 && at_least_as_qualified_p (t1, t2));
1488 /* A reference of the indicated TYPE is being bound directly to the
1489 expression represented by the implicit conversion sequence CONV.
1490 Return a conversion sequence for this binding. */
1492 static conversion *
1493 direct_reference_binding (tree type, conversion *conv)
1495 tree t;
1497 gcc_assert (TYPE_REF_P (type));
1498 gcc_assert (!TYPE_REF_P (conv->type));
1500 t = TREE_TYPE (type);
1502 if (conv->kind == ck_identity)
1503 /* Mark the identity conv as to not decay to rvalue. */
1504 conv->rvaluedness_matches_p = true;
1506 /* [over.ics.rank]
1508 When a parameter of reference type binds directly
1509 (_dcl.init.ref_) to an argument expression, the implicit
1510 conversion sequence is the identity conversion, unless the
1511 argument expression has a type that is a derived class of the
1512 parameter type, in which case the implicit conversion sequence is
1513 a derived-to-base Conversion.
1515 If the parameter binds directly to the result of applying a
1516 conversion function to the argument expression, the implicit
1517 conversion sequence is a user-defined conversion sequence
1518 (_over.ics.user_), with the second standard conversion sequence
1519 either an identity conversion or, if the conversion function
1520 returns an entity of a type that is a derived class of the
1521 parameter type, a derived-to-base conversion. */
1522 if (is_properly_derived_from (conv->type, t))
1524 /* Represent the derived-to-base conversion. */
1525 conv = build_conv (ck_base, t, conv);
1526 /* We will actually be binding to the base-class subobject in
1527 the derived class, so we mark this conversion appropriately.
1528 That way, convert_like knows not to generate a temporary. */
1529 conv->need_temporary_p = false;
1532 return build_conv (ck_ref_bind, type, conv);
1535 /* Returns the conversion path from type FROM to reference type TO for
1536 purposes of reference binding. For lvalue binding, either pass a
1537 reference type to FROM or an lvalue expression to EXPR. If the
1538 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1539 the conversion returned. If C_CAST_P is true, this
1540 conversion is coming from a C-style cast. */
1542 static conversion *
1543 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1544 tsubst_flags_t complain)
1546 conversion *conv = NULL;
1547 tree to = TREE_TYPE (rto);
1548 tree from = rfrom;
1549 tree tfrom;
1550 bool related_p;
1551 bool compatible_p;
1552 cp_lvalue_kind gl_kind;
1553 bool is_lvalue;
1555 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1557 expr = instantiate_type (to, expr, tf_none);
1558 if (expr == error_mark_node)
1559 return NULL;
1560 from = TREE_TYPE (expr);
1563 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1565 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1566 /* DR 1288: Otherwise, if the initializer list has a single element
1567 of type E and ... [T's] referenced type is reference-related to E,
1568 the object or reference is initialized from that element... */
1569 if (CONSTRUCTOR_NELTS (expr) == 1)
1571 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1572 if (error_operand_p (elt))
1573 return NULL;
1574 tree etype = TREE_TYPE (elt);
1575 if (reference_related_p (to, etype))
1577 expr = elt;
1578 from = etype;
1579 goto skip;
1582 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1583 referenced by T is copy-list-initialized, and the reference is bound
1584 to that temporary. */
1585 CONSTRUCTOR_IS_DIRECT_INIT (expr) = false;
1586 skip:;
1589 if (TYPE_REF_P (from))
1591 from = TREE_TYPE (from);
1592 if (!TYPE_REF_IS_RVALUE (rfrom)
1593 || TREE_CODE (from) == FUNCTION_TYPE)
1594 gl_kind = clk_ordinary;
1595 else
1596 gl_kind = clk_rvalueref;
1598 else if (expr)
1599 gl_kind = lvalue_kind (expr);
1600 else if (CLASS_TYPE_P (from)
1601 || TREE_CODE (from) == ARRAY_TYPE)
1602 gl_kind = clk_class;
1603 else
1604 gl_kind = clk_none;
1606 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1607 if ((flags & LOOKUP_NO_TEMP_BIND)
1608 && (gl_kind & clk_class))
1609 gl_kind = clk_none;
1611 /* Same mask as real_lvalue_p. */
1612 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1614 tfrom = from;
1615 if ((gl_kind & clk_bitfield) != 0)
1616 tfrom = unlowered_expr_type (expr);
1618 /* Figure out whether or not the types are reference-related and
1619 reference compatible. We have to do this after stripping
1620 references from FROM. */
1621 related_p = reference_related_p (to, tfrom);
1622 /* If this is a C cast, first convert to an appropriately qualified
1623 type, so that we can later do a const_cast to the desired type. */
1624 if (related_p && c_cast_p
1625 && !at_least_as_qualified_p (to, tfrom))
1626 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1627 compatible_p = reference_compatible_p (to, tfrom);
1629 /* Directly bind reference when target expression's type is compatible with
1630 the reference and expression is an lvalue. In DR391, the wording in
1631 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1632 const and rvalue references to rvalues of compatible class type.
1633 We should also do direct bindings for non-class xvalues. */
1634 if ((related_p || compatible_p) && gl_kind)
1636 /* [dcl.init.ref]
1638 If the initializer expression
1640 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1641 is reference-compatible with "cv2 T2,"
1643 the reference is bound directly to the initializer expression
1644 lvalue.
1646 [...]
1647 If the initializer expression is an rvalue, with T2 a class type,
1648 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1649 is bound to the object represented by the rvalue or to a sub-object
1650 within that object. */
1652 conv = build_identity_conv (tfrom, expr);
1653 conv = direct_reference_binding (rto, conv);
1655 if (TYPE_REF_P (rfrom))
1656 /* Handle rvalue reference to function properly. */
1657 conv->rvaluedness_matches_p
1658 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1659 else
1660 conv->rvaluedness_matches_p
1661 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1663 if ((gl_kind & clk_bitfield) != 0
1664 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1665 /* For the purposes of overload resolution, we ignore the fact
1666 this expression is a bitfield or packed field. (In particular,
1667 [over.ics.ref] says specifically that a function with a
1668 non-const reference parameter is viable even if the
1669 argument is a bitfield.)
1671 However, when we actually call the function we must create
1672 a temporary to which to bind the reference. If the
1673 reference is volatile, or isn't const, then we cannot make
1674 a temporary, so we just issue an error when the conversion
1675 actually occurs. */
1676 conv->need_temporary_p = true;
1678 /* Don't allow binding of lvalues (other than function lvalues) to
1679 rvalue references. */
1680 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1681 && TREE_CODE (to) != FUNCTION_TYPE)
1682 conv->bad_p = true;
1684 /* Nor the reverse. */
1685 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1686 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1687 || (flags & LOOKUP_NO_RVAL_BIND))
1688 && TREE_CODE (to) != FUNCTION_TYPE)
1689 conv->bad_p = true;
1691 if (!compatible_p)
1692 conv->bad_p = true;
1694 return conv;
1696 /* [class.conv.fct] A conversion function is never used to convert a
1697 (possibly cv-qualified) object to the (possibly cv-qualified) same
1698 object type (or a reference to it), to a (possibly cv-qualified) base
1699 class of that type (or a reference to it).... */
1700 else if (CLASS_TYPE_P (from) && !related_p
1701 && !(flags & LOOKUP_NO_CONVERSION))
1703 /* [dcl.init.ref]
1705 If the initializer expression
1707 -- has a class type (i.e., T2 is a class type) can be
1708 implicitly converted to an lvalue of type "cv3 T3," where
1709 "cv1 T1" is reference-compatible with "cv3 T3". (this
1710 conversion is selected by enumerating the applicable
1711 conversion functions (_over.match.ref_) and choosing the
1712 best one through overload resolution. (_over.match_).
1714 the reference is bound to the lvalue result of the conversion
1715 in the second case. */
1716 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1717 complain);
1718 if (cand)
1719 return cand->second_conv;
1722 /* From this point on, we conceptually need temporaries, even if we
1723 elide them. Only the cases above are "direct bindings". */
1724 if (flags & LOOKUP_NO_TEMP_BIND)
1725 return NULL;
1727 /* [over.ics.rank]
1729 When a parameter of reference type is not bound directly to an
1730 argument expression, the conversion sequence is the one required
1731 to convert the argument expression to the underlying type of the
1732 reference according to _over.best.ics_. Conceptually, this
1733 conversion sequence corresponds to copy-initializing a temporary
1734 of the underlying type with the argument expression. Any
1735 difference in top-level cv-qualification is subsumed by the
1736 initialization itself and does not constitute a conversion. */
1738 /* [dcl.init.ref]
1740 Otherwise, the reference shall be an lvalue reference to a
1741 non-volatile const type, or the reference shall be an rvalue
1742 reference.
1744 We try below to treat this as a bad conversion to improve diagnostics,
1745 but if TO is an incomplete class, we need to reject this conversion
1746 now to avoid unnecessary instantiation. */
1747 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1748 && !COMPLETE_TYPE_P (to))
1749 return NULL;
1751 /* We're generating a temporary now, but don't bind any more in the
1752 conversion (specifically, don't slice the temporary returned by a
1753 conversion operator). */
1754 flags |= LOOKUP_NO_TEMP_BIND;
1756 /* Core issue 899: When [copy-]initializing a temporary to be bound
1757 to the first parameter of a copy constructor (12.8) called with
1758 a single argument in the context of direct-initialization,
1759 explicit conversion functions are also considered.
1761 So don't set LOOKUP_ONLYCONVERTING in that case. */
1762 if (!(flags & LOOKUP_COPY_PARM))
1763 flags |= LOOKUP_ONLYCONVERTING;
1765 if (!conv)
1766 conv = implicit_conversion (to, from, expr, c_cast_p,
1767 flags, complain);
1768 if (!conv)
1769 return NULL;
1771 if (conv->user_conv_p)
1773 /* If initializing the temporary used a conversion function,
1774 recalculate the second conversion sequence. */
1775 for (conversion *t = conv; t; t = next_conversion (t))
1776 if (t->kind == ck_user
1777 && DECL_CONV_FN_P (t->cand->fn))
1779 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1780 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1781 conversion *new_second
1782 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1783 sflags, complain);
1784 if (!new_second)
1785 return NULL;
1786 return merge_conversion_sequences (t, new_second);
1790 conv = build_conv (ck_ref_bind, rto, conv);
1791 /* This reference binding, unlike those above, requires the
1792 creation of a temporary. */
1793 conv->need_temporary_p = true;
1794 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1796 /* [dcl.init.ref]
1798 Otherwise, the reference shall be an lvalue reference to a
1799 non-volatile const type, or the reference shall be an rvalue
1800 reference. */
1801 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1802 conv->bad_p = true;
1804 /* [dcl.init.ref]
1806 Otherwise, a temporary of type "cv1 T1" is created and
1807 initialized from the initializer expression using the rules for a
1808 non-reference copy initialization. If T1 is reference-related to
1809 T2, cv1 must be the same cv-qualification as, or greater
1810 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1811 if (related_p && !at_least_as_qualified_p (to, from))
1812 conv->bad_p = true;
1814 return conv;
1817 /* Returns the implicit conversion sequence (see [over.ics]) from type
1818 FROM to type TO. The optional expression EXPR may affect the
1819 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1820 true, this conversion is coming from a C-style cast. */
1822 static conversion *
1823 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1824 int flags, tsubst_flags_t complain)
1826 conversion *conv;
1828 if (from == error_mark_node || to == error_mark_node
1829 || expr == error_mark_node)
1830 return NULL;
1832 /* Other flags only apply to the primary function in overload
1833 resolution, or after we've chosen one. */
1834 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1835 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1836 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1838 /* FIXME: actually we don't want warnings either, but we can't just
1839 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1840 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1841 We really ought not to issue that warning until we've committed
1842 to that conversion. */
1843 complain &= ~tf_error;
1845 /* Call reshape_init early to remove redundant braces. */
1846 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1847 && CLASS_TYPE_P (to)
1848 && COMPLETE_TYPE_P (complete_type (to))
1849 && !CLASSTYPE_NON_AGGREGATE (to))
1851 expr = reshape_init (to, expr, complain);
1852 if (expr == error_mark_node)
1853 return NULL;
1854 from = TREE_TYPE (expr);
1857 if (TYPE_REF_P (to))
1858 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1859 else
1860 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1862 if (conv)
1863 return conv;
1865 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1867 if (is_std_init_list (to))
1868 return build_list_conv (to, expr, flags, complain);
1870 /* As an extension, allow list-initialization of _Complex. */
1871 if (TREE_CODE (to) == COMPLEX_TYPE)
1873 conv = build_complex_conv (to, expr, flags, complain);
1874 if (conv)
1875 return conv;
1878 /* Allow conversion from an initializer-list with one element to a
1879 scalar type. */
1880 if (SCALAR_TYPE_P (to))
1882 int nelts = CONSTRUCTOR_NELTS (expr);
1883 tree elt;
1885 if (nelts == 0)
1886 elt = build_value_init (to, tf_none);
1887 else if (nelts == 1)
1888 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1889 else
1890 elt = error_mark_node;
1892 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1893 c_cast_p, flags, complain);
1894 if (conv)
1896 conv->check_narrowing = true;
1897 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1898 /* Too many levels of braces, i.e. '{{1}}'. */
1899 conv->bad_p = true;
1900 return conv;
1903 else if (TREE_CODE (to) == ARRAY_TYPE)
1904 return build_array_conv (to, expr, flags, complain);
1907 if (expr != NULL_TREE
1908 && (MAYBE_CLASS_TYPE_P (from)
1909 || MAYBE_CLASS_TYPE_P (to))
1910 && (flags & LOOKUP_NO_CONVERSION) == 0)
1912 struct z_candidate *cand;
1914 if (CLASS_TYPE_P (to)
1915 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1916 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1917 return build_aggr_conv (to, expr, flags, complain);
1919 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1920 if (cand)
1922 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1923 && CONSTRUCTOR_NELTS (expr) == 1
1924 && !is_list_ctor (cand->fn))
1926 /* "If C is not an initializer-list constructor and the
1927 initializer list has a single element of type cv U, where U is
1928 X or a class derived from X, the implicit conversion sequence
1929 has Exact Match rank if U is X, or Conversion rank if U is
1930 derived from X." */
1931 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1932 tree elttype = TREE_TYPE (elt);
1933 if (reference_related_p (to, elttype))
1934 return implicit_conversion (to, elttype, elt,
1935 c_cast_p, flags, complain);
1937 conv = cand->second_conv;
1940 /* We used to try to bind a reference to a temporary here, but that
1941 is now handled after the recursive call to this function at the end
1942 of reference_binding. */
1943 return conv;
1946 return NULL;
1949 /* Like implicit_conversion, but return NULL if the conversion is bad.
1951 This is not static so that check_non_deducible_conversion can call it within
1952 add_template_candidate_real as part of overload resolution; it should not be
1953 called outside of overload resolution. */
1955 conversion *
1956 good_conversion (tree to, tree from, tree expr,
1957 int flags, tsubst_flags_t complain)
1959 conversion *c = implicit_conversion (to, from, expr, /*cast*/false,
1960 flags, complain);
1961 if (c && c->bad_p)
1962 c = NULL;
1963 return c;
1966 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1967 functions. ARGS will not be changed until a single candidate is
1968 selected. */
1970 static struct z_candidate *
1971 add_candidate (struct z_candidate **candidates,
1972 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1973 size_t num_convs, conversion **convs,
1974 tree access_path, tree conversion_path,
1975 int viable, struct rejection_reason *reason,
1976 int flags)
1978 struct z_candidate *cand = (struct z_candidate *)
1979 conversion_obstack_alloc (sizeof (struct z_candidate));
1981 cand->fn = fn;
1982 cand->first_arg = first_arg;
1983 cand->args = args;
1984 cand->convs = convs;
1985 cand->num_convs = num_convs;
1986 cand->access_path = access_path;
1987 cand->conversion_path = conversion_path;
1988 cand->viable = viable;
1989 cand->reason = reason;
1990 cand->next = *candidates;
1991 cand->flags = flags;
1992 *candidates = cand;
1994 return cand;
1997 /* Return the number of remaining arguments in the parameter list
1998 beginning with ARG. */
2001 remaining_arguments (tree arg)
2003 int n;
2005 for (n = 0; arg != NULL_TREE && arg != void_list_node;
2006 arg = TREE_CHAIN (arg))
2007 n++;
2009 return n;
2012 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2013 to the first parameter of a constructor where the parameter is of type
2014 "reference to possibly cv-qualified T" and the constructor is called with a
2015 single argument in the context of direct-initialization of an object of type
2016 "cv2 T", explicit conversion functions are also considered.
2018 So set LOOKUP_COPY_PARM to let reference_binding know that
2019 it's being called in that context. */
2022 conv_flags (int i, int nargs, tree fn, tree arg, int flags)
2024 int lflags = flags;
2025 tree t;
2026 if (i == 0 && nargs == 1 && DECL_CONSTRUCTOR_P (fn)
2027 && (t = FUNCTION_FIRST_USER_PARMTYPE (fn))
2028 && (same_type_ignoring_top_level_qualifiers_p
2029 (non_reference (TREE_VALUE (t)), DECL_CONTEXT (fn))))
2031 if (!(flags & LOOKUP_ONLYCONVERTING))
2032 lflags |= LOOKUP_COPY_PARM;
2033 if ((flags & LOOKUP_LIST_INIT_CTOR)
2034 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2035 lflags |= LOOKUP_NO_CONVERSION;
2037 else
2038 lflags |= LOOKUP_ONLYCONVERTING;
2040 return lflags;
2043 /* Create an overload candidate for the function or method FN called
2044 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2045 FLAGS is passed on to implicit_conversion.
2047 This does not change ARGS.
2049 CTYPE, if non-NULL, is the type we want to pretend this function
2050 comes from for purposes of overload resolution. */
2052 static struct z_candidate *
2053 add_function_candidate (struct z_candidate **candidates,
2054 tree fn, tree ctype, tree first_arg,
2055 const vec<tree, va_gc> *args, tree access_path,
2056 tree conversion_path, int flags,
2057 conversion **convs,
2058 tsubst_flags_t complain)
2060 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
2061 int i, len;
2062 tree parmnode;
2063 tree orig_first_arg = first_arg;
2064 int skip;
2065 int viable = 1;
2066 struct rejection_reason *reason = NULL;
2068 /* At this point we should not see any functions which haven't been
2069 explicitly declared, except for friend functions which will have
2070 been found using argument dependent lookup. */
2071 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
2073 /* The `this', `in_chrg' and VTT arguments to constructors are not
2074 considered in overload resolution. */
2075 if (DECL_CONSTRUCTOR_P (fn))
2077 if (ctor_omit_inherited_parms (fn))
2078 /* Bring back parameters omitted from an inherited ctor. */
2079 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2080 else
2081 parmlist = skip_artificial_parms_for (fn, parmlist);
2082 skip = num_artificial_parms_for (fn);
2083 if (skip > 0 && first_arg != NULL_TREE)
2085 --skip;
2086 first_arg = NULL_TREE;
2089 else
2090 skip = 0;
2092 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2093 if (!convs)
2094 convs = alloc_conversions (len);
2096 /* 13.3.2 - Viable functions [over.match.viable]
2097 First, to be a viable function, a candidate function shall have enough
2098 parameters to agree in number with the arguments in the list.
2100 We need to check this first; otherwise, checking the ICSes might cause
2101 us to produce an ill-formed template instantiation. */
2103 parmnode = parmlist;
2104 for (i = 0; i < len; ++i)
2106 if (parmnode == NULL_TREE || parmnode == void_list_node)
2107 break;
2108 parmnode = TREE_CHAIN (parmnode);
2111 if ((i < len && parmnode)
2112 || !sufficient_parms_p (parmnode))
2114 int remaining = remaining_arguments (parmnode);
2115 viable = 0;
2116 reason = arity_rejection (first_arg, i + remaining, len);
2119 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2120 parameter of type "reference to cv C" (including such a constructor
2121 instantiated from a template) is excluded from the set of candidate
2122 functions when used to construct an object of type D with an argument list
2123 containing a single argument if C is reference-related to D. */
2124 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2125 && flag_new_inheriting_ctors
2126 && DECL_INHERITED_CTOR (fn))
2128 tree ptype = non_reference (TREE_VALUE (parmlist));
2129 tree dtype = DECL_CONTEXT (fn);
2130 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2131 if (reference_related_p (ptype, dtype)
2132 && reference_related_p (btype, ptype))
2134 viable = false;
2135 reason = inherited_ctor_rejection ();
2139 /* Second, for a function to be viable, its constraints must be
2140 satisfied. */
2141 if (flag_concepts && viable
2142 && !constraints_satisfied_p (fn))
2144 reason = constraint_failure (fn);
2145 viable = false;
2148 /* When looking for a function from a subobject from an implicit
2149 copy/move constructor/operator=, don't consider anything that takes (a
2150 reference to) an unrelated type. See c++/44909 and core 1092. */
2151 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2153 if (DECL_CONSTRUCTOR_P (fn))
2154 i = 1;
2155 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2156 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR))
2157 i = 2;
2158 else
2159 i = 0;
2160 if (i && len == i)
2162 parmnode = chain_index (i-1, parmlist);
2163 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2164 ctype))
2165 viable = 0;
2168 /* This only applies at the top level. */
2169 flags &= ~LOOKUP_DEFAULTED;
2172 if (! viable)
2173 goto out;
2175 /* Third, for F to be a viable function, there shall exist for each
2176 argument an implicit conversion sequence that converts that argument
2177 to the corresponding parameter of F. */
2179 parmnode = parmlist;
2181 for (i = 0; i < len; ++i)
2183 tree argtype, to_type;
2184 tree arg;
2185 conversion *t;
2186 int is_this;
2188 if (parmnode == void_list_node)
2189 break;
2191 if (convs[i])
2193 /* Already set during deduction. */
2194 parmnode = TREE_CHAIN (parmnode);
2195 continue;
2198 if (i == 0 && first_arg != NULL_TREE)
2199 arg = first_arg;
2200 else
2201 arg = CONST_CAST_TREE (
2202 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2203 argtype = lvalue_type (arg);
2205 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2206 && ! DECL_CONSTRUCTOR_P (fn));
2208 if (parmnode)
2210 tree parmtype = TREE_VALUE (parmnode);
2212 parmnode = TREE_CHAIN (parmnode);
2214 /* The type of the implicit object parameter ('this') for
2215 overload resolution is not always the same as for the
2216 function itself; conversion functions are considered to
2217 be members of the class being converted, and functions
2218 introduced by a using-declaration are considered to be
2219 members of the class that uses them.
2221 Since build_over_call ignores the ICS for the `this'
2222 parameter, we can just change the parm type. */
2223 if (ctype && is_this)
2225 parmtype = cp_build_qualified_type
2226 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2227 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2229 /* If the function has a ref-qualifier, the implicit
2230 object parameter has reference type. */
2231 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2232 parmtype = cp_build_reference_type (parmtype, rv);
2233 /* The special handling of 'this' conversions in compare_ics
2234 does not apply if there is a ref-qualifier. */
2235 is_this = false;
2237 else
2239 parmtype = build_pointer_type (parmtype);
2240 /* We don't use build_this here because we don't want to
2241 capture the object argument until we've chosen a
2242 non-static member function. */
2243 arg = build_address (arg);
2244 argtype = lvalue_type (arg);
2248 int lflags = conv_flags (i, len-skip, fn, arg, flags);
2250 t = implicit_conversion (parmtype, argtype, arg,
2251 /*c_cast_p=*/false, lflags, complain);
2252 to_type = parmtype;
2254 else
2256 t = build_identity_conv (argtype, arg);
2257 t->ellipsis_p = true;
2258 to_type = argtype;
2261 if (t && is_this)
2262 t->this_p = true;
2264 convs[i] = t;
2265 if (! t)
2267 viable = 0;
2268 reason = arg_conversion_rejection (first_arg, i, argtype, to_type,
2269 EXPR_LOCATION (arg));
2270 break;
2273 if (t->bad_p)
2275 viable = -1;
2276 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type,
2277 EXPR_LOCATION (arg));
2282 out:
2283 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2284 access_path, conversion_path, viable, reason, flags);
2287 /* Create an overload candidate for the conversion function FN which will
2288 be invoked for expression OBJ, producing a pointer-to-function which
2289 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2290 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2291 passed on to implicit_conversion.
2293 Actually, we don't really care about FN; we care about the type it
2294 converts to. There may be multiple conversion functions that will
2295 convert to that type, and we rely on build_user_type_conversion_1 to
2296 choose the best one; so when we create our candidate, we record the type
2297 instead of the function. */
2299 static struct z_candidate *
2300 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2301 const vec<tree, va_gc> *arglist,
2302 tree access_path, tree conversion_path,
2303 tsubst_flags_t complain)
2305 tree totype = TREE_TYPE (TREE_TYPE (fn));
2306 int i, len, viable, flags;
2307 tree parmlist, parmnode;
2308 conversion **convs;
2309 struct rejection_reason *reason;
2311 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2312 parmlist = TREE_TYPE (parmlist);
2313 parmlist = TYPE_ARG_TYPES (parmlist);
2315 len = vec_safe_length (arglist) + 1;
2316 convs = alloc_conversions (len);
2317 parmnode = parmlist;
2318 viable = 1;
2319 flags = LOOKUP_IMPLICIT;
2320 reason = NULL;
2322 /* Don't bother looking up the same type twice. */
2323 if (*candidates && (*candidates)->fn == totype)
2324 return NULL;
2326 for (i = 0; i < len; ++i)
2328 tree arg, argtype, convert_type = NULL_TREE;
2329 conversion *t;
2331 if (i == 0)
2332 arg = obj;
2333 else
2334 arg = (*arglist)[i - 1];
2335 argtype = lvalue_type (arg);
2337 if (i == 0)
2339 t = build_identity_conv (argtype, NULL_TREE);
2340 t = build_conv (ck_user, totype, t);
2341 /* Leave the 'cand' field null; we'll figure out the conversion in
2342 convert_like_real if this candidate is chosen. */
2343 convert_type = totype;
2345 else if (parmnode == void_list_node)
2346 break;
2347 else if (parmnode)
2349 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2350 /*c_cast_p=*/false, flags, complain);
2351 convert_type = TREE_VALUE (parmnode);
2353 else
2355 t = build_identity_conv (argtype, arg);
2356 t->ellipsis_p = true;
2357 convert_type = argtype;
2360 convs[i] = t;
2361 if (! t)
2362 break;
2364 if (t->bad_p)
2366 viable = -1;
2367 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type,
2368 EXPR_LOCATION (arg));
2371 if (i == 0)
2372 continue;
2374 if (parmnode)
2375 parmnode = TREE_CHAIN (parmnode);
2378 if (i < len
2379 || ! sufficient_parms_p (parmnode))
2381 int remaining = remaining_arguments (parmnode);
2382 viable = 0;
2383 reason = arity_rejection (NULL_TREE, i + remaining, len);
2386 return add_candidate (candidates, totype, obj, arglist, len, convs,
2387 access_path, conversion_path, viable, reason, flags);
2390 static void
2391 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2392 tree type1, tree type2, tree *args, tree *argtypes,
2393 int flags, tsubst_flags_t complain)
2395 conversion *t;
2396 conversion **convs;
2397 size_t num_convs;
2398 int viable = 1, i;
2399 tree types[2];
2400 struct rejection_reason *reason = NULL;
2402 types[0] = type1;
2403 types[1] = type2;
2405 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2406 convs = alloc_conversions (num_convs);
2408 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2409 conversion ops are allowed. We handle that here by just checking for
2410 boolean_type_node because other operators don't ask for it. COND_EXPR
2411 also does contextual conversion to bool for the first operand, but we
2412 handle that in build_conditional_expr, and type1 here is operand 2. */
2413 if (type1 != boolean_type_node)
2414 flags |= LOOKUP_ONLYCONVERTING;
2416 for (i = 0; i < 2; ++i)
2418 if (! args[i])
2419 break;
2421 t = implicit_conversion (types[i], argtypes[i], args[i],
2422 /*c_cast_p=*/false, flags, complain);
2423 if (! t)
2425 viable = 0;
2426 /* We need something for printing the candidate. */
2427 t = build_identity_conv (types[i], NULL_TREE);
2428 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2429 types[i], EXPR_LOCATION (args[i]));
2431 else if (t->bad_p)
2433 viable = 0;
2434 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2435 types[i],
2436 EXPR_LOCATION (args[i]));
2438 convs[i] = t;
2441 /* For COND_EXPR we rearranged the arguments; undo that now. */
2442 if (args[2])
2444 convs[2] = convs[1];
2445 convs[1] = convs[0];
2446 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2447 /*c_cast_p=*/false, flags,
2448 complain);
2449 if (t)
2450 convs[0] = t;
2451 else
2453 viable = 0;
2454 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2455 boolean_type_node,
2456 EXPR_LOCATION (args[2]));
2460 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2461 num_convs, convs,
2462 /*access_path=*/NULL_TREE,
2463 /*conversion_path=*/NULL_TREE,
2464 viable, reason, flags);
2467 static bool
2468 is_complete (tree t)
2470 return COMPLETE_TYPE_P (complete_type (t));
2473 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2475 static bool
2476 promoted_arithmetic_type_p (tree type)
2478 /* [over.built]
2480 In this section, the term promoted integral type is used to refer
2481 to those integral types which are preserved by integral promotion
2482 (including e.g. int and long but excluding e.g. char).
2483 Similarly, the term promoted arithmetic type refers to promoted
2484 integral types plus floating types. */
2485 return ((CP_INTEGRAL_TYPE_P (type)
2486 && same_type_p (type_promotes_to (type), type))
2487 || TREE_CODE (type) == REAL_TYPE);
2490 /* Create any builtin operator overload candidates for the operator in
2491 question given the converted operand types TYPE1 and TYPE2. The other
2492 args are passed through from add_builtin_candidates to
2493 build_builtin_candidate.
2495 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2496 If CODE is requires candidates operands of the same type of the kind
2497 of which TYPE1 and TYPE2 are, we add both candidates
2498 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2500 static void
2501 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2502 enum tree_code code2, tree fnname, tree type1,
2503 tree type2, tree *args, tree *argtypes, int flags,
2504 tsubst_flags_t complain)
2506 switch (code)
2508 case POSTINCREMENT_EXPR:
2509 case POSTDECREMENT_EXPR:
2510 args[1] = integer_zero_node;
2511 type2 = integer_type_node;
2512 break;
2513 default:
2514 break;
2517 switch (code)
2520 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2521 and VQ is either volatile or empty, there exist candidate operator
2522 functions of the form
2523 VQ T& operator++(VQ T&);
2524 T operator++(VQ T&, int);
2525 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2526 type other than bool, and VQ is either volatile or empty, there exist
2527 candidate operator functions of the form
2528 VQ T& operator--(VQ T&);
2529 T operator--(VQ T&, int);
2530 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2531 complete object type, and VQ is either volatile or empty, there exist
2532 candidate operator functions of the form
2533 T*VQ& operator++(T*VQ&);
2534 T*VQ& operator--(T*VQ&);
2535 T* operator++(T*VQ&, int);
2536 T* operator--(T*VQ&, int); */
2538 case POSTDECREMENT_EXPR:
2539 case PREDECREMENT_EXPR:
2540 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2541 return;
2542 /* FALLTHRU */
2543 case POSTINCREMENT_EXPR:
2544 case PREINCREMENT_EXPR:
2545 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2547 type1 = build_reference_type (type1);
2548 break;
2550 return;
2552 /* 7 For every cv-qualified or cv-unqualified object type T, there
2553 exist candidate operator functions of the form
2555 T& operator*(T*);
2557 8 For every function type T, there exist candidate operator functions of
2558 the form
2559 T& operator*(T*); */
2561 case INDIRECT_REF:
2562 if (TYPE_PTR_P (type1)
2563 && (TYPE_PTROB_P (type1)
2564 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2565 break;
2566 return;
2568 /* 9 For every type T, there exist candidate operator functions of the form
2569 T* operator+(T*);
2571 10For every promoted arithmetic type T, there exist candidate operator
2572 functions of the form
2573 T operator+(T);
2574 T operator-(T); */
2576 case UNARY_PLUS_EXPR: /* unary + */
2577 if (TYPE_PTR_P (type1))
2578 break;
2579 /* FALLTHRU */
2580 case NEGATE_EXPR:
2581 if (ARITHMETIC_TYPE_P (type1))
2582 break;
2583 return;
2585 /* 11For every promoted integral type T, there exist candidate operator
2586 functions of the form
2587 T operator~(T); */
2589 case BIT_NOT_EXPR:
2590 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2591 break;
2592 return;
2594 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2595 is the same type as C2 or is a derived class of C2, T is a complete
2596 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2597 there exist candidate operator functions of the form
2598 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2599 where CV12 is the union of CV1 and CV2. */
2601 case MEMBER_REF:
2602 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2604 tree c1 = TREE_TYPE (type1);
2605 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2607 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2608 && (TYPE_PTRMEMFUNC_P (type2)
2609 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2610 break;
2612 return;
2614 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2615 didate operator functions of the form
2616 LR operator*(L, R);
2617 LR operator/(L, R);
2618 LR operator+(L, R);
2619 LR operator-(L, R);
2620 bool operator<(L, R);
2621 bool operator>(L, R);
2622 bool operator<=(L, R);
2623 bool operator>=(L, R);
2624 bool operator==(L, R);
2625 bool operator!=(L, R);
2626 where LR is the result of the usual arithmetic conversions between
2627 types L and R.
2629 14For every pair of types T and I, where T is a cv-qualified or cv-
2630 unqualified complete object type and I is a promoted integral type,
2631 there exist candidate operator functions of the form
2632 T* operator+(T*, I);
2633 T& operator[](T*, I);
2634 T* operator-(T*, I);
2635 T* operator+(I, T*);
2636 T& operator[](I, T*);
2638 15For every T, where T is a pointer to complete object type, there exist
2639 candidate operator functions of the form112)
2640 ptrdiff_t operator-(T, T);
2642 16For every pointer or enumeration type T, there exist candidate operator
2643 functions of the form
2644 bool operator<(T, T);
2645 bool operator>(T, T);
2646 bool operator<=(T, T);
2647 bool operator>=(T, T);
2648 bool operator==(T, T);
2649 bool operator!=(T, T);
2651 17For every pointer to member type T, there exist candidate operator
2652 functions of the form
2653 bool operator==(T, T);
2654 bool operator!=(T, T); */
2656 case MINUS_EXPR:
2657 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2658 break;
2659 if (TYPE_PTROB_P (type1)
2660 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2662 type2 = ptrdiff_type_node;
2663 break;
2665 /* FALLTHRU */
2666 case MULT_EXPR:
2667 case TRUNC_DIV_EXPR:
2668 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2669 break;
2670 return;
2672 case EQ_EXPR:
2673 case NE_EXPR:
2674 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2675 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2676 break;
2677 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2679 type2 = type1;
2680 break;
2682 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2684 type1 = type2;
2685 break;
2687 /* Fall through. */
2688 case LT_EXPR:
2689 case GT_EXPR:
2690 case LE_EXPR:
2691 case GE_EXPR:
2692 case MAX_EXPR:
2693 case MIN_EXPR:
2694 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2695 break;
2696 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2697 break;
2698 if (TREE_CODE (type1) == ENUMERAL_TYPE
2699 && TREE_CODE (type2) == ENUMERAL_TYPE)
2700 break;
2701 if (TYPE_PTR_P (type1)
2702 && null_ptr_cst_p (args[1]))
2704 type2 = type1;
2705 break;
2707 if (null_ptr_cst_p (args[0])
2708 && TYPE_PTR_P (type2))
2710 type1 = type2;
2711 break;
2713 return;
2715 case PLUS_EXPR:
2716 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2717 break;
2718 /* FALLTHRU */
2719 case ARRAY_REF:
2720 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2722 type1 = ptrdiff_type_node;
2723 break;
2725 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2727 type2 = ptrdiff_type_node;
2728 break;
2730 return;
2732 /* 18For every pair of promoted integral types L and R, there exist candi-
2733 date operator functions of the form
2734 LR operator%(L, R);
2735 LR operator&(L, R);
2736 LR operator^(L, R);
2737 LR operator|(L, R);
2738 L operator<<(L, R);
2739 L operator>>(L, R);
2740 where LR is the result of the usual arithmetic conversions between
2741 types L and R. */
2743 case TRUNC_MOD_EXPR:
2744 case BIT_AND_EXPR:
2745 case BIT_IOR_EXPR:
2746 case BIT_XOR_EXPR:
2747 case LSHIFT_EXPR:
2748 case RSHIFT_EXPR:
2749 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2750 break;
2751 return;
2753 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2754 type, VQ is either volatile or empty, and R is a promoted arithmetic
2755 type, there exist candidate operator functions of the form
2756 VQ L& operator=(VQ L&, R);
2757 VQ L& operator*=(VQ L&, R);
2758 VQ L& operator/=(VQ L&, R);
2759 VQ L& operator+=(VQ L&, R);
2760 VQ L& operator-=(VQ L&, R);
2762 20For every pair T, VQ), where T is any type and VQ is either volatile
2763 or empty, there exist candidate operator functions of the form
2764 T*VQ& operator=(T*VQ&, T*);
2766 21For every pair T, VQ), where T is a pointer to member type and VQ is
2767 either volatile or empty, there exist candidate operator functions of
2768 the form
2769 VQ T& operator=(VQ T&, T);
2771 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2772 unqualified complete object type, VQ is either volatile or empty, and
2773 I is a promoted integral type, there exist candidate operator func-
2774 tions of the form
2775 T*VQ& operator+=(T*VQ&, I);
2776 T*VQ& operator-=(T*VQ&, I);
2778 23For every triple L, VQ, R), where L is an integral or enumeration
2779 type, VQ is either volatile or empty, and R is a promoted integral
2780 type, there exist candidate operator functions of the form
2782 VQ L& operator%=(VQ L&, R);
2783 VQ L& operator<<=(VQ L&, R);
2784 VQ L& operator>>=(VQ L&, R);
2785 VQ L& operator&=(VQ L&, R);
2786 VQ L& operator^=(VQ L&, R);
2787 VQ L& operator|=(VQ L&, R); */
2789 case MODIFY_EXPR:
2790 switch (code2)
2792 case PLUS_EXPR:
2793 case MINUS_EXPR:
2794 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2796 type2 = ptrdiff_type_node;
2797 break;
2799 /* FALLTHRU */
2800 case MULT_EXPR:
2801 case TRUNC_DIV_EXPR:
2802 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2803 break;
2804 return;
2806 case TRUNC_MOD_EXPR:
2807 case BIT_AND_EXPR:
2808 case BIT_IOR_EXPR:
2809 case BIT_XOR_EXPR:
2810 case LSHIFT_EXPR:
2811 case RSHIFT_EXPR:
2812 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2813 break;
2814 return;
2816 case NOP_EXPR:
2817 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2818 break;
2819 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2820 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2821 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2822 || ((TYPE_PTRMEMFUNC_P (type1)
2823 || TYPE_PTR_P (type1))
2824 && null_ptr_cst_p (args[1])))
2826 type2 = type1;
2827 break;
2829 return;
2831 default:
2832 gcc_unreachable ();
2834 type1 = build_reference_type (type1);
2835 break;
2837 case COND_EXPR:
2838 /* [over.built]
2840 For every pair of promoted arithmetic types L and R, there
2841 exist candidate operator functions of the form
2843 LR operator?(bool, L, R);
2845 where LR is the result of the usual arithmetic conversions
2846 between types L and R.
2848 For every type T, where T is a pointer or pointer-to-member
2849 type, there exist candidate operator functions of the form T
2850 operator?(bool, T, T); */
2852 if (promoted_arithmetic_type_p (type1)
2853 && promoted_arithmetic_type_p (type2))
2854 /* That's OK. */
2855 break;
2857 /* Otherwise, the types should be pointers. */
2858 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2859 return;
2861 /* We don't check that the two types are the same; the logic
2862 below will actually create two candidates; one in which both
2863 parameter types are TYPE1, and one in which both parameter
2864 types are TYPE2. */
2865 break;
2867 case REALPART_EXPR:
2868 case IMAGPART_EXPR:
2869 if (ARITHMETIC_TYPE_P (type1))
2870 break;
2871 return;
2873 default:
2874 gcc_unreachable ();
2877 /* Make sure we don't create builtin candidates with dependent types. */
2878 bool u1 = uses_template_parms (type1);
2879 bool u2 = type2 ? uses_template_parms (type2) : false;
2880 if (u1 || u2)
2882 /* Try to recover if one of the types is non-dependent. But if
2883 there's only one type, there's nothing we can do. */
2884 if (!type2)
2885 return;
2886 /* And we lose if both are dependent. */
2887 if (u1 && u2)
2888 return;
2889 /* Or if they have different forms. */
2890 if (TREE_CODE (type1) != TREE_CODE (type2))
2891 return;
2893 if (u1 && !u2)
2894 type1 = type2;
2895 else if (u2 && !u1)
2896 type2 = type1;
2899 /* If we're dealing with two pointer types or two enumeral types,
2900 we need candidates for both of them. */
2901 if (type2 && !same_type_p (type1, type2)
2902 && TREE_CODE (type1) == TREE_CODE (type2)
2903 && (TYPE_REF_P (type1)
2904 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2905 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2906 || TYPE_PTRMEMFUNC_P (type1)
2907 || MAYBE_CLASS_TYPE_P (type1)
2908 || TREE_CODE (type1) == ENUMERAL_TYPE))
2910 if (TYPE_PTR_OR_PTRMEM_P (type1))
2912 tree cptype = composite_pointer_type (type1, type2,
2913 error_mark_node,
2914 error_mark_node,
2915 CPO_CONVERSION,
2916 tf_none);
2917 if (cptype != error_mark_node)
2919 build_builtin_candidate
2920 (candidates, fnname, cptype, cptype, args, argtypes,
2921 flags, complain);
2922 return;
2926 build_builtin_candidate
2927 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2928 build_builtin_candidate
2929 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2930 return;
2933 build_builtin_candidate
2934 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2937 tree
2938 type_decays_to (tree type)
2940 if (TREE_CODE (type) == ARRAY_TYPE)
2941 return build_pointer_type (TREE_TYPE (type));
2942 if (TREE_CODE (type) == FUNCTION_TYPE)
2943 return build_pointer_type (type);
2944 return type;
2947 /* There are three conditions of builtin candidates:
2949 1) bool-taking candidates. These are the same regardless of the input.
2950 2) pointer-pair taking candidates. These are generated for each type
2951 one of the input types converts to.
2952 3) arithmetic candidates. According to the standard, we should generate
2953 all of these, but I'm trying not to...
2955 Here we generate a superset of the possible candidates for this particular
2956 case. That is a subset of the full set the standard defines, plus some
2957 other cases which the standard disallows. add_builtin_candidate will
2958 filter out the invalid set. */
2960 static void
2961 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2962 enum tree_code code2, tree fnname, tree *args,
2963 int flags, tsubst_flags_t complain)
2965 int ref1, i;
2966 int enum_p = 0;
2967 tree type, argtypes[3], t;
2968 /* TYPES[i] is the set of possible builtin-operator parameter types
2969 we will consider for the Ith argument. */
2970 vec<tree, va_gc> *types[2];
2971 unsigned ix;
2973 for (i = 0; i < 3; ++i)
2975 if (args[i])
2976 argtypes[i] = unlowered_expr_type (args[i]);
2977 else
2978 argtypes[i] = NULL_TREE;
2981 switch (code)
2983 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2984 and VQ is either volatile or empty, there exist candidate operator
2985 functions of the form
2986 VQ T& operator++(VQ T&); */
2988 case POSTINCREMENT_EXPR:
2989 case PREINCREMENT_EXPR:
2990 case POSTDECREMENT_EXPR:
2991 case PREDECREMENT_EXPR:
2992 case MODIFY_EXPR:
2993 ref1 = 1;
2994 break;
2996 /* 24There also exist candidate operator functions of the form
2997 bool operator!(bool);
2998 bool operator&&(bool, bool);
2999 bool operator||(bool, bool); */
3001 case TRUTH_NOT_EXPR:
3002 build_builtin_candidate
3003 (candidates, fnname, boolean_type_node,
3004 NULL_TREE, args, argtypes, flags, complain);
3005 return;
3007 case TRUTH_ORIF_EXPR:
3008 case TRUTH_ANDIF_EXPR:
3009 build_builtin_candidate
3010 (candidates, fnname, boolean_type_node,
3011 boolean_type_node, args, argtypes, flags, complain);
3012 return;
3014 case ADDR_EXPR:
3015 case COMPOUND_EXPR:
3016 case COMPONENT_REF:
3017 return;
3019 case COND_EXPR:
3020 case EQ_EXPR:
3021 case NE_EXPR:
3022 case LT_EXPR:
3023 case LE_EXPR:
3024 case GT_EXPR:
3025 case GE_EXPR:
3026 enum_p = 1;
3027 /* Fall through. */
3029 default:
3030 ref1 = 0;
3033 types[0] = make_tree_vector ();
3034 types[1] = make_tree_vector ();
3036 for (i = 0; i < 2; ++i)
3038 if (! args[i])
3040 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
3042 tree convs;
3044 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
3045 return;
3047 convs = lookup_conversions (argtypes[i]);
3049 if (code == COND_EXPR)
3051 if (lvalue_p (args[i]))
3052 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3054 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
3057 else if (! convs)
3058 return;
3060 for (; convs; convs = TREE_CHAIN (convs))
3062 type = TREE_TYPE (convs);
3064 if (i == 0 && ref1
3065 && (!TYPE_REF_P (type)
3066 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3067 continue;
3069 if (code == COND_EXPR && TYPE_REF_P (type))
3070 vec_safe_push (types[i], type);
3072 type = non_reference (type);
3073 if (i != 0 || ! ref1)
3075 type = cv_unqualified (type_decays_to (type));
3076 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3077 vec_safe_push (types[i], type);
3078 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3079 type = type_promotes_to (type);
3082 if (! vec_member (type, types[i]))
3083 vec_safe_push (types[i], type);
3086 else
3088 if (code == COND_EXPR && lvalue_p (args[i]))
3089 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3090 type = non_reference (argtypes[i]);
3091 if (i != 0 || ! ref1)
3093 type = cv_unqualified (type_decays_to (type));
3094 if (enum_p && UNSCOPED_ENUM_P (type))
3095 vec_safe_push (types[i], type);
3096 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3097 type = type_promotes_to (type);
3099 vec_safe_push (types[i], type);
3103 /* Run through the possible parameter types of both arguments,
3104 creating candidates with those parameter types. */
3105 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3107 unsigned jx;
3108 tree u;
3110 if (!types[1]->is_empty ())
3111 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3112 add_builtin_candidate
3113 (candidates, code, code2, fnname, t,
3114 u, args, argtypes, flags, complain);
3115 else
3116 add_builtin_candidate
3117 (candidates, code, code2, fnname, t,
3118 NULL_TREE, args, argtypes, flags, complain);
3121 release_tree_vector (types[0]);
3122 release_tree_vector (types[1]);
3126 /* If TMPL can be successfully instantiated as indicated by
3127 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3129 TMPL is the template. EXPLICIT_TARGS are any explicit template
3130 arguments. ARGLIST is the arguments provided at the call-site.
3131 This does not change ARGLIST. The RETURN_TYPE is the desired type
3132 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3133 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3134 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3136 static struct z_candidate*
3137 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3138 tree ctype, tree explicit_targs, tree first_arg,
3139 const vec<tree, va_gc> *arglist, tree return_type,
3140 tree access_path, tree conversion_path,
3141 int flags, tree obj, unification_kind_t strict,
3142 tsubst_flags_t complain)
3144 int ntparms = DECL_NTPARMS (tmpl);
3145 tree targs = make_tree_vec (ntparms);
3146 unsigned int len = vec_safe_length (arglist);
3147 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3148 unsigned int skip_without_in_chrg = 0;
3149 tree first_arg_without_in_chrg = first_arg;
3150 tree *args_without_in_chrg;
3151 unsigned int nargs_without_in_chrg;
3152 unsigned int ia, ix;
3153 tree arg;
3154 struct z_candidate *cand;
3155 tree fn;
3156 struct rejection_reason *reason = NULL;
3157 int errs;
3158 conversion **convs = NULL;
3160 /* We don't do deduction on the in-charge parameter, the VTT
3161 parameter or 'this'. */
3162 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3164 if (first_arg_without_in_chrg != NULL_TREE)
3165 first_arg_without_in_chrg = NULL_TREE;
3166 else if (return_type && strict == DEDUCE_CALL)
3167 /* We're deducing for a call to the result of a template conversion
3168 function, so the args don't contain 'this'; leave them alone. */;
3169 else
3170 ++skip_without_in_chrg;
3173 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3174 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3175 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3177 if (first_arg_without_in_chrg != NULL_TREE)
3178 first_arg_without_in_chrg = NULL_TREE;
3179 else
3180 ++skip_without_in_chrg;
3183 if (len < skip_without_in_chrg)
3184 return NULL;
3186 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3187 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3188 TREE_TYPE ((*arglist)[0])))
3190 /* 12.8/6 says, "A declaration of a constructor for a class X is
3191 ill-formed if its first parameter is of type (optionally cv-qualified)
3192 X and either there are no other parameters or else all other
3193 parameters have default arguments. A member function template is never
3194 instantiated to produce such a constructor signature."
3196 So if we're trying to copy an object of the containing class, don't
3197 consider a template constructor that has a first parameter type that
3198 is just a template parameter, as we would deduce a signature that we
3199 would then reject in the code below. */
3200 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3202 firstparm = TREE_VALUE (firstparm);
3203 if (PACK_EXPANSION_P (firstparm))
3204 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3205 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3207 gcc_assert (!explicit_targs);
3208 reason = invalid_copy_with_fn_template_rejection ();
3209 goto fail;
3214 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3215 + (len - skip_without_in_chrg));
3216 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3217 ia = 0;
3218 if (first_arg_without_in_chrg != NULL_TREE)
3220 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3221 ++ia;
3223 for (ix = skip_without_in_chrg;
3224 vec_safe_iterate (arglist, ix, &arg);
3225 ++ix)
3227 args_without_in_chrg[ia] = arg;
3228 ++ia;
3230 gcc_assert (ia == nargs_without_in_chrg);
3232 errs = errorcount+sorrycount;
3233 if (!obj)
3234 convs = alloc_conversions (nargs);
3235 fn = fn_type_unification (tmpl, explicit_targs, targs,
3236 args_without_in_chrg,
3237 nargs_without_in_chrg,
3238 return_type, strict, flags, convs,
3239 false, complain & tf_decltype);
3241 if (fn == error_mark_node)
3243 /* Don't repeat unification later if it already resulted in errors. */
3244 if (errorcount+sorrycount == errs)
3245 reason = template_unification_rejection (tmpl, explicit_targs,
3246 targs, args_without_in_chrg,
3247 nargs_without_in_chrg,
3248 return_type, strict, flags);
3249 else
3250 reason = template_unification_error_rejection ();
3251 goto fail;
3254 /* Now the explicit specifier might have been deduced; check if this
3255 declaration is explicit. If it is and we're ignoring non-converting
3256 constructors, don't add this function to the set of candidates. */
3257 if ((flags & LOOKUP_ONLYCONVERTING) && DECL_NONCONVERTING_P (fn))
3258 return NULL;
3260 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3262 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3263 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3264 ctype))
3266 /* We're trying to produce a constructor with a prohibited signature,
3267 as discussed above; handle here any cases we didn't catch then,
3268 such as X(X<T>). */
3269 reason = invalid_copy_with_fn_template_rejection ();
3270 goto fail;
3274 if (obj != NULL_TREE)
3275 /* Aha, this is a conversion function. */
3276 cand = add_conv_candidate (candidates, fn, obj, arglist,
3277 access_path, conversion_path, complain);
3278 else
3279 cand = add_function_candidate (candidates, fn, ctype,
3280 first_arg, arglist, access_path,
3281 conversion_path, flags, convs, complain);
3282 if (DECL_TI_TEMPLATE (fn) != tmpl)
3283 /* This situation can occur if a member template of a template
3284 class is specialized. Then, instantiate_template might return
3285 an instantiation of the specialization, in which case the
3286 DECL_TI_TEMPLATE field will point at the original
3287 specialization. For example:
3289 template <class T> struct S { template <class U> void f(U);
3290 template <> void f(int) {}; };
3291 S<double> sd;
3292 sd.f(3);
3294 Here, TMPL will be template <class U> S<double>::f(U).
3295 And, instantiate template will give us the specialization
3296 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3297 for this will point at template <class T> template <> S<T>::f(int),
3298 so that we can find the definition. For the purposes of
3299 overload resolution, however, we want the original TMPL. */
3300 cand->template_decl = build_template_info (tmpl, targs);
3301 else
3302 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3303 cand->explicit_targs = explicit_targs;
3305 return cand;
3306 fail:
3307 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3308 access_path, conversion_path, 0, reason, flags);
3312 static struct z_candidate *
3313 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3314 tree explicit_targs, tree first_arg,
3315 const vec<tree, va_gc> *arglist, tree return_type,
3316 tree access_path, tree conversion_path, int flags,
3317 unification_kind_t strict, tsubst_flags_t complain)
3319 return
3320 add_template_candidate_real (candidates, tmpl, ctype,
3321 explicit_targs, first_arg, arglist,
3322 return_type, access_path, conversion_path,
3323 flags, NULL_TREE, strict, complain);
3326 /* Create an overload candidate for the conversion function template TMPL,
3327 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3328 pointer-to-function which will in turn be called with the argument list
3329 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3330 passed on to implicit_conversion. */
3332 static struct z_candidate *
3333 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3334 tree obj,
3335 const vec<tree, va_gc> *arglist,
3336 tree return_type, tree access_path,
3337 tree conversion_path, tsubst_flags_t complain)
3339 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3340 core issue 2189, let's disable this candidate if there are any call
3341 operators. */
3342 if (*candidates)
3343 return NULL;
3345 return
3346 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3347 NULL_TREE, arglist, return_type, access_path,
3348 conversion_path, 0, obj, DEDUCE_CALL,
3349 complain);
3352 /* The CANDS are the set of candidates that were considered for
3353 overload resolution. Return the set of viable candidates, or CANDS
3354 if none are viable. If any of the candidates were viable, set
3355 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3356 considered viable only if it is strictly viable. */
3358 static struct z_candidate*
3359 splice_viable (struct z_candidate *cands,
3360 bool strict_p,
3361 bool *any_viable_p)
3363 struct z_candidate *viable;
3364 struct z_candidate **last_viable;
3365 struct z_candidate **cand;
3366 bool found_strictly_viable = false;
3368 /* Be strict inside templates, since build_over_call won't actually
3369 do the conversions to get pedwarns. */
3370 if (processing_template_decl)
3371 strict_p = true;
3373 viable = NULL;
3374 last_viable = &viable;
3375 *any_viable_p = false;
3377 cand = &cands;
3378 while (*cand)
3380 struct z_candidate *c = *cand;
3381 if (!strict_p
3382 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3384 /* Be strict in the presence of a viable candidate. Also if
3385 there are template candidates, so that we get deduction errors
3386 for them instead of silently preferring a bad conversion. */
3387 strict_p = true;
3388 if (viable && !found_strictly_viable)
3390 /* Put any spliced near matches back onto the main list so
3391 that we see them if there is no strict match. */
3392 *any_viable_p = false;
3393 *last_viable = cands;
3394 cands = viable;
3395 viable = NULL;
3396 last_viable = &viable;
3400 if (strict_p ? c->viable == 1 : c->viable)
3402 *last_viable = c;
3403 *cand = c->next;
3404 c->next = NULL;
3405 last_viable = &c->next;
3406 *any_viable_p = true;
3407 if (c->viable == 1)
3408 found_strictly_viable = true;
3410 else
3411 cand = &c->next;
3414 return viable ? viable : cands;
3417 static bool
3418 any_strictly_viable (struct z_candidate *cands)
3420 for (; cands; cands = cands->next)
3421 if (cands->viable == 1)
3422 return true;
3423 return false;
3426 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3427 words, it is about to become the "this" pointer for a member
3428 function call. Take the address of the object. */
3430 static tree
3431 build_this (tree obj)
3433 /* In a template, we are only concerned about the type of the
3434 expression, so we can take a shortcut. */
3435 if (processing_template_decl)
3436 return build_address (obj);
3438 return cp_build_addr_expr (obj, tf_warning_or_error);
3441 /* Returns true iff functions are equivalent. Equivalent functions are
3442 not '==' only if one is a function-local extern function or if
3443 both are extern "C". */
3445 static inline int
3446 equal_functions (tree fn1, tree fn2)
3448 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3449 return 0;
3450 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3451 return fn1 == fn2;
3452 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3453 || DECL_EXTERN_C_FUNCTION_P (fn1))
3454 return decls_match (fn1, fn2);
3455 return fn1 == fn2;
3458 /* Print information about a candidate FN being rejected due to INFO. */
3460 static void
3461 print_conversion_rejection (location_t loc, struct conversion_info *info,
3462 tree fn)
3464 tree from = info->from;
3465 if (!TYPE_P (from))
3466 from = lvalue_type (from);
3467 if (info->n_arg == -1)
3469 /* Conversion of implicit `this' argument failed. */
3470 if (!TYPE_P (info->from))
3471 /* A bad conversion for 'this' must be discarding cv-quals. */
3472 inform (loc, " passing %qT as %<this%> "
3473 "argument discards qualifiers",
3474 from);
3475 else
3476 inform (loc, " no known conversion for implicit "
3477 "%<this%> parameter from %qH to %qI",
3478 from, info->to_type);
3480 else if (!TYPE_P (info->from))
3482 if (info->n_arg >= 0)
3483 inform (loc, " conversion of argument %d would be ill-formed:",
3484 info->n_arg + 1);
3485 perform_implicit_conversion (info->to_type, info->from,
3486 tf_warning_or_error);
3488 else if (info->n_arg == -2)
3489 /* Conversion of conversion function return value failed. */
3490 inform (loc, " no known conversion from %qH to %qI",
3491 from, info->to_type);
3492 else
3494 if (TREE_CODE (fn) == FUNCTION_DECL)
3495 loc = get_fndecl_argument_location (fn, info->n_arg);
3496 inform (loc, " no known conversion for argument %d from %qH to %qI",
3497 info->n_arg + 1, from, info->to_type);
3501 /* Print information about a candidate with WANT parameters and we found
3502 HAVE. */
3504 static void
3505 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3507 inform_n (loc, want,
3508 " candidate expects %d argument, %d provided",
3509 " candidate expects %d arguments, %d provided",
3510 want, have);
3513 /* Print information about one overload candidate CANDIDATE. MSGSTR
3514 is the text to print before the candidate itself.
3516 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3517 to have been run through gettext by the caller. This wart makes
3518 life simpler in print_z_candidates and for the translators. */
3520 static void
3521 print_z_candidate (location_t loc, const char *msgstr,
3522 struct z_candidate *candidate)
3524 const char *msg = (msgstr == NULL
3525 ? ""
3526 : ACONCAT ((msgstr, " ", NULL)));
3527 tree fn = candidate->fn;
3528 if (flag_new_inheriting_ctors)
3529 fn = strip_inheriting_ctors (fn);
3530 location_t cloc = location_of (fn);
3532 if (identifier_p (fn))
3534 cloc = loc;
3535 if (candidate->num_convs == 3)
3536 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3537 candidate->convs[0]->type,
3538 candidate->convs[1]->type,
3539 candidate->convs[2]->type);
3540 else if (candidate->num_convs == 2)
3541 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3542 candidate->convs[0]->type,
3543 candidate->convs[1]->type);
3544 else
3545 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3546 candidate->convs[0]->type);
3548 else if (TYPE_P (fn))
3549 inform (cloc, "%s%qT <conversion>", msg, fn);
3550 else if (candidate->viable == -1)
3551 inform (cloc, "%s%#qD <near match>", msg, fn);
3552 else if (DECL_DELETED_FN (fn))
3553 inform (cloc, "%s%#qD <deleted>", msg, fn);
3554 else
3555 inform (cloc, "%s%#qD", msg, fn);
3556 if (fn != candidate->fn)
3558 cloc = location_of (candidate->fn);
3559 inform (cloc, " inherited here");
3561 /* Give the user some information about why this candidate failed. */
3562 if (candidate->reason != NULL)
3564 struct rejection_reason *r = candidate->reason;
3566 switch (r->code)
3568 case rr_arity:
3569 print_arity_information (cloc, r->u.arity.actual,
3570 r->u.arity.expected);
3571 break;
3572 case rr_arg_conversion:
3573 print_conversion_rejection (cloc, &r->u.conversion, fn);
3574 break;
3575 case rr_bad_arg_conversion:
3576 print_conversion_rejection (cloc, &r->u.bad_conversion, fn);
3577 break;
3578 case rr_explicit_conversion:
3579 inform (cloc, " return type %qT of explicit conversion function "
3580 "cannot be converted to %qT with a qualification "
3581 "conversion", r->u.conversion.from,
3582 r->u.conversion.to_type);
3583 break;
3584 case rr_template_conversion:
3585 inform (cloc, " conversion from return type %qT of template "
3586 "conversion function specialization to %qT is not an "
3587 "exact match", r->u.conversion.from,
3588 r->u.conversion.to_type);
3589 break;
3590 case rr_template_unification:
3591 /* We use template_unification_error_rejection if unification caused
3592 actual non-SFINAE errors, in which case we don't need to repeat
3593 them here. */
3594 if (r->u.template_unification.tmpl == NULL_TREE)
3596 inform (cloc, " substitution of deduced template arguments "
3597 "resulted in errors seen above");
3598 break;
3600 /* Re-run template unification with diagnostics. */
3601 inform (cloc, " template argument deduction/substitution failed:");
3602 fn_type_unification (r->u.template_unification.tmpl,
3603 r->u.template_unification.explicit_targs,
3604 (make_tree_vec
3605 (r->u.template_unification.num_targs)),
3606 r->u.template_unification.args,
3607 r->u.template_unification.nargs,
3608 r->u.template_unification.return_type,
3609 r->u.template_unification.strict,
3610 r->u.template_unification.flags,
3611 NULL, true, false);
3612 break;
3613 case rr_invalid_copy:
3614 inform (cloc,
3615 " a constructor taking a single argument of its own "
3616 "class type is invalid");
3617 break;
3618 case rr_constraint_failure:
3620 tree tmpl = r->u.template_instantiation.tmpl;
3621 tree args = r->u.template_instantiation.targs;
3622 diagnose_constraints (cloc, tmpl, args);
3624 break;
3625 case rr_inherited_ctor:
3626 inform (cloc, " an inherited constructor is not a candidate for "
3627 "initialization from an expression of the same or derived "
3628 "type");
3629 break;
3630 case rr_none:
3631 default:
3632 /* This candidate didn't have any issues or we failed to
3633 handle a particular code. Either way... */
3634 gcc_unreachable ();
3639 static void
3640 print_z_candidates (location_t loc, struct z_candidate *candidates)
3642 struct z_candidate *cand1;
3643 struct z_candidate **cand2;
3645 if (!candidates)
3646 return;
3648 /* Remove non-viable deleted candidates. */
3649 cand1 = candidates;
3650 for (cand2 = &cand1; *cand2; )
3652 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3653 && !(*cand2)->viable
3654 && DECL_DELETED_FN ((*cand2)->fn))
3655 *cand2 = (*cand2)->next;
3656 else
3657 cand2 = &(*cand2)->next;
3659 /* ...if there are any non-deleted ones. */
3660 if (cand1)
3661 candidates = cand1;
3663 /* There may be duplicates in the set of candidates. We put off
3664 checking this condition as long as possible, since we have no way
3665 to eliminate duplicates from a set of functions in less than n^2
3666 time. Now we are about to emit an error message, so it is more
3667 permissible to go slowly. */
3668 for (cand1 = candidates; cand1; cand1 = cand1->next)
3670 tree fn = cand1->fn;
3671 /* Skip builtin candidates and conversion functions. */
3672 if (!DECL_P (fn))
3673 continue;
3674 cand2 = &cand1->next;
3675 while (*cand2)
3677 if (DECL_P ((*cand2)->fn)
3678 && equal_functions (fn, (*cand2)->fn))
3679 *cand2 = (*cand2)->next;
3680 else
3681 cand2 = &(*cand2)->next;
3685 for (; candidates; candidates = candidates->next)
3686 print_z_candidate (loc, "candidate:", candidates);
3689 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3690 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3691 the result of the conversion function to convert it to the final
3692 desired type. Merge the two sequences into a single sequence,
3693 and return the merged sequence. */
3695 static conversion *
3696 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3698 conversion **t;
3699 bool bad = user_seq->bad_p;
3701 gcc_assert (user_seq->kind == ck_user);
3703 /* Find the end of the second conversion sequence. */
3704 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3706 /* The entire sequence is a user-conversion sequence. */
3707 (*t)->user_conv_p = true;
3708 if (bad)
3709 (*t)->bad_p = true;
3712 if ((*t)->rvaluedness_matches_p)
3713 /* We're binding a reference directly to the result of the conversion.
3714 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3715 type, but we want it back. */
3716 user_seq->type = TREE_TYPE (TREE_TYPE (user_seq->cand->fn));
3718 /* Replace the identity conversion with the user conversion
3719 sequence. */
3720 *t = user_seq;
3722 return std_seq;
3725 /* Handle overload resolution for initializing an object of class type from
3726 an initializer list. First we look for a suitable constructor that
3727 takes a std::initializer_list; if we don't find one, we then look for a
3728 non-list constructor.
3730 Parameters are as for add_candidates, except that the arguments are in
3731 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3732 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3734 static void
3735 add_list_candidates (tree fns, tree first_arg,
3736 const vec<tree, va_gc> *args, tree totype,
3737 tree explicit_targs, bool template_only,
3738 tree conversion_path, tree access_path,
3739 int flags,
3740 struct z_candidate **candidates,
3741 tsubst_flags_t complain)
3743 gcc_assert (*candidates == NULL);
3745 /* We're looking for a ctor for list-initialization. */
3746 flags |= LOOKUP_LIST_INIT_CTOR;
3747 /* And we don't allow narrowing conversions. We also use this flag to
3748 avoid the copy constructor call for copy-list-initialization. */
3749 flags |= LOOKUP_NO_NARROWING;
3751 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3752 tree init_list = (*args)[nart];
3754 /* Always use the default constructor if the list is empty (DR 990). */
3755 if (CONSTRUCTOR_NELTS (init_list) == 0
3756 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3758 /* If the class has a list ctor, try passing the list as a single
3759 argument first, but only consider list ctors. */
3760 else if (TYPE_HAS_LIST_CTOR (totype))
3762 flags |= LOOKUP_LIST_ONLY;
3763 add_candidates (fns, first_arg, args, NULL_TREE,
3764 explicit_targs, template_only, conversion_path,
3765 access_path, flags, candidates, complain);
3766 if (any_strictly_viable (*candidates))
3767 return;
3770 /* Expand the CONSTRUCTOR into a new argument vec. */
3771 vec<tree, va_gc> *new_args;
3772 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3773 for (unsigned i = 0; i < nart; ++i)
3774 new_args->quick_push ((*args)[i]);
3775 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3776 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3778 /* We aren't looking for list-ctors anymore. */
3779 flags &= ~LOOKUP_LIST_ONLY;
3780 /* We allow more user-defined conversions within an init-list. */
3781 flags &= ~LOOKUP_NO_CONVERSION;
3783 add_candidates (fns, first_arg, new_args, NULL_TREE,
3784 explicit_targs, template_only, conversion_path,
3785 access_path, flags, candidates, complain);
3788 /* Returns the best overload candidate to perform the requested
3789 conversion. This function is used for three the overloading situations
3790 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3791 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3792 per [dcl.init.ref], so we ignore temporary bindings. */
3794 static struct z_candidate *
3795 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3796 tsubst_flags_t complain)
3798 struct z_candidate *candidates, *cand;
3799 tree fromtype;
3800 tree ctors = NULL_TREE;
3801 tree conv_fns = NULL_TREE;
3802 conversion *conv = NULL;
3803 tree first_arg = NULL_TREE;
3804 vec<tree, va_gc> *args = NULL;
3805 bool any_viable_p;
3806 int convflags;
3808 if (!expr)
3809 return NULL;
3811 fromtype = TREE_TYPE (expr);
3813 /* We represent conversion within a hierarchy using RVALUE_CONV and
3814 BASE_CONV, as specified by [over.best.ics]; these become plain
3815 constructor calls, as specified in [dcl.init]. */
3816 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3817 || !DERIVED_FROM_P (totype, fromtype));
3819 if (CLASS_TYPE_P (totype))
3820 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3821 creating a garbage BASELINK; constructors can't be inherited. */
3822 ctors = get_class_binding (totype, complete_ctor_identifier);
3824 if (MAYBE_CLASS_TYPE_P (fromtype))
3826 tree to_nonref = non_reference (totype);
3827 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3828 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3829 && DERIVED_FROM_P (to_nonref, fromtype)))
3831 /* [class.conv.fct] A conversion function is never used to
3832 convert a (possibly cv-qualified) object to the (possibly
3833 cv-qualified) same object type (or a reference to it), to a
3834 (possibly cv-qualified) base class of that type (or a
3835 reference to it)... */
3837 else
3838 conv_fns = lookup_conversions (fromtype);
3841 candidates = 0;
3842 flags |= LOOKUP_NO_CONVERSION;
3843 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3844 flags |= LOOKUP_NO_NARROWING;
3846 /* It's OK to bind a temporary for converting constructor arguments, but
3847 not in converting the return value of a conversion operator. */
3848 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3849 | (flags & LOOKUP_NO_NARROWING));
3850 flags &= ~LOOKUP_NO_TEMP_BIND;
3852 if (ctors)
3854 int ctorflags = flags;
3856 first_arg = build_dummy_object (totype);
3858 /* We should never try to call the abstract or base constructor
3859 from here. */
3860 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3861 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3863 args = make_tree_vector_single (expr);
3864 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3866 /* List-initialization. */
3867 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3868 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3869 ctorflags, &candidates, complain);
3871 else
3873 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3874 TYPE_BINFO (totype), TYPE_BINFO (totype),
3875 ctorflags, &candidates, complain);
3878 for (cand = candidates; cand; cand = cand->next)
3880 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3882 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3883 set, then this is copy-initialization. In that case, "The
3884 result of the call is then used to direct-initialize the
3885 object that is the destination of the copy-initialization."
3886 [dcl.init]
3888 We represent this in the conversion sequence with an
3889 rvalue conversion, which means a constructor call. */
3890 if (!TYPE_REF_P (totype)
3891 && !(convflags & LOOKUP_NO_TEMP_BIND))
3892 cand->second_conv
3893 = build_conv (ck_rvalue, totype, cand->second_conv);
3897 if (conv_fns)
3899 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3900 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3901 else
3902 first_arg = expr;
3905 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3907 tree conversion_path = TREE_PURPOSE (conv_fns);
3908 struct z_candidate *old_candidates;
3910 /* If we are called to convert to a reference type, we are trying to
3911 find a direct binding, so don't even consider temporaries. If
3912 we don't find a direct binding, the caller will try again to
3913 look for a temporary binding. */
3914 if (TYPE_REF_P (totype))
3915 convflags |= LOOKUP_NO_TEMP_BIND;
3917 old_candidates = candidates;
3918 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3919 NULL_TREE, false,
3920 conversion_path, TYPE_BINFO (fromtype),
3921 flags, &candidates, complain);
3923 for (cand = candidates; cand != old_candidates; cand = cand->next)
3925 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3926 conversion *ics
3927 = implicit_conversion (totype,
3928 rettype,
3930 /*c_cast_p=*/false, convflags,
3931 complain);
3933 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3934 copy-initialization. In that case, "The result of the
3935 call is then used to direct-initialize the object that is
3936 the destination of the copy-initialization." [dcl.init]
3938 We represent this in the conversion sequence with an
3939 rvalue conversion, which means a constructor call. But
3940 don't add a second rvalue conversion if there's already
3941 one there. Which there really shouldn't be, but it's
3942 harmless since we'd add it here anyway. */
3943 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3944 && !(convflags & LOOKUP_NO_TEMP_BIND))
3945 ics = build_conv (ck_rvalue, totype, ics);
3947 cand->second_conv = ics;
3949 if (!ics)
3951 cand->viable = 0;
3952 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3953 rettype, totype,
3954 EXPR_LOCATION (expr));
3956 else if (DECL_NONCONVERTING_P (cand->fn)
3957 && ics->rank > cr_exact)
3959 /* 13.3.1.5: For direct-initialization, those explicit
3960 conversion functions that are not hidden within S and
3961 yield type T or a type that can be converted to type T
3962 with a qualification conversion (4.4) are also candidate
3963 functions. */
3964 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3965 I've raised this issue with the committee. --jason 9/2011 */
3966 cand->viable = -1;
3967 cand->reason = explicit_conversion_rejection (rettype, totype);
3969 else if (cand->viable == 1 && ics->bad_p)
3971 cand->viable = -1;
3972 cand->reason
3973 = bad_arg_conversion_rejection (NULL_TREE, -2,
3974 rettype, totype,
3975 EXPR_LOCATION (expr));
3977 else if (primary_template_specialization_p (cand->fn)
3978 && ics->rank > cr_exact)
3980 /* 13.3.3.1.2: If the user-defined conversion is specified by
3981 a specialization of a conversion function template, the
3982 second standard conversion sequence shall have exact match
3983 rank. */
3984 cand->viable = -1;
3985 cand->reason = template_conversion_rejection (rettype, totype);
3990 candidates = splice_viable (candidates, false, &any_viable_p);
3991 if (!any_viable_p)
3993 if (args)
3994 release_tree_vector (args);
3995 return NULL;
3998 cand = tourney (candidates, complain);
3999 if (cand == NULL)
4001 if (complain & tf_error)
4003 auto_diagnostic_group d;
4004 error ("conversion from %qH to %qI is ambiguous",
4005 fromtype, totype);
4006 print_z_candidates (location_of (expr), candidates);
4009 cand = candidates; /* any one will do */
4010 cand->second_conv = build_ambiguous_conv (totype, expr);
4011 cand->second_conv->user_conv_p = true;
4012 if (!any_strictly_viable (candidates))
4013 cand->second_conv->bad_p = true;
4014 if (flags & LOOKUP_ONLYCONVERTING)
4015 cand->second_conv->need_temporary_p = true;
4016 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4017 ambiguous conversion is no worse than another user-defined
4018 conversion. */
4020 return cand;
4023 tree convtype;
4024 if (!DECL_CONSTRUCTOR_P (cand->fn))
4025 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
4026 else if (cand->second_conv->kind == ck_rvalue)
4027 /* DR 5: [in the first step of copy-initialization]...if the function
4028 is a constructor, the call initializes a temporary of the
4029 cv-unqualified version of the destination type. */
4030 convtype = cv_unqualified (totype);
4031 else
4032 convtype = totype;
4033 /* Build the user conversion sequence. */
4034 conv = build_conv
4035 (ck_user,
4036 convtype,
4037 build_identity_conv (TREE_TYPE (expr), expr));
4038 conv->cand = cand;
4039 if (cand->viable == -1)
4040 conv->bad_p = true;
4042 /* We're performing the maybe-rvalue overload resolution and
4043 a conversion function is in play. Reject converting the return
4044 value of the conversion function to a base class. */
4045 if ((flags & LOOKUP_PREFER_RVALUE) && !DECL_CONSTRUCTOR_P (cand->fn))
4046 for (conversion *t = cand->second_conv; t; t = next_conversion (t))
4047 if (t->kind == ck_base)
4048 return NULL;
4050 /* Remember that this was a list-initialization. */
4051 if (flags & LOOKUP_NO_NARROWING)
4052 conv->check_narrowing = true;
4054 /* Combine it with the second conversion sequence. */
4055 cand->second_conv = merge_conversion_sequences (conv,
4056 cand->second_conv);
4058 return cand;
4061 /* Wrapper for above. */
4063 tree
4064 build_user_type_conversion (tree totype, tree expr, int flags,
4065 tsubst_flags_t complain)
4067 struct z_candidate *cand;
4068 tree ret;
4070 bool subtime = timevar_cond_start (TV_OVERLOAD);
4071 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
4073 if (cand)
4075 if (cand->second_conv->kind == ck_ambig)
4076 ret = error_mark_node;
4077 else
4079 expr = convert_like (cand->second_conv, expr, complain);
4080 ret = convert_from_reference (expr);
4083 else
4084 ret = NULL_TREE;
4086 timevar_cond_stop (TV_OVERLOAD, subtime);
4087 return ret;
4090 /* Subroutine of convert_nontype_argument.
4092 EXPR is an expression used in a context that requires a converted
4093 constant-expression, such as a template non-type parameter. Do any
4094 necessary conversions (that are permitted for converted
4095 constant-expressions) to convert it to the desired type.
4097 If conversion is successful, returns the converted expression;
4098 otherwise, returns error_mark_node. */
4100 tree
4101 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4103 conversion *conv;
4104 void *p;
4105 tree t;
4106 location_t loc = cp_expr_loc_or_loc (expr, input_location);
4108 if (error_operand_p (expr))
4109 return error_mark_node;
4111 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4112 p = conversion_obstack_alloc (0);
4114 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4115 /*c_cast_p=*/false,
4116 LOOKUP_IMPLICIT, complain);
4118 /* A converted constant expression of type T is an expression, implicitly
4119 converted to type T, where the converted expression is a constant
4120 expression and the implicit conversion sequence contains only
4122 * user-defined conversions,
4123 * lvalue-to-rvalue conversions (7.1),
4124 * array-to-pointer conversions (7.2),
4125 * function-to-pointer conversions (7.3),
4126 * qualification conversions (7.5),
4127 * integral promotions (7.6),
4128 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4129 * null pointer conversions (7.11) from std::nullptr_t,
4130 * null member pointer conversions (7.12) from std::nullptr_t, and
4131 * function pointer conversions (7.13),
4133 and where the reference binding (if any) binds directly. */
4135 for (conversion *c = conv;
4136 conv && c->kind != ck_identity;
4137 c = next_conversion (c))
4139 switch (c->kind)
4141 /* A conversion function is OK. If it isn't constexpr, we'll
4142 complain later that the argument isn't constant. */
4143 case ck_user:
4144 /* The lvalue-to-rvalue conversion is OK. */
4145 case ck_rvalue:
4146 /* Array-to-pointer and function-to-pointer. */
4147 case ck_lvalue:
4148 /* Function pointer conversions. */
4149 case ck_fnptr:
4150 /* Qualification conversions. */
4151 case ck_qual:
4152 break;
4154 case ck_ref_bind:
4155 if (c->need_temporary_p)
4157 if (complain & tf_error)
4158 error_at (loc, "initializing %qH with %qI in converted "
4159 "constant expression does not bind directly",
4160 type, next_conversion (c)->type);
4161 conv = NULL;
4163 break;
4165 case ck_base:
4166 case ck_pmem:
4167 case ck_ptr:
4168 case ck_std:
4169 t = next_conversion (c)->type;
4170 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4171 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4172 /* Integral promotion or conversion. */
4173 break;
4174 if (NULLPTR_TYPE_P (t))
4175 /* Conversion from nullptr to pointer or pointer-to-member. */
4176 break;
4178 if (complain & tf_error)
4179 error_at (loc, "conversion from %qH to %qI in a "
4180 "converted constant expression", t, type);
4181 /* fall through. */
4183 default:
4184 conv = NULL;
4185 break;
4189 /* Avoid confusing convert_nontype_argument by introducing
4190 a redundant conversion to the same reference type. */
4191 if (conv && conv->kind == ck_ref_bind
4192 && REFERENCE_REF_P (expr))
4194 tree ref = TREE_OPERAND (expr, 0);
4195 if (same_type_p (type, TREE_TYPE (ref)))
4196 return ref;
4199 if (conv)
4201 conv->check_narrowing = true;
4202 conv->check_narrowing_const_only = true;
4203 expr = convert_like (conv, expr, complain);
4205 else
4207 if (complain & tf_error)
4208 error_at (loc, "could not convert %qE from %qH to %qI", expr,
4209 TREE_TYPE (expr), type);
4210 expr = error_mark_node;
4213 /* Free all the conversions we allocated. */
4214 obstack_free (&conversion_obstack, p);
4216 return expr;
4219 /* Do any initial processing on the arguments to a function call. */
4221 static vec<tree, va_gc> *
4222 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4224 unsigned int ix;
4225 tree arg;
4227 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4229 if (error_operand_p (arg))
4230 return NULL;
4231 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4233 if (complain & tf_error)
4234 error ("invalid use of void expression");
4235 return NULL;
4237 else if (invalid_nonstatic_memfn_p (arg->exp.locus, arg, complain))
4238 return NULL;
4240 return args;
4243 /* Perform overload resolution on FN, which is called with the ARGS.
4245 Return the candidate function selected by overload resolution, or
4246 NULL if the event that overload resolution failed. In the case
4247 that overload resolution fails, *CANDIDATES will be the set of
4248 candidates considered, and ANY_VIABLE_P will be set to true or
4249 false to indicate whether or not any of the candidates were
4250 viable.
4252 The ARGS should already have gone through RESOLVE_ARGS before this
4253 function is called. */
4255 static struct z_candidate *
4256 perform_overload_resolution (tree fn,
4257 const vec<tree, va_gc> *args,
4258 struct z_candidate **candidates,
4259 bool *any_viable_p, tsubst_flags_t complain)
4261 struct z_candidate *cand;
4262 tree explicit_targs;
4263 int template_only;
4265 bool subtime = timevar_cond_start (TV_OVERLOAD);
4267 explicit_targs = NULL_TREE;
4268 template_only = 0;
4270 *candidates = NULL;
4271 *any_viable_p = true;
4273 /* Check FN. */
4274 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4275 || TREE_CODE (fn) == TEMPLATE_DECL
4276 || TREE_CODE (fn) == OVERLOAD
4277 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4279 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4281 explicit_targs = TREE_OPERAND (fn, 1);
4282 fn = TREE_OPERAND (fn, 0);
4283 template_only = 1;
4286 /* Add the various candidate functions. */
4287 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4288 explicit_targs, template_only,
4289 /*conversion_path=*/NULL_TREE,
4290 /*access_path=*/NULL_TREE,
4291 LOOKUP_NORMAL,
4292 candidates, complain);
4294 *candidates = splice_viable (*candidates, false, any_viable_p);
4295 if (*any_viable_p)
4296 cand = tourney (*candidates, complain);
4297 else
4298 cand = NULL;
4300 timevar_cond_stop (TV_OVERLOAD, subtime);
4301 return cand;
4304 /* Print an error message about being unable to build a call to FN with
4305 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4306 be located; CANDIDATES is a possibly empty list of such
4307 functions. */
4309 static void
4310 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4311 struct z_candidate *candidates)
4313 tree targs = NULL_TREE;
4314 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4316 targs = TREE_OPERAND (fn, 1);
4317 fn = TREE_OPERAND (fn, 0);
4319 tree name = OVL_NAME (fn);
4320 location_t loc = location_of (name);
4321 if (targs)
4322 name = lookup_template_function (name, targs);
4324 auto_diagnostic_group d;
4325 if (!any_strictly_viable (candidates))
4326 error_at (loc, "no matching function for call to %<%D(%A)%>",
4327 name, build_tree_list_vec (args));
4328 else
4329 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4330 name, build_tree_list_vec (args));
4331 if (candidates)
4332 print_z_candidates (loc, candidates);
4335 /* Return an expression for a call to FN (a namespace-scope function,
4336 or a static member function) with the ARGS. This may change
4337 ARGS. */
4339 tree
4340 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4341 tsubst_flags_t complain)
4343 struct z_candidate *candidates, *cand;
4344 bool any_viable_p;
4345 void *p;
4346 tree result;
4348 if (args != NULL && *args != NULL)
4350 *args = resolve_args (*args, complain);
4351 if (*args == NULL)
4352 return error_mark_node;
4355 if (flag_tm)
4356 tm_malloc_replacement (fn);
4358 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4359 p = conversion_obstack_alloc (0);
4361 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4362 complain);
4364 if (!cand)
4366 if (complain & tf_error)
4368 // If there is a single (non-viable) function candidate,
4369 // let the error be diagnosed by cp_build_function_call_vec.
4370 if (!any_viable_p && candidates && ! candidates->next
4371 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4372 return cp_build_function_call_vec (candidates->fn, args, complain);
4374 // Otherwise, emit notes for non-viable candidates.
4375 print_error_for_call_failure (fn, *args, candidates);
4377 result = error_mark_node;
4379 else
4381 int flags = LOOKUP_NORMAL;
4382 /* If fn is template_id_expr, the call has explicit template arguments
4383 (e.g. func<int>(5)), communicate this info to build_over_call
4384 through flags so that later we can use it to decide whether to warn
4385 about peculiar null pointer conversion. */
4386 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4388 /* If overload resolution selects a specialization of a
4389 function concept for non-dependent template arguments,
4390 the expression is true if the constraints are satisfied
4391 and false otherwise.
4393 NOTE: This is an extension of Concepts Lite TS that
4394 allows constraints to be used in expressions. */
4395 if (flag_concepts && !processing_template_decl)
4397 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4398 tree targs = DECL_TI_ARGS (cand->fn);
4399 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4400 if (DECL_DECLARED_CONCEPT_P (decl))
4401 return evaluate_function_concept (decl, targs);
4404 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4407 result = build_over_call (cand, flags, complain);
4410 /* Free all the conversions we allocated. */
4411 obstack_free (&conversion_obstack, p);
4413 return result;
4416 /* Build a call to a global operator new. FNNAME is the name of the
4417 operator (either "operator new" or "operator new[]") and ARGS are
4418 the arguments provided. This may change ARGS. *SIZE points to the
4419 total number of bytes required by the allocation, and is updated if
4420 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4421 be used. If this function determines that no cookie should be
4422 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4423 is not NULL_TREE, it is evaluated before calculating the final
4424 array size, and if it fails, the array size is replaced with
4425 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4426 is non-NULL, it will be set, upon return, to the allocation
4427 function called. */
4429 tree
4430 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4431 tree *size, tree *cookie_size,
4432 tree align_arg, tree size_check,
4433 tree *fn, tsubst_flags_t complain)
4435 tree original_size = *size;
4436 tree fns;
4437 struct z_candidate *candidates;
4438 struct z_candidate *cand = NULL;
4439 bool any_viable_p;
4441 if (fn)
4442 *fn = NULL_TREE;
4443 /* Set to (size_t)-1 if the size check fails. */
4444 if (size_check != NULL_TREE)
4446 tree errval = TYPE_MAX_VALUE (sizetype);
4447 if (cxx_dialect >= cxx11 && flag_exceptions)
4448 errval = throw_bad_array_new_length ();
4449 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4450 original_size, errval);
4452 vec_safe_insert (*args, 0, *size);
4453 *args = resolve_args (*args, complain);
4454 if (*args == NULL)
4455 return error_mark_node;
4457 /* Based on:
4459 [expr.new]
4461 If this lookup fails to find the name, or if the allocated type
4462 is not a class type, the allocation function's name is looked
4463 up in the global scope.
4465 we disregard block-scope declarations of "operator new". */
4466 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4467 fns = lookup_arg_dependent (fnname, fns, *args);
4469 if (align_arg)
4471 vec<tree, va_gc>* align_args
4472 = vec_copy_and_insert (*args, align_arg, 1);
4473 cand = perform_overload_resolution (fns, align_args, &candidates,
4474 &any_viable_p, tf_none);
4475 if (cand)
4476 *args = align_args;
4477 /* If no aligned allocation function matches, try again without the
4478 alignment. */
4481 /* Figure out what function is being called. */
4482 if (!cand)
4483 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4484 complain);
4486 /* If no suitable function could be found, issue an error message
4487 and give up. */
4488 if (!cand)
4490 if (complain & tf_error)
4491 print_error_for_call_failure (fns, *args, candidates);
4492 return error_mark_node;
4495 /* If a cookie is required, add some extra space. Whether
4496 or not a cookie is required cannot be determined until
4497 after we know which function was called. */
4498 if (*cookie_size)
4500 bool use_cookie = true;
4501 tree arg_types;
4503 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4504 /* Skip the size_t parameter. */
4505 arg_types = TREE_CHAIN (arg_types);
4506 /* Check the remaining parameters (if any). */
4507 if (arg_types
4508 && TREE_CHAIN (arg_types) == void_list_node
4509 && same_type_p (TREE_VALUE (arg_types),
4510 ptr_type_node))
4511 use_cookie = false;
4512 /* If we need a cookie, adjust the number of bytes allocated. */
4513 if (use_cookie)
4515 /* Update the total size. */
4516 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4517 if (size_check)
4519 /* Set to (size_t)-1 if the size check fails. */
4520 gcc_assert (size_check != NULL_TREE);
4521 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4522 *size, TYPE_MAX_VALUE (sizetype));
4524 /* Update the argument list to reflect the adjusted size. */
4525 (**args)[0] = *size;
4527 else
4528 *cookie_size = NULL_TREE;
4531 /* Tell our caller which function we decided to call. */
4532 if (fn)
4533 *fn = cand->fn;
4535 /* Build the CALL_EXPR. */
4536 return build_over_call (cand, LOOKUP_NORMAL, complain);
4539 /* Build a new call to operator(). This may change ARGS. */
4541 static tree
4542 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4544 struct z_candidate *candidates = 0, *cand;
4545 tree fns, convs, first_mem_arg = NULL_TREE;
4546 bool any_viable_p;
4547 tree result = NULL_TREE;
4548 void *p;
4550 obj = mark_lvalue_use (obj);
4552 if (error_operand_p (obj))
4553 return error_mark_node;
4555 tree type = TREE_TYPE (obj);
4557 obj = prep_operand (obj);
4559 if (TYPE_PTRMEMFUNC_P (type))
4561 if (complain & tf_error)
4562 /* It's no good looking for an overloaded operator() on a
4563 pointer-to-member-function. */
4564 error ("pointer-to-member function %qE cannot be called without "
4565 "an object; consider using %<.*%> or %<->*%>", obj);
4566 return error_mark_node;
4569 if (TYPE_BINFO (type))
4571 fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1);
4572 if (fns == error_mark_node)
4573 return error_mark_node;
4575 else
4576 fns = NULL_TREE;
4578 if (args != NULL && *args != NULL)
4580 *args = resolve_args (*args, complain);
4581 if (*args == NULL)
4582 return error_mark_node;
4585 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4586 p = conversion_obstack_alloc (0);
4588 if (fns)
4590 first_mem_arg = obj;
4592 add_candidates (BASELINK_FUNCTIONS (fns),
4593 first_mem_arg, *args, NULL_TREE,
4594 NULL_TREE, false,
4595 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4596 LOOKUP_NORMAL, &candidates, complain);
4599 convs = lookup_conversions (type);
4601 for (; convs; convs = TREE_CHAIN (convs))
4603 tree totype = TREE_TYPE (convs);
4605 if (TYPE_PTRFN_P (totype)
4606 || TYPE_REFFN_P (totype)
4607 || (TYPE_REF_P (totype)
4608 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4609 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4611 tree fn = *iter;
4613 if (DECL_NONCONVERTING_P (fn))
4614 continue;
4616 if (TREE_CODE (fn) == TEMPLATE_DECL)
4617 add_template_conv_candidate
4618 (&candidates, fn, obj, *args, totype,
4619 /*access_path=*/NULL_TREE,
4620 /*conversion_path=*/NULL_TREE, complain);
4621 else
4622 add_conv_candidate (&candidates, fn, obj,
4623 *args, /*conversion_path=*/NULL_TREE,
4624 /*access_path=*/NULL_TREE, complain);
4628 /* Be strict here because if we choose a bad conversion candidate, the
4629 errors we get won't mention the call context. */
4630 candidates = splice_viable (candidates, true, &any_viable_p);
4631 if (!any_viable_p)
4633 if (complain & tf_error)
4635 auto_diagnostic_group d;
4636 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4637 build_tree_list_vec (*args));
4638 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4640 result = error_mark_node;
4642 else
4644 cand = tourney (candidates, complain);
4645 if (cand == 0)
4647 if (complain & tf_error)
4649 auto_diagnostic_group d;
4650 error ("call of %<(%T) (%A)%> is ambiguous",
4651 TREE_TYPE (obj), build_tree_list_vec (*args));
4652 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4654 result = error_mark_node;
4656 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4657 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
4658 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR))
4659 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4660 else
4662 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4663 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4664 -1, complain);
4665 else
4667 gcc_checking_assert (TYPE_P (cand->fn));
4668 obj = convert_like (cand->convs[0], obj, complain);
4670 obj = convert_from_reference (obj);
4671 result = cp_build_function_call_vec (obj, args, complain);
4675 /* Free all the conversions we allocated. */
4676 obstack_free (&conversion_obstack, p);
4678 return result;
4681 /* Wrapper for above. */
4683 tree
4684 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4686 tree ret;
4687 bool subtime = timevar_cond_start (TV_OVERLOAD);
4688 ret = build_op_call_1 (obj, args, complain);
4689 timevar_cond_stop (TV_OVERLOAD, subtime);
4690 return ret;
4693 /* Called by op_error to prepare format strings suitable for the error
4694 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4695 and a suffix (controlled by NTYPES). */
4697 static const char *
4698 op_error_string (const char *errmsg, int ntypes, bool match)
4700 const char *msg;
4702 const char *msgp = concat (match ? G_("ambiguous overload for ")
4703 : G_("no match for "), errmsg, NULL);
4705 if (ntypes == 3)
4706 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4707 else if (ntypes == 2)
4708 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4709 else
4710 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4712 return msg;
4715 static void
4716 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4717 tree arg1, tree arg2, tree arg3, bool match)
4719 bool assop = code == MODIFY_EXPR;
4720 const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name;
4722 switch (code)
4724 case COND_EXPR:
4725 if (flag_diagnostics_show_caret)
4726 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4727 3, match),
4728 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4729 else
4730 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4731 "in %<%E ? %E : %E%>"), 3, match),
4732 arg1, arg2, arg3,
4733 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4734 break;
4736 case POSTINCREMENT_EXPR:
4737 case POSTDECREMENT_EXPR:
4738 if (flag_diagnostics_show_caret)
4739 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4740 opname, TREE_TYPE (arg1));
4741 else
4742 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4743 1, match),
4744 opname, arg1, opname, TREE_TYPE (arg1));
4745 break;
4747 case ARRAY_REF:
4748 if (flag_diagnostics_show_caret)
4749 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4750 TREE_TYPE (arg1), TREE_TYPE (arg2));
4751 else
4752 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4753 2, match),
4754 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4755 break;
4757 case REALPART_EXPR:
4758 case IMAGPART_EXPR:
4759 if (flag_diagnostics_show_caret)
4760 error_at (loc, op_error_string (G_("%qs"), 1, match),
4761 opname, TREE_TYPE (arg1));
4762 else
4763 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4764 opname, opname, arg1, TREE_TYPE (arg1));
4765 break;
4767 default:
4768 if (arg2)
4769 if (flag_diagnostics_show_caret)
4770 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4771 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4772 else
4773 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4774 2, match),
4775 opname, arg1, opname, arg2,
4776 TREE_TYPE (arg1), TREE_TYPE (arg2));
4777 else
4778 if (flag_diagnostics_show_caret)
4779 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4780 opname, TREE_TYPE (arg1));
4781 else
4782 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4783 1, match),
4784 opname, opname, arg1, TREE_TYPE (arg1));
4785 break;
4789 /* Return the implicit conversion sequence that could be used to
4790 convert E1 to E2 in [expr.cond]. */
4792 static conversion *
4793 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4795 tree t1 = non_reference (TREE_TYPE (e1));
4796 tree t2 = non_reference (TREE_TYPE (e2));
4797 conversion *conv;
4798 bool good_base;
4800 /* [expr.cond]
4802 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4803 implicitly converted (clause _conv_) to the type "lvalue reference to
4804 T2", subject to the constraint that in the conversion the
4805 reference must bind directly (_dcl.init.ref_) to an lvalue.
4807 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4808 implicitly converted to the type "rvalue reference to T2", subject to
4809 the constraint that the reference must bind directly. */
4810 if (glvalue_p (e2))
4812 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4813 conv = implicit_conversion (rtype,
4816 /*c_cast_p=*/false,
4817 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4818 |LOOKUP_ONLYCONVERTING,
4819 complain);
4820 if (conv && !conv->bad_p)
4821 return conv;
4824 /* If E2 is a prvalue or if neither of the conversions above can be done
4825 and at least one of the operands has (possibly cv-qualified) class
4826 type: */
4827 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4828 return NULL;
4830 /* [expr.cond]
4832 If E1 and E2 have class type, and the underlying class types are
4833 the same or one is a base class of the other: E1 can be converted
4834 to match E2 if the class of T2 is the same type as, or a base
4835 class of, the class of T1, and the cv-qualification of T2 is the
4836 same cv-qualification as, or a greater cv-qualification than, the
4837 cv-qualification of T1. If the conversion is applied, E1 is
4838 changed to an rvalue of type T2 that still refers to the original
4839 source class object (or the appropriate subobject thereof). */
4840 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4841 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4843 if (good_base && at_least_as_qualified_p (t2, t1))
4845 conv = build_identity_conv (t1, e1);
4846 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4847 TYPE_MAIN_VARIANT (t2)))
4848 conv = build_conv (ck_base, t2, conv);
4849 else
4850 conv = build_conv (ck_rvalue, t2, conv);
4851 return conv;
4853 else
4854 return NULL;
4856 else
4857 /* [expr.cond]
4859 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4860 converted to the type that expression E2 would have if E2 were
4861 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4862 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4863 LOOKUP_IMPLICIT, complain);
4866 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4867 arguments to the conditional expression. */
4869 static tree
4870 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4871 tsubst_flags_t complain)
4873 tree arg2_type;
4874 tree arg3_type;
4875 tree result = NULL_TREE;
4876 tree result_type = NULL_TREE;
4877 bool is_glvalue = true;
4878 struct z_candidate *candidates = 0;
4879 struct z_candidate *cand;
4880 void *p;
4881 tree orig_arg2, orig_arg3;
4883 /* As a G++ extension, the second argument to the conditional can be
4884 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4885 c'.) If the second operand is omitted, make sure it is
4886 calculated only once. */
4887 if (!arg2)
4889 if (complain & tf_error)
4890 pedwarn (loc, OPT_Wpedantic,
4891 "ISO C++ forbids omitting the middle term of a ?: expression");
4893 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4894 warn_for_omitted_condop (loc, arg1);
4896 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4897 if (lvalue_p (arg1))
4898 arg2 = arg1 = cp_stabilize_reference (arg1);
4899 else
4900 arg2 = arg1 = cp_save_expr (arg1);
4903 /* If something has already gone wrong, just pass that fact up the
4904 tree. */
4905 if (error_operand_p (arg1)
4906 || error_operand_p (arg2)
4907 || error_operand_p (arg3))
4908 return error_mark_node;
4910 orig_arg2 = arg2;
4911 orig_arg3 = arg3;
4913 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4915 tree arg1_type = TREE_TYPE (arg1);
4917 /* If arg1 is another cond_expr choosing between -1 and 0,
4918 then we can use its comparison. It may help to avoid
4919 additional comparison, produce more accurate diagnostics
4920 and enables folding. */
4921 if (TREE_CODE (arg1) == VEC_COND_EXPR
4922 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4923 && integer_zerop (TREE_OPERAND (arg1, 2)))
4924 arg1 = TREE_OPERAND (arg1, 0);
4926 arg1 = force_rvalue (arg1, complain);
4927 arg2 = force_rvalue (arg2, complain);
4928 arg3 = force_rvalue (arg3, complain);
4930 /* force_rvalue can return error_mark on valid arguments. */
4931 if (error_operand_p (arg1)
4932 || error_operand_p (arg2)
4933 || error_operand_p (arg3))
4934 return error_mark_node;
4936 arg2_type = TREE_TYPE (arg2);
4937 arg3_type = TREE_TYPE (arg3);
4939 if (!VECTOR_TYPE_P (arg2_type)
4940 && !VECTOR_TYPE_P (arg3_type))
4942 /* Rely on the error messages of the scalar version. */
4943 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4944 orig_arg2, orig_arg3, complain);
4945 if (scal == error_mark_node)
4946 return error_mark_node;
4947 tree stype = TREE_TYPE (scal);
4948 tree ctype = TREE_TYPE (arg1_type);
4949 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4950 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4952 if (complain & tf_error)
4953 error_at (loc, "inferred scalar type %qT is not an integer or "
4954 "floating point type of the same size as %qT", stype,
4955 COMPARISON_CLASS_P (arg1)
4956 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4957 : ctype);
4958 return error_mark_node;
4961 tree vtype = build_opaque_vector_type (stype,
4962 TYPE_VECTOR_SUBPARTS (arg1_type));
4963 /* We could pass complain & tf_warning to unsafe_conversion_p,
4964 but the warnings (like Wsign-conversion) have already been
4965 given by the scalar build_conditional_expr_1. We still check
4966 unsafe_conversion_p to forbid truncating long long -> float. */
4967 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4969 if (complain & tf_error)
4970 error_at (loc, "conversion of scalar %qH to vector %qI "
4971 "involves truncation", arg2_type, vtype);
4972 return error_mark_node;
4974 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4976 if (complain & tf_error)
4977 error_at (loc, "conversion of scalar %qH to vector %qI "
4978 "involves truncation", arg3_type, vtype);
4979 return error_mark_node;
4982 arg2 = cp_convert (stype, arg2, complain);
4983 arg2 = save_expr (arg2);
4984 arg2 = build_vector_from_val (vtype, arg2);
4985 arg2_type = vtype;
4986 arg3 = cp_convert (stype, arg3, complain);
4987 arg3 = save_expr (arg3);
4988 arg3 = build_vector_from_val (vtype, arg3);
4989 arg3_type = vtype;
4992 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4994 enum stv_conv convert_flag =
4995 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4996 complain & tf_error);
4998 switch (convert_flag)
5000 case stv_error:
5001 return error_mark_node;
5002 case stv_firstarg:
5004 arg2 = save_expr (arg2);
5005 arg2 = convert (TREE_TYPE (arg3_type), arg2);
5006 arg2 = build_vector_from_val (arg3_type, arg2);
5007 arg2_type = TREE_TYPE (arg2);
5008 break;
5010 case stv_secondarg:
5012 arg3 = save_expr (arg3);
5013 arg3 = convert (TREE_TYPE (arg2_type), arg3);
5014 arg3 = build_vector_from_val (arg2_type, arg3);
5015 arg3_type = TREE_TYPE (arg3);
5016 break;
5018 default:
5019 break;
5023 if (!same_type_p (arg2_type, arg3_type)
5024 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type),
5025 TYPE_VECTOR_SUBPARTS (arg2_type))
5026 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
5028 if (complain & tf_error)
5029 error_at (loc,
5030 "incompatible vector types in conditional expression: "
5031 "%qT, %qT and %qT", TREE_TYPE (arg1),
5032 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
5033 return error_mark_node;
5036 if (!COMPARISON_CLASS_P (arg1))
5038 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
5039 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
5041 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
5044 /* [expr.cond]
5046 The first expression is implicitly converted to bool (clause
5047 _conv_). */
5048 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
5049 LOOKUP_NORMAL);
5050 if (error_operand_p (arg1))
5051 return error_mark_node;
5053 /* [expr.cond]
5055 If either the second or the third operand has type (possibly
5056 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5057 array-to-pointer (_conv.array_), and function-to-pointer
5058 (_conv.func_) standard conversions are performed on the second
5059 and third operands. */
5060 arg2_type = unlowered_expr_type (arg2);
5061 arg3_type = unlowered_expr_type (arg3);
5062 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
5064 /* [expr.cond]
5066 One of the following shall hold:
5068 --The second or the third operand (but not both) is a
5069 throw-expression (_except.throw_); the result is of the type
5070 and value category of the other.
5072 --Both the second and the third operands have type void; the
5073 result is of type void and is a prvalue. */
5074 if (TREE_CODE (arg2) == THROW_EXPR
5075 && TREE_CODE (arg3) != THROW_EXPR)
5077 result_type = arg3_type;
5078 is_glvalue = glvalue_p (arg3);
5080 else if (TREE_CODE (arg2) != THROW_EXPR
5081 && TREE_CODE (arg3) == THROW_EXPR)
5083 result_type = arg2_type;
5084 is_glvalue = glvalue_p (arg2);
5086 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5088 result_type = void_type_node;
5089 is_glvalue = false;
5091 else
5093 if (complain & tf_error)
5095 if (VOID_TYPE_P (arg2_type))
5096 error_at (cp_expr_loc_or_loc (arg3, loc),
5097 "second operand to the conditional operator "
5098 "is of type %<void%>, but the third operand is "
5099 "neither a throw-expression nor of type %<void%>");
5100 else
5101 error_at (cp_expr_loc_or_loc (arg2, loc),
5102 "third operand to the conditional operator "
5103 "is of type %<void%>, but the second operand is "
5104 "neither a throw-expression nor of type %<void%>");
5106 return error_mark_node;
5109 goto valid_operands;
5111 /* [expr.cond]
5113 Otherwise, if the second and third operand have different types,
5114 and either has (possibly cv-qualified) class type, or if both are
5115 glvalues of the same value category and the same type except for
5116 cv-qualification, an attempt is made to convert each of those operands
5117 to the type of the other. */
5118 else if (!same_type_p (arg2_type, arg3_type)
5119 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5120 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5121 arg3_type)
5122 && glvalue_p (arg2) && glvalue_p (arg3)
5123 && lvalue_p (arg2) == lvalue_p (arg3))))
5125 conversion *conv2;
5126 conversion *conv3;
5127 bool converted = false;
5129 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5130 p = conversion_obstack_alloc (0);
5132 conv2 = conditional_conversion (arg2, arg3, complain);
5133 conv3 = conditional_conversion (arg3, arg2, complain);
5135 /* [expr.cond]
5137 If both can be converted, or one can be converted but the
5138 conversion is ambiguous, the program is ill-formed. If
5139 neither can be converted, the operands are left unchanged and
5140 further checking is performed as described below. If exactly
5141 one conversion is possible, that conversion is applied to the
5142 chosen operand and the converted operand is used in place of
5143 the original operand for the remainder of this section. */
5144 if ((conv2 && !conv2->bad_p
5145 && conv3 && !conv3->bad_p)
5146 || (conv2 && conv2->kind == ck_ambig)
5147 || (conv3 && conv3->kind == ck_ambig))
5149 if (complain & tf_error)
5151 error_at (loc, "operands to ?: have different types %qT and %qT",
5152 arg2_type, arg3_type);
5153 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5154 inform (loc, " and each type can be converted to the other");
5155 else if (conv2 && conv2->kind == ck_ambig)
5156 convert_like (conv2, arg2, complain);
5157 else
5158 convert_like (conv3, arg3, complain);
5160 result = error_mark_node;
5162 else if (conv2 && !conv2->bad_p)
5164 arg2 = convert_like (conv2, arg2, complain);
5165 arg2 = convert_from_reference (arg2);
5166 arg2_type = TREE_TYPE (arg2);
5167 /* Even if CONV2 is a valid conversion, the result of the
5168 conversion may be invalid. For example, if ARG3 has type
5169 "volatile X", and X does not have a copy constructor
5170 accepting a "volatile X&", then even if ARG2 can be
5171 converted to X, the conversion will fail. */
5172 if (error_operand_p (arg2))
5173 result = error_mark_node;
5174 converted = true;
5176 else if (conv3 && !conv3->bad_p)
5178 arg3 = convert_like (conv3, arg3, complain);
5179 arg3 = convert_from_reference (arg3);
5180 arg3_type = TREE_TYPE (arg3);
5181 if (error_operand_p (arg3))
5182 result = error_mark_node;
5183 converted = true;
5186 /* Free all the conversions we allocated. */
5187 obstack_free (&conversion_obstack, p);
5189 if (result)
5190 return result;
5192 /* If, after the conversion, both operands have class type,
5193 treat the cv-qualification of both operands as if it were the
5194 union of the cv-qualification of the operands.
5196 The standard is not clear about what to do in this
5197 circumstance. For example, if the first operand has type
5198 "const X" and the second operand has a user-defined
5199 conversion to "volatile X", what is the type of the second
5200 operand after this step? Making it be "const X" (matching
5201 the first operand) seems wrong, as that discards the
5202 qualification without actually performing a copy. Leaving it
5203 as "volatile X" seems wrong as that will result in the
5204 conditional expression failing altogether, even though,
5205 according to this step, the one operand could be converted to
5206 the type of the other. */
5207 if (converted
5208 && CLASS_TYPE_P (arg2_type)
5209 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5210 arg2_type = arg3_type =
5211 cp_build_qualified_type (arg2_type,
5212 cp_type_quals (arg2_type)
5213 | cp_type_quals (arg3_type));
5216 /* [expr.cond]
5218 If the second and third operands are glvalues of the same value
5219 category and have the same type, the result is of that type and
5220 value category. */
5221 if (((lvalue_p (arg2) && lvalue_p (arg3))
5222 || (xvalue_p (arg2) && xvalue_p (arg3)))
5223 && same_type_p (arg2_type, arg3_type))
5225 result_type = arg2_type;
5226 arg2 = mark_lvalue_use (arg2);
5227 arg3 = mark_lvalue_use (arg3);
5228 goto valid_operands;
5231 /* [expr.cond]
5233 Otherwise, the result is an rvalue. If the second and third
5234 operand do not have the same type, and either has (possibly
5235 cv-qualified) class type, overload resolution is used to
5236 determine the conversions (if any) to be applied to the operands
5237 (_over.match.oper_, _over.built_). */
5238 is_glvalue = false;
5239 if (!same_type_p (arg2_type, arg3_type)
5240 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5242 tree args[3];
5243 conversion *conv;
5244 bool any_viable_p;
5246 /* Rearrange the arguments so that add_builtin_candidate only has
5247 to know about two args. In build_builtin_candidate, the
5248 arguments are unscrambled. */
5249 args[0] = arg2;
5250 args[1] = arg3;
5251 args[2] = arg1;
5252 add_builtin_candidates (&candidates,
5253 COND_EXPR,
5254 NOP_EXPR,
5255 ovl_op_identifier (false, COND_EXPR),
5256 args,
5257 LOOKUP_NORMAL, complain);
5259 /* [expr.cond]
5261 If the overload resolution fails, the program is
5262 ill-formed. */
5263 candidates = splice_viable (candidates, false, &any_viable_p);
5264 if (!any_viable_p)
5266 if (complain & tf_error)
5267 error_at (loc, "operands to ?: have different types %qT and %qT",
5268 arg2_type, arg3_type);
5269 return error_mark_node;
5271 cand = tourney (candidates, complain);
5272 if (!cand)
5274 if (complain & tf_error)
5276 auto_diagnostic_group d;
5277 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5278 print_z_candidates (loc, candidates);
5280 return error_mark_node;
5283 /* [expr.cond]
5285 Otherwise, the conversions thus determined are applied, and
5286 the converted operands are used in place of the original
5287 operands for the remainder of this section. */
5288 conv = cand->convs[0];
5289 arg1 = convert_like (conv, arg1, complain);
5290 conv = cand->convs[1];
5291 arg2 = convert_like (conv, arg2, complain);
5292 arg2_type = TREE_TYPE (arg2);
5293 conv = cand->convs[2];
5294 arg3 = convert_like (conv, arg3, complain);
5295 arg3_type = TREE_TYPE (arg3);
5298 /* [expr.cond]
5300 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5301 and function-to-pointer (_conv.func_) standard conversions are
5302 performed on the second and third operands.
5304 We need to force the lvalue-to-rvalue conversion here for class types,
5305 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5306 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5307 regions. */
5309 arg2 = force_rvalue (arg2, complain);
5310 if (!CLASS_TYPE_P (arg2_type))
5311 arg2_type = TREE_TYPE (arg2);
5313 arg3 = force_rvalue (arg3, complain);
5314 if (!CLASS_TYPE_P (arg3_type))
5315 arg3_type = TREE_TYPE (arg3);
5317 if (arg2 == error_mark_node || arg3 == error_mark_node)
5318 return error_mark_node;
5320 /* [expr.cond]
5322 After those conversions, one of the following shall hold:
5324 --The second and third operands have the same type; the result is of
5325 that type. */
5326 if (same_type_p (arg2_type, arg3_type))
5327 result_type = arg2_type;
5328 /* [expr.cond]
5330 --The second and third operands have arithmetic or enumeration
5331 type; the usual arithmetic conversions are performed to bring
5332 them to a common type, and the result is of that type. */
5333 else if ((ARITHMETIC_TYPE_P (arg2_type)
5334 || UNSCOPED_ENUM_P (arg2_type))
5335 && (ARITHMETIC_TYPE_P (arg3_type)
5336 || UNSCOPED_ENUM_P (arg3_type)))
5338 /* In this case, there is always a common type. */
5339 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5340 arg3_type);
5341 if (complain & tf_warning)
5342 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5343 "implicit conversion from %qH to %qI to "
5344 "match other result of conditional",
5345 loc);
5347 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5348 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5350 if (TREE_CODE (orig_arg2) == CONST_DECL
5351 && TREE_CODE (orig_arg3) == CONST_DECL
5352 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5353 /* Two enumerators from the same enumeration can have different
5354 types when the enumeration is still being defined. */;
5355 else if (complain & tf_warning)
5356 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5357 "conditional expression: %qT vs %qT",
5358 arg2_type, arg3_type);
5360 else if (extra_warnings
5361 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5362 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5363 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5364 && !same_type_p (arg2_type,
5365 type_promotes_to (arg3_type)))))
5367 if (complain & tf_warning)
5368 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5369 "conditional expression");
5372 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5373 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5375 /* [expr.cond]
5377 --The second and third operands have pointer type, or one has
5378 pointer type and the other is a null pointer constant; pointer
5379 conversions (_conv.ptr_) and qualification conversions
5380 (_conv.qual_) are performed to bring them to their composite
5381 pointer type (_expr.rel_). The result is of the composite
5382 pointer type.
5384 --The second and third operands have pointer to member type, or
5385 one has pointer to member type and the other is a null pointer
5386 constant; pointer to member conversions (_conv.mem_) and
5387 qualification conversions (_conv.qual_) are performed to bring
5388 them to a common type, whose cv-qualification shall match the
5389 cv-qualification of either the second or the third operand.
5390 The result is of the common type. */
5391 else if ((null_ptr_cst_p (arg2)
5392 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5393 || (null_ptr_cst_p (arg3)
5394 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5395 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5396 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5397 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5399 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5400 arg3, CPO_CONDITIONAL_EXPR,
5401 complain);
5402 if (result_type == error_mark_node)
5403 return error_mark_node;
5404 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5405 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5408 if (!result_type)
5410 if (complain & tf_error)
5411 error_at (loc, "operands to ?: have different types %qT and %qT",
5412 arg2_type, arg3_type);
5413 return error_mark_node;
5416 if (arg2 == error_mark_node || arg3 == error_mark_node)
5417 return error_mark_node;
5419 valid_operands:
5420 if (processing_template_decl && is_glvalue)
5422 /* Let lvalue_kind know this was a glvalue. */
5423 tree arg = (result_type == arg2_type ? arg2 : arg3);
5424 result_type = cp_build_reference_type (result_type, xvalue_p (arg));
5427 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5429 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5430 warn here, because the COND_EXPR will be turned into ARG2. */
5431 if (warn_duplicated_branches
5432 && (complain & tf_warning)
5433 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5434 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5435 "this condition has identical branches");
5437 /* We can't use result_type below, as fold might have returned a
5438 throw_expr. */
5440 if (!is_glvalue)
5442 /* Expand both sides into the same slot, hopefully the target of
5443 the ?: expression. We used to check for TARGET_EXPRs here,
5444 but now we sometimes wrap them in NOP_EXPRs so the test would
5445 fail. */
5446 if (CLASS_TYPE_P (TREE_TYPE (result)))
5447 result = get_target_expr_sfinae (result, complain);
5448 /* If this expression is an rvalue, but might be mistaken for an
5449 lvalue, we must add a NON_LVALUE_EXPR. */
5450 result = rvalue (result);
5452 else
5453 result = force_paren_expr (result);
5455 return result;
5458 /* Wrapper for above. */
5460 tree
5461 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5462 tsubst_flags_t complain)
5464 tree ret;
5465 bool subtime = timevar_cond_start (TV_OVERLOAD);
5466 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5467 timevar_cond_stop (TV_OVERLOAD, subtime);
5468 return ret;
5471 /* OPERAND is an operand to an expression. Perform necessary steps
5472 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5473 returned. */
5475 static tree
5476 prep_operand (tree operand)
5478 if (operand)
5480 if (CLASS_TYPE_P (TREE_TYPE (operand))
5481 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5482 /* Make sure the template type is instantiated now. */
5483 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5486 return operand;
5489 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5490 OVERLOAD) to the CANDIDATES, returning an updated list of
5491 CANDIDATES. The ARGS are the arguments provided to the call;
5492 if FIRST_ARG is non-null it is the implicit object argument,
5493 otherwise the first element of ARGS is used if needed. The
5494 EXPLICIT_TARGS are explicit template arguments provided.
5495 TEMPLATE_ONLY is true if only template functions should be
5496 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5497 add_function_candidate. */
5499 static void
5500 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5501 tree return_type,
5502 tree explicit_targs, bool template_only,
5503 tree conversion_path, tree access_path,
5504 int flags,
5505 struct z_candidate **candidates,
5506 tsubst_flags_t complain)
5508 tree ctype;
5509 const vec<tree, va_gc> *non_static_args;
5510 bool check_list_ctor = false;
5511 bool check_converting = false;
5512 unification_kind_t strict;
5514 if (!fns)
5515 return;
5517 /* Precalculate special handling of constructors and conversion ops. */
5518 tree fn = OVL_FIRST (fns);
5519 if (DECL_CONV_FN_P (fn))
5521 check_list_ctor = false;
5522 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5523 if (flags & LOOKUP_NO_CONVERSION)
5524 /* We're doing return_type(x). */
5525 strict = DEDUCE_CONV;
5526 else
5527 /* We're doing x.operator return_type(). */
5528 strict = DEDUCE_EXACT;
5529 /* [over.match.funcs] For conversion functions, the function
5530 is considered to be a member of the class of the implicit
5531 object argument for the purpose of defining the type of
5532 the implicit object parameter. */
5533 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5535 else
5537 if (DECL_CONSTRUCTOR_P (fn))
5539 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5540 /* For list-initialization we consider explicit constructors
5541 and complain if one is chosen. */
5542 check_converting
5543 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5544 == LOOKUP_ONLYCONVERTING);
5546 strict = DEDUCE_CALL;
5547 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5550 if (first_arg)
5551 non_static_args = args;
5552 else
5553 /* Delay creating the implicit this parameter until it is needed. */
5554 non_static_args = NULL;
5556 for (lkp_iterator iter (fns); iter; ++iter)
5558 fn = *iter;
5560 if (check_converting && DECL_NONCONVERTING_P (fn))
5561 continue;
5562 if (check_list_ctor && !is_list_ctor (fn))
5563 continue;
5565 tree fn_first_arg = NULL_TREE;
5566 const vec<tree, va_gc> *fn_args = args;
5568 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5570 /* Figure out where the object arg comes from. If this
5571 function is a non-static member and we didn't get an
5572 implicit object argument, move it out of args. */
5573 if (first_arg == NULL_TREE)
5575 unsigned int ix;
5576 tree arg;
5577 vec<tree, va_gc> *tempvec;
5578 vec_alloc (tempvec, args->length () - 1);
5579 for (ix = 1; args->iterate (ix, &arg); ++ix)
5580 tempvec->quick_push (arg);
5581 non_static_args = tempvec;
5582 first_arg = (*args)[0];
5585 fn_first_arg = first_arg;
5586 fn_args = non_static_args;
5589 if (TREE_CODE (fn) == TEMPLATE_DECL)
5590 add_template_candidate (candidates,
5592 ctype,
5593 explicit_targs,
5594 fn_first_arg,
5595 fn_args,
5596 return_type,
5597 access_path,
5598 conversion_path,
5599 flags,
5600 strict,
5601 complain);
5602 else if (!template_only)
5603 add_function_candidate (candidates,
5605 ctype,
5606 fn_first_arg,
5607 fn_args,
5608 access_path,
5609 conversion_path,
5610 flags,
5611 NULL,
5612 complain);
5616 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5617 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5619 static int
5620 op_is_ordered (tree_code code)
5622 switch (code)
5624 // 5. b @= a
5625 case MODIFY_EXPR:
5626 return (flag_strong_eval_order > 1 ? -1 : 0);
5628 // 6. a[b]
5629 case ARRAY_REF:
5630 return (flag_strong_eval_order > 1 ? 1 : 0);
5632 // 1. a.b
5633 // Not overloadable (yet).
5634 // 2. a->b
5635 // Only one argument.
5636 // 3. a->*b
5637 case MEMBER_REF:
5638 // 7. a << b
5639 case LSHIFT_EXPR:
5640 // 8. a >> b
5641 case RSHIFT_EXPR:
5642 return (flag_strong_eval_order ? 1 : 0);
5644 default:
5645 return 0;
5649 static tree
5650 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5651 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5653 struct z_candidate *candidates = 0, *cand;
5654 vec<tree, va_gc> *arglist;
5655 tree args[3];
5656 tree result = NULL_TREE;
5657 bool result_valid_p = false;
5658 enum tree_code code2 = NOP_EXPR;
5659 enum tree_code code_orig_arg1 = ERROR_MARK;
5660 enum tree_code code_orig_arg2 = ERROR_MARK;
5661 conversion *conv;
5662 void *p;
5663 bool strict_p;
5664 bool any_viable_p;
5666 if (error_operand_p (arg1)
5667 || error_operand_p (arg2)
5668 || error_operand_p (arg3))
5669 return error_mark_node;
5671 bool ismodop = code == MODIFY_EXPR;
5672 if (ismodop)
5674 code2 = TREE_CODE (arg3);
5675 arg3 = NULL_TREE;
5677 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
5679 arg1 = prep_operand (arg1);
5681 bool memonly = false;
5682 switch (code)
5684 case NEW_EXPR:
5685 case VEC_NEW_EXPR:
5686 case VEC_DELETE_EXPR:
5687 case DELETE_EXPR:
5688 /* Use build_op_new_call and build_op_delete_call instead. */
5689 gcc_unreachable ();
5691 case CALL_EXPR:
5692 /* Use build_op_call instead. */
5693 gcc_unreachable ();
5695 case TRUTH_ORIF_EXPR:
5696 case TRUTH_ANDIF_EXPR:
5697 case TRUTH_AND_EXPR:
5698 case TRUTH_OR_EXPR:
5699 /* These are saved for the sake of warn_logical_operator. */
5700 code_orig_arg1 = TREE_CODE (arg1);
5701 code_orig_arg2 = TREE_CODE (arg2);
5702 break;
5703 case GT_EXPR:
5704 case LT_EXPR:
5705 case GE_EXPR:
5706 case LE_EXPR:
5707 case EQ_EXPR:
5708 case NE_EXPR:
5709 /* These are saved for the sake of maybe_warn_bool_compare. */
5710 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5711 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5712 break;
5714 /* =, ->, [], () must be non-static member functions. */
5715 case MODIFY_EXPR:
5716 if (code2 != NOP_EXPR)
5717 break;
5718 /* FALLTHRU */
5719 case COMPONENT_REF:
5720 case ARRAY_REF:
5721 memonly = true;
5722 break;
5724 default:
5725 break;
5728 arg2 = prep_operand (arg2);
5729 arg3 = prep_operand (arg3);
5731 if (code == COND_EXPR)
5732 /* Use build_conditional_expr instead. */
5733 gcc_unreachable ();
5734 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5735 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5736 goto builtin;
5738 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5739 arg2 = integer_zero_node;
5741 vec_alloc (arglist, 3);
5742 arglist->quick_push (arg1);
5743 if (arg2 != NULL_TREE)
5744 arglist->quick_push (arg2);
5745 if (arg3 != NULL_TREE)
5746 arglist->quick_push (arg3);
5748 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5749 p = conversion_obstack_alloc (0);
5751 /* Add namespace-scope operators to the list of functions to
5752 consider. */
5753 if (!memonly)
5755 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5756 fns = lookup_arg_dependent (fnname, fns, arglist);
5757 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5758 NULL_TREE, false, NULL_TREE, NULL_TREE,
5759 flags, &candidates, complain);
5762 args[0] = arg1;
5763 args[1] = arg2;
5764 args[2] = NULL_TREE;
5766 /* Add class-member operators to the candidate set. */
5767 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5769 tree fns;
5771 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5772 if (fns == error_mark_node)
5774 result = error_mark_node;
5775 goto user_defined_result_ready;
5777 if (fns)
5778 add_candidates (BASELINK_FUNCTIONS (fns),
5779 NULL_TREE, arglist, NULL_TREE,
5780 NULL_TREE, false,
5781 BASELINK_BINFO (fns),
5782 BASELINK_ACCESS_BINFO (fns),
5783 flags, &candidates, complain);
5785 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5786 only non-member functions that have type T1 or reference to
5787 cv-qualified-opt T1 for the first argument, if the first argument
5788 has an enumeration type, or T2 or reference to cv-qualified-opt
5789 T2 for the second argument, if the second argument has an
5790 enumeration type. Filter out those that don't match. */
5791 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5793 struct z_candidate **candp, **next;
5795 for (candp = &candidates; *candp; candp = next)
5797 tree parmlist, parmtype;
5798 int i, nargs = (arg2 ? 2 : 1);
5800 cand = *candp;
5801 next = &cand->next;
5803 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5805 for (i = 0; i < nargs; ++i)
5807 parmtype = TREE_VALUE (parmlist);
5809 if (TYPE_REF_P (parmtype))
5810 parmtype = TREE_TYPE (parmtype);
5811 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5812 && (same_type_ignoring_top_level_qualifiers_p
5813 (TREE_TYPE (args[i]), parmtype)))
5814 break;
5816 parmlist = TREE_CHAIN (parmlist);
5819 /* No argument has an appropriate type, so remove this
5820 candidate function from the list. */
5821 if (i == nargs)
5823 *candp = cand->next;
5824 next = candp;
5829 add_builtin_candidates (&candidates, code, code2, fnname, args,
5830 flags, complain);
5832 switch (code)
5834 case COMPOUND_EXPR:
5835 case ADDR_EXPR:
5836 /* For these, the built-in candidates set is empty
5837 [over.match.oper]/3. We don't want non-strict matches
5838 because exact matches are always possible with built-in
5839 operators. The built-in candidate set for COMPONENT_REF
5840 would be empty too, but since there are no such built-in
5841 operators, we accept non-strict matches for them. */
5842 strict_p = true;
5843 break;
5845 default:
5846 strict_p = false;
5847 break;
5850 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5851 if (!any_viable_p)
5853 switch (code)
5855 case POSTINCREMENT_EXPR:
5856 case POSTDECREMENT_EXPR:
5857 /* Don't try anything fancy if we're not allowed to produce
5858 errors. */
5859 if (!(complain & tf_error))
5860 return error_mark_node;
5862 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5863 distinguish between prefix and postfix ++ and
5864 operator++() was used for both, so we allow this with
5865 -fpermissive. */
5866 else
5868 const char *msg = (flag_permissive)
5869 ? G_("no %<%D(int)%> declared for postfix %qs,"
5870 " trying prefix operator instead")
5871 : G_("no %<%D(int)%> declared for postfix %qs");
5872 permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name);
5875 if (!flag_permissive)
5876 return error_mark_node;
5878 if (code == POSTINCREMENT_EXPR)
5879 code = PREINCREMENT_EXPR;
5880 else
5881 code = PREDECREMENT_EXPR;
5882 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5883 NULL_TREE, overload, complain);
5884 break;
5886 /* The caller will deal with these. */
5887 case ADDR_EXPR:
5888 case COMPOUND_EXPR:
5889 case COMPONENT_REF:
5890 result = NULL_TREE;
5891 result_valid_p = true;
5892 break;
5894 default:
5895 if (complain & tf_error)
5897 /* If one of the arguments of the operator represents
5898 an invalid use of member function pointer, try to report
5899 a meaningful error ... */
5900 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5901 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5902 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5903 /* We displayed the error message. */;
5904 else
5906 /* ... Otherwise, report the more generic
5907 "no matching operator found" error */
5908 auto_diagnostic_group d;
5909 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5910 print_z_candidates (loc, candidates);
5913 result = error_mark_node;
5914 break;
5917 else
5919 cand = tourney (candidates, complain);
5920 if (cand == 0)
5922 if (complain & tf_error)
5924 auto_diagnostic_group d;
5925 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5926 print_z_candidates (loc, candidates);
5928 result = error_mark_node;
5930 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5932 if (overload)
5933 *overload = cand->fn;
5935 if (resolve_args (arglist, complain) == NULL)
5936 result = error_mark_node;
5937 else
5938 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5940 if (trivial_fn_p (cand->fn))
5941 /* There won't be a CALL_EXPR. */;
5942 else if (result && result != error_mark_node)
5944 tree call = extract_call_expr (result);
5945 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5947 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5948 /* This prevents build_new_function_call from discarding this
5949 function during instantiation of the enclosing template. */
5950 KOENIG_LOOKUP_P (call) = 1;
5952 /* Specify evaluation order as per P0145R2. */
5953 CALL_EXPR_ORDERED_ARGS (call) = false;
5954 switch (op_is_ordered (code))
5956 case -1:
5957 CALL_EXPR_REVERSE_ARGS (call) = true;
5958 break;
5960 case 1:
5961 CALL_EXPR_ORDERED_ARGS (call) = true;
5962 break;
5964 default:
5965 break;
5969 else
5971 /* Give any warnings we noticed during overload resolution. */
5972 if (cand->warnings && (complain & tf_warning))
5974 struct candidate_warning *w;
5975 for (w = cand->warnings; w; w = w->next)
5976 joust (cand, w->loser, 1, complain);
5979 /* Check for comparison of different enum types. */
5980 switch (code)
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 (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5989 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5990 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5991 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5992 && (complain & tf_warning))
5994 warning (OPT_Wenum_compare,
5995 "comparison between %q#T and %q#T",
5996 TREE_TYPE (arg1), TREE_TYPE (arg2));
5998 break;
5999 default:
6000 break;
6003 /* We need to strip any leading REF_BIND so that bitfields
6004 don't cause errors. This should not remove any important
6005 conversions, because builtins don't apply to class
6006 objects directly. */
6007 conv = cand->convs[0];
6008 if (conv->kind == ck_ref_bind)
6009 conv = next_conversion (conv);
6010 arg1 = convert_like (conv, arg1, complain);
6012 if (arg2)
6014 conv = cand->convs[1];
6015 if (conv->kind == ck_ref_bind)
6016 conv = next_conversion (conv);
6017 else
6018 arg2 = decay_conversion (arg2, complain);
6020 /* We need to call warn_logical_operator before
6021 converting arg2 to a boolean_type, but after
6022 decaying an enumerator to its value. */
6023 if (complain & tf_warning)
6024 warn_logical_operator (loc, code, boolean_type_node,
6025 code_orig_arg1, arg1,
6026 code_orig_arg2, arg2);
6028 arg2 = convert_like (conv, arg2, complain);
6030 if (arg3)
6032 conv = cand->convs[2];
6033 if (conv->kind == ck_ref_bind)
6034 conv = next_conversion (conv);
6035 arg3 = convert_like (conv, arg3, complain);
6041 user_defined_result_ready:
6043 /* Free all the conversions we allocated. */
6044 obstack_free (&conversion_obstack, p);
6046 if (result || result_valid_p)
6047 return result;
6049 builtin:
6050 switch (code)
6052 case MODIFY_EXPR:
6053 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
6055 case INDIRECT_REF:
6056 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
6058 case TRUTH_ANDIF_EXPR:
6059 case TRUTH_ORIF_EXPR:
6060 case TRUTH_AND_EXPR:
6061 case TRUTH_OR_EXPR:
6062 if (complain & tf_warning)
6063 warn_logical_operator (loc, code, boolean_type_node,
6064 code_orig_arg1, arg1,
6065 code_orig_arg2, arg2);
6066 /* Fall through. */
6067 case GT_EXPR:
6068 case LT_EXPR:
6069 case GE_EXPR:
6070 case LE_EXPR:
6071 case EQ_EXPR:
6072 case NE_EXPR:
6073 if ((complain & tf_warning)
6074 && ((code_orig_arg1 == BOOLEAN_TYPE)
6075 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
6076 maybe_warn_bool_compare (loc, code, arg1, arg2);
6077 if (complain & tf_warning && warn_tautological_compare)
6078 warn_tautological_cmp (loc, code, arg1, arg2);
6079 /* Fall through. */
6080 case PLUS_EXPR:
6081 case MINUS_EXPR:
6082 case MULT_EXPR:
6083 case TRUNC_DIV_EXPR:
6084 case MAX_EXPR:
6085 case MIN_EXPR:
6086 case LSHIFT_EXPR:
6087 case RSHIFT_EXPR:
6088 case TRUNC_MOD_EXPR:
6089 case BIT_AND_EXPR:
6090 case BIT_IOR_EXPR:
6091 case BIT_XOR_EXPR:
6092 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6094 case UNARY_PLUS_EXPR:
6095 case NEGATE_EXPR:
6096 case BIT_NOT_EXPR:
6097 case TRUTH_NOT_EXPR:
6098 case PREINCREMENT_EXPR:
6099 case POSTINCREMENT_EXPR:
6100 case PREDECREMENT_EXPR:
6101 case POSTDECREMENT_EXPR:
6102 case REALPART_EXPR:
6103 case IMAGPART_EXPR:
6104 case ABS_EXPR:
6105 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6107 case ARRAY_REF:
6108 return cp_build_array_ref (input_location, arg1, arg2, complain);
6110 case MEMBER_REF:
6111 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6112 complain),
6113 arg2, complain);
6115 /* The caller will deal with these. */
6116 case ADDR_EXPR:
6117 case COMPONENT_REF:
6118 case COMPOUND_EXPR:
6119 return NULL_TREE;
6121 default:
6122 gcc_unreachable ();
6124 return NULL_TREE;
6127 /* Wrapper for above. */
6129 tree
6130 build_new_op (location_t loc, enum tree_code code, int flags,
6131 tree arg1, tree arg2, tree arg3,
6132 tree *overload, tsubst_flags_t complain)
6134 tree ret;
6135 bool subtime = timevar_cond_start (TV_OVERLOAD);
6136 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6137 overload, complain);
6138 timevar_cond_stop (TV_OVERLOAD, subtime);
6139 return ret;
6142 /* CALL was returned by some call-building function; extract the actual
6143 CALL_EXPR from any bits that have been tacked on, e.g. by
6144 convert_from_reference. */
6146 tree
6147 extract_call_expr (tree call)
6149 while (TREE_CODE (call) == COMPOUND_EXPR)
6150 call = TREE_OPERAND (call, 1);
6151 if (REFERENCE_REF_P (call))
6152 call = TREE_OPERAND (call, 0);
6153 if (TREE_CODE (call) == TARGET_EXPR)
6154 call = TARGET_EXPR_INITIAL (call);
6155 gcc_assert (TREE_CODE (call) == CALL_EXPR
6156 || TREE_CODE (call) == AGGR_INIT_EXPR
6157 || call == error_mark_node);
6158 return call;
6161 /* Returns true if FN has two parameters, of which the second has type
6162 size_t. */
6164 static bool
6165 second_parm_is_size_t (tree fn)
6167 tree t = FUNCTION_ARG_CHAIN (fn);
6168 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6169 return false;
6170 t = TREE_CHAIN (t);
6171 if (t == void_list_node)
6172 return true;
6173 if (aligned_new_threshold && t
6174 && same_type_p (TREE_VALUE (t), align_type_node)
6175 && TREE_CHAIN (t) == void_list_node)
6176 return true;
6177 return false;
6180 /* True if T, an allocation function, has std::align_val_t as its second
6181 argument. */
6183 bool
6184 aligned_allocation_fn_p (tree t)
6186 if (!aligned_new_threshold)
6187 return false;
6189 tree a = FUNCTION_ARG_CHAIN (t);
6190 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6193 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6194 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6195 std::align_val_t. */
6197 static bool
6198 aligned_deallocation_fn_p (tree t)
6200 if (!aligned_new_threshold)
6201 return false;
6203 /* A template instance is never a usual deallocation function,
6204 regardless of its signature. */
6205 if (TREE_CODE (t) == TEMPLATE_DECL
6206 || primary_template_specialization_p (t))
6207 return false;
6209 tree a = FUNCTION_ARG_CHAIN (t);
6210 if (same_type_p (TREE_VALUE (a), align_type_node)
6211 && TREE_CHAIN (a) == void_list_node)
6212 return true;
6213 if (!same_type_p (TREE_VALUE (a), size_type_node))
6214 return false;
6215 a = TREE_CHAIN (a);
6216 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6217 && TREE_CHAIN (a) == void_list_node)
6218 return true;
6219 return false;
6222 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6223 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6225 bool
6226 usual_deallocation_fn_p (tree t)
6228 /* A template instance is never a usual deallocation function,
6229 regardless of its signature. */
6230 if (TREE_CODE (t) == TEMPLATE_DECL
6231 || primary_template_specialization_p (t))
6232 return false;
6234 /* If a class T has a member deallocation function named operator delete
6235 with exactly one parameter, then that function is a usual
6236 (non-placement) deallocation function. If class T does not declare
6237 such an operator delete but does declare a member deallocation
6238 function named operator delete with exactly two parameters, the second
6239 of which has type std::size_t (18.2), then this function is a usual
6240 deallocation function. */
6241 bool global = DECL_NAMESPACE_SCOPE_P (t);
6242 tree chain = FUNCTION_ARG_CHAIN (t);
6243 if (!chain)
6244 return false;
6245 if (chain == void_list_node
6246 || ((!global || flag_sized_deallocation)
6247 && second_parm_is_size_t (t)))
6248 return true;
6249 if (aligned_deallocation_fn_p (t))
6250 return true;
6251 return false;
6254 /* Build a call to operator delete. This has to be handled very specially,
6255 because the restrictions on what signatures match are different from all
6256 other call instances. For a normal delete, only a delete taking (void *)
6257 or (void *, size_t) is accepted. For a placement delete, only an exact
6258 match with the placement new is accepted.
6260 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6261 ADDR is the pointer to be deleted.
6262 SIZE is the size of the memory block to be deleted.
6263 GLOBAL_P is true if the delete-expression should not consider
6264 class-specific delete operators.
6265 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6267 If this call to "operator delete" is being generated as part to
6268 deallocate memory allocated via a new-expression (as per [expr.new]
6269 which requires that if the initialization throws an exception then
6270 we call a deallocation function), then ALLOC_FN is the allocation
6271 function. */
6273 tree
6274 build_op_delete_call (enum tree_code code, tree addr, tree size,
6275 bool global_p, tree placement,
6276 tree alloc_fn, tsubst_flags_t complain)
6278 tree fn = NULL_TREE;
6279 tree fns, fnname, type, t;
6281 if (addr == error_mark_node)
6282 return error_mark_node;
6284 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6286 fnname = ovl_op_identifier (false, code);
6288 if (CLASS_TYPE_P (type)
6289 && COMPLETE_TYPE_P (complete_type (type))
6290 && !global_p)
6291 /* In [class.free]
6293 If the result of the lookup is ambiguous or inaccessible, or if
6294 the lookup selects a placement deallocation function, the
6295 program is ill-formed.
6297 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6299 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6300 if (fns == error_mark_node)
6301 return error_mark_node;
6303 else
6304 fns = NULL_TREE;
6306 if (fns == NULL_TREE)
6307 fns = lookup_name_nonclass (fnname);
6309 /* Strip const and volatile from addr. */
6310 addr = cp_convert (ptr_type_node, addr, complain);
6312 if (placement)
6314 /* "A declaration of a placement deallocation function matches the
6315 declaration of a placement allocation function if it has the same
6316 number of parameters and, after parameter transformations (8.3.5),
6317 all parameter types except the first are identical."
6319 So we build up the function type we want and ask instantiate_type
6320 to get it for us. */
6321 t = FUNCTION_ARG_CHAIN (alloc_fn);
6322 t = tree_cons (NULL_TREE, ptr_type_node, t);
6323 t = build_function_type (void_type_node, t);
6325 fn = instantiate_type (t, fns, tf_none);
6326 if (fn == error_mark_node)
6327 return NULL_TREE;
6329 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6331 /* "If the lookup finds the two-parameter form of a usual deallocation
6332 function (3.7.4.2) and that function, considered as a placement
6333 deallocation function, would have been selected as a match for the
6334 allocation function, the program is ill-formed." */
6335 if (second_parm_is_size_t (fn))
6337 const char *const msg1
6338 = G_("exception cleanup for this placement new selects "
6339 "non-placement operator delete");
6340 const char *const msg2
6341 = G_("%qD is a usual (non-placement) deallocation "
6342 "function in C++14 (or with -fsized-deallocation)");
6344 /* But if the class has an operator delete (void *), then that is
6345 the usual deallocation function, so we shouldn't complain
6346 about using the operator delete (void *, size_t). */
6347 if (DECL_CLASS_SCOPE_P (fn))
6348 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6349 iter; ++iter)
6351 tree elt = *iter;
6352 if (usual_deallocation_fn_p (elt)
6353 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6354 goto ok;
6356 /* Before C++14 a two-parameter global deallocation function is
6357 always a placement deallocation function, but warn if
6358 -Wc++14-compat. */
6359 else if (!flag_sized_deallocation)
6361 if (complain & tf_warning)
6363 auto_diagnostic_group d;
6364 if (warning (OPT_Wc__14_compat, msg1))
6365 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6367 goto ok;
6370 if (complain & tf_warning_or_error)
6372 auto_diagnostic_group d;
6373 if (permerror (input_location, msg1))
6375 /* Only mention C++14 for namespace-scope delete. */
6376 if (DECL_NAMESPACE_SCOPE_P (fn))
6377 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6378 else
6379 inform (DECL_SOURCE_LOCATION (fn),
6380 "%qD is a usual (non-placement) deallocation "
6381 "function", fn);
6384 else
6385 return error_mark_node;
6386 ok:;
6389 else
6390 /* "Any non-placement deallocation function matches a non-placement
6391 allocation function. If the lookup finds a single matching
6392 deallocation function, that function will be called; otherwise, no
6393 deallocation function will be called." */
6394 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6396 tree elt = *iter;
6397 if (usual_deallocation_fn_p (elt))
6399 if (!fn)
6401 fn = elt;
6402 continue;
6405 /* -- If the type has new-extended alignment, a function with a
6406 parameter of type std::align_val_t is preferred; otherwise a
6407 function without such a parameter is preferred. If exactly one
6408 preferred function is found, that function is selected and the
6409 selection process terminates. If more than one preferred
6410 function is found, all non-preferred functions are eliminated
6411 from further consideration. */
6412 if (aligned_new_threshold)
6414 bool want_align = type_has_new_extended_alignment (type);
6415 bool fn_align = aligned_deallocation_fn_p (fn);
6416 bool elt_align = aligned_deallocation_fn_p (elt);
6418 if (elt_align != fn_align)
6420 if (want_align == elt_align)
6421 fn = elt;
6422 continue;
6426 /* -- If the deallocation functions have class scope, the one
6427 without a parameter of type std::size_t is selected. */
6428 bool want_size;
6429 if (DECL_CLASS_SCOPE_P (fn))
6430 want_size = false;
6432 /* -- If the type is complete and if, for the second alternative
6433 (delete array) only, the operand is a pointer to a class type
6434 with a non-trivial destructor or a (possibly multi-dimensional)
6435 array thereof, the function with a parameter of type std::size_t
6436 is selected.
6438 -- Otherwise, it is unspecified whether a deallocation function
6439 with a parameter of type std::size_t is selected. */
6440 else
6442 want_size = COMPLETE_TYPE_P (type);
6443 if (code == VEC_DELETE_EXPR
6444 && !TYPE_VEC_NEW_USES_COOKIE (type))
6445 /* We need a cookie to determine the array size. */
6446 want_size = false;
6448 bool fn_size = second_parm_is_size_t (fn);
6449 bool elt_size = second_parm_is_size_t (elt);
6450 gcc_assert (fn_size != elt_size);
6451 if (want_size == elt_size)
6452 fn = elt;
6456 /* If we have a matching function, call it. */
6457 if (fn)
6459 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6461 /* If the FN is a member function, make sure that it is
6462 accessible. */
6463 if (BASELINK_P (fns))
6464 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6465 complain);
6467 /* Core issue 901: It's ok to new a type with deleted delete. */
6468 if (DECL_DELETED_FN (fn) && alloc_fn)
6469 return NULL_TREE;
6471 if (placement)
6473 /* The placement args might not be suitable for overload
6474 resolution at this point, so build the call directly. */
6475 int nargs = call_expr_nargs (placement);
6476 tree *argarray = XALLOCAVEC (tree, nargs);
6477 int i;
6478 argarray[0] = addr;
6479 for (i = 1; i < nargs; i++)
6480 argarray[i] = CALL_EXPR_ARG (placement, i);
6481 if (!mark_used (fn, complain) && !(complain & tf_error))
6482 return error_mark_node;
6483 return build_cxx_call (fn, nargs, argarray, complain);
6485 else
6487 tree ret;
6488 vec<tree, va_gc> *args = make_tree_vector ();
6489 args->quick_push (addr);
6490 if (second_parm_is_size_t (fn))
6491 args->quick_push (size);
6492 if (aligned_deallocation_fn_p (fn))
6494 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6495 args->quick_push (al);
6497 ret = cp_build_function_call_vec (fn, &args, complain);
6498 release_tree_vector (args);
6499 return ret;
6503 /* [expr.new]
6505 If no unambiguous matching deallocation function can be found,
6506 propagating the exception does not cause the object's memory to
6507 be freed. */
6508 if (alloc_fn)
6510 if ((complain & tf_warning)
6511 && !placement)
6512 warning (0, "no corresponding deallocation function for %qD",
6513 alloc_fn);
6514 return NULL_TREE;
6517 if (complain & tf_error)
6518 error ("no suitable %<operator %s%> for %qT",
6519 OVL_OP_INFO (false, code)->name, type);
6520 return error_mark_node;
6523 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6524 in the diagnostics.
6526 If ISSUE_ERROR is true, then issue an error about the
6527 access, followed by a note showing the declaration.
6528 Otherwise, just show the note. */
6530 void
6531 complain_about_access (tree decl, tree diag_decl, bool issue_error)
6533 if (TREE_PRIVATE (decl))
6535 if (issue_error)
6536 error ("%q#D is private within this context", diag_decl);
6537 inform (DECL_SOURCE_LOCATION (diag_decl),
6538 "declared private here");
6540 else if (TREE_PROTECTED (decl))
6542 if (issue_error)
6543 error ("%q#D is protected within this context", diag_decl);
6544 inform (DECL_SOURCE_LOCATION (diag_decl),
6545 "declared protected here");
6547 else
6549 if (issue_error)
6550 error ("%q#D is inaccessible within this context", diag_decl);
6551 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6555 /* If the current scope isn't allowed to access DECL along
6556 BASETYPE_PATH, give an error. The most derived class in
6557 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6558 the declaration to use in the error diagnostic. */
6560 bool
6561 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6562 tsubst_flags_t complain, access_failure_info *afi)
6564 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6566 if (flag_new_inheriting_ctors
6567 && DECL_INHERITED_CTOR (decl))
6569 /* 7.3.3/18: The additional constructors are accessible if they would be
6570 accessible when used to construct an object of the corresponding base
6571 class. */
6572 decl = strip_inheriting_ctors (decl);
6573 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6574 ba_any, NULL, complain);
6577 if (!accessible_p (basetype_path, decl, true))
6579 if (flag_new_inheriting_ctors)
6580 diag_decl = strip_inheriting_ctors (diag_decl);
6581 if (complain & tf_error)
6582 complain_about_access (decl, diag_decl, true);
6583 if (afi)
6584 afi->record_access_failure (basetype_path, decl, diag_decl);
6585 return false;
6588 return true;
6591 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6592 bitwise or of LOOKUP_* values. If any errors are warnings are
6593 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6594 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6595 to NULL. */
6597 static tree
6598 build_temp (tree expr, tree type, int flags,
6599 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6601 int savew, savee;
6602 vec<tree, va_gc> *args;
6604 *diagnostic_kind = DK_UNSPECIFIED;
6606 /* If the source is a packed field, calling the copy constructor will require
6607 binding the field to the reference parameter to the copy constructor, and
6608 we'll end up with an infinite loop. If we can use a bitwise copy, then
6609 do that now. */
6610 if ((lvalue_kind (expr) & clk_packed)
6611 && CLASS_TYPE_P (TREE_TYPE (expr))
6612 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6613 return get_target_expr_sfinae (expr, complain);
6615 savew = warningcount + werrorcount, savee = errorcount;
6616 args = make_tree_vector_single (expr);
6617 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6618 &args, type, flags, complain);
6619 release_tree_vector (args);
6620 if (warningcount + werrorcount > savew)
6621 *diagnostic_kind = DK_WARNING;
6622 else if (errorcount > savee)
6623 *diagnostic_kind = DK_ERROR;
6624 return expr;
6627 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6628 Also handle a subset of zero as null warnings.
6629 EXPR is implicitly converted to type TOTYPE.
6630 FN and ARGNUM are used for diagnostics. */
6632 static void
6633 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6635 /* Issue warnings about peculiar, but valid, uses of NULL. */
6636 if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE
6637 && ARITHMETIC_TYPE_P (totype))
6639 source_location loc =
6640 expansion_point_location_if_in_system_header (input_location);
6642 if (fn)
6643 warning_at (loc, OPT_Wconversion_null,
6644 "passing NULL to non-pointer argument %P of %qD",
6645 argnum, fn);
6646 else
6647 warning_at (loc, OPT_Wconversion_null,
6648 "converting to non-pointer type %qT from NULL", totype);
6651 /* Issue warnings if "false" is converted to a NULL pointer */
6652 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6653 && TYPE_PTR_P (totype))
6655 if (fn)
6656 warning_at (input_location, OPT_Wconversion_null,
6657 "converting %<false%> to pointer type for argument %P "
6658 "of %qD", argnum, fn);
6659 else
6660 warning_at (input_location, OPT_Wconversion_null,
6661 "converting %<false%> to pointer type %qT", totype);
6663 /* Handle zero as null pointer warnings for cases other
6664 than EQ_EXPR and NE_EXPR */
6665 else if (null_ptr_cst_p (expr) &&
6666 (TYPE_PTR_OR_PTRMEM_P (totype) || NULLPTR_TYPE_P (totype)))
6668 source_location loc =
6669 expansion_point_location_if_in_system_header (input_location);
6670 maybe_warn_zero_as_null_pointer_constant (expr, loc);
6674 /* We gave a diagnostic during a conversion. If this was in the second
6675 standard conversion sequence of a user-defined conversion sequence, say
6676 which user-defined conversion. */
6678 static void
6679 maybe_print_user_conv_context (conversion *convs)
6681 if (convs->user_conv_p)
6682 for (conversion *t = convs; t; t = next_conversion (t))
6683 if (t->kind == ck_user)
6685 print_z_candidate (0, " after user-defined conversion:",
6686 t->cand);
6687 break;
6691 /* Locate the parameter with the given index within FNDECL.
6692 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6693 Return the location of the FNDECL itself if there are problems. */
6695 location_t
6696 get_fndecl_argument_location (tree fndecl, int argnum)
6698 int i;
6699 tree param;
6701 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6702 for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl);
6703 i < argnum && param;
6704 i++, param = TREE_CHAIN (param))
6707 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6708 return the location of FNDECL. */
6709 if (param == NULL)
6710 return DECL_SOURCE_LOCATION (fndecl);
6712 return DECL_SOURCE_LOCATION (param);
6715 /* Perform the conversions in CONVS on the expression EXPR. FN and
6716 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6717 indicates the `this' argument of a method. INNER is nonzero when
6718 being called to continue a conversion chain. It is negative when a
6719 reference binding will be applied, positive otherwise. If
6720 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6721 conversions will be emitted if appropriate. If C_CAST_P is true,
6722 this conversion is coming from a C-style cast; in that case,
6723 conversions to inaccessible bases are permitted. */
6725 static tree
6726 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6727 bool issue_conversion_warnings,
6728 bool c_cast_p, tsubst_flags_t complain)
6730 tree totype = convs->type;
6731 diagnostic_t diag_kind;
6732 int flags;
6733 location_t loc = cp_expr_loc_or_loc (expr, input_location);
6735 if (convs->bad_p && !(complain & tf_error))
6736 return error_mark_node;
6738 if (convs->bad_p
6739 && convs->kind != ck_user
6740 && convs->kind != ck_list
6741 && convs->kind != ck_ambig
6742 && (convs->kind != ck_ref_bind
6743 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6744 && (convs->kind != ck_rvalue
6745 || SCALAR_TYPE_P (totype))
6746 && convs->kind != ck_base)
6748 bool complained = false;
6749 conversion *t = convs;
6751 /* Give a helpful error if this is bad because of excess braces. */
6752 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6753 && SCALAR_TYPE_P (totype)
6754 && CONSTRUCTOR_NELTS (expr) > 0
6755 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6757 complained = permerror (loc, "too many braces around initializer "
6758 "for %qT", totype);
6759 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6760 && CONSTRUCTOR_NELTS (expr) == 1)
6761 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6764 /* Give a helpful error if this is bad because a conversion to bool
6765 from std::nullptr_t requires direct-initialization. */
6766 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6767 && TREE_CODE (totype) == BOOLEAN_TYPE)
6768 complained = permerror (loc, "converting to %qH from %qI requires "
6769 "direct-initialization",
6770 totype, TREE_TYPE (expr));
6772 for (; t ; t = next_conversion (t))
6774 if (t->kind == ck_user && t->cand->reason)
6776 auto_diagnostic_group d;
6777 complained = permerror (loc, "invalid user-defined conversion "
6778 "from %qH to %qI", TREE_TYPE (expr),
6779 totype);
6780 if (complained)
6781 print_z_candidate (loc, "candidate is:", t->cand);
6782 expr = convert_like_real (t, expr, fn, argnum,
6783 /*issue_conversion_warnings=*/false,
6784 /*c_cast_p=*/false,
6785 complain);
6786 if (convs->kind == ck_ref_bind)
6787 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6788 LOOKUP_NORMAL, NULL_TREE,
6789 complain);
6790 else
6791 expr = cp_convert (totype, expr, complain);
6792 if (complained && fn)
6793 inform (DECL_SOURCE_LOCATION (fn),
6794 " initializing argument %P of %qD", argnum, fn);
6795 return expr;
6797 else if (t->kind == ck_user || !t->bad_p)
6799 expr = convert_like_real (t, expr, fn, argnum,
6800 /*issue_conversion_warnings=*/false,
6801 /*c_cast_p=*/false,
6802 complain);
6803 break;
6805 else if (t->kind == ck_ambig)
6806 return convert_like_real (t, expr, fn, argnum,
6807 /*issue_conversion_warnings=*/false,
6808 /*c_cast_p=*/false,
6809 complain);
6810 else if (t->kind == ck_identity)
6811 break;
6813 if (!complained)
6815 range_label_for_type_mismatch label (TREE_TYPE (expr), totype);
6816 gcc_rich_location richloc (loc, &label);
6817 complained = permerror (&richloc,
6818 "invalid conversion from %qH to %qI",
6819 TREE_TYPE (expr), totype);
6821 if (complained && fn)
6822 inform (get_fndecl_argument_location (fn, argnum),
6823 " initializing argument %P of %qD", argnum, fn);
6825 return cp_convert (totype, expr, complain);
6828 if (issue_conversion_warnings && (complain & tf_warning))
6829 conversion_null_warnings (totype, expr, fn, argnum);
6831 switch (convs->kind)
6833 case ck_user:
6835 struct z_candidate *cand = convs->cand;
6837 if (cand == NULL)
6838 /* We chose the surrogate function from add_conv_candidate, now we
6839 actually need to build the conversion. */
6840 cand = build_user_type_conversion_1 (totype, expr,
6841 LOOKUP_NO_CONVERSION, complain);
6843 tree convfn = cand->fn;
6845 /* When converting from an init list we consider explicit
6846 constructors, but actually trying to call one is an error. */
6847 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6848 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6849 /* Unless this is for direct-list-initialization. */
6850 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6851 /* And in C++98 a default constructor can't be explicit. */
6852 && cxx_dialect >= cxx11)
6854 if (!(complain & tf_error))
6855 return error_mark_node;
6856 location_t loc = location_of (expr);
6857 if (CONSTRUCTOR_NELTS (expr) == 0
6858 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6860 auto_diagnostic_group d;
6861 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6862 "would use explicit constructor %qD",
6863 totype, convfn))
6864 inform (loc, "in C++11 and above a default constructor "
6865 "can be explicit");
6867 else
6868 error ("converting to %qT from initializer list would use "
6869 "explicit constructor %qD", totype, convfn);
6872 /* If we're initializing from {}, it's value-initialization. */
6873 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6874 && CONSTRUCTOR_NELTS (expr) == 0
6875 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6877 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6878 if (abstract_virtuals_error_sfinae (NULL_TREE, totype, complain))
6879 return error_mark_node;
6880 expr = build_value_init (totype, complain);
6881 expr = get_target_expr_sfinae (expr, complain);
6882 if (expr != error_mark_node)
6884 TARGET_EXPR_LIST_INIT_P (expr) = true;
6885 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6887 return expr;
6890 expr = mark_rvalue_use (expr);
6892 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6893 any more UDCs. */
6894 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6895 complain);
6897 /* If this is a constructor or a function returning an aggr type,
6898 we need to build up a TARGET_EXPR. */
6899 if (DECL_CONSTRUCTOR_P (convfn))
6901 expr = build_cplus_new (totype, expr, complain);
6903 /* Remember that this was list-initialization. */
6904 if (convs->check_narrowing && expr != error_mark_node)
6905 TARGET_EXPR_LIST_INIT_P (expr) = true;
6908 return expr;
6910 case ck_identity:
6911 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6913 int nelts = CONSTRUCTOR_NELTS (expr);
6914 if (nelts == 0)
6915 expr = build_value_init (totype, complain);
6916 else if (nelts == 1)
6917 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6918 else
6919 gcc_unreachable ();
6921 expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p,
6922 /*read_p=*/true, UNKNOWN_LOCATION,
6923 /*reject_builtin=*/true);
6925 if (type_unknown_p (expr))
6926 expr = instantiate_type (totype, expr, complain);
6927 if (expr == null_node
6928 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
6929 /* If __null has been converted to an integer type, we do not want to
6930 continue to warn about uses of EXPR as an integer, rather than as a
6931 pointer. */
6932 expr = build_int_cst (totype, 0);
6933 return expr;
6934 case ck_ambig:
6935 /* We leave bad_p off ck_ambig because overload resolution considers
6936 it valid, it just fails when we try to perform it. So we need to
6937 check complain here, too. */
6938 if (complain & tf_error)
6940 /* Call build_user_type_conversion again for the error. */
6941 int flags = (convs->need_temporary_p
6942 ? LOOKUP_IMPLICIT : LOOKUP_NORMAL);
6943 build_user_type_conversion (totype, convs->u.expr, flags, complain);
6944 gcc_assert (seen_error ());
6945 if (fn)
6946 inform (DECL_SOURCE_LOCATION (fn),
6947 " initializing argument %P of %qD", argnum, fn);
6949 return error_mark_node;
6951 case ck_list:
6953 /* Conversion to std::initializer_list<T>. */
6954 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6955 tree new_ctor = build_constructor (init_list_type_node, NULL);
6956 unsigned len = CONSTRUCTOR_NELTS (expr);
6957 tree array, val, field;
6958 vec<constructor_elt, va_gc> *vec = NULL;
6959 unsigned ix;
6961 /* Convert all the elements. */
6962 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6964 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6965 false, false, complain);
6966 if (sub == error_mark_node)
6967 return sub;
6968 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6969 && !check_narrowing (TREE_TYPE (sub), val, complain))
6970 return error_mark_node;
6971 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6972 if (!TREE_CONSTANT (sub))
6973 TREE_CONSTANT (new_ctor) = false;
6975 /* Build up the array. */
6976 elttype = cp_build_qualified_type
6977 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6978 array = build_array_of_n_type (elttype, len);
6979 array = finish_compound_literal (array, new_ctor, complain);
6980 /* Take the address explicitly rather than via decay_conversion
6981 to avoid the error about taking the address of a temporary. */
6982 array = cp_build_addr_expr (array, complain);
6983 array = cp_convert (build_pointer_type (elttype), array, complain);
6984 if (array == error_mark_node)
6985 return error_mark_node;
6987 /* Build up the initializer_list object. Note: fail gracefully
6988 if the object cannot be completed because, for example, no
6989 definition is provided (c++/80956). */
6990 totype = complete_type_or_maybe_complain (totype, NULL_TREE, complain);
6991 if (!totype)
6992 return error_mark_node;
6993 field = next_initializable_field (TYPE_FIELDS (totype));
6994 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6995 field = next_initializable_field (DECL_CHAIN (field));
6996 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6997 new_ctor = build_constructor (totype, vec);
6998 return get_target_expr_sfinae (new_ctor, complain);
7001 case ck_aggr:
7002 if (TREE_CODE (totype) == COMPLEX_TYPE)
7004 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
7005 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
7006 real = perform_implicit_conversion (TREE_TYPE (totype),
7007 real, complain);
7008 imag = perform_implicit_conversion (TREE_TYPE (totype),
7009 imag, complain);
7010 expr = build2 (COMPLEX_EXPR, totype, real, imag);
7011 return expr;
7013 expr = reshape_init (totype, expr, complain);
7014 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
7015 complain);
7016 if (expr != error_mark_node)
7017 TARGET_EXPR_LIST_INIT_P (expr) = true;
7018 return expr;
7020 default:
7021 break;
7024 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
7025 convs->kind == ck_ref_bind
7026 ? issue_conversion_warnings : false,
7027 c_cast_p, complain);
7028 if (expr == error_mark_node)
7029 return error_mark_node;
7031 switch (convs->kind)
7033 case ck_rvalue:
7034 expr = decay_conversion (expr, complain);
7035 if (expr == error_mark_node)
7037 if (complain & tf_error)
7039 auto_diagnostic_group d;
7040 maybe_print_user_conv_context (convs);
7041 if (fn)
7042 inform (DECL_SOURCE_LOCATION (fn),
7043 " initializing argument %P of %qD", argnum, fn);
7045 return error_mark_node;
7048 if (! MAYBE_CLASS_TYPE_P (totype))
7049 return expr;
7051 /* Don't introduce copies when passing arguments along to the inherited
7052 constructor. */
7053 if (current_function_decl
7054 && flag_new_inheriting_ctors
7055 && DECL_INHERITED_CTOR (current_function_decl))
7056 return expr;
7058 if (TREE_CODE (expr) == TARGET_EXPR
7059 && TARGET_EXPR_LIST_INIT_P (expr))
7060 /* Copy-list-initialization doesn't actually involve a copy. */
7061 return expr;
7063 /* Fall through. */
7064 case ck_base:
7065 if (convs->kind == ck_base && !convs->need_temporary_p)
7067 /* We are going to bind a reference directly to a base-class
7068 subobject of EXPR. */
7069 /* Build an expression for `*((base*) &expr)'. */
7070 expr = convert_to_base (expr, totype,
7071 !c_cast_p, /*nonnull=*/true, complain);
7072 return expr;
7075 /* Copy-initialization where the cv-unqualified version of the source
7076 type is the same class as, or a derived class of, the class of the
7077 destination [is treated as direct-initialization]. [dcl.init] */
7078 flags = LOOKUP_NORMAL;
7079 if (convs->user_conv_p)
7080 /* This conversion is being done in the context of a user-defined
7081 conversion (i.e. the second step of copy-initialization), so
7082 don't allow any more. */
7083 flags |= LOOKUP_NO_CONVERSION;
7084 else
7085 flags |= LOOKUP_ONLYCONVERTING;
7086 if (convs->rvaluedness_matches_p)
7087 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7088 flags |= LOOKUP_PREFER_RVALUE;
7089 expr = build_temp (expr, totype, flags, &diag_kind, complain);
7090 if (diag_kind && complain)
7092 auto_diagnostic_group d;
7093 maybe_print_user_conv_context (convs);
7094 if (fn)
7095 inform (DECL_SOURCE_LOCATION (fn),
7096 " initializing argument %P of %qD", argnum, fn);
7099 return build_cplus_new (totype, expr, complain);
7101 case ck_ref_bind:
7103 tree ref_type = totype;
7105 if (convs->bad_p && !next_conversion (convs)->bad_p)
7107 tree extype = TREE_TYPE (expr);
7108 auto_diagnostic_group d;
7109 if (TYPE_REF_IS_RVALUE (ref_type)
7110 && lvalue_p (expr))
7111 error_at (loc, "cannot bind rvalue reference of type %qH to "
7112 "lvalue of type %qI", totype, extype);
7113 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
7114 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
7115 error_at (loc, "cannot bind non-const lvalue reference of "
7116 "type %qH to an rvalue of type %qI", totype, extype);
7117 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
7118 error_at (loc, "binding reference of type %qH to %qI "
7119 "discards qualifiers", totype, extype);
7120 else
7121 gcc_unreachable ();
7122 maybe_print_user_conv_context (convs);
7123 if (fn)
7124 inform (DECL_SOURCE_LOCATION (fn),
7125 " initializing argument %P of %qD", argnum, fn);
7126 return error_mark_node;
7129 /* If necessary, create a temporary.
7131 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7132 that need temporaries, even when their types are reference
7133 compatible with the type of reference being bound, so the
7134 upcoming call to cp_build_addr_expr doesn't fail. */
7135 if (convs->need_temporary_p
7136 || TREE_CODE (expr) == CONSTRUCTOR
7137 || TREE_CODE (expr) == VA_ARG_EXPR)
7139 /* Otherwise, a temporary of type "cv1 T1" is created and
7140 initialized from the initializer expression using the rules
7141 for a non-reference copy-initialization (8.5). */
7143 tree type = TREE_TYPE (ref_type);
7144 cp_lvalue_kind lvalue = lvalue_kind (expr);
7146 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7147 (type, next_conversion (convs)->type));
7148 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
7149 && !TYPE_REF_IS_RVALUE (ref_type))
7151 /* If the reference is volatile or non-const, we
7152 cannot create a temporary. */
7153 if (lvalue & clk_bitfield)
7154 error_at (loc, "cannot bind bitfield %qE to %qT",
7155 expr, ref_type);
7156 else if (lvalue & clk_packed)
7157 error_at (loc, "cannot bind packed field %qE to %qT",
7158 expr, ref_type);
7159 else
7160 error_at (loc, "cannot bind rvalue %qE to %qT",
7161 expr, ref_type);
7162 return error_mark_node;
7164 /* If the source is a packed field, and we must use a copy
7165 constructor, then building the target expr will require
7166 binding the field to the reference parameter to the
7167 copy constructor, and we'll end up with an infinite
7168 loop. If we can use a bitwise copy, then we'll be
7169 OK. */
7170 if ((lvalue & clk_packed)
7171 && CLASS_TYPE_P (type)
7172 && type_has_nontrivial_copy_init (type))
7174 error_at (loc, "cannot bind packed field %qE to %qT",
7175 expr, ref_type);
7176 return error_mark_node;
7178 if (lvalue & clk_bitfield)
7180 expr = convert_bitfield_to_declared_type (expr);
7181 expr = fold_convert (type, expr);
7183 expr = build_target_expr_with_type (expr, type, complain);
7186 /* Take the address of the thing to which we will bind the
7187 reference. */
7188 expr = cp_build_addr_expr (expr, complain);
7189 if (expr == error_mark_node)
7190 return error_mark_node;
7192 /* Convert it to a pointer to the type referred to by the
7193 reference. This will adjust the pointer if a derived to
7194 base conversion is being performed. */
7195 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7196 expr, complain);
7197 /* Convert the pointer to the desired reference type. */
7198 return build_nop (ref_type, expr);
7201 case ck_lvalue:
7202 return decay_conversion (expr, complain);
7204 case ck_fnptr:
7205 /* ??? Should the address of a transaction-safe pointer point to the TM
7206 clone, and this conversion look up the primary function? */
7207 return build_nop (totype, expr);
7209 case ck_qual:
7210 /* Warn about deprecated conversion if appropriate. */
7211 string_conv_p (totype, expr, 1);
7212 break;
7214 case ck_ptr:
7215 if (convs->base_p)
7216 expr = convert_to_base (expr, totype, !c_cast_p,
7217 /*nonnull=*/false, complain);
7218 return build_nop (totype, expr);
7220 case ck_pmem:
7221 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7222 c_cast_p, complain);
7224 default:
7225 break;
7228 if (convs->check_narrowing
7229 && !check_narrowing (totype, expr, complain,
7230 convs->check_narrowing_const_only))
7231 return error_mark_node;
7233 warning_sentinel w (warn_zero_as_null_pointer_constant);
7234 if (issue_conversion_warnings)
7235 expr = cp_convert_and_check (totype, expr, complain);
7236 else
7237 expr = cp_convert (totype, expr, complain);
7239 return expr;
7242 /* ARG is being passed to a varargs function. Perform any conversions
7243 required. Return the converted value. */
7245 tree
7246 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7248 tree arg_type;
7249 location_t loc = cp_expr_loc_or_loc (arg, input_location);
7251 /* [expr.call]
7253 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7254 standard conversions are performed. */
7255 arg = decay_conversion (arg, complain);
7256 arg_type = TREE_TYPE (arg);
7257 /* [expr.call]
7259 If the argument has integral or enumeration type that is subject
7260 to the integral promotions (_conv.prom_), or a floating point
7261 type that is subject to the floating point promotion
7262 (_conv.fpprom_), the value of the argument is converted to the
7263 promoted type before the call. */
7264 if (TREE_CODE (arg_type) == REAL_TYPE
7265 && (TYPE_PRECISION (arg_type)
7266 < TYPE_PRECISION (double_type_node))
7267 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7269 if ((complain & tf_warning)
7270 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7271 warning_at (loc, OPT_Wdouble_promotion,
7272 "implicit conversion from %qH to %qI when passing "
7273 "argument to function",
7274 arg_type, double_type_node);
7275 arg = convert_to_real_nofold (double_type_node, arg);
7277 else if (NULLPTR_TYPE_P (arg_type))
7278 arg = null_pointer_node;
7279 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7281 if (SCOPED_ENUM_P (arg_type))
7283 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7284 complain);
7285 prom = cp_perform_integral_promotions (prom, complain);
7286 if (abi_version_crosses (6)
7287 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7288 && (complain & tf_warning))
7289 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7290 "%qT before -fabi-version=6, %qT after", arg_type,
7291 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7292 if (!abi_version_at_least (6))
7293 arg = prom;
7295 else
7296 arg = cp_perform_integral_promotions (arg, complain);
7299 arg = require_complete_type_sfinae (arg, complain);
7300 arg_type = TREE_TYPE (arg);
7302 if (arg != error_mark_node
7303 /* In a template (or ill-formed code), we can have an incomplete type
7304 even after require_complete_type_sfinae, in which case we don't know
7305 whether it has trivial copy or not. */
7306 && COMPLETE_TYPE_P (arg_type)
7307 && !cp_unevaluated_operand)
7309 /* [expr.call] 5.2.2/7:
7310 Passing a potentially-evaluated argument of class type (Clause 9)
7311 with a non-trivial copy constructor or a non-trivial destructor
7312 with no corresponding parameter is conditionally-supported, with
7313 implementation-defined semantics.
7315 We support it as pass-by-invisible-reference, just like a normal
7316 value parameter.
7318 If the call appears in the context of a sizeof expression,
7319 it is not potentially-evaluated. */
7320 if (type_has_nontrivial_copy_init (arg_type)
7321 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))
7323 arg = force_rvalue (arg, complain);
7324 if (complain & tf_warning)
7325 warning (OPT_Wconditionally_supported,
7326 "passing objects of non-trivially-copyable "
7327 "type %q#T through %<...%> is conditionally supported",
7328 arg_type);
7329 return build1 (ADDR_EXPR, build_reference_type (arg_type), arg);
7331 /* Build up a real lvalue-to-rvalue conversion in case the
7332 copy constructor is trivial but not callable. */
7333 else if (CLASS_TYPE_P (arg_type))
7334 force_rvalue (arg, complain);
7338 return arg;
7341 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7343 tree
7344 build_x_va_arg (source_location loc, tree expr, tree type)
7346 if (processing_template_decl)
7348 tree r = build_min (VA_ARG_EXPR, type, expr);
7349 SET_EXPR_LOCATION (r, loc);
7350 return r;
7353 type = complete_type_or_else (type, NULL_TREE);
7355 if (expr == error_mark_node || !type)
7356 return error_mark_node;
7358 expr = mark_lvalue_use (expr);
7360 if (TYPE_REF_P (type))
7362 error ("cannot receive reference type %qT through %<...%>", type);
7363 return error_mark_node;
7366 if (type_has_nontrivial_copy_init (type)
7367 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7369 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7370 it as pass by invisible reference. */
7371 warning_at (loc, OPT_Wconditionally_supported,
7372 "receiving objects of non-trivially-copyable type %q#T "
7373 "through %<...%> is conditionally-supported", type);
7375 tree ref = cp_build_reference_type (type, false);
7376 expr = build_va_arg (loc, expr, ref);
7377 return convert_from_reference (expr);
7380 tree ret = build_va_arg (loc, expr, type);
7381 if (CLASS_TYPE_P (type))
7382 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7383 know how to handle it. */
7384 ret = get_target_expr (ret);
7385 return ret;
7388 /* TYPE has been given to va_arg. Apply the default conversions which
7389 would have happened when passed via ellipsis. Return the promoted
7390 type, or the passed type if there is no change. */
7392 tree
7393 cxx_type_promotes_to (tree type)
7395 tree promote;
7397 /* Perform the array-to-pointer and function-to-pointer
7398 conversions. */
7399 type = type_decays_to (type);
7401 promote = type_promotes_to (type);
7402 if (same_type_p (type, promote))
7403 promote = type;
7405 return promote;
7408 /* ARG is a default argument expression being passed to a parameter of
7409 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7410 zero-based argument number. Do any required conversions. Return
7411 the converted value. */
7413 static GTY(()) vec<tree, va_gc> *default_arg_context;
7414 void
7415 push_defarg_context (tree fn)
7416 { vec_safe_push (default_arg_context, fn); }
7418 void
7419 pop_defarg_context (void)
7420 { default_arg_context->pop (); }
7422 tree
7423 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7424 tsubst_flags_t complain)
7426 int i;
7427 tree t;
7429 /* See through clones. */
7430 fn = DECL_ORIGIN (fn);
7431 /* And inheriting ctors. */
7432 if (flag_new_inheriting_ctors)
7433 fn = strip_inheriting_ctors (fn);
7435 /* Detect recursion. */
7436 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7437 if (t == fn)
7439 if (complain & tf_error)
7440 error ("recursive evaluation of default argument for %q#D", fn);
7441 return error_mark_node;
7444 /* If the ARG is an unparsed default argument expression, the
7445 conversion cannot be performed. */
7446 if (TREE_CODE (arg) == DEFAULT_ARG)
7448 if (complain & tf_error)
7449 error ("call to %qD uses the default argument for parameter %P, which "
7450 "is not yet defined", fn, parmnum);
7451 return error_mark_node;
7454 push_defarg_context (fn);
7456 if (fn && DECL_TEMPLATE_INFO (fn))
7457 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7459 /* Due to:
7461 [dcl.fct.default]
7463 The names in the expression are bound, and the semantic
7464 constraints are checked, at the point where the default
7465 expressions appears.
7467 we must not perform access checks here. */
7468 push_deferring_access_checks (dk_no_check);
7469 /* We must make a copy of ARG, in case subsequent processing
7470 alters any part of it. */
7471 arg = break_out_target_exprs (arg, /*clear location*/true);
7473 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7474 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7475 complain);
7476 arg = convert_for_arg_passing (type, arg, complain);
7477 pop_deferring_access_checks();
7479 pop_defarg_context ();
7481 return arg;
7484 /* Returns the type which will really be used for passing an argument of
7485 type TYPE. */
7487 tree
7488 type_passed_as (tree type)
7490 /* Pass classes with copy ctors by invisible reference. */
7491 if (TREE_ADDRESSABLE (type))
7493 type = build_reference_type (type);
7494 /* There are no other pointers to this temporary. */
7495 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7497 else if (targetm.calls.promote_prototypes (NULL_TREE)
7498 && INTEGRAL_TYPE_P (type)
7499 && COMPLETE_TYPE_P (type)
7500 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7501 type = integer_type_node;
7503 return type;
7506 /* Actually perform the appropriate conversion. */
7508 tree
7509 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7511 tree bitfield_type;
7513 /* If VAL is a bitfield, then -- since it has already been converted
7514 to TYPE -- it cannot have a precision greater than TYPE.
7516 If it has a smaller precision, we must widen it here. For
7517 example, passing "int f:3;" to a function expecting an "int" will
7518 not result in any conversion before this point.
7520 If the precision is the same we must not risk widening. For
7521 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7522 often have type "int", even though the C++ type for the field is
7523 "long long". If the value is being passed to a function
7524 expecting an "int", then no conversions will be required. But,
7525 if we call convert_bitfield_to_declared_type, the bitfield will
7526 be converted to "long long". */
7527 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7528 if (bitfield_type
7529 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7530 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7532 if (val == error_mark_node)
7534 /* Pass classes with copy ctors by invisible reference. */
7535 else if (TREE_ADDRESSABLE (type))
7536 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7537 else if (targetm.calls.promote_prototypes (NULL_TREE)
7538 && INTEGRAL_TYPE_P (type)
7539 && COMPLETE_TYPE_P (type)
7540 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7541 val = cp_perform_integral_promotions (val, complain);
7542 if (complain & tf_warning)
7544 if (warn_suggest_attribute_format)
7546 tree rhstype = TREE_TYPE (val);
7547 const enum tree_code coder = TREE_CODE (rhstype);
7548 const enum tree_code codel = TREE_CODE (type);
7549 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7550 && coder == codel
7551 && check_missing_format_attribute (type, rhstype))
7552 warning (OPT_Wsuggest_attribute_format,
7553 "argument of function call might be a candidate "
7554 "for a format attribute");
7556 maybe_warn_parm_abi (type, cp_expr_loc_or_loc (val, input_location));
7558 return val;
7561 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7562 which just decay_conversion or no conversions at all should be done.
7563 This is true for some builtins which don't act like normal functions.
7564 Return 2 if no conversions at all should be done, 1 if just
7565 decay_conversion. Return 3 for special treatment of the 3rd argument
7566 for __builtin_*_overflow_p. */
7569 magic_varargs_p (tree fn)
7571 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7572 switch (DECL_FUNCTION_CODE (fn))
7574 case BUILT_IN_CLASSIFY_TYPE:
7575 case BUILT_IN_CONSTANT_P:
7576 case BUILT_IN_NEXT_ARG:
7577 case BUILT_IN_VA_START:
7578 return 1;
7580 case BUILT_IN_ADD_OVERFLOW_P:
7581 case BUILT_IN_SUB_OVERFLOW_P:
7582 case BUILT_IN_MUL_OVERFLOW_P:
7583 return 3;
7585 default:;
7586 return lookup_attribute ("type generic",
7587 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7590 return 0;
7593 /* Returns the decl of the dispatcher function if FN is a function version. */
7595 tree
7596 get_function_version_dispatcher (tree fn)
7598 tree dispatcher_decl = NULL;
7600 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7601 && DECL_FUNCTION_VERSIONED (fn));
7603 gcc_assert (targetm.get_function_versions_dispatcher);
7604 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7606 if (dispatcher_decl == NULL)
7608 error_at (input_location, "use of multiversioned function "
7609 "without a default");
7610 return NULL;
7613 retrofit_lang_decl (dispatcher_decl);
7614 gcc_assert (dispatcher_decl != NULL);
7615 return dispatcher_decl;
7618 /* fn is a function version dispatcher that is marked used. Mark all the
7619 semantically identical function versions it will dispatch as used. */
7621 void
7622 mark_versions_used (tree fn)
7624 struct cgraph_node *node;
7625 struct cgraph_function_version_info *node_v;
7626 struct cgraph_function_version_info *it_v;
7628 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7630 node = cgraph_node::get (fn);
7631 if (node == NULL)
7632 return;
7634 gcc_assert (node->dispatcher_function);
7636 node_v = node->function_version ();
7637 if (node_v == NULL)
7638 return;
7640 /* All semantically identical versions are chained. Traverse and mark each
7641 one of them as used. */
7642 it_v = node_v->next;
7643 while (it_v != NULL)
7645 mark_used (it_v->this_node->decl);
7646 it_v = it_v->next;
7650 /* Build a call to "the copy constructor" for the type of A, even if it
7651 wouldn't be selected by normal overload resolution. Used for
7652 diagnostics. */
7654 static tree
7655 call_copy_ctor (tree a, tsubst_flags_t complain)
7657 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7658 tree binfo = TYPE_BINFO (ctype);
7659 tree copy = get_copy_ctor (ctype, complain);
7660 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7661 tree ob = build_dummy_object (ctype);
7662 vec<tree, va_gc>* args = make_tree_vector_single (a);
7663 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7664 LOOKUP_NORMAL, NULL, complain);
7665 release_tree_vector (args);
7666 return r;
7669 /* Return true iff T refers to a base field. */
7671 static bool
7672 is_base_field_ref (tree t)
7674 STRIP_NOPS (t);
7675 if (TREE_CODE (t) == ADDR_EXPR)
7676 t = TREE_OPERAND (t, 0);
7677 if (TREE_CODE (t) == COMPONENT_REF)
7678 t = TREE_OPERAND (t, 1);
7679 if (TREE_CODE (t) == FIELD_DECL)
7680 return DECL_FIELD_IS_BASE (t);
7681 return false;
7684 /* We can't elide a copy from a function returning by value to a base
7685 subobject, as the callee might clobber tail padding. Return true iff this
7686 could be that case. */
7688 static bool
7689 unsafe_copy_elision_p (tree target, tree exp)
7691 /* Copy elision only happens with a TARGET_EXPR. */
7692 if (TREE_CODE (exp) != TARGET_EXPR)
7693 return false;
7694 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7695 /* It's safe to elide the copy for a class with no tail padding. */
7696 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7697 return false;
7698 /* It's safe to elide the copy if we aren't initializing a base object. */
7699 if (!is_base_field_ref (target))
7700 return false;
7701 tree init = TARGET_EXPR_INITIAL (exp);
7702 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7703 while (TREE_CODE (init) == COMPOUND_EXPR)
7704 init = TREE_OPERAND (init, 1);
7705 if (TREE_CODE (init) == COND_EXPR)
7707 /* We'll end up copying from each of the arms of the COND_EXPR directly
7708 into the target, so look at them. */
7709 if (tree op = TREE_OPERAND (init, 1))
7710 if (unsafe_copy_elision_p (target, op))
7711 return true;
7712 return unsafe_copy_elision_p (target, TREE_OPERAND (init, 2));
7714 return (TREE_CODE (init) == AGGR_INIT_EXPR
7715 && !AGGR_INIT_VIA_CTOR_P (init));
7718 /* True iff C is a conversion that binds a reference to a prvalue. */
7720 static bool
7721 conv_binds_ref_to_prvalue (conversion *c)
7723 if (c->kind != ck_ref_bind)
7724 return false;
7725 if (c->need_temporary_p)
7726 return true;
7728 c = next_conversion (c);
7730 if (c->kind == ck_rvalue)
7731 return true;
7732 if (c->kind == ck_user && !TYPE_REF_P (c->type))
7733 return true;
7734 if (c->kind == ck_identity && c->u.expr
7735 && TREE_CODE (c->u.expr) == TARGET_EXPR)
7736 return true;
7738 return false;
7741 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7742 class type or a pointer to class type. */
7744 tree
7745 build_trivial_dtor_call (tree instance)
7747 gcc_assert (!is_dummy_object (instance));
7749 if (!flag_lifetime_dse)
7751 no_clobber:
7752 return fold_convert (void_type_node, instance);
7755 if (INDIRECT_TYPE_P (TREE_TYPE (instance)))
7757 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance))))
7758 goto no_clobber;
7759 instance = cp_build_fold_indirect_ref (instance);
7762 /* A trivial destructor should still clobber the object. */
7763 tree clobber = build_clobber (TREE_TYPE (instance));
7764 return build2 (MODIFY_EXPR, void_type_node,
7765 instance, clobber);
7768 /* Subroutine of the various build_*_call functions. Overload resolution
7769 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7770 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7771 bitmask of various LOOKUP_* flags which apply to the call itself. */
7773 static tree
7774 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7776 tree fn = cand->fn;
7777 const vec<tree, va_gc> *args = cand->args;
7778 tree first_arg = cand->first_arg;
7779 conversion **convs = cand->convs;
7780 conversion *conv;
7781 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7782 int parmlen;
7783 tree val;
7784 int i = 0;
7785 int j = 0;
7786 unsigned int arg_index = 0;
7787 int is_method = 0;
7788 int nargs;
7789 tree *argarray;
7790 bool already_used = false;
7792 /* In a template, there is no need to perform all of the work that
7793 is normally done. We are only interested in the type of the call
7794 expression, i.e., the return type of the function. Any semantic
7795 errors will be deferred until the template is instantiated. */
7796 if (processing_template_decl)
7798 tree expr, addr;
7799 tree return_type;
7800 const tree *argarray;
7801 unsigned int nargs;
7803 if (undeduced_auto_decl (fn))
7804 mark_used (fn, complain);
7805 else
7806 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7807 See PR80598. */
7808 TREE_USED (fn) = 1;
7810 return_type = TREE_TYPE (TREE_TYPE (fn));
7811 nargs = vec_safe_length (args);
7812 if (first_arg == NULL_TREE)
7813 argarray = args->address ();
7814 else
7816 tree *alcarray;
7817 unsigned int ix;
7818 tree arg;
7820 ++nargs;
7821 alcarray = XALLOCAVEC (tree, nargs);
7822 alcarray[0] = build_this (first_arg);
7823 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7824 alcarray[ix + 1] = arg;
7825 argarray = alcarray;
7828 addr = build_addr_func (fn, complain);
7829 if (addr == error_mark_node)
7830 return error_mark_node;
7831 expr = build_call_array_loc (input_location, return_type,
7832 addr, nargs, argarray);
7833 if (TREE_THIS_VOLATILE (fn) && cfun)
7834 current_function_returns_abnormally = 1;
7835 return convert_from_reference (expr);
7838 /* Give any warnings we noticed during overload resolution. */
7839 if (cand->warnings && (complain & tf_warning))
7841 struct candidate_warning *w;
7842 for (w = cand->warnings; w; w = w->next)
7843 joust (cand, w->loser, 1, complain);
7846 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7847 argument to the copy constructor ends up being a prvalue after
7848 conversion. Let's do the normal processing, but pretend we aren't
7849 actually using the copy constructor. */
7850 bool force_elide = false;
7851 if (cxx_dialect >= cxx17
7852 && cand->num_convs == 1
7853 && DECL_COMPLETE_CONSTRUCTOR_P (fn)
7854 && (DECL_COPY_CONSTRUCTOR_P (fn)
7855 || DECL_MOVE_CONSTRUCTOR_P (fn))
7856 && conv_binds_ref_to_prvalue (convs[0]))
7858 force_elide = true;
7859 goto not_really_used;
7862 /* OK, we're actually calling this inherited constructor; set its deletedness
7863 appropriately. We can get away with doing this here because calling is
7864 the only way to refer to a constructor. */
7865 if (DECL_INHERITED_CTOR (fn))
7866 deduce_inheriting_ctor (fn);
7868 /* Make =delete work with SFINAE. */
7869 if (DECL_DELETED_FN (fn))
7871 if (complain & tf_error)
7872 mark_used (fn);
7873 return error_mark_node;
7876 if (DECL_FUNCTION_MEMBER_P (fn))
7878 tree access_fn;
7879 /* If FN is a template function, two cases must be considered.
7880 For example:
7882 struct A {
7883 protected:
7884 template <class T> void f();
7886 template <class T> struct B {
7887 protected:
7888 void g();
7890 struct C : A, B<int> {
7891 using A::f; // #1
7892 using B<int>::g; // #2
7895 In case #1 where `A::f' is a member template, DECL_ACCESS is
7896 recorded in the primary template but not in its specialization.
7897 We check access of FN using its primary template.
7899 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7900 because it is a member of class template B, DECL_ACCESS is
7901 recorded in the specialization `B<int>::g'. We cannot use its
7902 primary template because `B<T>::g' and `B<int>::g' may have
7903 different access. */
7904 if (DECL_TEMPLATE_INFO (fn)
7905 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7906 access_fn = DECL_TI_TEMPLATE (fn);
7907 else
7908 access_fn = fn;
7909 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7910 fn, complain))
7911 return error_mark_node;
7914 /* If we're checking for implicit delete, don't bother with argument
7915 conversions. */
7916 if (flags & LOOKUP_SPECULATIVE)
7918 if (cand->viable == 1)
7919 return fn;
7920 else if (!(complain & tf_error))
7921 /* Reject bad conversions now. */
7922 return error_mark_node;
7923 /* else continue to get conversion error. */
7926 not_really_used:
7928 /* N3276 magic doesn't apply to nested calls. */
7929 tsubst_flags_t decltype_flag = (complain & tf_decltype);
7930 complain &= ~tf_decltype;
7931 /* No-Cleanup doesn't apply to nested calls either. */
7932 tsubst_flags_t no_cleanup_complain = complain;
7933 complain &= ~tf_no_cleanup;
7935 /* Find maximum size of vector to hold converted arguments. */
7936 parmlen = list_length (parm);
7937 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7938 if (parmlen > nargs)
7939 nargs = parmlen;
7940 argarray = XALLOCAVEC (tree, nargs);
7942 /* The implicit parameters to a constructor are not considered by overload
7943 resolution, and must be of the proper type. */
7944 if (DECL_CONSTRUCTOR_P (fn))
7946 tree object_arg;
7947 if (first_arg != NULL_TREE)
7949 object_arg = first_arg;
7950 first_arg = NULL_TREE;
7952 else
7954 object_arg = (*args)[arg_index];
7955 ++arg_index;
7957 argarray[j++] = build_this (object_arg);
7958 parm = TREE_CHAIN (parm);
7959 /* We should never try to call the abstract constructor. */
7960 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7962 if (DECL_HAS_VTT_PARM_P (fn))
7964 argarray[j++] = (*args)[arg_index];
7965 ++arg_index;
7966 parm = TREE_CHAIN (parm);
7969 if (flags & LOOKUP_PREFER_RVALUE)
7971 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7972 the first parameter of the selected constructor is not an rvalue
7973 reference to the object's type (possibly cv-qualified)...." */
7974 gcc_assert (!(complain & tf_error));
7975 tree ptype = convs[0]->type;
7976 if (!TYPE_REF_P (ptype)
7977 || !TYPE_REF_IS_RVALUE (ptype)
7978 || CONVERSION_RANK (convs[0]) > cr_exact)
7979 return error_mark_node;
7982 /* Bypass access control for 'this' parameter. */
7983 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7985 tree parmtype = TREE_VALUE (parm);
7986 tree arg = build_this (first_arg != NULL_TREE
7987 ? first_arg
7988 : (*args)[arg_index]);
7989 tree argtype = TREE_TYPE (arg);
7990 tree converted_arg;
7991 tree base_binfo;
7993 if (arg == error_mark_node)
7994 return error_mark_node;
7996 if (convs[i]->bad_p)
7998 if (complain & tf_error)
8000 auto_diagnostic_group d;
8001 if (permerror (input_location, "passing %qT as %<this%> "
8002 "argument discards qualifiers",
8003 TREE_TYPE (argtype)))
8004 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
8006 else
8007 return error_mark_node;
8010 /* See if the function member or the whole class type is declared
8011 final and the call can be devirtualized. */
8012 if (DECL_FINAL_P (fn)
8013 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
8014 flags |= LOOKUP_NONVIRTUAL;
8016 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8017 X is called for an object that is not of type X, or of a type
8018 derived from X, the behavior is undefined.
8020 So we can assume that anything passed as 'this' is non-null, and
8021 optimize accordingly. */
8022 gcc_assert (TYPE_PTR_P (parmtype));
8023 /* Convert to the base in which the function was declared. */
8024 gcc_assert (cand->conversion_path != NULL_TREE);
8025 converted_arg = build_base_path (PLUS_EXPR,
8026 arg,
8027 cand->conversion_path,
8028 1, complain);
8029 /* Check that the base class is accessible. */
8030 if (!accessible_base_p (TREE_TYPE (argtype),
8031 BINFO_TYPE (cand->conversion_path), true))
8033 if (complain & tf_error)
8034 error ("%qT is not an accessible base of %qT",
8035 BINFO_TYPE (cand->conversion_path),
8036 TREE_TYPE (argtype));
8037 else
8038 return error_mark_node;
8040 /* If fn was found by a using declaration, the conversion path
8041 will be to the derived class, not the base declaring fn. We
8042 must convert from derived to base. */
8043 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
8044 TREE_TYPE (parmtype), ba_unique,
8045 NULL, complain);
8046 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
8047 base_binfo, 1, complain);
8049 argarray[j++] = converted_arg;
8050 parm = TREE_CHAIN (parm);
8051 if (first_arg != NULL_TREE)
8052 first_arg = NULL_TREE;
8053 else
8054 ++arg_index;
8055 ++i;
8056 is_method = 1;
8059 gcc_assert (first_arg == NULL_TREE);
8060 for (; arg_index < vec_safe_length (args) && parm;
8061 parm = TREE_CHAIN (parm), ++arg_index, ++i)
8063 tree type = TREE_VALUE (parm);
8064 tree arg = (*args)[arg_index];
8065 bool conversion_warning = true;
8067 conv = convs[i];
8069 /* If the argument is NULL and used to (implicitly) instantiate a
8070 template function (and bind one of the template arguments to
8071 the type of 'long int'), we don't want to warn about passing NULL
8072 to non-pointer argument.
8073 For example, if we have this template function:
8075 template<typename T> void func(T x) {}
8077 we want to warn (when -Wconversion is enabled) in this case:
8079 void foo() {
8080 func<int>(NULL);
8083 but not in this case:
8085 void foo() {
8086 func(NULL);
8089 if (null_node_p (arg)
8090 && DECL_TEMPLATE_INFO (fn)
8091 && cand->template_decl
8092 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
8093 conversion_warning = false;
8095 /* Warn about initializer_list deduction that isn't currently in the
8096 working draft. */
8097 if (cxx_dialect > cxx98
8098 && flag_deduce_init_list
8099 && cand->template_decl
8100 && is_std_init_list (non_reference (type))
8101 && BRACE_ENCLOSED_INITIALIZER_P (arg))
8103 tree tmpl = TI_TEMPLATE (cand->template_decl);
8104 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
8105 tree patparm = get_pattern_parm (realparm, tmpl);
8106 tree pattype = TREE_TYPE (patparm);
8107 if (PACK_EXPANSION_P (pattype))
8108 pattype = PACK_EXPANSION_PATTERN (pattype);
8109 pattype = non_reference (pattype);
8111 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
8112 && (cand->explicit_targs == NULL_TREE
8113 || (TREE_VEC_LENGTH (cand->explicit_targs)
8114 <= TEMPLATE_TYPE_IDX (pattype))))
8116 pedwarn (input_location, 0, "deducing %qT as %qT",
8117 non_reference (TREE_TYPE (patparm)),
8118 non_reference (type));
8119 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
8120 " in call to %qD", cand->fn);
8121 pedwarn (input_location, 0,
8122 " (you can disable this with -fno-deduce-init-list)");
8126 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8127 knows not to allow any more UDCs. This needs to happen after we
8128 process cand->warnings. */
8129 if (flags & LOOKUP_NO_CONVERSION)
8130 conv->user_conv_p = true;
8132 tsubst_flags_t arg_complain = complain;
8133 if (!conversion_warning)
8134 arg_complain &= ~tf_warning;
8136 val = convert_like_with_context (conv, arg, fn, i - is_method,
8137 arg_complain);
8138 val = convert_for_arg_passing (type, val, arg_complain);
8140 if (val == error_mark_node)
8141 return error_mark_node;
8142 else
8143 argarray[j++] = val;
8146 /* Default arguments */
8147 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
8149 if (TREE_VALUE (parm) == error_mark_node)
8150 return error_mark_node;
8151 val = convert_default_arg (TREE_VALUE (parm),
8152 TREE_PURPOSE (parm),
8153 fn, i - is_method,
8154 complain);
8155 if (val == error_mark_node)
8156 return error_mark_node;
8157 argarray[j++] = val;
8160 /* Ellipsis */
8161 int magic = magic_varargs_p (fn);
8162 for (; arg_index < vec_safe_length (args); ++arg_index)
8164 tree a = (*args)[arg_index];
8165 if ((magic == 3 && arg_index == 2) || magic == 2)
8167 /* Do no conversions for certain magic varargs. */
8168 a = mark_type_use (a);
8169 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
8170 return error_mark_node;
8172 else if (magic != 0)
8173 /* For other magic varargs only do decay_conversion. */
8174 a = decay_conversion (a, complain);
8175 else if (DECL_CONSTRUCTOR_P (fn)
8176 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
8177 TREE_TYPE (a)))
8179 /* Avoid infinite recursion trying to call A(...). */
8180 if (complain & tf_error)
8181 /* Try to call the actual copy constructor for a good error. */
8182 call_copy_ctor (a, complain);
8183 return error_mark_node;
8185 else
8186 a = convert_arg_to_ellipsis (a, complain);
8187 if (a == error_mark_node)
8188 return error_mark_node;
8189 argarray[j++] = a;
8192 gcc_assert (j <= nargs);
8193 nargs = j;
8195 /* Avoid to do argument-transformation, if warnings for format, and for
8196 nonnull are disabled. Just in case that at least one of them is active
8197 the check_function_arguments function might warn about something. */
8199 bool warned_p = false;
8200 if (warn_nonnull
8201 || warn_format
8202 || warn_suggest_attribute_format
8203 || warn_restrict)
8205 tree *fargs = (!nargs ? argarray
8206 : (tree *) alloca (nargs * sizeof (tree)));
8207 for (j = 0; j < nargs; j++)
8209 /* For -Wformat undo the implicit passing by hidden reference
8210 done by convert_arg_to_ellipsis. */
8211 if (TREE_CODE (argarray[j]) == ADDR_EXPR
8212 && TYPE_REF_P (TREE_TYPE (argarray[j])))
8213 fargs[j] = TREE_OPERAND (argarray[j], 0);
8214 else
8215 fargs[j] = argarray[j];
8218 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
8219 nargs, fargs, NULL);
8222 if (DECL_INHERITED_CTOR (fn))
8224 /* Check for passing ellipsis arguments to an inherited constructor. We
8225 could handle this by open-coding the inherited constructor rather than
8226 defining it, but let's not bother now. */
8227 if (!cp_unevaluated_operand
8228 && cand->num_convs
8229 && cand->convs[cand->num_convs-1]->ellipsis_p)
8231 if (complain & tf_error)
8233 sorry ("passing arguments to ellipsis of inherited constructor "
8234 "%qD", cand->fn);
8235 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
8237 return error_mark_node;
8240 /* A base constructor inheriting from a virtual base doesn't get the
8241 inherited arguments, just this and __vtt. */
8242 if (ctor_omit_inherited_parms (fn))
8243 nargs = 2;
8246 /* Avoid actually calling copy constructors and copy assignment operators,
8247 if possible. */
8249 if (! flag_elide_constructors && !force_elide)
8250 /* Do things the hard way. */;
8251 else if (cand->num_convs == 1
8252 && (DECL_COPY_CONSTRUCTOR_P (fn)
8253 || DECL_MOVE_CONSTRUCTOR_P (fn))
8254 /* It's unsafe to elide the constructor when handling
8255 a noexcept-expression, it may evaluate to the wrong
8256 value (c++/53025). */
8257 && (force_elide || cp_noexcept_operand == 0))
8259 tree targ;
8260 tree arg = argarray[num_artificial_parms_for (fn)];
8261 tree fa;
8262 bool trivial = trivial_fn_p (fn);
8264 /* Pull out the real argument, disregarding const-correctness. */
8265 targ = arg;
8266 /* Strip the reference binding for the constructor parameter. */
8267 if (CONVERT_EXPR_P (targ)
8268 && TYPE_REF_P (TREE_TYPE (targ)))
8269 targ = TREE_OPERAND (targ, 0);
8270 /* But don't strip any other reference bindings; binding a temporary to a
8271 reference prevents copy elision. */
8272 while ((CONVERT_EXPR_P (targ)
8273 && !TYPE_REF_P (TREE_TYPE (targ)))
8274 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8275 targ = TREE_OPERAND (targ, 0);
8276 if (TREE_CODE (targ) == ADDR_EXPR)
8278 targ = TREE_OPERAND (targ, 0);
8279 if (!same_type_ignoring_top_level_qualifiers_p
8280 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8281 targ = NULL_TREE;
8283 else
8284 targ = NULL_TREE;
8286 if (targ)
8287 arg = targ;
8288 else
8289 arg = cp_build_fold_indirect_ref (arg);
8291 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8292 subobject. */
8293 if (CHECKING_P && cxx_dialect >= cxx17)
8294 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8295 || force_elide
8296 /* It's from binding the ref parm to a packed field. */
8297 || convs[0]->need_temporary_p
8298 || seen_error ()
8299 /* See unsafe_copy_elision_p. */
8300 || DECL_BASE_CONSTRUCTOR_P (fn));
8302 fa = argarray[0];
8303 bool unsafe = unsafe_copy_elision_p (fa, arg);
8304 bool eliding_temp = (TREE_CODE (arg) == TARGET_EXPR && !unsafe);
8306 /* [class.copy]: the copy constructor is implicitly defined even if the
8307 implementation elided its use. But don't warn about deprecation when
8308 eliding a temporary, as then no copy is actually performed. */
8309 warning_sentinel s (warn_deprecated_copy, eliding_temp);
8310 if (force_elide)
8311 /* The language says this isn't called. */;
8312 else if (!trivial)
8314 if (!mark_used (fn, complain) && !(complain & tf_error))
8315 return error_mark_node;
8316 already_used = true;
8318 else
8319 cp_warn_deprecated_use (fn, complain);
8321 /* If we're creating a temp and we already have one, don't create a
8322 new one. If we're not creating a temp but we get one, use
8323 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8324 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8325 temp or an INIT_EXPR otherwise. */
8326 if (is_dummy_object (fa))
8328 if (TREE_CODE (arg) == TARGET_EXPR)
8329 return arg;
8330 else if (trivial)
8331 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8333 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8334 && !unsafe)
8336 tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa));
8338 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8339 return val;
8342 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
8343 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)
8344 && trivial_fn_p (fn))
8346 tree to = cp_stabilize_reference
8347 (cp_build_fold_indirect_ref (argarray[0]));
8348 tree type = TREE_TYPE (to);
8349 tree as_base = CLASSTYPE_AS_BASE (type);
8350 tree arg = argarray[1];
8351 location_t loc = cp_expr_loc_or_loc (arg, input_location);
8353 if (is_really_empty_class (type))
8355 /* Avoid copying empty classes. */
8356 val = build2 (COMPOUND_EXPR, type, arg, to);
8357 TREE_NO_WARNING (val) = 1;
8359 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8361 if (is_std_init_list (type)
8362 && conv_binds_ref_to_prvalue (convs[1]))
8363 warning_at (loc, OPT_Winit_list_lifetime,
8364 "assignment from temporary initializer_list does not "
8365 "extend the lifetime of the underlying array");
8366 arg = cp_build_fold_indirect_ref (arg);
8367 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8369 else
8371 /* We must only copy the non-tail padding parts. */
8372 tree arg0, arg2, t;
8373 tree array_type, alias_set;
8375 arg2 = TYPE_SIZE_UNIT (as_base);
8376 arg0 = cp_build_addr_expr (to, complain);
8378 array_type = build_array_type (unsigned_char_type_node,
8379 build_index_type
8380 (size_binop (MINUS_EXPR,
8381 arg2, size_int (1))));
8382 alias_set = build_int_cst (build_pointer_type (type), 0);
8383 t = build2 (MODIFY_EXPR, void_type_node,
8384 build2 (MEM_REF, array_type, arg0, alias_set),
8385 build2 (MEM_REF, array_type, arg, alias_set));
8386 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8387 TREE_NO_WARNING (val) = 1;
8390 cp_warn_deprecated_use (fn, complain);
8392 return val;
8394 else if (trivial_fn_p (fn))
8396 if (DECL_DESTRUCTOR_P (fn))
8397 return build_trivial_dtor_call (argarray[0]);
8398 else if (default_ctor_p (fn))
8400 if (is_dummy_object (argarray[0]))
8401 return force_target_expr (DECL_CONTEXT (fn), void_node,
8402 no_cleanup_complain);
8403 else
8404 return cp_build_fold_indirect_ref (argarray[0]);
8408 gcc_assert (!force_elide);
8410 if (!already_used
8411 && !mark_used (fn, complain))
8412 return error_mark_node;
8414 /* Warn if the built-in writes to an object of a non-trivial type. */
8415 if (warn_class_memaccess
8416 && vec_safe_length (args) >= 2
8417 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
8418 maybe_warn_class_memaccess (input_location, fn, args);
8420 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
8422 tree t;
8423 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8424 DECL_CONTEXT (fn),
8425 ba_any, NULL, complain);
8426 gcc_assert (binfo && binfo != error_mark_node);
8428 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8429 complain);
8430 if (TREE_SIDE_EFFECTS (argarray[0]))
8431 argarray[0] = save_expr (argarray[0]);
8432 t = build_pointer_type (TREE_TYPE (fn));
8433 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8434 TREE_TYPE (fn) = t;
8436 else
8438 fn = build_addr_func (fn, complain);
8439 if (fn == error_mark_node)
8440 return error_mark_node;
8443 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8444 if (call == error_mark_node)
8445 return call;
8446 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8448 tree c = extract_call_expr (call);
8449 /* build_new_op_1 will clear this when appropriate. */
8450 CALL_EXPR_ORDERED_ARGS (c) = true;
8452 if (warned_p)
8454 tree c = extract_call_expr (call);
8455 if (TREE_CODE (c) == CALL_EXPR)
8456 TREE_NO_WARNING (c) = 1;
8458 return call;
8461 namespace
8464 /* Return the DECL of the first non-static subobject of class TYPE
8465 that satisfies the predicate PRED or null if none can be found. */
8467 template <class Predicate>
8468 tree
8469 first_non_static_field (tree type, Predicate pred)
8471 if (!type || !CLASS_TYPE_P (type))
8472 return NULL_TREE;
8474 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8476 if (TREE_CODE (field) != FIELD_DECL)
8477 continue;
8478 if (TREE_STATIC (field))
8479 continue;
8480 if (pred (field))
8481 return field;
8484 int i = 0;
8486 for (tree base_binfo, binfo = TYPE_BINFO (type);
8487 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8489 tree base = TREE_TYPE (base_binfo);
8490 if (pred (base))
8491 return base;
8492 if (tree field = first_non_static_field (base, pred))
8493 return field;
8496 return NULL_TREE;
8499 struct NonPublicField
8501 bool operator() (const_tree t)
8503 return DECL_P (t) && (TREE_PRIVATE (t) || TREE_PROTECTED (t));
8507 /* Return the DECL of the first non-public subobject of class TYPE
8508 or null if none can be found. */
8510 static inline tree
8511 first_non_public_field (tree type)
8513 return first_non_static_field (type, NonPublicField ());
8516 struct NonTrivialField
8518 bool operator() (const_tree t)
8520 return !trivial_type_p (DECL_P (t) ? TREE_TYPE (t) : t);
8524 /* Return the DECL of the first non-trivial subobject of class TYPE
8525 or null if none can be found. */
8527 static inline tree
8528 first_non_trivial_field (tree type)
8530 return first_non_static_field (type, NonTrivialField ());
8533 } /* unnamed namespace */
8535 /* Return true if all copy and move assignment operator overloads for
8536 class TYPE are trivial and at least one of them is not deleted and,
8537 when ACCESS is set, accessible. Return false otherwise. Set
8538 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8539 copy or move assignment. */
8541 static bool
8542 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8544 tree fns = get_class_binding (type, assign_op_identifier);
8545 bool all_trivial = true;
8547 /* Iterate over overloads of the assignment operator, checking
8548 accessible copy assignments for triviality. */
8550 for (ovl_iterator oi (fns); oi; ++oi)
8552 tree f = *oi;
8554 /* Skip operators that aren't copy assignments. */
8555 if (!copy_fn_p (f))
8556 continue;
8558 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8559 || accessible_p (TYPE_BINFO (type), f, true));
8561 /* Skip template assignment operators and deleted functions. */
8562 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8563 continue;
8565 if (accessible)
8566 *hasassign = true;
8568 if (!accessible || !trivial_fn_p (f))
8569 all_trivial = false;
8571 /* Break early when both properties have been determined. */
8572 if (*hasassign && !all_trivial)
8573 break;
8576 /* Return true if they're all trivial and one of the expressions
8577 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8578 tree ref = cp_build_reference_type (type, false);
8579 return (all_trivial
8580 && (is_trivially_xible (MODIFY_EXPR, type, type)
8581 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8584 /* Return true if all copy and move ctor overloads for class TYPE are
8585 trivial and at least one of them is not deleted and, when ACCESS is
8586 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8587 to true when the TYPE has a (not necessarily trivial) default and copy
8588 (or move) ctor, respectively. */
8590 static bool
8591 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8593 tree fns = get_class_binding (type, complete_ctor_identifier);
8594 bool all_trivial = true;
8596 for (ovl_iterator oi (fns); oi; ++oi)
8598 tree f = *oi;
8600 /* Skip template constructors. */
8601 if (TREE_CODE (f) != FUNCTION_DECL)
8602 continue;
8604 bool cpy_or_move_ctor_p = copy_fn_p (f);
8606 /* Skip ctors other than default, copy, and move. */
8607 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8608 continue;
8610 if (DECL_DELETED_FN (f))
8611 continue;
8613 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8614 || accessible_p (TYPE_BINFO (type), f, true));
8616 if (accessible)
8617 hasctor[cpy_or_move_ctor_p] = true;
8619 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8620 all_trivial = false;
8622 /* Break early when both properties have been determined. */
8623 if (hasctor[0] && hasctor[1] && !all_trivial)
8624 break;
8627 return all_trivial;
8630 /* Issue a warning on a call to the built-in function FNDECL if it is
8631 a raw memory write whose destination is not an object of (something
8632 like) trivial or standard layout type with a non-deleted assignment
8633 and copy ctor. Detects const correctness violations, corrupting
8634 references, virtual table pointers, and bypassing non-trivial
8635 assignments. */
8637 static void
8638 maybe_warn_class_memaccess (location_t loc, tree fndecl,
8639 const vec<tree, va_gc> *args)
8641 /* Except for bcopy where it's second, the destination pointer is
8642 the first argument for all functions handled here. Compute
8643 the index of the destination and source arguments. */
8644 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8645 unsigned srcidx = !dstidx;
8647 tree dest = (*args)[dstidx];
8648 if (!TREE_TYPE (dest) || !INDIRECT_TYPE_P (TREE_TYPE (dest)))
8649 return;
8651 tree srctype = NULL_TREE;
8653 /* Determine the type of the pointed-to object and whether it's
8654 a complete class type. */
8655 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8657 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8658 return;
8660 /* Check to see if the raw memory call is made by a non-static member
8661 function with THIS as the destination argument for the destination
8662 type. If so, and if the class has no non-trivial bases or members,
8663 be more permissive. */
8664 if (current_function_decl
8665 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl)
8666 && is_this_parameter (tree_strip_nop_conversions (dest)))
8668 tree ctx = DECL_CONTEXT (current_function_decl);
8669 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8670 tree binfo = TYPE_BINFO (ctx);
8672 if (special
8673 && !BINFO_VTABLE (binfo)
8674 && !first_non_trivial_field (desttype))
8675 return;
8678 /* True if the class is trivial. */
8679 bool trivial = trivial_type_p (desttype);
8681 /* Set to true if DESTYPE has an accessible copy assignment. */
8682 bool hasassign = false;
8683 /* True if all of the class' overloaded copy assignment operators
8684 are all trivial (and not deleted) and at least one of them is
8685 accessible. */
8686 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8688 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8689 respectively. */
8690 bool hasctors[2] = { false, false };
8692 /* True if all of the class' overloaded copy constructors are all
8693 trivial (and not deleted) and at least one of them is accessible. */
8694 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8696 /* Set FLD to the first private/protected member of the class. */
8697 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8699 /* The warning format string. */
8700 const char *warnfmt = NULL;
8701 /* A suggested alternative to offer instead of the raw memory call.
8702 Empty string when none can be come up with. */
8703 const char *suggest = "";
8704 bool warned = false;
8706 switch (DECL_FUNCTION_CODE (fndecl))
8708 case BUILT_IN_MEMSET:
8709 if (!integer_zerop (maybe_constant_value ((*args)[1])))
8711 /* Diagnose setting non-copy-assignable or non-trivial types,
8712 or types with a private member, to (potentially) non-zero
8713 bytes. Since the value of the bytes being written is unknown,
8714 suggest using assignment instead (if one exists). Also warn
8715 for writes into objects for which zero-initialization doesn't
8716 mean all bits clear (pointer-to-member data, where null is all
8717 bits set). Since the value being written is (most likely)
8718 non-zero, simply suggest assignment (but not copy assignment). */
8719 suggest = "; use assignment instead";
8720 if (!trivassign)
8721 warnfmt = G_("%qD writing to an object of type %#qT with "
8722 "no trivial copy-assignment");
8723 else if (!trivial)
8724 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8725 else if (fld)
8727 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8728 warned = warning_at (loc, OPT_Wclass_memaccess,
8729 "%qD writing to an object of type %#qT with "
8730 "%qs member %qD",
8731 fndecl, desttype, access, fld);
8733 else if (!zero_init_p (desttype))
8734 warnfmt = G_("%qD writing to an object of type %#qT containing "
8735 "a pointer to data member%s");
8737 break;
8739 /* Fall through. */
8741 case BUILT_IN_BZERO:
8742 /* Similarly to the above, diagnose clearing non-trivial or non-
8743 standard layout objects, or objects of types with no assignmenmt.
8744 Since the value being written is known to be zero, suggest either
8745 copy assignment, copy ctor, or default ctor as an alternative,
8746 depending on what's available. */
8748 if (hasassign && hasctors[0])
8749 suggest = G_("; use assignment or value-initialization instead");
8750 else if (hasassign)
8751 suggest = G_("; use assignment instead");
8752 else if (hasctors[0])
8753 suggest = G_("; use value-initialization instead");
8755 if (!trivassign)
8756 warnfmt = G_("%qD clearing an object of type %#qT with "
8757 "no trivial copy-assignment%s");
8758 else if (!trivial)
8759 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8760 else if (!zero_init_p (desttype))
8761 warnfmt = G_("%qD clearing an object of type %#qT containing "
8762 "a pointer-to-member%s");
8763 break;
8765 case BUILT_IN_BCOPY:
8766 case BUILT_IN_MEMCPY:
8767 case BUILT_IN_MEMMOVE:
8768 case BUILT_IN_MEMPCPY:
8769 /* Determine the type of the source object. */
8770 srctype = TREE_TYPE ((*args)[srcidx]);
8771 if (!srctype || !INDIRECT_TYPE_P (srctype))
8772 srctype = void_type_node;
8773 else
8774 srctype = TREE_TYPE (srctype);
8776 /* Since it's impossible to determine wheter the byte copy is
8777 being used in place of assignment to an existing object or
8778 as a substitute for initialization, assume it's the former.
8779 Determine the best alternative to use instead depending on
8780 what's not deleted. */
8781 if (hasassign && hasctors[1])
8782 suggest = G_("; use copy-assignment or copy-initialization instead");
8783 else if (hasassign)
8784 suggest = G_("; use copy-assignment instead");
8785 else if (hasctors[1])
8786 suggest = G_("; use copy-initialization instead");
8788 if (!trivassign)
8789 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8790 "copy-assignment%s");
8791 else if (!trivially_copyable_p (desttype))
8792 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8793 "type %#qT%s");
8794 else if (!trivcopy)
8795 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8797 else if (!trivial
8798 && !VOID_TYPE_P (srctype)
8799 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8800 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8801 srctype))
8803 /* Warn when copying into a non-trivial object from an object
8804 of a different type other than void or char. */
8805 warned = warning_at (loc, OPT_Wclass_memaccess,
8806 "%qD copying an object of non-trivial type "
8807 "%#qT from an array of %#qT",
8808 fndecl, desttype, srctype);
8810 else if (fld
8811 && !VOID_TYPE_P (srctype)
8812 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8813 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8814 srctype))
8816 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8817 warned = warning_at (loc, OPT_Wclass_memaccess,
8818 "%qD copying an object of type %#qT with "
8819 "%qs member %qD from an array of %#qT; use "
8820 "assignment or copy-initialization instead",
8821 fndecl, desttype, access, fld, srctype);
8823 else if (!trivial && vec_safe_length (args) > 2)
8825 tree sz = maybe_constant_value ((*args)[2]);
8826 if (!tree_fits_uhwi_p (sz))
8827 break;
8829 /* Finally, warn on partial copies. */
8830 unsigned HOST_WIDE_INT typesize
8831 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8832 if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize)
8833 warned = warning_at (loc, OPT_Wclass_memaccess,
8834 (typesize - partial > 1
8835 ? G_("%qD writing to an object of "
8836 "a non-trivial type %#qT leaves %wu "
8837 "bytes unchanged")
8838 : G_("%qD writing to an object of "
8839 "a non-trivial type %#qT leaves %wu "
8840 "byte unchanged")),
8841 fndecl, desttype, typesize - partial);
8843 break;
8845 case BUILT_IN_REALLOC:
8847 if (!trivially_copyable_p (desttype))
8848 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8849 "%#qT; use %<new%> and %<delete%> instead");
8850 else if (!trivcopy)
8851 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8852 "constructor; use %<new%> and %<delete%> instead");
8853 else if (!get_dtor (desttype, tf_none))
8854 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8855 "destructor");
8856 else if (!trivial)
8858 tree sz = maybe_constant_value ((*args)[1]);
8859 if (TREE_CODE (sz) == INTEGER_CST
8860 && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype)))
8861 /* Finally, warn on reallocation into insufficient space. */
8862 warned = warning_at (loc, OPT_Wclass_memaccess,
8863 "%qD moving an object of non-trivial type "
8864 "%#qT and size %E into a region of size %E",
8865 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8866 sz);
8868 break;
8870 default:
8871 return;
8874 if (warnfmt)
8876 if (suggest)
8877 warned = warning_at (loc, OPT_Wclass_memaccess,
8878 warnfmt, fndecl, desttype, suggest);
8879 else
8880 warned = warning_at (loc, OPT_Wclass_memaccess,
8881 warnfmt, fndecl, desttype);
8884 if (warned)
8885 inform (location_of (desttype), "%#qT declared here", desttype);
8888 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8889 This function performs no overload resolution, conversion, or other
8890 high-level operations. */
8892 tree
8893 build_cxx_call (tree fn, int nargs, tree *argarray,
8894 tsubst_flags_t complain)
8896 tree fndecl;
8898 /* Remember roughly where this call is. */
8899 location_t loc = cp_expr_loc_or_loc (fn, input_location);
8900 fn = build_call_a (fn, nargs, argarray);
8901 SET_EXPR_LOCATION (fn, loc);
8903 fndecl = get_callee_fndecl (fn);
8905 /* Check that arguments to builtin functions match the expectations. */
8906 if (fndecl
8907 && !processing_template_decl
8908 && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
8910 int i;
8912 /* We need to take care that values to BUILT_IN_NORMAL
8913 are reduced. */
8914 for (i = 0; i < nargs; i++)
8915 argarray[i] = maybe_constant_value (argarray[i]);
8917 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8918 nargs, argarray))
8919 return error_mark_node;
8922 if (VOID_TYPE_P (TREE_TYPE (fn)))
8923 return fn;
8925 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8926 function call is either the operand of a decltype-specifier or the
8927 right operand of a comma operator that is the operand of a
8928 decltype-specifier, a temporary object is not introduced for the
8929 prvalue. The type of the prvalue may be incomplete. */
8930 if (!(complain & tf_decltype))
8932 fn = require_complete_type_sfinae (fn, complain);
8933 if (fn == error_mark_node)
8934 return error_mark_node;
8936 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8938 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8939 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8942 return convert_from_reference (fn);
8945 /* Returns the value to use for the in-charge parameter when making a
8946 call to a function with the indicated NAME.
8948 FIXME:Can't we find a neater way to do this mapping? */
8950 tree
8951 in_charge_arg_for_name (tree name)
8953 if (IDENTIFIER_CTOR_P (name))
8955 if (name == complete_ctor_identifier)
8956 return integer_one_node;
8957 gcc_checking_assert (name == base_ctor_identifier);
8959 else
8961 if (name == complete_dtor_identifier)
8962 return integer_two_node;
8963 else if (name == deleting_dtor_identifier)
8964 return integer_three_node;
8965 gcc_checking_assert (name == base_dtor_identifier);
8968 return integer_zero_node;
8971 /* We've built up a constructor call RET. Complain if it delegates to the
8972 constructor we're currently compiling. */
8974 static void
8975 check_self_delegation (tree ret)
8977 if (TREE_CODE (ret) == TARGET_EXPR)
8978 ret = TARGET_EXPR_INITIAL (ret);
8979 tree fn = cp_get_callee_fndecl_nofold (ret);
8980 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8981 error ("constructor delegates to itself");
8984 /* Build a call to a constructor, destructor, or an assignment
8985 operator for INSTANCE, an expression with class type. NAME
8986 indicates the special member function to call; *ARGS are the
8987 arguments. ARGS may be NULL. This may change ARGS. BINFO
8988 indicates the base of INSTANCE that is to be passed as the `this'
8989 parameter to the member function called.
8991 FLAGS are the LOOKUP_* flags to use when processing the call.
8993 If NAME indicates a complete object constructor, INSTANCE may be
8994 NULL_TREE. In this case, the caller will call build_cplus_new to
8995 store the newly constructed object into a VAR_DECL. */
8997 tree
8998 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8999 tree binfo, int flags, tsubst_flags_t complain)
9001 tree fns;
9002 /* The type of the subobject to be constructed or destroyed. */
9003 tree class_type;
9004 vec<tree, va_gc> *allocated = NULL;
9005 tree ret;
9007 gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier);
9009 if (error_operand_p (instance))
9010 return error_mark_node;
9012 if (IDENTIFIER_DTOR_P (name))
9014 gcc_assert (args == NULL || vec_safe_is_empty (*args));
9015 if (!type_build_dtor_call (TREE_TYPE (instance)))
9016 /* Shortcut to avoid lazy destructor declaration. */
9017 return build_trivial_dtor_call (instance);
9020 if (TYPE_P (binfo))
9022 /* Resolve the name. */
9023 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
9024 return error_mark_node;
9026 binfo = TYPE_BINFO (binfo);
9029 gcc_assert (binfo != NULL_TREE);
9031 class_type = BINFO_TYPE (binfo);
9033 /* Handle the special case where INSTANCE is NULL_TREE. */
9034 if (name == complete_ctor_identifier && !instance)
9035 instance = build_dummy_object (class_type);
9036 else
9038 /* Convert to the base class, if necessary. */
9039 if (!same_type_ignoring_top_level_qualifiers_p
9040 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
9042 if (IDENTIFIER_CDTOR_P (name))
9043 /* For constructors and destructors, either the base is
9044 non-virtual, or it is virtual but we are doing the
9045 conversion from a constructor or destructor for the
9046 complete object. In either case, we can convert
9047 statically. */
9048 instance = convert_to_base_statically (instance, binfo);
9049 else
9051 /* However, for assignment operators, we must convert
9052 dynamically if the base is virtual. */
9053 gcc_checking_assert (name == assign_op_identifier);
9054 instance = build_base_path (PLUS_EXPR, instance,
9055 binfo, /*nonnull=*/1, complain);
9060 gcc_assert (instance != NULL_TREE);
9062 /* In C++17, "If the initializer expression is a prvalue and the
9063 cv-unqualified version of the source type is the same class as the class
9064 of the destination, the initializer expression is used to initialize the
9065 destination object." Handle that here to avoid doing overload
9066 resolution. */
9067 if (cxx_dialect >= cxx17
9068 && args && vec_safe_length (*args) == 1
9069 && name == complete_ctor_identifier)
9071 tree arg = (**args)[0];
9073 if (BRACE_ENCLOSED_INITIALIZER_P (arg)
9074 && !TYPE_HAS_LIST_CTOR (class_type)
9075 && CONSTRUCTOR_NELTS (arg) == 1)
9076 arg = CONSTRUCTOR_ELT (arg, 0)->value;
9078 if ((TREE_CODE (arg) == TARGET_EXPR
9079 || TREE_CODE (arg) == CONSTRUCTOR)
9080 && (same_type_ignoring_top_level_qualifiers_p
9081 (class_type, TREE_TYPE (arg))))
9083 if (is_dummy_object (instance))
9084 return arg;
9085 else if (TREE_CODE (arg) == TARGET_EXPR)
9086 TARGET_EXPR_DIRECT_INIT_P (arg) = true;
9088 if ((complain & tf_error)
9089 && (flags & LOOKUP_DELEGATING_CONS))
9090 check_self_delegation (arg);
9091 /* Avoid change of behavior on Wunused-var-2.C. */
9092 instance = mark_lvalue_use (instance);
9093 return build2 (INIT_EXPR, class_type, instance, arg);
9097 fns = lookup_fnfields (binfo, name, 1);
9099 /* When making a call to a constructor or destructor for a subobject
9100 that uses virtual base classes, pass down a pointer to a VTT for
9101 the subobject. */
9102 if ((name == base_ctor_identifier
9103 || name == base_dtor_identifier)
9104 && CLASSTYPE_VBASECLASSES (class_type))
9106 tree vtt;
9107 tree sub_vtt;
9109 /* If the current function is a complete object constructor
9110 or destructor, then we fetch the VTT directly.
9111 Otherwise, we look it up using the VTT we were given. */
9112 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
9113 vtt = decay_conversion (vtt, complain);
9114 if (vtt == error_mark_node)
9115 return error_mark_node;
9116 vtt = build_if_in_charge (vtt, current_vtt_parm);
9117 if (BINFO_SUBVTT_INDEX (binfo))
9118 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
9119 else
9120 sub_vtt = vtt;
9122 if (args == NULL)
9124 allocated = make_tree_vector ();
9125 args = &allocated;
9128 vec_safe_insert (*args, 0, sub_vtt);
9131 ret = build_new_method_call (instance, fns, args,
9132 TYPE_BINFO (BINFO_TYPE (binfo)),
9133 flags, /*fn=*/NULL,
9134 complain);
9136 if (allocated != NULL)
9137 release_tree_vector (allocated);
9139 if ((complain & tf_error)
9140 && (flags & LOOKUP_DELEGATING_CONS)
9141 && name == complete_ctor_identifier)
9142 check_self_delegation (ret);
9144 return ret;
9147 /* Return the NAME, as a C string. The NAME indicates a function that
9148 is a member of TYPE. *FREE_P is set to true if the caller must
9149 free the memory returned.
9151 Rather than go through all of this, we should simply set the names
9152 of constructors and destructors appropriately, and dispense with
9153 ctor_identifier, dtor_identifier, etc. */
9155 static char *
9156 name_as_c_string (tree name, tree type, bool *free_p)
9158 const char *pretty_name;
9160 /* Assume that we will not allocate memory. */
9161 *free_p = false;
9162 /* Constructors and destructors are special. */
9163 if (IDENTIFIER_CDTOR_P (name))
9165 pretty_name
9166 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
9167 /* For a destructor, add the '~'. */
9168 if (IDENTIFIER_DTOR_P (name))
9170 pretty_name = concat ("~", pretty_name, NULL);
9171 /* Remember that we need to free the memory allocated. */
9172 *free_p = true;
9175 else if (IDENTIFIER_CONV_OP_P (name))
9177 pretty_name = concat ("operator ",
9178 type_as_string_translate (TREE_TYPE (name),
9179 TFF_PLAIN_IDENTIFIER),
9180 NULL);
9181 /* Remember that we need to free the memory allocated. */
9182 *free_p = true;
9184 else
9185 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
9187 return CONST_CAST (char *, pretty_name);
9190 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9191 return NULL. */
9193 static z_candidate *
9194 single_z_candidate (z_candidate *candidates)
9196 if (candidates == NULL)
9197 return NULL;
9199 if (candidates->next)
9200 return NULL;
9202 return candidates;
9205 /* If CANDIDATE is invalid due to a bad argument type, return the
9206 pertinent conversion_info.
9208 Otherwise, return NULL. */
9210 static const conversion_info *
9211 maybe_get_bad_conversion_for_unmatched_call (const z_candidate *candidate)
9213 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9214 rejection_reason *r = candidate->reason;
9216 if (r == NULL)
9217 return NULL;
9219 switch (r->code)
9221 default:
9222 return NULL;
9224 case rr_arg_conversion:
9225 return &r->u.conversion;
9227 case rr_bad_arg_conversion:
9228 return &r->u.bad_conversion;
9232 /* Issue an error and note complaining about a bad argument type at a
9233 callsite with a single candidate FNDECL.
9235 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9236 case input_location is used).
9237 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9238 the formal parameter. */
9240 void
9241 complain_about_bad_argument (location_t arg_loc,
9242 tree from_type, tree to_type,
9243 tree fndecl, int parmnum)
9245 auto_diagnostic_group d;
9246 range_label_for_type_mismatch rhs_label (from_type, to_type);
9247 range_label *label = &rhs_label;
9248 if (arg_loc == UNKNOWN_LOCATION)
9250 arg_loc = input_location;
9251 label = NULL;
9253 gcc_rich_location richloc (arg_loc, label);
9254 error_at (&richloc,
9255 "cannot convert %qH to %qI",
9256 from_type, to_type);
9257 inform (get_fndecl_argument_location (fndecl, parmnum),
9258 " initializing argument %P of %qD", parmnum, fndecl);
9261 /* Subroutine of build_new_method_call_1, for where there are no viable
9262 candidates for the call. */
9264 static void
9265 complain_about_no_candidates_for_method_call (tree instance,
9266 z_candidate *candidates,
9267 tree explicit_targs,
9268 tree basetype,
9269 tree optype, tree name,
9270 bool skip_first_for_error,
9271 vec<tree, va_gc> *user_args)
9273 auto_diagnostic_group d;
9274 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9275 cxx_incomplete_type_error (instance, basetype);
9276 else if (optype)
9277 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9278 basetype, optype, build_tree_list_vec (user_args),
9279 TREE_TYPE (instance));
9280 else
9282 /* Special-case for when there's a single candidate that's failing
9283 due to a bad argument type. */
9284 if (z_candidate *candidate = single_z_candidate (candidates))
9285 if (const conversion_info *conv
9286 = maybe_get_bad_conversion_for_unmatched_call (candidate))
9288 complain_about_bad_argument (conv->loc,
9289 conv->from, conv->to_type,
9290 candidate->fn, conv->n_arg);
9291 return;
9294 tree arglist = build_tree_list_vec (user_args);
9295 tree errname = name;
9296 bool twiddle = false;
9297 if (IDENTIFIER_CDTOR_P (errname))
9299 twiddle = IDENTIFIER_DTOR_P (errname);
9300 errname = constructor_name (basetype);
9302 if (explicit_targs)
9303 errname = lookup_template_function (errname, explicit_targs);
9304 if (skip_first_for_error)
9305 arglist = TREE_CHAIN (arglist);
9306 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9307 basetype, &"~"[!twiddle], errname, arglist,
9308 TREE_TYPE (instance));
9310 print_z_candidates (location_of (name), candidates);
9313 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9314 be set, upon return, to the function called. ARGS may be NULL.
9315 This may change ARGS. */
9317 static tree
9318 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
9319 tree conversion_path, int flags,
9320 tree *fn_p, tsubst_flags_t complain)
9322 struct z_candidate *candidates = 0, *cand;
9323 tree explicit_targs = NULL_TREE;
9324 tree basetype = NULL_TREE;
9325 tree access_binfo, binfo;
9326 tree optype;
9327 tree first_mem_arg = NULL_TREE;
9328 tree name;
9329 bool skip_first_for_error;
9330 vec<tree, va_gc> *user_args;
9331 tree call;
9332 tree fn;
9333 int template_only = 0;
9334 bool any_viable_p;
9335 tree orig_instance;
9336 tree orig_fns;
9337 vec<tree, va_gc> *orig_args = NULL;
9338 void *p;
9340 gcc_assert (instance != NULL_TREE);
9342 /* We don't know what function we're going to call, yet. */
9343 if (fn_p)
9344 *fn_p = NULL_TREE;
9346 if (error_operand_p (instance)
9347 || !fns || error_operand_p (fns))
9348 return error_mark_node;
9350 if (!BASELINK_P (fns))
9352 if (complain & tf_error)
9353 error ("call to non-function %qD", fns);
9354 return error_mark_node;
9357 orig_instance = instance;
9358 orig_fns = fns;
9360 /* Dismantle the baselink to collect all the information we need. */
9361 if (!conversion_path)
9362 conversion_path = BASELINK_BINFO (fns);
9363 access_binfo = BASELINK_ACCESS_BINFO (fns);
9364 binfo = BASELINK_BINFO (fns);
9365 optype = BASELINK_OPTYPE (fns);
9366 fns = BASELINK_FUNCTIONS (fns);
9367 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
9369 explicit_targs = TREE_OPERAND (fns, 1);
9370 fns = TREE_OPERAND (fns, 0);
9371 template_only = 1;
9373 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
9374 || TREE_CODE (fns) == TEMPLATE_DECL
9375 || TREE_CODE (fns) == OVERLOAD);
9376 fn = OVL_FIRST (fns);
9377 name = DECL_NAME (fn);
9379 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
9380 gcc_assert (CLASS_TYPE_P (basetype));
9382 user_args = args == NULL ? NULL : *args;
9383 /* Under DR 147 A::A() is an invalid constructor call,
9384 not a functional cast. */
9385 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
9387 if (! (complain & tf_error))
9388 return error_mark_node;
9390 basetype = DECL_CONTEXT (fn);
9391 name = constructor_name (basetype);
9392 auto_diagnostic_group d;
9393 if (permerror (input_location,
9394 "cannot call constructor %<%T::%D%> directly",
9395 basetype, name))
9396 inform (input_location, "for a function-style cast, remove the "
9397 "redundant %<::%D%>", name);
9398 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9399 complain);
9400 return call;
9403 if (processing_template_decl)
9405 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
9406 instance = build_non_dependent_expr (instance);
9407 if (args != NULL)
9408 make_args_non_dependent (*args);
9411 /* Process the argument list. */
9412 if (args != NULL && *args != NULL)
9414 *args = resolve_args (*args, complain);
9415 if (*args == NULL)
9416 return error_mark_node;
9417 user_args = *args;
9420 /* Consider the object argument to be used even if we end up selecting a
9421 static member function. */
9422 instance = mark_type_use (instance);
9424 /* Figure out whether to skip the first argument for the error
9425 message we will display to users if an error occurs. We don't
9426 want to display any compiler-generated arguments. The "this"
9427 pointer hasn't been added yet. However, we must remove the VTT
9428 pointer if this is a call to a base-class constructor or
9429 destructor. */
9430 skip_first_for_error = false;
9431 if (IDENTIFIER_CDTOR_P (name))
9433 /* Callers should explicitly indicate whether they want to ctor
9434 the complete object or just the part without virtual bases. */
9435 gcc_assert (name != ctor_identifier);
9437 /* Remove the VTT pointer, if present. */
9438 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9439 && CLASSTYPE_VBASECLASSES (basetype))
9440 skip_first_for_error = true;
9442 /* It's OK to call destructors and constructors on cv-qualified
9443 objects. Therefore, convert the INSTANCE to the unqualified
9444 type, if necessary. */
9445 if (!same_type_p (basetype, TREE_TYPE (instance)))
9447 instance = build_this (instance);
9448 instance = build_nop (build_pointer_type (basetype), instance);
9449 instance = build_fold_indirect_ref (instance);
9452 else
9453 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9455 /* For the overload resolution we need to find the actual `this`
9456 that would be captured if the call turns out to be to a
9457 non-static member function. Do not actually capture it at this
9458 point. */
9459 if (DECL_CONSTRUCTOR_P (fn))
9460 /* Constructors don't use the enclosing 'this'. */
9461 first_mem_arg = instance;
9462 else
9463 first_mem_arg = maybe_resolve_dummy (instance, false);
9465 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9466 p = conversion_obstack_alloc (0);
9468 /* The number of arguments artificial parms in ARGS; we subtract one because
9469 there's no 'this' in ARGS. */
9470 unsigned skip = num_artificial_parms_for (fn) - 1;
9472 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9473 initializer, not T({ }). */
9474 if (DECL_CONSTRUCTOR_P (fn)
9475 && vec_safe_length (user_args) > skip
9476 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9478 tree init_list = (*user_args)[skip];
9479 tree init = NULL_TREE;
9481 gcc_assert (user_args->length () == skip + 1
9482 && !(flags & LOOKUP_ONLYCONVERTING));
9484 /* If the initializer list has no elements and T is a class type with
9485 a default constructor, the object is value-initialized. Handle
9486 this here so we don't need to handle it wherever we use
9487 build_special_member_call. */
9488 if (CONSTRUCTOR_NELTS (init_list) == 0
9489 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9490 /* For a user-provided default constructor, use the normal
9491 mechanisms so that protected access works. */
9492 && type_has_non_user_provided_default_constructor (basetype)
9493 && !processing_template_decl)
9494 init = build_value_init (basetype, complain);
9496 /* If BASETYPE is an aggregate, we need to do aggregate
9497 initialization. */
9498 else if (CP_AGGREGATE_TYPE_P (basetype))
9500 init = reshape_init (basetype, init_list, complain);
9501 init = digest_init (basetype, init, complain);
9504 if (init)
9506 if (is_dummy_object (instance))
9507 return get_target_expr_sfinae (init, complain);
9508 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9509 TREE_SIDE_EFFECTS (init) = true;
9510 return init;
9513 /* Otherwise go ahead with overload resolution. */
9514 add_list_candidates (fns, first_mem_arg, user_args,
9515 basetype, explicit_targs, template_only,
9516 conversion_path, access_binfo, flags,
9517 &candidates, complain);
9519 else
9520 add_candidates (fns, first_mem_arg, user_args, optype,
9521 explicit_targs, template_only, conversion_path,
9522 access_binfo, flags, &candidates, complain);
9524 any_viable_p = false;
9525 candidates = splice_viable (candidates, false, &any_viable_p);
9527 if (!any_viable_p)
9529 if (complain & tf_error)
9530 complain_about_no_candidates_for_method_call (instance, candidates,
9531 explicit_targs, basetype,
9532 optype, name,
9533 skip_first_for_error,
9534 user_args);
9535 call = error_mark_node;
9537 else
9539 cand = tourney (candidates, complain);
9540 if (cand == 0)
9542 char *pretty_name;
9543 bool free_p;
9544 tree arglist;
9546 if (complain & tf_error)
9548 pretty_name = name_as_c_string (name, basetype, &free_p);
9549 arglist = build_tree_list_vec (user_args);
9550 if (skip_first_for_error)
9551 arglist = TREE_CHAIN (arglist);
9552 auto_diagnostic_group d;
9553 if (!any_strictly_viable (candidates))
9554 error ("no matching function for call to %<%s(%A)%>",
9555 pretty_name, arglist);
9556 else
9557 error ("call of overloaded %<%s(%A)%> is ambiguous",
9558 pretty_name, arglist);
9559 print_z_candidates (location_of (name), candidates);
9560 if (free_p)
9561 free (pretty_name);
9563 call = error_mark_node;
9565 else
9567 fn = cand->fn;
9568 call = NULL_TREE;
9570 if (!(flags & LOOKUP_NONVIRTUAL)
9571 && DECL_PURE_VIRTUAL_P (fn)
9572 && instance == current_class_ref
9573 && (complain & tf_warning))
9575 /* This is not an error, it is runtime undefined
9576 behavior. */
9577 if (!current_function_decl)
9578 warning (0, "pure virtual %q#D called from "
9579 "non-static data member initializer", fn);
9580 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9581 || DECL_DESTRUCTOR_P (current_function_decl))
9582 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9583 ? G_("pure virtual %q#D called from constructor")
9584 : G_("pure virtual %q#D called from destructor")),
9585 fn);
9588 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9589 && !DECL_CONSTRUCTOR_P (fn)
9590 && is_dummy_object (instance))
9592 instance = maybe_resolve_dummy (instance, true);
9593 if (instance == error_mark_node)
9594 call = error_mark_node;
9595 else if (!is_dummy_object (instance))
9597 /* We captured 'this' in the current lambda now that
9598 we know we really need it. */
9599 cand->first_arg = instance;
9601 else if (any_dependent_bases_p ())
9602 /* We can't tell until instantiation time whether we can use
9603 *this as the implicit object argument. */;
9604 else
9606 if (complain & tf_error)
9607 error ("cannot call member function %qD without object",
9608 fn);
9609 call = error_mark_node;
9613 if (call != error_mark_node)
9615 /* Optimize away vtable lookup if we know that this
9616 function can't be overridden. We need to check if
9617 the context and the type where we found fn are the same,
9618 actually FN might be defined in a different class
9619 type because of a using-declaration. In this case, we
9620 do not want to perform a non-virtual call. */
9621 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9622 && same_type_ignoring_top_level_qualifiers_p
9623 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9624 && resolves_to_fixed_type_p (instance, 0))
9625 flags |= LOOKUP_NONVIRTUAL;
9626 if (explicit_targs)
9627 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9628 /* Now we know what function is being called. */
9629 if (fn_p)
9630 *fn_p = fn;
9631 /* Build the actual CALL_EXPR. */
9632 call = build_over_call (cand, flags, complain);
9633 /* In an expression of the form `a->f()' where `f' turns
9634 out to be a static member function, `a' is
9635 none-the-less evaluated. */
9636 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9637 && !is_dummy_object (instance)
9638 && TREE_SIDE_EFFECTS (instance))
9640 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9641 is volatile. */
9642 tree a = instance;
9643 if (TREE_THIS_VOLATILE (a))
9644 a = build_this (a);
9645 call = build2 (COMPOUND_EXPR, TREE_TYPE (call), a, call);
9647 else if (call != error_mark_node
9648 && DECL_DESTRUCTOR_P (cand->fn)
9649 && !VOID_TYPE_P (TREE_TYPE (call)))
9650 /* An explicit call of the form "x->~X()" has type
9651 "void". However, on platforms where destructors
9652 return "this" (i.e., those where
9653 targetm.cxx.cdtor_returns_this is true), such calls
9654 will appear to have a return value of pointer type
9655 to the low-level call machinery. We do not want to
9656 change the low-level machinery, since we want to be
9657 able to optimize "delete f()" on such platforms as
9658 "operator delete(~X(f()))" (rather than generating
9659 "t = f(), ~X(t), operator delete (t)"). */
9660 call = build_nop (void_type_node, call);
9665 if (processing_template_decl && call != error_mark_node)
9667 bool cast_to_void = false;
9669 if (TREE_CODE (call) == COMPOUND_EXPR)
9670 call = TREE_OPERAND (call, 1);
9671 else if (TREE_CODE (call) == NOP_EXPR)
9673 cast_to_void = true;
9674 call = TREE_OPERAND (call, 0);
9676 if (INDIRECT_REF_P (call))
9677 call = TREE_OPERAND (call, 0);
9678 call = (build_min_non_dep_call_vec
9679 (call,
9680 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9681 orig_instance, orig_fns, NULL_TREE),
9682 orig_args));
9683 SET_EXPR_LOCATION (call, input_location);
9684 call = convert_from_reference (call);
9685 if (cast_to_void)
9686 call = build_nop (void_type_node, call);
9689 /* Free all the conversions we allocated. */
9690 obstack_free (&conversion_obstack, p);
9692 if (orig_args != NULL)
9693 release_tree_vector (orig_args);
9695 return call;
9698 /* Wrapper for above. */
9700 tree
9701 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9702 tree conversion_path, int flags,
9703 tree *fn_p, tsubst_flags_t complain)
9705 tree ret;
9706 bool subtime = timevar_cond_start (TV_OVERLOAD);
9707 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9708 fn_p, complain);
9709 timevar_cond_stop (TV_OVERLOAD, subtime);
9710 return ret;
9713 /* Returns true iff standard conversion sequence ICS1 is a proper
9714 subsequence of ICS2. */
9716 static bool
9717 is_subseq (conversion *ics1, conversion *ics2)
9719 /* We can assume that a conversion of the same code
9720 between the same types indicates a subsequence since we only get
9721 here if the types we are converting from are the same. */
9723 while (ics1->kind == ck_rvalue
9724 || ics1->kind == ck_lvalue)
9725 ics1 = next_conversion (ics1);
9727 while (1)
9729 while (ics2->kind == ck_rvalue
9730 || ics2->kind == ck_lvalue)
9731 ics2 = next_conversion (ics2);
9733 if (ics2->kind == ck_user
9734 || ics2->kind == ck_ambig
9735 || ics2->kind == ck_aggr
9736 || ics2->kind == ck_list
9737 || ics2->kind == ck_identity)
9738 /* At this point, ICS1 cannot be a proper subsequence of
9739 ICS2. We can get a USER_CONV when we are comparing the
9740 second standard conversion sequence of two user conversion
9741 sequences. */
9742 return false;
9744 ics2 = next_conversion (ics2);
9746 while (ics2->kind == ck_rvalue
9747 || ics2->kind == ck_lvalue)
9748 ics2 = next_conversion (ics2);
9750 if (ics2->kind == ics1->kind
9751 && same_type_p (ics2->type, ics1->type)
9752 && (ics1->kind == ck_identity
9753 || same_type_p (next_conversion (ics2)->type,
9754 next_conversion (ics1)->type)))
9755 return true;
9759 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9760 be any _TYPE nodes. */
9762 bool
9763 is_properly_derived_from (tree derived, tree base)
9765 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9766 return false;
9768 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9769 considers every class derived from itself. */
9770 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9771 && DERIVED_FROM_P (base, derived));
9774 /* We build the ICS for an implicit object parameter as a pointer
9775 conversion sequence. However, such a sequence should be compared
9776 as if it were a reference conversion sequence. If ICS is the
9777 implicit conversion sequence for an implicit object parameter,
9778 modify it accordingly. */
9780 static void
9781 maybe_handle_implicit_object (conversion **ics)
9783 if ((*ics)->this_p)
9785 /* [over.match.funcs]
9787 For non-static member functions, the type of the
9788 implicit object parameter is "reference to cv X"
9789 where X is the class of which the function is a
9790 member and cv is the cv-qualification on the member
9791 function declaration. */
9792 conversion *t = *ics;
9793 tree reference_type;
9795 /* The `this' parameter is a pointer to a class type. Make the
9796 implicit conversion talk about a reference to that same class
9797 type. */
9798 reference_type = TREE_TYPE (t->type);
9799 reference_type = build_reference_type (reference_type);
9801 if (t->kind == ck_qual)
9802 t = next_conversion (t);
9803 if (t->kind == ck_ptr)
9804 t = next_conversion (t);
9805 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9806 t = direct_reference_binding (reference_type, t);
9807 t->this_p = 1;
9808 t->rvaluedness_matches_p = 0;
9809 *ics = t;
9813 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9814 and return the initial reference binding conversion. Otherwise,
9815 leave *ICS unchanged and return NULL. */
9817 static conversion *
9818 maybe_handle_ref_bind (conversion **ics)
9820 if ((*ics)->kind == ck_ref_bind)
9822 conversion *old_ics = *ics;
9823 *ics = next_conversion (old_ics);
9824 (*ics)->user_conv_p = old_ics->user_conv_p;
9825 return old_ics;
9828 return NULL;
9831 /* Compare two implicit conversion sequences according to the rules set out in
9832 [over.ics.rank]. Return values:
9834 1: ics1 is better than ics2
9835 -1: ics2 is better than ics1
9836 0: ics1 and ics2 are indistinguishable */
9838 static int
9839 compare_ics (conversion *ics1, conversion *ics2)
9841 tree from_type1;
9842 tree from_type2;
9843 tree to_type1;
9844 tree to_type2;
9845 tree deref_from_type1 = NULL_TREE;
9846 tree deref_from_type2 = NULL_TREE;
9847 tree deref_to_type1 = NULL_TREE;
9848 tree deref_to_type2 = NULL_TREE;
9849 conversion_rank rank1, rank2;
9851 /* REF_BINDING is nonzero if the result of the conversion sequence
9852 is a reference type. In that case REF_CONV is the reference
9853 binding conversion. */
9854 conversion *ref_conv1;
9855 conversion *ref_conv2;
9857 /* Compare badness before stripping the reference conversion. */
9858 if (ics1->bad_p > ics2->bad_p)
9859 return -1;
9860 else if (ics1->bad_p < ics2->bad_p)
9861 return 1;
9863 /* Handle implicit object parameters. */
9864 maybe_handle_implicit_object (&ics1);
9865 maybe_handle_implicit_object (&ics2);
9867 /* Handle reference parameters. */
9868 ref_conv1 = maybe_handle_ref_bind (&ics1);
9869 ref_conv2 = maybe_handle_ref_bind (&ics2);
9871 /* List-initialization sequence L1 is a better conversion sequence than
9872 list-initialization sequence L2 if L1 converts to
9873 std::initializer_list<X> for some X and L2 does not. */
9874 if (ics1->kind == ck_list && ics2->kind != ck_list)
9875 return 1;
9876 if (ics2->kind == ck_list && ics1->kind != ck_list)
9877 return -1;
9879 /* [over.ics.rank]
9881 When comparing the basic forms of implicit conversion sequences (as
9882 defined in _over.best.ics_)
9884 --a standard conversion sequence (_over.ics.scs_) is a better
9885 conversion sequence than a user-defined conversion sequence
9886 or an ellipsis conversion sequence, and
9888 --a user-defined conversion sequence (_over.ics.user_) is a
9889 better conversion sequence than an ellipsis conversion sequence
9890 (_over.ics.ellipsis_). */
9891 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9892 mismatch. If both ICS are bad, we try to make a decision based on
9893 what would have happened if they'd been good. This is not an
9894 extension, we'll still give an error when we build up the call; this
9895 just helps us give a more helpful error message. */
9896 rank1 = BAD_CONVERSION_RANK (ics1);
9897 rank2 = BAD_CONVERSION_RANK (ics2);
9899 if (rank1 > rank2)
9900 return -1;
9901 else if (rank1 < rank2)
9902 return 1;
9904 if (ics1->ellipsis_p)
9905 /* Both conversions are ellipsis conversions. */
9906 return 0;
9908 /* User-defined conversion sequence U1 is a better conversion sequence
9909 than another user-defined conversion sequence U2 if they contain the
9910 same user-defined conversion operator or constructor and if the sec-
9911 ond standard conversion sequence of U1 is better than the second
9912 standard conversion sequence of U2. */
9914 /* Handle list-conversion with the same code even though it isn't always
9915 ranked as a user-defined conversion and it doesn't have a second
9916 standard conversion sequence; it will still have the desired effect.
9917 Specifically, we need to do the reference binding comparison at the
9918 end of this function. */
9920 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9922 conversion *t1;
9923 conversion *t2;
9925 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9926 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9927 || t1->kind == ck_list)
9928 break;
9929 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9930 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9931 || t2->kind == ck_list)
9932 break;
9934 if (t1->kind != t2->kind)
9935 return 0;
9936 else if (t1->kind == ck_user)
9938 tree f1 = t1->cand ? t1->cand->fn : t1->type;
9939 tree f2 = t2->cand ? t2->cand->fn : t2->type;
9940 if (f1 != f2)
9941 return 0;
9943 else
9945 /* For ambiguous or aggregate conversions, use the target type as
9946 a proxy for the conversion function. */
9947 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9948 return 0;
9951 /* We can just fall through here, after setting up
9952 FROM_TYPE1 and FROM_TYPE2. */
9953 from_type1 = t1->type;
9954 from_type2 = t2->type;
9956 else
9958 conversion *t1;
9959 conversion *t2;
9961 /* We're dealing with two standard conversion sequences.
9963 [over.ics.rank]
9965 Standard conversion sequence S1 is a better conversion
9966 sequence than standard conversion sequence S2 if
9968 --S1 is a proper subsequence of S2 (comparing the conversion
9969 sequences in the canonical form defined by _over.ics.scs_,
9970 excluding any Lvalue Transformation; the identity
9971 conversion sequence is considered to be a subsequence of
9972 any non-identity conversion sequence */
9974 t1 = ics1;
9975 while (t1->kind != ck_identity)
9976 t1 = next_conversion (t1);
9977 from_type1 = t1->type;
9979 t2 = ics2;
9980 while (t2->kind != ck_identity)
9981 t2 = next_conversion (t2);
9982 from_type2 = t2->type;
9985 /* One sequence can only be a subsequence of the other if they start with
9986 the same type. They can start with different types when comparing the
9987 second standard conversion sequence in two user-defined conversion
9988 sequences. */
9989 if (same_type_p (from_type1, from_type2))
9991 if (is_subseq (ics1, ics2))
9992 return 1;
9993 if (is_subseq (ics2, ics1))
9994 return -1;
9997 /* [over.ics.rank]
9999 Or, if not that,
10001 --the rank of S1 is better than the rank of S2 (by the rules
10002 defined below):
10004 Standard conversion sequences are ordered by their ranks: an Exact
10005 Match is a better conversion than a Promotion, which is a better
10006 conversion than a Conversion.
10008 Two conversion sequences with the same rank are indistinguishable
10009 unless one of the following rules applies:
10011 --A conversion that does not a convert a pointer, pointer to member,
10012 or std::nullptr_t to bool is better than one that does.
10014 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10015 so that we do not have to check it explicitly. */
10016 if (ics1->rank < ics2->rank)
10017 return 1;
10018 else if (ics2->rank < ics1->rank)
10019 return -1;
10021 to_type1 = ics1->type;
10022 to_type2 = ics2->type;
10024 /* A conversion from scalar arithmetic type to complex is worse than a
10025 conversion between scalar arithmetic types. */
10026 if (same_type_p (from_type1, from_type2)
10027 && ARITHMETIC_TYPE_P (from_type1)
10028 && ARITHMETIC_TYPE_P (to_type1)
10029 && ARITHMETIC_TYPE_P (to_type2)
10030 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
10031 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
10033 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
10034 return -1;
10035 else
10036 return 1;
10039 if (TYPE_PTR_P (from_type1)
10040 && TYPE_PTR_P (from_type2)
10041 && TYPE_PTR_P (to_type1)
10042 && TYPE_PTR_P (to_type2))
10044 deref_from_type1 = TREE_TYPE (from_type1);
10045 deref_from_type2 = TREE_TYPE (from_type2);
10046 deref_to_type1 = TREE_TYPE (to_type1);
10047 deref_to_type2 = TREE_TYPE (to_type2);
10049 /* The rules for pointers to members A::* are just like the rules
10050 for pointers A*, except opposite: if B is derived from A then
10051 A::* converts to B::*, not vice versa. For that reason, we
10052 switch the from_ and to_ variables here. */
10053 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
10054 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
10055 || (TYPE_PTRMEMFUNC_P (from_type1)
10056 && TYPE_PTRMEMFUNC_P (from_type2)
10057 && TYPE_PTRMEMFUNC_P (to_type1)
10058 && TYPE_PTRMEMFUNC_P (to_type2)))
10060 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
10061 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
10062 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
10063 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
10066 if (deref_from_type1 != NULL_TREE
10067 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
10068 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
10070 /* This was one of the pointer or pointer-like conversions.
10072 [over.ics.rank]
10074 --If class B is derived directly or indirectly from class A,
10075 conversion of B* to A* is better than conversion of B* to
10076 void*, and conversion of A* to void* is better than
10077 conversion of B* to void*. */
10078 if (VOID_TYPE_P (deref_to_type1)
10079 && VOID_TYPE_P (deref_to_type2))
10081 if (is_properly_derived_from (deref_from_type1,
10082 deref_from_type2))
10083 return -1;
10084 else if (is_properly_derived_from (deref_from_type2,
10085 deref_from_type1))
10086 return 1;
10088 else if (VOID_TYPE_P (deref_to_type1)
10089 || VOID_TYPE_P (deref_to_type2))
10091 if (same_type_p (deref_from_type1, deref_from_type2))
10093 if (VOID_TYPE_P (deref_to_type2))
10095 if (is_properly_derived_from (deref_from_type1,
10096 deref_to_type1))
10097 return 1;
10099 /* We know that DEREF_TO_TYPE1 is `void' here. */
10100 else if (is_properly_derived_from (deref_from_type1,
10101 deref_to_type2))
10102 return -1;
10105 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
10106 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
10108 /* [over.ics.rank]
10110 --If class B is derived directly or indirectly from class A
10111 and class C is derived directly or indirectly from B,
10113 --conversion of C* to B* is better than conversion of C* to
10116 --conversion of B* to A* is better than conversion of C* to
10117 A* */
10118 if (same_type_p (deref_from_type1, deref_from_type2))
10120 if (is_properly_derived_from (deref_to_type1,
10121 deref_to_type2))
10122 return 1;
10123 else if (is_properly_derived_from (deref_to_type2,
10124 deref_to_type1))
10125 return -1;
10127 else if (same_type_p (deref_to_type1, deref_to_type2))
10129 if (is_properly_derived_from (deref_from_type2,
10130 deref_from_type1))
10131 return 1;
10132 else if (is_properly_derived_from (deref_from_type1,
10133 deref_from_type2))
10134 return -1;
10138 else if (CLASS_TYPE_P (non_reference (from_type1))
10139 && same_type_p (from_type1, from_type2))
10141 tree from = non_reference (from_type1);
10143 /* [over.ics.rank]
10145 --binding of an expression of type C to a reference of type
10146 B& is better than binding an expression of type C to a
10147 reference of type A&
10149 --conversion of C to B is better than conversion of C to A, */
10150 if (is_properly_derived_from (from, to_type1)
10151 && is_properly_derived_from (from, to_type2))
10153 if (is_properly_derived_from (to_type1, to_type2))
10154 return 1;
10155 else if (is_properly_derived_from (to_type2, to_type1))
10156 return -1;
10159 else if (CLASS_TYPE_P (non_reference (to_type1))
10160 && same_type_p (to_type1, to_type2))
10162 tree to = non_reference (to_type1);
10164 /* [over.ics.rank]
10166 --binding of an expression of type B to a reference of type
10167 A& is better than binding an expression of type C to a
10168 reference of type A&,
10170 --conversion of B to A is better than conversion of C to A */
10171 if (is_properly_derived_from (from_type1, to)
10172 && is_properly_derived_from (from_type2, to))
10174 if (is_properly_derived_from (from_type2, from_type1))
10175 return 1;
10176 else if (is_properly_derived_from (from_type1, from_type2))
10177 return -1;
10181 /* [over.ics.rank]
10183 --S1 and S2 differ only in their qualification conversion and yield
10184 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10185 qualification signature of type T1 is a proper subset of the cv-
10186 qualification signature of type T2 */
10187 if (ics1->kind == ck_qual
10188 && ics2->kind == ck_qual
10189 && same_type_p (from_type1, from_type2))
10191 int result = comp_cv_qual_signature (to_type1, to_type2);
10192 if (result != 0)
10193 return result;
10196 /* [over.ics.rank]
10198 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10199 to an implicit object parameter of a non-static member function
10200 declared without a ref-qualifier, and either S1 binds an lvalue
10201 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10202 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10203 draft standard, 13.3.3.2)
10205 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10206 types to which the references refer are the same type except for
10207 top-level cv-qualifiers, and the type to which the reference
10208 initialized by S2 refers is more cv-qualified than the type to
10209 which the reference initialized by S1 refers.
10211 DR 1328 [over.match.best]: the context is an initialization by
10212 conversion function for direct reference binding (13.3.1.6) of a
10213 reference to function type, the return type of F1 is the same kind of
10214 reference (i.e. lvalue or rvalue) as the reference being initialized,
10215 and the return type of F2 is not. */
10217 if (ref_conv1 && ref_conv2)
10219 if (!ref_conv1->this_p && !ref_conv2->this_p
10220 && (ref_conv1->rvaluedness_matches_p
10221 != ref_conv2->rvaluedness_matches_p)
10222 && (same_type_p (ref_conv1->type, ref_conv2->type)
10223 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
10224 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
10226 if (ref_conv1->bad_p
10227 && !same_type_p (TREE_TYPE (ref_conv1->type),
10228 TREE_TYPE (ref_conv2->type)))
10229 /* Don't prefer a bad conversion that drops cv-quals to a bad
10230 conversion with the wrong rvalueness. */
10231 return 0;
10232 return (ref_conv1->rvaluedness_matches_p
10233 - ref_conv2->rvaluedness_matches_p);
10236 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
10238 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
10239 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
10240 if (ref_conv1->bad_p)
10242 /* Prefer the one that drops fewer cv-quals. */
10243 tree ftype = next_conversion (ref_conv1)->type;
10244 int fquals = cp_type_quals (ftype);
10245 q1 ^= fquals;
10246 q2 ^= fquals;
10248 return comp_cv_qualification (q2, q1);
10252 /* Neither conversion sequence is better than the other. */
10253 return 0;
10256 /* The source type for this standard conversion sequence. */
10258 static tree
10259 source_type (conversion *t)
10261 for (;; t = next_conversion (t))
10263 if (t->kind == ck_user
10264 || t->kind == ck_ambig
10265 || t->kind == ck_identity)
10266 return t->type;
10268 gcc_unreachable ();
10271 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10272 a pointer to LOSER and re-running joust to produce the warning if WINNER
10273 is actually used. */
10275 static void
10276 add_warning (struct z_candidate *winner, struct z_candidate *loser)
10278 candidate_warning *cw = (candidate_warning *)
10279 conversion_obstack_alloc (sizeof (candidate_warning));
10280 cw->loser = loser;
10281 cw->next = winner->warnings;
10282 winner->warnings = cw;
10285 /* Compare two candidates for overloading as described in
10286 [over.match.best]. Return values:
10288 1: cand1 is better than cand2
10289 -1: cand2 is better than cand1
10290 0: cand1 and cand2 are indistinguishable */
10292 static int
10293 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
10294 tsubst_flags_t complain)
10296 int winner = 0;
10297 int off1 = 0, off2 = 0;
10298 size_t i;
10299 size_t len;
10301 /* Candidates that involve bad conversions are always worse than those
10302 that don't. */
10303 if (cand1->viable > cand2->viable)
10304 return 1;
10305 if (cand1->viable < cand2->viable)
10306 return -1;
10308 /* If we have two pseudo-candidates for conversions to the same type,
10309 or two candidates for the same function, arbitrarily pick one. */
10310 if (cand1->fn == cand2->fn
10311 && (IS_TYPE_OR_DECL_P (cand1->fn)))
10312 return 1;
10314 /* Prefer a non-deleted function over an implicitly deleted move
10315 constructor or assignment operator. This differs slightly from the
10316 wording for issue 1402 (which says the move op is ignored by overload
10317 resolution), but this way produces better error messages. */
10318 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10319 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10320 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
10322 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
10323 && move_fn_p (cand1->fn))
10324 return -1;
10325 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
10326 && move_fn_p (cand2->fn))
10327 return 1;
10330 /* a viable function F1
10331 is defined to be a better function than another viable function F2 if
10332 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10333 ICSi(F2), and then */
10335 /* for some argument j, ICSj(F1) is a better conversion sequence than
10336 ICSj(F2) */
10338 /* For comparing static and non-static member functions, we ignore
10339 the implicit object parameter of the non-static function. The
10340 standard says to pretend that the static function has an object
10341 parm, but that won't work with operator overloading. */
10342 len = cand1->num_convs;
10343 if (len != cand2->num_convs)
10345 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
10346 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
10348 if (DECL_CONSTRUCTOR_P (cand1->fn)
10349 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
10350 /* We're comparing a near-match list constructor and a near-match
10351 non-list constructor. Just treat them as unordered. */
10352 return 0;
10354 gcc_assert (static_1 != static_2);
10356 if (static_1)
10357 off2 = 1;
10358 else
10360 off1 = 1;
10361 --len;
10365 for (i = 0; i < len; ++i)
10367 conversion *t1 = cand1->convs[i + off1];
10368 conversion *t2 = cand2->convs[i + off2];
10369 int comp = compare_ics (t1, t2);
10371 if (comp != 0)
10373 if ((complain & tf_warning)
10374 && warn_sign_promo
10375 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
10376 == cr_std + cr_promotion)
10377 && t1->kind == ck_std
10378 && t2->kind == ck_std
10379 && TREE_CODE (t1->type) == INTEGER_TYPE
10380 && TREE_CODE (t2->type) == INTEGER_TYPE
10381 && (TYPE_PRECISION (t1->type)
10382 == TYPE_PRECISION (t2->type))
10383 && (TYPE_UNSIGNED (next_conversion (t1)->type)
10384 || (TREE_CODE (next_conversion (t1)->type)
10385 == ENUMERAL_TYPE)))
10387 tree type = next_conversion (t1)->type;
10388 tree type1, type2;
10389 struct z_candidate *w, *l;
10390 if (comp > 0)
10391 type1 = t1->type, type2 = t2->type,
10392 w = cand1, l = cand2;
10393 else
10394 type1 = t2->type, type2 = t1->type,
10395 w = cand2, l = cand1;
10397 if (warn)
10399 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10400 type, type1, type2);
10401 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10403 else
10404 add_warning (w, l);
10407 if (winner && comp != winner)
10409 winner = 0;
10410 goto tweak;
10412 winner = comp;
10416 /* warn about confusing overload resolution for user-defined conversions,
10417 either between a constructor and a conversion op, or between two
10418 conversion ops. */
10419 if ((complain & tf_warning)
10420 && winner && warn_conversion && cand1->second_conv
10421 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10422 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10424 struct z_candidate *w, *l;
10425 bool give_warning = false;
10427 if (winner == 1)
10428 w = cand1, l = cand2;
10429 else
10430 w = cand2, l = cand1;
10432 /* We don't want to complain about `X::operator T1 ()'
10433 beating `X::operator T2 () const', when T2 is a no less
10434 cv-qualified version of T1. */
10435 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10436 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10438 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10439 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10441 if (TREE_CODE (t) == TREE_CODE (f) && INDIRECT_TYPE_P (t))
10443 t = TREE_TYPE (t);
10444 f = TREE_TYPE (f);
10446 if (!comp_ptr_ttypes (t, f))
10447 give_warning = true;
10449 else
10450 give_warning = true;
10452 if (!give_warning)
10453 /*NOP*/;
10454 else if (warn)
10456 tree source = source_type (w->convs[0]);
10457 if (INDIRECT_TYPE_P (source))
10458 source = TREE_TYPE (source);
10459 auto_diagnostic_group d;
10460 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10461 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10462 source, w->second_conv->type))
10464 inform (input_location, " because conversion sequence for the argument is better");
10467 else
10468 add_warning (w, l);
10471 if (winner)
10472 return winner;
10474 /* DR 495 moved this tiebreaker above the template ones. */
10475 /* or, if not that,
10476 the context is an initialization by user-defined conversion (see
10477 _dcl.init_ and _over.match.user_) and the standard conversion
10478 sequence from the return type of F1 to the destination type (i.e.,
10479 the type of the entity being initialized) is a better conversion
10480 sequence than the standard conversion sequence from the return type
10481 of F2 to the destination type. */
10483 if (cand1->second_conv)
10485 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10486 if (winner)
10487 return winner;
10490 /* or, if not that,
10491 F1 is a non-template function and F2 is a template function
10492 specialization. */
10494 if (!cand1->template_decl && cand2->template_decl)
10495 return 1;
10496 else if (cand1->template_decl && !cand2->template_decl)
10497 return -1;
10499 /* or, if not that,
10500 F1 and F2 are template functions and the function template for F1 is
10501 more specialized than the template for F2 according to the partial
10502 ordering rules. */
10504 if (cand1->template_decl && cand2->template_decl)
10506 winner = more_specialized_fn
10507 (TI_TEMPLATE (cand1->template_decl),
10508 TI_TEMPLATE (cand2->template_decl),
10509 /* [temp.func.order]: The presence of unused ellipsis and default
10510 arguments has no effect on the partial ordering of function
10511 templates. add_function_candidate() will not have
10512 counted the "this" argument for constructors. */
10513 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10514 if (winner)
10515 return winner;
10518 // C++ Concepts
10519 // or, if not that, F1 is more constrained than F2.
10520 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10522 winner = more_constrained (cand1->fn, cand2->fn);
10523 if (winner)
10524 return winner;
10527 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10528 if (deduction_guide_p (cand1->fn))
10530 gcc_assert (deduction_guide_p (cand2->fn));
10531 /* We distinguish between candidates from an explicit deduction guide and
10532 candidates built from a constructor based on DECL_ARTIFICIAL. */
10533 int art1 = DECL_ARTIFICIAL (cand1->fn);
10534 int art2 = DECL_ARTIFICIAL (cand2->fn);
10535 if (art1 != art2)
10536 return art2 - art1;
10538 if (art1)
10540 /* Prefer the special copy guide over a declared copy/move
10541 constructor. */
10542 if (copy_guide_p (cand1->fn))
10543 return 1;
10544 if (copy_guide_p (cand2->fn))
10545 return -1;
10547 /* Prefer a candidate generated from a non-template constructor. */
10548 int tg1 = template_guide_p (cand1->fn);
10549 int tg2 = template_guide_p (cand2->fn);
10550 if (tg1 != tg2)
10551 return tg2 - tg1;
10555 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10556 for all arguments the corresponding parameters of F1 and F2 have the same
10557 type (CWG 2273/2277). */
10558 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10559 && !DECL_CONV_FN_P (cand1->fn)
10560 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10561 && !DECL_CONV_FN_P (cand2->fn))
10563 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10564 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10566 bool used1 = false;
10567 bool used2 = false;
10568 if (base1 == base2)
10569 /* No difference. */;
10570 else if (DERIVED_FROM_P (base1, base2))
10571 used1 = true;
10572 else if (DERIVED_FROM_P (base2, base1))
10573 used2 = true;
10575 if (int diff = used2 - used1)
10577 for (i = 0; i < len; ++i)
10579 conversion *t1 = cand1->convs[i + off1];
10580 conversion *t2 = cand2->convs[i + off2];
10581 if (!same_type_p (t1->type, t2->type))
10582 break;
10584 if (i == len)
10585 return diff;
10589 /* Check whether we can discard a builtin candidate, either because we
10590 have two identical ones or matching builtin and non-builtin candidates.
10592 (Pedantically in the latter case the builtin which matched the user
10593 function should not be added to the overload set, but we spot it here.
10595 [over.match.oper]
10596 ... the builtin candidates include ...
10597 - do not have the same parameter type list as any non-template
10598 non-member candidate. */
10600 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10602 for (i = 0; i < len; ++i)
10603 if (!same_type_p (cand1->convs[i]->type,
10604 cand2->convs[i]->type))
10605 break;
10606 if (i == cand1->num_convs)
10608 if (cand1->fn == cand2->fn)
10609 /* Two built-in candidates; arbitrarily pick one. */
10610 return 1;
10611 else if (identifier_p (cand1->fn))
10612 /* cand1 is built-in; prefer cand2. */
10613 return -1;
10614 else
10615 /* cand2 is built-in; prefer cand1. */
10616 return 1;
10620 /* For candidates of a multi-versioned function, make the version with
10621 the highest priority win. This version will be checked for dispatching
10622 first. If this version can be inlined into the caller, the front-end
10623 will simply make a direct call to this function. */
10625 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10626 && DECL_FUNCTION_VERSIONED (cand1->fn)
10627 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10628 && DECL_FUNCTION_VERSIONED (cand2->fn))
10630 tree f1 = TREE_TYPE (cand1->fn);
10631 tree f2 = TREE_TYPE (cand2->fn);
10632 tree p1 = TYPE_ARG_TYPES (f1);
10633 tree p2 = TYPE_ARG_TYPES (f2);
10635 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10636 is possible that cand1->fn and cand2->fn are function versions but of
10637 different functions. Check types to see if they are versions of the same
10638 function. */
10639 if (compparms (p1, p2)
10640 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10642 /* Always make the version with the higher priority, more
10643 specialized, win. */
10644 gcc_assert (targetm.compare_version_priority);
10645 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10646 return 1;
10647 else
10648 return -1;
10652 /* If the two function declarations represent the same function (this can
10653 happen with declarations in multiple scopes and arg-dependent lookup),
10654 arbitrarily choose one. But first make sure the default args we're
10655 using match. */
10656 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10657 && equal_functions (cand1->fn, cand2->fn))
10659 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10660 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10662 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10664 for (i = 0; i < len; ++i)
10666 /* Don't crash if the fn is variadic. */
10667 if (!parms1)
10668 break;
10669 parms1 = TREE_CHAIN (parms1);
10670 parms2 = TREE_CHAIN (parms2);
10673 if (off1)
10674 parms1 = TREE_CHAIN (parms1);
10675 else if (off2)
10676 parms2 = TREE_CHAIN (parms2);
10678 for (; parms1; ++i)
10680 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10681 TREE_PURPOSE (parms2)))
10683 if (warn)
10685 if (complain & tf_error)
10687 auto_diagnostic_group d;
10688 if (permerror (input_location,
10689 "default argument mismatch in "
10690 "overload resolution"))
10692 inform (DECL_SOURCE_LOCATION (cand1->fn),
10693 " candidate 1: %q#F", cand1->fn);
10694 inform (DECL_SOURCE_LOCATION (cand2->fn),
10695 " candidate 2: %q#F", cand2->fn);
10698 else
10699 return 0;
10701 else
10702 add_warning (cand1, cand2);
10703 break;
10705 parms1 = TREE_CHAIN (parms1);
10706 parms2 = TREE_CHAIN (parms2);
10709 return 1;
10712 tweak:
10714 /* Extension: If the worst conversion for one candidate is worse than the
10715 worst conversion for the other, take the first. */
10716 if (!pedantic && (complain & tf_warning_or_error))
10718 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10719 struct z_candidate *w = 0, *l = 0;
10721 for (i = 0; i < len; ++i)
10723 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10724 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10725 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10726 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10728 if (rank1 < rank2)
10729 winner = 1, w = cand1, l = cand2;
10730 if (rank1 > rank2)
10731 winner = -1, w = cand2, l = cand1;
10732 if (winner)
10734 /* Don't choose a deleted function over ambiguity. */
10735 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10736 return 0;
10737 if (warn)
10739 auto_diagnostic_group d;
10740 pedwarn (input_location, 0,
10741 "ISO C++ says that these are ambiguous, even "
10742 "though the worst conversion for the first is better than "
10743 "the worst conversion for the second:");
10744 print_z_candidate (input_location, _("candidate 1:"), w);
10745 print_z_candidate (input_location, _("candidate 2:"), l);
10747 else
10748 add_warning (w, l);
10749 return winner;
10753 gcc_assert (!winner);
10754 return 0;
10757 /* Given a list of candidates for overloading, find the best one, if any.
10758 This algorithm has a worst case of O(2n) (winner is last), and a best
10759 case of O(n/2) (totally ambiguous); much better than a sorting
10760 algorithm. */
10762 static struct z_candidate *
10763 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10765 struct z_candidate *champ = candidates, *challenger;
10766 int fate;
10767 int champ_compared_to_predecessor = 0;
10769 /* Walk through the list once, comparing each current champ to the next
10770 candidate, knocking out a candidate or two with each comparison. */
10772 for (challenger = champ->next; challenger; )
10774 fate = joust (champ, challenger, 0, complain);
10775 if (fate == 1)
10776 challenger = challenger->next;
10777 else
10779 if (fate == 0)
10781 champ = challenger->next;
10782 if (champ == 0)
10783 return NULL;
10784 champ_compared_to_predecessor = 0;
10786 else
10788 champ = challenger;
10789 champ_compared_to_predecessor = 1;
10792 challenger = champ->next;
10796 /* Make sure the champ is better than all the candidates it hasn't yet
10797 been compared to. */
10799 for (challenger = candidates;
10800 challenger != champ
10801 && !(champ_compared_to_predecessor && challenger->next == champ);
10802 challenger = challenger->next)
10804 fate = joust (champ, challenger, 0, complain);
10805 if (fate != 1)
10806 return NULL;
10809 return champ;
10812 /* Returns nonzero if things of type FROM can be converted to TO. */
10814 bool
10815 can_convert (tree to, tree from, tsubst_flags_t complain)
10817 tree arg = NULL_TREE;
10818 /* implicit_conversion only considers user-defined conversions
10819 if it has an expression for the call argument list. */
10820 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10821 arg = build1 (CAST_EXPR, from, NULL_TREE);
10822 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10825 /* Returns nonzero if things of type FROM can be converted to TO with a
10826 standard conversion. */
10828 bool
10829 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10831 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10834 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10836 bool
10837 can_convert_arg (tree to, tree from, tree arg, int flags,
10838 tsubst_flags_t complain)
10840 conversion *t;
10841 void *p;
10842 bool ok_p;
10844 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10845 p = conversion_obstack_alloc (0);
10846 /* We want to discard any access checks done for this test,
10847 as we might not be in the appropriate access context and
10848 we'll do the check again when we actually perform the
10849 conversion. */
10850 push_deferring_access_checks (dk_deferred);
10852 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10853 flags, complain);
10854 ok_p = (t && !t->bad_p);
10856 /* Discard the access checks now. */
10857 pop_deferring_access_checks ();
10858 /* Free all the conversions we allocated. */
10859 obstack_free (&conversion_obstack, p);
10861 return ok_p;
10864 /* Like can_convert_arg, but allows dubious conversions as well. */
10866 bool
10867 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10868 tsubst_flags_t complain)
10870 conversion *t;
10871 void *p;
10873 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10874 p = conversion_obstack_alloc (0);
10875 /* Try to perform the conversion. */
10876 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10877 flags, complain);
10878 /* Free all the conversions we allocated. */
10879 obstack_free (&conversion_obstack, p);
10881 return t != NULL;
10884 /* Convert EXPR to TYPE. Return the converted expression.
10886 Note that we allow bad conversions here because by the time we get to
10887 this point we are committed to doing the conversion. If we end up
10888 doing a bad conversion, convert_like will complain. */
10890 tree
10891 perform_implicit_conversion_flags (tree type, tree expr,
10892 tsubst_flags_t complain, int flags)
10894 conversion *conv;
10895 void *p;
10896 location_t loc = cp_expr_loc_or_loc (expr, input_location);
10898 if (TYPE_REF_P (type))
10899 expr = mark_lvalue_use (expr);
10900 else
10901 expr = mark_rvalue_use (expr);
10903 if (error_operand_p (expr))
10904 return error_mark_node;
10906 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10907 p = conversion_obstack_alloc (0);
10909 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10910 /*c_cast_p=*/false,
10911 flags, complain);
10913 if (!conv)
10915 if (complain & tf_error)
10917 /* If expr has unknown type, then it is an overloaded function.
10918 Call instantiate_type to get good error messages. */
10919 if (TREE_TYPE (expr) == unknown_type_node)
10920 instantiate_type (type, expr, complain);
10921 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10922 /* We gave an error. */;
10923 else
10925 range_label_for_type_mismatch label (TREE_TYPE (expr), type);
10926 gcc_rich_location rich_loc (loc, &label);
10927 error_at (&rich_loc, "could not convert %qE from %qH to %qI",
10928 expr, TREE_TYPE (expr), type);
10931 expr = error_mark_node;
10933 else if (processing_template_decl && conv->kind != ck_identity)
10935 /* In a template, we are only concerned about determining the
10936 type of non-dependent expressions, so we do not have to
10937 perform the actual conversion. But for initializers, we
10938 need to be able to perform it at instantiation
10939 (or instantiate_non_dependent_expr) time. */
10940 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10941 if (!(flags & LOOKUP_ONLYCONVERTING))
10942 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10944 else
10945 expr = convert_like (conv, expr, complain);
10947 /* Free all the conversions we allocated. */
10948 obstack_free (&conversion_obstack, p);
10950 return expr;
10953 tree
10954 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10956 return perform_implicit_conversion_flags (type, expr, complain,
10957 LOOKUP_IMPLICIT);
10960 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10961 permitted. If the conversion is valid, the converted expression is
10962 returned. Otherwise, NULL_TREE is returned, except in the case
10963 that TYPE is a class type; in that case, an error is issued. If
10964 C_CAST_P is true, then this direct-initialization is taking
10965 place as part of a static_cast being attempted as part of a C-style
10966 cast. */
10968 tree
10969 perform_direct_initialization_if_possible (tree type,
10970 tree expr,
10971 bool c_cast_p,
10972 tsubst_flags_t complain)
10974 conversion *conv;
10975 void *p;
10977 if (type == error_mark_node || error_operand_p (expr))
10978 return error_mark_node;
10979 /* [dcl.init]
10981 If the destination type is a (possibly cv-qualified) class type:
10983 -- If the initialization is direct-initialization ...,
10984 constructors are considered. ... If no constructor applies, or
10985 the overload resolution is ambiguous, the initialization is
10986 ill-formed. */
10987 if (CLASS_TYPE_P (type))
10989 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10990 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10991 &args, type, LOOKUP_NORMAL, complain);
10992 release_tree_vector (args);
10993 return build_cplus_new (type, expr, complain);
10996 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10997 p = conversion_obstack_alloc (0);
10999 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
11000 c_cast_p,
11001 LOOKUP_NORMAL, complain);
11002 if (!conv || conv->bad_p)
11003 expr = NULL_TREE;
11004 else if (processing_template_decl && conv->kind != ck_identity)
11006 /* In a template, we are only concerned about determining the
11007 type of non-dependent expressions, so we do not have to
11008 perform the actual conversion. But for initializers, we
11009 need to be able to perform it at instantiation
11010 (or instantiate_non_dependent_expr) time. */
11011 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
11012 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
11014 else
11015 expr = convert_like_real (conv, expr, NULL_TREE, 0,
11016 /*issue_conversion_warnings=*/false,
11017 c_cast_p,
11018 complain);
11020 /* Free all the conversions we allocated. */
11021 obstack_free (&conversion_obstack, p);
11023 return expr;
11026 /* When initializing a reference that lasts longer than a full-expression,
11027 this special rule applies:
11029 [class.temporary]
11031 The temporary to which the reference is bound or the temporary
11032 that is the complete object to which the reference is bound
11033 persists for the lifetime of the reference.
11035 The temporaries created during the evaluation of the expression
11036 initializing the reference, except the temporary to which the
11037 reference is bound, are destroyed at the end of the
11038 full-expression in which they are created.
11040 In that case, we store the converted expression into a new
11041 VAR_DECL in a new scope.
11043 However, we want to be careful not to create temporaries when
11044 they are not required. For example, given:
11046 struct B {};
11047 struct D : public B {};
11048 D f();
11049 const B& b = f();
11051 there is no need to copy the return value from "f"; we can just
11052 extend its lifetime. Similarly, given:
11054 struct S {};
11055 struct T { operator S(); };
11056 T t;
11057 const S& s = t;
11059 we can extend the lifetime of the return value of the conversion
11060 operator.
11062 The next several functions are involved in this lifetime extension. */
11064 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11065 reference is being bound to a temporary. Create and return a new
11066 VAR_DECL with the indicated TYPE; this variable will store the value to
11067 which the reference is bound. */
11069 tree
11070 make_temporary_var_for_ref_to_temp (tree decl, tree type)
11072 tree var = create_temporary_var (type);
11074 /* Register the variable. */
11075 if (VAR_P (decl)
11076 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
11078 /* Namespace-scope or local static; give it a mangled name. */
11079 /* FIXME share comdat with decl? */
11081 TREE_STATIC (var) = TREE_STATIC (decl);
11082 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
11083 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
11085 tree name = mangle_ref_init_variable (decl);
11086 DECL_NAME (var) = name;
11087 SET_DECL_ASSEMBLER_NAME (var, name);
11089 var = pushdecl (var);
11091 else
11092 /* Create a new cleanup level if necessary. */
11093 maybe_push_cleanup_level (type);
11095 return var;
11098 /* EXPR is the initializer for a variable DECL of reference or
11099 std::initializer_list type. Create, push and return a new VAR_DECL
11100 for the initializer so that it will live as long as DECL. Any
11101 cleanup for the new variable is returned through CLEANUP, and the
11102 code to initialize the new variable is returned through INITP. */
11104 static tree
11105 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
11106 tree *initp)
11108 tree init;
11109 tree type;
11110 tree var;
11112 /* Create the temporary variable. */
11113 type = TREE_TYPE (expr);
11114 var = make_temporary_var_for_ref_to_temp (decl, type);
11115 layout_decl (var, 0);
11116 /* If the rvalue is the result of a function call it will be
11117 a TARGET_EXPR. If it is some other construct (such as a
11118 member access expression where the underlying object is
11119 itself the result of a function call), turn it into a
11120 TARGET_EXPR here. It is important that EXPR be a
11121 TARGET_EXPR below since otherwise the INIT_EXPR will
11122 attempt to make a bitwise copy of EXPR to initialize
11123 VAR. */
11124 if (TREE_CODE (expr) != TARGET_EXPR)
11125 expr = get_target_expr (expr);
11127 if (TREE_CODE (decl) == FIELD_DECL
11128 && extra_warnings && !TREE_NO_WARNING (decl))
11130 warning (OPT_Wextra, "a temporary bound to %qD only persists "
11131 "until the constructor exits", decl);
11132 TREE_NO_WARNING (decl) = true;
11135 /* Recursively extend temps in this initializer. */
11136 TARGET_EXPR_INITIAL (expr)
11137 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
11139 /* Any reference temp has a non-trivial initializer. */
11140 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
11142 /* If the initializer is constant, put it in DECL_INITIAL so we get
11143 static initialization and use in constant expressions. */
11144 init = maybe_constant_init (expr);
11145 /* As in store_init_value. */
11146 init = cp_fully_fold (init);
11147 if (TREE_CONSTANT (init))
11149 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
11151 /* 5.19 says that a constant expression can include an
11152 lvalue-rvalue conversion applied to "a glvalue of literal type
11153 that refers to a non-volatile temporary object initialized
11154 with a constant expression". Rather than try to communicate
11155 that this VAR_DECL is a temporary, just mark it constexpr. */
11156 DECL_DECLARED_CONSTEXPR_P (var) = true;
11157 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
11158 TREE_CONSTANT (var) = true;
11159 TREE_READONLY (var) = true;
11161 DECL_INITIAL (var) = init;
11162 init = NULL_TREE;
11164 else
11165 /* Create the INIT_EXPR that will initialize the temporary
11166 variable. */
11167 init = split_nonconstant_init (var, expr);
11168 if (at_function_scope_p ())
11170 add_decl_expr (var);
11172 if (TREE_STATIC (var))
11173 init = add_stmt_to_compound (init, register_dtor_fn (var));
11174 else
11176 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
11177 if (cleanup)
11178 vec_safe_push (*cleanups, cleanup);
11181 /* We must be careful to destroy the temporary only
11182 after its initialization has taken place. If the
11183 initialization throws an exception, then the
11184 destructor should not be run. We cannot simply
11185 transform INIT into something like:
11187 (INIT, ({ CLEANUP_STMT; }))
11189 because emit_local_var always treats the
11190 initializer as a full-expression. Thus, the
11191 destructor would run too early; it would run at the
11192 end of initializing the reference variable, rather
11193 than at the end of the block enclosing the
11194 reference variable.
11196 The solution is to pass back a cleanup expression
11197 which the caller is responsible for attaching to
11198 the statement tree. */
11200 else
11202 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
11203 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
11205 if (CP_DECL_THREAD_LOCAL_P (var))
11206 tls_aggregates = tree_cons (NULL_TREE, var,
11207 tls_aggregates);
11208 else
11209 static_aggregates = tree_cons (NULL_TREE, var,
11210 static_aggregates);
11212 else
11213 /* Check whether the dtor is callable. */
11214 cxx_maybe_build_cleanup (var, tf_warning_or_error);
11216 /* Avoid -Wunused-variable warning (c++/38958). */
11217 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
11218 && VAR_P (decl))
11219 TREE_USED (decl) = DECL_READ_P (decl) = true;
11221 *initp = init;
11222 return var;
11225 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11226 initializing a variable of that TYPE. */
11228 tree
11229 initialize_reference (tree type, tree expr,
11230 int flags, tsubst_flags_t complain)
11232 conversion *conv;
11233 void *p;
11234 location_t loc = cp_expr_loc_or_loc (expr, input_location);
11236 if (type == error_mark_node || error_operand_p (expr))
11237 return error_mark_node;
11239 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11240 p = conversion_obstack_alloc (0);
11242 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
11243 flags, complain);
11244 if (!conv || conv->bad_p)
11246 if (complain & tf_error)
11248 if (conv)
11249 convert_like (conv, expr, complain);
11250 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
11251 && !TYPE_REF_IS_RVALUE (type)
11252 && !lvalue_p (expr))
11253 error_at (loc, "invalid initialization of non-const reference of "
11254 "type %qH from an rvalue of type %qI",
11255 type, TREE_TYPE (expr));
11256 else
11257 error_at (loc, "invalid initialization of reference of type "
11258 "%qH from expression of type %qI", type,
11259 TREE_TYPE (expr));
11261 return error_mark_node;
11264 if (conv->kind == ck_ref_bind)
11265 /* Perform the conversion. */
11266 expr = convert_like (conv, expr, complain);
11267 else if (conv->kind == ck_ambig)
11268 /* We gave an error in build_user_type_conversion_1. */
11269 expr = error_mark_node;
11270 else
11271 gcc_unreachable ();
11273 /* Free all the conversions we allocated. */
11274 obstack_free (&conversion_obstack, p);
11276 return expr;
11279 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11280 which is bound either to a reference or a std::initializer_list. */
11282 static tree
11283 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
11285 tree sub = init;
11286 tree *p;
11287 STRIP_NOPS (sub);
11288 if (TREE_CODE (sub) == COMPOUND_EXPR)
11290 TREE_OPERAND (sub, 1)
11291 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
11292 return init;
11294 if (TREE_CODE (sub) != ADDR_EXPR)
11295 return init;
11296 /* Deal with binding to a subobject. */
11297 for (p = &TREE_OPERAND (sub, 0);
11298 (TREE_CODE (*p) == COMPONENT_REF
11299 || TREE_CODE (*p) == ARRAY_REF); )
11300 p = &TREE_OPERAND (*p, 0);
11301 if (TREE_CODE (*p) == TARGET_EXPR)
11303 tree subinit = NULL_TREE;
11304 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
11305 recompute_tree_invariant_for_addr_expr (sub);
11306 if (init != sub)
11307 init = fold_convert (TREE_TYPE (init), sub);
11308 if (subinit)
11309 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
11311 return init;
11314 /* INIT is part of the initializer for DECL. If there are any
11315 reference or initializer lists being initialized, extend their
11316 lifetime to match that of DECL. */
11318 tree
11319 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
11321 tree type = TREE_TYPE (init);
11322 if (processing_template_decl)
11323 return init;
11324 if (TYPE_REF_P (type))
11325 init = extend_ref_init_temps_1 (decl, init, cleanups);
11326 else
11328 tree ctor = init;
11329 if (TREE_CODE (ctor) == TARGET_EXPR)
11330 ctor = TARGET_EXPR_INITIAL (ctor);
11331 if (TREE_CODE (ctor) == CONSTRUCTOR)
11333 if (is_std_init_list (type))
11335 /* The temporary array underlying a std::initializer_list
11336 is handled like a reference temporary. */
11337 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
11338 array = extend_ref_init_temps_1 (decl, array, cleanups);
11339 CONSTRUCTOR_ELT (ctor, 0)->value = array;
11341 else
11343 unsigned i;
11344 constructor_elt *p;
11345 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
11346 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
11347 p->value = extend_ref_init_temps (decl, p->value, cleanups);
11349 recompute_constructor_flags (ctor);
11350 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
11351 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
11355 return init;
11358 /* Returns true iff an initializer for TYPE could contain temporaries that
11359 need to be extended because they are bound to references or
11360 std::initializer_list. */
11362 bool
11363 type_has_extended_temps (tree type)
11365 type = strip_array_types (type);
11366 if (TYPE_REF_P (type))
11367 return true;
11368 if (CLASS_TYPE_P (type))
11370 if (is_std_init_list (type))
11371 return true;
11372 for (tree f = next_initializable_field (TYPE_FIELDS (type));
11373 f; f = next_initializable_field (DECL_CHAIN (f)))
11374 if (type_has_extended_temps (TREE_TYPE (f)))
11375 return true;
11377 return false;
11380 /* Returns true iff TYPE is some variant of std::initializer_list. */
11382 bool
11383 is_std_init_list (tree type)
11385 if (!TYPE_P (type))
11386 return false;
11387 if (cxx_dialect == cxx98)
11388 return false;
11389 /* Look through typedefs. */
11390 type = TYPE_MAIN_VARIANT (type);
11391 return (CLASS_TYPE_P (type)
11392 && CP_TYPE_CONTEXT (type) == std_node
11393 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
11396 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11397 will accept an argument list of a single std::initializer_list<T>. */
11399 bool
11400 is_list_ctor (tree decl)
11402 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
11403 tree arg;
11405 if (!args || args == void_list_node)
11406 return false;
11408 arg = non_reference (TREE_VALUE (args));
11409 if (!is_std_init_list (arg))
11410 return false;
11412 args = TREE_CHAIN (args);
11414 if (args && args != void_list_node && !TREE_PURPOSE (args))
11415 /* There are more non-defaulted parms. */
11416 return false;
11418 return true;
11421 #include "gt-cp-call.h"