PR c++/84851 - missing -Wclass-memaccess for a memcpy in a copy ctor with a non-trivi...
[official-gcc.git] / gcc / cp / call.c
blobcd0c0f60cedbe4b2f50c00eec06c61975c02dfee
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 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3256 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3257 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3258 ctype))
3260 /* We're trying to produce a constructor with a prohibited signature,
3261 as discussed above; handle here any cases we didn't catch then,
3262 such as X(X<T>). */
3263 reason = invalid_copy_with_fn_template_rejection ();
3264 goto fail;
3268 if (obj != NULL_TREE)
3269 /* Aha, this is a conversion function. */
3270 cand = add_conv_candidate (candidates, fn, obj, arglist,
3271 access_path, conversion_path, complain);
3272 else
3273 cand = add_function_candidate (candidates, fn, ctype,
3274 first_arg, arglist, access_path,
3275 conversion_path, flags, convs, complain);
3276 if (DECL_TI_TEMPLATE (fn) != tmpl)
3277 /* This situation can occur if a member template of a template
3278 class is specialized. Then, instantiate_template might return
3279 an instantiation of the specialization, in which case the
3280 DECL_TI_TEMPLATE field will point at the original
3281 specialization. For example:
3283 template <class T> struct S { template <class U> void f(U);
3284 template <> void f(int) {}; };
3285 S<double> sd;
3286 sd.f(3);
3288 Here, TMPL will be template <class U> S<double>::f(U).
3289 And, instantiate template will give us the specialization
3290 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3291 for this will point at template <class T> template <> S<T>::f(int),
3292 so that we can find the definition. For the purposes of
3293 overload resolution, however, we want the original TMPL. */
3294 cand->template_decl = build_template_info (tmpl, targs);
3295 else
3296 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3297 cand->explicit_targs = explicit_targs;
3299 return cand;
3300 fail:
3301 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3302 access_path, conversion_path, 0, reason, flags);
3306 static struct z_candidate *
3307 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3308 tree explicit_targs, tree first_arg,
3309 const vec<tree, va_gc> *arglist, tree return_type,
3310 tree access_path, tree conversion_path, int flags,
3311 unification_kind_t strict, tsubst_flags_t complain)
3313 return
3314 add_template_candidate_real (candidates, tmpl, ctype,
3315 explicit_targs, first_arg, arglist,
3316 return_type, access_path, conversion_path,
3317 flags, NULL_TREE, strict, complain);
3320 /* Create an overload candidate for the conversion function template TMPL,
3321 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3322 pointer-to-function which will in turn be called with the argument list
3323 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3324 passed on to implicit_conversion. */
3326 static struct z_candidate *
3327 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3328 tree obj,
3329 const vec<tree, va_gc> *arglist,
3330 tree return_type, tree access_path,
3331 tree conversion_path, tsubst_flags_t complain)
3333 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3334 core issue 2189, let's disable this candidate if there are any call
3335 operators. */
3336 if (*candidates)
3337 return NULL;
3339 return
3340 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3341 NULL_TREE, arglist, return_type, access_path,
3342 conversion_path, 0, obj, DEDUCE_CALL,
3343 complain);
3346 /* The CANDS are the set of candidates that were considered for
3347 overload resolution. Return the set of viable candidates, or CANDS
3348 if none are viable. If any of the candidates were viable, set
3349 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3350 considered viable only if it is strictly viable. */
3352 static struct z_candidate*
3353 splice_viable (struct z_candidate *cands,
3354 bool strict_p,
3355 bool *any_viable_p)
3357 struct z_candidate *viable;
3358 struct z_candidate **last_viable;
3359 struct z_candidate **cand;
3360 bool found_strictly_viable = false;
3362 /* Be strict inside templates, since build_over_call won't actually
3363 do the conversions to get pedwarns. */
3364 if (processing_template_decl)
3365 strict_p = true;
3367 viable = NULL;
3368 last_viable = &viable;
3369 *any_viable_p = false;
3371 cand = &cands;
3372 while (*cand)
3374 struct z_candidate *c = *cand;
3375 if (!strict_p
3376 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3378 /* Be strict in the presence of a viable candidate. Also if
3379 there are template candidates, so that we get deduction errors
3380 for them instead of silently preferring a bad conversion. */
3381 strict_p = true;
3382 if (viable && !found_strictly_viable)
3384 /* Put any spliced near matches back onto the main list so
3385 that we see them if there is no strict match. */
3386 *any_viable_p = false;
3387 *last_viable = cands;
3388 cands = viable;
3389 viable = NULL;
3390 last_viable = &viable;
3394 if (strict_p ? c->viable == 1 : c->viable)
3396 *last_viable = c;
3397 *cand = c->next;
3398 c->next = NULL;
3399 last_viable = &c->next;
3400 *any_viable_p = true;
3401 if (c->viable == 1)
3402 found_strictly_viable = true;
3404 else
3405 cand = &c->next;
3408 return viable ? viable : cands;
3411 static bool
3412 any_strictly_viable (struct z_candidate *cands)
3414 for (; cands; cands = cands->next)
3415 if (cands->viable == 1)
3416 return true;
3417 return false;
3420 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3421 words, it is about to become the "this" pointer for a member
3422 function call. Take the address of the object. */
3424 static tree
3425 build_this (tree obj)
3427 /* In a template, we are only concerned about the type of the
3428 expression, so we can take a shortcut. */
3429 if (processing_template_decl)
3430 return build_address (obj);
3432 return cp_build_addr_expr (obj, tf_warning_or_error);
3435 /* Returns true iff functions are equivalent. Equivalent functions are
3436 not '==' only if one is a function-local extern function or if
3437 both are extern "C". */
3439 static inline int
3440 equal_functions (tree fn1, tree fn2)
3442 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3443 return 0;
3444 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3445 return fn1 == fn2;
3446 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3447 || DECL_EXTERN_C_FUNCTION_P (fn1))
3448 return decls_match (fn1, fn2);
3449 return fn1 == fn2;
3452 /* Print information about a candidate FN being rejected due to INFO. */
3454 static void
3455 print_conversion_rejection (location_t loc, struct conversion_info *info,
3456 tree fn)
3458 tree from = info->from;
3459 if (!TYPE_P (from))
3460 from = lvalue_type (from);
3461 if (info->n_arg == -1)
3463 /* Conversion of implicit `this' argument failed. */
3464 if (!TYPE_P (info->from))
3465 /* A bad conversion for 'this' must be discarding cv-quals. */
3466 inform (loc, " passing %qT as %<this%> "
3467 "argument discards qualifiers",
3468 from);
3469 else
3470 inform (loc, " no known conversion for implicit "
3471 "%<this%> parameter from %qH to %qI",
3472 from, info->to_type);
3474 else if (!TYPE_P (info->from))
3476 if (info->n_arg >= 0)
3477 inform (loc, " conversion of argument %d would be ill-formed:",
3478 info->n_arg + 1);
3479 perform_implicit_conversion (info->to_type, info->from,
3480 tf_warning_or_error);
3482 else if (info->n_arg == -2)
3483 /* Conversion of conversion function return value failed. */
3484 inform (loc, " no known conversion from %qH to %qI",
3485 from, info->to_type);
3486 else
3488 if (TREE_CODE (fn) == FUNCTION_DECL)
3489 loc = get_fndecl_argument_location (fn, info->n_arg);
3490 inform (loc, " no known conversion for argument %d from %qH to %qI",
3491 info->n_arg + 1, from, info->to_type);
3495 /* Print information about a candidate with WANT parameters and we found
3496 HAVE. */
3498 static void
3499 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3501 inform_n (loc, want,
3502 " candidate expects %d argument, %d provided",
3503 " candidate expects %d arguments, %d provided",
3504 want, have);
3507 /* Print information about one overload candidate CANDIDATE. MSGSTR
3508 is the text to print before the candidate itself.
3510 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3511 to have been run through gettext by the caller. This wart makes
3512 life simpler in print_z_candidates and for the translators. */
3514 static void
3515 print_z_candidate (location_t loc, const char *msgstr,
3516 struct z_candidate *candidate)
3518 const char *msg = (msgstr == NULL
3519 ? ""
3520 : ACONCAT ((msgstr, " ", NULL)));
3521 tree fn = candidate->fn;
3522 if (flag_new_inheriting_ctors)
3523 fn = strip_inheriting_ctors (fn);
3524 location_t cloc = location_of (fn);
3526 if (identifier_p (fn))
3528 cloc = loc;
3529 if (candidate->num_convs == 3)
3530 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3531 candidate->convs[0]->type,
3532 candidate->convs[1]->type,
3533 candidate->convs[2]->type);
3534 else if (candidate->num_convs == 2)
3535 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3536 candidate->convs[0]->type,
3537 candidate->convs[1]->type);
3538 else
3539 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3540 candidate->convs[0]->type);
3542 else if (TYPE_P (fn))
3543 inform (cloc, "%s%qT <conversion>", msg, fn);
3544 else if (candidate->viable == -1)
3545 inform (cloc, "%s%#qD <near match>", msg, fn);
3546 else if (DECL_DELETED_FN (fn))
3547 inform (cloc, "%s%#qD <deleted>", msg, fn);
3548 else
3549 inform (cloc, "%s%#qD", msg, fn);
3550 if (fn != candidate->fn)
3552 cloc = location_of (candidate->fn);
3553 inform (cloc, " inherited here");
3555 /* Give the user some information about why this candidate failed. */
3556 if (candidate->reason != NULL)
3558 struct rejection_reason *r = candidate->reason;
3560 switch (r->code)
3562 case rr_arity:
3563 print_arity_information (cloc, r->u.arity.actual,
3564 r->u.arity.expected);
3565 break;
3566 case rr_arg_conversion:
3567 print_conversion_rejection (cloc, &r->u.conversion, fn);
3568 break;
3569 case rr_bad_arg_conversion:
3570 print_conversion_rejection (cloc, &r->u.bad_conversion, fn);
3571 break;
3572 case rr_explicit_conversion:
3573 inform (cloc, " return type %qT of explicit conversion function "
3574 "cannot be converted to %qT with a qualification "
3575 "conversion", r->u.conversion.from,
3576 r->u.conversion.to_type);
3577 break;
3578 case rr_template_conversion:
3579 inform (cloc, " conversion from return type %qT of template "
3580 "conversion function specialization to %qT is not an "
3581 "exact match", r->u.conversion.from,
3582 r->u.conversion.to_type);
3583 break;
3584 case rr_template_unification:
3585 /* We use template_unification_error_rejection if unification caused
3586 actual non-SFINAE errors, in which case we don't need to repeat
3587 them here. */
3588 if (r->u.template_unification.tmpl == NULL_TREE)
3590 inform (cloc, " substitution of deduced template arguments "
3591 "resulted in errors seen above");
3592 break;
3594 /* Re-run template unification with diagnostics. */
3595 inform (cloc, " template argument deduction/substitution failed:");
3596 fn_type_unification (r->u.template_unification.tmpl,
3597 r->u.template_unification.explicit_targs,
3598 (make_tree_vec
3599 (r->u.template_unification.num_targs)),
3600 r->u.template_unification.args,
3601 r->u.template_unification.nargs,
3602 r->u.template_unification.return_type,
3603 r->u.template_unification.strict,
3604 r->u.template_unification.flags,
3605 NULL, true, false);
3606 break;
3607 case rr_invalid_copy:
3608 inform (cloc,
3609 " a constructor taking a single argument of its own "
3610 "class type is invalid");
3611 break;
3612 case rr_constraint_failure:
3614 tree tmpl = r->u.template_instantiation.tmpl;
3615 tree args = r->u.template_instantiation.targs;
3616 diagnose_constraints (cloc, tmpl, args);
3618 break;
3619 case rr_inherited_ctor:
3620 inform (cloc, " an inherited constructor is not a candidate for "
3621 "initialization from an expression of the same or derived "
3622 "type");
3623 break;
3624 case rr_none:
3625 default:
3626 /* This candidate didn't have any issues or we failed to
3627 handle a particular code. Either way... */
3628 gcc_unreachable ();
3633 static void
3634 print_z_candidates (location_t loc, struct z_candidate *candidates)
3636 struct z_candidate *cand1;
3637 struct z_candidate **cand2;
3639 if (!candidates)
3640 return;
3642 /* Remove non-viable deleted candidates. */
3643 cand1 = candidates;
3644 for (cand2 = &cand1; *cand2; )
3646 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3647 && !(*cand2)->viable
3648 && DECL_DELETED_FN ((*cand2)->fn))
3649 *cand2 = (*cand2)->next;
3650 else
3651 cand2 = &(*cand2)->next;
3653 /* ...if there are any non-deleted ones. */
3654 if (cand1)
3655 candidates = cand1;
3657 /* There may be duplicates in the set of candidates. We put off
3658 checking this condition as long as possible, since we have no way
3659 to eliminate duplicates from a set of functions in less than n^2
3660 time. Now we are about to emit an error message, so it is more
3661 permissible to go slowly. */
3662 for (cand1 = candidates; cand1; cand1 = cand1->next)
3664 tree fn = cand1->fn;
3665 /* Skip builtin candidates and conversion functions. */
3666 if (!DECL_P (fn))
3667 continue;
3668 cand2 = &cand1->next;
3669 while (*cand2)
3671 if (DECL_P ((*cand2)->fn)
3672 && equal_functions (fn, (*cand2)->fn))
3673 *cand2 = (*cand2)->next;
3674 else
3675 cand2 = &(*cand2)->next;
3679 for (; candidates; candidates = candidates->next)
3680 print_z_candidate (loc, "candidate:", candidates);
3683 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3684 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3685 the result of the conversion function to convert it to the final
3686 desired type. Merge the two sequences into a single sequence,
3687 and return the merged sequence. */
3689 static conversion *
3690 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3692 conversion **t;
3693 bool bad = user_seq->bad_p;
3695 gcc_assert (user_seq->kind == ck_user);
3697 /* Find the end of the second conversion sequence. */
3698 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3700 /* The entire sequence is a user-conversion sequence. */
3701 (*t)->user_conv_p = true;
3702 if (bad)
3703 (*t)->bad_p = true;
3706 if ((*t)->rvaluedness_matches_p)
3707 /* We're binding a reference directly to the result of the conversion.
3708 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3709 type, but we want it back. */
3710 user_seq->type = TREE_TYPE (TREE_TYPE (user_seq->cand->fn));
3712 /* Replace the identity conversion with the user conversion
3713 sequence. */
3714 *t = user_seq;
3716 return std_seq;
3719 /* Handle overload resolution for initializing an object of class type from
3720 an initializer list. First we look for a suitable constructor that
3721 takes a std::initializer_list; if we don't find one, we then look for a
3722 non-list constructor.
3724 Parameters are as for add_candidates, except that the arguments are in
3725 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3726 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3728 static void
3729 add_list_candidates (tree fns, tree first_arg,
3730 const vec<tree, va_gc> *args, tree totype,
3731 tree explicit_targs, bool template_only,
3732 tree conversion_path, tree access_path,
3733 int flags,
3734 struct z_candidate **candidates,
3735 tsubst_flags_t complain)
3737 gcc_assert (*candidates == NULL);
3739 /* We're looking for a ctor for list-initialization. */
3740 flags |= LOOKUP_LIST_INIT_CTOR;
3741 /* And we don't allow narrowing conversions. We also use this flag to
3742 avoid the copy constructor call for copy-list-initialization. */
3743 flags |= LOOKUP_NO_NARROWING;
3745 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3746 tree init_list = (*args)[nart];
3748 /* Always use the default constructor if the list is empty (DR 990). */
3749 if (CONSTRUCTOR_NELTS (init_list) == 0
3750 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3752 /* If the class has a list ctor, try passing the list as a single
3753 argument first, but only consider list ctors. */
3754 else if (TYPE_HAS_LIST_CTOR (totype))
3756 flags |= LOOKUP_LIST_ONLY;
3757 add_candidates (fns, first_arg, args, NULL_TREE,
3758 explicit_targs, template_only, conversion_path,
3759 access_path, flags, candidates, complain);
3760 if (any_strictly_viable (*candidates))
3761 return;
3764 /* Expand the CONSTRUCTOR into a new argument vec. */
3765 vec<tree, va_gc> *new_args;
3766 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3767 for (unsigned i = 0; i < nart; ++i)
3768 new_args->quick_push ((*args)[i]);
3769 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3770 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3772 /* We aren't looking for list-ctors anymore. */
3773 flags &= ~LOOKUP_LIST_ONLY;
3774 /* We allow more user-defined conversions within an init-list. */
3775 flags &= ~LOOKUP_NO_CONVERSION;
3777 add_candidates (fns, first_arg, new_args, NULL_TREE,
3778 explicit_targs, template_only, conversion_path,
3779 access_path, flags, candidates, complain);
3782 /* Returns the best overload candidate to perform the requested
3783 conversion. This function is used for three the overloading situations
3784 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3785 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3786 per [dcl.init.ref], so we ignore temporary bindings. */
3788 static struct z_candidate *
3789 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3790 tsubst_flags_t complain)
3792 struct z_candidate *candidates, *cand;
3793 tree fromtype;
3794 tree ctors = NULL_TREE;
3795 tree conv_fns = NULL_TREE;
3796 conversion *conv = NULL;
3797 tree first_arg = NULL_TREE;
3798 vec<tree, va_gc> *args = NULL;
3799 bool any_viable_p;
3800 int convflags;
3802 if (!expr)
3803 return NULL;
3805 fromtype = TREE_TYPE (expr);
3807 /* We represent conversion within a hierarchy using RVALUE_CONV and
3808 BASE_CONV, as specified by [over.best.ics]; these become plain
3809 constructor calls, as specified in [dcl.init]. */
3810 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3811 || !DERIVED_FROM_P (totype, fromtype));
3813 if (CLASS_TYPE_P (totype))
3814 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3815 creating a garbage BASELINK; constructors can't be inherited. */
3816 ctors = get_class_binding (totype, complete_ctor_identifier);
3818 if (MAYBE_CLASS_TYPE_P (fromtype))
3820 tree to_nonref = non_reference (totype);
3821 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3822 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3823 && DERIVED_FROM_P (to_nonref, fromtype)))
3825 /* [class.conv.fct] A conversion function is never used to
3826 convert a (possibly cv-qualified) object to the (possibly
3827 cv-qualified) same object type (or a reference to it), to a
3828 (possibly cv-qualified) base class of that type (or a
3829 reference to it)... */
3831 else
3832 conv_fns = lookup_conversions (fromtype);
3835 candidates = 0;
3836 flags |= LOOKUP_NO_CONVERSION;
3837 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3838 flags |= LOOKUP_NO_NARROWING;
3840 /* It's OK to bind a temporary for converting constructor arguments, but
3841 not in converting the return value of a conversion operator. */
3842 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3843 | (flags & LOOKUP_NO_NARROWING));
3844 flags &= ~LOOKUP_NO_TEMP_BIND;
3846 if (ctors)
3848 int ctorflags = flags;
3850 first_arg = build_dummy_object (totype);
3852 /* We should never try to call the abstract or base constructor
3853 from here. */
3854 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3855 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3857 args = make_tree_vector_single (expr);
3858 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3860 /* List-initialization. */
3861 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3862 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3863 ctorflags, &candidates, complain);
3865 else
3867 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3868 TYPE_BINFO (totype), TYPE_BINFO (totype),
3869 ctorflags, &candidates, complain);
3872 for (cand = candidates; cand; cand = cand->next)
3874 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3876 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3877 set, then this is copy-initialization. In that case, "The
3878 result of the call is then used to direct-initialize the
3879 object that is the destination of the copy-initialization."
3880 [dcl.init]
3882 We represent this in the conversion sequence with an
3883 rvalue conversion, which means a constructor call. */
3884 if (!TYPE_REF_P (totype)
3885 && !(convflags & LOOKUP_NO_TEMP_BIND))
3886 cand->second_conv
3887 = build_conv (ck_rvalue, totype, cand->second_conv);
3891 if (conv_fns)
3893 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3894 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3895 else
3896 first_arg = expr;
3899 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3901 tree conversion_path = TREE_PURPOSE (conv_fns);
3902 struct z_candidate *old_candidates;
3904 /* If we are called to convert to a reference type, we are trying to
3905 find a direct binding, so don't even consider temporaries. If
3906 we don't find a direct binding, the caller will try again to
3907 look for a temporary binding. */
3908 if (TYPE_REF_P (totype))
3909 convflags |= LOOKUP_NO_TEMP_BIND;
3911 old_candidates = candidates;
3912 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3913 NULL_TREE, false,
3914 conversion_path, TYPE_BINFO (fromtype),
3915 flags, &candidates, complain);
3917 for (cand = candidates; cand != old_candidates; cand = cand->next)
3919 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3920 conversion *ics
3921 = implicit_conversion (totype,
3922 rettype,
3924 /*c_cast_p=*/false, convflags,
3925 complain);
3927 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3928 copy-initialization. In that case, "The result of the
3929 call is then used to direct-initialize the object that is
3930 the destination of the copy-initialization." [dcl.init]
3932 We represent this in the conversion sequence with an
3933 rvalue conversion, which means a constructor call. But
3934 don't add a second rvalue conversion if there's already
3935 one there. Which there really shouldn't be, but it's
3936 harmless since we'd add it here anyway. */
3937 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3938 && !(convflags & LOOKUP_NO_TEMP_BIND))
3939 ics = build_conv (ck_rvalue, totype, ics);
3941 cand->second_conv = ics;
3943 if (!ics)
3945 cand->viable = 0;
3946 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3947 rettype, totype,
3948 EXPR_LOCATION (expr));
3950 else if (DECL_NONCONVERTING_P (cand->fn)
3951 && ics->rank > cr_exact)
3953 /* 13.3.1.5: For direct-initialization, those explicit
3954 conversion functions that are not hidden within S and
3955 yield type T or a type that can be converted to type T
3956 with a qualification conversion (4.4) are also candidate
3957 functions. */
3958 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3959 I've raised this issue with the committee. --jason 9/2011 */
3960 cand->viable = -1;
3961 cand->reason = explicit_conversion_rejection (rettype, totype);
3963 else if (cand->viable == 1 && ics->bad_p)
3965 cand->viable = -1;
3966 cand->reason
3967 = bad_arg_conversion_rejection (NULL_TREE, -2,
3968 rettype, totype,
3969 EXPR_LOCATION (expr));
3971 else if (primary_template_specialization_p (cand->fn)
3972 && ics->rank > cr_exact)
3974 /* 13.3.3.1.2: If the user-defined conversion is specified by
3975 a specialization of a conversion function template, the
3976 second standard conversion sequence shall have exact match
3977 rank. */
3978 cand->viable = -1;
3979 cand->reason = template_conversion_rejection (rettype, totype);
3984 candidates = splice_viable (candidates, false, &any_viable_p);
3985 if (!any_viable_p)
3987 if (args)
3988 release_tree_vector (args);
3989 return NULL;
3992 cand = tourney (candidates, complain);
3993 if (cand == NULL)
3995 if (complain & tf_error)
3997 auto_diagnostic_group d;
3998 error ("conversion from %qH to %qI is ambiguous",
3999 fromtype, totype);
4000 print_z_candidates (location_of (expr), candidates);
4003 cand = candidates; /* any one will do */
4004 cand->second_conv = build_ambiguous_conv (totype, expr);
4005 cand->second_conv->user_conv_p = true;
4006 if (!any_strictly_viable (candidates))
4007 cand->second_conv->bad_p = true;
4008 if (flags & LOOKUP_ONLYCONVERTING)
4009 cand->second_conv->need_temporary_p = true;
4010 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4011 ambiguous conversion is no worse than another user-defined
4012 conversion. */
4014 return cand;
4017 tree convtype;
4018 if (!DECL_CONSTRUCTOR_P (cand->fn))
4019 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
4020 else if (cand->second_conv->kind == ck_rvalue)
4021 /* DR 5: [in the first step of copy-initialization]...if the function
4022 is a constructor, the call initializes a temporary of the
4023 cv-unqualified version of the destination type. */
4024 convtype = cv_unqualified (totype);
4025 else
4026 convtype = totype;
4027 /* Build the user conversion sequence. */
4028 conv = build_conv
4029 (ck_user,
4030 convtype,
4031 build_identity_conv (TREE_TYPE (expr), expr));
4032 conv->cand = cand;
4033 if (cand->viable == -1)
4034 conv->bad_p = true;
4036 /* We're performing the maybe-rvalue overload resolution and
4037 a conversion function is in play. Reject converting the return
4038 value of the conversion function to a base class. */
4039 if ((flags & LOOKUP_PREFER_RVALUE) && !DECL_CONSTRUCTOR_P (cand->fn))
4040 for (conversion *t = cand->second_conv; t; t = next_conversion (t))
4041 if (t->kind == ck_base)
4042 return NULL;
4044 /* Remember that this was a list-initialization. */
4045 if (flags & LOOKUP_NO_NARROWING)
4046 conv->check_narrowing = true;
4048 /* Combine it with the second conversion sequence. */
4049 cand->second_conv = merge_conversion_sequences (conv,
4050 cand->second_conv);
4052 return cand;
4055 /* Wrapper for above. */
4057 tree
4058 build_user_type_conversion (tree totype, tree expr, int flags,
4059 tsubst_flags_t complain)
4061 struct z_candidate *cand;
4062 tree ret;
4064 bool subtime = timevar_cond_start (TV_OVERLOAD);
4065 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
4067 if (cand)
4069 if (cand->second_conv->kind == ck_ambig)
4070 ret = error_mark_node;
4071 else
4073 expr = convert_like (cand->second_conv, expr, complain);
4074 ret = convert_from_reference (expr);
4077 else
4078 ret = NULL_TREE;
4080 timevar_cond_stop (TV_OVERLOAD, subtime);
4081 return ret;
4084 /* Subroutine of convert_nontype_argument.
4086 EXPR is an expression used in a context that requires a converted
4087 constant-expression, such as a template non-type parameter. Do any
4088 necessary conversions (that are permitted for converted
4089 constant-expressions) to convert it to the desired type.
4091 If conversion is successful, returns the converted expression;
4092 otherwise, returns error_mark_node. */
4094 tree
4095 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4097 conversion *conv;
4098 void *p;
4099 tree t;
4100 location_t loc = cp_expr_loc_or_loc (expr, input_location);
4102 if (error_operand_p (expr))
4103 return error_mark_node;
4105 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4106 p = conversion_obstack_alloc (0);
4108 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4109 /*c_cast_p=*/false,
4110 LOOKUP_IMPLICIT, complain);
4112 /* A converted constant expression of type T is an expression, implicitly
4113 converted to type T, where the converted expression is a constant
4114 expression and the implicit conversion sequence contains only
4116 * user-defined conversions,
4117 * lvalue-to-rvalue conversions (7.1),
4118 * array-to-pointer conversions (7.2),
4119 * function-to-pointer conversions (7.3),
4120 * qualification conversions (7.5),
4121 * integral promotions (7.6),
4122 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4123 * null pointer conversions (7.11) from std::nullptr_t,
4124 * null member pointer conversions (7.12) from std::nullptr_t, and
4125 * function pointer conversions (7.13),
4127 and where the reference binding (if any) binds directly. */
4129 for (conversion *c = conv;
4130 conv && c->kind != ck_identity;
4131 c = next_conversion (c))
4133 switch (c->kind)
4135 /* A conversion function is OK. If it isn't constexpr, we'll
4136 complain later that the argument isn't constant. */
4137 case ck_user:
4138 /* The lvalue-to-rvalue conversion is OK. */
4139 case ck_rvalue:
4140 /* Array-to-pointer and function-to-pointer. */
4141 case ck_lvalue:
4142 /* Function pointer conversions. */
4143 case ck_fnptr:
4144 /* Qualification conversions. */
4145 case ck_qual:
4146 break;
4148 case ck_ref_bind:
4149 if (c->need_temporary_p)
4151 if (complain & tf_error)
4152 error_at (loc, "initializing %qH with %qI in converted "
4153 "constant expression does not bind directly",
4154 type, next_conversion (c)->type);
4155 conv = NULL;
4157 break;
4159 case ck_base:
4160 case ck_pmem:
4161 case ck_ptr:
4162 case ck_std:
4163 t = next_conversion (c)->type;
4164 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4165 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4166 /* Integral promotion or conversion. */
4167 break;
4168 if (NULLPTR_TYPE_P (t))
4169 /* Conversion from nullptr to pointer or pointer-to-member. */
4170 break;
4172 if (complain & tf_error)
4173 error_at (loc, "conversion from %qH to %qI in a "
4174 "converted constant expression", t, type);
4175 /* fall through. */
4177 default:
4178 conv = NULL;
4179 break;
4183 /* Avoid confusing convert_nontype_argument by introducing
4184 a redundant conversion to the same reference type. */
4185 if (conv && conv->kind == ck_ref_bind
4186 && REFERENCE_REF_P (expr))
4188 tree ref = TREE_OPERAND (expr, 0);
4189 if (same_type_p (type, TREE_TYPE (ref)))
4190 return ref;
4193 if (conv)
4195 conv->check_narrowing = true;
4196 conv->check_narrowing_const_only = true;
4197 expr = convert_like (conv, expr, complain);
4199 else
4201 if (complain & tf_error)
4202 error_at (loc, "could not convert %qE from %qH to %qI", expr,
4203 TREE_TYPE (expr), type);
4204 expr = error_mark_node;
4207 /* Free all the conversions we allocated. */
4208 obstack_free (&conversion_obstack, p);
4210 return expr;
4213 /* Do any initial processing on the arguments to a function call. */
4215 static vec<tree, va_gc> *
4216 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4218 unsigned int ix;
4219 tree arg;
4221 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4223 if (error_operand_p (arg))
4224 return NULL;
4225 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4227 if (complain & tf_error)
4228 error ("invalid use of void expression");
4229 return NULL;
4231 else if (invalid_nonstatic_memfn_p (arg->exp.locus, arg, complain))
4232 return NULL;
4234 return args;
4237 /* Perform overload resolution on FN, which is called with the ARGS.
4239 Return the candidate function selected by overload resolution, or
4240 NULL if the event that overload resolution failed. In the case
4241 that overload resolution fails, *CANDIDATES will be the set of
4242 candidates considered, and ANY_VIABLE_P will be set to true or
4243 false to indicate whether or not any of the candidates were
4244 viable.
4246 The ARGS should already have gone through RESOLVE_ARGS before this
4247 function is called. */
4249 static struct z_candidate *
4250 perform_overload_resolution (tree fn,
4251 const vec<tree, va_gc> *args,
4252 struct z_candidate **candidates,
4253 bool *any_viable_p, tsubst_flags_t complain)
4255 struct z_candidate *cand;
4256 tree explicit_targs;
4257 int template_only;
4259 bool subtime = timevar_cond_start (TV_OVERLOAD);
4261 explicit_targs = NULL_TREE;
4262 template_only = 0;
4264 *candidates = NULL;
4265 *any_viable_p = true;
4267 /* Check FN. */
4268 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4269 || TREE_CODE (fn) == TEMPLATE_DECL
4270 || TREE_CODE (fn) == OVERLOAD
4271 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4273 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4275 explicit_targs = TREE_OPERAND (fn, 1);
4276 fn = TREE_OPERAND (fn, 0);
4277 template_only = 1;
4280 /* Add the various candidate functions. */
4281 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4282 explicit_targs, template_only,
4283 /*conversion_path=*/NULL_TREE,
4284 /*access_path=*/NULL_TREE,
4285 LOOKUP_NORMAL,
4286 candidates, complain);
4288 *candidates = splice_viable (*candidates, false, any_viable_p);
4289 if (*any_viable_p)
4290 cand = tourney (*candidates, complain);
4291 else
4292 cand = NULL;
4294 timevar_cond_stop (TV_OVERLOAD, subtime);
4295 return cand;
4298 /* Print an error message about being unable to build a call to FN with
4299 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4300 be located; CANDIDATES is a possibly empty list of such
4301 functions. */
4303 static void
4304 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4305 struct z_candidate *candidates)
4307 tree targs = NULL_TREE;
4308 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4310 targs = TREE_OPERAND (fn, 1);
4311 fn = TREE_OPERAND (fn, 0);
4313 tree name = OVL_NAME (fn);
4314 location_t loc = location_of (name);
4315 if (targs)
4316 name = lookup_template_function (name, targs);
4318 auto_diagnostic_group d;
4319 if (!any_strictly_viable (candidates))
4320 error_at (loc, "no matching function for call to %<%D(%A)%>",
4321 name, build_tree_list_vec (args));
4322 else
4323 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4324 name, build_tree_list_vec (args));
4325 if (candidates)
4326 print_z_candidates (loc, candidates);
4329 /* Return an expression for a call to FN (a namespace-scope function,
4330 or a static member function) with the ARGS. This may change
4331 ARGS. */
4333 tree
4334 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4335 tsubst_flags_t complain)
4337 struct z_candidate *candidates, *cand;
4338 bool any_viable_p;
4339 void *p;
4340 tree result;
4342 if (args != NULL && *args != NULL)
4344 *args = resolve_args (*args, complain);
4345 if (*args == NULL)
4346 return error_mark_node;
4349 if (flag_tm)
4350 tm_malloc_replacement (fn);
4352 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4353 p = conversion_obstack_alloc (0);
4355 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4356 complain);
4358 if (!cand)
4360 if (complain & tf_error)
4362 // If there is a single (non-viable) function candidate,
4363 // let the error be diagnosed by cp_build_function_call_vec.
4364 if (!any_viable_p && candidates && ! candidates->next
4365 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4366 return cp_build_function_call_vec (candidates->fn, args, complain);
4368 // Otherwise, emit notes for non-viable candidates.
4369 print_error_for_call_failure (fn, *args, candidates);
4371 result = error_mark_node;
4373 else
4375 int flags = LOOKUP_NORMAL;
4376 /* If fn is template_id_expr, the call has explicit template arguments
4377 (e.g. func<int>(5)), communicate this info to build_over_call
4378 through flags so that later we can use it to decide whether to warn
4379 about peculiar null pointer conversion. */
4380 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4382 /* If overload resolution selects a specialization of a
4383 function concept for non-dependent template arguments,
4384 the expression is true if the constraints are satisfied
4385 and false otherwise.
4387 NOTE: This is an extension of Concepts Lite TS that
4388 allows constraints to be used in expressions. */
4389 if (flag_concepts && !processing_template_decl)
4391 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4392 tree targs = DECL_TI_ARGS (cand->fn);
4393 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4394 if (DECL_DECLARED_CONCEPT_P (decl))
4395 return evaluate_function_concept (decl, targs);
4398 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4401 result = build_over_call (cand, flags, complain);
4404 /* Free all the conversions we allocated. */
4405 obstack_free (&conversion_obstack, p);
4407 return result;
4410 /* Build a call to a global operator new. FNNAME is the name of the
4411 operator (either "operator new" or "operator new[]") and ARGS are
4412 the arguments provided. This may change ARGS. *SIZE points to the
4413 total number of bytes required by the allocation, and is updated if
4414 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4415 be used. If this function determines that no cookie should be
4416 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4417 is not NULL_TREE, it is evaluated before calculating the final
4418 array size, and if it fails, the array size is replaced with
4419 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4420 is non-NULL, it will be set, upon return, to the allocation
4421 function called. */
4423 tree
4424 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4425 tree *size, tree *cookie_size,
4426 tree align_arg, tree size_check,
4427 tree *fn, tsubst_flags_t complain)
4429 tree original_size = *size;
4430 tree fns;
4431 struct z_candidate *candidates;
4432 struct z_candidate *cand = NULL;
4433 bool any_viable_p;
4435 if (fn)
4436 *fn = NULL_TREE;
4437 /* Set to (size_t)-1 if the size check fails. */
4438 if (size_check != NULL_TREE)
4440 tree errval = TYPE_MAX_VALUE (sizetype);
4441 if (cxx_dialect >= cxx11 && flag_exceptions)
4442 errval = throw_bad_array_new_length ();
4443 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4444 original_size, errval);
4446 vec_safe_insert (*args, 0, *size);
4447 *args = resolve_args (*args, complain);
4448 if (*args == NULL)
4449 return error_mark_node;
4451 /* Based on:
4453 [expr.new]
4455 If this lookup fails to find the name, or if the allocated type
4456 is not a class type, the allocation function's name is looked
4457 up in the global scope.
4459 we disregard block-scope declarations of "operator new". */
4460 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4461 fns = lookup_arg_dependent (fnname, fns, *args);
4463 if (align_arg)
4465 vec<tree, va_gc>* align_args
4466 = vec_copy_and_insert (*args, align_arg, 1);
4467 cand = perform_overload_resolution (fns, align_args, &candidates,
4468 &any_viable_p, tf_none);
4469 if (cand)
4470 *args = align_args;
4471 /* If no aligned allocation function matches, try again without the
4472 alignment. */
4475 /* Figure out what function is being called. */
4476 if (!cand)
4477 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4478 complain);
4480 /* If no suitable function could be found, issue an error message
4481 and give up. */
4482 if (!cand)
4484 if (complain & tf_error)
4485 print_error_for_call_failure (fns, *args, candidates);
4486 return error_mark_node;
4489 /* If a cookie is required, add some extra space. Whether
4490 or not a cookie is required cannot be determined until
4491 after we know which function was called. */
4492 if (*cookie_size)
4494 bool use_cookie = true;
4495 tree arg_types;
4497 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4498 /* Skip the size_t parameter. */
4499 arg_types = TREE_CHAIN (arg_types);
4500 /* Check the remaining parameters (if any). */
4501 if (arg_types
4502 && TREE_CHAIN (arg_types) == void_list_node
4503 && same_type_p (TREE_VALUE (arg_types),
4504 ptr_type_node))
4505 use_cookie = false;
4506 /* If we need a cookie, adjust the number of bytes allocated. */
4507 if (use_cookie)
4509 /* Update the total size. */
4510 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4511 if (size_check)
4513 /* Set to (size_t)-1 if the size check fails. */
4514 gcc_assert (size_check != NULL_TREE);
4515 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4516 *size, TYPE_MAX_VALUE (sizetype));
4518 /* Update the argument list to reflect the adjusted size. */
4519 (**args)[0] = *size;
4521 else
4522 *cookie_size = NULL_TREE;
4525 /* Tell our caller which function we decided to call. */
4526 if (fn)
4527 *fn = cand->fn;
4529 /* Build the CALL_EXPR. */
4530 return build_over_call (cand, LOOKUP_NORMAL, complain);
4533 /* Build a new call to operator(). This may change ARGS. */
4535 static tree
4536 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4538 struct z_candidate *candidates = 0, *cand;
4539 tree fns, convs, first_mem_arg = NULL_TREE;
4540 bool any_viable_p;
4541 tree result = NULL_TREE;
4542 void *p;
4544 obj = mark_lvalue_use (obj);
4546 if (error_operand_p (obj))
4547 return error_mark_node;
4549 tree type = TREE_TYPE (obj);
4551 obj = prep_operand (obj);
4553 if (TYPE_PTRMEMFUNC_P (type))
4555 if (complain & tf_error)
4556 /* It's no good looking for an overloaded operator() on a
4557 pointer-to-member-function. */
4558 error ("pointer-to-member function %qE cannot be called without "
4559 "an object; consider using %<.*%> or %<->*%>", obj);
4560 return error_mark_node;
4563 if (TYPE_BINFO (type))
4565 fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1);
4566 if (fns == error_mark_node)
4567 return error_mark_node;
4569 else
4570 fns = NULL_TREE;
4572 if (args != NULL && *args != NULL)
4574 *args = resolve_args (*args, complain);
4575 if (*args == NULL)
4576 return error_mark_node;
4579 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4580 p = conversion_obstack_alloc (0);
4582 if (fns)
4584 first_mem_arg = obj;
4586 add_candidates (BASELINK_FUNCTIONS (fns),
4587 first_mem_arg, *args, NULL_TREE,
4588 NULL_TREE, false,
4589 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4590 LOOKUP_NORMAL, &candidates, complain);
4593 convs = lookup_conversions (type);
4595 for (; convs; convs = TREE_CHAIN (convs))
4597 tree totype = TREE_TYPE (convs);
4599 if (TYPE_PTRFN_P (totype)
4600 || TYPE_REFFN_P (totype)
4601 || (TYPE_REF_P (totype)
4602 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4603 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4605 tree fn = *iter;
4607 if (DECL_NONCONVERTING_P (fn))
4608 continue;
4610 if (TREE_CODE (fn) == TEMPLATE_DECL)
4611 add_template_conv_candidate
4612 (&candidates, fn, obj, *args, totype,
4613 /*access_path=*/NULL_TREE,
4614 /*conversion_path=*/NULL_TREE, complain);
4615 else
4616 add_conv_candidate (&candidates, fn, obj,
4617 *args, /*conversion_path=*/NULL_TREE,
4618 /*access_path=*/NULL_TREE, complain);
4622 /* Be strict here because if we choose a bad conversion candidate, the
4623 errors we get won't mention the call context. */
4624 candidates = splice_viable (candidates, true, &any_viable_p);
4625 if (!any_viable_p)
4627 if (complain & tf_error)
4629 auto_diagnostic_group d;
4630 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4631 build_tree_list_vec (*args));
4632 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4634 result = error_mark_node;
4636 else
4638 cand = tourney (candidates, complain);
4639 if (cand == 0)
4641 if (complain & tf_error)
4643 auto_diagnostic_group d;
4644 error ("call of %<(%T) (%A)%> is ambiguous",
4645 TREE_TYPE (obj), build_tree_list_vec (*args));
4646 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4648 result = error_mark_node;
4650 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4651 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
4652 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR))
4653 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4654 else
4656 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4657 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4658 -1, complain);
4659 else
4661 gcc_checking_assert (TYPE_P (cand->fn));
4662 obj = convert_like (cand->convs[0], obj, complain);
4664 obj = convert_from_reference (obj);
4665 result = cp_build_function_call_vec (obj, args, complain);
4669 /* Free all the conversions we allocated. */
4670 obstack_free (&conversion_obstack, p);
4672 return result;
4675 /* Wrapper for above. */
4677 tree
4678 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4680 tree ret;
4681 bool subtime = timevar_cond_start (TV_OVERLOAD);
4682 ret = build_op_call_1 (obj, args, complain);
4683 timevar_cond_stop (TV_OVERLOAD, subtime);
4684 return ret;
4687 /* Called by op_error to prepare format strings suitable for the error
4688 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4689 and a suffix (controlled by NTYPES). */
4691 static const char *
4692 op_error_string (const char *errmsg, int ntypes, bool match)
4694 const char *msg;
4696 const char *msgp = concat (match ? G_("ambiguous overload for ")
4697 : G_("no match for "), errmsg, NULL);
4699 if (ntypes == 3)
4700 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4701 else if (ntypes == 2)
4702 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4703 else
4704 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4706 return msg;
4709 static void
4710 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4711 tree arg1, tree arg2, tree arg3, bool match)
4713 bool assop = code == MODIFY_EXPR;
4714 const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name;
4716 switch (code)
4718 case COND_EXPR:
4719 if (flag_diagnostics_show_caret)
4720 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4721 3, match),
4722 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4723 else
4724 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4725 "in %<%E ? %E : %E%>"), 3, match),
4726 arg1, arg2, arg3,
4727 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4728 break;
4730 case POSTINCREMENT_EXPR:
4731 case POSTDECREMENT_EXPR:
4732 if (flag_diagnostics_show_caret)
4733 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4734 opname, TREE_TYPE (arg1));
4735 else
4736 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4737 1, match),
4738 opname, arg1, opname, TREE_TYPE (arg1));
4739 break;
4741 case ARRAY_REF:
4742 if (flag_diagnostics_show_caret)
4743 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4744 TREE_TYPE (arg1), TREE_TYPE (arg2));
4745 else
4746 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4747 2, match),
4748 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4749 break;
4751 case REALPART_EXPR:
4752 case IMAGPART_EXPR:
4753 if (flag_diagnostics_show_caret)
4754 error_at (loc, op_error_string (G_("%qs"), 1, match),
4755 opname, TREE_TYPE (arg1));
4756 else
4757 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4758 opname, opname, arg1, TREE_TYPE (arg1));
4759 break;
4761 default:
4762 if (arg2)
4763 if (flag_diagnostics_show_caret)
4764 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4765 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4766 else
4767 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4768 2, match),
4769 opname, arg1, opname, arg2,
4770 TREE_TYPE (arg1), TREE_TYPE (arg2));
4771 else
4772 if (flag_diagnostics_show_caret)
4773 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4774 opname, TREE_TYPE (arg1));
4775 else
4776 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4777 1, match),
4778 opname, opname, arg1, TREE_TYPE (arg1));
4779 break;
4783 /* Return the implicit conversion sequence that could be used to
4784 convert E1 to E2 in [expr.cond]. */
4786 static conversion *
4787 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4789 tree t1 = non_reference (TREE_TYPE (e1));
4790 tree t2 = non_reference (TREE_TYPE (e2));
4791 conversion *conv;
4792 bool good_base;
4794 /* [expr.cond]
4796 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4797 implicitly converted (clause _conv_) to the type "lvalue reference to
4798 T2", subject to the constraint that in the conversion the
4799 reference must bind directly (_dcl.init.ref_) to an lvalue.
4801 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4802 implicitly converted to the type "rvalue reference to T2", subject to
4803 the constraint that the reference must bind directly. */
4804 if (glvalue_p (e2))
4806 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4807 conv = implicit_conversion (rtype,
4810 /*c_cast_p=*/false,
4811 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4812 |LOOKUP_ONLYCONVERTING,
4813 complain);
4814 if (conv && !conv->bad_p)
4815 return conv;
4818 /* If E2 is a prvalue or if neither of the conversions above can be done
4819 and at least one of the operands has (possibly cv-qualified) class
4820 type: */
4821 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4822 return NULL;
4824 /* [expr.cond]
4826 If E1 and E2 have class type, and the underlying class types are
4827 the same or one is a base class of the other: E1 can be converted
4828 to match E2 if the class of T2 is the same type as, or a base
4829 class of, the class of T1, and the cv-qualification of T2 is the
4830 same cv-qualification as, or a greater cv-qualification than, the
4831 cv-qualification of T1. If the conversion is applied, E1 is
4832 changed to an rvalue of type T2 that still refers to the original
4833 source class object (or the appropriate subobject thereof). */
4834 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4835 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4837 if (good_base && at_least_as_qualified_p (t2, t1))
4839 conv = build_identity_conv (t1, e1);
4840 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4841 TYPE_MAIN_VARIANT (t2)))
4842 conv = build_conv (ck_base, t2, conv);
4843 else
4844 conv = build_conv (ck_rvalue, t2, conv);
4845 return conv;
4847 else
4848 return NULL;
4850 else
4851 /* [expr.cond]
4853 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4854 converted to the type that expression E2 would have if E2 were
4855 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4856 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4857 LOOKUP_IMPLICIT, complain);
4860 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4861 arguments to the conditional expression. */
4863 static tree
4864 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4865 tsubst_flags_t complain)
4867 tree arg2_type;
4868 tree arg3_type;
4869 tree result = NULL_TREE;
4870 tree result_type = NULL_TREE;
4871 bool is_glvalue = true;
4872 struct z_candidate *candidates = 0;
4873 struct z_candidate *cand;
4874 void *p;
4875 tree orig_arg2, orig_arg3;
4877 /* As a G++ extension, the second argument to the conditional can be
4878 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4879 c'.) If the second operand is omitted, make sure it is
4880 calculated only once. */
4881 if (!arg2)
4883 if (complain & tf_error)
4884 pedwarn (loc, OPT_Wpedantic,
4885 "ISO C++ forbids omitting the middle term of a ?: expression");
4887 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4888 warn_for_omitted_condop (loc, arg1);
4890 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4891 if (lvalue_p (arg1))
4892 arg2 = arg1 = cp_stabilize_reference (arg1);
4893 else
4894 arg2 = arg1 = cp_save_expr (arg1);
4897 /* If something has already gone wrong, just pass that fact up the
4898 tree. */
4899 if (error_operand_p (arg1)
4900 || error_operand_p (arg2)
4901 || error_operand_p (arg3))
4902 return error_mark_node;
4904 orig_arg2 = arg2;
4905 orig_arg3 = arg3;
4907 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4909 tree arg1_type = TREE_TYPE (arg1);
4911 /* If arg1 is another cond_expr choosing between -1 and 0,
4912 then we can use its comparison. It may help to avoid
4913 additional comparison, produce more accurate diagnostics
4914 and enables folding. */
4915 if (TREE_CODE (arg1) == VEC_COND_EXPR
4916 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4917 && integer_zerop (TREE_OPERAND (arg1, 2)))
4918 arg1 = TREE_OPERAND (arg1, 0);
4920 arg1 = force_rvalue (arg1, complain);
4921 arg2 = force_rvalue (arg2, complain);
4922 arg3 = force_rvalue (arg3, complain);
4924 /* force_rvalue can return error_mark on valid arguments. */
4925 if (error_operand_p (arg1)
4926 || error_operand_p (arg2)
4927 || error_operand_p (arg3))
4928 return error_mark_node;
4930 arg2_type = TREE_TYPE (arg2);
4931 arg3_type = TREE_TYPE (arg3);
4933 if (!VECTOR_TYPE_P (arg2_type)
4934 && !VECTOR_TYPE_P (arg3_type))
4936 /* Rely on the error messages of the scalar version. */
4937 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4938 orig_arg2, orig_arg3, complain);
4939 if (scal == error_mark_node)
4940 return error_mark_node;
4941 tree stype = TREE_TYPE (scal);
4942 tree ctype = TREE_TYPE (arg1_type);
4943 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4944 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4946 if (complain & tf_error)
4947 error_at (loc, "inferred scalar type %qT is not an integer or "
4948 "floating point type of the same size as %qT", stype,
4949 COMPARISON_CLASS_P (arg1)
4950 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4951 : ctype);
4952 return error_mark_node;
4955 tree vtype = build_opaque_vector_type (stype,
4956 TYPE_VECTOR_SUBPARTS (arg1_type));
4957 /* We could pass complain & tf_warning to unsafe_conversion_p,
4958 but the warnings (like Wsign-conversion) have already been
4959 given by the scalar build_conditional_expr_1. We still check
4960 unsafe_conversion_p to forbid truncating long long -> float. */
4961 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4963 if (complain & tf_error)
4964 error_at (loc, "conversion of scalar %qH to vector %qI "
4965 "involves truncation", arg2_type, vtype);
4966 return error_mark_node;
4968 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4970 if (complain & tf_error)
4971 error_at (loc, "conversion of scalar %qH to vector %qI "
4972 "involves truncation", arg3_type, vtype);
4973 return error_mark_node;
4976 arg2 = cp_convert (stype, arg2, complain);
4977 arg2 = save_expr (arg2);
4978 arg2 = build_vector_from_val (vtype, arg2);
4979 arg2_type = vtype;
4980 arg3 = cp_convert (stype, arg3, complain);
4981 arg3 = save_expr (arg3);
4982 arg3 = build_vector_from_val (vtype, arg3);
4983 arg3_type = vtype;
4986 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4988 enum stv_conv convert_flag =
4989 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4990 complain & tf_error);
4992 switch (convert_flag)
4994 case stv_error:
4995 return error_mark_node;
4996 case stv_firstarg:
4998 arg2 = save_expr (arg2);
4999 arg2 = convert (TREE_TYPE (arg3_type), arg2);
5000 arg2 = build_vector_from_val (arg3_type, arg2);
5001 arg2_type = TREE_TYPE (arg2);
5002 break;
5004 case stv_secondarg:
5006 arg3 = save_expr (arg3);
5007 arg3 = convert (TREE_TYPE (arg2_type), arg3);
5008 arg3 = build_vector_from_val (arg2_type, arg3);
5009 arg3_type = TREE_TYPE (arg3);
5010 break;
5012 default:
5013 break;
5017 if (!same_type_p (arg2_type, arg3_type)
5018 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type),
5019 TYPE_VECTOR_SUBPARTS (arg2_type))
5020 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
5022 if (complain & tf_error)
5023 error_at (loc,
5024 "incompatible vector types in conditional expression: "
5025 "%qT, %qT and %qT", TREE_TYPE (arg1),
5026 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
5027 return error_mark_node;
5030 if (!COMPARISON_CLASS_P (arg1))
5032 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
5033 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
5035 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
5038 /* [expr.cond]
5040 The first expression is implicitly converted to bool (clause
5041 _conv_). */
5042 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
5043 LOOKUP_NORMAL);
5044 if (error_operand_p (arg1))
5045 return error_mark_node;
5047 /* [expr.cond]
5049 If either the second or the third operand has type (possibly
5050 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5051 array-to-pointer (_conv.array_), and function-to-pointer
5052 (_conv.func_) standard conversions are performed on the second
5053 and third operands. */
5054 arg2_type = unlowered_expr_type (arg2);
5055 arg3_type = unlowered_expr_type (arg3);
5056 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
5058 /* [expr.cond]
5060 One of the following shall hold:
5062 --The second or the third operand (but not both) is a
5063 throw-expression (_except.throw_); the result is of the type
5064 and value category of the other.
5066 --Both the second and the third operands have type void; the
5067 result is of type void and is a prvalue. */
5068 if (TREE_CODE (arg2) == THROW_EXPR
5069 && TREE_CODE (arg3) != THROW_EXPR)
5071 result_type = arg3_type;
5072 is_glvalue = glvalue_p (arg3);
5074 else if (TREE_CODE (arg2) != THROW_EXPR
5075 && TREE_CODE (arg3) == THROW_EXPR)
5077 result_type = arg2_type;
5078 is_glvalue = glvalue_p (arg2);
5080 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5082 result_type = void_type_node;
5083 is_glvalue = false;
5085 else
5087 if (complain & tf_error)
5089 if (VOID_TYPE_P (arg2_type))
5090 error_at (cp_expr_loc_or_loc (arg3, loc),
5091 "second operand to the conditional operator "
5092 "is of type %<void%>, but the third operand is "
5093 "neither a throw-expression nor of type %<void%>");
5094 else
5095 error_at (cp_expr_loc_or_loc (arg2, loc),
5096 "third operand to the conditional operator "
5097 "is of type %<void%>, but the second operand is "
5098 "neither a throw-expression nor of type %<void%>");
5100 return error_mark_node;
5103 goto valid_operands;
5105 /* [expr.cond]
5107 Otherwise, if the second and third operand have different types,
5108 and either has (possibly cv-qualified) class type, or if both are
5109 glvalues of the same value category and the same type except for
5110 cv-qualification, an attempt is made to convert each of those operands
5111 to the type of the other. */
5112 else if (!same_type_p (arg2_type, arg3_type)
5113 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5114 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5115 arg3_type)
5116 && glvalue_p (arg2) && glvalue_p (arg3)
5117 && lvalue_p (arg2) == lvalue_p (arg3))))
5119 conversion *conv2;
5120 conversion *conv3;
5121 bool converted = false;
5123 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5124 p = conversion_obstack_alloc (0);
5126 conv2 = conditional_conversion (arg2, arg3, complain);
5127 conv3 = conditional_conversion (arg3, arg2, complain);
5129 /* [expr.cond]
5131 If both can be converted, or one can be converted but the
5132 conversion is ambiguous, the program is ill-formed. If
5133 neither can be converted, the operands are left unchanged and
5134 further checking is performed as described below. If exactly
5135 one conversion is possible, that conversion is applied to the
5136 chosen operand and the converted operand is used in place of
5137 the original operand for the remainder of this section. */
5138 if ((conv2 && !conv2->bad_p
5139 && conv3 && !conv3->bad_p)
5140 || (conv2 && conv2->kind == ck_ambig)
5141 || (conv3 && conv3->kind == ck_ambig))
5143 if (complain & tf_error)
5145 error_at (loc, "operands to ?: have different types %qT and %qT",
5146 arg2_type, arg3_type);
5147 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5148 inform (loc, " and each type can be converted to the other");
5149 else if (conv2 && conv2->kind == ck_ambig)
5150 convert_like (conv2, arg2, complain);
5151 else
5152 convert_like (conv3, arg3, complain);
5154 result = error_mark_node;
5156 else if (conv2 && !conv2->bad_p)
5158 arg2 = convert_like (conv2, arg2, complain);
5159 arg2 = convert_from_reference (arg2);
5160 arg2_type = TREE_TYPE (arg2);
5161 /* Even if CONV2 is a valid conversion, the result of the
5162 conversion may be invalid. For example, if ARG3 has type
5163 "volatile X", and X does not have a copy constructor
5164 accepting a "volatile X&", then even if ARG2 can be
5165 converted to X, the conversion will fail. */
5166 if (error_operand_p (arg2))
5167 result = error_mark_node;
5168 converted = true;
5170 else if (conv3 && !conv3->bad_p)
5172 arg3 = convert_like (conv3, arg3, complain);
5173 arg3 = convert_from_reference (arg3);
5174 arg3_type = TREE_TYPE (arg3);
5175 if (error_operand_p (arg3))
5176 result = error_mark_node;
5177 converted = true;
5180 /* Free all the conversions we allocated. */
5181 obstack_free (&conversion_obstack, p);
5183 if (result)
5184 return result;
5186 /* If, after the conversion, both operands have class type,
5187 treat the cv-qualification of both operands as if it were the
5188 union of the cv-qualification of the operands.
5190 The standard is not clear about what to do in this
5191 circumstance. For example, if the first operand has type
5192 "const X" and the second operand has a user-defined
5193 conversion to "volatile X", what is the type of the second
5194 operand after this step? Making it be "const X" (matching
5195 the first operand) seems wrong, as that discards the
5196 qualification without actually performing a copy. Leaving it
5197 as "volatile X" seems wrong as that will result in the
5198 conditional expression failing altogether, even though,
5199 according to this step, the one operand could be converted to
5200 the type of the other. */
5201 if (converted
5202 && CLASS_TYPE_P (arg2_type)
5203 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5204 arg2_type = arg3_type =
5205 cp_build_qualified_type (arg2_type,
5206 cp_type_quals (arg2_type)
5207 | cp_type_quals (arg3_type));
5210 /* [expr.cond]
5212 If the second and third operands are glvalues of the same value
5213 category and have the same type, the result is of that type and
5214 value category. */
5215 if (((lvalue_p (arg2) && lvalue_p (arg3))
5216 || (xvalue_p (arg2) && xvalue_p (arg3)))
5217 && same_type_p (arg2_type, arg3_type))
5219 result_type = arg2_type;
5220 arg2 = mark_lvalue_use (arg2);
5221 arg3 = mark_lvalue_use (arg3);
5222 goto valid_operands;
5225 /* [expr.cond]
5227 Otherwise, the result is an rvalue. If the second and third
5228 operand do not have the same type, and either has (possibly
5229 cv-qualified) class type, overload resolution is used to
5230 determine the conversions (if any) to be applied to the operands
5231 (_over.match.oper_, _over.built_). */
5232 is_glvalue = false;
5233 if (!same_type_p (arg2_type, arg3_type)
5234 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5236 tree args[3];
5237 conversion *conv;
5238 bool any_viable_p;
5240 /* Rearrange the arguments so that add_builtin_candidate only has
5241 to know about two args. In build_builtin_candidate, the
5242 arguments are unscrambled. */
5243 args[0] = arg2;
5244 args[1] = arg3;
5245 args[2] = arg1;
5246 add_builtin_candidates (&candidates,
5247 COND_EXPR,
5248 NOP_EXPR,
5249 ovl_op_identifier (false, COND_EXPR),
5250 args,
5251 LOOKUP_NORMAL, complain);
5253 /* [expr.cond]
5255 If the overload resolution fails, the program is
5256 ill-formed. */
5257 candidates = splice_viable (candidates, false, &any_viable_p);
5258 if (!any_viable_p)
5260 if (complain & tf_error)
5261 error_at (loc, "operands to ?: have different types %qT and %qT",
5262 arg2_type, arg3_type);
5263 return error_mark_node;
5265 cand = tourney (candidates, complain);
5266 if (!cand)
5268 if (complain & tf_error)
5270 auto_diagnostic_group d;
5271 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5272 print_z_candidates (loc, candidates);
5274 return error_mark_node;
5277 /* [expr.cond]
5279 Otherwise, the conversions thus determined are applied, and
5280 the converted operands are used in place of the original
5281 operands for the remainder of this section. */
5282 conv = cand->convs[0];
5283 arg1 = convert_like (conv, arg1, complain);
5284 conv = cand->convs[1];
5285 arg2 = convert_like (conv, arg2, complain);
5286 arg2_type = TREE_TYPE (arg2);
5287 conv = cand->convs[2];
5288 arg3 = convert_like (conv, arg3, complain);
5289 arg3_type = TREE_TYPE (arg3);
5292 /* [expr.cond]
5294 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5295 and function-to-pointer (_conv.func_) standard conversions are
5296 performed on the second and third operands.
5298 We need to force the lvalue-to-rvalue conversion here for class types,
5299 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5300 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5301 regions. */
5303 arg2 = force_rvalue (arg2, complain);
5304 if (!CLASS_TYPE_P (arg2_type))
5305 arg2_type = TREE_TYPE (arg2);
5307 arg3 = force_rvalue (arg3, complain);
5308 if (!CLASS_TYPE_P (arg3_type))
5309 arg3_type = TREE_TYPE (arg3);
5311 if (arg2 == error_mark_node || arg3 == error_mark_node)
5312 return error_mark_node;
5314 /* [expr.cond]
5316 After those conversions, one of the following shall hold:
5318 --The second and third operands have the same type; the result is of
5319 that type. */
5320 if (same_type_p (arg2_type, arg3_type))
5321 result_type = arg2_type;
5322 /* [expr.cond]
5324 --The second and third operands have arithmetic or enumeration
5325 type; the usual arithmetic conversions are performed to bring
5326 them to a common type, and the result is of that type. */
5327 else if ((ARITHMETIC_TYPE_P (arg2_type)
5328 || UNSCOPED_ENUM_P (arg2_type))
5329 && (ARITHMETIC_TYPE_P (arg3_type)
5330 || UNSCOPED_ENUM_P (arg3_type)))
5332 /* In this case, there is always a common type. */
5333 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5334 arg3_type);
5335 if (complain & tf_warning)
5336 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5337 "implicit conversion from %qH to %qI to "
5338 "match other result of conditional",
5339 loc);
5341 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5342 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5344 if (TREE_CODE (orig_arg2) == CONST_DECL
5345 && TREE_CODE (orig_arg3) == CONST_DECL
5346 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5347 /* Two enumerators from the same enumeration can have different
5348 types when the enumeration is still being defined. */;
5349 else if (complain & tf_warning)
5350 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5351 "conditional expression: %qT vs %qT",
5352 arg2_type, arg3_type);
5354 else if (extra_warnings
5355 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5356 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5357 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5358 && !same_type_p (arg2_type,
5359 type_promotes_to (arg3_type)))))
5361 if (complain & tf_warning)
5362 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5363 "conditional expression");
5366 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5367 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5369 /* [expr.cond]
5371 --The second and third operands have pointer type, or one has
5372 pointer type and the other is a null pointer constant; pointer
5373 conversions (_conv.ptr_) and qualification conversions
5374 (_conv.qual_) are performed to bring them to their composite
5375 pointer type (_expr.rel_). The result is of the composite
5376 pointer type.
5378 --The second and third operands have pointer to member type, or
5379 one has pointer to member type and the other is a null pointer
5380 constant; pointer to member conversions (_conv.mem_) and
5381 qualification conversions (_conv.qual_) are performed to bring
5382 them to a common type, whose cv-qualification shall match the
5383 cv-qualification of either the second or the third operand.
5384 The result is of the common type. */
5385 else if ((null_ptr_cst_p (arg2)
5386 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5387 || (null_ptr_cst_p (arg3)
5388 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5389 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5390 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5391 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5393 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5394 arg3, CPO_CONDITIONAL_EXPR,
5395 complain);
5396 if (result_type == error_mark_node)
5397 return error_mark_node;
5398 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5399 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5402 if (!result_type)
5404 if (complain & tf_error)
5405 error_at (loc, "operands to ?: have different types %qT and %qT",
5406 arg2_type, arg3_type);
5407 return error_mark_node;
5410 if (arg2 == error_mark_node || arg3 == error_mark_node)
5411 return error_mark_node;
5413 valid_operands:
5414 if (processing_template_decl && is_glvalue)
5416 /* Let lvalue_kind know this was a glvalue. */
5417 tree arg = (result_type == arg2_type ? arg2 : arg3);
5418 result_type = cp_build_reference_type (result_type, xvalue_p (arg));
5421 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5423 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5424 warn here, because the COND_EXPR will be turned into ARG2. */
5425 if (warn_duplicated_branches
5426 && (complain & tf_warning)
5427 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5428 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5429 "this condition has identical branches");
5431 /* We can't use result_type below, as fold might have returned a
5432 throw_expr. */
5434 if (!is_glvalue)
5436 /* Expand both sides into the same slot, hopefully the target of
5437 the ?: expression. We used to check for TARGET_EXPRs here,
5438 but now we sometimes wrap them in NOP_EXPRs so the test would
5439 fail. */
5440 if (CLASS_TYPE_P (TREE_TYPE (result)))
5441 result = get_target_expr_sfinae (result, complain);
5442 /* If this expression is an rvalue, but might be mistaken for an
5443 lvalue, we must add a NON_LVALUE_EXPR. */
5444 result = rvalue (result);
5446 else
5447 result = force_paren_expr (result);
5449 return result;
5452 /* Wrapper for above. */
5454 tree
5455 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5456 tsubst_flags_t complain)
5458 tree ret;
5459 bool subtime = timevar_cond_start (TV_OVERLOAD);
5460 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5461 timevar_cond_stop (TV_OVERLOAD, subtime);
5462 return ret;
5465 /* OPERAND is an operand to an expression. Perform necessary steps
5466 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5467 returned. */
5469 static tree
5470 prep_operand (tree operand)
5472 if (operand)
5474 if (CLASS_TYPE_P (TREE_TYPE (operand))
5475 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5476 /* Make sure the template type is instantiated now. */
5477 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5480 return operand;
5483 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5484 OVERLOAD) to the CANDIDATES, returning an updated list of
5485 CANDIDATES. The ARGS are the arguments provided to the call;
5486 if FIRST_ARG is non-null it is the implicit object argument,
5487 otherwise the first element of ARGS is used if needed. The
5488 EXPLICIT_TARGS are explicit template arguments provided.
5489 TEMPLATE_ONLY is true if only template functions should be
5490 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5491 add_function_candidate. */
5493 static void
5494 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5495 tree return_type,
5496 tree explicit_targs, bool template_only,
5497 tree conversion_path, tree access_path,
5498 int flags,
5499 struct z_candidate **candidates,
5500 tsubst_flags_t complain)
5502 tree ctype;
5503 const vec<tree, va_gc> *non_static_args;
5504 bool check_list_ctor = false;
5505 bool check_converting = false;
5506 unification_kind_t strict;
5508 if (!fns)
5509 return;
5511 /* Precalculate special handling of constructors and conversion ops. */
5512 tree fn = OVL_FIRST (fns);
5513 if (DECL_CONV_FN_P (fn))
5515 check_list_ctor = false;
5516 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5517 if (flags & LOOKUP_NO_CONVERSION)
5518 /* We're doing return_type(x). */
5519 strict = DEDUCE_CONV;
5520 else
5521 /* We're doing x.operator return_type(). */
5522 strict = DEDUCE_EXACT;
5523 /* [over.match.funcs] For conversion functions, the function
5524 is considered to be a member of the class of the implicit
5525 object argument for the purpose of defining the type of
5526 the implicit object parameter. */
5527 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5529 else
5531 if (DECL_CONSTRUCTOR_P (fn))
5533 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5534 /* For list-initialization we consider explicit constructors
5535 and complain if one is chosen. */
5536 check_converting
5537 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5538 == LOOKUP_ONLYCONVERTING);
5540 strict = DEDUCE_CALL;
5541 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5544 if (first_arg)
5545 non_static_args = args;
5546 else
5547 /* Delay creating the implicit this parameter until it is needed. */
5548 non_static_args = NULL;
5550 for (lkp_iterator iter (fns); iter; ++iter)
5552 fn = *iter;
5554 if (check_converting && DECL_NONCONVERTING_P (fn))
5555 continue;
5556 if (check_list_ctor && !is_list_ctor (fn))
5557 continue;
5559 tree fn_first_arg = NULL_TREE;
5560 const vec<tree, va_gc> *fn_args = args;
5562 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5564 /* Figure out where the object arg comes from. If this
5565 function is a non-static member and we didn't get an
5566 implicit object argument, move it out of args. */
5567 if (first_arg == NULL_TREE)
5569 unsigned int ix;
5570 tree arg;
5571 vec<tree, va_gc> *tempvec;
5572 vec_alloc (tempvec, args->length () - 1);
5573 for (ix = 1; args->iterate (ix, &arg); ++ix)
5574 tempvec->quick_push (arg);
5575 non_static_args = tempvec;
5576 first_arg = (*args)[0];
5579 fn_first_arg = first_arg;
5580 fn_args = non_static_args;
5583 if (TREE_CODE (fn) == TEMPLATE_DECL)
5584 add_template_candidate (candidates,
5586 ctype,
5587 explicit_targs,
5588 fn_first_arg,
5589 fn_args,
5590 return_type,
5591 access_path,
5592 conversion_path,
5593 flags,
5594 strict,
5595 complain);
5596 else if (!template_only)
5597 add_function_candidate (candidates,
5599 ctype,
5600 fn_first_arg,
5601 fn_args,
5602 access_path,
5603 conversion_path,
5604 flags,
5605 NULL,
5606 complain);
5610 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5611 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5613 static int
5614 op_is_ordered (tree_code code)
5616 switch (code)
5618 // 5. b @= a
5619 case MODIFY_EXPR:
5620 return (flag_strong_eval_order > 1 ? -1 : 0);
5622 // 6. a[b]
5623 case ARRAY_REF:
5624 return (flag_strong_eval_order > 1 ? 1 : 0);
5626 // 1. a.b
5627 // Not overloadable (yet).
5628 // 2. a->b
5629 // Only one argument.
5630 // 3. a->*b
5631 case MEMBER_REF:
5632 // 7. a << b
5633 case LSHIFT_EXPR:
5634 // 8. a >> b
5635 case RSHIFT_EXPR:
5636 return (flag_strong_eval_order ? 1 : 0);
5638 default:
5639 return 0;
5643 static tree
5644 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5645 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5647 struct z_candidate *candidates = 0, *cand;
5648 vec<tree, va_gc> *arglist;
5649 tree args[3];
5650 tree result = NULL_TREE;
5651 bool result_valid_p = false;
5652 enum tree_code code2 = NOP_EXPR;
5653 enum tree_code code_orig_arg1 = ERROR_MARK;
5654 enum tree_code code_orig_arg2 = ERROR_MARK;
5655 conversion *conv;
5656 void *p;
5657 bool strict_p;
5658 bool any_viable_p;
5660 if (error_operand_p (arg1)
5661 || error_operand_p (arg2)
5662 || error_operand_p (arg3))
5663 return error_mark_node;
5665 bool ismodop = code == MODIFY_EXPR;
5666 if (ismodop)
5668 code2 = TREE_CODE (arg3);
5669 arg3 = NULL_TREE;
5671 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
5673 arg1 = prep_operand (arg1);
5675 bool memonly = false;
5676 switch (code)
5678 case NEW_EXPR:
5679 case VEC_NEW_EXPR:
5680 case VEC_DELETE_EXPR:
5681 case DELETE_EXPR:
5682 /* Use build_op_new_call and build_op_delete_call instead. */
5683 gcc_unreachable ();
5685 case CALL_EXPR:
5686 /* Use build_op_call instead. */
5687 gcc_unreachable ();
5689 case TRUTH_ORIF_EXPR:
5690 case TRUTH_ANDIF_EXPR:
5691 case TRUTH_AND_EXPR:
5692 case TRUTH_OR_EXPR:
5693 /* These are saved for the sake of warn_logical_operator. */
5694 code_orig_arg1 = TREE_CODE (arg1);
5695 code_orig_arg2 = TREE_CODE (arg2);
5696 break;
5697 case GT_EXPR:
5698 case LT_EXPR:
5699 case GE_EXPR:
5700 case LE_EXPR:
5701 case EQ_EXPR:
5702 case NE_EXPR:
5703 /* These are saved for the sake of maybe_warn_bool_compare. */
5704 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5705 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5706 break;
5708 /* =, ->, [], () must be non-static member functions. */
5709 case MODIFY_EXPR:
5710 if (code2 != NOP_EXPR)
5711 break;
5712 /* FALLTHRU */
5713 case COMPONENT_REF:
5714 case ARRAY_REF:
5715 memonly = true;
5716 break;
5718 default:
5719 break;
5722 arg2 = prep_operand (arg2);
5723 arg3 = prep_operand (arg3);
5725 if (code == COND_EXPR)
5726 /* Use build_conditional_expr instead. */
5727 gcc_unreachable ();
5728 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5729 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5730 goto builtin;
5732 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5733 arg2 = integer_zero_node;
5735 vec_alloc (arglist, 3);
5736 arglist->quick_push (arg1);
5737 if (arg2 != NULL_TREE)
5738 arglist->quick_push (arg2);
5739 if (arg3 != NULL_TREE)
5740 arglist->quick_push (arg3);
5742 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5743 p = conversion_obstack_alloc (0);
5745 /* Add namespace-scope operators to the list of functions to
5746 consider. */
5747 if (!memonly)
5749 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5750 fns = lookup_arg_dependent (fnname, fns, arglist);
5751 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5752 NULL_TREE, false, NULL_TREE, NULL_TREE,
5753 flags, &candidates, complain);
5756 args[0] = arg1;
5757 args[1] = arg2;
5758 args[2] = NULL_TREE;
5760 /* Add class-member operators to the candidate set. */
5761 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5763 tree fns;
5765 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5766 if (fns == error_mark_node)
5768 result = error_mark_node;
5769 goto user_defined_result_ready;
5771 if (fns)
5772 add_candidates (BASELINK_FUNCTIONS (fns),
5773 NULL_TREE, arglist, NULL_TREE,
5774 NULL_TREE, false,
5775 BASELINK_BINFO (fns),
5776 BASELINK_ACCESS_BINFO (fns),
5777 flags, &candidates, complain);
5779 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5780 only non-member functions that have type T1 or reference to
5781 cv-qualified-opt T1 for the first argument, if the first argument
5782 has an enumeration type, or T2 or reference to cv-qualified-opt
5783 T2 for the second argument, if the second argument has an
5784 enumeration type. Filter out those that don't match. */
5785 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5787 struct z_candidate **candp, **next;
5789 for (candp = &candidates; *candp; candp = next)
5791 tree parmlist, parmtype;
5792 int i, nargs = (arg2 ? 2 : 1);
5794 cand = *candp;
5795 next = &cand->next;
5797 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5799 for (i = 0; i < nargs; ++i)
5801 parmtype = TREE_VALUE (parmlist);
5803 if (TYPE_REF_P (parmtype))
5804 parmtype = TREE_TYPE (parmtype);
5805 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5806 && (same_type_ignoring_top_level_qualifiers_p
5807 (TREE_TYPE (args[i]), parmtype)))
5808 break;
5810 parmlist = TREE_CHAIN (parmlist);
5813 /* No argument has an appropriate type, so remove this
5814 candidate function from the list. */
5815 if (i == nargs)
5817 *candp = cand->next;
5818 next = candp;
5823 add_builtin_candidates (&candidates, code, code2, fnname, args,
5824 flags, complain);
5826 switch (code)
5828 case COMPOUND_EXPR:
5829 case ADDR_EXPR:
5830 /* For these, the built-in candidates set is empty
5831 [over.match.oper]/3. We don't want non-strict matches
5832 because exact matches are always possible with built-in
5833 operators. The built-in candidate set for COMPONENT_REF
5834 would be empty too, but since there are no such built-in
5835 operators, we accept non-strict matches for them. */
5836 strict_p = true;
5837 break;
5839 default:
5840 strict_p = false;
5841 break;
5844 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5845 if (!any_viable_p)
5847 switch (code)
5849 case POSTINCREMENT_EXPR:
5850 case POSTDECREMENT_EXPR:
5851 /* Don't try anything fancy if we're not allowed to produce
5852 errors. */
5853 if (!(complain & tf_error))
5854 return error_mark_node;
5856 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5857 distinguish between prefix and postfix ++ and
5858 operator++() was used for both, so we allow this with
5859 -fpermissive. */
5860 else
5862 const char *msg = (flag_permissive)
5863 ? G_("no %<%D(int)%> declared for postfix %qs,"
5864 " trying prefix operator instead")
5865 : G_("no %<%D(int)%> declared for postfix %qs");
5866 permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name);
5869 if (!flag_permissive)
5870 return error_mark_node;
5872 if (code == POSTINCREMENT_EXPR)
5873 code = PREINCREMENT_EXPR;
5874 else
5875 code = PREDECREMENT_EXPR;
5876 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5877 NULL_TREE, overload, complain);
5878 break;
5880 /* The caller will deal with these. */
5881 case ADDR_EXPR:
5882 case COMPOUND_EXPR:
5883 case COMPONENT_REF:
5884 result = NULL_TREE;
5885 result_valid_p = true;
5886 break;
5888 default:
5889 if (complain & tf_error)
5891 /* If one of the arguments of the operator represents
5892 an invalid use of member function pointer, try to report
5893 a meaningful error ... */
5894 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5895 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5896 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5897 /* We displayed the error message. */;
5898 else
5900 /* ... Otherwise, report the more generic
5901 "no matching operator found" error */
5902 auto_diagnostic_group d;
5903 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5904 print_z_candidates (loc, candidates);
5907 result = error_mark_node;
5908 break;
5911 else
5913 cand = tourney (candidates, complain);
5914 if (cand == 0)
5916 if (complain & tf_error)
5918 auto_diagnostic_group d;
5919 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5920 print_z_candidates (loc, candidates);
5922 result = error_mark_node;
5924 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5926 if (overload)
5927 *overload = cand->fn;
5929 if (resolve_args (arglist, complain) == NULL)
5930 result = error_mark_node;
5931 else
5932 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5934 if (trivial_fn_p (cand->fn))
5935 /* There won't be a CALL_EXPR. */;
5936 else if (result && result != error_mark_node)
5938 tree call = extract_call_expr (result);
5939 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5941 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5942 /* This prevents build_new_function_call from discarding this
5943 function during instantiation of the enclosing template. */
5944 KOENIG_LOOKUP_P (call) = 1;
5946 /* Specify evaluation order as per P0145R2. */
5947 CALL_EXPR_ORDERED_ARGS (call) = false;
5948 switch (op_is_ordered (code))
5950 case -1:
5951 CALL_EXPR_REVERSE_ARGS (call) = true;
5952 break;
5954 case 1:
5955 CALL_EXPR_ORDERED_ARGS (call) = true;
5956 break;
5958 default:
5959 break;
5963 else
5965 /* Give any warnings we noticed during overload resolution. */
5966 if (cand->warnings && (complain & tf_warning))
5968 struct candidate_warning *w;
5969 for (w = cand->warnings; w; w = w->next)
5970 joust (cand, w->loser, 1, complain);
5973 /* Check for comparison of different enum types. */
5974 switch (code)
5976 case GT_EXPR:
5977 case LT_EXPR:
5978 case GE_EXPR:
5979 case LE_EXPR:
5980 case EQ_EXPR:
5981 case NE_EXPR:
5982 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5983 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5984 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5985 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5986 && (complain & tf_warning))
5988 warning (OPT_Wenum_compare,
5989 "comparison between %q#T and %q#T",
5990 TREE_TYPE (arg1), TREE_TYPE (arg2));
5992 break;
5993 default:
5994 break;
5997 /* We need to strip any leading REF_BIND so that bitfields
5998 don't cause errors. This should not remove any important
5999 conversions, because builtins don't apply to class
6000 objects directly. */
6001 conv = cand->convs[0];
6002 if (conv->kind == ck_ref_bind)
6003 conv = next_conversion (conv);
6004 arg1 = convert_like (conv, arg1, complain);
6006 if (arg2)
6008 conv = cand->convs[1];
6009 if (conv->kind == ck_ref_bind)
6010 conv = next_conversion (conv);
6011 else
6012 arg2 = decay_conversion (arg2, complain);
6014 /* We need to call warn_logical_operator before
6015 converting arg2 to a boolean_type, but after
6016 decaying an enumerator to its value. */
6017 if (complain & tf_warning)
6018 warn_logical_operator (loc, code, boolean_type_node,
6019 code_orig_arg1, arg1,
6020 code_orig_arg2, arg2);
6022 arg2 = convert_like (conv, arg2, complain);
6024 if (arg3)
6026 conv = cand->convs[2];
6027 if (conv->kind == ck_ref_bind)
6028 conv = next_conversion (conv);
6029 arg3 = convert_like (conv, arg3, complain);
6035 user_defined_result_ready:
6037 /* Free all the conversions we allocated. */
6038 obstack_free (&conversion_obstack, p);
6040 if (result || result_valid_p)
6041 return result;
6043 builtin:
6044 switch (code)
6046 case MODIFY_EXPR:
6047 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
6049 case INDIRECT_REF:
6050 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
6052 case TRUTH_ANDIF_EXPR:
6053 case TRUTH_ORIF_EXPR:
6054 case TRUTH_AND_EXPR:
6055 case TRUTH_OR_EXPR:
6056 if (complain & tf_warning)
6057 warn_logical_operator (loc, code, boolean_type_node,
6058 code_orig_arg1, arg1,
6059 code_orig_arg2, arg2);
6060 /* Fall through. */
6061 case GT_EXPR:
6062 case LT_EXPR:
6063 case GE_EXPR:
6064 case LE_EXPR:
6065 case EQ_EXPR:
6066 case NE_EXPR:
6067 if ((complain & tf_warning)
6068 && ((code_orig_arg1 == BOOLEAN_TYPE)
6069 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
6070 maybe_warn_bool_compare (loc, code, arg1, arg2);
6071 if (complain & tf_warning && warn_tautological_compare)
6072 warn_tautological_cmp (loc, code, arg1, arg2);
6073 /* Fall through. */
6074 case PLUS_EXPR:
6075 case MINUS_EXPR:
6076 case MULT_EXPR:
6077 case TRUNC_DIV_EXPR:
6078 case MAX_EXPR:
6079 case MIN_EXPR:
6080 case LSHIFT_EXPR:
6081 case RSHIFT_EXPR:
6082 case TRUNC_MOD_EXPR:
6083 case BIT_AND_EXPR:
6084 case BIT_IOR_EXPR:
6085 case BIT_XOR_EXPR:
6086 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6088 case UNARY_PLUS_EXPR:
6089 case NEGATE_EXPR:
6090 case BIT_NOT_EXPR:
6091 case TRUTH_NOT_EXPR:
6092 case PREINCREMENT_EXPR:
6093 case POSTINCREMENT_EXPR:
6094 case PREDECREMENT_EXPR:
6095 case POSTDECREMENT_EXPR:
6096 case REALPART_EXPR:
6097 case IMAGPART_EXPR:
6098 case ABS_EXPR:
6099 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6101 case ARRAY_REF:
6102 return cp_build_array_ref (input_location, arg1, arg2, complain);
6104 case MEMBER_REF:
6105 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6106 complain),
6107 arg2, complain);
6109 /* The caller will deal with these. */
6110 case ADDR_EXPR:
6111 case COMPONENT_REF:
6112 case COMPOUND_EXPR:
6113 return NULL_TREE;
6115 default:
6116 gcc_unreachable ();
6118 return NULL_TREE;
6121 /* Wrapper for above. */
6123 tree
6124 build_new_op (location_t loc, enum tree_code code, int flags,
6125 tree arg1, tree arg2, tree arg3,
6126 tree *overload, tsubst_flags_t complain)
6128 tree ret;
6129 bool subtime = timevar_cond_start (TV_OVERLOAD);
6130 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6131 overload, complain);
6132 timevar_cond_stop (TV_OVERLOAD, subtime);
6133 return ret;
6136 /* CALL was returned by some call-building function; extract the actual
6137 CALL_EXPR from any bits that have been tacked on, e.g. by
6138 convert_from_reference. */
6140 tree
6141 extract_call_expr (tree call)
6143 while (TREE_CODE (call) == COMPOUND_EXPR)
6144 call = TREE_OPERAND (call, 1);
6145 if (REFERENCE_REF_P (call))
6146 call = TREE_OPERAND (call, 0);
6147 if (TREE_CODE (call) == TARGET_EXPR)
6148 call = TARGET_EXPR_INITIAL (call);
6149 gcc_assert (TREE_CODE (call) == CALL_EXPR
6150 || TREE_CODE (call) == AGGR_INIT_EXPR
6151 || call == error_mark_node);
6152 return call;
6155 /* Returns true if FN has two parameters, of which the second has type
6156 size_t. */
6158 static bool
6159 second_parm_is_size_t (tree fn)
6161 tree t = FUNCTION_ARG_CHAIN (fn);
6162 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6163 return false;
6164 t = TREE_CHAIN (t);
6165 if (t == void_list_node)
6166 return true;
6167 if (aligned_new_threshold && t
6168 && same_type_p (TREE_VALUE (t), align_type_node)
6169 && TREE_CHAIN (t) == void_list_node)
6170 return true;
6171 return false;
6174 /* True if T, an allocation function, has std::align_val_t as its second
6175 argument. */
6177 bool
6178 aligned_allocation_fn_p (tree t)
6180 if (!aligned_new_threshold)
6181 return false;
6183 tree a = FUNCTION_ARG_CHAIN (t);
6184 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6187 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6188 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6189 std::align_val_t. */
6191 static bool
6192 aligned_deallocation_fn_p (tree t)
6194 if (!aligned_new_threshold)
6195 return false;
6197 /* A template instance is never a usual deallocation function,
6198 regardless of its signature. */
6199 if (TREE_CODE (t) == TEMPLATE_DECL
6200 || primary_template_specialization_p (t))
6201 return false;
6203 tree a = FUNCTION_ARG_CHAIN (t);
6204 if (same_type_p (TREE_VALUE (a), align_type_node)
6205 && TREE_CHAIN (a) == void_list_node)
6206 return true;
6207 if (!same_type_p (TREE_VALUE (a), size_type_node))
6208 return false;
6209 a = TREE_CHAIN (a);
6210 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6211 && TREE_CHAIN (a) == void_list_node)
6212 return true;
6213 return false;
6216 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6217 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6219 bool
6220 usual_deallocation_fn_p (tree t)
6222 /* A template instance is never a usual deallocation function,
6223 regardless of its signature. */
6224 if (TREE_CODE (t) == TEMPLATE_DECL
6225 || primary_template_specialization_p (t))
6226 return false;
6228 /* If a class T has a member deallocation function named operator delete
6229 with exactly one parameter, then that function is a usual
6230 (non-placement) deallocation function. If class T does not declare
6231 such an operator delete but does declare a member deallocation
6232 function named operator delete with exactly two parameters, the second
6233 of which has type std::size_t (18.2), then this function is a usual
6234 deallocation function. */
6235 bool global = DECL_NAMESPACE_SCOPE_P (t);
6236 tree chain = FUNCTION_ARG_CHAIN (t);
6237 if (!chain)
6238 return false;
6239 if (chain == void_list_node
6240 || ((!global || flag_sized_deallocation)
6241 && second_parm_is_size_t (t)))
6242 return true;
6243 if (aligned_deallocation_fn_p (t))
6244 return true;
6245 return false;
6248 /* Build a call to operator delete. This has to be handled very specially,
6249 because the restrictions on what signatures match are different from all
6250 other call instances. For a normal delete, only a delete taking (void *)
6251 or (void *, size_t) is accepted. For a placement delete, only an exact
6252 match with the placement new is accepted.
6254 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6255 ADDR is the pointer to be deleted.
6256 SIZE is the size of the memory block to be deleted.
6257 GLOBAL_P is true if the delete-expression should not consider
6258 class-specific delete operators.
6259 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6261 If this call to "operator delete" is being generated as part to
6262 deallocate memory allocated via a new-expression (as per [expr.new]
6263 which requires that if the initialization throws an exception then
6264 we call a deallocation function), then ALLOC_FN is the allocation
6265 function. */
6267 tree
6268 build_op_delete_call (enum tree_code code, tree addr, tree size,
6269 bool global_p, tree placement,
6270 tree alloc_fn, tsubst_flags_t complain)
6272 tree fn = NULL_TREE;
6273 tree fns, fnname, type, t;
6275 if (addr == error_mark_node)
6276 return error_mark_node;
6278 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6280 fnname = ovl_op_identifier (false, code);
6282 if (CLASS_TYPE_P (type)
6283 && COMPLETE_TYPE_P (complete_type (type))
6284 && !global_p)
6285 /* In [class.free]
6287 If the result of the lookup is ambiguous or inaccessible, or if
6288 the lookup selects a placement deallocation function, the
6289 program is ill-formed.
6291 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6293 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6294 if (fns == error_mark_node)
6295 return error_mark_node;
6297 else
6298 fns = NULL_TREE;
6300 if (fns == NULL_TREE)
6301 fns = lookup_name_nonclass (fnname);
6303 /* Strip const and volatile from addr. */
6304 addr = cp_convert (ptr_type_node, addr, complain);
6306 if (placement)
6308 /* "A declaration of a placement deallocation function matches the
6309 declaration of a placement allocation function if it has the same
6310 number of parameters and, after parameter transformations (8.3.5),
6311 all parameter types except the first are identical."
6313 So we build up the function type we want and ask instantiate_type
6314 to get it for us. */
6315 t = FUNCTION_ARG_CHAIN (alloc_fn);
6316 t = tree_cons (NULL_TREE, ptr_type_node, t);
6317 t = build_function_type (void_type_node, t);
6319 fn = instantiate_type (t, fns, tf_none);
6320 if (fn == error_mark_node)
6321 return NULL_TREE;
6323 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6325 /* "If the lookup finds the two-parameter form of a usual deallocation
6326 function (3.7.4.2) and that function, considered as a placement
6327 deallocation function, would have been selected as a match for the
6328 allocation function, the program is ill-formed." */
6329 if (second_parm_is_size_t (fn))
6331 const char *const msg1
6332 = G_("exception cleanup for this placement new selects "
6333 "non-placement operator delete");
6334 const char *const msg2
6335 = G_("%qD is a usual (non-placement) deallocation "
6336 "function in C++14 (or with -fsized-deallocation)");
6338 /* But if the class has an operator delete (void *), then that is
6339 the usual deallocation function, so we shouldn't complain
6340 about using the operator delete (void *, size_t). */
6341 if (DECL_CLASS_SCOPE_P (fn))
6342 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6343 iter; ++iter)
6345 tree elt = *iter;
6346 if (usual_deallocation_fn_p (elt)
6347 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6348 goto ok;
6350 /* Before C++14 a two-parameter global deallocation function is
6351 always a placement deallocation function, but warn if
6352 -Wc++14-compat. */
6353 else if (!flag_sized_deallocation)
6355 if (complain & tf_warning)
6357 auto_diagnostic_group d;
6358 if (warning (OPT_Wc__14_compat, msg1))
6359 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6361 goto ok;
6364 if (complain & tf_warning_or_error)
6366 auto_diagnostic_group d;
6367 if (permerror (input_location, msg1))
6369 /* Only mention C++14 for namespace-scope delete. */
6370 if (DECL_NAMESPACE_SCOPE_P (fn))
6371 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6372 else
6373 inform (DECL_SOURCE_LOCATION (fn),
6374 "%qD is a usual (non-placement) deallocation "
6375 "function", fn);
6378 else
6379 return error_mark_node;
6380 ok:;
6383 else
6384 /* "Any non-placement deallocation function matches a non-placement
6385 allocation function. If the lookup finds a single matching
6386 deallocation function, that function will be called; otherwise, no
6387 deallocation function will be called." */
6388 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6390 tree elt = *iter;
6391 if (usual_deallocation_fn_p (elt))
6393 if (!fn)
6395 fn = elt;
6396 continue;
6399 /* -- If the type has new-extended alignment, a function with a
6400 parameter of type std::align_val_t is preferred; otherwise a
6401 function without such a parameter is preferred. If exactly one
6402 preferred function is found, that function is selected and the
6403 selection process terminates. If more than one preferred
6404 function is found, all non-preferred functions are eliminated
6405 from further consideration. */
6406 if (aligned_new_threshold)
6408 bool want_align = type_has_new_extended_alignment (type);
6409 bool fn_align = aligned_deallocation_fn_p (fn);
6410 bool elt_align = aligned_deallocation_fn_p (elt);
6412 if (elt_align != fn_align)
6414 if (want_align == elt_align)
6415 fn = elt;
6416 continue;
6420 /* -- If the deallocation functions have class scope, the one
6421 without a parameter of type std::size_t is selected. */
6422 bool want_size;
6423 if (DECL_CLASS_SCOPE_P (fn))
6424 want_size = false;
6426 /* -- If the type is complete and if, for the second alternative
6427 (delete array) only, the operand is a pointer to a class type
6428 with a non-trivial destructor or a (possibly multi-dimensional)
6429 array thereof, the function with a parameter of type std::size_t
6430 is selected.
6432 -- Otherwise, it is unspecified whether a deallocation function
6433 with a parameter of type std::size_t is selected. */
6434 else
6436 want_size = COMPLETE_TYPE_P (type);
6437 if (code == VEC_DELETE_EXPR
6438 && !TYPE_VEC_NEW_USES_COOKIE (type))
6439 /* We need a cookie to determine the array size. */
6440 want_size = false;
6442 bool fn_size = second_parm_is_size_t (fn);
6443 bool elt_size = second_parm_is_size_t (elt);
6444 gcc_assert (fn_size != elt_size);
6445 if (want_size == elt_size)
6446 fn = elt;
6450 /* If we have a matching function, call it. */
6451 if (fn)
6453 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6455 /* If the FN is a member function, make sure that it is
6456 accessible. */
6457 if (BASELINK_P (fns))
6458 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6459 complain);
6461 /* Core issue 901: It's ok to new a type with deleted delete. */
6462 if (DECL_DELETED_FN (fn) && alloc_fn)
6463 return NULL_TREE;
6465 if (placement)
6467 /* The placement args might not be suitable for overload
6468 resolution at this point, so build the call directly. */
6469 int nargs = call_expr_nargs (placement);
6470 tree *argarray = XALLOCAVEC (tree, nargs);
6471 int i;
6472 argarray[0] = addr;
6473 for (i = 1; i < nargs; i++)
6474 argarray[i] = CALL_EXPR_ARG (placement, i);
6475 if (!mark_used (fn, complain) && !(complain & tf_error))
6476 return error_mark_node;
6477 return build_cxx_call (fn, nargs, argarray, complain);
6479 else
6481 tree ret;
6482 vec<tree, va_gc> *args = make_tree_vector ();
6483 args->quick_push (addr);
6484 if (second_parm_is_size_t (fn))
6485 args->quick_push (size);
6486 if (aligned_deallocation_fn_p (fn))
6488 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6489 args->quick_push (al);
6491 ret = cp_build_function_call_vec (fn, &args, complain);
6492 release_tree_vector (args);
6493 return ret;
6497 /* [expr.new]
6499 If no unambiguous matching deallocation function can be found,
6500 propagating the exception does not cause the object's memory to
6501 be freed. */
6502 if (alloc_fn)
6504 if ((complain & tf_warning)
6505 && !placement)
6506 warning (0, "no corresponding deallocation function for %qD",
6507 alloc_fn);
6508 return NULL_TREE;
6511 if (complain & tf_error)
6512 error ("no suitable %<operator %s%> for %qT",
6513 OVL_OP_INFO (false, code)->name, type);
6514 return error_mark_node;
6517 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6518 in the diagnostics.
6520 If ISSUE_ERROR is true, then issue an error about the
6521 access, followed by a note showing the declaration.
6522 Otherwise, just show the note. */
6524 void
6525 complain_about_access (tree decl, tree diag_decl, bool issue_error)
6527 if (TREE_PRIVATE (decl))
6529 if (issue_error)
6530 error ("%q#D is private within this context", diag_decl);
6531 inform (DECL_SOURCE_LOCATION (diag_decl),
6532 "declared private here");
6534 else if (TREE_PROTECTED (decl))
6536 if (issue_error)
6537 error ("%q#D is protected within this context", diag_decl);
6538 inform (DECL_SOURCE_LOCATION (diag_decl),
6539 "declared protected here");
6541 else
6543 if (issue_error)
6544 error ("%q#D is inaccessible within this context", diag_decl);
6545 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6549 /* If the current scope isn't allowed to access DECL along
6550 BASETYPE_PATH, give an error. The most derived class in
6551 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6552 the declaration to use in the error diagnostic. */
6554 bool
6555 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6556 tsubst_flags_t complain, access_failure_info *afi)
6558 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6560 if (flag_new_inheriting_ctors
6561 && DECL_INHERITED_CTOR (decl))
6563 /* 7.3.3/18: The additional constructors are accessible if they would be
6564 accessible when used to construct an object of the corresponding base
6565 class. */
6566 decl = strip_inheriting_ctors (decl);
6567 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6568 ba_any, NULL, complain);
6571 if (!accessible_p (basetype_path, decl, true))
6573 if (flag_new_inheriting_ctors)
6574 diag_decl = strip_inheriting_ctors (diag_decl);
6575 if (complain & tf_error)
6576 complain_about_access (decl, diag_decl, true);
6577 if (afi)
6578 afi->record_access_failure (basetype_path, decl, diag_decl);
6579 return false;
6582 return true;
6585 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6586 bitwise or of LOOKUP_* values. If any errors are warnings are
6587 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6588 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6589 to NULL. */
6591 static tree
6592 build_temp (tree expr, tree type, int flags,
6593 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6595 int savew, savee;
6596 vec<tree, va_gc> *args;
6598 *diagnostic_kind = DK_UNSPECIFIED;
6600 /* If the source is a packed field, calling the copy constructor will require
6601 binding the field to the reference parameter to the copy constructor, and
6602 we'll end up with an infinite loop. If we can use a bitwise copy, then
6603 do that now. */
6604 if ((lvalue_kind (expr) & clk_packed)
6605 && CLASS_TYPE_P (TREE_TYPE (expr))
6606 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6607 return get_target_expr_sfinae (expr, complain);
6609 savew = warningcount + werrorcount, savee = errorcount;
6610 args = make_tree_vector_single (expr);
6611 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6612 &args, type, flags, complain);
6613 release_tree_vector (args);
6614 if (warningcount + werrorcount > savew)
6615 *diagnostic_kind = DK_WARNING;
6616 else if (errorcount > savee)
6617 *diagnostic_kind = DK_ERROR;
6618 return expr;
6621 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6622 Also handle a subset of zero as null warnings.
6623 EXPR is implicitly converted to type TOTYPE.
6624 FN and ARGNUM are used for diagnostics. */
6626 static void
6627 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6629 /* Issue warnings about peculiar, but valid, uses of NULL. */
6630 if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE
6631 && ARITHMETIC_TYPE_P (totype))
6633 source_location loc =
6634 expansion_point_location_if_in_system_header (input_location);
6636 if (fn)
6637 warning_at (loc, OPT_Wconversion_null,
6638 "passing NULL to non-pointer argument %P of %qD",
6639 argnum, fn);
6640 else
6641 warning_at (loc, OPT_Wconversion_null,
6642 "converting to non-pointer type %qT from NULL", totype);
6645 /* Issue warnings if "false" is converted to a NULL pointer */
6646 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6647 && TYPE_PTR_P (totype))
6649 if (fn)
6650 warning_at (input_location, OPT_Wconversion_null,
6651 "converting %<false%> to pointer type for argument %P "
6652 "of %qD", argnum, fn);
6653 else
6654 warning_at (input_location, OPT_Wconversion_null,
6655 "converting %<false%> to pointer type %qT", totype);
6657 /* Handle zero as null pointer warnings for cases other
6658 than EQ_EXPR and NE_EXPR */
6659 else if (null_ptr_cst_p (expr) &&
6660 (TYPE_PTR_OR_PTRMEM_P (totype) || NULLPTR_TYPE_P (totype)))
6662 source_location loc =
6663 expansion_point_location_if_in_system_header (input_location);
6664 maybe_warn_zero_as_null_pointer_constant (expr, loc);
6668 /* We gave a diagnostic during a conversion. If this was in the second
6669 standard conversion sequence of a user-defined conversion sequence, say
6670 which user-defined conversion. */
6672 static void
6673 maybe_print_user_conv_context (conversion *convs)
6675 if (convs->user_conv_p)
6676 for (conversion *t = convs; t; t = next_conversion (t))
6677 if (t->kind == ck_user)
6679 print_z_candidate (0, " after user-defined conversion:",
6680 t->cand);
6681 break;
6685 /* Locate the parameter with the given index within FNDECL.
6686 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6687 Return the location of the FNDECL itself if there are problems. */
6689 location_t
6690 get_fndecl_argument_location (tree fndecl, int argnum)
6692 int i;
6693 tree param;
6695 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6696 for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl);
6697 i < argnum && param;
6698 i++, param = TREE_CHAIN (param))
6701 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6702 return the location of FNDECL. */
6703 if (param == NULL)
6704 return DECL_SOURCE_LOCATION (fndecl);
6706 return DECL_SOURCE_LOCATION (param);
6709 /* Perform the conversions in CONVS on the expression EXPR. FN and
6710 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6711 indicates the `this' argument of a method. INNER is nonzero when
6712 being called to continue a conversion chain. It is negative when a
6713 reference binding will be applied, positive otherwise. If
6714 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6715 conversions will be emitted if appropriate. If C_CAST_P is true,
6716 this conversion is coming from a C-style cast; in that case,
6717 conversions to inaccessible bases are permitted. */
6719 static tree
6720 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6721 bool issue_conversion_warnings,
6722 bool c_cast_p, tsubst_flags_t complain)
6724 tree totype = convs->type;
6725 diagnostic_t diag_kind;
6726 int flags;
6727 location_t loc = cp_expr_loc_or_loc (expr, input_location);
6729 if (convs->bad_p && !(complain & tf_error))
6730 return error_mark_node;
6732 if (convs->bad_p
6733 && convs->kind != ck_user
6734 && convs->kind != ck_list
6735 && convs->kind != ck_ambig
6736 && (convs->kind != ck_ref_bind
6737 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6738 && (convs->kind != ck_rvalue
6739 || SCALAR_TYPE_P (totype))
6740 && convs->kind != ck_base)
6742 bool complained = false;
6743 conversion *t = convs;
6745 /* Give a helpful error if this is bad because of excess braces. */
6746 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6747 && SCALAR_TYPE_P (totype)
6748 && CONSTRUCTOR_NELTS (expr) > 0
6749 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6751 complained = permerror (loc, "too many braces around initializer "
6752 "for %qT", totype);
6753 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6754 && CONSTRUCTOR_NELTS (expr) == 1)
6755 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6758 /* Give a helpful error if this is bad because a conversion to bool
6759 from std::nullptr_t requires direct-initialization. */
6760 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6761 && TREE_CODE (totype) == BOOLEAN_TYPE)
6762 complained = permerror (loc, "converting to %qH from %qI requires "
6763 "direct-initialization",
6764 totype, TREE_TYPE (expr));
6766 for (; t ; t = next_conversion (t))
6768 if (t->kind == ck_user && t->cand->reason)
6770 auto_diagnostic_group d;
6771 complained = permerror (loc, "invalid user-defined conversion "
6772 "from %qH to %qI", TREE_TYPE (expr),
6773 totype);
6774 if (complained)
6775 print_z_candidate (loc, "candidate is:", t->cand);
6776 expr = convert_like_real (t, expr, fn, argnum,
6777 /*issue_conversion_warnings=*/false,
6778 /*c_cast_p=*/false,
6779 complain);
6780 if (convs->kind == ck_ref_bind)
6781 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6782 LOOKUP_NORMAL, NULL_TREE,
6783 complain);
6784 else
6785 expr = cp_convert (totype, expr, complain);
6786 if (complained && fn)
6787 inform (DECL_SOURCE_LOCATION (fn),
6788 " initializing argument %P of %qD", argnum, fn);
6789 return expr;
6791 else if (t->kind == ck_user || !t->bad_p)
6793 expr = convert_like_real (t, expr, fn, argnum,
6794 /*issue_conversion_warnings=*/false,
6795 /*c_cast_p=*/false,
6796 complain);
6797 break;
6799 else if (t->kind == ck_ambig)
6800 return convert_like_real (t, expr, fn, argnum,
6801 /*issue_conversion_warnings=*/false,
6802 /*c_cast_p=*/false,
6803 complain);
6804 else if (t->kind == ck_identity)
6805 break;
6807 if (!complained)
6809 range_label_for_type_mismatch label (TREE_TYPE (expr), totype);
6810 gcc_rich_location richloc (loc, &label);
6811 complained = permerror (&richloc,
6812 "invalid conversion from %qH to %qI",
6813 TREE_TYPE (expr), totype);
6815 if (complained && fn)
6816 inform (get_fndecl_argument_location (fn, argnum),
6817 " initializing argument %P of %qD", argnum, fn);
6819 return cp_convert (totype, expr, complain);
6822 if (issue_conversion_warnings && (complain & tf_warning))
6823 conversion_null_warnings (totype, expr, fn, argnum);
6825 switch (convs->kind)
6827 case ck_user:
6829 struct z_candidate *cand = convs->cand;
6831 if (cand == NULL)
6832 /* We chose the surrogate function from add_conv_candidate, now we
6833 actually need to build the conversion. */
6834 cand = build_user_type_conversion_1 (totype, expr,
6835 LOOKUP_NO_CONVERSION, complain);
6837 tree convfn = cand->fn;
6839 /* When converting from an init list we consider explicit
6840 constructors, but actually trying to call one is an error. */
6841 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6842 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6843 /* Unless this is for direct-list-initialization. */
6844 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6845 /* And in C++98 a default constructor can't be explicit. */
6846 && cxx_dialect >= cxx11)
6848 if (!(complain & tf_error))
6849 return error_mark_node;
6850 location_t loc = location_of (expr);
6851 if (CONSTRUCTOR_NELTS (expr) == 0
6852 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6854 auto_diagnostic_group d;
6855 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6856 "would use explicit constructor %qD",
6857 totype, convfn))
6858 inform (loc, "in C++11 and above a default constructor "
6859 "can be explicit");
6861 else
6862 error ("converting to %qT from initializer list would use "
6863 "explicit constructor %qD", totype, convfn);
6866 /* If we're initializing from {}, it's value-initialization. */
6867 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6868 && CONSTRUCTOR_NELTS (expr) == 0
6869 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6871 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6872 if (abstract_virtuals_error_sfinae (NULL_TREE, totype, complain))
6873 return error_mark_node;
6874 expr = build_value_init (totype, complain);
6875 expr = get_target_expr_sfinae (expr, complain);
6876 if (expr != error_mark_node)
6878 TARGET_EXPR_LIST_INIT_P (expr) = true;
6879 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6881 return expr;
6884 expr = mark_rvalue_use (expr);
6886 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6887 any more UDCs. */
6888 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6889 complain);
6891 /* If this is a constructor or a function returning an aggr type,
6892 we need to build up a TARGET_EXPR. */
6893 if (DECL_CONSTRUCTOR_P (convfn))
6895 expr = build_cplus_new (totype, expr, complain);
6897 /* Remember that this was list-initialization. */
6898 if (convs->check_narrowing && expr != error_mark_node)
6899 TARGET_EXPR_LIST_INIT_P (expr) = true;
6902 return expr;
6904 case ck_identity:
6905 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6907 int nelts = CONSTRUCTOR_NELTS (expr);
6908 if (nelts == 0)
6909 expr = build_value_init (totype, complain);
6910 else if (nelts == 1)
6911 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6912 else
6913 gcc_unreachable ();
6915 expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p,
6916 /*read_p=*/true, UNKNOWN_LOCATION,
6917 /*reject_builtin=*/true);
6919 if (type_unknown_p (expr))
6920 expr = instantiate_type (totype, expr, complain);
6921 if (expr == null_node
6922 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
6923 /* If __null has been converted to an integer type, we do not want to
6924 continue to warn about uses of EXPR as an integer, rather than as a
6925 pointer. */
6926 expr = build_int_cst (totype, 0);
6927 return expr;
6928 case ck_ambig:
6929 /* We leave bad_p off ck_ambig because overload resolution considers
6930 it valid, it just fails when we try to perform it. So we need to
6931 check complain here, too. */
6932 if (complain & tf_error)
6934 /* Call build_user_type_conversion again for the error. */
6935 int flags = (convs->need_temporary_p
6936 ? LOOKUP_IMPLICIT : LOOKUP_NORMAL);
6937 build_user_type_conversion (totype, convs->u.expr, flags, complain);
6938 gcc_assert (seen_error ());
6939 if (fn)
6940 inform (DECL_SOURCE_LOCATION (fn),
6941 " initializing argument %P of %qD", argnum, fn);
6943 return error_mark_node;
6945 case ck_list:
6947 /* Conversion to std::initializer_list<T>. */
6948 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6949 tree new_ctor = build_constructor (init_list_type_node, NULL);
6950 unsigned len = CONSTRUCTOR_NELTS (expr);
6951 tree array, val, field;
6952 vec<constructor_elt, va_gc> *vec = NULL;
6953 unsigned ix;
6955 /* Convert all the elements. */
6956 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6958 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6959 false, false, complain);
6960 if (sub == error_mark_node)
6961 return sub;
6962 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6963 && !check_narrowing (TREE_TYPE (sub), val, complain))
6964 return error_mark_node;
6965 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6966 if (!TREE_CONSTANT (sub))
6967 TREE_CONSTANT (new_ctor) = false;
6969 /* Build up the array. */
6970 elttype = cp_build_qualified_type
6971 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6972 array = build_array_of_n_type (elttype, len);
6973 array = finish_compound_literal (array, new_ctor, complain);
6974 /* Take the address explicitly rather than via decay_conversion
6975 to avoid the error about taking the address of a temporary. */
6976 array = cp_build_addr_expr (array, complain);
6977 array = cp_convert (build_pointer_type (elttype), array, complain);
6978 if (array == error_mark_node)
6979 return error_mark_node;
6981 /* Build up the initializer_list object. Note: fail gracefully
6982 if the object cannot be completed because, for example, no
6983 definition is provided (c++/80956). */
6984 totype = complete_type_or_maybe_complain (totype, NULL_TREE, complain);
6985 if (!totype)
6986 return error_mark_node;
6987 field = next_initializable_field (TYPE_FIELDS (totype));
6988 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6989 field = next_initializable_field (DECL_CHAIN (field));
6990 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6991 new_ctor = build_constructor (totype, vec);
6992 return get_target_expr_sfinae (new_ctor, complain);
6995 case ck_aggr:
6996 if (TREE_CODE (totype) == COMPLEX_TYPE)
6998 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6999 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
7000 real = perform_implicit_conversion (TREE_TYPE (totype),
7001 real, complain);
7002 imag = perform_implicit_conversion (TREE_TYPE (totype),
7003 imag, complain);
7004 expr = build2 (COMPLEX_EXPR, totype, real, imag);
7005 return expr;
7007 expr = reshape_init (totype, expr, complain);
7008 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
7009 complain);
7010 if (expr != error_mark_node)
7011 TARGET_EXPR_LIST_INIT_P (expr) = true;
7012 return expr;
7014 default:
7015 break;
7018 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
7019 convs->kind == ck_ref_bind
7020 ? issue_conversion_warnings : false,
7021 c_cast_p, complain);
7022 if (expr == error_mark_node)
7023 return error_mark_node;
7025 switch (convs->kind)
7027 case ck_rvalue:
7028 expr = decay_conversion (expr, complain);
7029 if (expr == error_mark_node)
7031 if (complain & tf_error)
7033 auto_diagnostic_group d;
7034 maybe_print_user_conv_context (convs);
7035 if (fn)
7036 inform (DECL_SOURCE_LOCATION (fn),
7037 " initializing argument %P of %qD", argnum, fn);
7039 return error_mark_node;
7042 if (! MAYBE_CLASS_TYPE_P (totype))
7043 return expr;
7045 /* Don't introduce copies when passing arguments along to the inherited
7046 constructor. */
7047 if (current_function_decl
7048 && flag_new_inheriting_ctors
7049 && DECL_INHERITED_CTOR (current_function_decl))
7050 return expr;
7052 if (TREE_CODE (expr) == TARGET_EXPR
7053 && TARGET_EXPR_LIST_INIT_P (expr))
7054 /* Copy-list-initialization doesn't actually involve a copy. */
7055 return expr;
7057 /* Fall through. */
7058 case ck_base:
7059 if (convs->kind == ck_base && !convs->need_temporary_p)
7061 /* We are going to bind a reference directly to a base-class
7062 subobject of EXPR. */
7063 /* Build an expression for `*((base*) &expr)'. */
7064 expr = convert_to_base (expr, totype,
7065 !c_cast_p, /*nonnull=*/true, complain);
7066 return expr;
7069 /* Copy-initialization where the cv-unqualified version of the source
7070 type is the same class as, or a derived class of, the class of the
7071 destination [is treated as direct-initialization]. [dcl.init] */
7072 flags = LOOKUP_NORMAL;
7073 if (convs->user_conv_p)
7074 /* This conversion is being done in the context of a user-defined
7075 conversion (i.e. the second step of copy-initialization), so
7076 don't allow any more. */
7077 flags |= LOOKUP_NO_CONVERSION;
7078 else
7079 flags |= LOOKUP_ONLYCONVERTING;
7080 if (convs->rvaluedness_matches_p)
7081 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7082 flags |= LOOKUP_PREFER_RVALUE;
7083 expr = build_temp (expr, totype, flags, &diag_kind, complain);
7084 if (diag_kind && complain)
7086 auto_diagnostic_group d;
7087 maybe_print_user_conv_context (convs);
7088 if (fn)
7089 inform (DECL_SOURCE_LOCATION (fn),
7090 " initializing argument %P of %qD", argnum, fn);
7093 return build_cplus_new (totype, expr, complain);
7095 case ck_ref_bind:
7097 tree ref_type = totype;
7099 if (convs->bad_p && !next_conversion (convs)->bad_p)
7101 tree extype = TREE_TYPE (expr);
7102 auto_diagnostic_group d;
7103 if (TYPE_REF_IS_RVALUE (ref_type)
7104 && lvalue_p (expr))
7105 error_at (loc, "cannot bind rvalue reference of type %qH to "
7106 "lvalue of type %qI", totype, extype);
7107 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
7108 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
7109 error_at (loc, "cannot bind non-const lvalue reference of "
7110 "type %qH to an rvalue of type %qI", totype, extype);
7111 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
7112 error_at (loc, "binding reference of type %qH to %qI "
7113 "discards qualifiers", totype, extype);
7114 else
7115 gcc_unreachable ();
7116 maybe_print_user_conv_context (convs);
7117 if (fn)
7118 inform (DECL_SOURCE_LOCATION (fn),
7119 " initializing argument %P of %qD", argnum, fn);
7120 return error_mark_node;
7123 /* If necessary, create a temporary.
7125 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7126 that need temporaries, even when their types are reference
7127 compatible with the type of reference being bound, so the
7128 upcoming call to cp_build_addr_expr doesn't fail. */
7129 if (convs->need_temporary_p
7130 || TREE_CODE (expr) == CONSTRUCTOR
7131 || TREE_CODE (expr) == VA_ARG_EXPR)
7133 /* Otherwise, a temporary of type "cv1 T1" is created and
7134 initialized from the initializer expression using the rules
7135 for a non-reference copy-initialization (8.5). */
7137 tree type = TREE_TYPE (ref_type);
7138 cp_lvalue_kind lvalue = lvalue_kind (expr);
7140 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7141 (type, next_conversion (convs)->type));
7142 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
7143 && !TYPE_REF_IS_RVALUE (ref_type))
7145 /* If the reference is volatile or non-const, we
7146 cannot create a temporary. */
7147 if (lvalue & clk_bitfield)
7148 error_at (loc, "cannot bind bitfield %qE to %qT",
7149 expr, ref_type);
7150 else if (lvalue & clk_packed)
7151 error_at (loc, "cannot bind packed field %qE to %qT",
7152 expr, ref_type);
7153 else
7154 error_at (loc, "cannot bind rvalue %qE to %qT",
7155 expr, ref_type);
7156 return error_mark_node;
7158 /* If the source is a packed field, and we must use a copy
7159 constructor, then building the target expr will require
7160 binding the field to the reference parameter to the
7161 copy constructor, and we'll end up with an infinite
7162 loop. If we can use a bitwise copy, then we'll be
7163 OK. */
7164 if ((lvalue & clk_packed)
7165 && CLASS_TYPE_P (type)
7166 && type_has_nontrivial_copy_init (type))
7168 error_at (loc, "cannot bind packed field %qE to %qT",
7169 expr, ref_type);
7170 return error_mark_node;
7172 if (lvalue & clk_bitfield)
7174 expr = convert_bitfield_to_declared_type (expr);
7175 expr = fold_convert (type, expr);
7177 expr = build_target_expr_with_type (expr, type, complain);
7180 /* Take the address of the thing to which we will bind the
7181 reference. */
7182 expr = cp_build_addr_expr (expr, complain);
7183 if (expr == error_mark_node)
7184 return error_mark_node;
7186 /* Convert it to a pointer to the type referred to by the
7187 reference. This will adjust the pointer if a derived to
7188 base conversion is being performed. */
7189 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7190 expr, complain);
7191 /* Convert the pointer to the desired reference type. */
7192 return build_nop (ref_type, expr);
7195 case ck_lvalue:
7196 return decay_conversion (expr, complain);
7198 case ck_fnptr:
7199 /* ??? Should the address of a transaction-safe pointer point to the TM
7200 clone, and this conversion look up the primary function? */
7201 return build_nop (totype, expr);
7203 case ck_qual:
7204 /* Warn about deprecated conversion if appropriate. */
7205 string_conv_p (totype, expr, 1);
7206 break;
7208 case ck_ptr:
7209 if (convs->base_p)
7210 expr = convert_to_base (expr, totype, !c_cast_p,
7211 /*nonnull=*/false, complain);
7212 return build_nop (totype, expr);
7214 case ck_pmem:
7215 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7216 c_cast_p, complain);
7218 default:
7219 break;
7222 if (convs->check_narrowing
7223 && !check_narrowing (totype, expr, complain,
7224 convs->check_narrowing_const_only))
7225 return error_mark_node;
7227 warning_sentinel w (warn_zero_as_null_pointer_constant);
7228 if (issue_conversion_warnings)
7229 expr = cp_convert_and_check (totype, expr, complain);
7230 else
7231 expr = cp_convert (totype, expr, complain);
7233 return expr;
7236 /* ARG is being passed to a varargs function. Perform any conversions
7237 required. Return the converted value. */
7239 tree
7240 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7242 tree arg_type;
7243 location_t loc = cp_expr_loc_or_loc (arg, input_location);
7245 /* [expr.call]
7247 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7248 standard conversions are performed. */
7249 arg = decay_conversion (arg, complain);
7250 arg_type = TREE_TYPE (arg);
7251 /* [expr.call]
7253 If the argument has integral or enumeration type that is subject
7254 to the integral promotions (_conv.prom_), or a floating point
7255 type that is subject to the floating point promotion
7256 (_conv.fpprom_), the value of the argument is converted to the
7257 promoted type before the call. */
7258 if (TREE_CODE (arg_type) == REAL_TYPE
7259 && (TYPE_PRECISION (arg_type)
7260 < TYPE_PRECISION (double_type_node))
7261 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7263 if ((complain & tf_warning)
7264 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7265 warning_at (loc, OPT_Wdouble_promotion,
7266 "implicit conversion from %qH to %qI when passing "
7267 "argument to function",
7268 arg_type, double_type_node);
7269 arg = convert_to_real_nofold (double_type_node, arg);
7271 else if (NULLPTR_TYPE_P (arg_type))
7272 arg = null_pointer_node;
7273 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7275 if (SCOPED_ENUM_P (arg_type))
7277 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7278 complain);
7279 prom = cp_perform_integral_promotions (prom, complain);
7280 if (abi_version_crosses (6)
7281 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7282 && (complain & tf_warning))
7283 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7284 "%qT before -fabi-version=6, %qT after", arg_type,
7285 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7286 if (!abi_version_at_least (6))
7287 arg = prom;
7289 else
7290 arg = cp_perform_integral_promotions (arg, complain);
7293 arg = require_complete_type_sfinae (arg, complain);
7294 arg_type = TREE_TYPE (arg);
7296 if (arg != error_mark_node
7297 /* In a template (or ill-formed code), we can have an incomplete type
7298 even after require_complete_type_sfinae, in which case we don't know
7299 whether it has trivial copy or not. */
7300 && COMPLETE_TYPE_P (arg_type)
7301 && !cp_unevaluated_operand)
7303 /* [expr.call] 5.2.2/7:
7304 Passing a potentially-evaluated argument of class type (Clause 9)
7305 with a non-trivial copy constructor or a non-trivial destructor
7306 with no corresponding parameter is conditionally-supported, with
7307 implementation-defined semantics.
7309 We support it as pass-by-invisible-reference, just like a normal
7310 value parameter.
7312 If the call appears in the context of a sizeof expression,
7313 it is not potentially-evaluated. */
7314 if (type_has_nontrivial_copy_init (arg_type)
7315 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))
7317 arg = force_rvalue (arg, complain);
7318 if (complain & tf_warning)
7319 warning (OPT_Wconditionally_supported,
7320 "passing objects of non-trivially-copyable "
7321 "type %q#T through %<...%> is conditionally supported",
7322 arg_type);
7323 return build1 (ADDR_EXPR, build_reference_type (arg_type), arg);
7325 /* Build up a real lvalue-to-rvalue conversion in case the
7326 copy constructor is trivial but not callable. */
7327 else if (CLASS_TYPE_P (arg_type))
7328 force_rvalue (arg, complain);
7332 return arg;
7335 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7337 tree
7338 build_x_va_arg (source_location loc, tree expr, tree type)
7340 if (processing_template_decl)
7342 tree r = build_min (VA_ARG_EXPR, type, expr);
7343 SET_EXPR_LOCATION (r, loc);
7344 return r;
7347 type = complete_type_or_else (type, NULL_TREE);
7349 if (expr == error_mark_node || !type)
7350 return error_mark_node;
7352 expr = mark_lvalue_use (expr);
7354 if (TYPE_REF_P (type))
7356 error ("cannot receive reference type %qT through %<...%>", type);
7357 return error_mark_node;
7360 if (type_has_nontrivial_copy_init (type)
7361 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7363 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7364 it as pass by invisible reference. */
7365 warning_at (loc, OPT_Wconditionally_supported,
7366 "receiving objects of non-trivially-copyable type %q#T "
7367 "through %<...%> is conditionally-supported", type);
7369 tree ref = cp_build_reference_type (type, false);
7370 expr = build_va_arg (loc, expr, ref);
7371 return convert_from_reference (expr);
7374 tree ret = build_va_arg (loc, expr, type);
7375 if (CLASS_TYPE_P (type))
7376 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7377 know how to handle it. */
7378 ret = get_target_expr (ret);
7379 return ret;
7382 /* TYPE has been given to va_arg. Apply the default conversions which
7383 would have happened when passed via ellipsis. Return the promoted
7384 type, or the passed type if there is no change. */
7386 tree
7387 cxx_type_promotes_to (tree type)
7389 tree promote;
7391 /* Perform the array-to-pointer and function-to-pointer
7392 conversions. */
7393 type = type_decays_to (type);
7395 promote = type_promotes_to (type);
7396 if (same_type_p (type, promote))
7397 promote = type;
7399 return promote;
7402 /* ARG is a default argument expression being passed to a parameter of
7403 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7404 zero-based argument number. Do any required conversions. Return
7405 the converted value. */
7407 static GTY(()) vec<tree, va_gc> *default_arg_context;
7408 void
7409 push_defarg_context (tree fn)
7410 { vec_safe_push (default_arg_context, fn); }
7412 void
7413 pop_defarg_context (void)
7414 { default_arg_context->pop (); }
7416 tree
7417 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7418 tsubst_flags_t complain)
7420 int i;
7421 tree t;
7423 /* See through clones. */
7424 fn = DECL_ORIGIN (fn);
7425 /* And inheriting ctors. */
7426 if (flag_new_inheriting_ctors)
7427 fn = strip_inheriting_ctors (fn);
7429 /* Detect recursion. */
7430 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7431 if (t == fn)
7433 if (complain & tf_error)
7434 error ("recursive evaluation of default argument for %q#D", fn);
7435 return error_mark_node;
7438 /* If the ARG is an unparsed default argument expression, the
7439 conversion cannot be performed. */
7440 if (TREE_CODE (arg) == DEFAULT_ARG)
7442 if (complain & tf_error)
7443 error ("call to %qD uses the default argument for parameter %P, which "
7444 "is not yet defined", fn, parmnum);
7445 return error_mark_node;
7448 push_defarg_context (fn);
7450 if (fn && DECL_TEMPLATE_INFO (fn))
7451 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7453 /* Due to:
7455 [dcl.fct.default]
7457 The names in the expression are bound, and the semantic
7458 constraints are checked, at the point where the default
7459 expressions appears.
7461 we must not perform access checks here. */
7462 push_deferring_access_checks (dk_no_check);
7463 /* We must make a copy of ARG, in case subsequent processing
7464 alters any part of it. */
7465 arg = break_out_target_exprs (arg, /*clear location*/true);
7467 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7468 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7469 complain);
7470 arg = convert_for_arg_passing (type, arg, complain);
7471 pop_deferring_access_checks();
7473 pop_defarg_context ();
7475 return arg;
7478 /* Returns the type which will really be used for passing an argument of
7479 type TYPE. */
7481 tree
7482 type_passed_as (tree type)
7484 /* Pass classes with copy ctors by invisible reference. */
7485 if (TREE_ADDRESSABLE (type))
7487 type = build_reference_type (type);
7488 /* There are no other pointers to this temporary. */
7489 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7491 else if (targetm.calls.promote_prototypes (NULL_TREE)
7492 && INTEGRAL_TYPE_P (type)
7493 && COMPLETE_TYPE_P (type)
7494 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7495 type = integer_type_node;
7497 return type;
7500 /* Actually perform the appropriate conversion. */
7502 tree
7503 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7505 tree bitfield_type;
7507 /* If VAL is a bitfield, then -- since it has already been converted
7508 to TYPE -- it cannot have a precision greater than TYPE.
7510 If it has a smaller precision, we must widen it here. For
7511 example, passing "int f:3;" to a function expecting an "int" will
7512 not result in any conversion before this point.
7514 If the precision is the same we must not risk widening. For
7515 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7516 often have type "int", even though the C++ type for the field is
7517 "long long". If the value is being passed to a function
7518 expecting an "int", then no conversions will be required. But,
7519 if we call convert_bitfield_to_declared_type, the bitfield will
7520 be converted to "long long". */
7521 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7522 if (bitfield_type
7523 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7524 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7526 if (val == error_mark_node)
7528 /* Pass classes with copy ctors by invisible reference. */
7529 else if (TREE_ADDRESSABLE (type))
7530 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7531 else if (targetm.calls.promote_prototypes (NULL_TREE)
7532 && INTEGRAL_TYPE_P (type)
7533 && COMPLETE_TYPE_P (type)
7534 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7535 val = cp_perform_integral_promotions (val, complain);
7536 if (complain & tf_warning)
7538 if (warn_suggest_attribute_format)
7540 tree rhstype = TREE_TYPE (val);
7541 const enum tree_code coder = TREE_CODE (rhstype);
7542 const enum tree_code codel = TREE_CODE (type);
7543 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7544 && coder == codel
7545 && check_missing_format_attribute (type, rhstype))
7546 warning (OPT_Wsuggest_attribute_format,
7547 "argument of function call might be a candidate "
7548 "for a format attribute");
7550 maybe_warn_parm_abi (type, cp_expr_loc_or_loc (val, input_location));
7552 return val;
7555 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7556 which just decay_conversion or no conversions at all should be done.
7557 This is true for some builtins which don't act like normal functions.
7558 Return 2 if no conversions at all should be done, 1 if just
7559 decay_conversion. Return 3 for special treatment of the 3rd argument
7560 for __builtin_*_overflow_p. */
7563 magic_varargs_p (tree fn)
7565 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7566 switch (DECL_FUNCTION_CODE (fn))
7568 case BUILT_IN_CLASSIFY_TYPE:
7569 case BUILT_IN_CONSTANT_P:
7570 case BUILT_IN_NEXT_ARG:
7571 case BUILT_IN_VA_START:
7572 return 1;
7574 case BUILT_IN_ADD_OVERFLOW_P:
7575 case BUILT_IN_SUB_OVERFLOW_P:
7576 case BUILT_IN_MUL_OVERFLOW_P:
7577 return 3;
7579 default:;
7580 return lookup_attribute ("type generic",
7581 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7584 return 0;
7587 /* Returns the decl of the dispatcher function if FN is a function version. */
7589 tree
7590 get_function_version_dispatcher (tree fn)
7592 tree dispatcher_decl = NULL;
7594 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7595 && DECL_FUNCTION_VERSIONED (fn));
7597 gcc_assert (targetm.get_function_versions_dispatcher);
7598 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7600 if (dispatcher_decl == NULL)
7602 error_at (input_location, "use of multiversioned function "
7603 "without a default");
7604 return NULL;
7607 retrofit_lang_decl (dispatcher_decl);
7608 gcc_assert (dispatcher_decl != NULL);
7609 return dispatcher_decl;
7612 /* fn is a function version dispatcher that is marked used. Mark all the
7613 semantically identical function versions it will dispatch as used. */
7615 void
7616 mark_versions_used (tree fn)
7618 struct cgraph_node *node;
7619 struct cgraph_function_version_info *node_v;
7620 struct cgraph_function_version_info *it_v;
7622 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7624 node = cgraph_node::get (fn);
7625 if (node == NULL)
7626 return;
7628 gcc_assert (node->dispatcher_function);
7630 node_v = node->function_version ();
7631 if (node_v == NULL)
7632 return;
7634 /* All semantically identical versions are chained. Traverse and mark each
7635 one of them as used. */
7636 it_v = node_v->next;
7637 while (it_v != NULL)
7639 mark_used (it_v->this_node->decl);
7640 it_v = it_v->next;
7644 /* Build a call to "the copy constructor" for the type of A, even if it
7645 wouldn't be selected by normal overload resolution. Used for
7646 diagnostics. */
7648 static tree
7649 call_copy_ctor (tree a, tsubst_flags_t complain)
7651 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7652 tree binfo = TYPE_BINFO (ctype);
7653 tree copy = get_copy_ctor (ctype, complain);
7654 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7655 tree ob = build_dummy_object (ctype);
7656 vec<tree, va_gc>* args = make_tree_vector_single (a);
7657 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7658 LOOKUP_NORMAL, NULL, complain);
7659 release_tree_vector (args);
7660 return r;
7663 /* Return true iff T refers to a base field. */
7665 static bool
7666 is_base_field_ref (tree t)
7668 STRIP_NOPS (t);
7669 if (TREE_CODE (t) == ADDR_EXPR)
7670 t = TREE_OPERAND (t, 0);
7671 if (TREE_CODE (t) == COMPONENT_REF)
7672 t = TREE_OPERAND (t, 1);
7673 if (TREE_CODE (t) == FIELD_DECL)
7674 return DECL_FIELD_IS_BASE (t);
7675 return false;
7678 /* We can't elide a copy from a function returning by value to a base
7679 subobject, as the callee might clobber tail padding. Return true iff this
7680 could be that case. */
7682 static bool
7683 unsafe_copy_elision_p (tree target, tree exp)
7685 /* Copy elision only happens with a TARGET_EXPR. */
7686 if (TREE_CODE (exp) != TARGET_EXPR)
7687 return false;
7688 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7689 /* It's safe to elide the copy for a class with no tail padding. */
7690 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7691 return false;
7692 /* It's safe to elide the copy if we aren't initializing a base object. */
7693 if (!is_base_field_ref (target))
7694 return false;
7695 tree init = TARGET_EXPR_INITIAL (exp);
7696 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7697 while (TREE_CODE (init) == COMPOUND_EXPR)
7698 init = TREE_OPERAND (init, 1);
7699 if (TREE_CODE (init) == COND_EXPR)
7701 /* We'll end up copying from each of the arms of the COND_EXPR directly
7702 into the target, so look at them. */
7703 if (tree op = TREE_OPERAND (init, 1))
7704 if (unsafe_copy_elision_p (target, op))
7705 return true;
7706 return unsafe_copy_elision_p (target, TREE_OPERAND (init, 2));
7708 return (TREE_CODE (init) == AGGR_INIT_EXPR
7709 && !AGGR_INIT_VIA_CTOR_P (init));
7712 /* True iff C is a conversion that binds a reference to a prvalue. */
7714 static bool
7715 conv_binds_ref_to_prvalue (conversion *c)
7717 if (c->kind != ck_ref_bind)
7718 return false;
7719 if (c->need_temporary_p)
7720 return true;
7722 c = next_conversion (c);
7724 if (c->kind == ck_rvalue)
7725 return true;
7726 if (c->kind == ck_user && !TYPE_REF_P (c->type))
7727 return true;
7728 if (c->kind == ck_identity && c->u.expr
7729 && TREE_CODE (c->u.expr) == TARGET_EXPR)
7730 return true;
7732 return false;
7735 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7736 class type or a pointer to class type. */
7738 tree
7739 build_trivial_dtor_call (tree instance)
7741 gcc_assert (!is_dummy_object (instance));
7743 if (!flag_lifetime_dse)
7745 no_clobber:
7746 return fold_convert (void_type_node, instance);
7749 if (INDIRECT_TYPE_P (TREE_TYPE (instance)))
7751 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance))))
7752 goto no_clobber;
7753 instance = cp_build_fold_indirect_ref (instance);
7756 /* A trivial destructor should still clobber the object. */
7757 tree clobber = build_clobber (TREE_TYPE (instance));
7758 return build2 (MODIFY_EXPR, void_type_node,
7759 instance, clobber);
7762 /* Subroutine of the various build_*_call functions. Overload resolution
7763 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7764 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7765 bitmask of various LOOKUP_* flags which apply to the call itself. */
7767 static tree
7768 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7770 tree fn = cand->fn;
7771 const vec<tree, va_gc> *args = cand->args;
7772 tree first_arg = cand->first_arg;
7773 conversion **convs = cand->convs;
7774 conversion *conv;
7775 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7776 int parmlen;
7777 tree val;
7778 int i = 0;
7779 int j = 0;
7780 unsigned int arg_index = 0;
7781 int is_method = 0;
7782 int nargs;
7783 tree *argarray;
7784 bool already_used = false;
7786 /* In a template, there is no need to perform all of the work that
7787 is normally done. We are only interested in the type of the call
7788 expression, i.e., the return type of the function. Any semantic
7789 errors will be deferred until the template is instantiated. */
7790 if (processing_template_decl)
7792 tree expr, addr;
7793 tree return_type;
7794 const tree *argarray;
7795 unsigned int nargs;
7797 if (undeduced_auto_decl (fn))
7798 mark_used (fn, complain);
7799 else
7800 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7801 See PR80598. */
7802 TREE_USED (fn) = 1;
7804 return_type = TREE_TYPE (TREE_TYPE (fn));
7805 nargs = vec_safe_length (args);
7806 if (first_arg == NULL_TREE)
7807 argarray = args->address ();
7808 else
7810 tree *alcarray;
7811 unsigned int ix;
7812 tree arg;
7814 ++nargs;
7815 alcarray = XALLOCAVEC (tree, nargs);
7816 alcarray[0] = build_this (first_arg);
7817 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7818 alcarray[ix + 1] = arg;
7819 argarray = alcarray;
7822 addr = build_addr_func (fn, complain);
7823 if (addr == error_mark_node)
7824 return error_mark_node;
7825 expr = build_call_array_loc (input_location, return_type,
7826 addr, nargs, argarray);
7827 if (TREE_THIS_VOLATILE (fn) && cfun)
7828 current_function_returns_abnormally = 1;
7829 return convert_from_reference (expr);
7832 /* Give any warnings we noticed during overload resolution. */
7833 if (cand->warnings && (complain & tf_warning))
7835 struct candidate_warning *w;
7836 for (w = cand->warnings; w; w = w->next)
7837 joust (cand, w->loser, 1, complain);
7840 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7841 argument to the copy constructor ends up being a prvalue after
7842 conversion. Let's do the normal processing, but pretend we aren't
7843 actually using the copy constructor. */
7844 bool force_elide = false;
7845 if (cxx_dialect >= cxx17
7846 && cand->num_convs == 1
7847 && DECL_COMPLETE_CONSTRUCTOR_P (fn)
7848 && (DECL_COPY_CONSTRUCTOR_P (fn)
7849 || DECL_MOVE_CONSTRUCTOR_P (fn))
7850 && conv_binds_ref_to_prvalue (convs[0]))
7852 force_elide = true;
7853 goto not_really_used;
7856 /* OK, we're actually calling this inherited constructor; set its deletedness
7857 appropriately. We can get away with doing this here because calling is
7858 the only way to refer to a constructor. */
7859 if (DECL_INHERITED_CTOR (fn))
7860 deduce_inheriting_ctor (fn);
7862 /* Make =delete work with SFINAE. */
7863 if (DECL_DELETED_FN (fn))
7865 if (complain & tf_error)
7866 mark_used (fn);
7867 return error_mark_node;
7870 if (DECL_FUNCTION_MEMBER_P (fn))
7872 tree access_fn;
7873 /* If FN is a template function, two cases must be considered.
7874 For example:
7876 struct A {
7877 protected:
7878 template <class T> void f();
7880 template <class T> struct B {
7881 protected:
7882 void g();
7884 struct C : A, B<int> {
7885 using A::f; // #1
7886 using B<int>::g; // #2
7889 In case #1 where `A::f' is a member template, DECL_ACCESS is
7890 recorded in the primary template but not in its specialization.
7891 We check access of FN using its primary template.
7893 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7894 because it is a member of class template B, DECL_ACCESS is
7895 recorded in the specialization `B<int>::g'. We cannot use its
7896 primary template because `B<T>::g' and `B<int>::g' may have
7897 different access. */
7898 if (DECL_TEMPLATE_INFO (fn)
7899 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7900 access_fn = DECL_TI_TEMPLATE (fn);
7901 else
7902 access_fn = fn;
7903 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7904 fn, complain))
7905 return error_mark_node;
7908 /* If we're checking for implicit delete, don't bother with argument
7909 conversions. */
7910 if (flags & LOOKUP_SPECULATIVE)
7912 if (cand->viable == 1)
7913 return fn;
7914 else if (!(complain & tf_error))
7915 /* Reject bad conversions now. */
7916 return error_mark_node;
7917 /* else continue to get conversion error. */
7920 not_really_used:
7922 /* N3276 magic doesn't apply to nested calls. */
7923 tsubst_flags_t decltype_flag = (complain & tf_decltype);
7924 complain &= ~tf_decltype;
7925 /* No-Cleanup doesn't apply to nested calls either. */
7926 tsubst_flags_t no_cleanup_complain = complain;
7927 complain &= ~tf_no_cleanup;
7929 /* Find maximum size of vector to hold converted arguments. */
7930 parmlen = list_length (parm);
7931 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7932 if (parmlen > nargs)
7933 nargs = parmlen;
7934 argarray = XALLOCAVEC (tree, nargs);
7936 /* The implicit parameters to a constructor are not considered by overload
7937 resolution, and must be of the proper type. */
7938 if (DECL_CONSTRUCTOR_P (fn))
7940 tree object_arg;
7941 if (first_arg != NULL_TREE)
7943 object_arg = first_arg;
7944 first_arg = NULL_TREE;
7946 else
7948 object_arg = (*args)[arg_index];
7949 ++arg_index;
7951 argarray[j++] = build_this (object_arg);
7952 parm = TREE_CHAIN (parm);
7953 /* We should never try to call the abstract constructor. */
7954 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7956 if (DECL_HAS_VTT_PARM_P (fn))
7958 argarray[j++] = (*args)[arg_index];
7959 ++arg_index;
7960 parm = TREE_CHAIN (parm);
7963 if (flags & LOOKUP_PREFER_RVALUE)
7965 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7966 the first parameter of the selected constructor is not an rvalue
7967 reference to the object's type (possibly cv-qualified)...." */
7968 gcc_assert (!(complain & tf_error));
7969 tree ptype = convs[0]->type;
7970 if (!TYPE_REF_P (ptype)
7971 || !TYPE_REF_IS_RVALUE (ptype)
7972 || CONVERSION_RANK (convs[0]) > cr_exact)
7973 return error_mark_node;
7976 /* Bypass access control for 'this' parameter. */
7977 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7979 tree parmtype = TREE_VALUE (parm);
7980 tree arg = build_this (first_arg != NULL_TREE
7981 ? first_arg
7982 : (*args)[arg_index]);
7983 tree argtype = TREE_TYPE (arg);
7984 tree converted_arg;
7985 tree base_binfo;
7987 if (arg == error_mark_node)
7988 return error_mark_node;
7990 if (convs[i]->bad_p)
7992 if (complain & tf_error)
7994 auto_diagnostic_group d;
7995 if (permerror (input_location, "passing %qT as %<this%> "
7996 "argument discards qualifiers",
7997 TREE_TYPE (argtype)))
7998 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
8000 else
8001 return error_mark_node;
8004 /* See if the function member or the whole class type is declared
8005 final and the call can be devirtualized. */
8006 if (DECL_FINAL_P (fn)
8007 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
8008 flags |= LOOKUP_NONVIRTUAL;
8010 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8011 X is called for an object that is not of type X, or of a type
8012 derived from X, the behavior is undefined.
8014 So we can assume that anything passed as 'this' is non-null, and
8015 optimize accordingly. */
8016 gcc_assert (TYPE_PTR_P (parmtype));
8017 /* Convert to the base in which the function was declared. */
8018 gcc_assert (cand->conversion_path != NULL_TREE);
8019 converted_arg = build_base_path (PLUS_EXPR,
8020 arg,
8021 cand->conversion_path,
8022 1, complain);
8023 /* Check that the base class is accessible. */
8024 if (!accessible_base_p (TREE_TYPE (argtype),
8025 BINFO_TYPE (cand->conversion_path), true))
8027 if (complain & tf_error)
8028 error ("%qT is not an accessible base of %qT",
8029 BINFO_TYPE (cand->conversion_path),
8030 TREE_TYPE (argtype));
8031 else
8032 return error_mark_node;
8034 /* If fn was found by a using declaration, the conversion path
8035 will be to the derived class, not the base declaring fn. We
8036 must convert from derived to base. */
8037 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
8038 TREE_TYPE (parmtype), ba_unique,
8039 NULL, complain);
8040 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
8041 base_binfo, 1, complain);
8043 argarray[j++] = converted_arg;
8044 parm = TREE_CHAIN (parm);
8045 if (first_arg != NULL_TREE)
8046 first_arg = NULL_TREE;
8047 else
8048 ++arg_index;
8049 ++i;
8050 is_method = 1;
8053 gcc_assert (first_arg == NULL_TREE);
8054 for (; arg_index < vec_safe_length (args) && parm;
8055 parm = TREE_CHAIN (parm), ++arg_index, ++i)
8057 tree type = TREE_VALUE (parm);
8058 tree arg = (*args)[arg_index];
8059 bool conversion_warning = true;
8061 conv = convs[i];
8063 /* If the argument is NULL and used to (implicitly) instantiate a
8064 template function (and bind one of the template arguments to
8065 the type of 'long int'), we don't want to warn about passing NULL
8066 to non-pointer argument.
8067 For example, if we have this template function:
8069 template<typename T> void func(T x) {}
8071 we want to warn (when -Wconversion is enabled) in this case:
8073 void foo() {
8074 func<int>(NULL);
8077 but not in this case:
8079 void foo() {
8080 func(NULL);
8083 if (null_node_p (arg)
8084 && DECL_TEMPLATE_INFO (fn)
8085 && cand->template_decl
8086 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
8087 conversion_warning = false;
8089 /* Warn about initializer_list deduction that isn't currently in the
8090 working draft. */
8091 if (cxx_dialect > cxx98
8092 && flag_deduce_init_list
8093 && cand->template_decl
8094 && is_std_init_list (non_reference (type))
8095 && BRACE_ENCLOSED_INITIALIZER_P (arg))
8097 tree tmpl = TI_TEMPLATE (cand->template_decl);
8098 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
8099 tree patparm = get_pattern_parm (realparm, tmpl);
8100 tree pattype = TREE_TYPE (patparm);
8101 if (PACK_EXPANSION_P (pattype))
8102 pattype = PACK_EXPANSION_PATTERN (pattype);
8103 pattype = non_reference (pattype);
8105 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
8106 && (cand->explicit_targs == NULL_TREE
8107 || (TREE_VEC_LENGTH (cand->explicit_targs)
8108 <= TEMPLATE_TYPE_IDX (pattype))))
8110 pedwarn (input_location, 0, "deducing %qT as %qT",
8111 non_reference (TREE_TYPE (patparm)),
8112 non_reference (type));
8113 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
8114 " in call to %qD", cand->fn);
8115 pedwarn (input_location, 0,
8116 " (you can disable this with -fno-deduce-init-list)");
8120 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8121 knows not to allow any more UDCs. This needs to happen after we
8122 process cand->warnings. */
8123 if (flags & LOOKUP_NO_CONVERSION)
8124 conv->user_conv_p = true;
8126 tsubst_flags_t arg_complain = complain;
8127 if (!conversion_warning)
8128 arg_complain &= ~tf_warning;
8130 val = convert_like_with_context (conv, arg, fn, i - is_method,
8131 arg_complain);
8132 val = convert_for_arg_passing (type, val, arg_complain);
8134 if (val == error_mark_node)
8135 return error_mark_node;
8136 else
8137 argarray[j++] = val;
8140 /* Default arguments */
8141 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
8143 if (TREE_VALUE (parm) == error_mark_node)
8144 return error_mark_node;
8145 val = convert_default_arg (TREE_VALUE (parm),
8146 TREE_PURPOSE (parm),
8147 fn, i - is_method,
8148 complain);
8149 if (val == error_mark_node)
8150 return error_mark_node;
8151 argarray[j++] = val;
8154 /* Ellipsis */
8155 int magic = magic_varargs_p (fn);
8156 for (; arg_index < vec_safe_length (args); ++arg_index)
8158 tree a = (*args)[arg_index];
8159 if ((magic == 3 && arg_index == 2) || magic == 2)
8161 /* Do no conversions for certain magic varargs. */
8162 a = mark_type_use (a);
8163 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
8164 return error_mark_node;
8166 else if (magic != 0)
8167 /* For other magic varargs only do decay_conversion. */
8168 a = decay_conversion (a, complain);
8169 else if (DECL_CONSTRUCTOR_P (fn)
8170 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
8171 TREE_TYPE (a)))
8173 /* Avoid infinite recursion trying to call A(...). */
8174 if (complain & tf_error)
8175 /* Try to call the actual copy constructor for a good error. */
8176 call_copy_ctor (a, complain);
8177 return error_mark_node;
8179 else
8180 a = convert_arg_to_ellipsis (a, complain);
8181 if (a == error_mark_node)
8182 return error_mark_node;
8183 argarray[j++] = a;
8186 gcc_assert (j <= nargs);
8187 nargs = j;
8189 /* Avoid to do argument-transformation, if warnings for format, and for
8190 nonnull are disabled. Just in case that at least one of them is active
8191 the check_function_arguments function might warn about something. */
8193 bool warned_p = false;
8194 if (warn_nonnull
8195 || warn_format
8196 || warn_suggest_attribute_format
8197 || warn_restrict)
8199 tree *fargs = (!nargs ? argarray
8200 : (tree *) alloca (nargs * sizeof (tree)));
8201 auto_vec<location_t> arglocs (nargs);
8202 for (j = 0; j < nargs; j++)
8204 /* For -Wformat undo the implicit passing by hidden reference
8205 done by convert_arg_to_ellipsis. */
8206 if (TREE_CODE (argarray[j]) == ADDR_EXPR
8207 && TYPE_REF_P (TREE_TYPE (argarray[j])))
8208 fargs[j] = TREE_OPERAND (argarray[j], 0);
8209 else
8210 fargs[j] = maybe_constant_value (argarray[j]);
8211 arglocs.quick_push (EXPR_LOC_OR_LOC (argarray[j], input_location));
8214 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
8215 nargs, fargs, &arglocs);
8218 if (DECL_INHERITED_CTOR (fn))
8220 /* Check for passing ellipsis arguments to an inherited constructor. We
8221 could handle this by open-coding the inherited constructor rather than
8222 defining it, but let's not bother now. */
8223 if (!cp_unevaluated_operand
8224 && cand->num_convs
8225 && cand->convs[cand->num_convs-1]->ellipsis_p)
8227 if (complain & tf_error)
8229 sorry ("passing arguments to ellipsis of inherited constructor "
8230 "%qD", cand->fn);
8231 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
8233 return error_mark_node;
8236 /* A base constructor inheriting from a virtual base doesn't get the
8237 inherited arguments, just this and __vtt. */
8238 if (ctor_omit_inherited_parms (fn))
8239 nargs = 2;
8242 /* Avoid actually calling copy constructors and copy assignment operators,
8243 if possible. */
8245 if (! flag_elide_constructors && !force_elide)
8246 /* Do things the hard way. */;
8247 else if (cand->num_convs == 1
8248 && (DECL_COPY_CONSTRUCTOR_P (fn)
8249 || DECL_MOVE_CONSTRUCTOR_P (fn))
8250 /* It's unsafe to elide the constructor when handling
8251 a noexcept-expression, it may evaluate to the wrong
8252 value (c++/53025). */
8253 && (force_elide || cp_noexcept_operand == 0))
8255 tree targ;
8256 tree arg = argarray[num_artificial_parms_for (fn)];
8257 tree fa;
8258 bool trivial = trivial_fn_p (fn);
8260 /* Pull out the real argument, disregarding const-correctness. */
8261 targ = arg;
8262 /* Strip the reference binding for the constructor parameter. */
8263 if (CONVERT_EXPR_P (targ)
8264 && TYPE_REF_P (TREE_TYPE (targ)))
8265 targ = TREE_OPERAND (targ, 0);
8266 /* But don't strip any other reference bindings; binding a temporary to a
8267 reference prevents copy elision. */
8268 while ((CONVERT_EXPR_P (targ)
8269 && !TYPE_REF_P (TREE_TYPE (targ)))
8270 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8271 targ = TREE_OPERAND (targ, 0);
8272 if (TREE_CODE (targ) == ADDR_EXPR)
8274 targ = TREE_OPERAND (targ, 0);
8275 if (!same_type_ignoring_top_level_qualifiers_p
8276 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8277 targ = NULL_TREE;
8279 else
8280 targ = NULL_TREE;
8282 if (targ)
8283 arg = targ;
8284 else
8285 arg = cp_build_fold_indirect_ref (arg);
8287 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8288 subobject. */
8289 if (CHECKING_P && cxx_dialect >= cxx17)
8290 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8291 || force_elide
8292 /* It's from binding the ref parm to a packed field. */
8293 || convs[0]->need_temporary_p
8294 || seen_error ()
8295 /* See unsafe_copy_elision_p. */
8296 || DECL_BASE_CONSTRUCTOR_P (fn));
8298 fa = argarray[0];
8299 bool unsafe = unsafe_copy_elision_p (fa, arg);
8300 bool eliding_temp = (TREE_CODE (arg) == TARGET_EXPR && !unsafe);
8302 /* [class.copy]: the copy constructor is implicitly defined even if the
8303 implementation elided its use. But don't warn about deprecation when
8304 eliding a temporary, as then no copy is actually performed. */
8305 warning_sentinel s (warn_deprecated_copy, eliding_temp);
8306 if (force_elide)
8307 /* The language says this isn't called. */;
8308 else if (!trivial)
8310 if (!mark_used (fn, complain) && !(complain & tf_error))
8311 return error_mark_node;
8312 already_used = true;
8314 else
8315 cp_warn_deprecated_use (fn, complain);
8317 /* If we're creating a temp and we already have one, don't create a
8318 new one. If we're not creating a temp but we get one, use
8319 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8320 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8321 temp or an INIT_EXPR otherwise. */
8322 if (is_dummy_object (fa))
8324 if (TREE_CODE (arg) == TARGET_EXPR)
8325 return arg;
8326 else if (trivial)
8327 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8329 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8330 && !unsafe)
8332 tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa));
8334 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8335 return val;
8338 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
8339 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)
8340 && trivial_fn_p (fn))
8342 tree to = cp_stabilize_reference
8343 (cp_build_fold_indirect_ref (argarray[0]));
8344 tree type = TREE_TYPE (to);
8345 tree as_base = CLASSTYPE_AS_BASE (type);
8346 tree arg = argarray[1];
8347 location_t loc = cp_expr_loc_or_loc (arg, input_location);
8349 if (is_really_empty_class (type))
8351 /* Avoid copying empty classes. */
8352 val = build2 (COMPOUND_EXPR, type, arg, to);
8353 TREE_NO_WARNING (val) = 1;
8355 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8357 if (is_std_init_list (type)
8358 && conv_binds_ref_to_prvalue (convs[1]))
8359 warning_at (loc, OPT_Winit_list_lifetime,
8360 "assignment from temporary initializer_list does not "
8361 "extend the lifetime of the underlying array");
8362 arg = cp_build_fold_indirect_ref (arg);
8363 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8365 else
8367 /* We must only copy the non-tail padding parts. */
8368 tree arg0, arg2, t;
8369 tree array_type, alias_set;
8371 arg2 = TYPE_SIZE_UNIT (as_base);
8372 arg0 = cp_build_addr_expr (to, complain);
8374 array_type = build_array_type (unsigned_char_type_node,
8375 build_index_type
8376 (size_binop (MINUS_EXPR,
8377 arg2, size_int (1))));
8378 alias_set = build_int_cst (build_pointer_type (type), 0);
8379 t = build2 (MODIFY_EXPR, void_type_node,
8380 build2 (MEM_REF, array_type, arg0, alias_set),
8381 build2 (MEM_REF, array_type, arg, alias_set));
8382 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8383 TREE_NO_WARNING (val) = 1;
8386 cp_warn_deprecated_use (fn, complain);
8388 return val;
8390 else if (trivial_fn_p (fn))
8392 if (DECL_DESTRUCTOR_P (fn))
8393 return build_trivial_dtor_call (argarray[0]);
8394 else if (default_ctor_p (fn))
8396 if (is_dummy_object (argarray[0]))
8397 return force_target_expr (DECL_CONTEXT (fn), void_node,
8398 no_cleanup_complain);
8399 else
8400 return cp_build_fold_indirect_ref (argarray[0]);
8404 gcc_assert (!force_elide);
8406 if (!already_used
8407 && !mark_used (fn, complain))
8408 return error_mark_node;
8410 /* Warn if the built-in writes to an object of a non-trivial type. */
8411 if (warn_class_memaccess
8412 && vec_safe_length (args) >= 2
8413 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
8414 maybe_warn_class_memaccess (input_location, fn, args);
8416 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
8418 tree t;
8419 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8420 DECL_CONTEXT (fn),
8421 ba_any, NULL, complain);
8422 gcc_assert (binfo && binfo != error_mark_node);
8424 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8425 complain);
8426 if (TREE_SIDE_EFFECTS (argarray[0]))
8427 argarray[0] = save_expr (argarray[0]);
8428 t = build_pointer_type (TREE_TYPE (fn));
8429 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8430 TREE_TYPE (fn) = t;
8432 else
8434 fn = build_addr_func (fn, complain);
8435 if (fn == error_mark_node)
8436 return error_mark_node;
8439 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8440 if (call == error_mark_node)
8441 return call;
8442 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8444 tree c = extract_call_expr (call);
8445 /* build_new_op_1 will clear this when appropriate. */
8446 CALL_EXPR_ORDERED_ARGS (c) = true;
8448 if (warned_p)
8450 tree c = extract_call_expr (call);
8451 if (TREE_CODE (c) == CALL_EXPR)
8452 TREE_NO_WARNING (c) = 1;
8454 return call;
8457 namespace
8460 /* Return the DECL of the first non-static subobject of class TYPE
8461 that satisfies the predicate PRED or null if none can be found. */
8463 template <class Predicate>
8464 tree
8465 first_non_static_field (tree type, Predicate pred)
8467 if (!type || !CLASS_TYPE_P (type))
8468 return NULL_TREE;
8470 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8472 if (TREE_CODE (field) != FIELD_DECL)
8473 continue;
8474 if (TREE_STATIC (field))
8475 continue;
8476 if (pred (field))
8477 return field;
8480 int i = 0;
8482 for (tree base_binfo, binfo = TYPE_BINFO (type);
8483 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8485 tree base = TREE_TYPE (base_binfo);
8486 if (pred (base))
8487 return base;
8488 if (tree field = first_non_static_field (base, pred))
8489 return field;
8492 return NULL_TREE;
8495 struct NonPublicField
8497 bool operator() (const_tree t)
8499 return DECL_P (t) && (TREE_PRIVATE (t) || TREE_PROTECTED (t));
8503 /* Return the DECL of the first non-public subobject of class TYPE
8504 or null if none can be found. */
8506 static inline tree
8507 first_non_public_field (tree type)
8509 return first_non_static_field (type, NonPublicField ());
8512 struct NonTrivialField
8514 bool operator() (const_tree t)
8516 return !trivial_type_p (DECL_P (t) ? TREE_TYPE (t) : t);
8520 /* Return the DECL of the first non-trivial subobject of class TYPE
8521 or null if none can be found. */
8523 static inline tree
8524 first_non_trivial_field (tree type)
8526 return first_non_static_field (type, NonTrivialField ());
8529 } /* unnamed namespace */
8531 /* Return true if all copy and move assignment operator overloads for
8532 class TYPE are trivial and at least one of them is not deleted and,
8533 when ACCESS is set, accessible. Return false otherwise. Set
8534 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8535 copy or move assignment. */
8537 static bool
8538 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8540 tree fns = get_class_binding (type, assign_op_identifier);
8541 bool all_trivial = true;
8543 /* Iterate over overloads of the assignment operator, checking
8544 accessible copy assignments for triviality. */
8546 for (ovl_iterator oi (fns); oi; ++oi)
8548 tree f = *oi;
8550 /* Skip operators that aren't copy assignments. */
8551 if (!copy_fn_p (f))
8552 continue;
8554 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8555 || accessible_p (TYPE_BINFO (type), f, true));
8557 /* Skip template assignment operators and deleted functions. */
8558 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8559 continue;
8561 if (accessible)
8562 *hasassign = true;
8564 if (!accessible || !trivial_fn_p (f))
8565 all_trivial = false;
8567 /* Break early when both properties have been determined. */
8568 if (*hasassign && !all_trivial)
8569 break;
8572 /* Return true if they're all trivial and one of the expressions
8573 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8574 tree ref = cp_build_reference_type (type, false);
8575 return (all_trivial
8576 && (is_trivially_xible (MODIFY_EXPR, type, type)
8577 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8580 /* Return true if all copy and move ctor overloads for class TYPE are
8581 trivial and at least one of them is not deleted and, when ACCESS is
8582 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8583 to true when the TYPE has a (not necessarily trivial) default and copy
8584 (or move) ctor, respectively. */
8586 static bool
8587 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8589 tree fns = get_class_binding (type, complete_ctor_identifier);
8590 bool all_trivial = true;
8592 for (ovl_iterator oi (fns); oi; ++oi)
8594 tree f = *oi;
8596 /* Skip template constructors. */
8597 if (TREE_CODE (f) != FUNCTION_DECL)
8598 continue;
8600 bool cpy_or_move_ctor_p = copy_fn_p (f);
8602 /* Skip ctors other than default, copy, and move. */
8603 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8604 continue;
8606 if (DECL_DELETED_FN (f))
8607 continue;
8609 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8610 || accessible_p (TYPE_BINFO (type), f, true));
8612 if (accessible)
8613 hasctor[cpy_or_move_ctor_p] = true;
8615 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8616 all_trivial = false;
8618 /* Break early when both properties have been determined. */
8619 if (hasctor[0] && hasctor[1] && !all_trivial)
8620 break;
8623 return all_trivial;
8626 /* Issue a warning on a call to the built-in function FNDECL if it is
8627 a raw memory write whose destination is not an object of (something
8628 like) trivial or standard layout type with a non-deleted assignment
8629 and copy ctor. Detects const correctness violations, corrupting
8630 references, virtual table pointers, and bypassing non-trivial
8631 assignments. */
8633 static void
8634 maybe_warn_class_memaccess (location_t loc, tree fndecl,
8635 const vec<tree, va_gc> *args)
8637 /* Except for bcopy where it's second, the destination pointer is
8638 the first argument for all functions handled here. Compute
8639 the index of the destination and source arguments. */
8640 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8641 unsigned srcidx = !dstidx;
8643 tree dest = (*args)[dstidx];
8644 if (!TREE_TYPE (dest) || !INDIRECT_TYPE_P (TREE_TYPE (dest)))
8645 return;
8647 tree srctype = NULL_TREE;
8649 /* Determine the type of the pointed-to object and whether it's
8650 a complete class type. */
8651 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8653 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8654 return;
8656 /* Check to see if the raw memory call is made by a non-static member
8657 function with THIS as the destination argument for the destination
8658 type. If so, and if the class has no non-trivial bases or members,
8659 be more permissive. */
8660 if (current_function_decl
8661 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl)
8662 && is_this_parameter (tree_strip_nop_conversions (dest)))
8664 tree ctx = DECL_CONTEXT (current_function_decl);
8665 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8666 tree binfo = TYPE_BINFO (ctx);
8668 if (special
8669 && !BINFO_VTABLE (binfo)
8670 && !first_non_trivial_field (desttype))
8671 return;
8674 /* True if the class is trivial. */
8675 bool trivial = trivial_type_p (desttype);
8677 /* Set to true if DESTYPE has an accessible copy assignment. */
8678 bool hasassign = false;
8679 /* True if all of the class' overloaded copy assignment operators
8680 are all trivial (and not deleted) and at least one of them is
8681 accessible. */
8682 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8684 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8685 respectively. */
8686 bool hasctors[2] = { false, false };
8688 /* True if all of the class' overloaded copy constructors are all
8689 trivial (and not deleted) and at least one of them is accessible. */
8690 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8692 /* Set FLD to the first private/protected member of the class. */
8693 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8695 /* The warning format string. */
8696 const char *warnfmt = NULL;
8697 /* A suggested alternative to offer instead of the raw memory call.
8698 Empty string when none can be come up with. */
8699 const char *suggest = "";
8700 bool warned = false;
8702 switch (DECL_FUNCTION_CODE (fndecl))
8704 case BUILT_IN_MEMSET:
8705 if (!integer_zerop (maybe_constant_value ((*args)[1])))
8707 /* Diagnose setting non-copy-assignable or non-trivial types,
8708 or types with a private member, to (potentially) non-zero
8709 bytes. Since the value of the bytes being written is unknown,
8710 suggest using assignment instead (if one exists). Also warn
8711 for writes into objects for which zero-initialization doesn't
8712 mean all bits clear (pointer-to-member data, where null is all
8713 bits set). Since the value being written is (most likely)
8714 non-zero, simply suggest assignment (but not copy assignment). */
8715 suggest = "; use assignment instead";
8716 if (!trivassign)
8717 warnfmt = G_("%qD writing to an object of type %#qT with "
8718 "no trivial copy-assignment");
8719 else if (!trivial)
8720 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8721 else if (fld)
8723 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8724 warned = warning_at (loc, OPT_Wclass_memaccess,
8725 "%qD writing to an object of type %#qT with "
8726 "%qs member %qD",
8727 fndecl, desttype, access, fld);
8729 else if (!zero_init_p (desttype))
8730 warnfmt = G_("%qD writing to an object of type %#qT containing "
8731 "a pointer to data member%s");
8733 break;
8735 /* Fall through. */
8737 case BUILT_IN_BZERO:
8738 /* Similarly to the above, diagnose clearing non-trivial or non-
8739 standard layout objects, or objects of types with no assignmenmt.
8740 Since the value being written is known to be zero, suggest either
8741 copy assignment, copy ctor, or default ctor as an alternative,
8742 depending on what's available. */
8744 if (hasassign && hasctors[0])
8745 suggest = G_("; use assignment or value-initialization instead");
8746 else if (hasassign)
8747 suggest = G_("; use assignment instead");
8748 else if (hasctors[0])
8749 suggest = G_("; use value-initialization instead");
8751 if (!trivassign)
8752 warnfmt = G_("%qD clearing an object of type %#qT with "
8753 "no trivial copy-assignment%s");
8754 else if (!trivial)
8755 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8756 else if (!zero_init_p (desttype))
8757 warnfmt = G_("%qD clearing an object of type %#qT containing "
8758 "a pointer-to-member%s");
8759 break;
8761 case BUILT_IN_BCOPY:
8762 case BUILT_IN_MEMCPY:
8763 case BUILT_IN_MEMMOVE:
8764 case BUILT_IN_MEMPCPY:
8765 /* Determine the type of the source object. */
8766 srctype = TREE_TYPE ((*args)[srcidx]);
8767 if (!srctype || !INDIRECT_TYPE_P (srctype))
8768 srctype = void_type_node;
8769 else
8770 srctype = TREE_TYPE (srctype);
8772 /* Since it's impossible to determine wheter the byte copy is
8773 being used in place of assignment to an existing object or
8774 as a substitute for initialization, assume it's the former.
8775 Determine the best alternative to use instead depending on
8776 what's not deleted. */
8777 if (hasassign && hasctors[1])
8778 suggest = G_("; use copy-assignment or copy-initialization instead");
8779 else if (hasassign)
8780 suggest = G_("; use copy-assignment instead");
8781 else if (hasctors[1])
8782 suggest = G_("; use copy-initialization instead");
8784 if (!trivassign)
8785 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8786 "copy-assignment%s");
8787 else if (!trivially_copyable_p (desttype))
8788 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8789 "type %#qT%s");
8790 else if (!trivcopy)
8791 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8793 else if (!trivial
8794 && !VOID_TYPE_P (srctype)
8795 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8796 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8797 srctype))
8799 /* Warn when copying into a non-trivial object from an object
8800 of a different type other than void or char. */
8801 warned = warning_at (loc, OPT_Wclass_memaccess,
8802 "%qD copying an object of non-trivial type "
8803 "%#qT from an array of %#qT",
8804 fndecl, desttype, srctype);
8806 else if (fld
8807 && !VOID_TYPE_P (srctype)
8808 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8809 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8810 srctype))
8812 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8813 warned = warning_at (loc, OPT_Wclass_memaccess,
8814 "%qD copying an object of type %#qT with "
8815 "%qs member %qD from an array of %#qT; use "
8816 "assignment or copy-initialization instead",
8817 fndecl, desttype, access, fld, srctype);
8819 else if (!trivial && vec_safe_length (args) > 2)
8821 tree sz = maybe_constant_value ((*args)[2]);
8822 if (!tree_fits_uhwi_p (sz))
8823 break;
8825 /* Finally, warn on partial copies. */
8826 unsigned HOST_WIDE_INT typesize
8827 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8828 if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize)
8829 warned = warning_at (loc, OPT_Wclass_memaccess,
8830 (typesize - partial > 1
8831 ? G_("%qD writing to an object of "
8832 "a non-trivial type %#qT leaves %wu "
8833 "bytes unchanged")
8834 : G_("%qD writing to an object of "
8835 "a non-trivial type %#qT leaves %wu "
8836 "byte unchanged")),
8837 fndecl, desttype, typesize - partial);
8839 break;
8841 case BUILT_IN_REALLOC:
8843 if (!trivially_copyable_p (desttype))
8844 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8845 "%#qT; use %<new%> and %<delete%> instead");
8846 else if (!trivcopy)
8847 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8848 "constructor; use %<new%> and %<delete%> instead");
8849 else if (!get_dtor (desttype, tf_none))
8850 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8851 "destructor");
8852 else if (!trivial)
8854 tree sz = maybe_constant_value ((*args)[1]);
8855 if (TREE_CODE (sz) == INTEGER_CST
8856 && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype)))
8857 /* Finally, warn on reallocation into insufficient space. */
8858 warned = warning_at (loc, OPT_Wclass_memaccess,
8859 "%qD moving an object of non-trivial type "
8860 "%#qT and size %E into a region of size %E",
8861 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8862 sz);
8864 break;
8866 default:
8867 return;
8870 if (warnfmt)
8872 if (suggest)
8873 warned = warning_at (loc, OPT_Wclass_memaccess,
8874 warnfmt, fndecl, desttype, suggest);
8875 else
8876 warned = warning_at (loc, OPT_Wclass_memaccess,
8877 warnfmt, fndecl, desttype);
8880 if (warned)
8881 inform (location_of (desttype), "%#qT declared here", desttype);
8884 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8885 This function performs no overload resolution, conversion, or other
8886 high-level operations. */
8888 tree
8889 build_cxx_call (tree fn, int nargs, tree *argarray,
8890 tsubst_flags_t complain)
8892 tree fndecl;
8894 /* Remember roughly where this call is. */
8895 location_t loc = cp_expr_loc_or_loc (fn, input_location);
8896 fn = build_call_a (fn, nargs, argarray);
8897 SET_EXPR_LOCATION (fn, loc);
8899 fndecl = get_callee_fndecl (fn);
8901 /* Check that arguments to builtin functions match the expectations. */
8902 if (fndecl
8903 && !processing_template_decl
8904 && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
8906 int i;
8908 /* We need to take care that values to BUILT_IN_NORMAL
8909 are reduced. */
8910 for (i = 0; i < nargs; i++)
8911 argarray[i] = maybe_constant_value (argarray[i]);
8913 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8914 nargs, argarray))
8915 return error_mark_node;
8918 if (VOID_TYPE_P (TREE_TYPE (fn)))
8919 return fn;
8921 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8922 function call is either the operand of a decltype-specifier or the
8923 right operand of a comma operator that is the operand of a
8924 decltype-specifier, a temporary object is not introduced for the
8925 prvalue. The type of the prvalue may be incomplete. */
8926 if (!(complain & tf_decltype))
8928 fn = require_complete_type_sfinae (fn, complain);
8929 if (fn == error_mark_node)
8930 return error_mark_node;
8932 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8934 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8935 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8938 return convert_from_reference (fn);
8941 /* Returns the value to use for the in-charge parameter when making a
8942 call to a function with the indicated NAME.
8944 FIXME:Can't we find a neater way to do this mapping? */
8946 tree
8947 in_charge_arg_for_name (tree name)
8949 if (IDENTIFIER_CTOR_P (name))
8951 if (name == complete_ctor_identifier)
8952 return integer_one_node;
8953 gcc_checking_assert (name == base_ctor_identifier);
8955 else
8957 if (name == complete_dtor_identifier)
8958 return integer_two_node;
8959 else if (name == deleting_dtor_identifier)
8960 return integer_three_node;
8961 gcc_checking_assert (name == base_dtor_identifier);
8964 return integer_zero_node;
8967 /* We've built up a constructor call RET. Complain if it delegates to the
8968 constructor we're currently compiling. */
8970 static void
8971 check_self_delegation (tree ret)
8973 if (TREE_CODE (ret) == TARGET_EXPR)
8974 ret = TARGET_EXPR_INITIAL (ret);
8975 tree fn = cp_get_callee_fndecl_nofold (ret);
8976 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8977 error ("constructor delegates to itself");
8980 /* Build a call to a constructor, destructor, or an assignment
8981 operator for INSTANCE, an expression with class type. NAME
8982 indicates the special member function to call; *ARGS are the
8983 arguments. ARGS may be NULL. This may change ARGS. BINFO
8984 indicates the base of INSTANCE that is to be passed as the `this'
8985 parameter to the member function called.
8987 FLAGS are the LOOKUP_* flags to use when processing the call.
8989 If NAME indicates a complete object constructor, INSTANCE may be
8990 NULL_TREE. In this case, the caller will call build_cplus_new to
8991 store the newly constructed object into a VAR_DECL. */
8993 tree
8994 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8995 tree binfo, int flags, tsubst_flags_t complain)
8997 tree fns;
8998 /* The type of the subobject to be constructed or destroyed. */
8999 tree class_type;
9000 vec<tree, va_gc> *allocated = NULL;
9001 tree ret;
9003 gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier);
9005 if (error_operand_p (instance))
9006 return error_mark_node;
9008 if (IDENTIFIER_DTOR_P (name))
9010 gcc_assert (args == NULL || vec_safe_is_empty (*args));
9011 if (!type_build_dtor_call (TREE_TYPE (instance)))
9012 /* Shortcut to avoid lazy destructor declaration. */
9013 return build_trivial_dtor_call (instance);
9016 if (TYPE_P (binfo))
9018 /* Resolve the name. */
9019 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
9020 return error_mark_node;
9022 binfo = TYPE_BINFO (binfo);
9025 gcc_assert (binfo != NULL_TREE);
9027 class_type = BINFO_TYPE (binfo);
9029 /* Handle the special case where INSTANCE is NULL_TREE. */
9030 if (name == complete_ctor_identifier && !instance)
9031 instance = build_dummy_object (class_type);
9032 else
9034 /* Convert to the base class, if necessary. */
9035 if (!same_type_ignoring_top_level_qualifiers_p
9036 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
9038 if (IDENTIFIER_CDTOR_P (name))
9039 /* For constructors and destructors, either the base is
9040 non-virtual, or it is virtual but we are doing the
9041 conversion from a constructor or destructor for the
9042 complete object. In either case, we can convert
9043 statically. */
9044 instance = convert_to_base_statically (instance, binfo);
9045 else
9047 /* However, for assignment operators, we must convert
9048 dynamically if the base is virtual. */
9049 gcc_checking_assert (name == assign_op_identifier);
9050 instance = build_base_path (PLUS_EXPR, instance,
9051 binfo, /*nonnull=*/1, complain);
9056 gcc_assert (instance != NULL_TREE);
9058 /* In C++17, "If the initializer expression is a prvalue and the
9059 cv-unqualified version of the source type is the same class as the class
9060 of the destination, the initializer expression is used to initialize the
9061 destination object." Handle that here to avoid doing overload
9062 resolution. */
9063 if (cxx_dialect >= cxx17
9064 && args && vec_safe_length (*args) == 1
9065 && name == complete_ctor_identifier)
9067 tree arg = (**args)[0];
9069 if (BRACE_ENCLOSED_INITIALIZER_P (arg)
9070 && !TYPE_HAS_LIST_CTOR (class_type)
9071 && CONSTRUCTOR_NELTS (arg) == 1)
9072 arg = CONSTRUCTOR_ELT (arg, 0)->value;
9074 if ((TREE_CODE (arg) == TARGET_EXPR
9075 || TREE_CODE (arg) == CONSTRUCTOR)
9076 && (same_type_ignoring_top_level_qualifiers_p
9077 (class_type, TREE_TYPE (arg))))
9079 if (is_dummy_object (instance))
9080 return arg;
9081 else if (TREE_CODE (arg) == TARGET_EXPR)
9082 TARGET_EXPR_DIRECT_INIT_P (arg) = true;
9084 if ((complain & tf_error)
9085 && (flags & LOOKUP_DELEGATING_CONS))
9086 check_self_delegation (arg);
9087 /* Avoid change of behavior on Wunused-var-2.C. */
9088 instance = mark_lvalue_use (instance);
9089 return build2 (INIT_EXPR, class_type, instance, arg);
9093 fns = lookup_fnfields (binfo, name, 1);
9095 /* When making a call to a constructor or destructor for a subobject
9096 that uses virtual base classes, pass down a pointer to a VTT for
9097 the subobject. */
9098 if ((name == base_ctor_identifier
9099 || name == base_dtor_identifier)
9100 && CLASSTYPE_VBASECLASSES (class_type))
9102 tree vtt;
9103 tree sub_vtt;
9105 /* If the current function is a complete object constructor
9106 or destructor, then we fetch the VTT directly.
9107 Otherwise, we look it up using the VTT we were given. */
9108 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
9109 vtt = decay_conversion (vtt, complain);
9110 if (vtt == error_mark_node)
9111 return error_mark_node;
9112 vtt = build_if_in_charge (vtt, current_vtt_parm);
9113 if (BINFO_SUBVTT_INDEX (binfo))
9114 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
9115 else
9116 sub_vtt = vtt;
9118 if (args == NULL)
9120 allocated = make_tree_vector ();
9121 args = &allocated;
9124 vec_safe_insert (*args, 0, sub_vtt);
9127 ret = build_new_method_call (instance, fns, args,
9128 TYPE_BINFO (BINFO_TYPE (binfo)),
9129 flags, /*fn=*/NULL,
9130 complain);
9132 if (allocated != NULL)
9133 release_tree_vector (allocated);
9135 if ((complain & tf_error)
9136 && (flags & LOOKUP_DELEGATING_CONS)
9137 && name == complete_ctor_identifier)
9138 check_self_delegation (ret);
9140 return ret;
9143 /* Return the NAME, as a C string. The NAME indicates a function that
9144 is a member of TYPE. *FREE_P is set to true if the caller must
9145 free the memory returned.
9147 Rather than go through all of this, we should simply set the names
9148 of constructors and destructors appropriately, and dispense with
9149 ctor_identifier, dtor_identifier, etc. */
9151 static char *
9152 name_as_c_string (tree name, tree type, bool *free_p)
9154 const char *pretty_name;
9156 /* Assume that we will not allocate memory. */
9157 *free_p = false;
9158 /* Constructors and destructors are special. */
9159 if (IDENTIFIER_CDTOR_P (name))
9161 pretty_name
9162 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
9163 /* For a destructor, add the '~'. */
9164 if (IDENTIFIER_DTOR_P (name))
9166 pretty_name = concat ("~", pretty_name, NULL);
9167 /* Remember that we need to free the memory allocated. */
9168 *free_p = true;
9171 else if (IDENTIFIER_CONV_OP_P (name))
9173 pretty_name = concat ("operator ",
9174 type_as_string_translate (TREE_TYPE (name),
9175 TFF_PLAIN_IDENTIFIER),
9176 NULL);
9177 /* Remember that we need to free the memory allocated. */
9178 *free_p = true;
9180 else
9181 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
9183 return CONST_CAST (char *, pretty_name);
9186 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9187 return NULL. */
9189 static z_candidate *
9190 single_z_candidate (z_candidate *candidates)
9192 if (candidates == NULL)
9193 return NULL;
9195 if (candidates->next)
9196 return NULL;
9198 return candidates;
9201 /* If CANDIDATE is invalid due to a bad argument type, return the
9202 pertinent conversion_info.
9204 Otherwise, return NULL. */
9206 static const conversion_info *
9207 maybe_get_bad_conversion_for_unmatched_call (const z_candidate *candidate)
9209 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9210 rejection_reason *r = candidate->reason;
9212 if (r == NULL)
9213 return NULL;
9215 switch (r->code)
9217 default:
9218 return NULL;
9220 case rr_arg_conversion:
9221 return &r->u.conversion;
9223 case rr_bad_arg_conversion:
9224 return &r->u.bad_conversion;
9228 /* Issue an error and note complaining about a bad argument type at a
9229 callsite with a single candidate FNDECL.
9231 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9232 case input_location is used).
9233 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9234 the formal parameter. */
9236 void
9237 complain_about_bad_argument (location_t arg_loc,
9238 tree from_type, tree to_type,
9239 tree fndecl, int parmnum)
9241 auto_diagnostic_group d;
9242 range_label_for_type_mismatch rhs_label (from_type, to_type);
9243 range_label *label = &rhs_label;
9244 if (arg_loc == UNKNOWN_LOCATION)
9246 arg_loc = input_location;
9247 label = NULL;
9249 gcc_rich_location richloc (arg_loc, label);
9250 error_at (&richloc,
9251 "cannot convert %qH to %qI",
9252 from_type, to_type);
9253 inform (get_fndecl_argument_location (fndecl, parmnum),
9254 " initializing argument %P of %qD", parmnum, fndecl);
9257 /* Subroutine of build_new_method_call_1, for where there are no viable
9258 candidates for the call. */
9260 static void
9261 complain_about_no_candidates_for_method_call (tree instance,
9262 z_candidate *candidates,
9263 tree explicit_targs,
9264 tree basetype,
9265 tree optype, tree name,
9266 bool skip_first_for_error,
9267 vec<tree, va_gc> *user_args)
9269 auto_diagnostic_group d;
9270 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9271 cxx_incomplete_type_error (instance, basetype);
9272 else if (optype)
9273 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9274 basetype, optype, build_tree_list_vec (user_args),
9275 TREE_TYPE (instance));
9276 else
9278 /* Special-case for when there's a single candidate that's failing
9279 due to a bad argument type. */
9280 if (z_candidate *candidate = single_z_candidate (candidates))
9281 if (const conversion_info *conv
9282 = maybe_get_bad_conversion_for_unmatched_call (candidate))
9284 complain_about_bad_argument (conv->loc,
9285 conv->from, conv->to_type,
9286 candidate->fn, conv->n_arg);
9287 return;
9290 tree arglist = build_tree_list_vec (user_args);
9291 tree errname = name;
9292 bool twiddle = false;
9293 if (IDENTIFIER_CDTOR_P (errname))
9295 twiddle = IDENTIFIER_DTOR_P (errname);
9296 errname = constructor_name (basetype);
9298 if (explicit_targs)
9299 errname = lookup_template_function (errname, explicit_targs);
9300 if (skip_first_for_error)
9301 arglist = TREE_CHAIN (arglist);
9302 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9303 basetype, &"~"[!twiddle], errname, arglist,
9304 TREE_TYPE (instance));
9306 print_z_candidates (location_of (name), candidates);
9309 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9310 be set, upon return, to the function called. ARGS may be NULL.
9311 This may change ARGS. */
9313 static tree
9314 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
9315 tree conversion_path, int flags,
9316 tree *fn_p, tsubst_flags_t complain)
9318 struct z_candidate *candidates = 0, *cand;
9319 tree explicit_targs = NULL_TREE;
9320 tree basetype = NULL_TREE;
9321 tree access_binfo, binfo;
9322 tree optype;
9323 tree first_mem_arg = NULL_TREE;
9324 tree name;
9325 bool skip_first_for_error;
9326 vec<tree, va_gc> *user_args;
9327 tree call;
9328 tree fn;
9329 int template_only = 0;
9330 bool any_viable_p;
9331 tree orig_instance;
9332 tree orig_fns;
9333 vec<tree, va_gc> *orig_args = NULL;
9334 void *p;
9336 gcc_assert (instance != NULL_TREE);
9338 /* We don't know what function we're going to call, yet. */
9339 if (fn_p)
9340 *fn_p = NULL_TREE;
9342 if (error_operand_p (instance)
9343 || !fns || error_operand_p (fns))
9344 return error_mark_node;
9346 if (!BASELINK_P (fns))
9348 if (complain & tf_error)
9349 error ("call to non-function %qD", fns);
9350 return error_mark_node;
9353 orig_instance = instance;
9354 orig_fns = fns;
9356 /* Dismantle the baselink to collect all the information we need. */
9357 if (!conversion_path)
9358 conversion_path = BASELINK_BINFO (fns);
9359 access_binfo = BASELINK_ACCESS_BINFO (fns);
9360 binfo = BASELINK_BINFO (fns);
9361 optype = BASELINK_OPTYPE (fns);
9362 fns = BASELINK_FUNCTIONS (fns);
9363 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
9365 explicit_targs = TREE_OPERAND (fns, 1);
9366 fns = TREE_OPERAND (fns, 0);
9367 template_only = 1;
9369 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
9370 || TREE_CODE (fns) == TEMPLATE_DECL
9371 || TREE_CODE (fns) == OVERLOAD);
9372 fn = OVL_FIRST (fns);
9373 name = DECL_NAME (fn);
9375 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
9376 gcc_assert (CLASS_TYPE_P (basetype));
9378 user_args = args == NULL ? NULL : *args;
9379 /* Under DR 147 A::A() is an invalid constructor call,
9380 not a functional cast. */
9381 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
9383 if (! (complain & tf_error))
9384 return error_mark_node;
9386 basetype = DECL_CONTEXT (fn);
9387 name = constructor_name (basetype);
9388 auto_diagnostic_group d;
9389 if (permerror (input_location,
9390 "cannot call constructor %<%T::%D%> directly",
9391 basetype, name))
9392 inform (input_location, "for a function-style cast, remove the "
9393 "redundant %<::%D%>", name);
9394 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9395 complain);
9396 return call;
9399 if (processing_template_decl)
9401 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
9402 instance = build_non_dependent_expr (instance);
9403 if (args != NULL)
9404 make_args_non_dependent (*args);
9407 /* Process the argument list. */
9408 if (args != NULL && *args != NULL)
9410 *args = resolve_args (*args, complain);
9411 if (*args == NULL)
9412 return error_mark_node;
9413 user_args = *args;
9416 /* Consider the object argument to be used even if we end up selecting a
9417 static member function. */
9418 instance = mark_type_use (instance);
9420 /* Figure out whether to skip the first argument for the error
9421 message we will display to users if an error occurs. We don't
9422 want to display any compiler-generated arguments. The "this"
9423 pointer hasn't been added yet. However, we must remove the VTT
9424 pointer if this is a call to a base-class constructor or
9425 destructor. */
9426 skip_first_for_error = false;
9427 if (IDENTIFIER_CDTOR_P (name))
9429 /* Callers should explicitly indicate whether they want to ctor
9430 the complete object or just the part without virtual bases. */
9431 gcc_assert (name != ctor_identifier);
9433 /* Remove the VTT pointer, if present. */
9434 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9435 && CLASSTYPE_VBASECLASSES (basetype))
9436 skip_first_for_error = true;
9438 /* It's OK to call destructors and constructors on cv-qualified
9439 objects. Therefore, convert the INSTANCE to the unqualified
9440 type, if necessary. */
9441 if (!same_type_p (basetype, TREE_TYPE (instance)))
9443 instance = build_this (instance);
9444 instance = build_nop (build_pointer_type (basetype), instance);
9445 instance = build_fold_indirect_ref (instance);
9448 else
9449 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9451 /* For the overload resolution we need to find the actual `this`
9452 that would be captured if the call turns out to be to a
9453 non-static member function. Do not actually capture it at this
9454 point. */
9455 if (DECL_CONSTRUCTOR_P (fn))
9456 /* Constructors don't use the enclosing 'this'. */
9457 first_mem_arg = instance;
9458 else
9459 first_mem_arg = maybe_resolve_dummy (instance, false);
9461 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9462 p = conversion_obstack_alloc (0);
9464 /* The number of arguments artificial parms in ARGS; we subtract one because
9465 there's no 'this' in ARGS. */
9466 unsigned skip = num_artificial_parms_for (fn) - 1;
9468 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9469 initializer, not T({ }). */
9470 if (DECL_CONSTRUCTOR_P (fn)
9471 && vec_safe_length (user_args) > skip
9472 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9474 tree init_list = (*user_args)[skip];
9475 tree init = NULL_TREE;
9477 gcc_assert (user_args->length () == skip + 1
9478 && !(flags & LOOKUP_ONLYCONVERTING));
9480 /* If the initializer list has no elements and T is a class type with
9481 a default constructor, the object is value-initialized. Handle
9482 this here so we don't need to handle it wherever we use
9483 build_special_member_call. */
9484 if (CONSTRUCTOR_NELTS (init_list) == 0
9485 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9486 /* For a user-provided default constructor, use the normal
9487 mechanisms so that protected access works. */
9488 && type_has_non_user_provided_default_constructor (basetype)
9489 && !processing_template_decl)
9490 init = build_value_init (basetype, complain);
9492 /* If BASETYPE is an aggregate, we need to do aggregate
9493 initialization. */
9494 else if (CP_AGGREGATE_TYPE_P (basetype))
9496 init = reshape_init (basetype, init_list, complain);
9497 init = digest_init (basetype, init, complain);
9500 if (init)
9502 if (is_dummy_object (instance))
9503 return get_target_expr_sfinae (init, complain);
9504 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9505 TREE_SIDE_EFFECTS (init) = true;
9506 return init;
9509 /* Otherwise go ahead with overload resolution. */
9510 add_list_candidates (fns, first_mem_arg, user_args,
9511 basetype, explicit_targs, template_only,
9512 conversion_path, access_binfo, flags,
9513 &candidates, complain);
9515 else
9516 add_candidates (fns, first_mem_arg, user_args, optype,
9517 explicit_targs, template_only, conversion_path,
9518 access_binfo, flags, &candidates, complain);
9520 any_viable_p = false;
9521 candidates = splice_viable (candidates, false, &any_viable_p);
9523 if (!any_viable_p)
9525 if (complain & tf_error)
9526 complain_about_no_candidates_for_method_call (instance, candidates,
9527 explicit_targs, basetype,
9528 optype, name,
9529 skip_first_for_error,
9530 user_args);
9531 call = error_mark_node;
9533 else
9535 cand = tourney (candidates, complain);
9536 if (cand == 0)
9538 char *pretty_name;
9539 bool free_p;
9540 tree arglist;
9542 if (complain & tf_error)
9544 pretty_name = name_as_c_string (name, basetype, &free_p);
9545 arglist = build_tree_list_vec (user_args);
9546 if (skip_first_for_error)
9547 arglist = TREE_CHAIN (arglist);
9548 auto_diagnostic_group d;
9549 if (!any_strictly_viable (candidates))
9550 error ("no matching function for call to %<%s(%A)%>",
9551 pretty_name, arglist);
9552 else
9553 error ("call of overloaded %<%s(%A)%> is ambiguous",
9554 pretty_name, arglist);
9555 print_z_candidates (location_of (name), candidates);
9556 if (free_p)
9557 free (pretty_name);
9559 call = error_mark_node;
9561 else
9563 fn = cand->fn;
9564 call = NULL_TREE;
9566 if (!(flags & LOOKUP_NONVIRTUAL)
9567 && DECL_PURE_VIRTUAL_P (fn)
9568 && instance == current_class_ref
9569 && (complain & tf_warning))
9571 /* This is not an error, it is runtime undefined
9572 behavior. */
9573 if (!current_function_decl)
9574 warning (0, "pure virtual %q#D called from "
9575 "non-static data member initializer", fn);
9576 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9577 || DECL_DESTRUCTOR_P (current_function_decl))
9578 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9579 ? G_("pure virtual %q#D called from constructor")
9580 : G_("pure virtual %q#D called from destructor")),
9581 fn);
9584 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9585 && !DECL_CONSTRUCTOR_P (fn)
9586 && is_dummy_object (instance))
9588 instance = maybe_resolve_dummy (instance, true);
9589 if (instance == error_mark_node)
9590 call = error_mark_node;
9591 else if (!is_dummy_object (instance))
9593 /* We captured 'this' in the current lambda now that
9594 we know we really need it. */
9595 cand->first_arg = instance;
9597 else if (any_dependent_bases_p ())
9598 /* We can't tell until instantiation time whether we can use
9599 *this as the implicit object argument. */;
9600 else
9602 if (complain & tf_error)
9603 error ("cannot call member function %qD without object",
9604 fn);
9605 call = error_mark_node;
9609 if (call != error_mark_node)
9611 /* Optimize away vtable lookup if we know that this
9612 function can't be overridden. We need to check if
9613 the context and the type where we found fn are the same,
9614 actually FN might be defined in a different class
9615 type because of a using-declaration. In this case, we
9616 do not want to perform a non-virtual call. */
9617 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9618 && same_type_ignoring_top_level_qualifiers_p
9619 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9620 && resolves_to_fixed_type_p (instance, 0))
9621 flags |= LOOKUP_NONVIRTUAL;
9622 if (explicit_targs)
9623 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9624 /* Now we know what function is being called. */
9625 if (fn_p)
9626 *fn_p = fn;
9627 /* Build the actual CALL_EXPR. */
9628 call = build_over_call (cand, flags, complain);
9629 /* In an expression of the form `a->f()' where `f' turns
9630 out to be a static member function, `a' is
9631 none-the-less evaluated. */
9632 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9633 && !is_dummy_object (instance)
9634 && TREE_SIDE_EFFECTS (instance))
9636 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9637 is volatile. */
9638 tree a = instance;
9639 if (TREE_THIS_VOLATILE (a))
9640 a = build_this (a);
9641 call = build2 (COMPOUND_EXPR, TREE_TYPE (call), a, call);
9643 else if (call != error_mark_node
9644 && DECL_DESTRUCTOR_P (cand->fn)
9645 && !VOID_TYPE_P (TREE_TYPE (call)))
9646 /* An explicit call of the form "x->~X()" has type
9647 "void". However, on platforms where destructors
9648 return "this" (i.e., those where
9649 targetm.cxx.cdtor_returns_this is true), such calls
9650 will appear to have a return value of pointer type
9651 to the low-level call machinery. We do not want to
9652 change the low-level machinery, since we want to be
9653 able to optimize "delete f()" on such platforms as
9654 "operator delete(~X(f()))" (rather than generating
9655 "t = f(), ~X(t), operator delete (t)"). */
9656 call = build_nop (void_type_node, call);
9661 if (processing_template_decl && call != error_mark_node)
9663 bool cast_to_void = false;
9665 if (TREE_CODE (call) == COMPOUND_EXPR)
9666 call = TREE_OPERAND (call, 1);
9667 else if (TREE_CODE (call) == NOP_EXPR)
9669 cast_to_void = true;
9670 call = TREE_OPERAND (call, 0);
9672 if (INDIRECT_REF_P (call))
9673 call = TREE_OPERAND (call, 0);
9674 call = (build_min_non_dep_call_vec
9675 (call,
9676 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9677 orig_instance, orig_fns, NULL_TREE),
9678 orig_args));
9679 SET_EXPR_LOCATION (call, input_location);
9680 call = convert_from_reference (call);
9681 if (cast_to_void)
9682 call = build_nop (void_type_node, call);
9685 /* Free all the conversions we allocated. */
9686 obstack_free (&conversion_obstack, p);
9688 if (orig_args != NULL)
9689 release_tree_vector (orig_args);
9691 return call;
9694 /* Wrapper for above. */
9696 tree
9697 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9698 tree conversion_path, int flags,
9699 tree *fn_p, tsubst_flags_t complain)
9701 tree ret;
9702 bool subtime = timevar_cond_start (TV_OVERLOAD);
9703 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9704 fn_p, complain);
9705 timevar_cond_stop (TV_OVERLOAD, subtime);
9706 return ret;
9709 /* Returns true iff standard conversion sequence ICS1 is a proper
9710 subsequence of ICS2. */
9712 static bool
9713 is_subseq (conversion *ics1, conversion *ics2)
9715 /* We can assume that a conversion of the same code
9716 between the same types indicates a subsequence since we only get
9717 here if the types we are converting from are the same. */
9719 while (ics1->kind == ck_rvalue
9720 || ics1->kind == ck_lvalue)
9721 ics1 = next_conversion (ics1);
9723 while (1)
9725 while (ics2->kind == ck_rvalue
9726 || ics2->kind == ck_lvalue)
9727 ics2 = next_conversion (ics2);
9729 if (ics2->kind == ck_user
9730 || ics2->kind == ck_ambig
9731 || ics2->kind == ck_aggr
9732 || ics2->kind == ck_list
9733 || ics2->kind == ck_identity)
9734 /* At this point, ICS1 cannot be a proper subsequence of
9735 ICS2. We can get a USER_CONV when we are comparing the
9736 second standard conversion sequence of two user conversion
9737 sequences. */
9738 return false;
9740 ics2 = next_conversion (ics2);
9742 while (ics2->kind == ck_rvalue
9743 || ics2->kind == ck_lvalue)
9744 ics2 = next_conversion (ics2);
9746 if (ics2->kind == ics1->kind
9747 && same_type_p (ics2->type, ics1->type)
9748 && (ics1->kind == ck_identity
9749 || same_type_p (next_conversion (ics2)->type,
9750 next_conversion (ics1)->type)))
9751 return true;
9755 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9756 be any _TYPE nodes. */
9758 bool
9759 is_properly_derived_from (tree derived, tree base)
9761 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9762 return false;
9764 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9765 considers every class derived from itself. */
9766 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9767 && DERIVED_FROM_P (base, derived));
9770 /* We build the ICS for an implicit object parameter as a pointer
9771 conversion sequence. However, such a sequence should be compared
9772 as if it were a reference conversion sequence. If ICS is the
9773 implicit conversion sequence for an implicit object parameter,
9774 modify it accordingly. */
9776 static void
9777 maybe_handle_implicit_object (conversion **ics)
9779 if ((*ics)->this_p)
9781 /* [over.match.funcs]
9783 For non-static member functions, the type of the
9784 implicit object parameter is "reference to cv X"
9785 where X is the class of which the function is a
9786 member and cv is the cv-qualification on the member
9787 function declaration. */
9788 conversion *t = *ics;
9789 tree reference_type;
9791 /* The `this' parameter is a pointer to a class type. Make the
9792 implicit conversion talk about a reference to that same class
9793 type. */
9794 reference_type = TREE_TYPE (t->type);
9795 reference_type = build_reference_type (reference_type);
9797 if (t->kind == ck_qual)
9798 t = next_conversion (t);
9799 if (t->kind == ck_ptr)
9800 t = next_conversion (t);
9801 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9802 t = direct_reference_binding (reference_type, t);
9803 t->this_p = 1;
9804 t->rvaluedness_matches_p = 0;
9805 *ics = t;
9809 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9810 and return the initial reference binding conversion. Otherwise,
9811 leave *ICS unchanged and return NULL. */
9813 static conversion *
9814 maybe_handle_ref_bind (conversion **ics)
9816 if ((*ics)->kind == ck_ref_bind)
9818 conversion *old_ics = *ics;
9819 *ics = next_conversion (old_ics);
9820 (*ics)->user_conv_p = old_ics->user_conv_p;
9821 return old_ics;
9824 return NULL;
9827 /* Compare two implicit conversion sequences according to the rules set out in
9828 [over.ics.rank]. Return values:
9830 1: ics1 is better than ics2
9831 -1: ics2 is better than ics1
9832 0: ics1 and ics2 are indistinguishable */
9834 static int
9835 compare_ics (conversion *ics1, conversion *ics2)
9837 tree from_type1;
9838 tree from_type2;
9839 tree to_type1;
9840 tree to_type2;
9841 tree deref_from_type1 = NULL_TREE;
9842 tree deref_from_type2 = NULL_TREE;
9843 tree deref_to_type1 = NULL_TREE;
9844 tree deref_to_type2 = NULL_TREE;
9845 conversion_rank rank1, rank2;
9847 /* REF_BINDING is nonzero if the result of the conversion sequence
9848 is a reference type. In that case REF_CONV is the reference
9849 binding conversion. */
9850 conversion *ref_conv1;
9851 conversion *ref_conv2;
9853 /* Compare badness before stripping the reference conversion. */
9854 if (ics1->bad_p > ics2->bad_p)
9855 return -1;
9856 else if (ics1->bad_p < ics2->bad_p)
9857 return 1;
9859 /* Handle implicit object parameters. */
9860 maybe_handle_implicit_object (&ics1);
9861 maybe_handle_implicit_object (&ics2);
9863 /* Handle reference parameters. */
9864 ref_conv1 = maybe_handle_ref_bind (&ics1);
9865 ref_conv2 = maybe_handle_ref_bind (&ics2);
9867 /* List-initialization sequence L1 is a better conversion sequence than
9868 list-initialization sequence L2 if L1 converts to
9869 std::initializer_list<X> for some X and L2 does not. */
9870 if (ics1->kind == ck_list && ics2->kind != ck_list)
9871 return 1;
9872 if (ics2->kind == ck_list && ics1->kind != ck_list)
9873 return -1;
9875 /* [over.ics.rank]
9877 When comparing the basic forms of implicit conversion sequences (as
9878 defined in _over.best.ics_)
9880 --a standard conversion sequence (_over.ics.scs_) is a better
9881 conversion sequence than a user-defined conversion sequence
9882 or an ellipsis conversion sequence, and
9884 --a user-defined conversion sequence (_over.ics.user_) is a
9885 better conversion sequence than an ellipsis conversion sequence
9886 (_over.ics.ellipsis_). */
9887 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9888 mismatch. If both ICS are bad, we try to make a decision based on
9889 what would have happened if they'd been good. This is not an
9890 extension, we'll still give an error when we build up the call; this
9891 just helps us give a more helpful error message. */
9892 rank1 = BAD_CONVERSION_RANK (ics1);
9893 rank2 = BAD_CONVERSION_RANK (ics2);
9895 if (rank1 > rank2)
9896 return -1;
9897 else if (rank1 < rank2)
9898 return 1;
9900 if (ics1->ellipsis_p)
9901 /* Both conversions are ellipsis conversions. */
9902 return 0;
9904 /* User-defined conversion sequence U1 is a better conversion sequence
9905 than another user-defined conversion sequence U2 if they contain the
9906 same user-defined conversion operator or constructor and if the sec-
9907 ond standard conversion sequence of U1 is better than the second
9908 standard conversion sequence of U2. */
9910 /* Handle list-conversion with the same code even though it isn't always
9911 ranked as a user-defined conversion and it doesn't have a second
9912 standard conversion sequence; it will still have the desired effect.
9913 Specifically, we need to do the reference binding comparison at the
9914 end of this function. */
9916 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9918 conversion *t1;
9919 conversion *t2;
9921 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9922 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9923 || t1->kind == ck_list)
9924 break;
9925 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9926 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9927 || t2->kind == ck_list)
9928 break;
9930 if (t1->kind != t2->kind)
9931 return 0;
9932 else if (t1->kind == ck_user)
9934 tree f1 = t1->cand ? t1->cand->fn : t1->type;
9935 tree f2 = t2->cand ? t2->cand->fn : t2->type;
9936 if (f1 != f2)
9937 return 0;
9939 else
9941 /* For ambiguous or aggregate conversions, use the target type as
9942 a proxy for the conversion function. */
9943 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9944 return 0;
9947 /* We can just fall through here, after setting up
9948 FROM_TYPE1 and FROM_TYPE2. */
9949 from_type1 = t1->type;
9950 from_type2 = t2->type;
9952 else
9954 conversion *t1;
9955 conversion *t2;
9957 /* We're dealing with two standard conversion sequences.
9959 [over.ics.rank]
9961 Standard conversion sequence S1 is a better conversion
9962 sequence than standard conversion sequence S2 if
9964 --S1 is a proper subsequence of S2 (comparing the conversion
9965 sequences in the canonical form defined by _over.ics.scs_,
9966 excluding any Lvalue Transformation; the identity
9967 conversion sequence is considered to be a subsequence of
9968 any non-identity conversion sequence */
9970 t1 = ics1;
9971 while (t1->kind != ck_identity)
9972 t1 = next_conversion (t1);
9973 from_type1 = t1->type;
9975 t2 = ics2;
9976 while (t2->kind != ck_identity)
9977 t2 = next_conversion (t2);
9978 from_type2 = t2->type;
9981 /* One sequence can only be a subsequence of the other if they start with
9982 the same type. They can start with different types when comparing the
9983 second standard conversion sequence in two user-defined conversion
9984 sequences. */
9985 if (same_type_p (from_type1, from_type2))
9987 if (is_subseq (ics1, ics2))
9988 return 1;
9989 if (is_subseq (ics2, ics1))
9990 return -1;
9993 /* [over.ics.rank]
9995 Or, if not that,
9997 --the rank of S1 is better than the rank of S2 (by the rules
9998 defined below):
10000 Standard conversion sequences are ordered by their ranks: an Exact
10001 Match is a better conversion than a Promotion, which is a better
10002 conversion than a Conversion.
10004 Two conversion sequences with the same rank are indistinguishable
10005 unless one of the following rules applies:
10007 --A conversion that does not a convert a pointer, pointer to member,
10008 or std::nullptr_t to bool is better than one that does.
10010 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10011 so that we do not have to check it explicitly. */
10012 if (ics1->rank < ics2->rank)
10013 return 1;
10014 else if (ics2->rank < ics1->rank)
10015 return -1;
10017 to_type1 = ics1->type;
10018 to_type2 = ics2->type;
10020 /* A conversion from scalar arithmetic type to complex is worse than a
10021 conversion between scalar arithmetic types. */
10022 if (same_type_p (from_type1, from_type2)
10023 && ARITHMETIC_TYPE_P (from_type1)
10024 && ARITHMETIC_TYPE_P (to_type1)
10025 && ARITHMETIC_TYPE_P (to_type2)
10026 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
10027 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
10029 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
10030 return -1;
10031 else
10032 return 1;
10035 if (TYPE_PTR_P (from_type1)
10036 && TYPE_PTR_P (from_type2)
10037 && TYPE_PTR_P (to_type1)
10038 && TYPE_PTR_P (to_type2))
10040 deref_from_type1 = TREE_TYPE (from_type1);
10041 deref_from_type2 = TREE_TYPE (from_type2);
10042 deref_to_type1 = TREE_TYPE (to_type1);
10043 deref_to_type2 = TREE_TYPE (to_type2);
10045 /* The rules for pointers to members A::* are just like the rules
10046 for pointers A*, except opposite: if B is derived from A then
10047 A::* converts to B::*, not vice versa. For that reason, we
10048 switch the from_ and to_ variables here. */
10049 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
10050 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
10051 || (TYPE_PTRMEMFUNC_P (from_type1)
10052 && TYPE_PTRMEMFUNC_P (from_type2)
10053 && TYPE_PTRMEMFUNC_P (to_type1)
10054 && TYPE_PTRMEMFUNC_P (to_type2)))
10056 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
10057 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
10058 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
10059 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
10062 if (deref_from_type1 != NULL_TREE
10063 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
10064 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
10066 /* This was one of the pointer or pointer-like conversions.
10068 [over.ics.rank]
10070 --If class B is derived directly or indirectly from class A,
10071 conversion of B* to A* is better than conversion of B* to
10072 void*, and conversion of A* to void* is better than
10073 conversion of B* to void*. */
10074 if (VOID_TYPE_P (deref_to_type1)
10075 && VOID_TYPE_P (deref_to_type2))
10077 if (is_properly_derived_from (deref_from_type1,
10078 deref_from_type2))
10079 return -1;
10080 else if (is_properly_derived_from (deref_from_type2,
10081 deref_from_type1))
10082 return 1;
10084 else if (VOID_TYPE_P (deref_to_type1)
10085 || VOID_TYPE_P (deref_to_type2))
10087 if (same_type_p (deref_from_type1, deref_from_type2))
10089 if (VOID_TYPE_P (deref_to_type2))
10091 if (is_properly_derived_from (deref_from_type1,
10092 deref_to_type1))
10093 return 1;
10095 /* We know that DEREF_TO_TYPE1 is `void' here. */
10096 else if (is_properly_derived_from (deref_from_type1,
10097 deref_to_type2))
10098 return -1;
10101 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
10102 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
10104 /* [over.ics.rank]
10106 --If class B is derived directly or indirectly from class A
10107 and class C is derived directly or indirectly from B,
10109 --conversion of C* to B* is better than conversion of C* to
10112 --conversion of B* to A* is better than conversion of C* to
10113 A* */
10114 if (same_type_p (deref_from_type1, deref_from_type2))
10116 if (is_properly_derived_from (deref_to_type1,
10117 deref_to_type2))
10118 return 1;
10119 else if (is_properly_derived_from (deref_to_type2,
10120 deref_to_type1))
10121 return -1;
10123 else if (same_type_p (deref_to_type1, deref_to_type2))
10125 if (is_properly_derived_from (deref_from_type2,
10126 deref_from_type1))
10127 return 1;
10128 else if (is_properly_derived_from (deref_from_type1,
10129 deref_from_type2))
10130 return -1;
10134 else if (CLASS_TYPE_P (non_reference (from_type1))
10135 && same_type_p (from_type1, from_type2))
10137 tree from = non_reference (from_type1);
10139 /* [over.ics.rank]
10141 --binding of an expression of type C to a reference of type
10142 B& is better than binding an expression of type C to a
10143 reference of type A&
10145 --conversion of C to B is better than conversion of C to A, */
10146 if (is_properly_derived_from (from, to_type1)
10147 && is_properly_derived_from (from, to_type2))
10149 if (is_properly_derived_from (to_type1, to_type2))
10150 return 1;
10151 else if (is_properly_derived_from (to_type2, to_type1))
10152 return -1;
10155 else if (CLASS_TYPE_P (non_reference (to_type1))
10156 && same_type_p (to_type1, to_type2))
10158 tree to = non_reference (to_type1);
10160 /* [over.ics.rank]
10162 --binding of an expression of type B to a reference of type
10163 A& is better than binding an expression of type C to a
10164 reference of type A&,
10166 --conversion of B to A is better than conversion of C to A */
10167 if (is_properly_derived_from (from_type1, to)
10168 && is_properly_derived_from (from_type2, to))
10170 if (is_properly_derived_from (from_type2, from_type1))
10171 return 1;
10172 else if (is_properly_derived_from (from_type1, from_type2))
10173 return -1;
10177 /* [over.ics.rank]
10179 --S1 and S2 differ only in their qualification conversion and yield
10180 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10181 qualification signature of type T1 is a proper subset of the cv-
10182 qualification signature of type T2 */
10183 if (ics1->kind == ck_qual
10184 && ics2->kind == ck_qual
10185 && same_type_p (from_type1, from_type2))
10187 int result = comp_cv_qual_signature (to_type1, to_type2);
10188 if (result != 0)
10189 return result;
10192 /* [over.ics.rank]
10194 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10195 to an implicit object parameter of a non-static member function
10196 declared without a ref-qualifier, and either S1 binds an lvalue
10197 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10198 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10199 draft standard, 13.3.3.2)
10201 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10202 types to which the references refer are the same type except for
10203 top-level cv-qualifiers, and the type to which the reference
10204 initialized by S2 refers is more cv-qualified than the type to
10205 which the reference initialized by S1 refers.
10207 DR 1328 [over.match.best]: the context is an initialization by
10208 conversion function for direct reference binding (13.3.1.6) of a
10209 reference to function type, the return type of F1 is the same kind of
10210 reference (i.e. lvalue or rvalue) as the reference being initialized,
10211 and the return type of F2 is not. */
10213 if (ref_conv1 && ref_conv2)
10215 if (!ref_conv1->this_p && !ref_conv2->this_p
10216 && (ref_conv1->rvaluedness_matches_p
10217 != ref_conv2->rvaluedness_matches_p)
10218 && (same_type_p (ref_conv1->type, ref_conv2->type)
10219 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
10220 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
10222 if (ref_conv1->bad_p
10223 && !same_type_p (TREE_TYPE (ref_conv1->type),
10224 TREE_TYPE (ref_conv2->type)))
10225 /* Don't prefer a bad conversion that drops cv-quals to a bad
10226 conversion with the wrong rvalueness. */
10227 return 0;
10228 return (ref_conv1->rvaluedness_matches_p
10229 - ref_conv2->rvaluedness_matches_p);
10232 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
10234 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
10235 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
10236 if (ref_conv1->bad_p)
10238 /* Prefer the one that drops fewer cv-quals. */
10239 tree ftype = next_conversion (ref_conv1)->type;
10240 int fquals = cp_type_quals (ftype);
10241 q1 ^= fquals;
10242 q2 ^= fquals;
10244 return comp_cv_qualification (q2, q1);
10248 /* Neither conversion sequence is better than the other. */
10249 return 0;
10252 /* The source type for this standard conversion sequence. */
10254 static tree
10255 source_type (conversion *t)
10257 for (;; t = next_conversion (t))
10259 if (t->kind == ck_user
10260 || t->kind == ck_ambig
10261 || t->kind == ck_identity)
10262 return t->type;
10264 gcc_unreachable ();
10267 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10268 a pointer to LOSER and re-running joust to produce the warning if WINNER
10269 is actually used. */
10271 static void
10272 add_warning (struct z_candidate *winner, struct z_candidate *loser)
10274 candidate_warning *cw = (candidate_warning *)
10275 conversion_obstack_alloc (sizeof (candidate_warning));
10276 cw->loser = loser;
10277 cw->next = winner->warnings;
10278 winner->warnings = cw;
10281 /* Compare two candidates for overloading as described in
10282 [over.match.best]. Return values:
10284 1: cand1 is better than cand2
10285 -1: cand2 is better than cand1
10286 0: cand1 and cand2 are indistinguishable */
10288 static int
10289 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
10290 tsubst_flags_t complain)
10292 int winner = 0;
10293 int off1 = 0, off2 = 0;
10294 size_t i;
10295 size_t len;
10297 /* Candidates that involve bad conversions are always worse than those
10298 that don't. */
10299 if (cand1->viable > cand2->viable)
10300 return 1;
10301 if (cand1->viable < cand2->viable)
10302 return -1;
10304 /* If we have two pseudo-candidates for conversions to the same type,
10305 or two candidates for the same function, arbitrarily pick one. */
10306 if (cand1->fn == cand2->fn
10307 && (IS_TYPE_OR_DECL_P (cand1->fn)))
10308 return 1;
10310 /* Prefer a non-deleted function over an implicitly deleted move
10311 constructor or assignment operator. This differs slightly from the
10312 wording for issue 1402 (which says the move op is ignored by overload
10313 resolution), but this way produces better error messages. */
10314 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10315 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10316 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
10318 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
10319 && move_fn_p (cand1->fn))
10320 return -1;
10321 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
10322 && move_fn_p (cand2->fn))
10323 return 1;
10326 /* a viable function F1
10327 is defined to be a better function than another viable function F2 if
10328 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10329 ICSi(F2), and then */
10331 /* for some argument j, ICSj(F1) is a better conversion sequence than
10332 ICSj(F2) */
10334 /* For comparing static and non-static member functions, we ignore
10335 the implicit object parameter of the non-static function. The
10336 standard says to pretend that the static function has an object
10337 parm, but that won't work with operator overloading. */
10338 len = cand1->num_convs;
10339 if (len != cand2->num_convs)
10341 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
10342 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
10344 if (DECL_CONSTRUCTOR_P (cand1->fn)
10345 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
10346 /* We're comparing a near-match list constructor and a near-match
10347 non-list constructor. Just treat them as unordered. */
10348 return 0;
10350 gcc_assert (static_1 != static_2);
10352 if (static_1)
10353 off2 = 1;
10354 else
10356 off1 = 1;
10357 --len;
10361 for (i = 0; i < len; ++i)
10363 conversion *t1 = cand1->convs[i + off1];
10364 conversion *t2 = cand2->convs[i + off2];
10365 int comp = compare_ics (t1, t2);
10367 if (comp != 0)
10369 if ((complain & tf_warning)
10370 && warn_sign_promo
10371 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
10372 == cr_std + cr_promotion)
10373 && t1->kind == ck_std
10374 && t2->kind == ck_std
10375 && TREE_CODE (t1->type) == INTEGER_TYPE
10376 && TREE_CODE (t2->type) == INTEGER_TYPE
10377 && (TYPE_PRECISION (t1->type)
10378 == TYPE_PRECISION (t2->type))
10379 && (TYPE_UNSIGNED (next_conversion (t1)->type)
10380 || (TREE_CODE (next_conversion (t1)->type)
10381 == ENUMERAL_TYPE)))
10383 tree type = next_conversion (t1)->type;
10384 tree type1, type2;
10385 struct z_candidate *w, *l;
10386 if (comp > 0)
10387 type1 = t1->type, type2 = t2->type,
10388 w = cand1, l = cand2;
10389 else
10390 type1 = t2->type, type2 = t1->type,
10391 w = cand2, l = cand1;
10393 if (warn)
10395 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10396 type, type1, type2);
10397 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10399 else
10400 add_warning (w, l);
10403 if (winner && comp != winner)
10405 winner = 0;
10406 goto tweak;
10408 winner = comp;
10412 /* warn about confusing overload resolution for user-defined conversions,
10413 either between a constructor and a conversion op, or between two
10414 conversion ops. */
10415 if ((complain & tf_warning)
10416 && winner && warn_conversion && cand1->second_conv
10417 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10418 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10420 struct z_candidate *w, *l;
10421 bool give_warning = false;
10423 if (winner == 1)
10424 w = cand1, l = cand2;
10425 else
10426 w = cand2, l = cand1;
10428 /* We don't want to complain about `X::operator T1 ()'
10429 beating `X::operator T2 () const', when T2 is a no less
10430 cv-qualified version of T1. */
10431 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10432 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10434 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10435 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10437 if (TREE_CODE (t) == TREE_CODE (f) && INDIRECT_TYPE_P (t))
10439 t = TREE_TYPE (t);
10440 f = TREE_TYPE (f);
10442 if (!comp_ptr_ttypes (t, f))
10443 give_warning = true;
10445 else
10446 give_warning = true;
10448 if (!give_warning)
10449 /*NOP*/;
10450 else if (warn)
10452 tree source = source_type (w->convs[0]);
10453 if (INDIRECT_TYPE_P (source))
10454 source = TREE_TYPE (source);
10455 auto_diagnostic_group d;
10456 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10457 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10458 source, w->second_conv->type))
10460 inform (input_location, " because conversion sequence for the argument is better");
10463 else
10464 add_warning (w, l);
10467 if (winner)
10468 return winner;
10470 /* DR 495 moved this tiebreaker above the template ones. */
10471 /* or, if not that,
10472 the context is an initialization by user-defined conversion (see
10473 _dcl.init_ and _over.match.user_) and the standard conversion
10474 sequence from the return type of F1 to the destination type (i.e.,
10475 the type of the entity being initialized) is a better conversion
10476 sequence than the standard conversion sequence from the return type
10477 of F2 to the destination type. */
10479 if (cand1->second_conv)
10481 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10482 if (winner)
10483 return winner;
10486 /* or, if not that,
10487 F1 is a non-template function and F2 is a template function
10488 specialization. */
10490 if (!cand1->template_decl && cand2->template_decl)
10491 return 1;
10492 else if (cand1->template_decl && !cand2->template_decl)
10493 return -1;
10495 /* or, if not that,
10496 F1 and F2 are template functions and the function template for F1 is
10497 more specialized than the template for F2 according to the partial
10498 ordering rules. */
10500 if (cand1->template_decl && cand2->template_decl)
10502 winner = more_specialized_fn
10503 (TI_TEMPLATE (cand1->template_decl),
10504 TI_TEMPLATE (cand2->template_decl),
10505 /* [temp.func.order]: The presence of unused ellipsis and default
10506 arguments has no effect on the partial ordering of function
10507 templates. add_function_candidate() will not have
10508 counted the "this" argument for constructors. */
10509 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10510 if (winner)
10511 return winner;
10514 // C++ Concepts
10515 // or, if not that, F1 is more constrained than F2.
10516 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10518 winner = more_constrained (cand1->fn, cand2->fn);
10519 if (winner)
10520 return winner;
10523 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10524 if (deduction_guide_p (cand1->fn))
10526 gcc_assert (deduction_guide_p (cand2->fn));
10527 /* We distinguish between candidates from an explicit deduction guide and
10528 candidates built from a constructor based on DECL_ARTIFICIAL. */
10529 int art1 = DECL_ARTIFICIAL (cand1->fn);
10530 int art2 = DECL_ARTIFICIAL (cand2->fn);
10531 if (art1 != art2)
10532 return art2 - art1;
10534 if (art1)
10536 /* Prefer the special copy guide over a declared copy/move
10537 constructor. */
10538 if (copy_guide_p (cand1->fn))
10539 return 1;
10540 if (copy_guide_p (cand2->fn))
10541 return -1;
10543 /* Prefer a candidate generated from a non-template constructor. */
10544 int tg1 = template_guide_p (cand1->fn);
10545 int tg2 = template_guide_p (cand2->fn);
10546 if (tg1 != tg2)
10547 return tg2 - tg1;
10551 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10552 for all arguments the corresponding parameters of F1 and F2 have the same
10553 type (CWG 2273/2277). */
10554 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10555 && !DECL_CONV_FN_P (cand1->fn)
10556 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10557 && !DECL_CONV_FN_P (cand2->fn))
10559 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10560 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10562 bool used1 = false;
10563 bool used2 = false;
10564 if (base1 == base2)
10565 /* No difference. */;
10566 else if (DERIVED_FROM_P (base1, base2))
10567 used1 = true;
10568 else if (DERIVED_FROM_P (base2, base1))
10569 used2 = true;
10571 if (int diff = used2 - used1)
10573 for (i = 0; i < len; ++i)
10575 conversion *t1 = cand1->convs[i + off1];
10576 conversion *t2 = cand2->convs[i + off2];
10577 if (!same_type_p (t1->type, t2->type))
10578 break;
10580 if (i == len)
10581 return diff;
10585 /* Check whether we can discard a builtin candidate, either because we
10586 have two identical ones or matching builtin and non-builtin candidates.
10588 (Pedantically in the latter case the builtin which matched the user
10589 function should not be added to the overload set, but we spot it here.
10591 [over.match.oper]
10592 ... the builtin candidates include ...
10593 - do not have the same parameter type list as any non-template
10594 non-member candidate. */
10596 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10598 for (i = 0; i < len; ++i)
10599 if (!same_type_p (cand1->convs[i]->type,
10600 cand2->convs[i]->type))
10601 break;
10602 if (i == cand1->num_convs)
10604 if (cand1->fn == cand2->fn)
10605 /* Two built-in candidates; arbitrarily pick one. */
10606 return 1;
10607 else if (identifier_p (cand1->fn))
10608 /* cand1 is built-in; prefer cand2. */
10609 return -1;
10610 else
10611 /* cand2 is built-in; prefer cand1. */
10612 return 1;
10616 /* For candidates of a multi-versioned function, make the version with
10617 the highest priority win. This version will be checked for dispatching
10618 first. If this version can be inlined into the caller, the front-end
10619 will simply make a direct call to this function. */
10621 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10622 && DECL_FUNCTION_VERSIONED (cand1->fn)
10623 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10624 && DECL_FUNCTION_VERSIONED (cand2->fn))
10626 tree f1 = TREE_TYPE (cand1->fn);
10627 tree f2 = TREE_TYPE (cand2->fn);
10628 tree p1 = TYPE_ARG_TYPES (f1);
10629 tree p2 = TYPE_ARG_TYPES (f2);
10631 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10632 is possible that cand1->fn and cand2->fn are function versions but of
10633 different functions. Check types to see if they are versions of the same
10634 function. */
10635 if (compparms (p1, p2)
10636 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10638 /* Always make the version with the higher priority, more
10639 specialized, win. */
10640 gcc_assert (targetm.compare_version_priority);
10641 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10642 return 1;
10643 else
10644 return -1;
10648 /* If the two function declarations represent the same function (this can
10649 happen with declarations in multiple scopes and arg-dependent lookup),
10650 arbitrarily choose one. But first make sure the default args we're
10651 using match. */
10652 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10653 && equal_functions (cand1->fn, cand2->fn))
10655 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10656 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10658 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10660 for (i = 0; i < len; ++i)
10662 /* Don't crash if the fn is variadic. */
10663 if (!parms1)
10664 break;
10665 parms1 = TREE_CHAIN (parms1);
10666 parms2 = TREE_CHAIN (parms2);
10669 if (off1)
10670 parms1 = TREE_CHAIN (parms1);
10671 else if (off2)
10672 parms2 = TREE_CHAIN (parms2);
10674 for (; parms1; ++i)
10676 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10677 TREE_PURPOSE (parms2)))
10679 if (warn)
10681 if (complain & tf_error)
10683 auto_diagnostic_group d;
10684 if (permerror (input_location,
10685 "default argument mismatch in "
10686 "overload resolution"))
10688 inform (DECL_SOURCE_LOCATION (cand1->fn),
10689 " candidate 1: %q#F", cand1->fn);
10690 inform (DECL_SOURCE_LOCATION (cand2->fn),
10691 " candidate 2: %q#F", cand2->fn);
10694 else
10695 return 0;
10697 else
10698 add_warning (cand1, cand2);
10699 break;
10701 parms1 = TREE_CHAIN (parms1);
10702 parms2 = TREE_CHAIN (parms2);
10705 return 1;
10708 tweak:
10710 /* Extension: If the worst conversion for one candidate is worse than the
10711 worst conversion for the other, take the first. */
10712 if (!pedantic && (complain & tf_warning_or_error))
10714 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10715 struct z_candidate *w = 0, *l = 0;
10717 for (i = 0; i < len; ++i)
10719 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10720 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10721 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10722 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10724 if (rank1 < rank2)
10725 winner = 1, w = cand1, l = cand2;
10726 if (rank1 > rank2)
10727 winner = -1, w = cand2, l = cand1;
10728 if (winner)
10730 /* Don't choose a deleted function over ambiguity. */
10731 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10732 return 0;
10733 if (warn)
10735 auto_diagnostic_group d;
10736 pedwarn (input_location, 0,
10737 "ISO C++ says that these are ambiguous, even "
10738 "though the worst conversion for the first is better than "
10739 "the worst conversion for the second:");
10740 print_z_candidate (input_location, _("candidate 1:"), w);
10741 print_z_candidate (input_location, _("candidate 2:"), l);
10743 else
10744 add_warning (w, l);
10745 return winner;
10749 gcc_assert (!winner);
10750 return 0;
10753 /* Given a list of candidates for overloading, find the best one, if any.
10754 This algorithm has a worst case of O(2n) (winner is last), and a best
10755 case of O(n/2) (totally ambiguous); much better than a sorting
10756 algorithm. */
10758 static struct z_candidate *
10759 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10761 struct z_candidate *champ = candidates, *challenger;
10762 int fate;
10763 int champ_compared_to_predecessor = 0;
10765 /* Walk through the list once, comparing each current champ to the next
10766 candidate, knocking out a candidate or two with each comparison. */
10768 for (challenger = champ->next; challenger; )
10770 fate = joust (champ, challenger, 0, complain);
10771 if (fate == 1)
10772 challenger = challenger->next;
10773 else
10775 if (fate == 0)
10777 champ = challenger->next;
10778 if (champ == 0)
10779 return NULL;
10780 champ_compared_to_predecessor = 0;
10782 else
10784 champ = challenger;
10785 champ_compared_to_predecessor = 1;
10788 challenger = champ->next;
10792 /* Make sure the champ is better than all the candidates it hasn't yet
10793 been compared to. */
10795 for (challenger = candidates;
10796 challenger != champ
10797 && !(champ_compared_to_predecessor && challenger->next == champ);
10798 challenger = challenger->next)
10800 fate = joust (champ, challenger, 0, complain);
10801 if (fate != 1)
10802 return NULL;
10805 return champ;
10808 /* Returns nonzero if things of type FROM can be converted to TO. */
10810 bool
10811 can_convert (tree to, tree from, tsubst_flags_t complain)
10813 tree arg = NULL_TREE;
10814 /* implicit_conversion only considers user-defined conversions
10815 if it has an expression for the call argument list. */
10816 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10817 arg = build1 (CAST_EXPR, from, NULL_TREE);
10818 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10821 /* Returns nonzero if things of type FROM can be converted to TO with a
10822 standard conversion. */
10824 bool
10825 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10827 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10830 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10832 bool
10833 can_convert_arg (tree to, tree from, tree arg, int flags,
10834 tsubst_flags_t complain)
10836 conversion *t;
10837 void *p;
10838 bool ok_p;
10840 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10841 p = conversion_obstack_alloc (0);
10842 /* We want to discard any access checks done for this test,
10843 as we might not be in the appropriate access context and
10844 we'll do the check again when we actually perform the
10845 conversion. */
10846 push_deferring_access_checks (dk_deferred);
10848 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10849 flags, complain);
10850 ok_p = (t && !t->bad_p);
10852 /* Discard the access checks now. */
10853 pop_deferring_access_checks ();
10854 /* Free all the conversions we allocated. */
10855 obstack_free (&conversion_obstack, p);
10857 return ok_p;
10860 /* Like can_convert_arg, but allows dubious conversions as well. */
10862 bool
10863 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10864 tsubst_flags_t complain)
10866 conversion *t;
10867 void *p;
10869 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10870 p = conversion_obstack_alloc (0);
10871 /* Try to perform the conversion. */
10872 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10873 flags, complain);
10874 /* Free all the conversions we allocated. */
10875 obstack_free (&conversion_obstack, p);
10877 return t != NULL;
10880 /* Convert EXPR to TYPE. Return the converted expression.
10882 Note that we allow bad conversions here because by the time we get to
10883 this point we are committed to doing the conversion. If we end up
10884 doing a bad conversion, convert_like will complain. */
10886 tree
10887 perform_implicit_conversion_flags (tree type, tree expr,
10888 tsubst_flags_t complain, int flags)
10890 conversion *conv;
10891 void *p;
10892 location_t loc = cp_expr_loc_or_loc (expr, input_location);
10894 if (TYPE_REF_P (type))
10895 expr = mark_lvalue_use (expr);
10896 else
10897 expr = mark_rvalue_use (expr);
10899 if (error_operand_p (expr))
10900 return error_mark_node;
10902 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10903 p = conversion_obstack_alloc (0);
10905 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10906 /*c_cast_p=*/false,
10907 flags, complain);
10909 if (!conv)
10911 if (complain & tf_error)
10913 /* If expr has unknown type, then it is an overloaded function.
10914 Call instantiate_type to get good error messages. */
10915 if (TREE_TYPE (expr) == unknown_type_node)
10916 instantiate_type (type, expr, complain);
10917 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10918 /* We gave an error. */;
10919 else
10921 range_label_for_type_mismatch label (TREE_TYPE (expr), type);
10922 gcc_rich_location rich_loc (loc, &label);
10923 error_at (&rich_loc, "could not convert %qE from %qH to %qI",
10924 expr, TREE_TYPE (expr), type);
10927 expr = error_mark_node;
10929 else if (processing_template_decl && conv->kind != ck_identity)
10931 /* In a template, we are only concerned about determining the
10932 type of non-dependent expressions, so we do not have to
10933 perform the actual conversion. But for initializers, we
10934 need to be able to perform it at instantiation
10935 (or instantiate_non_dependent_expr) time. */
10936 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10937 if (!(flags & LOOKUP_ONLYCONVERTING))
10938 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10940 else
10941 expr = convert_like (conv, expr, complain);
10943 /* Free all the conversions we allocated. */
10944 obstack_free (&conversion_obstack, p);
10946 return expr;
10949 tree
10950 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10952 return perform_implicit_conversion_flags (type, expr, complain,
10953 LOOKUP_IMPLICIT);
10956 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10957 permitted. If the conversion is valid, the converted expression is
10958 returned. Otherwise, NULL_TREE is returned, except in the case
10959 that TYPE is a class type; in that case, an error is issued. If
10960 C_CAST_P is true, then this direct-initialization is taking
10961 place as part of a static_cast being attempted as part of a C-style
10962 cast. */
10964 tree
10965 perform_direct_initialization_if_possible (tree type,
10966 tree expr,
10967 bool c_cast_p,
10968 tsubst_flags_t complain)
10970 conversion *conv;
10971 void *p;
10973 if (type == error_mark_node || error_operand_p (expr))
10974 return error_mark_node;
10975 /* [dcl.init]
10977 If the destination type is a (possibly cv-qualified) class type:
10979 -- If the initialization is direct-initialization ...,
10980 constructors are considered. ... If no constructor applies, or
10981 the overload resolution is ambiguous, the initialization is
10982 ill-formed. */
10983 if (CLASS_TYPE_P (type))
10985 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10986 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10987 &args, type, LOOKUP_NORMAL, complain);
10988 release_tree_vector (args);
10989 return build_cplus_new (type, expr, complain);
10992 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10993 p = conversion_obstack_alloc (0);
10995 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10996 c_cast_p,
10997 LOOKUP_NORMAL, complain);
10998 if (!conv || conv->bad_p)
10999 expr = NULL_TREE;
11000 else if (processing_template_decl && conv->kind != ck_identity)
11002 /* In a template, we are only concerned about determining the
11003 type of non-dependent expressions, so we do not have to
11004 perform the actual conversion. But for initializers, we
11005 need to be able to perform it at instantiation
11006 (or instantiate_non_dependent_expr) time. */
11007 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
11008 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
11010 else
11011 expr = convert_like_real (conv, expr, NULL_TREE, 0,
11012 /*issue_conversion_warnings=*/false,
11013 c_cast_p,
11014 complain);
11016 /* Free all the conversions we allocated. */
11017 obstack_free (&conversion_obstack, p);
11019 return expr;
11022 /* When initializing a reference that lasts longer than a full-expression,
11023 this special rule applies:
11025 [class.temporary]
11027 The temporary to which the reference is bound or the temporary
11028 that is the complete object to which the reference is bound
11029 persists for the lifetime of the reference.
11031 The temporaries created during the evaluation of the expression
11032 initializing the reference, except the temporary to which the
11033 reference is bound, are destroyed at the end of the
11034 full-expression in which they are created.
11036 In that case, we store the converted expression into a new
11037 VAR_DECL in a new scope.
11039 However, we want to be careful not to create temporaries when
11040 they are not required. For example, given:
11042 struct B {};
11043 struct D : public B {};
11044 D f();
11045 const B& b = f();
11047 there is no need to copy the return value from "f"; we can just
11048 extend its lifetime. Similarly, given:
11050 struct S {};
11051 struct T { operator S(); };
11052 T t;
11053 const S& s = t;
11055 we can extend the lifetime of the return value of the conversion
11056 operator.
11058 The next several functions are involved in this lifetime extension. */
11060 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11061 reference is being bound to a temporary. Create and return a new
11062 VAR_DECL with the indicated TYPE; this variable will store the value to
11063 which the reference is bound. */
11065 tree
11066 make_temporary_var_for_ref_to_temp (tree decl, tree type)
11068 tree var = create_temporary_var (type);
11070 /* Register the variable. */
11071 if (VAR_P (decl)
11072 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
11074 /* Namespace-scope or local static; give it a mangled name. */
11075 /* FIXME share comdat with decl? */
11077 TREE_STATIC (var) = TREE_STATIC (decl);
11078 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
11079 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
11081 tree name = mangle_ref_init_variable (decl);
11082 DECL_NAME (var) = name;
11083 SET_DECL_ASSEMBLER_NAME (var, name);
11085 var = pushdecl (var);
11087 else
11088 /* Create a new cleanup level if necessary. */
11089 maybe_push_cleanup_level (type);
11091 return var;
11094 /* EXPR is the initializer for a variable DECL of reference or
11095 std::initializer_list type. Create, push and return a new VAR_DECL
11096 for the initializer so that it will live as long as DECL. Any
11097 cleanup for the new variable is returned through CLEANUP, and the
11098 code to initialize the new variable is returned through INITP. */
11100 static tree
11101 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
11102 tree *initp)
11104 tree init;
11105 tree type;
11106 tree var;
11108 /* Create the temporary variable. */
11109 type = TREE_TYPE (expr);
11110 var = make_temporary_var_for_ref_to_temp (decl, type);
11111 layout_decl (var, 0);
11112 /* If the rvalue is the result of a function call it will be
11113 a TARGET_EXPR. If it is some other construct (such as a
11114 member access expression where the underlying object is
11115 itself the result of a function call), turn it into a
11116 TARGET_EXPR here. It is important that EXPR be a
11117 TARGET_EXPR below since otherwise the INIT_EXPR will
11118 attempt to make a bitwise copy of EXPR to initialize
11119 VAR. */
11120 if (TREE_CODE (expr) != TARGET_EXPR)
11121 expr = get_target_expr (expr);
11123 if (TREE_CODE (decl) == FIELD_DECL
11124 && extra_warnings && !TREE_NO_WARNING (decl))
11126 warning (OPT_Wextra, "a temporary bound to %qD only persists "
11127 "until the constructor exits", decl);
11128 TREE_NO_WARNING (decl) = true;
11131 /* Recursively extend temps in this initializer. */
11132 TARGET_EXPR_INITIAL (expr)
11133 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
11135 /* Any reference temp has a non-trivial initializer. */
11136 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
11138 /* If the initializer is constant, put it in DECL_INITIAL so we get
11139 static initialization and use in constant expressions. */
11140 init = maybe_constant_init (expr);
11141 /* As in store_init_value. */
11142 init = cp_fully_fold (init);
11143 if (TREE_CONSTANT (init))
11145 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
11147 /* 5.19 says that a constant expression can include an
11148 lvalue-rvalue conversion applied to "a glvalue of literal type
11149 that refers to a non-volatile temporary object initialized
11150 with a constant expression". Rather than try to communicate
11151 that this VAR_DECL is a temporary, just mark it constexpr. */
11152 DECL_DECLARED_CONSTEXPR_P (var) = true;
11153 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
11154 TREE_CONSTANT (var) = true;
11155 TREE_READONLY (var) = true;
11157 DECL_INITIAL (var) = init;
11158 init = NULL_TREE;
11160 else
11161 /* Create the INIT_EXPR that will initialize the temporary
11162 variable. */
11163 init = split_nonconstant_init (var, expr);
11164 if (at_function_scope_p ())
11166 add_decl_expr (var);
11168 if (TREE_STATIC (var))
11169 init = add_stmt_to_compound (init, register_dtor_fn (var));
11170 else
11172 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
11173 if (cleanup)
11174 vec_safe_push (*cleanups, cleanup);
11177 /* We must be careful to destroy the temporary only
11178 after its initialization has taken place. If the
11179 initialization throws an exception, then the
11180 destructor should not be run. We cannot simply
11181 transform INIT into something like:
11183 (INIT, ({ CLEANUP_STMT; }))
11185 because emit_local_var always treats the
11186 initializer as a full-expression. Thus, the
11187 destructor would run too early; it would run at the
11188 end of initializing the reference variable, rather
11189 than at the end of the block enclosing the
11190 reference variable.
11192 The solution is to pass back a cleanup expression
11193 which the caller is responsible for attaching to
11194 the statement tree. */
11196 else
11198 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
11199 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
11201 if (CP_DECL_THREAD_LOCAL_P (var))
11202 tls_aggregates = tree_cons (NULL_TREE, var,
11203 tls_aggregates);
11204 else
11205 static_aggregates = tree_cons (NULL_TREE, var,
11206 static_aggregates);
11208 else
11209 /* Check whether the dtor is callable. */
11210 cxx_maybe_build_cleanup (var, tf_warning_or_error);
11212 /* Avoid -Wunused-variable warning (c++/38958). */
11213 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
11214 && VAR_P (decl))
11215 TREE_USED (decl) = DECL_READ_P (decl) = true;
11217 *initp = init;
11218 return var;
11221 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11222 initializing a variable of that TYPE. */
11224 tree
11225 initialize_reference (tree type, tree expr,
11226 int flags, tsubst_flags_t complain)
11228 conversion *conv;
11229 void *p;
11230 location_t loc = cp_expr_loc_or_loc (expr, input_location);
11232 if (type == error_mark_node || error_operand_p (expr))
11233 return error_mark_node;
11235 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11236 p = conversion_obstack_alloc (0);
11238 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
11239 flags, complain);
11240 if (!conv || conv->bad_p)
11242 if (complain & tf_error)
11244 if (conv)
11245 convert_like (conv, expr, complain);
11246 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
11247 && !TYPE_REF_IS_RVALUE (type)
11248 && !lvalue_p (expr))
11249 error_at (loc, "invalid initialization of non-const reference of "
11250 "type %qH from an rvalue of type %qI",
11251 type, TREE_TYPE (expr));
11252 else
11253 error_at (loc, "invalid initialization of reference of type "
11254 "%qH from expression of type %qI", type,
11255 TREE_TYPE (expr));
11257 return error_mark_node;
11260 if (conv->kind == ck_ref_bind)
11261 /* Perform the conversion. */
11262 expr = convert_like (conv, expr, complain);
11263 else if (conv->kind == ck_ambig)
11264 /* We gave an error in build_user_type_conversion_1. */
11265 expr = error_mark_node;
11266 else
11267 gcc_unreachable ();
11269 /* Free all the conversions we allocated. */
11270 obstack_free (&conversion_obstack, p);
11272 return expr;
11275 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11276 which is bound either to a reference or a std::initializer_list. */
11278 static tree
11279 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
11281 tree sub = init;
11282 tree *p;
11283 STRIP_NOPS (sub);
11284 if (TREE_CODE (sub) == COMPOUND_EXPR)
11286 TREE_OPERAND (sub, 1)
11287 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
11288 return init;
11290 if (TREE_CODE (sub) != ADDR_EXPR)
11291 return init;
11292 /* Deal with binding to a subobject. */
11293 for (p = &TREE_OPERAND (sub, 0);
11294 (TREE_CODE (*p) == COMPONENT_REF
11295 || TREE_CODE (*p) == ARRAY_REF); )
11296 p = &TREE_OPERAND (*p, 0);
11297 if (TREE_CODE (*p) == TARGET_EXPR)
11299 tree subinit = NULL_TREE;
11300 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
11301 recompute_tree_invariant_for_addr_expr (sub);
11302 if (init != sub)
11303 init = fold_convert (TREE_TYPE (init), sub);
11304 if (subinit)
11305 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
11307 return init;
11310 /* INIT is part of the initializer for DECL. If there are any
11311 reference or initializer lists being initialized, extend their
11312 lifetime to match that of DECL. */
11314 tree
11315 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
11317 tree type = TREE_TYPE (init);
11318 if (processing_template_decl)
11319 return init;
11320 if (TYPE_REF_P (type))
11321 init = extend_ref_init_temps_1 (decl, init, cleanups);
11322 else
11324 tree ctor = init;
11325 if (TREE_CODE (ctor) == TARGET_EXPR)
11326 ctor = TARGET_EXPR_INITIAL (ctor);
11327 if (TREE_CODE (ctor) == CONSTRUCTOR)
11329 if (is_std_init_list (type))
11331 /* The temporary array underlying a std::initializer_list
11332 is handled like a reference temporary. */
11333 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
11334 array = extend_ref_init_temps_1 (decl, array, cleanups);
11335 CONSTRUCTOR_ELT (ctor, 0)->value = array;
11337 else
11339 unsigned i;
11340 constructor_elt *p;
11341 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
11342 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
11343 p->value = extend_ref_init_temps (decl, p->value, cleanups);
11345 recompute_constructor_flags (ctor);
11346 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
11347 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
11351 return init;
11354 /* Returns true iff an initializer for TYPE could contain temporaries that
11355 need to be extended because they are bound to references or
11356 std::initializer_list. */
11358 bool
11359 type_has_extended_temps (tree type)
11361 type = strip_array_types (type);
11362 if (TYPE_REF_P (type))
11363 return true;
11364 if (CLASS_TYPE_P (type))
11366 if (is_std_init_list (type))
11367 return true;
11368 for (tree f = next_initializable_field (TYPE_FIELDS (type));
11369 f; f = next_initializable_field (DECL_CHAIN (f)))
11370 if (type_has_extended_temps (TREE_TYPE (f)))
11371 return true;
11373 return false;
11376 /* Returns true iff TYPE is some variant of std::initializer_list. */
11378 bool
11379 is_std_init_list (tree type)
11381 if (!TYPE_P (type))
11382 return false;
11383 if (cxx_dialect == cxx98)
11384 return false;
11385 /* Look through typedefs. */
11386 type = TYPE_MAIN_VARIANT (type);
11387 return (CLASS_TYPE_P (type)
11388 && CP_TYPE_CONTEXT (type) == std_node
11389 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
11392 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11393 will accept an argument list of a single std::initializer_list<T>. */
11395 bool
11396 is_list_ctor (tree decl)
11398 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
11399 tree arg;
11401 if (!args || args == void_list_node)
11402 return false;
11404 arg = non_reference (TREE_VALUE (args));
11405 if (!is_std_init_list (arg))
11406 return false;
11408 args = TREE_CHAIN (args);
11410 if (args && args != void_list_node && !TREE_PURPOSE (args))
11411 /* There are more non-defaulted parms. */
11412 return false;
11414 return true;
11417 #include "gt-cp-call.h"