* tree-loop-distribution.c (params.h): Include header file.
[official-gcc.git] / gcc / cp / call.c
blobfac6b6c16ac2cbfe9c0730b44def2c2f005c999e
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
25 #include "config.h"
26 #include "system.h"
27 #include "coretypes.h"
28 #include "target.h"
29 #include "cp-tree.h"
30 #include "timevar.h"
31 #include "stringpool.h"
32 #include "cgraph.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
35 #include "flags.h"
36 #include "toplev.h"
37 #include "intl.h"
38 #include "convert.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
43 /* The various kinds of conversion. */
45 enum conversion_kind {
46 ck_identity,
47 ck_lvalue,
48 ck_fnptr,
49 ck_qual,
50 ck_std,
51 ck_ptr,
52 ck_pmem,
53 ck_base,
54 ck_ref_bind,
55 ck_user,
56 ck_ambig,
57 ck_list,
58 ck_aggr,
59 ck_rvalue
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 enum conversion_rank {
66 cr_identity,
67 cr_exact,
68 cr_promotion,
69 cr_std,
70 cr_pbool,
71 cr_user,
72 cr_ellipsis,
73 cr_bad
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 struct conversion {
81 /* The kind of conversion represented by this step. */
82 conversion_kind kind;
83 /* The rank of this conversion. */
84 conversion_rank rank;
85 BOOL_BITFIELD user_conv_p : 1;
86 BOOL_BITFIELD ellipsis_p : 1;
87 BOOL_BITFIELD this_p : 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p : 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
94 conversion. */
95 BOOL_BITFIELD need_temporary_p : 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p : 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p: 1;
105 BOOL_BITFIELD check_narrowing: 1;
106 /* The type of the expression resulting from the conversion. */
107 tree type;
108 union {
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity, ck_ambig nor
113 ck_list. Please use the next_conversion function instead
114 of using this field directly. */
115 conversion *next;
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
118 tree expr;
119 /* The array of conversions for an initializer_list, so this
120 variant is used only when KIN D is ck_list. */
121 conversion **list;
122 } u;
123 /* The function candidate corresponding to this conversion
124 sequence. This field is only used if KIND is ck_user. */
125 struct z_candidate *cand;
128 #define CONVERSION_RANK(NODE) \
129 ((NODE)->bad_p ? cr_bad \
130 : (NODE)->ellipsis_p ? cr_ellipsis \
131 : (NODE)->user_conv_p ? cr_user \
132 : (NODE)->rank)
134 #define BAD_CONVERSION_RANK(NODE) \
135 ((NODE)->ellipsis_p ? cr_ellipsis \
136 : (NODE)->user_conv_p ? cr_user \
137 : (NODE)->rank)
139 static struct obstack conversion_obstack;
140 static bool conversion_obstack_initialized;
141 struct rejection_reason;
143 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
144 static int equal_functions (tree, tree);
145 static int joust (struct z_candidate *, struct z_candidate *, bool,
146 tsubst_flags_t);
147 static int compare_ics (conversion *, conversion *);
148 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
149 #define convert_like(CONV, EXPR, COMPLAIN) \
150 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
151 /*issue_conversion_warnings=*/true, \
152 /*c_cast_p=*/false, (COMPLAIN))
153 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
154 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 static tree convert_like_real (conversion *, tree, tree, int, bool,
158 bool, tsubst_flags_t);
159 static void op_error (location_t, enum tree_code, enum tree_code, tree,
160 tree, tree, bool);
161 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
162 tsubst_flags_t);
163 static void print_z_candidate (location_t, const char *, struct z_candidate *);
164 static void print_z_candidates (location_t, struct z_candidate *);
165 static tree build_this (tree);
166 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
167 static bool any_strictly_viable (struct z_candidate *);
168 static struct z_candidate *add_template_candidate
169 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
170 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
171 static struct z_candidate *add_template_candidate_real
172 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
173 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
174 static void add_builtin_candidates
175 (struct z_candidate **, enum tree_code, enum tree_code,
176 tree, tree *, int, tsubst_flags_t);
177 static void add_builtin_candidate
178 (struct z_candidate **, enum tree_code, enum tree_code,
179 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
180 static bool is_complete (tree);
181 static void build_builtin_candidate
182 (struct z_candidate **, tree, tree, tree, tree *, tree *,
183 int, tsubst_flags_t);
184 static struct z_candidate *add_conv_candidate
185 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
186 tree, tsubst_flags_t);
187 static struct z_candidate *add_function_candidate
188 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
189 tree, int, tsubst_flags_t);
190 static conversion *implicit_conversion (tree, tree, tree, bool, int,
191 tsubst_flags_t);
192 static conversion *reference_binding (tree, tree, tree, bool, int,
193 tsubst_flags_t);
194 static conversion *build_conv (conversion_kind, tree, conversion *);
195 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
196 static conversion *next_conversion (conversion *);
197 static bool is_subseq (conversion *, conversion *);
198 static conversion *maybe_handle_ref_bind (conversion **);
199 static void maybe_handle_implicit_object (conversion **);
200 static struct z_candidate *add_candidate
201 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
202 conversion **, tree, tree, int, struct rejection_reason *, int);
203 static tree source_type (conversion *);
204 static void add_warning (struct z_candidate *, struct z_candidate *);
205 static bool reference_compatible_p (tree, tree);
206 static conversion *direct_reference_binding (tree, conversion *);
207 static bool promoted_arithmetic_type_p (tree);
208 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
209 static char *name_as_c_string (tree, tree, bool *);
210 static tree prep_operand (tree);
211 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
212 bool, tree, tree, int, struct z_candidate **,
213 tsubst_flags_t);
214 static conversion *merge_conversion_sequences (conversion *, conversion *);
215 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
217 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
218 NAME can take many forms... */
220 bool
221 check_dtor_name (tree basetype, tree name)
223 /* Just accept something we've already complained about. */
224 if (name == error_mark_node)
225 return true;
227 if (TREE_CODE (name) == TYPE_DECL)
228 name = TREE_TYPE (name);
229 else if (TYPE_P (name))
230 /* OK */;
231 else if (identifier_p (name))
233 if ((MAYBE_CLASS_TYPE_P (basetype)
234 || TREE_CODE (basetype) == ENUMERAL_TYPE)
235 && name == constructor_name (basetype))
236 return true;
237 else
238 name = get_type_value (name);
240 else
242 /* In the case of:
244 template <class T> struct S { ~S(); };
245 int i;
246 i.~S();
248 NAME will be a class template. */
249 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
250 return false;
253 if (!name || name == error_mark_node)
254 return false;
255 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
258 /* We want the address of a function or method. We avoid creating a
259 pointer-to-member function. */
261 tree
262 build_addr_func (tree function, tsubst_flags_t complain)
264 tree type = TREE_TYPE (function);
266 /* We have to do these by hand to avoid real pointer to member
267 functions. */
268 if (TREE_CODE (type) == METHOD_TYPE)
270 if (TREE_CODE (function) == OFFSET_REF)
272 tree object = build_address (TREE_OPERAND (function, 0));
273 return get_member_function_from_ptrfunc (&object,
274 TREE_OPERAND (function, 1),
275 complain);
277 function = build_address (function);
279 else
280 function = decay_conversion (function, complain, /*reject_builtin=*/false);
282 return function;
285 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
286 POINTER_TYPE to those. Note, pointer to member function types
287 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
288 two variants. build_call_a is the primitive taking an array of
289 arguments, while build_call_n is a wrapper that handles varargs. */
291 tree
292 build_call_n (tree function, int n, ...)
294 if (n == 0)
295 return build_call_a (function, 0, NULL);
296 else
298 tree *argarray = XALLOCAVEC (tree, n);
299 va_list ap;
300 int i;
302 va_start (ap, n);
303 for (i = 0; i < n; i++)
304 argarray[i] = va_arg (ap, tree);
305 va_end (ap);
306 return build_call_a (function, n, argarray);
310 /* Update various flags in cfun and the call itself based on what is being
311 called. Split out of build_call_a so that bot_manip can use it too. */
313 void
314 set_flags_from_callee (tree call)
316 bool nothrow;
317 tree decl = get_callee_fndecl (call);
319 /* We check both the decl and the type; a function may be known not to
320 throw without being declared throw(). */
321 nothrow = decl && TREE_NOTHROW (decl);
322 if (CALL_EXPR_FN (call))
323 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
324 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
325 nothrow = true;
327 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
328 cp_function_chain->can_throw = 1;
330 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
331 current_function_returns_abnormally = 1;
333 TREE_NOTHROW (call) = nothrow;
336 tree
337 build_call_a (tree function, int n, tree *argarray)
339 tree decl;
340 tree result_type;
341 tree fntype;
342 int i;
344 function = build_addr_func (function, tf_warning_or_error);
346 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
347 fntype = TREE_TYPE (TREE_TYPE (function));
348 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
349 || TREE_CODE (fntype) == METHOD_TYPE);
350 result_type = TREE_TYPE (fntype);
351 /* An rvalue has no cv-qualifiers. */
352 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
353 result_type = cv_unqualified (result_type);
355 function = build_call_array_loc (input_location,
356 result_type, function, n, argarray);
357 set_flags_from_callee (function);
359 decl = get_callee_fndecl (function);
361 if (decl && !TREE_USED (decl))
363 /* We invoke build_call directly for several library
364 functions. These may have been declared normally if
365 we're building libgcc, so we can't just check
366 DECL_ARTIFICIAL. */
367 gcc_assert (DECL_ARTIFICIAL (decl)
368 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
369 "__", 2));
370 mark_used (decl);
373 require_complete_eh_spec_types (fntype, decl);
375 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
377 if (current_function_decl && decl
378 && flag_new_inheriting_ctors
379 && DECL_INHERITED_CTOR (current_function_decl)
380 && (DECL_INHERITED_CTOR (current_function_decl)
381 == DECL_CLONED_FUNCTION (decl)))
382 /* Pass arguments directly to the inherited constructor. */
383 CALL_FROM_THUNK_P (function) = true;
385 /* Don't pass empty class objects by value. This is useful
386 for tags in STL, which are used to control overload resolution.
387 We don't need to handle other cases of copying empty classes. */
388 else if (! decl || ! DECL_BUILT_IN (decl))
389 for (i = 0; i < n; i++)
391 tree arg = CALL_EXPR_ARG (function, i);
392 if (is_empty_class (TREE_TYPE (arg))
393 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
395 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
396 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
397 CALL_EXPR_ARG (function, i) = arg;
401 return function;
404 /* New overloading code. */
406 struct z_candidate;
408 struct candidate_warning {
409 z_candidate *loser;
410 candidate_warning *next;
413 /* Information for providing diagnostics about why overloading failed. */
415 enum rejection_reason_code {
416 rr_none,
417 rr_arity,
418 rr_explicit_conversion,
419 rr_template_conversion,
420 rr_arg_conversion,
421 rr_bad_arg_conversion,
422 rr_template_unification,
423 rr_invalid_copy,
424 rr_inherited_ctor,
425 rr_constraint_failure
428 struct conversion_info {
429 /* The index of the argument, 0-based. */
430 int n_arg;
431 /* The actual argument or its type. */
432 tree from;
433 /* The type of the parameter. */
434 tree to_type;
437 struct rejection_reason {
438 enum rejection_reason_code code;
439 union {
440 /* Information about an arity mismatch. */
441 struct {
442 /* The expected number of arguments. */
443 int expected;
444 /* The actual number of arguments in the call. */
445 int actual;
446 /* Whether the call was a varargs call. */
447 bool call_varargs_p;
448 } arity;
449 /* Information about an argument conversion mismatch. */
450 struct conversion_info conversion;
451 /* Same, but for bad argument conversions. */
452 struct conversion_info bad_conversion;
453 /* Information about template unification failures. These are the
454 parameters passed to fn_type_unification. */
455 struct {
456 tree tmpl;
457 tree explicit_targs;
458 int num_targs;
459 const tree *args;
460 unsigned int nargs;
461 tree return_type;
462 unification_kind_t strict;
463 int flags;
464 } template_unification;
465 /* Information about template instantiation failures. These are the
466 parameters passed to instantiate_template. */
467 struct {
468 tree tmpl;
469 tree targs;
470 } template_instantiation;
471 } u;
474 struct z_candidate {
475 /* The FUNCTION_DECL that will be called if this candidate is
476 selected by overload resolution. */
477 tree fn;
478 /* If not NULL_TREE, the first argument to use when calling this
479 function. */
480 tree first_arg;
481 /* The rest of the arguments to use when calling this function. If
482 there are no further arguments this may be NULL or it may be an
483 empty vector. */
484 const vec<tree, va_gc> *args;
485 /* The implicit conversion sequences for each of the arguments to
486 FN. */
487 conversion **convs;
488 /* The number of implicit conversion sequences. */
489 size_t num_convs;
490 /* If FN is a user-defined conversion, the standard conversion
491 sequence from the type returned by FN to the desired destination
492 type. */
493 conversion *second_conv;
494 struct rejection_reason *reason;
495 /* If FN is a member function, the binfo indicating the path used to
496 qualify the name of FN at the call site. This path is used to
497 determine whether or not FN is accessible if it is selected by
498 overload resolution. The DECL_CONTEXT of FN will always be a
499 (possibly improper) base of this binfo. */
500 tree access_path;
501 /* If FN is a non-static member function, the binfo indicating the
502 subobject to which the `this' pointer should be converted if FN
503 is selected by overload resolution. The type pointed to by
504 the `this' pointer must correspond to the most derived class
505 indicated by the CONVERSION_PATH. */
506 tree conversion_path;
507 tree template_decl;
508 tree explicit_targs;
509 candidate_warning *warnings;
510 z_candidate *next;
511 int viable;
513 /* The flags active in add_candidate. */
514 int flags;
517 /* Returns true iff T is a null pointer constant in the sense of
518 [conv.ptr]. */
520 bool
521 null_ptr_cst_p (tree t)
523 tree type = TREE_TYPE (t);
525 /* [conv.ptr]
527 A null pointer constant is an integral constant expression
528 (_expr.const_) rvalue of integer type that evaluates to zero or
529 an rvalue of type std::nullptr_t. */
530 if (NULLPTR_TYPE_P (type))
531 return true;
533 if (cxx_dialect >= cxx11)
535 /* Core issue 903 says only literal 0 is a null pointer constant. */
536 if (TREE_CODE (type) == INTEGER_TYPE
537 && !char_type_p (type)
538 && TREE_CODE (t) == INTEGER_CST
539 && integer_zerop (t)
540 && !TREE_OVERFLOW (t))
541 return true;
543 else if (CP_INTEGRAL_TYPE_P (type))
545 t = fold_non_dependent_expr (t);
546 STRIP_NOPS (t);
547 if (integer_zerop (t) && !TREE_OVERFLOW (t))
548 return true;
551 return false;
554 /* Returns true iff T is a null member pointer value (4.11). */
556 bool
557 null_member_pointer_value_p (tree t)
559 tree type = TREE_TYPE (t);
560 if (!type)
561 return false;
562 else if (TYPE_PTRMEMFUNC_P (type))
563 return (TREE_CODE (t) == CONSTRUCTOR
564 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
565 else if (TYPE_PTRDATAMEM_P (type))
566 return integer_all_onesp (t);
567 else
568 return false;
571 /* Returns nonzero if PARMLIST consists of only default parms,
572 ellipsis, and/or undeduced parameter packs. */
574 bool
575 sufficient_parms_p (const_tree parmlist)
577 for (; parmlist && parmlist != void_list_node;
578 parmlist = TREE_CHAIN (parmlist))
579 if (!TREE_PURPOSE (parmlist)
580 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
581 return false;
582 return true;
585 /* Allocate N bytes of memory from the conversion obstack. The memory
586 is zeroed before being returned. */
588 static void *
589 conversion_obstack_alloc (size_t n)
591 void *p;
592 if (!conversion_obstack_initialized)
594 gcc_obstack_init (&conversion_obstack);
595 conversion_obstack_initialized = true;
597 p = obstack_alloc (&conversion_obstack, n);
598 memset (p, 0, n);
599 return p;
602 /* Allocate rejection reasons. */
604 static struct rejection_reason *
605 alloc_rejection (enum rejection_reason_code code)
607 struct rejection_reason *p;
608 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
609 p->code = code;
610 return p;
613 static struct rejection_reason *
614 arity_rejection (tree first_arg, int expected, int actual)
616 struct rejection_reason *r = alloc_rejection (rr_arity);
617 int adjust = first_arg != NULL_TREE;
618 r->u.arity.expected = expected - adjust;
619 r->u.arity.actual = actual - adjust;
620 return r;
623 static struct rejection_reason *
624 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
626 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
627 int adjust = first_arg != NULL_TREE;
628 r->u.conversion.n_arg = n_arg - adjust;
629 r->u.conversion.from = from;
630 r->u.conversion.to_type = to;
631 return r;
634 static struct rejection_reason *
635 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
637 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
638 int adjust = first_arg != NULL_TREE;
639 r->u.bad_conversion.n_arg = n_arg - adjust;
640 r->u.bad_conversion.from = from;
641 r->u.bad_conversion.to_type = to;
642 return r;
645 static struct rejection_reason *
646 explicit_conversion_rejection (tree from, tree to)
648 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
649 r->u.conversion.n_arg = 0;
650 r->u.conversion.from = from;
651 r->u.conversion.to_type = to;
652 return r;
655 static struct rejection_reason *
656 template_conversion_rejection (tree from, tree to)
658 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
659 r->u.conversion.n_arg = 0;
660 r->u.conversion.from = from;
661 r->u.conversion.to_type = to;
662 return r;
665 static struct rejection_reason *
666 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
667 const tree *args, unsigned int nargs,
668 tree return_type, unification_kind_t strict,
669 int flags)
671 size_t args_n_bytes = sizeof (*args) * nargs;
672 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
673 struct rejection_reason *r = alloc_rejection (rr_template_unification);
674 r->u.template_unification.tmpl = tmpl;
675 r->u.template_unification.explicit_targs = explicit_targs;
676 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
677 /* Copy args to our own storage. */
678 memcpy (args1, args, args_n_bytes);
679 r->u.template_unification.args = args1;
680 r->u.template_unification.nargs = nargs;
681 r->u.template_unification.return_type = return_type;
682 r->u.template_unification.strict = strict;
683 r->u.template_unification.flags = flags;
684 return r;
687 static struct rejection_reason *
688 template_unification_error_rejection (void)
690 return alloc_rejection (rr_template_unification);
693 static struct rejection_reason *
694 invalid_copy_with_fn_template_rejection (void)
696 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
697 return r;
700 static struct rejection_reason *
701 inherited_ctor_rejection (void)
703 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
704 return r;
707 // Build a constraint failure record, saving information into the
708 // template_instantiation field of the rejection. If FN is not a template
709 // declaration, the TMPL member is the FN declaration and TARGS is empty.
711 static struct rejection_reason *
712 constraint_failure (tree fn)
714 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
715 if (tree ti = DECL_TEMPLATE_INFO (fn))
717 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
718 r->u.template_instantiation.targs = TI_ARGS (ti);
720 else
722 r->u.template_instantiation.tmpl = fn;
723 r->u.template_instantiation.targs = NULL_TREE;
725 return r;
728 /* Dynamically allocate a conversion. */
730 static conversion *
731 alloc_conversion (conversion_kind kind)
733 conversion *c;
734 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
735 c->kind = kind;
736 return c;
739 /* Make sure that all memory on the conversion obstack has been
740 freed. */
742 void
743 validate_conversion_obstack (void)
745 if (conversion_obstack_initialized)
746 gcc_assert ((obstack_next_free (&conversion_obstack)
747 == obstack_base (&conversion_obstack)));
750 /* Dynamically allocate an array of N conversions. */
752 static conversion **
753 alloc_conversions (size_t n)
755 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
758 static conversion *
759 build_conv (conversion_kind code, tree type, conversion *from)
761 conversion *t;
762 conversion_rank rank = CONVERSION_RANK (from);
764 /* Note that the caller is responsible for filling in t->cand for
765 user-defined conversions. */
766 t = alloc_conversion (code);
767 t->type = type;
768 t->u.next = from;
770 switch (code)
772 case ck_ptr:
773 case ck_pmem:
774 case ck_base:
775 case ck_std:
776 if (rank < cr_std)
777 rank = cr_std;
778 break;
780 case ck_qual:
781 case ck_fnptr:
782 if (rank < cr_exact)
783 rank = cr_exact;
784 break;
786 default:
787 break;
789 t->rank = rank;
790 t->user_conv_p = (code == ck_user || from->user_conv_p);
791 t->bad_p = from->bad_p;
792 t->base_p = false;
793 return t;
796 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
797 specialization of std::initializer_list<T>, if such a conversion is
798 possible. */
800 static conversion *
801 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
803 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
804 unsigned len = CONSTRUCTOR_NELTS (ctor);
805 conversion **subconvs = alloc_conversions (len);
806 conversion *t;
807 unsigned i;
808 tree val;
810 /* Within a list-initialization we can have more user-defined
811 conversions. */
812 flags &= ~LOOKUP_NO_CONVERSION;
813 /* But no narrowing conversions. */
814 flags |= LOOKUP_NO_NARROWING;
816 /* Can't make an array of these types. */
817 if (TREE_CODE (elttype) == REFERENCE_TYPE
818 || TREE_CODE (elttype) == FUNCTION_TYPE
819 || VOID_TYPE_P (elttype))
820 return NULL;
822 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
824 conversion *sub
825 = implicit_conversion (elttype, TREE_TYPE (val), val,
826 false, flags, complain);
827 if (sub == NULL)
828 return NULL;
830 subconvs[i] = sub;
833 t = alloc_conversion (ck_list);
834 t->type = type;
835 t->u.list = subconvs;
836 t->rank = cr_exact;
838 for (i = 0; i < len; ++i)
840 conversion *sub = subconvs[i];
841 if (sub->rank > t->rank)
842 t->rank = sub->rank;
843 if (sub->user_conv_p)
844 t->user_conv_p = true;
845 if (sub->bad_p)
846 t->bad_p = true;
849 return t;
852 /* Return the next conversion of the conversion chain (if applicable),
853 or NULL otherwise. Please use this function instead of directly
854 accessing fields of struct conversion. */
856 static conversion *
857 next_conversion (conversion *conv)
859 if (conv == NULL
860 || conv->kind == ck_identity
861 || conv->kind == ck_ambig
862 || conv->kind == ck_list)
863 return NULL;
864 return conv->u.next;
867 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
868 is a valid aggregate initializer for array type ATYPE. */
870 static bool
871 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
873 unsigned i;
874 tree elttype = TREE_TYPE (atype);
875 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
877 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
878 bool ok;
879 if (TREE_CODE (elttype) == ARRAY_TYPE
880 && TREE_CODE (val) == CONSTRUCTOR)
881 ok = can_convert_array (elttype, val, flags, complain);
882 else
883 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
884 complain);
885 if (!ok)
886 return false;
888 return true;
891 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
892 aggregate class, if such a conversion is possible. */
894 static conversion *
895 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
897 unsigned HOST_WIDE_INT i = 0;
898 conversion *c;
899 tree field = next_initializable_field (TYPE_FIELDS (type));
900 tree empty_ctor = NULL_TREE;
902 /* We already called reshape_init in implicit_conversion. */
904 /* The conversions within the init-list aren't affected by the enclosing
905 context; they're always simple copy-initialization. */
906 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
908 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
910 tree ftype = TREE_TYPE (field);
911 tree val;
912 bool ok;
914 if (i < CONSTRUCTOR_NELTS (ctor))
915 val = CONSTRUCTOR_ELT (ctor, i)->value;
916 else if (DECL_INITIAL (field))
917 val = get_nsdmi (field, /*ctor*/false);
918 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
919 /* Value-initialization of reference is ill-formed. */
920 return NULL;
921 else
923 if (empty_ctor == NULL_TREE)
924 empty_ctor = build_constructor (init_list_type_node, NULL);
925 val = empty_ctor;
927 ++i;
929 if (TREE_CODE (ftype) == ARRAY_TYPE
930 && TREE_CODE (val) == CONSTRUCTOR)
931 ok = can_convert_array (ftype, val, flags, complain);
932 else
933 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
934 complain);
936 if (!ok)
937 return NULL;
939 if (TREE_CODE (type) == UNION_TYPE)
940 break;
943 if (i < CONSTRUCTOR_NELTS (ctor))
944 return NULL;
946 c = alloc_conversion (ck_aggr);
947 c->type = type;
948 c->rank = cr_exact;
949 c->user_conv_p = true;
950 c->check_narrowing = true;
951 c->u.next = NULL;
952 return c;
955 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
956 array type, if such a conversion is possible. */
958 static conversion *
959 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
961 conversion *c;
962 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
963 tree elttype = TREE_TYPE (type);
964 unsigned i;
965 tree val;
966 bool bad = false;
967 bool user = false;
968 enum conversion_rank rank = cr_exact;
970 /* We might need to propagate the size from the element to the array. */
971 complete_type (type);
973 if (TYPE_DOMAIN (type)
974 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
976 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
977 if (alen < len)
978 return NULL;
981 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
983 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
985 conversion *sub
986 = implicit_conversion (elttype, TREE_TYPE (val), val,
987 false, flags, complain);
988 if (sub == NULL)
989 return NULL;
991 if (sub->rank > rank)
992 rank = sub->rank;
993 if (sub->user_conv_p)
994 user = true;
995 if (sub->bad_p)
996 bad = true;
999 c = alloc_conversion (ck_aggr);
1000 c->type = type;
1001 c->rank = rank;
1002 c->user_conv_p = user;
1003 c->bad_p = bad;
1004 c->u.next = NULL;
1005 return c;
1008 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1009 complex type, if such a conversion is possible. */
1011 static conversion *
1012 build_complex_conv (tree type, tree ctor, int flags,
1013 tsubst_flags_t complain)
1015 conversion *c;
1016 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1017 tree elttype = TREE_TYPE (type);
1018 unsigned i;
1019 tree val;
1020 bool bad = false;
1021 bool user = false;
1022 enum conversion_rank rank = cr_exact;
1024 if (len != 2)
1025 return NULL;
1027 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1029 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1031 conversion *sub
1032 = implicit_conversion (elttype, TREE_TYPE (val), val,
1033 false, flags, complain);
1034 if (sub == NULL)
1035 return NULL;
1037 if (sub->rank > rank)
1038 rank = sub->rank;
1039 if (sub->user_conv_p)
1040 user = true;
1041 if (sub->bad_p)
1042 bad = true;
1045 c = alloc_conversion (ck_aggr);
1046 c->type = type;
1047 c->rank = rank;
1048 c->user_conv_p = user;
1049 c->bad_p = bad;
1050 c->u.next = NULL;
1051 return c;
1054 /* Build a representation of the identity conversion from EXPR to
1055 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1057 static conversion *
1058 build_identity_conv (tree type, tree expr)
1060 conversion *c;
1062 c = alloc_conversion (ck_identity);
1063 c->type = type;
1064 c->u.expr = expr;
1066 return c;
1069 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1070 were multiple user-defined conversions to accomplish the job.
1071 Build a conversion that indicates that ambiguity. */
1073 static conversion *
1074 build_ambiguous_conv (tree type, tree expr)
1076 conversion *c;
1078 c = alloc_conversion (ck_ambig);
1079 c->type = type;
1080 c->u.expr = expr;
1082 return c;
1085 tree
1086 strip_top_quals (tree t)
1088 if (TREE_CODE (t) == ARRAY_TYPE)
1089 return t;
1090 return cp_build_qualified_type (t, 0);
1093 /* Returns the standard conversion path (see [conv]) from type FROM to type
1094 TO, if any. For proper handling of null pointer constants, you must
1095 also pass the expression EXPR to convert from. If C_CAST_P is true,
1096 this conversion is coming from a C-style cast. */
1098 static conversion *
1099 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1100 int flags, tsubst_flags_t complain)
1102 enum tree_code fcode, tcode;
1103 conversion *conv;
1104 bool fromref = false;
1105 tree qualified_to;
1107 to = non_reference (to);
1108 if (TREE_CODE (from) == REFERENCE_TYPE)
1110 fromref = true;
1111 from = TREE_TYPE (from);
1113 qualified_to = to;
1114 to = strip_top_quals (to);
1115 from = strip_top_quals (from);
1117 if (expr && type_unknown_p (expr))
1119 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1121 tsubst_flags_t tflags = tf_conv;
1122 expr = instantiate_type (to, expr, tflags);
1123 if (expr == error_mark_node)
1124 return NULL;
1125 from = TREE_TYPE (expr);
1127 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1129 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1130 expr = resolve_nondeduced_context (expr, complain);
1131 from = TREE_TYPE (expr);
1135 fcode = TREE_CODE (from);
1136 tcode = TREE_CODE (to);
1138 conv = build_identity_conv (from, expr);
1139 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1141 from = type_decays_to (from);
1142 fcode = TREE_CODE (from);
1143 conv = build_conv (ck_lvalue, from, conv);
1145 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1146 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1147 express the copy constructor call required by copy-initialization. */
1148 else if (fromref || (expr && obvalue_p (expr)))
1150 if (expr)
1152 tree bitfield_type;
1153 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1154 if (bitfield_type)
1156 from = strip_top_quals (bitfield_type);
1157 fcode = TREE_CODE (from);
1160 conv = build_conv (ck_rvalue, from, conv);
1161 if (flags & LOOKUP_PREFER_RVALUE)
1162 conv->rvaluedness_matches_p = true;
1165 /* Allow conversion between `__complex__' data types. */
1166 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1168 /* The standard conversion sequence to convert FROM to TO is
1169 the standard conversion sequence to perform componentwise
1170 conversion. */
1171 conversion *part_conv = standard_conversion
1172 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1173 complain);
1175 if (part_conv)
1177 conv = build_conv (part_conv->kind, to, conv);
1178 conv->rank = part_conv->rank;
1180 else
1181 conv = NULL;
1183 return conv;
1186 if (same_type_p (from, to))
1188 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1189 conv->type = qualified_to;
1190 return conv;
1193 /* [conv.ptr]
1194 A null pointer constant can be converted to a pointer type; ... A
1195 null pointer constant of integral type can be converted to an
1196 rvalue of type std::nullptr_t. */
1197 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1198 || NULLPTR_TYPE_P (to))
1199 && ((expr && null_ptr_cst_p (expr))
1200 || NULLPTR_TYPE_P (from)))
1201 conv = build_conv (ck_std, to, conv);
1202 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1203 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1205 /* For backwards brain damage compatibility, allow interconversion of
1206 pointers and integers with a pedwarn. */
1207 conv = build_conv (ck_std, to, conv);
1208 conv->bad_p = true;
1210 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1212 /* For backwards brain damage compatibility, allow interconversion of
1213 enums and integers with a pedwarn. */
1214 conv = build_conv (ck_std, to, conv);
1215 conv->bad_p = true;
1217 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1218 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1220 tree to_pointee;
1221 tree from_pointee;
1223 if (tcode == POINTER_TYPE)
1225 to_pointee = TREE_TYPE (to);
1226 from_pointee = TREE_TYPE (from);
1228 /* Since this is the target of a pointer, it can't have function
1229 qualifiers, so any TYPE_QUALS must be for attributes const or
1230 noreturn. Strip them. */
1231 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1232 && TYPE_QUALS (to_pointee))
1233 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1234 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1235 && TYPE_QUALS (from_pointee))
1236 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1238 else
1240 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1241 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1244 if (tcode == POINTER_TYPE
1245 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1246 to_pointee))
1248 else if (VOID_TYPE_P (to_pointee)
1249 && !TYPE_PTRDATAMEM_P (from)
1250 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1252 tree nfrom = TREE_TYPE (from);
1253 /* Don't try to apply restrict to void. */
1254 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1255 from_pointee = cp_build_qualified_type (void_type_node, quals);
1256 from = build_pointer_type (from_pointee);
1257 conv = build_conv (ck_ptr, from, conv);
1259 else if (TYPE_PTRDATAMEM_P (from))
1261 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1262 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1264 if (same_type_p (fbase, tbase))
1265 /* No base conversion needed. */;
1266 else if (DERIVED_FROM_P (fbase, tbase)
1267 && (same_type_ignoring_top_level_qualifiers_p
1268 (from_pointee, to_pointee)))
1270 from = build_ptrmem_type (tbase, from_pointee);
1271 conv = build_conv (ck_pmem, from, conv);
1273 else
1274 return NULL;
1276 else if (CLASS_TYPE_P (from_pointee)
1277 && CLASS_TYPE_P (to_pointee)
1278 /* [conv.ptr]
1280 An rvalue of type "pointer to cv D," where D is a
1281 class type, can be converted to an rvalue of type
1282 "pointer to cv B," where B is a base class (clause
1283 _class.derived_) of D. If B is an inaccessible
1284 (clause _class.access_) or ambiguous
1285 (_class.member.lookup_) base class of D, a program
1286 that necessitates this conversion is ill-formed.
1287 Therefore, we use DERIVED_FROM_P, and do not check
1288 access or uniqueness. */
1289 && DERIVED_FROM_P (to_pointee, from_pointee))
1291 from_pointee
1292 = cp_build_qualified_type (to_pointee,
1293 cp_type_quals (from_pointee));
1294 from = build_pointer_type (from_pointee);
1295 conv = build_conv (ck_ptr, from, conv);
1296 conv->base_p = true;
1299 if (same_type_p (from, to))
1300 /* OK */;
1301 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1302 /* In a C-style cast, we ignore CV-qualification because we
1303 are allowed to perform a static_cast followed by a
1304 const_cast. */
1305 conv = build_conv (ck_qual, to, conv);
1306 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1307 conv = build_conv (ck_qual, to, conv);
1308 else if (expr && string_conv_p (to, expr, 0))
1309 /* converting from string constant to char *. */
1310 conv = build_conv (ck_qual, to, conv);
1311 else if (fnptr_conv_p (to, from))
1312 conv = build_conv (ck_fnptr, to, conv);
1313 /* Allow conversions among compatible ObjC pointer types (base
1314 conversions have been already handled above). */
1315 else if (c_dialect_objc ()
1316 && objc_compare_types (to, from, -4, NULL_TREE))
1317 conv = build_conv (ck_ptr, to, conv);
1318 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1320 conv = build_conv (ck_ptr, to, conv);
1321 conv->bad_p = true;
1323 else
1324 return NULL;
1326 from = to;
1328 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1330 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1331 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1332 tree fbase = class_of_this_parm (fromfn);
1333 tree tbase = class_of_this_parm (tofn);
1335 if (!DERIVED_FROM_P (fbase, tbase))
1336 return NULL;
1338 tree fstat = static_fn_type (fromfn);
1339 tree tstat = static_fn_type (tofn);
1340 if (same_type_p (tstat, fstat)
1341 || fnptr_conv_p (tstat, fstat))
1342 /* OK */;
1343 else
1344 return NULL;
1346 if (!same_type_p (fbase, tbase))
1348 from = build_memfn_type (fstat,
1349 tbase,
1350 cp_type_quals (tbase),
1351 type_memfn_rqual (tofn));
1352 from = build_ptrmemfunc_type (build_pointer_type (from));
1353 conv = build_conv (ck_pmem, from, conv);
1354 conv->base_p = true;
1356 if (fnptr_conv_p (tstat, fstat))
1357 conv = build_conv (ck_fnptr, to, conv);
1359 else if (tcode == BOOLEAN_TYPE)
1361 /* [conv.bool]
1363 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1364 to member type can be converted to a prvalue of type bool. ...
1365 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1366 std::nullptr_t can be converted to a prvalue of type bool; */
1367 if (ARITHMETIC_TYPE_P (from)
1368 || UNSCOPED_ENUM_P (from)
1369 || fcode == POINTER_TYPE
1370 || TYPE_PTRMEM_P (from)
1371 || NULLPTR_TYPE_P (from))
1373 conv = build_conv (ck_std, to, conv);
1374 if (fcode == POINTER_TYPE
1375 || TYPE_PTRDATAMEM_P (from)
1376 || (TYPE_PTRMEMFUNC_P (from)
1377 && conv->rank < cr_pbool)
1378 || NULLPTR_TYPE_P (from))
1379 conv->rank = cr_pbool;
1380 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1381 conv->bad_p = true;
1382 return conv;
1385 return NULL;
1387 /* We don't check for ENUMERAL_TYPE here because there are no standard
1388 conversions to enum type. */
1389 /* As an extension, allow conversion to complex type. */
1390 else if (ARITHMETIC_TYPE_P (to))
1392 if (! (INTEGRAL_CODE_P (fcode)
1393 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1394 || SCOPED_ENUM_P (from))
1395 return NULL;
1396 conv = build_conv (ck_std, to, conv);
1398 /* Give this a better rank if it's a promotion. */
1399 if (same_type_p (to, type_promotes_to (from))
1400 && next_conversion (conv)->rank <= cr_promotion)
1401 conv->rank = cr_promotion;
1403 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1404 && vector_types_convertible_p (from, to, false))
1405 return build_conv (ck_std, to, conv);
1406 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1407 && is_properly_derived_from (from, to))
1409 if (conv->kind == ck_rvalue)
1410 conv = next_conversion (conv);
1411 conv = build_conv (ck_base, to, conv);
1412 /* The derived-to-base conversion indicates the initialization
1413 of a parameter with base type from an object of a derived
1414 type. A temporary object is created to hold the result of
1415 the conversion unless we're binding directly to a reference. */
1416 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1418 else
1419 return NULL;
1421 if (flags & LOOKUP_NO_NARROWING)
1422 conv->check_narrowing = true;
1424 return conv;
1427 /* Returns nonzero if T1 is reference-related to T2. */
1429 bool
1430 reference_related_p (tree t1, tree t2)
1432 if (t1 == error_mark_node || t2 == error_mark_node)
1433 return false;
1435 t1 = TYPE_MAIN_VARIANT (t1);
1436 t2 = TYPE_MAIN_VARIANT (t2);
1438 /* [dcl.init.ref]
1440 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1441 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1442 of T2. */
1443 return (same_type_p (t1, t2)
1444 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1445 && DERIVED_FROM_P (t1, t2)));
1448 /* Returns nonzero if T1 is reference-compatible with T2. */
1450 static bool
1451 reference_compatible_p (tree t1, tree t2)
1453 /* [dcl.init.ref]
1455 "cv1 T1" is reference compatible with "cv2 T2" if
1456 * T1 is reference-related to T2 or
1457 * T2 is "noexcept function" and T1 is "function", where the
1458 function types are otherwise the same,
1459 and cv1 is the same cv-qualification as, or greater cv-qualification
1460 than, cv2. */
1461 return ((reference_related_p (t1, t2)
1462 || fnptr_conv_p (t1, t2))
1463 && at_least_as_qualified_p (t1, t2));
1466 /* A reference of the indicated TYPE is being bound directly to the
1467 expression represented by the implicit conversion sequence CONV.
1468 Return a conversion sequence for this binding. */
1470 static conversion *
1471 direct_reference_binding (tree type, conversion *conv)
1473 tree t;
1475 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1476 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1478 t = TREE_TYPE (type);
1480 /* [over.ics.rank]
1482 When a parameter of reference type binds directly
1483 (_dcl.init.ref_) to an argument expression, the implicit
1484 conversion sequence is the identity conversion, unless the
1485 argument expression has a type that is a derived class of the
1486 parameter type, in which case the implicit conversion sequence is
1487 a derived-to-base Conversion.
1489 If the parameter binds directly to the result of applying a
1490 conversion function to the argument expression, the implicit
1491 conversion sequence is a user-defined conversion sequence
1492 (_over.ics.user_), with the second standard conversion sequence
1493 either an identity conversion or, if the conversion function
1494 returns an entity of a type that is a derived class of the
1495 parameter type, a derived-to-base conversion. */
1496 if (is_properly_derived_from (conv->type, t))
1498 /* Represent the derived-to-base conversion. */
1499 conv = build_conv (ck_base, t, conv);
1500 /* We will actually be binding to the base-class subobject in
1501 the derived class, so we mark this conversion appropriately.
1502 That way, convert_like knows not to generate a temporary. */
1503 conv->need_temporary_p = false;
1505 return build_conv (ck_ref_bind, type, conv);
1508 /* Returns the conversion path from type FROM to reference type TO for
1509 purposes of reference binding. For lvalue binding, either pass a
1510 reference type to FROM or an lvalue expression to EXPR. If the
1511 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1512 the conversion returned. If C_CAST_P is true, this
1513 conversion is coming from a C-style cast. */
1515 static conversion *
1516 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1517 tsubst_flags_t complain)
1519 conversion *conv = NULL;
1520 tree to = TREE_TYPE (rto);
1521 tree from = rfrom;
1522 tree tfrom;
1523 bool related_p;
1524 bool compatible_p;
1525 cp_lvalue_kind gl_kind;
1526 bool is_lvalue;
1528 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1530 expr = instantiate_type (to, expr, tf_none);
1531 if (expr == error_mark_node)
1532 return NULL;
1533 from = TREE_TYPE (expr);
1536 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1538 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1539 /* DR 1288: Otherwise, if the initializer list has a single element
1540 of type E and ... [T's] referenced type is reference-related to E,
1541 the object or reference is initialized from that element... */
1542 if (CONSTRUCTOR_NELTS (expr) == 1)
1544 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1545 if (error_operand_p (elt))
1546 return NULL;
1547 tree etype = TREE_TYPE (elt);
1548 if (reference_related_p (to, etype))
1550 expr = elt;
1551 from = etype;
1552 goto skip;
1555 /* Otherwise, if T is a reference type, a prvalue temporary of the
1556 type referenced by T is copy-list-initialized or
1557 direct-list-initialized, depending on the kind of initialization
1558 for the reference, and the reference is bound to that temporary. */
1559 conv = implicit_conversion (to, from, expr, c_cast_p,
1560 flags|LOOKUP_NO_TEMP_BIND, complain);
1561 skip:;
1564 if (TREE_CODE (from) == REFERENCE_TYPE)
1566 from = TREE_TYPE (from);
1567 if (!TYPE_REF_IS_RVALUE (rfrom)
1568 || TREE_CODE (from) == FUNCTION_TYPE)
1569 gl_kind = clk_ordinary;
1570 else
1571 gl_kind = clk_rvalueref;
1573 else if (expr)
1574 gl_kind = lvalue_kind (expr);
1575 else if (CLASS_TYPE_P (from)
1576 || TREE_CODE (from) == ARRAY_TYPE)
1577 gl_kind = clk_class;
1578 else
1579 gl_kind = clk_none;
1581 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1582 if ((flags & LOOKUP_NO_TEMP_BIND)
1583 && (gl_kind & clk_class))
1584 gl_kind = clk_none;
1586 /* Same mask as real_lvalue_p. */
1587 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1589 tfrom = from;
1590 if ((gl_kind & clk_bitfield) != 0)
1591 tfrom = unlowered_expr_type (expr);
1593 /* Figure out whether or not the types are reference-related and
1594 reference compatible. We have to do this after stripping
1595 references from FROM. */
1596 related_p = reference_related_p (to, tfrom);
1597 /* If this is a C cast, first convert to an appropriately qualified
1598 type, so that we can later do a const_cast to the desired type. */
1599 if (related_p && c_cast_p
1600 && !at_least_as_qualified_p (to, tfrom))
1601 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1602 compatible_p = reference_compatible_p (to, tfrom);
1604 /* Directly bind reference when target expression's type is compatible with
1605 the reference and expression is an lvalue. In DR391, the wording in
1606 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1607 const and rvalue references to rvalues of compatible class type.
1608 We should also do direct bindings for non-class xvalues. */
1609 if ((related_p || compatible_p) && gl_kind)
1611 /* [dcl.init.ref]
1613 If the initializer expression
1615 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1616 is reference-compatible with "cv2 T2,"
1618 the reference is bound directly to the initializer expression
1619 lvalue.
1621 [...]
1622 If the initializer expression is an rvalue, with T2 a class type,
1623 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1624 is bound to the object represented by the rvalue or to a sub-object
1625 within that object. */
1627 conv = build_identity_conv (tfrom, expr);
1628 conv = direct_reference_binding (rto, conv);
1630 if (flags & LOOKUP_PREFER_RVALUE)
1631 /* The top-level caller requested that we pretend that the lvalue
1632 be treated as an rvalue. */
1633 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1634 else if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1635 /* Handle rvalue reference to function properly. */
1636 conv->rvaluedness_matches_p
1637 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1638 else
1639 conv->rvaluedness_matches_p
1640 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1642 if ((gl_kind & clk_bitfield) != 0
1643 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1644 /* For the purposes of overload resolution, we ignore the fact
1645 this expression is a bitfield or packed field. (In particular,
1646 [over.ics.ref] says specifically that a function with a
1647 non-const reference parameter is viable even if the
1648 argument is a bitfield.)
1650 However, when we actually call the function we must create
1651 a temporary to which to bind the reference. If the
1652 reference is volatile, or isn't const, then we cannot make
1653 a temporary, so we just issue an error when the conversion
1654 actually occurs. */
1655 conv->need_temporary_p = true;
1657 /* Don't allow binding of lvalues (other than function lvalues) to
1658 rvalue references. */
1659 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1660 && TREE_CODE (to) != FUNCTION_TYPE
1661 && !(flags & LOOKUP_PREFER_RVALUE))
1662 conv->bad_p = true;
1664 /* Nor the reverse. */
1665 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1666 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1667 || (flags & LOOKUP_NO_RVAL_BIND))
1668 && TREE_CODE (to) != FUNCTION_TYPE)
1669 conv->bad_p = true;
1671 if (!compatible_p)
1672 conv->bad_p = true;
1674 return conv;
1676 /* [class.conv.fct] A conversion function is never used to convert a
1677 (possibly cv-qualified) object to the (possibly cv-qualified) same
1678 object type (or a reference to it), to a (possibly cv-qualified) base
1679 class of that type (or a reference to it).... */
1680 else if (CLASS_TYPE_P (from) && !related_p
1681 && !(flags & LOOKUP_NO_CONVERSION))
1683 /* [dcl.init.ref]
1685 If the initializer expression
1687 -- has a class type (i.e., T2 is a class type) can be
1688 implicitly converted to an lvalue of type "cv3 T3," where
1689 "cv1 T1" is reference-compatible with "cv3 T3". (this
1690 conversion is selected by enumerating the applicable
1691 conversion functions (_over.match.ref_) and choosing the
1692 best one through overload resolution. (_over.match_).
1694 the reference is bound to the lvalue result of the conversion
1695 in the second case. */
1696 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1697 complain);
1698 if (cand)
1699 return cand->second_conv;
1702 /* From this point on, we conceptually need temporaries, even if we
1703 elide them. Only the cases above are "direct bindings". */
1704 if (flags & LOOKUP_NO_TEMP_BIND)
1705 return NULL;
1707 /* [over.ics.rank]
1709 When a parameter of reference type is not bound directly to an
1710 argument expression, the conversion sequence is the one required
1711 to convert the argument expression to the underlying type of the
1712 reference according to _over.best.ics_. Conceptually, this
1713 conversion sequence corresponds to copy-initializing a temporary
1714 of the underlying type with the argument expression. Any
1715 difference in top-level cv-qualification is subsumed by the
1716 initialization itself and does not constitute a conversion. */
1718 /* [dcl.init.ref]
1720 Otherwise, the reference shall be an lvalue reference to a
1721 non-volatile const type, or the reference shall be an rvalue
1722 reference.
1724 We try below to treat this as a bad conversion to improve diagnostics,
1725 but if TO is an incomplete class, we need to reject this conversion
1726 now to avoid unnecessary instantiation. */
1727 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1728 && !COMPLETE_TYPE_P (to))
1729 return NULL;
1731 /* We're generating a temporary now, but don't bind any more in the
1732 conversion (specifically, don't slice the temporary returned by a
1733 conversion operator). */
1734 flags |= LOOKUP_NO_TEMP_BIND;
1736 /* Core issue 899: When [copy-]initializing a temporary to be bound
1737 to the first parameter of a copy constructor (12.8) called with
1738 a single argument in the context of direct-initialization,
1739 explicit conversion functions are also considered.
1741 So don't set LOOKUP_ONLYCONVERTING in that case. */
1742 if (!(flags & LOOKUP_COPY_PARM))
1743 flags |= LOOKUP_ONLYCONVERTING;
1745 if (!conv)
1746 conv = implicit_conversion (to, from, expr, c_cast_p,
1747 flags, complain);
1748 if (!conv)
1749 return NULL;
1751 if (conv->user_conv_p)
1753 /* If initializing the temporary used a conversion function,
1754 recalculate the second conversion sequence. */
1755 for (conversion *t = conv; t; t = next_conversion (t))
1756 if (t->kind == ck_user
1757 && DECL_CONV_FN_P (t->cand->fn))
1759 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1760 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1761 conversion *new_second
1762 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1763 sflags, complain);
1764 if (!new_second)
1765 return NULL;
1766 return merge_conversion_sequences (t, new_second);
1770 conv = build_conv (ck_ref_bind, rto, conv);
1771 /* This reference binding, unlike those above, requires the
1772 creation of a temporary. */
1773 conv->need_temporary_p = true;
1774 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1776 /* [dcl.init.ref]
1778 Otherwise, the reference shall be an lvalue reference to a
1779 non-volatile const type, or the reference shall be an rvalue
1780 reference. */
1781 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1782 conv->bad_p = true;
1784 /* [dcl.init.ref]
1786 Otherwise, a temporary of type "cv1 T1" is created and
1787 initialized from the initializer expression using the rules for a
1788 non-reference copy initialization. If T1 is reference-related to
1789 T2, cv1 must be the same cv-qualification as, or greater
1790 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1791 if (related_p && !at_least_as_qualified_p (to, from))
1792 conv->bad_p = true;
1794 return conv;
1797 /* Returns the implicit conversion sequence (see [over.ics]) from type
1798 FROM to type TO. The optional expression EXPR may affect the
1799 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1800 true, this conversion is coming from a C-style cast. */
1802 static conversion *
1803 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1804 int flags, tsubst_flags_t complain)
1806 conversion *conv;
1808 if (from == error_mark_node || to == error_mark_node
1809 || expr == error_mark_node)
1810 return NULL;
1812 /* Other flags only apply to the primary function in overload
1813 resolution, or after we've chosen one. */
1814 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1815 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1816 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1818 /* FIXME: actually we don't want warnings either, but we can't just
1819 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1820 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1821 We really ought not to issue that warning until we've committed
1822 to that conversion. */
1823 complain &= ~tf_error;
1825 /* Call reshape_init early to remove redundant braces. */
1826 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1827 && CLASS_TYPE_P (to)
1828 && COMPLETE_TYPE_P (complete_type (to))
1829 && !CLASSTYPE_NON_AGGREGATE (to))
1831 expr = reshape_init (to, expr, complain);
1832 if (expr == error_mark_node)
1833 return NULL;
1834 from = TREE_TYPE (expr);
1837 if (TREE_CODE (to) == REFERENCE_TYPE)
1838 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1839 else
1840 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1842 if (conv)
1843 return conv;
1845 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1847 if (is_std_init_list (to))
1848 return build_list_conv (to, expr, flags, complain);
1850 /* As an extension, allow list-initialization of _Complex. */
1851 if (TREE_CODE (to) == COMPLEX_TYPE)
1853 conv = build_complex_conv (to, expr, flags, complain);
1854 if (conv)
1855 return conv;
1858 /* Allow conversion from an initializer-list with one element to a
1859 scalar type. */
1860 if (SCALAR_TYPE_P (to))
1862 int nelts = CONSTRUCTOR_NELTS (expr);
1863 tree elt;
1865 if (nelts == 0)
1866 elt = build_value_init (to, tf_none);
1867 else if (nelts == 1)
1868 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1869 else
1870 elt = error_mark_node;
1872 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1873 c_cast_p, flags, complain);
1874 if (conv)
1876 conv->check_narrowing = true;
1877 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1878 /* Too many levels of braces, i.e. '{{1}}'. */
1879 conv->bad_p = true;
1880 return conv;
1883 else if (TREE_CODE (to) == ARRAY_TYPE)
1884 return build_array_conv (to, expr, flags, complain);
1887 if (expr != NULL_TREE
1888 && (MAYBE_CLASS_TYPE_P (from)
1889 || MAYBE_CLASS_TYPE_P (to))
1890 && (flags & LOOKUP_NO_CONVERSION) == 0)
1892 struct z_candidate *cand;
1894 if (CLASS_TYPE_P (to)
1895 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1896 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1897 return build_aggr_conv (to, expr, flags, complain);
1899 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1900 if (cand)
1902 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1903 && CONSTRUCTOR_NELTS (expr) == 1
1904 && !is_list_ctor (cand->fn))
1906 /* "If C is not an initializer-list constructor and the
1907 initializer list has a single element of type cv U, where U is
1908 X or a class derived from X, the implicit conversion sequence
1909 has Exact Match rank if U is X, or Conversion rank if U is
1910 derived from X." */
1911 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1912 tree elttype = TREE_TYPE (elt);
1913 if (reference_related_p (to, elttype))
1914 return implicit_conversion (to, elttype, elt,
1915 c_cast_p, flags, complain);
1917 conv = cand->second_conv;
1920 /* We used to try to bind a reference to a temporary here, but that
1921 is now handled after the recursive call to this function at the end
1922 of reference_binding. */
1923 return conv;
1926 return NULL;
1929 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1930 functions. ARGS will not be changed until a single candidate is
1931 selected. */
1933 static struct z_candidate *
1934 add_candidate (struct z_candidate **candidates,
1935 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1936 size_t num_convs, conversion **convs,
1937 tree access_path, tree conversion_path,
1938 int viable, struct rejection_reason *reason,
1939 int flags)
1941 struct z_candidate *cand = (struct z_candidate *)
1942 conversion_obstack_alloc (sizeof (struct z_candidate));
1944 cand->fn = fn;
1945 cand->first_arg = first_arg;
1946 cand->args = args;
1947 cand->convs = convs;
1948 cand->num_convs = num_convs;
1949 cand->access_path = access_path;
1950 cand->conversion_path = conversion_path;
1951 cand->viable = viable;
1952 cand->reason = reason;
1953 cand->next = *candidates;
1954 cand->flags = flags;
1955 *candidates = cand;
1957 return cand;
1960 /* Return the number of remaining arguments in the parameter list
1961 beginning with ARG. */
1964 remaining_arguments (tree arg)
1966 int n;
1968 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1969 arg = TREE_CHAIN (arg))
1970 n++;
1972 return n;
1975 /* Create an overload candidate for the function or method FN called
1976 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1977 FLAGS is passed on to implicit_conversion.
1979 This does not change ARGS.
1981 CTYPE, if non-NULL, is the type we want to pretend this function
1982 comes from for purposes of overload resolution. */
1984 static struct z_candidate *
1985 add_function_candidate (struct z_candidate **candidates,
1986 tree fn, tree ctype, tree first_arg,
1987 const vec<tree, va_gc> *args, tree access_path,
1988 tree conversion_path, int flags,
1989 tsubst_flags_t complain)
1991 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1992 int i, len;
1993 conversion **convs;
1994 tree parmnode;
1995 tree orig_first_arg = first_arg;
1996 int skip;
1997 int viable = 1;
1998 struct rejection_reason *reason = NULL;
2000 /* At this point we should not see any functions which haven't been
2001 explicitly declared, except for friend functions which will have
2002 been found using argument dependent lookup. */
2003 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
2005 /* The `this', `in_chrg' and VTT arguments to constructors are not
2006 considered in overload resolution. */
2007 if (DECL_CONSTRUCTOR_P (fn))
2009 if (ctor_omit_inherited_parms (fn))
2010 /* Bring back parameters omitted from an inherited ctor. */
2011 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2012 else
2013 parmlist = skip_artificial_parms_for (fn, parmlist);
2014 skip = num_artificial_parms_for (fn);
2015 if (skip > 0 && first_arg != NULL_TREE)
2017 --skip;
2018 first_arg = NULL_TREE;
2021 else
2022 skip = 0;
2024 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2025 convs = alloc_conversions (len);
2027 /* 13.3.2 - Viable functions [over.match.viable]
2028 First, to be a viable function, a candidate function shall have enough
2029 parameters to agree in number with the arguments in the list.
2031 We need to check this first; otherwise, checking the ICSes might cause
2032 us to produce an ill-formed template instantiation. */
2034 parmnode = parmlist;
2035 for (i = 0; i < len; ++i)
2037 if (parmnode == NULL_TREE || parmnode == void_list_node)
2038 break;
2039 parmnode = TREE_CHAIN (parmnode);
2042 if ((i < len && parmnode)
2043 || !sufficient_parms_p (parmnode))
2045 int remaining = remaining_arguments (parmnode);
2046 viable = 0;
2047 reason = arity_rejection (first_arg, i + remaining, len);
2050 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2051 parameter of type "reference to cv C" (including such a constructor
2052 instantiated from a template) is excluded from the set of candidate
2053 functions when used to construct an object of type D with an argument list
2054 containing a single argument if C is reference-related to D. */
2055 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2056 && flag_new_inheriting_ctors
2057 && DECL_INHERITED_CTOR (fn))
2059 tree ptype = non_reference (TREE_VALUE (parmlist));
2060 tree dtype = DECL_CONTEXT (fn);
2061 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2062 if (reference_related_p (ptype, dtype)
2063 && reference_related_p (btype, ptype))
2065 viable = false;
2066 reason = inherited_ctor_rejection ();
2070 /* Second, for a function to be viable, its constraints must be
2071 satisfied. */
2072 if (flag_concepts && viable
2073 && !constraints_satisfied_p (fn))
2075 reason = constraint_failure (fn);
2076 viable = false;
2079 /* When looking for a function from a subobject from an implicit
2080 copy/move constructor/operator=, don't consider anything that takes (a
2081 reference to) an unrelated type. See c++/44909 and core 1092. */
2082 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2084 if (DECL_CONSTRUCTOR_P (fn))
2085 i = 1;
2086 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2087 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
2088 i = 2;
2089 else
2090 i = 0;
2091 if (i && len == i)
2093 parmnode = chain_index (i-1, parmlist);
2094 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2095 ctype))
2096 viable = 0;
2099 /* This only applies at the top level. */
2100 flags &= ~LOOKUP_DEFAULTED;
2103 if (! viable)
2104 goto out;
2106 /* Third, for F to be a viable function, there shall exist for each
2107 argument an implicit conversion sequence that converts that argument
2108 to the corresponding parameter of F. */
2110 parmnode = parmlist;
2112 for (i = 0; i < len; ++i)
2114 tree argtype, to_type;
2115 tree arg;
2116 conversion *t;
2117 int is_this;
2119 if (parmnode == void_list_node)
2120 break;
2122 if (i == 0 && first_arg != NULL_TREE)
2123 arg = first_arg;
2124 else
2125 arg = CONST_CAST_TREE (
2126 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2127 argtype = lvalue_type (arg);
2129 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2130 && ! DECL_CONSTRUCTOR_P (fn));
2132 if (parmnode)
2134 tree parmtype = TREE_VALUE (parmnode);
2135 int lflags = flags;
2137 parmnode = TREE_CHAIN (parmnode);
2139 /* The type of the implicit object parameter ('this') for
2140 overload resolution is not always the same as for the
2141 function itself; conversion functions are considered to
2142 be members of the class being converted, and functions
2143 introduced by a using-declaration are considered to be
2144 members of the class that uses them.
2146 Since build_over_call ignores the ICS for the `this'
2147 parameter, we can just change the parm type. */
2148 if (ctype && is_this)
2150 parmtype = cp_build_qualified_type
2151 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2152 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2154 /* If the function has a ref-qualifier, the implicit
2155 object parameter has reference type. */
2156 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2157 parmtype = cp_build_reference_type (parmtype, rv);
2158 /* The special handling of 'this' conversions in compare_ics
2159 does not apply if there is a ref-qualifier. */
2160 is_this = false;
2162 else
2164 parmtype = build_pointer_type (parmtype);
2165 arg = build_this (arg);
2166 argtype = lvalue_type (arg);
2170 /* Core issue 899: When [copy-]initializing a temporary to be bound
2171 to the first parameter of a copy constructor (12.8) called with
2172 a single argument in the context of direct-initialization,
2173 explicit conversion functions are also considered.
2175 So set LOOKUP_COPY_PARM to let reference_binding know that
2176 it's being called in that context. We generalize the above
2177 to handle move constructors and template constructors as well;
2178 the standardese should soon be updated similarly. */
2179 if (ctype && i == 0 && (len-skip == 1)
2180 && DECL_CONSTRUCTOR_P (fn)
2181 && parmtype != error_mark_node
2182 && (same_type_ignoring_top_level_qualifiers_p
2183 (non_reference (parmtype), ctype)))
2185 if (!(flags & LOOKUP_ONLYCONVERTING))
2186 lflags |= LOOKUP_COPY_PARM;
2187 /* We allow user-defined conversions within init-lists, but
2188 don't list-initialize the copy parm, as that would mean
2189 using two levels of braces for the same type. */
2190 if ((flags & LOOKUP_LIST_INIT_CTOR)
2191 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2192 lflags |= LOOKUP_NO_CONVERSION;
2194 else
2195 lflags |= LOOKUP_ONLYCONVERTING;
2197 t = implicit_conversion (parmtype, argtype, arg,
2198 /*c_cast_p=*/false, lflags, complain);
2199 to_type = parmtype;
2201 else
2203 t = build_identity_conv (argtype, arg);
2204 t->ellipsis_p = true;
2205 to_type = argtype;
2208 if (t && is_this)
2209 t->this_p = true;
2211 convs[i] = t;
2212 if (! t)
2214 viable = 0;
2215 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2216 break;
2219 if (t->bad_p)
2221 viable = -1;
2222 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2226 out:
2227 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2228 access_path, conversion_path, viable, reason, flags);
2231 /* Create an overload candidate for the conversion function FN which will
2232 be invoked for expression OBJ, producing a pointer-to-function which
2233 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2234 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2235 passed on to implicit_conversion.
2237 Actually, we don't really care about FN; we care about the type it
2238 converts to. There may be multiple conversion functions that will
2239 convert to that type, and we rely on build_user_type_conversion_1 to
2240 choose the best one; so when we create our candidate, we record the type
2241 instead of the function. */
2243 static struct z_candidate *
2244 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2245 const vec<tree, va_gc> *arglist,
2246 tree access_path, tree conversion_path,
2247 tsubst_flags_t complain)
2249 tree totype = TREE_TYPE (TREE_TYPE (fn));
2250 int i, len, viable, flags;
2251 tree parmlist, parmnode;
2252 conversion **convs;
2253 struct rejection_reason *reason;
2255 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2256 parmlist = TREE_TYPE (parmlist);
2257 parmlist = TYPE_ARG_TYPES (parmlist);
2259 len = vec_safe_length (arglist) + 1;
2260 convs = alloc_conversions (len);
2261 parmnode = parmlist;
2262 viable = 1;
2263 flags = LOOKUP_IMPLICIT;
2264 reason = NULL;
2266 /* Don't bother looking up the same type twice. */
2267 if (*candidates && (*candidates)->fn == totype)
2268 return NULL;
2270 for (i = 0; i < len; ++i)
2272 tree arg, argtype, convert_type = NULL_TREE;
2273 conversion *t;
2275 if (i == 0)
2276 arg = obj;
2277 else
2278 arg = (*arglist)[i - 1];
2279 argtype = lvalue_type (arg);
2281 if (i == 0)
2283 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2284 flags, complain);
2285 convert_type = totype;
2287 else if (parmnode == void_list_node)
2288 break;
2289 else if (parmnode)
2291 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2292 /*c_cast_p=*/false, flags, complain);
2293 convert_type = TREE_VALUE (parmnode);
2295 else
2297 t = build_identity_conv (argtype, arg);
2298 t->ellipsis_p = true;
2299 convert_type = argtype;
2302 convs[i] = t;
2303 if (! t)
2304 break;
2306 if (t->bad_p)
2308 viable = -1;
2309 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2312 if (i == 0)
2313 continue;
2315 if (parmnode)
2316 parmnode = TREE_CHAIN (parmnode);
2319 if (i < len
2320 || ! sufficient_parms_p (parmnode))
2322 int remaining = remaining_arguments (parmnode);
2323 viable = 0;
2324 reason = arity_rejection (NULL_TREE, i + remaining, len);
2327 return add_candidate (candidates, totype, obj, arglist, len, convs,
2328 access_path, conversion_path, viable, reason, flags);
2331 static void
2332 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2333 tree type1, tree type2, tree *args, tree *argtypes,
2334 int flags, tsubst_flags_t complain)
2336 conversion *t;
2337 conversion **convs;
2338 size_t num_convs;
2339 int viable = 1, i;
2340 tree types[2];
2341 struct rejection_reason *reason = NULL;
2343 types[0] = type1;
2344 types[1] = type2;
2346 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2347 convs = alloc_conversions (num_convs);
2349 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2350 conversion ops are allowed. We handle that here by just checking for
2351 boolean_type_node because other operators don't ask for it. COND_EXPR
2352 also does contextual conversion to bool for the first operand, but we
2353 handle that in build_conditional_expr, and type1 here is operand 2. */
2354 if (type1 != boolean_type_node)
2355 flags |= LOOKUP_ONLYCONVERTING;
2357 for (i = 0; i < 2; ++i)
2359 if (! args[i])
2360 break;
2362 t = implicit_conversion (types[i], argtypes[i], args[i],
2363 /*c_cast_p=*/false, flags, complain);
2364 if (! t)
2366 viable = 0;
2367 /* We need something for printing the candidate. */
2368 t = build_identity_conv (types[i], NULL_TREE);
2369 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2370 types[i]);
2372 else if (t->bad_p)
2374 viable = 0;
2375 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2376 types[i]);
2378 convs[i] = t;
2381 /* For COND_EXPR we rearranged the arguments; undo that now. */
2382 if (args[2])
2384 convs[2] = convs[1];
2385 convs[1] = convs[0];
2386 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2387 /*c_cast_p=*/false, flags,
2388 complain);
2389 if (t)
2390 convs[0] = t;
2391 else
2393 viable = 0;
2394 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2395 boolean_type_node);
2399 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2400 num_convs, convs,
2401 /*access_path=*/NULL_TREE,
2402 /*conversion_path=*/NULL_TREE,
2403 viable, reason, flags);
2406 static bool
2407 is_complete (tree t)
2409 return COMPLETE_TYPE_P (complete_type (t));
2412 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2414 static bool
2415 promoted_arithmetic_type_p (tree type)
2417 /* [over.built]
2419 In this section, the term promoted integral type is used to refer
2420 to those integral types which are preserved by integral promotion
2421 (including e.g. int and long but excluding e.g. char).
2422 Similarly, the term promoted arithmetic type refers to promoted
2423 integral types plus floating types. */
2424 return ((CP_INTEGRAL_TYPE_P (type)
2425 && same_type_p (type_promotes_to (type), type))
2426 || TREE_CODE (type) == REAL_TYPE);
2429 /* Create any builtin operator overload candidates for the operator in
2430 question given the converted operand types TYPE1 and TYPE2. The other
2431 args are passed through from add_builtin_candidates to
2432 build_builtin_candidate.
2434 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2435 If CODE is requires candidates operands of the same type of the kind
2436 of which TYPE1 and TYPE2 are, we add both candidates
2437 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2439 static void
2440 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2441 enum tree_code code2, tree fnname, tree type1,
2442 tree type2, tree *args, tree *argtypes, int flags,
2443 tsubst_flags_t complain)
2445 switch (code)
2447 case POSTINCREMENT_EXPR:
2448 case POSTDECREMENT_EXPR:
2449 args[1] = integer_zero_node;
2450 type2 = integer_type_node;
2451 break;
2452 default:
2453 break;
2456 switch (code)
2459 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2460 and VQ is either volatile or empty, there exist candidate operator
2461 functions of the form
2462 VQ T& operator++(VQ T&);
2463 T operator++(VQ T&, int);
2464 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2465 type other than bool, and VQ is either volatile or empty, there exist
2466 candidate operator functions of the form
2467 VQ T& operator--(VQ T&);
2468 T operator--(VQ T&, int);
2469 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2470 complete object type, and VQ is either volatile or empty, there exist
2471 candidate operator functions of the form
2472 T*VQ& operator++(T*VQ&);
2473 T*VQ& operator--(T*VQ&);
2474 T* operator++(T*VQ&, int);
2475 T* operator--(T*VQ&, int); */
2477 case POSTDECREMENT_EXPR:
2478 case PREDECREMENT_EXPR:
2479 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2480 return;
2481 /* FALLTHRU */
2482 case POSTINCREMENT_EXPR:
2483 case PREINCREMENT_EXPR:
2484 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2486 type1 = build_reference_type (type1);
2487 break;
2489 return;
2491 /* 7 For every cv-qualified or cv-unqualified object type T, there
2492 exist candidate operator functions of the form
2494 T& operator*(T*);
2496 8 For every function type T, there exist candidate operator functions of
2497 the form
2498 T& operator*(T*); */
2500 case INDIRECT_REF:
2501 if (TYPE_PTR_P (type1)
2502 && (TYPE_PTROB_P (type1)
2503 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2504 break;
2505 return;
2507 /* 9 For every type T, there exist candidate operator functions of the form
2508 T* operator+(T*);
2510 10For every promoted arithmetic type T, there exist candidate operator
2511 functions of the form
2512 T operator+(T);
2513 T operator-(T); */
2515 case UNARY_PLUS_EXPR: /* unary + */
2516 if (TYPE_PTR_P (type1))
2517 break;
2518 /* FALLTHRU */
2519 case NEGATE_EXPR:
2520 if (ARITHMETIC_TYPE_P (type1))
2521 break;
2522 return;
2524 /* 11For every promoted integral type T, there exist candidate operator
2525 functions of the form
2526 T operator~(T); */
2528 case BIT_NOT_EXPR:
2529 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2530 break;
2531 return;
2533 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2534 is the same type as C2 or is a derived class of C2, T is a complete
2535 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2536 there exist candidate operator functions of the form
2537 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2538 where CV12 is the union of CV1 and CV2. */
2540 case MEMBER_REF:
2541 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2543 tree c1 = TREE_TYPE (type1);
2544 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2546 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2547 && (TYPE_PTRMEMFUNC_P (type2)
2548 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2549 break;
2551 return;
2553 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2554 didate operator functions of the form
2555 LR operator*(L, R);
2556 LR operator/(L, R);
2557 LR operator+(L, R);
2558 LR operator-(L, R);
2559 bool operator<(L, R);
2560 bool operator>(L, R);
2561 bool operator<=(L, R);
2562 bool operator>=(L, R);
2563 bool operator==(L, R);
2564 bool operator!=(L, R);
2565 where LR is the result of the usual arithmetic conversions between
2566 types L and R.
2568 14For every pair of types T and I, where T is a cv-qualified or cv-
2569 unqualified complete object type and I is a promoted integral type,
2570 there exist candidate operator functions of the form
2571 T* operator+(T*, I);
2572 T& operator[](T*, I);
2573 T* operator-(T*, I);
2574 T* operator+(I, T*);
2575 T& operator[](I, T*);
2577 15For every T, where T is a pointer to complete object type, there exist
2578 candidate operator functions of the form112)
2579 ptrdiff_t operator-(T, T);
2581 16For every pointer or enumeration type T, there exist candidate operator
2582 functions of the form
2583 bool operator<(T, T);
2584 bool operator>(T, T);
2585 bool operator<=(T, T);
2586 bool operator>=(T, T);
2587 bool operator==(T, T);
2588 bool operator!=(T, T);
2590 17For every pointer to member type T, there exist candidate operator
2591 functions of the form
2592 bool operator==(T, T);
2593 bool operator!=(T, T); */
2595 case MINUS_EXPR:
2596 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2597 break;
2598 if (TYPE_PTROB_P (type1)
2599 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2601 type2 = ptrdiff_type_node;
2602 break;
2604 /* FALLTHRU */
2605 case MULT_EXPR:
2606 case TRUNC_DIV_EXPR:
2607 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2608 break;
2609 return;
2611 case EQ_EXPR:
2612 case NE_EXPR:
2613 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2614 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2615 break;
2616 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2618 type2 = type1;
2619 break;
2621 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2623 type1 = type2;
2624 break;
2626 /* Fall through. */
2627 case LT_EXPR:
2628 case GT_EXPR:
2629 case LE_EXPR:
2630 case GE_EXPR:
2631 case MAX_EXPR:
2632 case MIN_EXPR:
2633 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2634 break;
2635 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2636 break;
2637 if (TREE_CODE (type1) == ENUMERAL_TYPE
2638 && TREE_CODE (type2) == ENUMERAL_TYPE)
2639 break;
2640 if (TYPE_PTR_P (type1)
2641 && null_ptr_cst_p (args[1]))
2643 type2 = type1;
2644 break;
2646 if (null_ptr_cst_p (args[0])
2647 && TYPE_PTR_P (type2))
2649 type1 = type2;
2650 break;
2652 return;
2654 case PLUS_EXPR:
2655 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2656 break;
2657 /* FALLTHRU */
2658 case ARRAY_REF:
2659 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2661 type1 = ptrdiff_type_node;
2662 break;
2664 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2666 type2 = ptrdiff_type_node;
2667 break;
2669 return;
2671 /* 18For every pair of promoted integral types L and R, there exist candi-
2672 date operator functions of the form
2673 LR operator%(L, R);
2674 LR operator&(L, R);
2675 LR operator^(L, R);
2676 LR operator|(L, R);
2677 L operator<<(L, R);
2678 L operator>>(L, R);
2679 where LR is the result of the usual arithmetic conversions between
2680 types L and R. */
2682 case TRUNC_MOD_EXPR:
2683 case BIT_AND_EXPR:
2684 case BIT_IOR_EXPR:
2685 case BIT_XOR_EXPR:
2686 case LSHIFT_EXPR:
2687 case RSHIFT_EXPR:
2688 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2689 break;
2690 return;
2692 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2693 type, VQ is either volatile or empty, and R is a promoted arithmetic
2694 type, there exist candidate operator functions of the form
2695 VQ L& operator=(VQ L&, R);
2696 VQ L& operator*=(VQ L&, R);
2697 VQ L& operator/=(VQ L&, R);
2698 VQ L& operator+=(VQ L&, R);
2699 VQ L& operator-=(VQ L&, R);
2701 20For every pair T, VQ), where T is any type and VQ is either volatile
2702 or empty, there exist candidate operator functions of the form
2703 T*VQ& operator=(T*VQ&, T*);
2705 21For every pair T, VQ), where T is a pointer to member type and VQ is
2706 either volatile or empty, there exist candidate operator functions of
2707 the form
2708 VQ T& operator=(VQ T&, T);
2710 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2711 unqualified complete object type, VQ is either volatile or empty, and
2712 I is a promoted integral type, there exist candidate operator func-
2713 tions of the form
2714 T*VQ& operator+=(T*VQ&, I);
2715 T*VQ& operator-=(T*VQ&, I);
2717 23For every triple L, VQ, R), where L is an integral or enumeration
2718 type, VQ is either volatile or empty, and R is a promoted integral
2719 type, there exist candidate operator functions of the form
2721 VQ L& operator%=(VQ L&, R);
2722 VQ L& operator<<=(VQ L&, R);
2723 VQ L& operator>>=(VQ L&, R);
2724 VQ L& operator&=(VQ L&, R);
2725 VQ L& operator^=(VQ L&, R);
2726 VQ L& operator|=(VQ L&, R); */
2728 case MODIFY_EXPR:
2729 switch (code2)
2731 case PLUS_EXPR:
2732 case MINUS_EXPR:
2733 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2735 type2 = ptrdiff_type_node;
2736 break;
2738 /* FALLTHRU */
2739 case MULT_EXPR:
2740 case TRUNC_DIV_EXPR:
2741 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2742 break;
2743 return;
2745 case TRUNC_MOD_EXPR:
2746 case BIT_AND_EXPR:
2747 case BIT_IOR_EXPR:
2748 case BIT_XOR_EXPR:
2749 case LSHIFT_EXPR:
2750 case RSHIFT_EXPR:
2751 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2752 break;
2753 return;
2755 case NOP_EXPR:
2756 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2757 break;
2758 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2759 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2760 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2761 || ((TYPE_PTRMEMFUNC_P (type1)
2762 || TYPE_PTR_P (type1))
2763 && null_ptr_cst_p (args[1])))
2765 type2 = type1;
2766 break;
2768 return;
2770 default:
2771 gcc_unreachable ();
2773 type1 = build_reference_type (type1);
2774 break;
2776 case COND_EXPR:
2777 /* [over.built]
2779 For every pair of promoted arithmetic types L and R, there
2780 exist candidate operator functions of the form
2782 LR operator?(bool, L, R);
2784 where LR is the result of the usual arithmetic conversions
2785 between types L and R.
2787 For every type T, where T is a pointer or pointer-to-member
2788 type, there exist candidate operator functions of the form T
2789 operator?(bool, T, T); */
2791 if (promoted_arithmetic_type_p (type1)
2792 && promoted_arithmetic_type_p (type2))
2793 /* That's OK. */
2794 break;
2796 /* Otherwise, the types should be pointers. */
2797 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2798 return;
2800 /* We don't check that the two types are the same; the logic
2801 below will actually create two candidates; one in which both
2802 parameter types are TYPE1, and one in which both parameter
2803 types are TYPE2. */
2804 break;
2806 case REALPART_EXPR:
2807 case IMAGPART_EXPR:
2808 if (ARITHMETIC_TYPE_P (type1))
2809 break;
2810 return;
2812 default:
2813 gcc_unreachable ();
2816 /* Make sure we don't create builtin candidates with dependent types. */
2817 bool u1 = uses_template_parms (type1);
2818 bool u2 = type2 ? uses_template_parms (type2) : false;
2819 if (u1 || u2)
2821 /* Try to recover if one of the types is non-dependent. But if
2822 there's only one type, there's nothing we can do. */
2823 if (!type2)
2824 return;
2825 /* And we lose if both are dependent. */
2826 if (u1 && u2)
2827 return;
2828 /* Or if they have different forms. */
2829 if (TREE_CODE (type1) != TREE_CODE (type2))
2830 return;
2832 if (u1 && !u2)
2833 type1 = type2;
2834 else if (u2 && !u1)
2835 type2 = type1;
2838 /* If we're dealing with two pointer types or two enumeral types,
2839 we need candidates for both of them. */
2840 if (type2 && !same_type_p (type1, type2)
2841 && TREE_CODE (type1) == TREE_CODE (type2)
2842 && (TREE_CODE (type1) == REFERENCE_TYPE
2843 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2844 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2845 || TYPE_PTRMEMFUNC_P (type1)
2846 || MAYBE_CLASS_TYPE_P (type1)
2847 || TREE_CODE (type1) == ENUMERAL_TYPE))
2849 if (TYPE_PTR_OR_PTRMEM_P (type1))
2851 tree cptype = composite_pointer_type (type1, type2,
2852 error_mark_node,
2853 error_mark_node,
2854 CPO_CONVERSION,
2855 tf_none);
2856 if (cptype != error_mark_node)
2858 build_builtin_candidate
2859 (candidates, fnname, cptype, cptype, args, argtypes,
2860 flags, complain);
2861 return;
2865 build_builtin_candidate
2866 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2867 build_builtin_candidate
2868 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2869 return;
2872 build_builtin_candidate
2873 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2876 tree
2877 type_decays_to (tree type)
2879 if (TREE_CODE (type) == ARRAY_TYPE)
2880 return build_pointer_type (TREE_TYPE (type));
2881 if (TREE_CODE (type) == FUNCTION_TYPE)
2882 return build_pointer_type (type);
2883 return type;
2886 /* There are three conditions of builtin candidates:
2888 1) bool-taking candidates. These are the same regardless of the input.
2889 2) pointer-pair taking candidates. These are generated for each type
2890 one of the input types converts to.
2891 3) arithmetic candidates. According to the standard, we should generate
2892 all of these, but I'm trying not to...
2894 Here we generate a superset of the possible candidates for this particular
2895 case. That is a subset of the full set the standard defines, plus some
2896 other cases which the standard disallows. add_builtin_candidate will
2897 filter out the invalid set. */
2899 static void
2900 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2901 enum tree_code code2, tree fnname, tree *args,
2902 int flags, tsubst_flags_t complain)
2904 int ref1, i;
2905 int enum_p = 0;
2906 tree type, argtypes[3], t;
2907 /* TYPES[i] is the set of possible builtin-operator parameter types
2908 we will consider for the Ith argument. */
2909 vec<tree, va_gc> *types[2];
2910 unsigned ix;
2912 for (i = 0; i < 3; ++i)
2914 if (args[i])
2915 argtypes[i] = unlowered_expr_type (args[i]);
2916 else
2917 argtypes[i] = NULL_TREE;
2920 switch (code)
2922 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2923 and VQ is either volatile or empty, there exist candidate operator
2924 functions of the form
2925 VQ T& operator++(VQ T&); */
2927 case POSTINCREMENT_EXPR:
2928 case PREINCREMENT_EXPR:
2929 case POSTDECREMENT_EXPR:
2930 case PREDECREMENT_EXPR:
2931 case MODIFY_EXPR:
2932 ref1 = 1;
2933 break;
2935 /* 24There also exist candidate operator functions of the form
2936 bool operator!(bool);
2937 bool operator&&(bool, bool);
2938 bool operator||(bool, bool); */
2940 case TRUTH_NOT_EXPR:
2941 build_builtin_candidate
2942 (candidates, fnname, boolean_type_node,
2943 NULL_TREE, args, argtypes, flags, complain);
2944 return;
2946 case TRUTH_ORIF_EXPR:
2947 case TRUTH_ANDIF_EXPR:
2948 build_builtin_candidate
2949 (candidates, fnname, boolean_type_node,
2950 boolean_type_node, args, argtypes, flags, complain);
2951 return;
2953 case ADDR_EXPR:
2954 case COMPOUND_EXPR:
2955 case COMPONENT_REF:
2956 return;
2958 case COND_EXPR:
2959 case EQ_EXPR:
2960 case NE_EXPR:
2961 case LT_EXPR:
2962 case LE_EXPR:
2963 case GT_EXPR:
2964 case GE_EXPR:
2965 enum_p = 1;
2966 /* Fall through. */
2968 default:
2969 ref1 = 0;
2972 types[0] = make_tree_vector ();
2973 types[1] = make_tree_vector ();
2975 for (i = 0; i < 2; ++i)
2977 if (! args[i])
2979 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2981 tree convs;
2983 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2984 return;
2986 convs = lookup_conversions (argtypes[i]);
2988 if (code == COND_EXPR)
2990 if (lvalue_p (args[i]))
2991 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2993 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2996 else if (! convs)
2997 return;
2999 for (; convs; convs = TREE_CHAIN (convs))
3001 type = TREE_TYPE (convs);
3003 if (i == 0 && ref1
3004 && (TREE_CODE (type) != REFERENCE_TYPE
3005 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3006 continue;
3008 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3009 vec_safe_push (types[i], type);
3011 type = non_reference (type);
3012 if (i != 0 || ! ref1)
3014 type = cv_unqualified (type_decays_to (type));
3015 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3016 vec_safe_push (types[i], type);
3017 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3018 type = type_promotes_to (type);
3021 if (! vec_member (type, types[i]))
3022 vec_safe_push (types[i], type);
3025 else
3027 if (code == COND_EXPR && lvalue_p (args[i]))
3028 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3029 type = non_reference (argtypes[i]);
3030 if (i != 0 || ! ref1)
3032 type = cv_unqualified (type_decays_to (type));
3033 if (enum_p && UNSCOPED_ENUM_P (type))
3034 vec_safe_push (types[i], type);
3035 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3036 type = type_promotes_to (type);
3038 vec_safe_push (types[i], type);
3042 /* Run through the possible parameter types of both arguments,
3043 creating candidates with those parameter types. */
3044 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3046 unsigned jx;
3047 tree u;
3049 if (!types[1]->is_empty ())
3050 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3051 add_builtin_candidate
3052 (candidates, code, code2, fnname, t,
3053 u, args, argtypes, flags, complain);
3054 else
3055 add_builtin_candidate
3056 (candidates, code, code2, fnname, t,
3057 NULL_TREE, args, argtypes, flags, complain);
3060 release_tree_vector (types[0]);
3061 release_tree_vector (types[1]);
3065 /* If TMPL can be successfully instantiated as indicated by
3066 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3068 TMPL is the template. EXPLICIT_TARGS are any explicit template
3069 arguments. ARGLIST is the arguments provided at the call-site.
3070 This does not change ARGLIST. The RETURN_TYPE is the desired type
3071 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3072 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3073 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3075 static struct z_candidate*
3076 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3077 tree ctype, tree explicit_targs, tree first_arg,
3078 const vec<tree, va_gc> *arglist, tree return_type,
3079 tree access_path, tree conversion_path,
3080 int flags, tree obj, unification_kind_t strict,
3081 tsubst_flags_t complain)
3083 int ntparms = DECL_NTPARMS (tmpl);
3084 tree targs = make_tree_vec (ntparms);
3085 unsigned int len = vec_safe_length (arglist);
3086 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3087 unsigned int skip_without_in_chrg = 0;
3088 tree first_arg_without_in_chrg = first_arg;
3089 tree *args_without_in_chrg;
3090 unsigned int nargs_without_in_chrg;
3091 unsigned int ia, ix;
3092 tree arg;
3093 struct z_candidate *cand;
3094 tree fn;
3095 struct rejection_reason *reason = NULL;
3096 int errs;
3098 /* We don't do deduction on the in-charge parameter, the VTT
3099 parameter or 'this'. */
3100 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3102 if (first_arg_without_in_chrg != NULL_TREE)
3103 first_arg_without_in_chrg = NULL_TREE;
3104 else if (return_type && strict == DEDUCE_CALL)
3105 /* We're deducing for a call to the result of a template conversion
3106 function, so the args don't contain 'this'; leave them alone. */;
3107 else
3108 ++skip_without_in_chrg;
3111 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3112 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3113 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3115 if (first_arg_without_in_chrg != NULL_TREE)
3116 first_arg_without_in_chrg = NULL_TREE;
3117 else
3118 ++skip_without_in_chrg;
3121 if (len < skip_without_in_chrg)
3122 return NULL;
3124 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3125 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3126 TREE_TYPE ((*arglist)[0])))
3128 /* 12.8/6 says, "A declaration of a constructor for a class X is
3129 ill-formed if its first parameter is of type (optionally cv-qualified)
3130 X and either there are no other parameters or else all other
3131 parameters have default arguments. A member function template is never
3132 instantiated to produce such a constructor signature."
3134 So if we're trying to copy an object of the containing class, don't
3135 consider a template constructor that has a first parameter type that
3136 is just a template parameter, as we would deduce a signature that we
3137 would then reject in the code below. */
3138 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3140 firstparm = TREE_VALUE (firstparm);
3141 if (PACK_EXPANSION_P (firstparm))
3142 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3143 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3145 gcc_assert (!explicit_targs);
3146 reason = invalid_copy_with_fn_template_rejection ();
3147 goto fail;
3152 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3153 + (len - skip_without_in_chrg));
3154 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3155 ia = 0;
3156 if (first_arg_without_in_chrg != NULL_TREE)
3158 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3159 ++ia;
3161 for (ix = skip_without_in_chrg;
3162 vec_safe_iterate (arglist, ix, &arg);
3163 ++ix)
3165 args_without_in_chrg[ia] = arg;
3166 ++ia;
3168 gcc_assert (ia == nargs_without_in_chrg);
3170 errs = errorcount+sorrycount;
3171 fn = fn_type_unification (tmpl, explicit_targs, targs,
3172 args_without_in_chrg,
3173 nargs_without_in_chrg,
3174 return_type, strict, flags, false,
3175 complain & tf_decltype);
3177 if (fn == error_mark_node)
3179 /* Don't repeat unification later if it already resulted in errors. */
3180 if (errorcount+sorrycount == errs)
3181 reason = template_unification_rejection (tmpl, explicit_targs,
3182 targs, args_without_in_chrg,
3183 nargs_without_in_chrg,
3184 return_type, strict, flags);
3185 else
3186 reason = template_unification_error_rejection ();
3187 goto fail;
3190 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3192 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3193 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3194 ctype))
3196 /* We're trying to produce a constructor with a prohibited signature,
3197 as discussed above; handle here any cases we didn't catch then,
3198 such as X(X<T>). */
3199 reason = invalid_copy_with_fn_template_rejection ();
3200 goto fail;
3204 if (obj != NULL_TREE)
3205 /* Aha, this is a conversion function. */
3206 cand = add_conv_candidate (candidates, fn, obj, arglist,
3207 access_path, conversion_path, complain);
3208 else
3209 cand = add_function_candidate (candidates, fn, ctype,
3210 first_arg, arglist, access_path,
3211 conversion_path, flags, complain);
3212 if (DECL_TI_TEMPLATE (fn) != tmpl)
3213 /* This situation can occur if a member template of a template
3214 class is specialized. Then, instantiate_template might return
3215 an instantiation of the specialization, in which case the
3216 DECL_TI_TEMPLATE field will point at the original
3217 specialization. For example:
3219 template <class T> struct S { template <class U> void f(U);
3220 template <> void f(int) {}; };
3221 S<double> sd;
3222 sd.f(3);
3224 Here, TMPL will be template <class U> S<double>::f(U).
3225 And, instantiate template will give us the specialization
3226 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3227 for this will point at template <class T> template <> S<T>::f(int),
3228 so that we can find the definition. For the purposes of
3229 overload resolution, however, we want the original TMPL. */
3230 cand->template_decl = build_template_info (tmpl, targs);
3231 else
3232 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3233 cand->explicit_targs = explicit_targs;
3235 return cand;
3236 fail:
3237 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3238 access_path, conversion_path, 0, reason, flags);
3242 static struct z_candidate *
3243 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3244 tree explicit_targs, tree first_arg,
3245 const vec<tree, va_gc> *arglist, tree return_type,
3246 tree access_path, tree conversion_path, int flags,
3247 unification_kind_t strict, tsubst_flags_t complain)
3249 return
3250 add_template_candidate_real (candidates, tmpl, ctype,
3251 explicit_targs, first_arg, arglist,
3252 return_type, access_path, conversion_path,
3253 flags, NULL_TREE, strict, complain);
3256 /* Create an overload candidate for the conversion function template TMPL,
3257 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3258 pointer-to-function which will in turn be called with the argument list
3259 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3260 passed on to implicit_conversion. */
3262 static struct z_candidate *
3263 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3264 tree obj,
3265 const vec<tree, va_gc> *arglist,
3266 tree return_type, tree access_path,
3267 tree conversion_path, tsubst_flags_t complain)
3269 /* Making this work broke PR 71117, so until the committee resolves core
3270 issue 2189, let's disable this candidate if there are any viable call
3271 operators. */
3272 if (any_strictly_viable (*candidates))
3273 return NULL;
3275 return
3276 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3277 NULL_TREE, arglist, return_type, access_path,
3278 conversion_path, 0, obj, DEDUCE_CALL,
3279 complain);
3282 /* The CANDS are the set of candidates that were considered for
3283 overload resolution. Return the set of viable candidates, or CANDS
3284 if none are viable. If any of the candidates were viable, set
3285 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3286 considered viable only if it is strictly viable. */
3288 static struct z_candidate*
3289 splice_viable (struct z_candidate *cands,
3290 bool strict_p,
3291 bool *any_viable_p)
3293 struct z_candidate *viable;
3294 struct z_candidate **last_viable;
3295 struct z_candidate **cand;
3296 bool found_strictly_viable = false;
3298 /* Be strict inside templates, since build_over_call won't actually
3299 do the conversions to get pedwarns. */
3300 if (processing_template_decl)
3301 strict_p = true;
3303 viable = NULL;
3304 last_viable = &viable;
3305 *any_viable_p = false;
3307 cand = &cands;
3308 while (*cand)
3310 struct z_candidate *c = *cand;
3311 if (!strict_p
3312 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3314 /* Be strict in the presence of a viable candidate. Also if
3315 there are template candidates, so that we get deduction errors
3316 for them instead of silently preferring a bad conversion. */
3317 strict_p = true;
3318 if (viable && !found_strictly_viable)
3320 /* Put any spliced near matches back onto the main list so
3321 that we see them if there is no strict match. */
3322 *any_viable_p = false;
3323 *last_viable = cands;
3324 cands = viable;
3325 viable = NULL;
3326 last_viable = &viable;
3330 if (strict_p ? c->viable == 1 : c->viable)
3332 *last_viable = c;
3333 *cand = c->next;
3334 c->next = NULL;
3335 last_viable = &c->next;
3336 *any_viable_p = true;
3337 if (c->viable == 1)
3338 found_strictly_viable = true;
3340 else
3341 cand = &c->next;
3344 return viable ? viable : cands;
3347 static bool
3348 any_strictly_viable (struct z_candidate *cands)
3350 for (; cands; cands = cands->next)
3351 if (cands->viable == 1)
3352 return true;
3353 return false;
3356 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3357 words, it is about to become the "this" pointer for a member
3358 function call. Take the address of the object. */
3360 static tree
3361 build_this (tree obj)
3363 /* In a template, we are only concerned about the type of the
3364 expression, so we can take a shortcut. */
3365 if (processing_template_decl)
3366 return build_address (obj);
3368 return cp_build_addr_expr (obj, tf_warning_or_error);
3371 /* Returns true iff functions are equivalent. Equivalent functions are
3372 not '==' only if one is a function-local extern function or if
3373 both are extern "C". */
3375 static inline int
3376 equal_functions (tree fn1, tree fn2)
3378 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3379 return 0;
3380 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3381 return fn1 == fn2;
3382 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3383 || DECL_EXTERN_C_FUNCTION_P (fn1))
3384 return decls_match (fn1, fn2);
3385 return fn1 == fn2;
3388 /* Print information about a candidate being rejected due to INFO. */
3390 static void
3391 print_conversion_rejection (location_t loc, struct conversion_info *info)
3393 tree from = info->from;
3394 if (!TYPE_P (from))
3395 from = lvalue_type (from);
3396 if (info->n_arg == -1)
3398 /* Conversion of implicit `this' argument failed. */
3399 if (!TYPE_P (info->from))
3400 /* A bad conversion for 'this' must be discarding cv-quals. */
3401 inform (loc, " passing %qT as %<this%> "
3402 "argument discards qualifiers",
3403 from);
3404 else
3405 inform (loc, " no known conversion for implicit "
3406 "%<this%> parameter from %qH to %qI",
3407 from, info->to_type);
3409 else if (!TYPE_P (info->from))
3411 if (info->n_arg >= 0)
3412 inform (loc, " conversion of argument %d would be ill-formed:",
3413 info->n_arg + 1);
3414 perform_implicit_conversion (info->to_type, info->from,
3415 tf_warning_or_error);
3417 else if (info->n_arg == -2)
3418 /* Conversion of conversion function return value failed. */
3419 inform (loc, " no known conversion from %qH to %qI",
3420 from, info->to_type);
3421 else
3422 inform (loc, " no known conversion for argument %d from %qH to %qI",
3423 info->n_arg + 1, from, info->to_type);
3426 /* Print information about a candidate with WANT parameters and we found
3427 HAVE. */
3429 static void
3430 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3432 inform_n (loc, want,
3433 " candidate expects %d argument, %d provided",
3434 " candidate expects %d arguments, %d provided",
3435 want, have);
3438 /* Print information about one overload candidate CANDIDATE. MSGSTR
3439 is the text to print before the candidate itself.
3441 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3442 to have been run through gettext by the caller. This wart makes
3443 life simpler in print_z_candidates and for the translators. */
3445 static void
3446 print_z_candidate (location_t loc, const char *msgstr,
3447 struct z_candidate *candidate)
3449 const char *msg = (msgstr == NULL
3450 ? ""
3451 : ACONCAT ((msgstr, " ", NULL)));
3452 tree fn = candidate->fn;
3453 if (flag_new_inheriting_ctors)
3454 fn = strip_inheriting_ctors (fn);
3455 location_t cloc = location_of (fn);
3457 if (identifier_p (fn))
3459 cloc = loc;
3460 if (candidate->num_convs == 3)
3461 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3462 candidate->convs[0]->type,
3463 candidate->convs[1]->type,
3464 candidate->convs[2]->type);
3465 else if (candidate->num_convs == 2)
3466 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3467 candidate->convs[0]->type,
3468 candidate->convs[1]->type);
3469 else
3470 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3471 candidate->convs[0]->type);
3473 else if (TYPE_P (fn))
3474 inform (cloc, "%s%qT <conversion>", msg, fn);
3475 else if (candidate->viable == -1)
3476 inform (cloc, "%s%#qD <near match>", msg, fn);
3477 else if (DECL_DELETED_FN (fn))
3478 inform (cloc, "%s%#qD <deleted>", msg, fn);
3479 else
3480 inform (cloc, "%s%#qD", msg, fn);
3481 if (fn != candidate->fn)
3483 cloc = location_of (candidate->fn);
3484 inform (cloc, " inherited here");
3486 /* Give the user some information about why this candidate failed. */
3487 if (candidate->reason != NULL)
3489 struct rejection_reason *r = candidate->reason;
3491 switch (r->code)
3493 case rr_arity:
3494 print_arity_information (cloc, r->u.arity.actual,
3495 r->u.arity.expected);
3496 break;
3497 case rr_arg_conversion:
3498 print_conversion_rejection (cloc, &r->u.conversion);
3499 break;
3500 case rr_bad_arg_conversion:
3501 print_conversion_rejection (cloc, &r->u.bad_conversion);
3502 break;
3503 case rr_explicit_conversion:
3504 inform (cloc, " return type %qT of explicit conversion function "
3505 "cannot be converted to %qT with a qualification "
3506 "conversion", r->u.conversion.from,
3507 r->u.conversion.to_type);
3508 break;
3509 case rr_template_conversion:
3510 inform (cloc, " conversion from return type %qT of template "
3511 "conversion function specialization to %qT is not an "
3512 "exact match", r->u.conversion.from,
3513 r->u.conversion.to_type);
3514 break;
3515 case rr_template_unification:
3516 /* We use template_unification_error_rejection if unification caused
3517 actual non-SFINAE errors, in which case we don't need to repeat
3518 them here. */
3519 if (r->u.template_unification.tmpl == NULL_TREE)
3521 inform (cloc, " substitution of deduced template arguments "
3522 "resulted in errors seen above");
3523 break;
3525 /* Re-run template unification with diagnostics. */
3526 inform (cloc, " template argument deduction/substitution failed:");
3527 fn_type_unification (r->u.template_unification.tmpl,
3528 r->u.template_unification.explicit_targs,
3529 (make_tree_vec
3530 (r->u.template_unification.num_targs)),
3531 r->u.template_unification.args,
3532 r->u.template_unification.nargs,
3533 r->u.template_unification.return_type,
3534 r->u.template_unification.strict,
3535 r->u.template_unification.flags,
3536 true, false);
3537 break;
3538 case rr_invalid_copy:
3539 inform (cloc,
3540 " a constructor taking a single argument of its own "
3541 "class type is invalid");
3542 break;
3543 case rr_constraint_failure:
3545 tree tmpl = r->u.template_instantiation.tmpl;
3546 tree args = r->u.template_instantiation.targs;
3547 diagnose_constraints (cloc, tmpl, args);
3549 break;
3550 case rr_inherited_ctor:
3551 inform (cloc, " an inherited constructor is not a candidate for "
3552 "initialization from an expression of the same or derived "
3553 "type");
3554 break;
3555 case rr_none:
3556 default:
3557 /* This candidate didn't have any issues or we failed to
3558 handle a particular code. Either way... */
3559 gcc_unreachable ();
3564 static void
3565 print_z_candidates (location_t loc, struct z_candidate *candidates)
3567 struct z_candidate *cand1;
3568 struct z_candidate **cand2;
3570 if (!candidates)
3571 return;
3573 /* Remove non-viable deleted candidates. */
3574 cand1 = candidates;
3575 for (cand2 = &cand1; *cand2; )
3577 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3578 && !(*cand2)->viable
3579 && DECL_DELETED_FN ((*cand2)->fn))
3580 *cand2 = (*cand2)->next;
3581 else
3582 cand2 = &(*cand2)->next;
3584 /* ...if there are any non-deleted ones. */
3585 if (cand1)
3586 candidates = cand1;
3588 /* There may be duplicates in the set of candidates. We put off
3589 checking this condition as long as possible, since we have no way
3590 to eliminate duplicates from a set of functions in less than n^2
3591 time. Now we are about to emit an error message, so it is more
3592 permissible to go slowly. */
3593 for (cand1 = candidates; cand1; cand1 = cand1->next)
3595 tree fn = cand1->fn;
3596 /* Skip builtin candidates and conversion functions. */
3597 if (!DECL_P (fn))
3598 continue;
3599 cand2 = &cand1->next;
3600 while (*cand2)
3602 if (DECL_P ((*cand2)->fn)
3603 && equal_functions (fn, (*cand2)->fn))
3604 *cand2 = (*cand2)->next;
3605 else
3606 cand2 = &(*cand2)->next;
3610 for (; candidates; candidates = candidates->next)
3611 print_z_candidate (loc, "candidate:", candidates);
3614 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3615 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3616 the result of the conversion function to convert it to the final
3617 desired type. Merge the two sequences into a single sequence,
3618 and return the merged sequence. */
3620 static conversion *
3621 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3623 conversion **t;
3624 bool bad = user_seq->bad_p;
3626 gcc_assert (user_seq->kind == ck_user);
3628 /* Find the end of the second conversion sequence. */
3629 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3631 /* The entire sequence is a user-conversion sequence. */
3632 (*t)->user_conv_p = true;
3633 if (bad)
3634 (*t)->bad_p = true;
3637 /* Replace the identity conversion with the user conversion
3638 sequence. */
3639 *t = user_seq;
3641 return std_seq;
3644 /* Handle overload resolution for initializing an object of class type from
3645 an initializer list. First we look for a suitable constructor that
3646 takes a std::initializer_list; if we don't find one, we then look for a
3647 non-list constructor.
3649 Parameters are as for add_candidates, except that the arguments are in
3650 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3651 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3653 static void
3654 add_list_candidates (tree fns, tree first_arg,
3655 const vec<tree, va_gc> *args, tree totype,
3656 tree explicit_targs, bool template_only,
3657 tree conversion_path, tree access_path,
3658 int flags,
3659 struct z_candidate **candidates,
3660 tsubst_flags_t complain)
3662 gcc_assert (*candidates == NULL);
3664 /* We're looking for a ctor for list-initialization. */
3665 flags |= LOOKUP_LIST_INIT_CTOR;
3666 /* And we don't allow narrowing conversions. We also use this flag to
3667 avoid the copy constructor call for copy-list-initialization. */
3668 flags |= LOOKUP_NO_NARROWING;
3670 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3671 tree init_list = (*args)[nart];
3673 /* Always use the default constructor if the list is empty (DR 990). */
3674 if (CONSTRUCTOR_NELTS (init_list) == 0
3675 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3677 /* If the class has a list ctor, try passing the list as a single
3678 argument first, but only consider list ctors. */
3679 else if (TYPE_HAS_LIST_CTOR (totype))
3681 flags |= LOOKUP_LIST_ONLY;
3682 add_candidates (fns, first_arg, args, NULL_TREE,
3683 explicit_targs, template_only, conversion_path,
3684 access_path, flags, candidates, complain);
3685 if (any_strictly_viable (*candidates))
3686 return;
3689 /* Expand the CONSTRUCTOR into a new argument vec. */
3690 vec<tree, va_gc> *new_args;
3691 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3692 for (unsigned i = 0; i < nart; ++i)
3693 new_args->quick_push ((*args)[i]);
3694 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3695 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3697 /* We aren't looking for list-ctors anymore. */
3698 flags &= ~LOOKUP_LIST_ONLY;
3699 /* We allow more user-defined conversions within an init-list. */
3700 flags &= ~LOOKUP_NO_CONVERSION;
3702 add_candidates (fns, first_arg, new_args, NULL_TREE,
3703 explicit_targs, template_only, conversion_path,
3704 access_path, flags, candidates, complain);
3707 /* Returns the best overload candidate to perform the requested
3708 conversion. This function is used for three the overloading situations
3709 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3710 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3711 per [dcl.init.ref], so we ignore temporary bindings. */
3713 static struct z_candidate *
3714 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3715 tsubst_flags_t complain)
3717 struct z_candidate *candidates, *cand;
3718 tree fromtype;
3719 tree ctors = NULL_TREE;
3720 tree conv_fns = NULL_TREE;
3721 conversion *conv = NULL;
3722 tree first_arg = NULL_TREE;
3723 vec<tree, va_gc> *args = NULL;
3724 bool any_viable_p;
3725 int convflags;
3727 if (!expr)
3728 return NULL;
3730 fromtype = TREE_TYPE (expr);
3732 /* We represent conversion within a hierarchy using RVALUE_CONV and
3733 BASE_CONV, as specified by [over.best.ics]; these become plain
3734 constructor calls, as specified in [dcl.init]. */
3735 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3736 || !DERIVED_FROM_P (totype, fromtype));
3738 if (MAYBE_CLASS_TYPE_P (totype))
3739 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3740 creating a garbage BASELINK; constructors can't be inherited. */
3741 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3743 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3744 a single element. For now, let's handle constructors as before and also
3745 consider conversion operators from the element. */
3746 if (cxx_dialect >= cxx1z
3747 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3748 && CONSTRUCTOR_NELTS (expr) == 1)
3749 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3751 if (MAYBE_CLASS_TYPE_P (fromtype))
3753 tree to_nonref = non_reference (totype);
3754 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3755 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3756 && DERIVED_FROM_P (to_nonref, fromtype)))
3758 /* [class.conv.fct] A conversion function is never used to
3759 convert a (possibly cv-qualified) object to the (possibly
3760 cv-qualified) same object type (or a reference to it), to a
3761 (possibly cv-qualified) base class of that type (or a
3762 reference to it)... */
3764 else
3765 conv_fns = lookup_conversions (fromtype);
3768 candidates = 0;
3769 flags |= LOOKUP_NO_CONVERSION;
3770 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3771 flags |= LOOKUP_NO_NARROWING;
3773 /* It's OK to bind a temporary for converting constructor arguments, but
3774 not in converting the return value of a conversion operator. */
3775 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3776 | (flags & LOOKUP_NO_NARROWING));
3777 flags &= ~LOOKUP_NO_TEMP_BIND;
3779 if (ctors)
3781 int ctorflags = flags;
3783 first_arg = build_dummy_object (totype);
3785 /* We should never try to call the abstract or base constructor
3786 from here. */
3787 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3788 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3790 args = make_tree_vector_single (expr);
3791 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3793 /* List-initialization. */
3794 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3795 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3796 ctorflags, &candidates, complain);
3798 else
3800 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3801 TYPE_BINFO (totype), TYPE_BINFO (totype),
3802 ctorflags, &candidates, complain);
3805 for (cand = candidates; cand; cand = cand->next)
3807 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3809 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3810 set, then this is copy-initialization. In that case, "The
3811 result of the call is then used to direct-initialize the
3812 object that is the destination of the copy-initialization."
3813 [dcl.init]
3815 We represent this in the conversion sequence with an
3816 rvalue conversion, which means a constructor call. */
3817 if (TREE_CODE (totype) != REFERENCE_TYPE
3818 && !(convflags & LOOKUP_NO_TEMP_BIND))
3819 cand->second_conv
3820 = build_conv (ck_rvalue, totype, cand->second_conv);
3824 if (conv_fns)
3826 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3827 /* FIXME see above about C++17. */
3828 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3829 else
3830 first_arg = expr;
3833 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3835 tree conversion_path = TREE_PURPOSE (conv_fns);
3836 struct z_candidate *old_candidates;
3838 /* If we are called to convert to a reference type, we are trying to
3839 find a direct binding, so don't even consider temporaries. If
3840 we don't find a direct binding, the caller will try again to
3841 look for a temporary binding. */
3842 if (TREE_CODE (totype) == REFERENCE_TYPE)
3843 convflags |= LOOKUP_NO_TEMP_BIND;
3845 old_candidates = candidates;
3846 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3847 NULL_TREE, false,
3848 conversion_path, TYPE_BINFO (fromtype),
3849 flags, &candidates, complain);
3851 for (cand = candidates; cand != old_candidates; cand = cand->next)
3853 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3854 conversion *ics
3855 = implicit_conversion (totype,
3856 rettype,
3858 /*c_cast_p=*/false, convflags,
3859 complain);
3861 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3862 copy-initialization. In that case, "The result of the
3863 call is then used to direct-initialize the object that is
3864 the destination of the copy-initialization." [dcl.init]
3866 We represent this in the conversion sequence with an
3867 rvalue conversion, which means a constructor call. But
3868 don't add a second rvalue conversion if there's already
3869 one there. Which there really shouldn't be, but it's
3870 harmless since we'd add it here anyway. */
3871 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3872 && !(convflags & LOOKUP_NO_TEMP_BIND))
3873 ics = build_conv (ck_rvalue, totype, ics);
3875 cand->second_conv = ics;
3877 if (!ics)
3879 cand->viable = 0;
3880 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3881 rettype, totype);
3883 else if (DECL_NONCONVERTING_P (cand->fn)
3884 && ics->rank > cr_exact)
3886 /* 13.3.1.5: For direct-initialization, those explicit
3887 conversion functions that are not hidden within S and
3888 yield type T or a type that can be converted to type T
3889 with a qualification conversion (4.4) are also candidate
3890 functions. */
3891 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3892 I've raised this issue with the committee. --jason 9/2011 */
3893 cand->viable = -1;
3894 cand->reason = explicit_conversion_rejection (rettype, totype);
3896 else if (cand->viable == 1 && ics->bad_p)
3898 cand->viable = -1;
3899 cand->reason
3900 = bad_arg_conversion_rejection (NULL_TREE, -2,
3901 rettype, totype);
3903 else if (primary_template_instantiation_p (cand->fn)
3904 && ics->rank > cr_exact)
3906 /* 13.3.3.1.2: If the user-defined conversion is specified by
3907 a specialization of a conversion function template, the
3908 second standard conversion sequence shall have exact match
3909 rank. */
3910 cand->viable = -1;
3911 cand->reason = template_conversion_rejection (rettype, totype);
3916 candidates = splice_viable (candidates, false, &any_viable_p);
3917 if (!any_viable_p)
3919 if (args)
3920 release_tree_vector (args);
3921 return NULL;
3924 cand = tourney (candidates, complain);
3925 if (cand == 0)
3927 if (complain & tf_error)
3929 error ("conversion from %qH to %qI is ambiguous",
3930 fromtype, totype);
3931 print_z_candidates (location_of (expr), candidates);
3934 cand = candidates; /* any one will do */
3935 cand->second_conv = build_ambiguous_conv (totype, expr);
3936 cand->second_conv->user_conv_p = true;
3937 if (!any_strictly_viable (candidates))
3938 cand->second_conv->bad_p = true;
3939 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3940 ambiguous conversion is no worse than another user-defined
3941 conversion. */
3943 return cand;
3946 tree convtype;
3947 if (!DECL_CONSTRUCTOR_P (cand->fn))
3948 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3949 else if (cand->second_conv->kind == ck_rvalue)
3950 /* DR 5: [in the first step of copy-initialization]...if the function
3951 is a constructor, the call initializes a temporary of the
3952 cv-unqualified version of the destination type. */
3953 convtype = cv_unqualified (totype);
3954 else
3955 convtype = totype;
3956 /* Build the user conversion sequence. */
3957 conv = build_conv
3958 (ck_user,
3959 convtype,
3960 build_identity_conv (TREE_TYPE (expr), expr));
3961 conv->cand = cand;
3962 if (cand->viable == -1)
3963 conv->bad_p = true;
3965 /* Remember that this was a list-initialization. */
3966 if (flags & LOOKUP_NO_NARROWING)
3967 conv->check_narrowing = true;
3969 /* Combine it with the second conversion sequence. */
3970 cand->second_conv = merge_conversion_sequences (conv,
3971 cand->second_conv);
3973 return cand;
3976 /* Wrapper for above. */
3978 tree
3979 build_user_type_conversion (tree totype, tree expr, int flags,
3980 tsubst_flags_t complain)
3982 struct z_candidate *cand;
3983 tree ret;
3985 bool subtime = timevar_cond_start (TV_OVERLOAD);
3986 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3988 if (cand)
3990 if (cand->second_conv->kind == ck_ambig)
3991 ret = error_mark_node;
3992 else
3994 expr = convert_like (cand->second_conv, expr, complain);
3995 ret = convert_from_reference (expr);
3998 else
3999 ret = NULL_TREE;
4001 timevar_cond_stop (TV_OVERLOAD, subtime);
4002 return ret;
4005 /* Subroutine of convert_nontype_argument.
4007 EXPR is an expression used in a context that requires a converted
4008 constant-expression, such as a template non-type parameter. Do any
4009 necessary conversions (that are permitted for converted
4010 constant-expressions) to convert it to the desired type.
4012 If conversion is successful, returns the converted expression;
4013 otherwise, returns error_mark_node. */
4015 tree
4016 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4018 conversion *conv;
4019 void *p;
4020 tree t;
4021 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4023 if (error_operand_p (expr))
4024 return error_mark_node;
4026 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4027 p = conversion_obstack_alloc (0);
4029 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4030 /*c_cast_p=*/false,
4031 LOOKUP_IMPLICIT, complain);
4033 /* A converted constant expression of type T is an expression, implicitly
4034 converted to type T, where the converted expression is a constant
4035 expression and the implicit conversion sequence contains only
4037 * user-defined conversions,
4038 * lvalue-to-rvalue conversions (7.1),
4039 * array-to-pointer conversions (7.2),
4040 * function-to-pointer conversions (7.3),
4041 * qualification conversions (7.5),
4042 * integral promotions (7.6),
4043 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4044 * null pointer conversions (7.11) from std::nullptr_t,
4045 * null member pointer conversions (7.12) from std::nullptr_t, and
4046 * function pointer conversions (7.13),
4048 and where the reference binding (if any) binds directly. */
4050 for (conversion *c = conv;
4051 conv && c->kind != ck_identity;
4052 c = next_conversion (c))
4054 switch (c->kind)
4056 /* A conversion function is OK. If it isn't constexpr, we'll
4057 complain later that the argument isn't constant. */
4058 case ck_user:
4059 /* The lvalue-to-rvalue conversion is OK. */
4060 case ck_rvalue:
4061 /* Array-to-pointer and function-to-pointer. */
4062 case ck_lvalue:
4063 /* Function pointer conversions. */
4064 case ck_fnptr:
4065 /* Qualification conversions. */
4066 case ck_qual:
4067 break;
4069 case ck_ref_bind:
4070 if (c->need_temporary_p)
4072 if (complain & tf_error)
4073 error_at (loc, "initializing %qH with %qI in converted "
4074 "constant expression does not bind directly",
4075 type, next_conversion (c)->type);
4076 conv = NULL;
4078 break;
4080 case ck_base:
4081 case ck_pmem:
4082 case ck_ptr:
4083 case ck_std:
4084 t = next_conversion (c)->type;
4085 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4086 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4087 /* Integral promotion or conversion. */
4088 break;
4089 if (NULLPTR_TYPE_P (t))
4090 /* Conversion from nullptr to pointer or pointer-to-member. */
4091 break;
4093 if (complain & tf_error)
4094 error_at (loc, "conversion from %qH to %qI in a "
4095 "converted constant expression", t, type);
4096 /* fall through. */
4098 default:
4099 conv = NULL;
4100 break;
4104 /* Avoid confusing convert_nontype_argument by introducing
4105 a redundant conversion to the same reference type. */
4106 if (conv && conv->kind == ck_ref_bind
4107 && REFERENCE_REF_P (expr))
4109 tree ref = TREE_OPERAND (expr, 0);
4110 if (same_type_p (type, TREE_TYPE (ref)))
4111 return ref;
4114 if (conv)
4115 expr = convert_like (conv, expr, complain);
4116 else
4117 expr = error_mark_node;
4119 /* Free all the conversions we allocated. */
4120 obstack_free (&conversion_obstack, p);
4122 return expr;
4125 /* Do any initial processing on the arguments to a function call. */
4127 static vec<tree, va_gc> *
4128 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4130 unsigned int ix;
4131 tree arg;
4133 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4135 if (error_operand_p (arg))
4136 return NULL;
4137 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4139 if (complain & tf_error)
4140 error ("invalid use of void expression");
4141 return NULL;
4143 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4144 return NULL;
4146 return args;
4149 /* Perform overload resolution on FN, which is called with the ARGS.
4151 Return the candidate function selected by overload resolution, or
4152 NULL if the event that overload resolution failed. In the case
4153 that overload resolution fails, *CANDIDATES will be the set of
4154 candidates considered, and ANY_VIABLE_P will be set to true or
4155 false to indicate whether or not any of the candidates were
4156 viable.
4158 The ARGS should already have gone through RESOLVE_ARGS before this
4159 function is called. */
4161 static struct z_candidate *
4162 perform_overload_resolution (tree fn,
4163 const vec<tree, va_gc> *args,
4164 struct z_candidate **candidates,
4165 bool *any_viable_p, tsubst_flags_t complain)
4167 struct z_candidate *cand;
4168 tree explicit_targs;
4169 int template_only;
4171 bool subtime = timevar_cond_start (TV_OVERLOAD);
4173 explicit_targs = NULL_TREE;
4174 template_only = 0;
4176 *candidates = NULL;
4177 *any_viable_p = true;
4179 /* Check FN. */
4180 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4181 || TREE_CODE (fn) == TEMPLATE_DECL
4182 || TREE_CODE (fn) == OVERLOAD
4183 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4185 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4187 explicit_targs = TREE_OPERAND (fn, 1);
4188 fn = TREE_OPERAND (fn, 0);
4189 template_only = 1;
4192 /* Add the various candidate functions. */
4193 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4194 explicit_targs, template_only,
4195 /*conversion_path=*/NULL_TREE,
4196 /*access_path=*/NULL_TREE,
4197 LOOKUP_NORMAL,
4198 candidates, complain);
4200 *candidates = splice_viable (*candidates, false, any_viable_p);
4201 if (*any_viable_p)
4202 cand = tourney (*candidates, complain);
4203 else
4204 cand = NULL;
4206 timevar_cond_stop (TV_OVERLOAD, subtime);
4207 return cand;
4210 /* Print an error message about being unable to build a call to FN with
4211 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4212 be located; CANDIDATES is a possibly empty list of such
4213 functions. */
4215 static void
4216 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4217 struct z_candidate *candidates)
4219 tree targs = NULL_TREE;
4220 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4222 targs = TREE_OPERAND (fn, 1);
4223 fn = TREE_OPERAND (fn, 0);
4225 tree name = OVL_NAME (fn);
4226 location_t loc = location_of (name);
4227 if (targs)
4228 name = lookup_template_function (name, targs);
4230 if (!any_strictly_viable (candidates))
4231 error_at (loc, "no matching function for call to %<%D(%A)%>",
4232 name, build_tree_list_vec (args));
4233 else
4234 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4235 name, build_tree_list_vec (args));
4236 if (candidates)
4237 print_z_candidates (loc, candidates);
4240 /* Return an expression for a call to FN (a namespace-scope function,
4241 or a static member function) with the ARGS. This may change
4242 ARGS. */
4244 tree
4245 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4246 tsubst_flags_t complain)
4248 struct z_candidate *candidates, *cand;
4249 bool any_viable_p;
4250 void *p;
4251 tree result;
4253 if (args != NULL && *args != NULL)
4255 *args = resolve_args (*args, complain);
4256 if (*args == NULL)
4257 return error_mark_node;
4260 if (flag_tm)
4261 tm_malloc_replacement (fn);
4263 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4264 p = conversion_obstack_alloc (0);
4266 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4267 complain);
4269 if (!cand)
4271 if (complain & tf_error)
4273 // If there is a single (non-viable) function candidate,
4274 // let the error be diagnosed by cp_build_function_call_vec.
4275 if (!any_viable_p && candidates && ! candidates->next
4276 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4277 return cp_build_function_call_vec (candidates->fn, args, complain);
4279 // Otherwise, emit notes for non-viable candidates.
4280 print_error_for_call_failure (fn, *args, candidates);
4282 result = error_mark_node;
4284 else
4286 int flags = LOOKUP_NORMAL;
4287 /* If fn is template_id_expr, the call has explicit template arguments
4288 (e.g. func<int>(5)), communicate this info to build_over_call
4289 through flags so that later we can use it to decide whether to warn
4290 about peculiar null pointer conversion. */
4291 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4293 /* If overload resolution selects a specialization of a
4294 function concept for non-dependent template arguments,
4295 the expression is true if the constraints are satisfied
4296 and false otherwise.
4298 NOTE: This is an extension of Concepts Lite TS that
4299 allows constraints to be used in expressions. */
4300 if (flag_concepts && !processing_template_decl)
4302 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4303 tree targs = DECL_TI_ARGS (cand->fn);
4304 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4305 if (DECL_DECLARED_CONCEPT_P (decl))
4306 return evaluate_function_concept (decl, targs);
4309 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4312 result = build_over_call (cand, flags, complain);
4315 /* Free all the conversions we allocated. */
4316 obstack_free (&conversion_obstack, p);
4318 return result;
4321 /* Build a call to a global operator new. FNNAME is the name of the
4322 operator (either "operator new" or "operator new[]") and ARGS are
4323 the arguments provided. This may change ARGS. *SIZE points to the
4324 total number of bytes required by the allocation, and is updated if
4325 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4326 be used. If this function determines that no cookie should be
4327 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4328 is not NULL_TREE, it is evaluated before calculating the final
4329 array size, and if it fails, the array size is replaced with
4330 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4331 is non-NULL, it will be set, upon return, to the allocation
4332 function called. */
4334 tree
4335 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4336 tree *size, tree *cookie_size,
4337 tree align_arg, tree size_check,
4338 tree *fn, tsubst_flags_t complain)
4340 tree original_size = *size;
4341 tree fns;
4342 struct z_candidate *candidates;
4343 struct z_candidate *cand = NULL;
4344 bool any_viable_p;
4346 if (fn)
4347 *fn = NULL_TREE;
4348 /* Set to (size_t)-1 if the size check fails. */
4349 if (size_check != NULL_TREE)
4351 tree errval = TYPE_MAX_VALUE (sizetype);
4352 if (cxx_dialect >= cxx11 && flag_exceptions)
4353 errval = throw_bad_array_new_length ();
4354 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4355 original_size, errval);
4357 vec_safe_insert (*args, 0, *size);
4358 *args = resolve_args (*args, complain);
4359 if (*args == NULL)
4360 return error_mark_node;
4362 /* Based on:
4364 [expr.new]
4366 If this lookup fails to find the name, or if the allocated type
4367 is not a class type, the allocation function's name is looked
4368 up in the global scope.
4370 we disregard block-scope declarations of "operator new". */
4371 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4372 fns = lookup_arg_dependent (fnname, fns, *args);
4374 if (align_arg)
4376 vec<tree, va_gc>* align_args
4377 = vec_copy_and_insert (*args, align_arg, 1);
4378 cand = perform_overload_resolution (fns, align_args, &candidates,
4379 &any_viable_p, tf_none);
4380 /* If no aligned allocation function matches, try again without the
4381 alignment. */
4384 /* Figure out what function is being called. */
4385 if (!cand)
4386 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4387 complain);
4389 /* If no suitable function could be found, issue an error message
4390 and give up. */
4391 if (!cand)
4393 if (complain & tf_error)
4394 print_error_for_call_failure (fns, *args, candidates);
4395 return error_mark_node;
4398 /* If a cookie is required, add some extra space. Whether
4399 or not a cookie is required cannot be determined until
4400 after we know which function was called. */
4401 if (*cookie_size)
4403 bool use_cookie = true;
4404 tree arg_types;
4406 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4407 /* Skip the size_t parameter. */
4408 arg_types = TREE_CHAIN (arg_types);
4409 /* Check the remaining parameters (if any). */
4410 if (arg_types
4411 && TREE_CHAIN (arg_types) == void_list_node
4412 && same_type_p (TREE_VALUE (arg_types),
4413 ptr_type_node))
4414 use_cookie = false;
4415 /* If we need a cookie, adjust the number of bytes allocated. */
4416 if (use_cookie)
4418 /* Update the total size. */
4419 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4420 if (size_check)
4422 /* Set to (size_t)-1 if the size check fails. */
4423 gcc_assert (size_check != NULL_TREE);
4424 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4425 *size, TYPE_MAX_VALUE (sizetype));
4427 /* Update the argument list to reflect the adjusted size. */
4428 (**args)[0] = *size;
4430 else
4431 *cookie_size = NULL_TREE;
4434 /* Tell our caller which function we decided to call. */
4435 if (fn)
4436 *fn = cand->fn;
4438 /* Build the CALL_EXPR. */
4439 return build_over_call (cand, LOOKUP_NORMAL, complain);
4442 /* Build a new call to operator(). This may change ARGS. */
4444 static tree
4445 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4447 struct z_candidate *candidates = 0, *cand;
4448 tree fns, convs, first_mem_arg = NULL_TREE;
4449 tree type = TREE_TYPE (obj);
4450 bool any_viable_p;
4451 tree result = NULL_TREE;
4452 void *p;
4454 if (error_operand_p (obj))
4455 return error_mark_node;
4457 obj = prep_operand (obj);
4459 if (TYPE_PTRMEMFUNC_P (type))
4461 if (complain & tf_error)
4462 /* It's no good looking for an overloaded operator() on a
4463 pointer-to-member-function. */
4464 error ("pointer-to-member function %qE cannot be called without "
4465 "an object; consider using %<.*%> or %<->*%>", obj);
4466 return error_mark_node;
4469 if (TYPE_BINFO (type))
4471 fns = lookup_fnfields (TYPE_BINFO (type), cp_operator_id (CALL_EXPR), 1);
4472 if (fns == error_mark_node)
4473 return error_mark_node;
4475 else
4476 fns = NULL_TREE;
4478 if (args != NULL && *args != NULL)
4480 *args = resolve_args (*args, complain);
4481 if (*args == NULL)
4482 return error_mark_node;
4485 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4486 p = conversion_obstack_alloc (0);
4488 if (fns)
4490 first_mem_arg = obj;
4492 add_candidates (BASELINK_FUNCTIONS (fns),
4493 first_mem_arg, *args, NULL_TREE,
4494 NULL_TREE, false,
4495 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4496 LOOKUP_NORMAL, &candidates, complain);
4499 convs = lookup_conversions (type);
4501 for (; convs; convs = TREE_CHAIN (convs))
4503 tree totype = TREE_TYPE (convs);
4505 if (TYPE_PTRFN_P (totype)
4506 || TYPE_REFFN_P (totype)
4507 || (TREE_CODE (totype) == REFERENCE_TYPE
4508 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4509 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4511 tree fn = *iter;
4513 if (DECL_NONCONVERTING_P (fn))
4514 continue;
4516 if (TREE_CODE (fn) == TEMPLATE_DECL)
4517 add_template_conv_candidate
4518 (&candidates, fn, obj, *args, totype,
4519 /*access_path=*/NULL_TREE,
4520 /*conversion_path=*/NULL_TREE, complain);
4521 else
4522 add_conv_candidate (&candidates, fn, obj,
4523 *args, /*conversion_path=*/NULL_TREE,
4524 /*access_path=*/NULL_TREE, complain);
4528 /* Be strict here because if we choose a bad conversion candidate, the
4529 errors we get won't mention the call context. */
4530 candidates = splice_viable (candidates, true, &any_viable_p);
4531 if (!any_viable_p)
4533 if (complain & tf_error)
4535 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4536 build_tree_list_vec (*args));
4537 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4539 result = error_mark_node;
4541 else
4543 cand = tourney (candidates, complain);
4544 if (cand == 0)
4546 if (complain & tf_error)
4548 error ("call of %<(%T) (%A)%> is ambiguous",
4549 TREE_TYPE (obj), build_tree_list_vec (*args));
4550 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4552 result = error_mark_node;
4554 /* Since cand->fn will be a type, not a function, for a conversion
4555 function, we must be careful not to unconditionally look at
4556 DECL_NAME here. */
4557 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4558 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4559 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4560 else
4562 if (DECL_P (cand->fn))
4563 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4564 -1, complain);
4565 else
4566 obj = convert_like (cand->convs[0], obj, complain);
4567 obj = convert_from_reference (obj);
4568 result = cp_build_function_call_vec (obj, args, complain);
4572 /* Free all the conversions we allocated. */
4573 obstack_free (&conversion_obstack, p);
4575 return result;
4578 /* Wrapper for above. */
4580 tree
4581 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4583 tree ret;
4584 bool subtime = timevar_cond_start (TV_OVERLOAD);
4585 ret = build_op_call_1 (obj, args, complain);
4586 timevar_cond_stop (TV_OVERLOAD, subtime);
4587 return ret;
4590 /* Called by op_error to prepare format strings suitable for the error
4591 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4592 and a suffix (controlled by NTYPES). */
4594 static const char *
4595 op_error_string (const char *errmsg, int ntypes, bool match)
4597 const char *msg;
4599 const char *msgp = concat (match ? G_("ambiguous overload for ")
4600 : G_("no match for "), errmsg, NULL);
4602 if (ntypes == 3)
4603 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4604 else if (ntypes == 2)
4605 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4606 else
4607 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4609 return msg;
4612 static void
4613 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4614 tree arg1, tree arg2, tree arg3, bool match)
4616 const char *opname;
4618 if (code == MODIFY_EXPR)
4619 opname = assignment_operator_name_info[code2].name;
4620 else
4621 opname = operator_name_info[code].name;
4623 switch (code)
4625 case COND_EXPR:
4626 if (flag_diagnostics_show_caret)
4627 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4628 3, match),
4629 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4630 else
4631 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4632 "in %<%E ? %E : %E%>"), 3, match),
4633 arg1, arg2, arg3,
4634 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4635 break;
4637 case POSTINCREMENT_EXPR:
4638 case POSTDECREMENT_EXPR:
4639 if (flag_diagnostics_show_caret)
4640 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4641 opname, TREE_TYPE (arg1));
4642 else
4643 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4644 1, match),
4645 opname, arg1, opname, TREE_TYPE (arg1));
4646 break;
4648 case ARRAY_REF:
4649 if (flag_diagnostics_show_caret)
4650 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4651 TREE_TYPE (arg1), TREE_TYPE (arg2));
4652 else
4653 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4654 2, match),
4655 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4656 break;
4658 case REALPART_EXPR:
4659 case IMAGPART_EXPR:
4660 if (flag_diagnostics_show_caret)
4661 error_at (loc, op_error_string (G_("%qs"), 1, match),
4662 opname, TREE_TYPE (arg1));
4663 else
4664 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4665 opname, opname, arg1, TREE_TYPE (arg1));
4666 break;
4668 default:
4669 if (arg2)
4670 if (flag_diagnostics_show_caret)
4671 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4672 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4673 else
4674 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4675 2, match),
4676 opname, arg1, opname, arg2,
4677 TREE_TYPE (arg1), TREE_TYPE (arg2));
4678 else
4679 if (flag_diagnostics_show_caret)
4680 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4681 opname, TREE_TYPE (arg1));
4682 else
4683 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4684 1, match),
4685 opname, opname, arg1, TREE_TYPE (arg1));
4686 break;
4690 /* Return the implicit conversion sequence that could be used to
4691 convert E1 to E2 in [expr.cond]. */
4693 static conversion *
4694 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4696 tree t1 = non_reference (TREE_TYPE (e1));
4697 tree t2 = non_reference (TREE_TYPE (e2));
4698 conversion *conv;
4699 bool good_base;
4701 /* [expr.cond]
4703 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4704 implicitly converted (clause _conv_) to the type "lvalue reference to
4705 T2", subject to the constraint that in the conversion the
4706 reference must bind directly (_dcl.init.ref_) to an lvalue.
4708 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4709 implicitly converted to the type "rvalue reference to T2", subject to
4710 the constraint that the reference must bind directly. */
4711 if (glvalue_p (e2))
4713 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4714 conv = implicit_conversion (rtype,
4717 /*c_cast_p=*/false,
4718 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4719 |LOOKUP_ONLYCONVERTING,
4720 complain);
4721 if (conv && !conv->bad_p)
4722 return conv;
4725 /* If E2 is a prvalue or if neither of the conversions above can be done
4726 and at least one of the operands has (possibly cv-qualified) class
4727 type: */
4728 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4729 return NULL;
4731 /* [expr.cond]
4733 If E1 and E2 have class type, and the underlying class types are
4734 the same or one is a base class of the other: E1 can be converted
4735 to match E2 if the class of T2 is the same type as, or a base
4736 class of, the class of T1, and the cv-qualification of T2 is the
4737 same cv-qualification as, or a greater cv-qualification than, the
4738 cv-qualification of T1. If the conversion is applied, E1 is
4739 changed to an rvalue of type T2 that still refers to the original
4740 source class object (or the appropriate subobject thereof). */
4741 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4742 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4744 if (good_base && at_least_as_qualified_p (t2, t1))
4746 conv = build_identity_conv (t1, e1);
4747 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4748 TYPE_MAIN_VARIANT (t2)))
4749 conv = build_conv (ck_base, t2, conv);
4750 else
4751 conv = build_conv (ck_rvalue, t2, conv);
4752 return conv;
4754 else
4755 return NULL;
4757 else
4758 /* [expr.cond]
4760 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4761 converted to the type that expression E2 would have if E2 were
4762 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4763 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4764 LOOKUP_IMPLICIT, complain);
4767 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4768 arguments to the conditional expression. */
4770 static tree
4771 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4772 tsubst_flags_t complain)
4774 tree arg2_type;
4775 tree arg3_type;
4776 tree result = NULL_TREE;
4777 tree result_type = NULL_TREE;
4778 bool is_lvalue = true;
4779 struct z_candidate *candidates = 0;
4780 struct z_candidate *cand;
4781 void *p;
4782 tree orig_arg2, orig_arg3;
4784 /* As a G++ extension, the second argument to the conditional can be
4785 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4786 c'.) If the second operand is omitted, make sure it is
4787 calculated only once. */
4788 if (!arg2)
4790 if (complain & tf_error)
4791 pedwarn (loc, OPT_Wpedantic,
4792 "ISO C++ forbids omitting the middle term of a ?: expression");
4794 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4795 warn_for_omitted_condop (loc, arg1);
4797 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4798 if (lvalue_p (arg1))
4799 arg2 = arg1 = cp_stabilize_reference (arg1);
4800 else
4801 arg2 = arg1 = save_expr (arg1);
4804 /* If something has already gone wrong, just pass that fact up the
4805 tree. */
4806 if (error_operand_p (arg1)
4807 || error_operand_p (arg2)
4808 || error_operand_p (arg3))
4809 return error_mark_node;
4811 orig_arg2 = arg2;
4812 orig_arg3 = arg3;
4814 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4816 tree arg1_type = TREE_TYPE (arg1);
4818 /* If arg1 is another cond_expr choosing between -1 and 0,
4819 then we can use its comparison. It may help to avoid
4820 additional comparison, produce more accurate diagnostics
4821 and enables folding. */
4822 if (TREE_CODE (arg1) == VEC_COND_EXPR
4823 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4824 && integer_zerop (TREE_OPERAND (arg1, 2)))
4825 arg1 = TREE_OPERAND (arg1, 0);
4827 arg1 = force_rvalue (arg1, complain);
4828 arg2 = force_rvalue (arg2, complain);
4829 arg3 = force_rvalue (arg3, complain);
4831 /* force_rvalue can return error_mark on valid arguments. */
4832 if (error_operand_p (arg1)
4833 || error_operand_p (arg2)
4834 || error_operand_p (arg3))
4835 return error_mark_node;
4837 arg2_type = TREE_TYPE (arg2);
4838 arg3_type = TREE_TYPE (arg3);
4840 if (!VECTOR_TYPE_P (arg2_type)
4841 && !VECTOR_TYPE_P (arg3_type))
4843 /* Rely on the error messages of the scalar version. */
4844 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4845 orig_arg2, orig_arg3, complain);
4846 if (scal == error_mark_node)
4847 return error_mark_node;
4848 tree stype = TREE_TYPE (scal);
4849 tree ctype = TREE_TYPE (arg1_type);
4850 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4851 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4853 if (complain & tf_error)
4854 error_at (loc, "inferred scalar type %qT is not an integer or "
4855 "floating point type of the same size as %qT", stype,
4856 COMPARISON_CLASS_P (arg1)
4857 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4858 : ctype);
4859 return error_mark_node;
4862 tree vtype = build_opaque_vector_type (stype,
4863 TYPE_VECTOR_SUBPARTS (arg1_type));
4864 /* We could pass complain & tf_warning to unsafe_conversion_p,
4865 but the warnings (like Wsign-conversion) have already been
4866 given by the scalar build_conditional_expr_1. We still check
4867 unsafe_conversion_p to forbid truncating long long -> float. */
4868 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4870 if (complain & tf_error)
4871 error_at (loc, "conversion of scalar %qH to vector %qI "
4872 "involves truncation", arg2_type, vtype);
4873 return error_mark_node;
4875 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4877 if (complain & tf_error)
4878 error_at (loc, "conversion of scalar %qH to vector %qI "
4879 "involves truncation", arg3_type, vtype);
4880 return error_mark_node;
4883 arg2 = cp_convert (stype, arg2, complain);
4884 arg2 = save_expr (arg2);
4885 arg2 = build_vector_from_val (vtype, arg2);
4886 arg2_type = vtype;
4887 arg3 = cp_convert (stype, arg3, complain);
4888 arg3 = save_expr (arg3);
4889 arg3 = build_vector_from_val (vtype, arg3);
4890 arg3_type = vtype;
4893 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4895 enum stv_conv convert_flag =
4896 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4897 complain & tf_error);
4899 switch (convert_flag)
4901 case stv_error:
4902 return error_mark_node;
4903 case stv_firstarg:
4905 arg2 = save_expr (arg2);
4906 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4907 arg2 = build_vector_from_val (arg3_type, arg2);
4908 arg2_type = TREE_TYPE (arg2);
4909 break;
4911 case stv_secondarg:
4913 arg3 = save_expr (arg3);
4914 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4915 arg3 = build_vector_from_val (arg2_type, arg3);
4916 arg3_type = TREE_TYPE (arg3);
4917 break;
4919 default:
4920 break;
4924 if (!same_type_p (arg2_type, arg3_type)
4925 || TYPE_VECTOR_SUBPARTS (arg1_type)
4926 != TYPE_VECTOR_SUBPARTS (arg2_type)
4927 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4929 if (complain & tf_error)
4930 error_at (loc,
4931 "incompatible vector types in conditional expression: "
4932 "%qT, %qT and %qT", TREE_TYPE (arg1),
4933 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4934 return error_mark_node;
4937 if (!COMPARISON_CLASS_P (arg1))
4939 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4940 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4942 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4945 /* [expr.cond]
4947 The first expression is implicitly converted to bool (clause
4948 _conv_). */
4949 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4950 LOOKUP_NORMAL);
4951 if (error_operand_p (arg1))
4952 return error_mark_node;
4954 /* [expr.cond]
4956 If either the second or the third operand has type (possibly
4957 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4958 array-to-pointer (_conv.array_), and function-to-pointer
4959 (_conv.func_) standard conversions are performed on the second
4960 and third operands. */
4961 arg2_type = unlowered_expr_type (arg2);
4962 arg3_type = unlowered_expr_type (arg3);
4963 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4965 /* Do the conversions. We don't these for `void' type arguments
4966 since it can't have any effect and since decay_conversion
4967 does not handle that case gracefully. */
4968 if (!VOID_TYPE_P (arg2_type))
4969 arg2 = decay_conversion (arg2, complain);
4970 if (!VOID_TYPE_P (arg3_type))
4971 arg3 = decay_conversion (arg3, complain);
4972 arg2_type = TREE_TYPE (arg2);
4973 arg3_type = TREE_TYPE (arg3);
4975 /* [expr.cond]
4977 One of the following shall hold:
4979 --The second or the third operand (but not both) is a
4980 throw-expression (_except.throw_); the result is of the
4981 type of the other and is an rvalue.
4983 --Both the second and the third operands have type void; the
4984 result is of type void and is an rvalue.
4986 We must avoid calling force_rvalue for expressions of type
4987 "void" because it will complain that their value is being
4988 used. */
4989 if (TREE_CODE (arg2) == THROW_EXPR
4990 && TREE_CODE (arg3) != THROW_EXPR)
4992 if (!VOID_TYPE_P (arg3_type))
4994 arg3 = force_rvalue (arg3, complain);
4995 if (arg3 == error_mark_node)
4996 return error_mark_node;
4998 arg3_type = TREE_TYPE (arg3);
4999 result_type = arg3_type;
5001 else if (TREE_CODE (arg2) != THROW_EXPR
5002 && TREE_CODE (arg3) == THROW_EXPR)
5004 if (!VOID_TYPE_P (arg2_type))
5006 arg2 = force_rvalue (arg2, complain);
5007 if (arg2 == error_mark_node)
5008 return error_mark_node;
5010 arg2_type = TREE_TYPE (arg2);
5011 result_type = arg2_type;
5013 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5014 result_type = void_type_node;
5015 else
5017 if (complain & tf_error)
5019 if (VOID_TYPE_P (arg2_type))
5020 error_at (EXPR_LOC_OR_LOC (arg3, loc),
5021 "second operand to the conditional operator "
5022 "is of type %<void%>, but the third operand is "
5023 "neither a throw-expression nor of type %<void%>");
5024 else
5025 error_at (EXPR_LOC_OR_LOC (arg2, loc),
5026 "third operand to the conditional operator "
5027 "is of type %<void%>, but the second operand is "
5028 "neither a throw-expression nor of type %<void%>");
5030 return error_mark_node;
5033 is_lvalue = false;
5034 goto valid_operands;
5036 /* [expr.cond]
5038 Otherwise, if the second and third operand have different types,
5039 and either has (possibly cv-qualified) class type, or if both are
5040 glvalues of the same value category and the same type except for
5041 cv-qualification, an attempt is made to convert each of those operands
5042 to the type of the other. */
5043 else if (!same_type_p (arg2_type, arg3_type)
5044 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5045 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5046 arg3_type)
5047 && glvalue_p (arg2) && glvalue_p (arg3)
5048 && lvalue_p (arg2) == lvalue_p (arg3))))
5050 conversion *conv2;
5051 conversion *conv3;
5052 bool converted = false;
5054 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5055 p = conversion_obstack_alloc (0);
5057 conv2 = conditional_conversion (arg2, arg3, complain);
5058 conv3 = conditional_conversion (arg3, arg2, complain);
5060 /* [expr.cond]
5062 If both can be converted, or one can be converted but the
5063 conversion is ambiguous, the program is ill-formed. If
5064 neither can be converted, the operands are left unchanged and
5065 further checking is performed as described below. If exactly
5066 one conversion is possible, that conversion is applied to the
5067 chosen operand and the converted operand is used in place of
5068 the original operand for the remainder of this section. */
5069 if ((conv2 && !conv2->bad_p
5070 && conv3 && !conv3->bad_p)
5071 || (conv2 && conv2->kind == ck_ambig)
5072 || (conv3 && conv3->kind == ck_ambig))
5074 if (complain & tf_error)
5076 error_at (loc, "operands to ?: have different types %qT and %qT",
5077 arg2_type, arg3_type);
5078 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5079 inform (loc, " and each type can be converted to the other");
5080 else if (conv2 && conv2->kind == ck_ambig)
5081 convert_like (conv2, arg2, complain);
5082 else
5083 convert_like (conv3, arg3, complain);
5085 result = error_mark_node;
5087 else if (conv2 && !conv2->bad_p)
5089 arg2 = convert_like (conv2, arg2, complain);
5090 arg2 = convert_from_reference (arg2);
5091 arg2_type = TREE_TYPE (arg2);
5092 /* Even if CONV2 is a valid conversion, the result of the
5093 conversion may be invalid. For example, if ARG3 has type
5094 "volatile X", and X does not have a copy constructor
5095 accepting a "volatile X&", then even if ARG2 can be
5096 converted to X, the conversion will fail. */
5097 if (error_operand_p (arg2))
5098 result = error_mark_node;
5099 converted = true;
5101 else if (conv3 && !conv3->bad_p)
5103 arg3 = convert_like (conv3, arg3, complain);
5104 arg3 = convert_from_reference (arg3);
5105 arg3_type = TREE_TYPE (arg3);
5106 if (error_operand_p (arg3))
5107 result = error_mark_node;
5108 converted = true;
5111 /* Free all the conversions we allocated. */
5112 obstack_free (&conversion_obstack, p);
5114 if (result)
5115 return result;
5117 /* If, after the conversion, both operands have class type,
5118 treat the cv-qualification of both operands as if it were the
5119 union of the cv-qualification of the operands.
5121 The standard is not clear about what to do in this
5122 circumstance. For example, if the first operand has type
5123 "const X" and the second operand has a user-defined
5124 conversion to "volatile X", what is the type of the second
5125 operand after this step? Making it be "const X" (matching
5126 the first operand) seems wrong, as that discards the
5127 qualification without actually performing a copy. Leaving it
5128 as "volatile X" seems wrong as that will result in the
5129 conditional expression failing altogether, even though,
5130 according to this step, the one operand could be converted to
5131 the type of the other. */
5132 if (converted
5133 && CLASS_TYPE_P (arg2_type)
5134 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5135 arg2_type = arg3_type =
5136 cp_build_qualified_type (arg2_type,
5137 cp_type_quals (arg2_type)
5138 | cp_type_quals (arg3_type));
5141 /* [expr.cond]
5143 If the second and third operands are glvalues of the same value
5144 category and have the same type, the result is of that type and
5145 value category. */
5146 if (((lvalue_p (arg2) && lvalue_p (arg3))
5147 || (xvalue_p (arg2) && xvalue_p (arg3)))
5148 && same_type_p (arg2_type, arg3_type))
5150 result_type = arg2_type;
5151 arg2 = mark_lvalue_use (arg2);
5152 arg3 = mark_lvalue_use (arg3);
5153 goto valid_operands;
5156 /* [expr.cond]
5158 Otherwise, the result is an rvalue. If the second and third
5159 operand do not have the same type, and either has (possibly
5160 cv-qualified) class type, overload resolution is used to
5161 determine the conversions (if any) to be applied to the operands
5162 (_over.match.oper_, _over.built_). */
5163 is_lvalue = false;
5164 if (!same_type_p (arg2_type, arg3_type)
5165 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5167 tree args[3];
5168 conversion *conv;
5169 bool any_viable_p;
5171 /* Rearrange the arguments so that add_builtin_candidate only has
5172 to know about two args. In build_builtin_candidate, the
5173 arguments are unscrambled. */
5174 args[0] = arg2;
5175 args[1] = arg3;
5176 args[2] = arg1;
5177 add_builtin_candidates (&candidates,
5178 COND_EXPR,
5179 NOP_EXPR,
5180 cp_operator_id (COND_EXPR),
5181 args,
5182 LOOKUP_NORMAL, complain);
5184 /* [expr.cond]
5186 If the overload resolution fails, the program is
5187 ill-formed. */
5188 candidates = splice_viable (candidates, false, &any_viable_p);
5189 if (!any_viable_p)
5191 if (complain & tf_error)
5192 error_at (loc, "operands to ?: have different types %qT and %qT",
5193 arg2_type, arg3_type);
5194 return error_mark_node;
5196 cand = tourney (candidates, complain);
5197 if (!cand)
5199 if (complain & tf_error)
5201 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5202 print_z_candidates (loc, candidates);
5204 return error_mark_node;
5207 /* [expr.cond]
5209 Otherwise, the conversions thus determined are applied, and
5210 the converted operands are used in place of the original
5211 operands for the remainder of this section. */
5212 conv = cand->convs[0];
5213 arg1 = convert_like (conv, arg1, complain);
5214 conv = cand->convs[1];
5215 arg2 = convert_like (conv, arg2, complain);
5216 arg2_type = TREE_TYPE (arg2);
5217 conv = cand->convs[2];
5218 arg3 = convert_like (conv, arg3, complain);
5219 arg3_type = TREE_TYPE (arg3);
5222 /* [expr.cond]
5224 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5225 and function-to-pointer (_conv.func_) standard conversions are
5226 performed on the second and third operands.
5228 We need to force the lvalue-to-rvalue conversion here for class types,
5229 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5230 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5231 regions. */
5233 arg2 = force_rvalue (arg2, complain);
5234 if (!CLASS_TYPE_P (arg2_type))
5235 arg2_type = TREE_TYPE (arg2);
5237 arg3 = force_rvalue (arg3, complain);
5238 if (!CLASS_TYPE_P (arg3_type))
5239 arg3_type = TREE_TYPE (arg3);
5241 if (arg2 == error_mark_node || arg3 == error_mark_node)
5242 return error_mark_node;
5244 /* [expr.cond]
5246 After those conversions, one of the following shall hold:
5248 --The second and third operands have the same type; the result is of
5249 that type. */
5250 if (same_type_p (arg2_type, arg3_type))
5251 result_type = arg2_type;
5252 /* [expr.cond]
5254 --The second and third operands have arithmetic or enumeration
5255 type; the usual arithmetic conversions are performed to bring
5256 them to a common type, and the result is of that type. */
5257 else if ((ARITHMETIC_TYPE_P (arg2_type)
5258 || UNSCOPED_ENUM_P (arg2_type))
5259 && (ARITHMETIC_TYPE_P (arg3_type)
5260 || UNSCOPED_ENUM_P (arg3_type)))
5262 /* In this case, there is always a common type. */
5263 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5264 arg3_type);
5265 if (complain & tf_warning)
5266 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5267 "implicit conversion from %qH to %qI to "
5268 "match other result of conditional",
5269 loc);
5271 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5272 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5274 if (TREE_CODE (orig_arg2) == CONST_DECL
5275 && TREE_CODE (orig_arg3) == CONST_DECL
5276 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5277 /* Two enumerators from the same enumeration can have different
5278 types when the enumeration is still being defined. */;
5279 else if (complain & tf_warning)
5280 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5281 "conditional expression: %qT vs %qT",
5282 arg2_type, arg3_type);
5284 else if (extra_warnings
5285 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5286 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5287 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5288 && !same_type_p (arg2_type,
5289 type_promotes_to (arg3_type)))))
5291 if (complain & tf_warning)
5292 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5293 "conditional expression");
5296 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5297 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5299 /* [expr.cond]
5301 --The second and third operands have pointer type, or one has
5302 pointer type and the other is a null pointer constant; pointer
5303 conversions (_conv.ptr_) and qualification conversions
5304 (_conv.qual_) are performed to bring them to their composite
5305 pointer type (_expr.rel_). The result is of the composite
5306 pointer type.
5308 --The second and third operands have pointer to member type, or
5309 one has pointer to member type and the other is a null pointer
5310 constant; pointer to member conversions (_conv.mem_) and
5311 qualification conversions (_conv.qual_) are performed to bring
5312 them to a common type, whose cv-qualification shall match the
5313 cv-qualification of either the second or the third operand.
5314 The result is of the common type. */
5315 else if ((null_ptr_cst_p (arg2)
5316 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5317 || (null_ptr_cst_p (arg3)
5318 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5319 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5320 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5321 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5323 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5324 arg3, CPO_CONDITIONAL_EXPR,
5325 complain);
5326 if (result_type == error_mark_node)
5327 return error_mark_node;
5328 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5329 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5332 if (!result_type)
5334 if (complain & tf_error)
5335 error_at (loc, "operands to ?: have different types %qT and %qT",
5336 arg2_type, arg3_type);
5337 return error_mark_node;
5340 if (arg2 == error_mark_node || arg3 == error_mark_node)
5341 return error_mark_node;
5343 valid_operands:
5344 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5346 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5347 warn here, because the COND_EXPR will be turned into ARG2. */
5348 if (warn_duplicated_branches
5349 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5350 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5351 "this condition has identical branches");
5353 /* We can't use result_type below, as fold might have returned a
5354 throw_expr. */
5356 if (!is_lvalue)
5358 /* Expand both sides into the same slot, hopefully the target of
5359 the ?: expression. We used to check for TARGET_EXPRs here,
5360 but now we sometimes wrap them in NOP_EXPRs so the test would
5361 fail. */
5362 if (CLASS_TYPE_P (TREE_TYPE (result)))
5363 result = get_target_expr_sfinae (result, complain);
5364 /* If this expression is an rvalue, but might be mistaken for an
5365 lvalue, we must add a NON_LVALUE_EXPR. */
5366 result = rvalue (result);
5368 else
5369 result = force_paren_expr (result);
5371 return result;
5374 /* Wrapper for above. */
5376 tree
5377 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5378 tsubst_flags_t complain)
5380 tree ret;
5381 bool subtime = timevar_cond_start (TV_OVERLOAD);
5382 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5383 timevar_cond_stop (TV_OVERLOAD, subtime);
5384 return ret;
5387 /* OPERAND is an operand to an expression. Perform necessary steps
5388 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5389 returned. */
5391 static tree
5392 prep_operand (tree operand)
5394 if (operand)
5396 if (CLASS_TYPE_P (TREE_TYPE (operand))
5397 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5398 /* Make sure the template type is instantiated now. */
5399 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5402 return operand;
5405 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5406 OVERLOAD) to the CANDIDATES, returning an updated list of
5407 CANDIDATES. The ARGS are the arguments provided to the call;
5408 if FIRST_ARG is non-null it is the implicit object argument,
5409 otherwise the first element of ARGS is used if needed. The
5410 EXPLICIT_TARGS are explicit template arguments provided.
5411 TEMPLATE_ONLY is true if only template functions should be
5412 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5413 add_function_candidate. */
5415 static void
5416 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5417 tree return_type,
5418 tree explicit_targs, bool template_only,
5419 tree conversion_path, tree access_path,
5420 int flags,
5421 struct z_candidate **candidates,
5422 tsubst_flags_t complain)
5424 tree ctype;
5425 const vec<tree, va_gc> *non_static_args;
5426 bool check_list_ctor;
5427 bool check_converting;
5428 unification_kind_t strict;
5430 if (!fns)
5431 return;
5433 /* Precalculate special handling of constructors and conversion ops. */
5434 tree fn = OVL_FIRST (fns);
5435 if (DECL_CONV_FN_P (fn))
5437 check_list_ctor = false;
5438 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
5439 if (flags & LOOKUP_NO_CONVERSION)
5440 /* We're doing return_type(x). */
5441 strict = DEDUCE_CONV;
5442 else
5443 /* We're doing x.operator return_type(). */
5444 strict = DEDUCE_EXACT;
5445 /* [over.match.funcs] For conversion functions, the function
5446 is considered to be a member of the class of the implicit
5447 object argument for the purpose of defining the type of
5448 the implicit object parameter. */
5449 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5451 else
5453 if (DECL_CONSTRUCTOR_P (fn))
5455 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
5456 /* For list-initialization we consider explicit constructors
5457 and complain if one is chosen. */
5458 check_converting
5459 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5460 == LOOKUP_ONLYCONVERTING);
5462 else
5464 check_list_ctor = false;
5465 check_converting = false;
5467 strict = DEDUCE_CALL;
5468 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5471 if (first_arg)
5472 non_static_args = args;
5473 else
5474 /* Delay creating the implicit this parameter until it is needed. */
5475 non_static_args = NULL;
5477 for (lkp_iterator iter (fns); iter; ++iter)
5479 tree fn_first_arg;
5480 const vec<tree, va_gc> *fn_args;
5482 fn = *iter;
5484 if (check_converting && DECL_NONCONVERTING_P (fn))
5485 continue;
5486 if (check_list_ctor && !is_list_ctor (fn))
5487 continue;
5489 /* Figure out which set of arguments to use. */
5490 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5492 /* If this function is a non-static member and we didn't get an
5493 implicit object argument, move it out of args. */
5494 if (first_arg == NULL_TREE)
5496 unsigned int ix;
5497 tree arg;
5498 vec<tree, va_gc> *tempvec;
5499 vec_alloc (tempvec, args->length () - 1);
5500 for (ix = 1; args->iterate (ix, &arg); ++ix)
5501 tempvec->quick_push (arg);
5502 non_static_args = tempvec;
5503 first_arg = (*args)[0];
5506 fn_first_arg = first_arg;
5507 fn_args = non_static_args;
5509 else
5511 /* Otherwise, just use the list of arguments provided. */
5512 fn_first_arg = NULL_TREE;
5513 fn_args = args;
5516 if (TREE_CODE (fn) == TEMPLATE_DECL)
5517 add_template_candidate (candidates,
5519 ctype,
5520 explicit_targs,
5521 fn_first_arg,
5522 fn_args,
5523 return_type,
5524 access_path,
5525 conversion_path,
5526 flags,
5527 strict,
5528 complain);
5529 else if (!template_only)
5530 add_function_candidate (candidates,
5532 ctype,
5533 fn_first_arg,
5534 fn_args,
5535 access_path,
5536 conversion_path,
5537 flags,
5538 complain);
5542 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5543 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5545 static int
5546 op_is_ordered (tree_code code)
5548 switch (code)
5550 // 5. b @= a
5551 case MODIFY_EXPR:
5552 return (flag_strong_eval_order > 1 ? -1 : 0);
5554 // 6. a[b]
5555 case ARRAY_REF:
5556 return (flag_strong_eval_order > 1 ? 1 : 0);
5558 // 1. a.b
5559 // Not overloadable (yet).
5560 // 2. a->b
5561 // Only one argument.
5562 // 3. a->*b
5563 case MEMBER_REF:
5564 // 7. a << b
5565 case LSHIFT_EXPR:
5566 // 8. a >> b
5567 case RSHIFT_EXPR:
5568 return (flag_strong_eval_order ? 1 : 0);
5570 default:
5571 return 0;
5575 static tree
5576 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5577 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5579 struct z_candidate *candidates = 0, *cand;
5580 vec<tree, va_gc> *arglist;
5581 tree fnname;
5582 tree args[3];
5583 tree result = NULL_TREE;
5584 bool result_valid_p = false;
5585 enum tree_code code2 = NOP_EXPR;
5586 enum tree_code code_orig_arg1 = ERROR_MARK;
5587 enum tree_code code_orig_arg2 = ERROR_MARK;
5588 conversion *conv;
5589 void *p;
5590 bool strict_p;
5591 bool any_viable_p;
5593 if (error_operand_p (arg1)
5594 || error_operand_p (arg2)
5595 || error_operand_p (arg3))
5596 return error_mark_node;
5598 if (code == MODIFY_EXPR)
5600 code2 = TREE_CODE (arg3);
5601 arg3 = NULL_TREE;
5602 fnname = cp_assignment_operator_id (code2);
5604 else
5605 fnname = cp_operator_id (code);
5607 arg1 = prep_operand (arg1);
5609 bool memonly = false;
5610 switch (code)
5612 case NEW_EXPR:
5613 case VEC_NEW_EXPR:
5614 case VEC_DELETE_EXPR:
5615 case DELETE_EXPR:
5616 /* Use build_op_new_call and build_op_delete_call instead. */
5617 gcc_unreachable ();
5619 case CALL_EXPR:
5620 /* Use build_op_call instead. */
5621 gcc_unreachable ();
5623 case TRUTH_ORIF_EXPR:
5624 case TRUTH_ANDIF_EXPR:
5625 case TRUTH_AND_EXPR:
5626 case TRUTH_OR_EXPR:
5627 /* These are saved for the sake of warn_logical_operator. */
5628 code_orig_arg1 = TREE_CODE (arg1);
5629 code_orig_arg2 = TREE_CODE (arg2);
5630 break;
5631 case GT_EXPR:
5632 case LT_EXPR:
5633 case GE_EXPR:
5634 case LE_EXPR:
5635 case EQ_EXPR:
5636 case NE_EXPR:
5637 /* These are saved for the sake of maybe_warn_bool_compare. */
5638 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5639 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5640 break;
5642 /* =, ->, [], () must be non-static member functions. */
5643 case MODIFY_EXPR:
5644 if (code2 != NOP_EXPR)
5645 break;
5646 /* FALLTHRU */
5647 case COMPONENT_REF:
5648 case ARRAY_REF:
5649 memonly = true;
5650 break;
5652 default:
5653 break;
5656 arg2 = prep_operand (arg2);
5657 arg3 = prep_operand (arg3);
5659 if (code == COND_EXPR)
5660 /* Use build_conditional_expr instead. */
5661 gcc_unreachable ();
5662 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5663 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5664 goto builtin;
5666 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5667 arg2 = integer_zero_node;
5669 vec_alloc (arglist, 3);
5670 arglist->quick_push (arg1);
5671 if (arg2 != NULL_TREE)
5672 arglist->quick_push (arg2);
5673 if (arg3 != NULL_TREE)
5674 arglist->quick_push (arg3);
5676 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5677 p = conversion_obstack_alloc (0);
5679 /* Add namespace-scope operators to the list of functions to
5680 consider. */
5681 if (!memonly)
5683 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5684 fns = lookup_arg_dependent (fnname, fns, arglist);
5685 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5686 NULL_TREE, false, NULL_TREE, NULL_TREE,
5687 flags, &candidates, complain);
5690 args[0] = arg1;
5691 args[1] = arg2;
5692 args[2] = NULL_TREE;
5694 /* Add class-member operators to the candidate set. */
5695 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5697 tree fns;
5699 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5700 if (fns == error_mark_node)
5702 result = error_mark_node;
5703 goto user_defined_result_ready;
5705 if (fns)
5706 add_candidates (BASELINK_FUNCTIONS (fns),
5707 NULL_TREE, arglist, NULL_TREE,
5708 NULL_TREE, false,
5709 BASELINK_BINFO (fns),
5710 BASELINK_ACCESS_BINFO (fns),
5711 flags, &candidates, complain);
5713 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5714 only non-member functions that have type T1 or reference to
5715 cv-qualified-opt T1 for the first argument, if the first argument
5716 has an enumeration type, or T2 or reference to cv-qualified-opt
5717 T2 for the second argument, if the second argument has an
5718 enumeration type. Filter out those that don't match. */
5719 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5721 struct z_candidate **candp, **next;
5723 for (candp = &candidates; *candp; candp = next)
5725 tree parmlist, parmtype;
5726 int i, nargs = (arg2 ? 2 : 1);
5728 cand = *candp;
5729 next = &cand->next;
5731 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5733 for (i = 0; i < nargs; ++i)
5735 parmtype = TREE_VALUE (parmlist);
5737 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5738 parmtype = TREE_TYPE (parmtype);
5739 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5740 && (same_type_ignoring_top_level_qualifiers_p
5741 (TREE_TYPE (args[i]), parmtype)))
5742 break;
5744 parmlist = TREE_CHAIN (parmlist);
5747 /* No argument has an appropriate type, so remove this
5748 candidate function from the list. */
5749 if (i == nargs)
5751 *candp = cand->next;
5752 next = candp;
5757 add_builtin_candidates (&candidates, code, code2, fnname, args,
5758 flags, complain);
5760 switch (code)
5762 case COMPOUND_EXPR:
5763 case ADDR_EXPR:
5764 /* For these, the built-in candidates set is empty
5765 [over.match.oper]/3. We don't want non-strict matches
5766 because exact matches are always possible with built-in
5767 operators. The built-in candidate set for COMPONENT_REF
5768 would be empty too, but since there are no such built-in
5769 operators, we accept non-strict matches for them. */
5770 strict_p = true;
5771 break;
5773 default:
5774 strict_p = false;
5775 break;
5778 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5779 if (!any_viable_p)
5781 switch (code)
5783 case POSTINCREMENT_EXPR:
5784 case POSTDECREMENT_EXPR:
5785 /* Don't try anything fancy if we're not allowed to produce
5786 errors. */
5787 if (!(complain & tf_error))
5788 return error_mark_node;
5790 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5791 distinguish between prefix and postfix ++ and
5792 operator++() was used for both, so we allow this with
5793 -fpermissive. */
5794 else
5796 const char *msg = (flag_permissive)
5797 ? G_("no %<%D(int)%> declared for postfix %qs,"
5798 " trying prefix operator instead")
5799 : G_("no %<%D(int)%> declared for postfix %qs");
5800 permerror (loc, msg, fnname, operator_name_info[code].name);
5803 if (!flag_permissive)
5804 return error_mark_node;
5806 if (code == POSTINCREMENT_EXPR)
5807 code = PREINCREMENT_EXPR;
5808 else
5809 code = PREDECREMENT_EXPR;
5810 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5811 NULL_TREE, overload, complain);
5812 break;
5814 /* The caller will deal with these. */
5815 case ADDR_EXPR:
5816 case COMPOUND_EXPR:
5817 case COMPONENT_REF:
5818 result = NULL_TREE;
5819 result_valid_p = true;
5820 break;
5822 default:
5823 if (complain & tf_error)
5825 /* If one of the arguments of the operator represents
5826 an invalid use of member function pointer, try to report
5827 a meaningful error ... */
5828 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5829 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5830 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5831 /* We displayed the error message. */;
5832 else
5834 /* ... Otherwise, report the more generic
5835 "no matching operator found" error */
5836 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5837 print_z_candidates (loc, candidates);
5840 result = error_mark_node;
5841 break;
5844 else
5846 cand = tourney (candidates, complain);
5847 if (cand == 0)
5849 if (complain & tf_error)
5851 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5852 print_z_candidates (loc, candidates);
5854 result = error_mark_node;
5856 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5858 if (overload)
5859 *overload = cand->fn;
5861 if (resolve_args (arglist, complain) == NULL)
5862 result = error_mark_node;
5863 else
5864 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5866 if (trivial_fn_p (cand->fn))
5867 /* There won't be a CALL_EXPR. */;
5868 else if (result && result != error_mark_node)
5870 tree call = extract_call_expr (result);
5871 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5873 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5874 /* This prevents build_new_function_call from discarding this
5875 function during instantiation of the enclosing template. */
5876 KOENIG_LOOKUP_P (call) = 1;
5878 /* Specify evaluation order as per P0145R2. */
5879 CALL_EXPR_ORDERED_ARGS (call) = false;
5880 switch (op_is_ordered (code))
5882 case -1:
5883 CALL_EXPR_REVERSE_ARGS (call) = true;
5884 break;
5886 case 1:
5887 CALL_EXPR_ORDERED_ARGS (call) = true;
5888 break;
5890 default:
5891 break;
5895 else
5897 /* Give any warnings we noticed during overload resolution. */
5898 if (cand->warnings && (complain & tf_warning))
5900 struct candidate_warning *w;
5901 for (w = cand->warnings; w; w = w->next)
5902 joust (cand, w->loser, 1, complain);
5905 /* Check for comparison of different enum types. */
5906 switch (code)
5908 case GT_EXPR:
5909 case LT_EXPR:
5910 case GE_EXPR:
5911 case LE_EXPR:
5912 case EQ_EXPR:
5913 case NE_EXPR:
5914 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5915 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5916 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5917 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5918 && (complain & tf_warning))
5920 warning (OPT_Wenum_compare,
5921 "comparison between %q#T and %q#T",
5922 TREE_TYPE (arg1), TREE_TYPE (arg2));
5924 break;
5925 default:
5926 break;
5929 /* We need to strip any leading REF_BIND so that bitfields
5930 don't cause errors. This should not remove any important
5931 conversions, because builtins don't apply to class
5932 objects directly. */
5933 conv = cand->convs[0];
5934 if (conv->kind == ck_ref_bind)
5935 conv = next_conversion (conv);
5936 arg1 = convert_like (conv, arg1, complain);
5938 if (arg2)
5940 conv = cand->convs[1];
5941 if (conv->kind == ck_ref_bind)
5942 conv = next_conversion (conv);
5943 else
5944 arg2 = decay_conversion (arg2, complain);
5946 /* We need to call warn_logical_operator before
5947 converting arg2 to a boolean_type, but after
5948 decaying an enumerator to its value. */
5949 if (complain & tf_warning)
5950 warn_logical_operator (loc, code, boolean_type_node,
5951 code_orig_arg1, arg1,
5952 code_orig_arg2, arg2);
5954 arg2 = convert_like (conv, arg2, complain);
5956 if (arg3)
5958 conv = cand->convs[2];
5959 if (conv->kind == ck_ref_bind)
5960 conv = next_conversion (conv);
5961 arg3 = convert_like (conv, arg3, complain);
5967 user_defined_result_ready:
5969 /* Free all the conversions we allocated. */
5970 obstack_free (&conversion_obstack, p);
5972 if (result || result_valid_p)
5973 return result;
5975 builtin:
5976 switch (code)
5978 case MODIFY_EXPR:
5979 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5981 case INDIRECT_REF:
5982 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5984 case TRUTH_ANDIF_EXPR:
5985 case TRUTH_ORIF_EXPR:
5986 case TRUTH_AND_EXPR:
5987 case TRUTH_OR_EXPR:
5988 if (complain & tf_warning)
5989 warn_logical_operator (loc, code, boolean_type_node,
5990 code_orig_arg1, arg1,
5991 code_orig_arg2, arg2);
5992 /* Fall through. */
5993 case GT_EXPR:
5994 case LT_EXPR:
5995 case GE_EXPR:
5996 case LE_EXPR:
5997 case EQ_EXPR:
5998 case NE_EXPR:
5999 if ((complain & tf_warning)
6000 && ((code_orig_arg1 == BOOLEAN_TYPE)
6001 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
6002 maybe_warn_bool_compare (loc, code, arg1, arg2);
6003 if (complain & tf_warning && warn_tautological_compare)
6004 warn_tautological_cmp (loc, code, arg1, arg2);
6005 /* Fall through. */
6006 case PLUS_EXPR:
6007 case MINUS_EXPR:
6008 case MULT_EXPR:
6009 case TRUNC_DIV_EXPR:
6010 case MAX_EXPR:
6011 case MIN_EXPR:
6012 case LSHIFT_EXPR:
6013 case RSHIFT_EXPR:
6014 case TRUNC_MOD_EXPR:
6015 case BIT_AND_EXPR:
6016 case BIT_IOR_EXPR:
6017 case BIT_XOR_EXPR:
6018 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6020 case UNARY_PLUS_EXPR:
6021 case NEGATE_EXPR:
6022 case BIT_NOT_EXPR:
6023 case TRUTH_NOT_EXPR:
6024 case PREINCREMENT_EXPR:
6025 case POSTINCREMENT_EXPR:
6026 case PREDECREMENT_EXPR:
6027 case POSTDECREMENT_EXPR:
6028 case REALPART_EXPR:
6029 case IMAGPART_EXPR:
6030 case ABS_EXPR:
6031 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6033 case ARRAY_REF:
6034 return cp_build_array_ref (input_location, arg1, arg2, complain);
6036 case MEMBER_REF:
6037 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6038 complain),
6039 arg2, complain);
6041 /* The caller will deal with these. */
6042 case ADDR_EXPR:
6043 case COMPONENT_REF:
6044 case COMPOUND_EXPR:
6045 return NULL_TREE;
6047 default:
6048 gcc_unreachable ();
6050 return NULL_TREE;
6053 /* Wrapper for above. */
6055 tree
6056 build_new_op (location_t loc, enum tree_code code, int flags,
6057 tree arg1, tree arg2, tree arg3,
6058 tree *overload, tsubst_flags_t complain)
6060 tree ret;
6061 bool subtime = timevar_cond_start (TV_OVERLOAD);
6062 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6063 overload, complain);
6064 timevar_cond_stop (TV_OVERLOAD, subtime);
6065 return ret;
6068 /* CALL was returned by some call-building function; extract the actual
6069 CALL_EXPR from any bits that have been tacked on, e.g. by
6070 convert_from_reference. */
6072 tree
6073 extract_call_expr (tree call)
6075 while (TREE_CODE (call) == COMPOUND_EXPR)
6076 call = TREE_OPERAND (call, 1);
6077 if (REFERENCE_REF_P (call))
6078 call = TREE_OPERAND (call, 0);
6079 if (TREE_CODE (call) == TARGET_EXPR)
6080 call = TARGET_EXPR_INITIAL (call);
6081 gcc_assert (TREE_CODE (call) == CALL_EXPR
6082 || TREE_CODE (call) == AGGR_INIT_EXPR
6083 || call == error_mark_node);
6084 return call;
6087 /* Returns true if FN has two parameters, of which the second has type
6088 size_t. */
6090 static bool
6091 second_parm_is_size_t (tree fn)
6093 tree t = FUNCTION_ARG_CHAIN (fn);
6094 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6095 return false;
6096 t = TREE_CHAIN (t);
6097 if (t == void_list_node)
6098 return true;
6099 if (aligned_new_threshold && t
6100 && same_type_p (TREE_VALUE (t), align_type_node)
6101 && TREE_CHAIN (t) == void_list_node)
6102 return true;
6103 return false;
6106 /* True if T, an allocation function, has std::align_val_t as its second
6107 argument. */
6109 bool
6110 aligned_allocation_fn_p (tree t)
6112 if (!aligned_new_threshold)
6113 return false;
6115 tree a = FUNCTION_ARG_CHAIN (t);
6116 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6119 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6120 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6121 std::align_val_t. */
6123 static bool
6124 aligned_deallocation_fn_p (tree t)
6126 if (!aligned_new_threshold)
6127 return false;
6129 /* A template instance is never a usual deallocation function,
6130 regardless of its signature. */
6131 if (TREE_CODE (t) == TEMPLATE_DECL
6132 || primary_template_instantiation_p (t))
6133 return false;
6135 tree a = FUNCTION_ARG_CHAIN (t);
6136 if (same_type_p (TREE_VALUE (a), align_type_node)
6137 && TREE_CHAIN (a) == void_list_node)
6138 return true;
6139 if (!same_type_p (TREE_VALUE (a), size_type_node))
6140 return false;
6141 a = TREE_CHAIN (a);
6142 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6143 && TREE_CHAIN (a) == void_list_node)
6144 return true;
6145 return false;
6148 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6149 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6151 bool
6152 usual_deallocation_fn_p (tree t)
6154 /* A template instance is never a usual deallocation function,
6155 regardless of its signature. */
6156 if (TREE_CODE (t) == TEMPLATE_DECL
6157 || primary_template_instantiation_p (t))
6158 return false;
6160 /* If a class T has a member deallocation function named operator delete
6161 with exactly one parameter, then that function is a usual
6162 (non-placement) deallocation function. If class T does not declare
6163 such an operator delete but does declare a member deallocation
6164 function named operator delete with exactly two parameters, the second
6165 of which has type std::size_t (18.2), then this function is a usual
6166 deallocation function. */
6167 bool global = DECL_NAMESPACE_SCOPE_P (t);
6168 tree chain = FUNCTION_ARG_CHAIN (t);
6169 if (!chain)
6170 return false;
6171 if (chain == void_list_node
6172 || ((!global || flag_sized_deallocation)
6173 && second_parm_is_size_t (t)))
6174 return true;
6175 if (aligned_deallocation_fn_p (t))
6176 return true;
6177 return false;
6180 /* Build a call to operator delete. This has to be handled very specially,
6181 because the restrictions on what signatures match are different from all
6182 other call instances. For a normal delete, only a delete taking (void *)
6183 or (void *, size_t) is accepted. For a placement delete, only an exact
6184 match with the placement new is accepted.
6186 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6187 ADDR is the pointer to be deleted.
6188 SIZE is the size of the memory block to be deleted.
6189 GLOBAL_P is true if the delete-expression should not consider
6190 class-specific delete operators.
6191 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6193 If this call to "operator delete" is being generated as part to
6194 deallocate memory allocated via a new-expression (as per [expr.new]
6195 which requires that if the initialization throws an exception then
6196 we call a deallocation function), then ALLOC_FN is the allocation
6197 function. */
6199 tree
6200 build_op_delete_call (enum tree_code code, tree addr, tree size,
6201 bool global_p, tree placement,
6202 tree alloc_fn, tsubst_flags_t complain)
6204 tree fn = NULL_TREE;
6205 tree fns, fnname, type, t;
6207 if (addr == error_mark_node)
6208 return error_mark_node;
6210 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6212 fnname = cp_operator_id (code);
6214 if (CLASS_TYPE_P (type)
6215 && COMPLETE_TYPE_P (complete_type (type))
6216 && !global_p)
6217 /* In [class.free]
6219 If the result of the lookup is ambiguous or inaccessible, or if
6220 the lookup selects a placement deallocation function, the
6221 program is ill-formed.
6223 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6225 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6226 if (fns == error_mark_node)
6227 return error_mark_node;
6229 else
6230 fns = NULL_TREE;
6232 if (fns == NULL_TREE)
6233 fns = lookup_name_nonclass (fnname);
6235 /* Strip const and volatile from addr. */
6236 addr = cp_convert (ptr_type_node, addr, complain);
6238 if (placement)
6240 /* "A declaration of a placement deallocation function matches the
6241 declaration of a placement allocation function if it has the same
6242 number of parameters and, after parameter transformations (8.3.5),
6243 all parameter types except the first are identical."
6245 So we build up the function type we want and ask instantiate_type
6246 to get it for us. */
6247 t = FUNCTION_ARG_CHAIN (alloc_fn);
6248 t = tree_cons (NULL_TREE, ptr_type_node, t);
6249 t = build_function_type (void_type_node, t);
6251 fn = instantiate_type (t, fns, tf_none);
6252 if (fn == error_mark_node)
6253 return NULL_TREE;
6255 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6257 /* "If the lookup finds the two-parameter form of a usual deallocation
6258 function (3.7.4.2) and that function, considered as a placement
6259 deallocation function, would have been selected as a match for the
6260 allocation function, the program is ill-formed." */
6261 if (second_parm_is_size_t (fn))
6263 const char *const msg1
6264 = G_("exception cleanup for this placement new selects "
6265 "non-placement operator delete");
6266 const char *const msg2
6267 = G_("%qD is a usual (non-placement) deallocation "
6268 "function in C++14 (or with -fsized-deallocation)");
6270 /* But if the class has an operator delete (void *), then that is
6271 the usual deallocation function, so we shouldn't complain
6272 about using the operator delete (void *, size_t). */
6273 if (DECL_CLASS_SCOPE_P (fn))
6274 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6275 iter; ++iter)
6277 tree elt = *iter;
6278 if (usual_deallocation_fn_p (elt)
6279 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6280 goto ok;
6282 /* Before C++14 a two-parameter global deallocation function is
6283 always a placement deallocation function, but warn if
6284 -Wc++14-compat. */
6285 else if (!flag_sized_deallocation)
6287 if ((complain & tf_warning)
6288 && warning (OPT_Wc__14_compat, msg1))
6289 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6290 goto ok;
6293 if (complain & tf_warning_or_error)
6295 if (permerror (input_location, msg1))
6297 /* Only mention C++14 for namespace-scope delete. */
6298 if (DECL_NAMESPACE_SCOPE_P (fn))
6299 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6300 else
6301 inform (DECL_SOURCE_LOCATION (fn),
6302 "%qD is a usual (non-placement) deallocation "
6303 "function", fn);
6306 else
6307 return error_mark_node;
6308 ok:;
6311 else
6312 /* "Any non-placement deallocation function matches a non-placement
6313 allocation function. If the lookup finds a single matching
6314 deallocation function, that function will be called; otherwise, no
6315 deallocation function will be called." */
6316 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6318 tree elt = *iter;
6319 if (usual_deallocation_fn_p (elt))
6321 if (!fn)
6323 fn = elt;
6324 continue;
6327 /* -- If the type has new-extended alignment, a function with a
6328 parameter of type std::align_val_t is preferred; otherwise a
6329 function without such a parameter is preferred. If exactly one
6330 preferred function is found, that function is selected and the
6331 selection process terminates. If more than one preferred
6332 function is found, all non-preferred functions are eliminated
6333 from further consideration. */
6334 if (aligned_new_threshold)
6336 bool want_align = type_has_new_extended_alignment (type);
6337 bool fn_align = aligned_deallocation_fn_p (fn);
6338 bool elt_align = aligned_deallocation_fn_p (elt);
6340 if (elt_align != fn_align)
6342 if (want_align == elt_align)
6343 fn = elt;
6344 continue;
6348 /* -- If the deallocation functions have class scope, the one
6349 without a parameter of type std::size_t is selected. */
6350 bool want_size;
6351 if (DECL_CLASS_SCOPE_P (fn))
6352 want_size = false;
6354 /* -- If the type is complete and if, for the second alternative
6355 (delete array) only, the operand is a pointer to a class type
6356 with a non-trivial destructor or a (possibly multi-dimensional)
6357 array thereof, the function with a parameter of type std::size_t
6358 is selected.
6360 -- Otherwise, it is unspecified whether a deallocation function
6361 with a parameter of type std::size_t is selected. */
6362 else
6364 want_size = COMPLETE_TYPE_P (type);
6365 if (code == VEC_DELETE_EXPR
6366 && !TYPE_VEC_NEW_USES_COOKIE (type))
6367 /* We need a cookie to determine the array size. */
6368 want_size = false;
6370 bool fn_size = second_parm_is_size_t (fn);
6371 bool elt_size = second_parm_is_size_t (elt);
6372 gcc_assert (fn_size != elt_size);
6373 if (want_size == elt_size)
6374 fn = elt;
6378 /* If we have a matching function, call it. */
6379 if (fn)
6381 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6383 /* If the FN is a member function, make sure that it is
6384 accessible. */
6385 if (BASELINK_P (fns))
6386 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6387 complain);
6389 /* Core issue 901: It's ok to new a type with deleted delete. */
6390 if (DECL_DELETED_FN (fn) && alloc_fn)
6391 return NULL_TREE;
6393 if (placement)
6395 /* The placement args might not be suitable for overload
6396 resolution at this point, so build the call directly. */
6397 int nargs = call_expr_nargs (placement);
6398 tree *argarray = XALLOCAVEC (tree, nargs);
6399 int i;
6400 argarray[0] = addr;
6401 for (i = 1; i < nargs; i++)
6402 argarray[i] = CALL_EXPR_ARG (placement, i);
6403 if (!mark_used (fn, complain) && !(complain & tf_error))
6404 return error_mark_node;
6405 return build_cxx_call (fn, nargs, argarray, complain);
6407 else
6409 tree ret;
6410 vec<tree, va_gc> *args = make_tree_vector ();
6411 args->quick_push (addr);
6412 if (second_parm_is_size_t (fn))
6413 args->quick_push (size);
6414 if (aligned_deallocation_fn_p (fn))
6416 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6417 args->quick_push (al);
6419 ret = cp_build_function_call_vec (fn, &args, complain);
6420 release_tree_vector (args);
6421 return ret;
6425 /* [expr.new]
6427 If no unambiguous matching deallocation function can be found,
6428 propagating the exception does not cause the object's memory to
6429 be freed. */
6430 if (alloc_fn)
6432 if ((complain & tf_warning)
6433 && !placement)
6434 warning (0, "no corresponding deallocation function for %qD",
6435 alloc_fn);
6436 return NULL_TREE;
6439 if (complain & tf_error)
6440 error ("no suitable %<operator %s%> for %qT",
6441 operator_name_info[(int)code].name, type);
6442 return error_mark_node;
6445 /* If the current scope isn't allowed to access DECL along
6446 BASETYPE_PATH, give an error. The most derived class in
6447 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6448 the declaration to use in the error diagnostic. */
6450 bool
6451 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6452 tsubst_flags_t complain, access_failure_info *afi)
6454 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6456 if (flag_new_inheriting_ctors
6457 && DECL_INHERITED_CTOR (decl))
6459 /* 7.3.3/18: The additional constructors are accessible if they would be
6460 accessible when used to construct an object of the corresponding base
6461 class. */
6462 decl = strip_inheriting_ctors (decl);
6463 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6464 ba_any, NULL, complain);
6467 if (!accessible_p (basetype_path, decl, true))
6469 if (complain & tf_error)
6471 if (flag_new_inheriting_ctors)
6472 diag_decl = strip_inheriting_ctors (diag_decl);
6473 if (TREE_PRIVATE (decl))
6475 error ("%q#D is private within this context", diag_decl);
6476 inform (DECL_SOURCE_LOCATION (diag_decl),
6477 "declared private here");
6478 if (afi)
6479 afi->record_access_failure (basetype_path, diag_decl);
6481 else if (TREE_PROTECTED (decl))
6483 error ("%q#D is protected within this context", diag_decl);
6484 inform (DECL_SOURCE_LOCATION (diag_decl),
6485 "declared protected here");
6486 if (afi)
6487 afi->record_access_failure (basetype_path, diag_decl);
6489 else
6491 error ("%q#D is inaccessible within this context", diag_decl);
6492 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6493 if (afi)
6494 afi->record_access_failure (basetype_path, diag_decl);
6497 return false;
6500 return true;
6503 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6504 bitwise or of LOOKUP_* values. If any errors are warnings are
6505 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6506 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6507 to NULL. */
6509 static tree
6510 build_temp (tree expr, tree type, int flags,
6511 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6513 int savew, savee;
6514 vec<tree, va_gc> *args;
6516 *diagnostic_kind = DK_UNSPECIFIED;
6518 /* If the source is a packed field, calling the copy constructor will require
6519 binding the field to the reference parameter to the copy constructor, and
6520 we'll end up with an infinite loop. If we can use a bitwise copy, then
6521 do that now. */
6522 if ((lvalue_kind (expr) & clk_packed)
6523 && CLASS_TYPE_P (TREE_TYPE (expr))
6524 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6525 return get_target_expr_sfinae (expr, complain);
6527 savew = warningcount + werrorcount, savee = errorcount;
6528 args = make_tree_vector_single (expr);
6529 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6530 &args, type, flags, complain);
6531 release_tree_vector (args);
6532 if (warningcount + werrorcount > savew)
6533 *diagnostic_kind = DK_WARNING;
6534 else if (errorcount > savee)
6535 *diagnostic_kind = DK_ERROR;
6536 return expr;
6539 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6540 EXPR is implicitly converted to type TOTYPE.
6541 FN and ARGNUM are used for diagnostics. */
6543 static void
6544 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6546 /* Issue warnings about peculiar, but valid, uses of NULL. */
6547 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
6548 && ARITHMETIC_TYPE_P (totype))
6550 source_location loc =
6551 expansion_point_location_if_in_system_header (input_location);
6553 if (fn)
6554 warning_at (loc, OPT_Wconversion_null,
6555 "passing NULL to non-pointer argument %P of %qD",
6556 argnum, fn);
6557 else
6558 warning_at (loc, OPT_Wconversion_null,
6559 "converting to non-pointer type %qT from NULL", totype);
6562 /* Issue warnings if "false" is converted to a NULL pointer */
6563 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6564 && TYPE_PTR_P (totype))
6566 if (fn)
6567 warning_at (input_location, OPT_Wconversion_null,
6568 "converting %<false%> to pointer type for argument %P "
6569 "of %qD", argnum, fn);
6570 else
6571 warning_at (input_location, OPT_Wconversion_null,
6572 "converting %<false%> to pointer type %qT", totype);
6576 /* We gave a diagnostic during a conversion. If this was in the second
6577 standard conversion sequence of a user-defined conversion sequence, say
6578 which user-defined conversion. */
6580 static void
6581 maybe_print_user_conv_context (conversion *convs)
6583 if (convs->user_conv_p)
6584 for (conversion *t = convs; t; t = next_conversion (t))
6585 if (t->kind == ck_user)
6587 print_z_candidate (0, " after user-defined conversion:",
6588 t->cand);
6589 break;
6593 /* Perform the conversions in CONVS on the expression EXPR. FN and
6594 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6595 indicates the `this' argument of a method. INNER is nonzero when
6596 being called to continue a conversion chain. It is negative when a
6597 reference binding will be applied, positive otherwise. If
6598 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6599 conversions will be emitted if appropriate. If C_CAST_P is true,
6600 this conversion is coming from a C-style cast; in that case,
6601 conversions to inaccessible bases are permitted. */
6603 static tree
6604 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6605 bool issue_conversion_warnings,
6606 bool c_cast_p, tsubst_flags_t complain)
6608 tree totype = convs->type;
6609 diagnostic_t diag_kind;
6610 int flags;
6611 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6613 if (convs->bad_p && !(complain & tf_error))
6614 return error_mark_node;
6616 if (convs->bad_p
6617 && convs->kind != ck_user
6618 && convs->kind != ck_list
6619 && convs->kind != ck_ambig
6620 && (convs->kind != ck_ref_bind
6621 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6622 && (convs->kind != ck_rvalue
6623 || SCALAR_TYPE_P (totype))
6624 && convs->kind != ck_base)
6626 bool complained = false;
6627 conversion *t = convs;
6629 /* Give a helpful error if this is bad because of excess braces. */
6630 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6631 && SCALAR_TYPE_P (totype)
6632 && CONSTRUCTOR_NELTS (expr) > 0
6633 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6635 complained = permerror (loc, "too many braces around initializer "
6636 "for %qT", totype);
6637 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6638 && CONSTRUCTOR_NELTS (expr) == 1)
6639 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6642 /* Give a helpful error if this is bad because a conversion to bool
6643 from std::nullptr_t requires direct-initialization. */
6644 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6645 && TREE_CODE (totype) == BOOLEAN_TYPE)
6646 complained = permerror (loc, "converting to %qH from %qI requires "
6647 "direct-initialization",
6648 totype, TREE_TYPE (expr));
6650 for (; t ; t = next_conversion (t))
6652 if (t->kind == ck_user && t->cand->reason)
6654 complained = permerror (loc, "invalid user-defined conversion "
6655 "from %qH to %qI", TREE_TYPE (expr),
6656 totype);
6657 if (complained)
6658 print_z_candidate (loc, "candidate is:", t->cand);
6659 expr = convert_like_real (t, expr, fn, argnum,
6660 /*issue_conversion_warnings=*/false,
6661 /*c_cast_p=*/false,
6662 complain);
6663 if (convs->kind == ck_ref_bind)
6664 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6665 LOOKUP_NORMAL, NULL_TREE,
6666 complain);
6667 else
6668 expr = cp_convert (totype, expr, complain);
6669 if (complained && fn)
6670 inform (DECL_SOURCE_LOCATION (fn),
6671 " initializing argument %P of %qD", argnum, fn);
6672 return expr;
6674 else if (t->kind == ck_user || !t->bad_p)
6676 expr = convert_like_real (t, expr, fn, argnum,
6677 /*issue_conversion_warnings=*/false,
6678 /*c_cast_p=*/false,
6679 complain);
6680 break;
6682 else if (t->kind == ck_ambig)
6683 return convert_like_real (t, expr, fn, argnum,
6684 /*issue_conversion_warnings=*/false,
6685 /*c_cast_p=*/false,
6686 complain);
6687 else if (t->kind == ck_identity)
6688 break;
6690 if (!complained)
6691 complained = permerror (loc, "invalid conversion from %qH to %qI",
6692 TREE_TYPE (expr), totype);
6693 if (complained && fn)
6694 inform (DECL_SOURCE_LOCATION (fn),
6695 " initializing argument %P of %qD", argnum, fn);
6697 return cp_convert (totype, expr, complain);
6700 if (issue_conversion_warnings && (complain & tf_warning))
6701 conversion_null_warnings (totype, expr, fn, argnum);
6703 switch (convs->kind)
6705 case ck_user:
6707 struct z_candidate *cand = convs->cand;
6708 tree convfn = cand->fn;
6710 /* When converting from an init list we consider explicit
6711 constructors, but actually trying to call one is an error. */
6712 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6713 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6714 /* Unless this is for direct-list-initialization. */
6715 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6716 /* And in C++98 a default constructor can't be explicit. */
6717 && cxx_dialect >= cxx11)
6719 if (!(complain & tf_error))
6720 return error_mark_node;
6721 location_t loc = location_of (expr);
6722 if (CONSTRUCTOR_NELTS (expr) == 0
6723 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6725 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6726 "would use explicit constructor %qD",
6727 totype, convfn))
6728 inform (loc, "in C++11 and above a default constructor "
6729 "can be explicit");
6731 else
6732 error ("converting to %qT from initializer list would use "
6733 "explicit constructor %qD", totype, convfn);
6736 /* If we're initializing from {}, it's value-initialization. */
6737 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6738 && CONSTRUCTOR_NELTS (expr) == 0
6739 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6741 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6742 expr = build_value_init (totype, complain);
6743 expr = get_target_expr_sfinae (expr, complain);
6744 if (expr != error_mark_node)
6746 TARGET_EXPR_LIST_INIT_P (expr) = true;
6747 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6749 return expr;
6752 expr = mark_rvalue_use (expr);
6754 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6755 any more UDCs. */
6756 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6757 complain);
6759 /* If this is a constructor or a function returning an aggr type,
6760 we need to build up a TARGET_EXPR. */
6761 if (DECL_CONSTRUCTOR_P (convfn))
6763 expr = build_cplus_new (totype, expr, complain);
6765 /* Remember that this was list-initialization. */
6766 if (convs->check_narrowing && expr != error_mark_node)
6767 TARGET_EXPR_LIST_INIT_P (expr) = true;
6770 return expr;
6772 case ck_identity:
6773 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6775 int nelts = CONSTRUCTOR_NELTS (expr);
6776 if (nelts == 0)
6777 expr = build_value_init (totype, complain);
6778 else if (nelts == 1)
6779 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6780 else
6781 gcc_unreachable ();
6783 expr = mark_rvalue_use (expr);
6785 if (type_unknown_p (expr))
6786 expr = instantiate_type (totype, expr, complain);
6787 return expr;
6788 case ck_ambig:
6789 /* We leave bad_p off ck_ambig because overload resolution considers
6790 it valid, it just fails when we try to perform it. So we need to
6791 check complain here, too. */
6792 if (complain & tf_error)
6794 /* Call build_user_type_conversion again for the error. */
6795 build_user_type_conversion (totype, convs->u.expr, LOOKUP_IMPLICIT,
6796 complain);
6797 if (fn)
6798 inform (DECL_SOURCE_LOCATION (fn),
6799 " initializing argument %P of %qD", argnum, fn);
6801 return error_mark_node;
6803 case ck_list:
6805 /* Conversion to std::initializer_list<T>. */
6806 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6807 tree new_ctor = build_constructor (init_list_type_node, NULL);
6808 unsigned len = CONSTRUCTOR_NELTS (expr);
6809 tree array, val, field;
6810 vec<constructor_elt, va_gc> *vec = NULL;
6811 unsigned ix;
6813 /* Convert all the elements. */
6814 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6816 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6817 false, false, complain);
6818 if (sub == error_mark_node)
6819 return sub;
6820 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6821 && !check_narrowing (TREE_TYPE (sub), val, complain))
6822 return error_mark_node;
6823 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6824 if (!TREE_CONSTANT (sub))
6825 TREE_CONSTANT (new_ctor) = false;
6827 /* Build up the array. */
6828 elttype = cp_build_qualified_type
6829 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6830 array = build_array_of_n_type (elttype, len);
6831 array = finish_compound_literal (array, new_ctor, complain);
6832 /* Take the address explicitly rather than via decay_conversion
6833 to avoid the error about taking the address of a temporary. */
6834 array = cp_build_addr_expr (array, complain);
6835 array = cp_convert (build_pointer_type (elttype), array, complain);
6836 if (array == error_mark_node)
6837 return error_mark_node;
6839 /* Build up the initializer_list object. */
6840 totype = complete_type (totype);
6841 field = next_initializable_field (TYPE_FIELDS (totype));
6842 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6843 field = next_initializable_field (DECL_CHAIN (field));
6844 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6845 new_ctor = build_constructor (totype, vec);
6846 return get_target_expr_sfinae (new_ctor, complain);
6849 case ck_aggr:
6850 if (TREE_CODE (totype) == COMPLEX_TYPE)
6852 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6853 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6854 real = perform_implicit_conversion (TREE_TYPE (totype),
6855 real, complain);
6856 imag = perform_implicit_conversion (TREE_TYPE (totype),
6857 imag, complain);
6858 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6859 return expr;
6861 expr = reshape_init (totype, expr, complain);
6862 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6863 complain);
6864 if (expr != error_mark_node)
6865 TARGET_EXPR_LIST_INIT_P (expr) = true;
6866 return expr;
6868 default:
6869 break;
6872 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6873 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6874 c_cast_p,
6875 complain);
6876 if (expr == error_mark_node)
6877 return error_mark_node;
6879 switch (convs->kind)
6881 case ck_rvalue:
6882 expr = decay_conversion (expr, complain);
6883 if (expr == error_mark_node)
6885 if (complain & tf_error)
6887 maybe_print_user_conv_context (convs);
6888 if (fn)
6889 inform (DECL_SOURCE_LOCATION (fn),
6890 " initializing argument %P of %qD", argnum, fn);
6892 return error_mark_node;
6895 if (! MAYBE_CLASS_TYPE_P (totype))
6896 return expr;
6898 /* Don't introduce copies when passing arguments along to the inherited
6899 constructor. */
6900 if (current_function_decl
6901 && flag_new_inheriting_ctors
6902 && DECL_INHERITED_CTOR (current_function_decl))
6903 return expr;
6905 /* Fall through. */
6906 case ck_base:
6907 if (convs->kind == ck_base && !convs->need_temporary_p)
6909 /* We are going to bind a reference directly to a base-class
6910 subobject of EXPR. */
6911 /* Build an expression for `*((base*) &expr)'. */
6912 expr = convert_to_base (expr, totype,
6913 !c_cast_p, /*nonnull=*/true, complain);
6914 return expr;
6917 /* Copy-initialization where the cv-unqualified version of the source
6918 type is the same class as, or a derived class of, the class of the
6919 destination [is treated as direct-initialization]. [dcl.init] */
6920 flags = LOOKUP_NORMAL;
6921 if (convs->user_conv_p)
6922 /* This conversion is being done in the context of a user-defined
6923 conversion (i.e. the second step of copy-initialization), so
6924 don't allow any more. */
6925 flags |= LOOKUP_NO_CONVERSION;
6926 else
6927 flags |= LOOKUP_ONLYCONVERTING;
6928 if (convs->rvaluedness_matches_p)
6929 flags |= LOOKUP_PREFER_RVALUE;
6930 if (TREE_CODE (expr) == TARGET_EXPR
6931 && TARGET_EXPR_LIST_INIT_P (expr))
6932 /* Copy-list-initialization doesn't actually involve a copy. */
6933 return expr;
6934 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6935 if (diag_kind && complain)
6937 maybe_print_user_conv_context (convs);
6938 if (fn)
6939 inform (DECL_SOURCE_LOCATION (fn),
6940 " initializing argument %P of %qD", argnum, fn);
6943 return build_cplus_new (totype, expr, complain);
6945 case ck_ref_bind:
6947 tree ref_type = totype;
6949 if (convs->bad_p && !next_conversion (convs)->bad_p)
6951 tree extype = TREE_TYPE (expr);
6952 if (TYPE_REF_IS_RVALUE (ref_type)
6953 && lvalue_p (expr))
6954 error_at (loc, "cannot bind rvalue reference of type %qH to "
6955 "lvalue of type %qI", totype, extype);
6956 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6957 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6958 error_at (loc, "cannot bind non-const lvalue reference of "
6959 "type %qH to an rvalue of type %qI", totype, extype);
6960 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6961 error_at (loc, "binding reference of type %qH to %qI "
6962 "discards qualifiers", totype, extype);
6963 else
6964 gcc_unreachable ();
6965 maybe_print_user_conv_context (convs);
6966 if (fn)
6967 inform (DECL_SOURCE_LOCATION (fn),
6968 " initializing argument %P of %qD", argnum, fn);
6969 return error_mark_node;
6972 /* If necessary, create a temporary.
6974 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6975 that need temporaries, even when their types are reference
6976 compatible with the type of reference being bound, so the
6977 upcoming call to cp_build_addr_expr doesn't fail. */
6978 if (convs->need_temporary_p
6979 || TREE_CODE (expr) == CONSTRUCTOR
6980 || TREE_CODE (expr) == VA_ARG_EXPR)
6982 /* Otherwise, a temporary of type "cv1 T1" is created and
6983 initialized from the initializer expression using the rules
6984 for a non-reference copy-initialization (8.5). */
6986 tree type = TREE_TYPE (ref_type);
6987 cp_lvalue_kind lvalue = lvalue_kind (expr);
6989 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6990 (type, next_conversion (convs)->type));
6991 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
6992 && !TYPE_REF_IS_RVALUE (ref_type))
6994 /* If the reference is volatile or non-const, we
6995 cannot create a temporary. */
6996 if (lvalue & clk_bitfield)
6997 error_at (loc, "cannot bind bitfield %qE to %qT",
6998 expr, ref_type);
6999 else if (lvalue & clk_packed)
7000 error_at (loc, "cannot bind packed field %qE to %qT",
7001 expr, ref_type);
7002 else
7003 error_at (loc, "cannot bind rvalue %qE to %qT",
7004 expr, ref_type);
7005 return error_mark_node;
7007 /* If the source is a packed field, and we must use a copy
7008 constructor, then building the target expr will require
7009 binding the field to the reference parameter to the
7010 copy constructor, and we'll end up with an infinite
7011 loop. If we can use a bitwise copy, then we'll be
7012 OK. */
7013 if ((lvalue & clk_packed)
7014 && CLASS_TYPE_P (type)
7015 && type_has_nontrivial_copy_init (type))
7017 error_at (loc, "cannot bind packed field %qE to %qT",
7018 expr, ref_type);
7019 return error_mark_node;
7021 if (lvalue & clk_bitfield)
7023 expr = convert_bitfield_to_declared_type (expr);
7024 expr = fold_convert (type, expr);
7026 expr = build_target_expr_with_type (expr, type, complain);
7029 /* Take the address of the thing to which we will bind the
7030 reference. */
7031 expr = cp_build_addr_expr (expr, complain);
7032 if (expr == error_mark_node)
7033 return error_mark_node;
7035 /* Convert it to a pointer to the type referred to by the
7036 reference. This will adjust the pointer if a derived to
7037 base conversion is being performed. */
7038 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7039 expr, complain);
7040 /* Convert the pointer to the desired reference type. */
7041 return build_nop (ref_type, expr);
7044 case ck_lvalue:
7045 return decay_conversion (expr, complain);
7047 case ck_fnptr:
7048 /* ??? Should the address of a transaction-safe pointer point to the TM
7049 clone, and this conversion look up the primary function? */
7050 return build_nop (totype, expr);
7052 case ck_qual:
7053 /* Warn about deprecated conversion if appropriate. */
7054 string_conv_p (totype, expr, 1);
7055 break;
7057 case ck_ptr:
7058 if (convs->base_p)
7059 expr = convert_to_base (expr, totype, !c_cast_p,
7060 /*nonnull=*/false, complain);
7061 return build_nop (totype, expr);
7063 case ck_pmem:
7064 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7065 c_cast_p, complain);
7067 default:
7068 break;
7071 if (convs->check_narrowing
7072 && !check_narrowing (totype, expr, complain))
7073 return error_mark_node;
7075 if (issue_conversion_warnings)
7076 expr = cp_convert_and_check (totype, expr, complain);
7077 else
7078 expr = cp_convert (totype, expr, complain);
7080 return expr;
7083 /* ARG is being passed to a varargs function. Perform any conversions
7084 required. Return the converted value. */
7086 tree
7087 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7089 tree arg_type;
7090 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7092 /* [expr.call]
7094 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7095 standard conversions are performed. */
7096 arg = decay_conversion (arg, complain);
7097 arg_type = TREE_TYPE (arg);
7098 /* [expr.call]
7100 If the argument has integral or enumeration type that is subject
7101 to the integral promotions (_conv.prom_), or a floating point
7102 type that is subject to the floating point promotion
7103 (_conv.fpprom_), the value of the argument is converted to the
7104 promoted type before the call. */
7105 if (TREE_CODE (arg_type) == REAL_TYPE
7106 && (TYPE_PRECISION (arg_type)
7107 < TYPE_PRECISION (double_type_node))
7108 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7110 if ((complain & tf_warning)
7111 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7112 warning_at (loc, OPT_Wdouble_promotion,
7113 "implicit conversion from %qH to %qI when passing "
7114 "argument to function",
7115 arg_type, double_type_node);
7116 arg = convert_to_real_nofold (double_type_node, arg);
7118 else if (NULLPTR_TYPE_P (arg_type))
7119 arg = null_pointer_node;
7120 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7122 if (SCOPED_ENUM_P (arg_type))
7124 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7125 complain);
7126 prom = cp_perform_integral_promotions (prom, complain);
7127 if (abi_version_crosses (6)
7128 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7129 && (complain & tf_warning))
7130 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7131 "%qT before -fabi-version=6, %qT after", arg_type,
7132 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7133 if (!abi_version_at_least (6))
7134 arg = prom;
7136 else
7137 arg = cp_perform_integral_promotions (arg, complain);
7140 arg = require_complete_type_sfinae (arg, complain);
7141 arg_type = TREE_TYPE (arg);
7143 if (arg != error_mark_node
7144 /* In a template (or ill-formed code), we can have an incomplete type
7145 even after require_complete_type_sfinae, in which case we don't know
7146 whether it has trivial copy or not. */
7147 && COMPLETE_TYPE_P (arg_type))
7149 /* Build up a real lvalue-to-rvalue conversion in case the
7150 copy constructor is trivial but not callable. */
7151 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
7152 force_rvalue (arg, complain);
7154 /* [expr.call] 5.2.2/7:
7155 Passing a potentially-evaluated argument of class type (Clause 9)
7156 with a non-trivial copy constructor or a non-trivial destructor
7157 with no corresponding parameter is conditionally-supported, with
7158 implementation-defined semantics.
7160 We support it as pass-by-invisible-reference, just like a normal
7161 value parameter.
7163 If the call appears in the context of a sizeof expression,
7164 it is not potentially-evaluated. */
7165 if (cp_unevaluated_operand == 0
7166 && (type_has_nontrivial_copy_init (arg_type)
7167 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
7169 if (complain & tf_warning)
7170 warning (OPT_Wconditionally_supported,
7171 "passing objects of non-trivially-copyable "
7172 "type %q#T through %<...%> is conditionally supported",
7173 arg_type);
7174 return cp_build_addr_expr (arg, complain);
7178 return arg;
7181 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7183 tree
7184 build_x_va_arg (source_location loc, tree expr, tree type)
7186 if (processing_template_decl)
7188 tree r = build_min (VA_ARG_EXPR, type, expr);
7189 SET_EXPR_LOCATION (r, loc);
7190 return r;
7193 type = complete_type_or_else (type, NULL_TREE);
7195 if (expr == error_mark_node || !type)
7196 return error_mark_node;
7198 expr = mark_lvalue_use (expr);
7200 if (TREE_CODE (type) == REFERENCE_TYPE)
7202 error ("cannot receive reference type %qT through %<...%>", type);
7203 return error_mark_node;
7206 if (type_has_nontrivial_copy_init (type)
7207 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7209 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7210 it as pass by invisible reference. */
7211 warning_at (loc, OPT_Wconditionally_supported,
7212 "receiving objects of non-trivially-copyable type %q#T "
7213 "through %<...%> is conditionally-supported", type);
7215 tree ref = cp_build_reference_type (type, false);
7216 expr = build_va_arg (loc, expr, ref);
7217 return convert_from_reference (expr);
7220 tree ret = build_va_arg (loc, expr, type);
7221 if (CLASS_TYPE_P (type))
7222 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7223 know how to handle it. */
7224 ret = get_target_expr (ret);
7225 return ret;
7228 /* TYPE has been given to va_arg. Apply the default conversions which
7229 would have happened when passed via ellipsis. Return the promoted
7230 type, or the passed type if there is no change. */
7232 tree
7233 cxx_type_promotes_to (tree type)
7235 tree promote;
7237 /* Perform the array-to-pointer and function-to-pointer
7238 conversions. */
7239 type = type_decays_to (type);
7241 promote = type_promotes_to (type);
7242 if (same_type_p (type, promote))
7243 promote = type;
7245 return promote;
7248 /* ARG is a default argument expression being passed to a parameter of
7249 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7250 zero-based argument number. Do any required conversions. Return
7251 the converted value. */
7253 static GTY(()) vec<tree, va_gc> *default_arg_context;
7254 void
7255 push_defarg_context (tree fn)
7256 { vec_safe_push (default_arg_context, fn); }
7258 void
7259 pop_defarg_context (void)
7260 { default_arg_context->pop (); }
7262 tree
7263 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7264 tsubst_flags_t complain)
7266 int i;
7267 tree t;
7269 /* See through clones. */
7270 fn = DECL_ORIGIN (fn);
7271 /* And inheriting ctors. */
7272 if (flag_new_inheriting_ctors)
7273 fn = strip_inheriting_ctors (fn);
7275 /* Detect recursion. */
7276 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7277 if (t == fn)
7279 if (complain & tf_error)
7280 error ("recursive evaluation of default argument for %q#D", fn);
7281 return error_mark_node;
7284 /* If the ARG is an unparsed default argument expression, the
7285 conversion cannot be performed. */
7286 if (TREE_CODE (arg) == DEFAULT_ARG)
7288 if (complain & tf_error)
7289 error ("call to %qD uses the default argument for parameter %P, which "
7290 "is not yet defined", fn, parmnum);
7291 return error_mark_node;
7294 push_defarg_context (fn);
7296 if (fn && DECL_TEMPLATE_INFO (fn))
7297 arg = tsubst_default_argument (fn, type, arg, complain);
7299 /* Due to:
7301 [dcl.fct.default]
7303 The names in the expression are bound, and the semantic
7304 constraints are checked, at the point where the default
7305 expressions appears.
7307 we must not perform access checks here. */
7308 push_deferring_access_checks (dk_no_check);
7309 /* We must make a copy of ARG, in case subsequent processing
7310 alters any part of it. */
7311 arg = break_out_target_exprs (arg);
7312 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7313 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7314 complain);
7315 arg = convert_for_arg_passing (type, arg, complain);
7316 pop_deferring_access_checks();
7318 pop_defarg_context ();
7320 return arg;
7323 /* Returns the type which will really be used for passing an argument of
7324 type TYPE. */
7326 tree
7327 type_passed_as (tree type)
7329 /* Pass classes with copy ctors by invisible reference. */
7330 if (TREE_ADDRESSABLE (type))
7332 type = build_reference_type (type);
7333 /* There are no other pointers to this temporary. */
7334 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7336 else if (targetm.calls.promote_prototypes (type)
7337 && INTEGRAL_TYPE_P (type)
7338 && COMPLETE_TYPE_P (type)
7339 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7340 type = integer_type_node;
7342 return type;
7345 /* Actually perform the appropriate conversion. */
7347 tree
7348 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7350 tree bitfield_type;
7352 /* If VAL is a bitfield, then -- since it has already been converted
7353 to TYPE -- it cannot have a precision greater than TYPE.
7355 If it has a smaller precision, we must widen it here. For
7356 example, passing "int f:3;" to a function expecting an "int" will
7357 not result in any conversion before this point.
7359 If the precision is the same we must not risk widening. For
7360 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7361 often have type "int", even though the C++ type for the field is
7362 "long long". If the value is being passed to a function
7363 expecting an "int", then no conversions will be required. But,
7364 if we call convert_bitfield_to_declared_type, the bitfield will
7365 be converted to "long long". */
7366 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7367 if (bitfield_type
7368 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7369 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7371 if (val == error_mark_node)
7373 /* Pass classes with copy ctors by invisible reference. */
7374 else if (TREE_ADDRESSABLE (type))
7375 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7376 else if (targetm.calls.promote_prototypes (type)
7377 && INTEGRAL_TYPE_P (type)
7378 && COMPLETE_TYPE_P (type)
7379 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7380 val = cp_perform_integral_promotions (val, complain);
7381 if (complain & tf_warning)
7383 if (warn_suggest_attribute_format)
7385 tree rhstype = TREE_TYPE (val);
7386 const enum tree_code coder = TREE_CODE (rhstype);
7387 const enum tree_code codel = TREE_CODE (type);
7388 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7389 && coder == codel
7390 && check_missing_format_attribute (type, rhstype))
7391 warning (OPT_Wsuggest_attribute_format,
7392 "argument of function call might be a candidate "
7393 "for a format attribute");
7395 maybe_warn_parm_abi (type, EXPR_LOC_OR_LOC (val, input_location));
7397 return val;
7400 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7401 which just decay_conversion or no conversions at all should be done.
7402 This is true for some builtins which don't act like normal functions.
7403 Return 2 if no conversions at all should be done, 1 if just
7404 decay_conversion. Return 3 for special treatment of the 3rd argument
7405 for __builtin_*_overflow_p. */
7408 magic_varargs_p (tree fn)
7410 if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE)
7411 return 2;
7413 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7414 switch (DECL_FUNCTION_CODE (fn))
7416 case BUILT_IN_CLASSIFY_TYPE:
7417 case BUILT_IN_CONSTANT_P:
7418 case BUILT_IN_NEXT_ARG:
7419 case BUILT_IN_VA_START:
7420 return 1;
7422 case BUILT_IN_ADD_OVERFLOW_P:
7423 case BUILT_IN_SUB_OVERFLOW_P:
7424 case BUILT_IN_MUL_OVERFLOW_P:
7425 return 3;
7427 default:;
7428 return lookup_attribute ("type generic",
7429 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7432 return 0;
7435 /* Returns the decl of the dispatcher function if FN is a function version. */
7437 tree
7438 get_function_version_dispatcher (tree fn)
7440 tree dispatcher_decl = NULL;
7442 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7443 && DECL_FUNCTION_VERSIONED (fn));
7445 gcc_assert (targetm.get_function_versions_dispatcher);
7446 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7448 if (dispatcher_decl == NULL)
7450 error_at (input_location, "use of multiversioned function "
7451 "without a default");
7452 return NULL;
7455 retrofit_lang_decl (dispatcher_decl);
7456 gcc_assert (dispatcher_decl != NULL);
7457 return dispatcher_decl;
7460 /* fn is a function version dispatcher that is marked used. Mark all the
7461 semantically identical function versions it will dispatch as used. */
7463 void
7464 mark_versions_used (tree fn)
7466 struct cgraph_node *node;
7467 struct cgraph_function_version_info *node_v;
7468 struct cgraph_function_version_info *it_v;
7470 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7472 node = cgraph_node::get (fn);
7473 if (node == NULL)
7474 return;
7476 gcc_assert (node->dispatcher_function);
7478 node_v = node->function_version ();
7479 if (node_v == NULL)
7480 return;
7482 /* All semantically identical versions are chained. Traverse and mark each
7483 one of them as used. */
7484 it_v = node_v->next;
7485 while (it_v != NULL)
7487 mark_used (it_v->this_node->decl);
7488 it_v = it_v->next;
7492 /* Build a call to "the copy constructor" for the type of A, even if it
7493 wouldn't be selected by normal overload resolution. Used for
7494 diagnostics. */
7496 static tree
7497 call_copy_ctor (tree a, tsubst_flags_t complain)
7499 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7500 tree binfo = TYPE_BINFO (ctype);
7501 tree copy = get_copy_ctor (ctype, complain);
7502 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7503 tree ob = build_dummy_object (ctype);
7504 vec<tree, va_gc>* args = make_tree_vector_single (a);
7505 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7506 LOOKUP_NORMAL, NULL, complain);
7507 release_tree_vector (args);
7508 return r;
7511 /* Return true iff T refers to a base field. */
7513 static bool
7514 is_base_field_ref (tree t)
7516 STRIP_NOPS (t);
7517 if (TREE_CODE (t) == ADDR_EXPR)
7518 t = TREE_OPERAND (t, 0);
7519 if (TREE_CODE (t) == COMPONENT_REF)
7520 t = TREE_OPERAND (t, 1);
7521 if (TREE_CODE (t) == FIELD_DECL)
7522 return DECL_FIELD_IS_BASE (t);
7523 return false;
7526 /* We can't elide a copy from a function returning by value to a base
7527 subobject, as the callee might clobber tail padding. Return true iff this
7528 could be that case. */
7530 static bool
7531 unsafe_copy_elision_p (tree target, tree exp)
7533 /* Copy elision only happens with a TARGET_EXPR. */
7534 if (TREE_CODE (exp) != TARGET_EXPR)
7535 return false;
7536 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7537 /* It's safe to elide the copy for a class with no tail padding. */
7538 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7539 return false;
7540 /* It's safe to elide the copy if we aren't initializing a base object. */
7541 if (!is_base_field_ref (target))
7542 return false;
7543 tree init = TARGET_EXPR_INITIAL (exp);
7544 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7545 while (TREE_CODE (init) == COMPOUND_EXPR)
7546 init = TREE_OPERAND (init, 1);
7547 return (TREE_CODE (init) == AGGR_INIT_EXPR
7548 && !AGGR_INIT_VIA_CTOR_P (init));
7551 /* Subroutine of the various build_*_call functions. Overload resolution
7552 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7553 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7554 bitmask of various LOOKUP_* flags which apply to the call itself. */
7556 static tree
7557 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7559 tree fn = cand->fn;
7560 const vec<tree, va_gc> *args = cand->args;
7561 tree first_arg = cand->first_arg;
7562 conversion **convs = cand->convs;
7563 conversion *conv;
7564 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7565 int parmlen;
7566 tree val;
7567 int i = 0;
7568 int j = 0;
7569 unsigned int arg_index = 0;
7570 int is_method = 0;
7571 int nargs;
7572 tree *argarray;
7573 bool already_used = false;
7575 /* In a template, there is no need to perform all of the work that
7576 is normally done. We are only interested in the type of the call
7577 expression, i.e., the return type of the function. Any semantic
7578 errors will be deferred until the template is instantiated. */
7579 if (processing_template_decl)
7581 tree expr, addr;
7582 tree return_type;
7583 const tree *argarray;
7584 unsigned int nargs;
7586 if (undeduced_auto_decl (fn))
7587 mark_used (fn, complain);
7589 return_type = TREE_TYPE (TREE_TYPE (fn));
7590 nargs = vec_safe_length (args);
7591 if (first_arg == NULL_TREE)
7592 argarray = args->address ();
7593 else
7595 tree *alcarray;
7596 unsigned int ix;
7597 tree arg;
7599 ++nargs;
7600 alcarray = XALLOCAVEC (tree, nargs);
7601 alcarray[0] = build_this (first_arg);
7602 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7603 alcarray[ix + 1] = arg;
7604 argarray = alcarray;
7607 addr = build_addr_func (fn, complain);
7608 if (addr == error_mark_node)
7609 return error_mark_node;
7610 expr = build_call_array_loc (input_location, return_type,
7611 addr, nargs, argarray);
7612 if (TREE_THIS_VOLATILE (fn) && cfun)
7613 current_function_returns_abnormally = 1;
7614 return convert_from_reference (expr);
7617 /* Give any warnings we noticed during overload resolution. */
7618 if (cand->warnings && (complain & tf_warning))
7620 struct candidate_warning *w;
7621 for (w = cand->warnings; w; w = w->next)
7622 joust (cand, w->loser, 1, complain);
7625 /* OK, we're actually calling this inherited constructor; set its deletedness
7626 appropriately. We can get away with doing this here because calling is
7627 the only way to refer to a constructor. */
7628 if (DECL_INHERITED_CTOR (fn))
7629 deduce_inheriting_ctor (fn);
7631 /* Make =delete work with SFINAE. */
7632 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7633 return error_mark_node;
7635 if (DECL_FUNCTION_MEMBER_P (fn))
7637 tree access_fn;
7638 /* If FN is a template function, two cases must be considered.
7639 For example:
7641 struct A {
7642 protected:
7643 template <class T> void f();
7645 template <class T> struct B {
7646 protected:
7647 void g();
7649 struct C : A, B<int> {
7650 using A::f; // #1
7651 using B<int>::g; // #2
7654 In case #1 where `A::f' is a member template, DECL_ACCESS is
7655 recorded in the primary template but not in its specialization.
7656 We check access of FN using its primary template.
7658 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7659 because it is a member of class template B, DECL_ACCESS is
7660 recorded in the specialization `B<int>::g'. We cannot use its
7661 primary template because `B<T>::g' and `B<int>::g' may have
7662 different access. */
7663 if (DECL_TEMPLATE_INFO (fn)
7664 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7665 access_fn = DECL_TI_TEMPLATE (fn);
7666 else
7667 access_fn = fn;
7668 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7669 fn, complain))
7670 return error_mark_node;
7673 /* If we're checking for implicit delete, don't bother with argument
7674 conversions. */
7675 if (flags & LOOKUP_SPECULATIVE)
7677 if (DECL_DELETED_FN (fn))
7679 if (complain & tf_error)
7680 mark_used (fn);
7681 return error_mark_node;
7683 if (cand->viable == 1)
7684 return fn;
7685 else if (!(complain & tf_error))
7686 /* Reject bad conversions now. */
7687 return error_mark_node;
7688 /* else continue to get conversion error. */
7691 /* N3276 magic doesn't apply to nested calls. */
7692 int decltype_flag = (complain & tf_decltype);
7693 complain &= ~tf_decltype;
7695 /* Find maximum size of vector to hold converted arguments. */
7696 parmlen = list_length (parm);
7697 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7698 if (parmlen > nargs)
7699 nargs = parmlen;
7700 argarray = XALLOCAVEC (tree, nargs);
7702 /* The implicit parameters to a constructor are not considered by overload
7703 resolution, and must be of the proper type. */
7704 if (DECL_CONSTRUCTOR_P (fn))
7706 tree object_arg;
7707 if (first_arg != NULL_TREE)
7709 object_arg = first_arg;
7710 first_arg = NULL_TREE;
7712 else
7714 object_arg = (*args)[arg_index];
7715 ++arg_index;
7717 argarray[j++] = build_this (object_arg);
7718 parm = TREE_CHAIN (parm);
7719 /* We should never try to call the abstract constructor. */
7720 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7722 if (DECL_HAS_VTT_PARM_P (fn))
7724 argarray[j++] = (*args)[arg_index];
7725 ++arg_index;
7726 parm = TREE_CHAIN (parm);
7729 /* Bypass access control for 'this' parameter. */
7730 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7732 tree parmtype = TREE_VALUE (parm);
7733 tree arg = build_this (first_arg != NULL_TREE
7734 ? first_arg
7735 : (*args)[arg_index]);
7736 tree argtype = TREE_TYPE (arg);
7737 tree converted_arg;
7738 tree base_binfo;
7740 if (convs[i]->bad_p)
7742 if (complain & tf_error)
7744 if (permerror (input_location, "passing %qT as %<this%> "
7745 "argument discards qualifiers",
7746 TREE_TYPE (argtype)))
7747 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7749 else
7750 return error_mark_node;
7753 /* See if the function member or the whole class type is declared
7754 final and the call can be devirtualized. */
7755 if (DECL_FINAL_P (fn)
7756 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7757 flags |= LOOKUP_NONVIRTUAL;
7759 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7760 X is called for an object that is not of type X, or of a type
7761 derived from X, the behavior is undefined.
7763 So we can assume that anything passed as 'this' is non-null, and
7764 optimize accordingly. */
7765 gcc_assert (TYPE_PTR_P (parmtype));
7766 /* Convert to the base in which the function was declared. */
7767 gcc_assert (cand->conversion_path != NULL_TREE);
7768 converted_arg = build_base_path (PLUS_EXPR,
7769 arg,
7770 cand->conversion_path,
7771 1, complain);
7772 /* Check that the base class is accessible. */
7773 if (!accessible_base_p (TREE_TYPE (argtype),
7774 BINFO_TYPE (cand->conversion_path), true))
7776 if (complain & tf_error)
7777 error ("%qT is not an accessible base of %qT",
7778 BINFO_TYPE (cand->conversion_path),
7779 TREE_TYPE (argtype));
7780 else
7781 return error_mark_node;
7783 /* If fn was found by a using declaration, the conversion path
7784 will be to the derived class, not the base declaring fn. We
7785 must convert from derived to base. */
7786 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7787 TREE_TYPE (parmtype), ba_unique,
7788 NULL, complain);
7789 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7790 base_binfo, 1, complain);
7792 argarray[j++] = converted_arg;
7793 parm = TREE_CHAIN (parm);
7794 if (first_arg != NULL_TREE)
7795 first_arg = NULL_TREE;
7796 else
7797 ++arg_index;
7798 ++i;
7799 is_method = 1;
7802 gcc_assert (first_arg == NULL_TREE);
7803 for (; arg_index < vec_safe_length (args) && parm;
7804 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7806 tree type = TREE_VALUE (parm);
7807 tree arg = (*args)[arg_index];
7808 bool conversion_warning = true;
7810 conv = convs[i];
7812 /* If the argument is NULL and used to (implicitly) instantiate a
7813 template function (and bind one of the template arguments to
7814 the type of 'long int'), we don't want to warn about passing NULL
7815 to non-pointer argument.
7816 For example, if we have this template function:
7818 template<typename T> void func(T x) {}
7820 we want to warn (when -Wconversion is enabled) in this case:
7822 void foo() {
7823 func<int>(NULL);
7826 but not in this case:
7828 void foo() {
7829 func(NULL);
7832 if (arg == null_node
7833 && DECL_TEMPLATE_INFO (fn)
7834 && cand->template_decl
7835 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7836 conversion_warning = false;
7838 /* Warn about initializer_list deduction that isn't currently in the
7839 working draft. */
7840 if (cxx_dialect > cxx98
7841 && flag_deduce_init_list
7842 && cand->template_decl
7843 && is_std_init_list (non_reference (type))
7844 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7846 tree tmpl = TI_TEMPLATE (cand->template_decl);
7847 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7848 tree patparm = get_pattern_parm (realparm, tmpl);
7849 tree pattype = TREE_TYPE (patparm);
7850 if (PACK_EXPANSION_P (pattype))
7851 pattype = PACK_EXPANSION_PATTERN (pattype);
7852 pattype = non_reference (pattype);
7854 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7855 && (cand->explicit_targs == NULL_TREE
7856 || (TREE_VEC_LENGTH (cand->explicit_targs)
7857 <= TEMPLATE_TYPE_IDX (pattype))))
7859 pedwarn (input_location, 0, "deducing %qT as %qT",
7860 non_reference (TREE_TYPE (patparm)),
7861 non_reference (type));
7862 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7863 " in call to %qD", cand->fn);
7864 pedwarn (input_location, 0,
7865 " (you can disable this with -fno-deduce-init-list)");
7869 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7870 knows not to allow any more UDCs. This needs to happen after we
7871 process cand->warnings. */
7872 if (flags & LOOKUP_NO_CONVERSION)
7873 conv->user_conv_p = true;
7875 tsubst_flags_t arg_complain = complain & (~tf_no_cleanup);
7876 if (!conversion_warning)
7877 arg_complain &= ~tf_warning;
7879 val = convert_like_with_context (conv, arg, fn, i - is_method,
7880 arg_complain);
7881 val = convert_for_arg_passing (type, val, arg_complain);
7883 if (val == error_mark_node)
7884 return error_mark_node;
7885 else
7886 argarray[j++] = val;
7889 /* Default arguments */
7890 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7892 if (TREE_VALUE (parm) == error_mark_node)
7893 return error_mark_node;
7894 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
7895 TREE_PURPOSE (parm),
7896 fn, i - is_method,
7897 complain);
7900 /* Ellipsis */
7901 int magic = magic_varargs_p (fn);
7902 for (; arg_index < vec_safe_length (args); ++arg_index)
7904 tree a = (*args)[arg_index];
7905 if ((magic == 3 && arg_index == 2) || magic == 2)
7907 /* Do no conversions for certain magic varargs. */
7908 a = mark_type_use (a);
7909 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7910 return error_mark_node;
7912 else if (magic != 0)
7913 /* For other magic varargs only do decay_conversion. */
7914 a = decay_conversion (a, complain);
7915 else if (DECL_CONSTRUCTOR_P (fn)
7916 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7917 TREE_TYPE (a)))
7919 /* Avoid infinite recursion trying to call A(...). */
7920 if (complain & tf_error)
7921 /* Try to call the actual copy constructor for a good error. */
7922 call_copy_ctor (a, complain);
7923 return error_mark_node;
7925 else
7926 a = convert_arg_to_ellipsis (a, complain);
7927 if (a == error_mark_node)
7928 return error_mark_node;
7929 argarray[j++] = a;
7932 gcc_assert (j <= nargs);
7933 nargs = j;
7935 /* Avoid to do argument-transformation, if warnings for format, and for
7936 nonnull are disabled. Just in case that at least one of them is active
7937 the check_function_arguments function might warn about something. */
7939 bool warned_p = false;
7940 if (warn_nonnull
7941 || warn_format
7942 || warn_suggest_attribute_format
7943 || warn_restrict)
7945 tree *fargs = (!nargs ? argarray
7946 : (tree *) alloca (nargs * sizeof (tree)));
7947 for (j = 0; j < nargs; j++)
7948 fargs[j] = maybe_constant_value (argarray[j]);
7950 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
7951 nargs, fargs);
7954 if (DECL_INHERITED_CTOR (fn))
7956 /* Check for passing ellipsis arguments to an inherited constructor. We
7957 could handle this by open-coding the inherited constructor rather than
7958 defining it, but let's not bother now. */
7959 if (!cp_unevaluated_operand
7960 && cand->num_convs
7961 && cand->convs[cand->num_convs-1]->ellipsis_p)
7963 if (complain & tf_error)
7965 sorry ("passing arguments to ellipsis of inherited constructor "
7966 "%qD", cand->fn);
7967 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
7969 return error_mark_node;
7972 /* A base constructor inheriting from a virtual base doesn't get the
7973 inherited arguments, just this and __vtt. */
7974 if (ctor_omit_inherited_parms (fn))
7975 nargs = 2;
7978 /* Avoid actually calling copy constructors and copy assignment operators,
7979 if possible. */
7981 if (! flag_elide_constructors)
7982 /* Do things the hard way. */;
7983 else if (cand->num_convs == 1
7984 && (DECL_COPY_CONSTRUCTOR_P (fn)
7985 || DECL_MOVE_CONSTRUCTOR_P (fn))
7986 /* It's unsafe to elide the constructor when handling
7987 a noexcept-expression, it may evaluate to the wrong
7988 value (c++/53025). */
7989 && cp_noexcept_operand == 0)
7991 tree targ;
7992 tree arg = argarray[num_artificial_parms_for (fn)];
7993 tree fa;
7994 bool trivial = trivial_fn_p (fn);
7996 /* Pull out the real argument, disregarding const-correctness. */
7997 targ = arg;
7998 /* Strip the reference binding for the constructor parameter. */
7999 if (CONVERT_EXPR_P (targ)
8000 && TREE_CODE (TREE_TYPE (targ)) == REFERENCE_TYPE)
8001 targ = TREE_OPERAND (targ, 0);
8002 /* But don't strip any other reference bindings; binding a temporary to a
8003 reference prevents copy elision. */
8004 while ((CONVERT_EXPR_P (targ)
8005 && TREE_CODE (TREE_TYPE (targ)) != REFERENCE_TYPE)
8006 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8007 targ = TREE_OPERAND (targ, 0);
8008 if (TREE_CODE (targ) == ADDR_EXPR)
8010 targ = TREE_OPERAND (targ, 0);
8011 if (!same_type_ignoring_top_level_qualifiers_p
8012 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8013 targ = NULL_TREE;
8015 else
8016 targ = NULL_TREE;
8018 if (targ)
8019 arg = targ;
8020 else
8021 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8023 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8024 subobject. */
8025 if (CHECKING_P && cxx_dialect >= cxx1z)
8026 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8027 /* It's from binding the ref parm to a packed field. */
8028 || convs[0]->need_temporary_p
8029 || seen_error ()
8030 /* See unsafe_copy_elision_p. */
8031 || DECL_BASE_CONSTRUCTOR_P (fn));
8033 /* [class.copy]: the copy constructor is implicitly defined even if
8034 the implementation elided its use. */
8035 if (!trivial || DECL_DELETED_FN (fn))
8037 if (!mark_used (fn, complain) && !(complain & tf_error))
8038 return error_mark_node;
8039 already_used = true;
8042 /* If we're creating a temp and we already have one, don't create a
8043 new one. If we're not creating a temp but we get one, use
8044 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8045 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8046 temp or an INIT_EXPR otherwise. */
8047 fa = argarray[0];
8048 if (is_dummy_object (fa))
8050 if (TREE_CODE (arg) == TARGET_EXPR)
8051 return arg;
8052 else if (trivial)
8053 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8055 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8056 && !unsafe_copy_elision_p (fa, arg))
8058 tree to = cp_stabilize_reference (cp_build_indirect_ref (fa,
8059 RO_NULL,
8060 complain));
8062 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8063 return val;
8066 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
8067 && trivial_fn_p (fn)
8068 && !DECL_DELETED_FN (fn))
8070 tree to = cp_stabilize_reference
8071 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
8072 tree type = TREE_TYPE (to);
8073 tree as_base = CLASSTYPE_AS_BASE (type);
8074 tree arg = argarray[1];
8076 if (is_really_empty_class (type))
8078 /* Avoid copying empty classes. */
8079 val = build2 (COMPOUND_EXPR, type, arg, to);
8080 TREE_NO_WARNING (val) = 1;
8082 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8084 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8085 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8086 /* Handle NSDMI that refer to the object being initialized. */
8087 replace_placeholders (arg, to);
8089 else
8091 /* We must only copy the non-tail padding parts. */
8092 tree arg0, arg2, t;
8093 tree array_type, alias_set;
8095 arg2 = TYPE_SIZE_UNIT (as_base);
8096 arg0 = cp_build_addr_expr (to, complain);
8098 array_type = build_array_type (unsigned_char_type_node,
8099 build_index_type
8100 (size_binop (MINUS_EXPR,
8101 arg2, size_int (1))));
8102 alias_set = build_int_cst (build_pointer_type (type), 0);
8103 t = build2 (MODIFY_EXPR, void_type_node,
8104 build2 (MEM_REF, array_type, arg0, alias_set),
8105 build2 (MEM_REF, array_type, arg, alias_set));
8106 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8107 TREE_NO_WARNING (val) = 1;
8110 return val;
8112 else if (!DECL_DELETED_FN (fn)
8113 && trivial_fn_p (fn))
8115 if (DECL_DESTRUCTOR_P (fn))
8116 return fold_convert (void_type_node, argarray[0]);
8117 else if (default_ctor_p (fn))
8119 if (is_dummy_object (argarray[0]))
8120 return force_target_expr (DECL_CONTEXT (fn), void_node, complain);
8121 else
8122 return cp_build_indirect_ref (argarray[0], RO_NULL, complain);
8126 /* For calls to a multi-versioned function, overload resolution
8127 returns the function with the highest target priority, that is,
8128 the version that will checked for dispatching first. If this
8129 version is inlinable, a direct call to this version can be made
8130 otherwise the call should go through the dispatcher. */
8132 if (DECL_FUNCTION_VERSIONED (fn)
8133 && (current_function_decl == NULL
8134 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8136 fn = get_function_version_dispatcher (fn);
8137 if (fn == NULL)
8138 return NULL;
8139 if (!already_used)
8140 mark_versions_used (fn);
8143 if (!already_used
8144 && !mark_used (fn, complain))
8145 return error_mark_node;
8147 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8148 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8149 virtual functions can't be constexpr. */
8150 && !in_template_function ())
8152 tree t;
8153 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8154 DECL_CONTEXT (fn),
8155 ba_any, NULL, complain);
8156 gcc_assert (binfo && binfo != error_mark_node);
8158 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8159 complain);
8160 if (TREE_SIDE_EFFECTS (argarray[0]))
8161 argarray[0] = save_expr (argarray[0]);
8162 t = build_pointer_type (TREE_TYPE (fn));
8163 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8164 TREE_TYPE (fn) = t;
8166 else
8168 fn = build_addr_func (fn, complain);
8169 if (fn == error_mark_node)
8170 return error_mark_node;
8173 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8174 if (call == error_mark_node)
8175 return call;
8176 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8178 tree c = extract_call_expr (call);
8179 /* build_new_op_1 will clear this when appropriate. */
8180 CALL_EXPR_ORDERED_ARGS (c) = true;
8182 if (warned_p)
8184 tree c = extract_call_expr (call);
8185 if (TREE_CODE (c) == CALL_EXPR)
8186 TREE_NO_WARNING (c) = 1;
8188 return call;
8191 /* Return the DECL of the first non-public data member of class TYPE
8192 or null if none can be found. */
8194 static tree
8195 first_non_public_field (tree type)
8197 if (!CLASS_TYPE_P (type))
8198 return NULL_TREE;
8200 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8202 if (TREE_CODE (field) != FIELD_DECL)
8203 continue;
8204 if (TREE_STATIC (field))
8205 continue;
8206 if (TREE_PRIVATE (field) || TREE_PROTECTED (field))
8207 return field;
8210 int i = 0;
8212 for (tree base_binfo, binfo = TYPE_BINFO (type);
8213 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8215 tree base = TREE_TYPE (base_binfo);
8217 if (tree field = first_non_public_field (base))
8218 return field;
8221 return NULL_TREE;
8224 /* Return true if all copy and move assignment operator overloads for
8225 class TYPE are trivial and at least one of them is not deleted and,
8226 when ACCESS is set, accessible. Return false otherwise. Set
8227 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8228 copy or move assignment. */
8230 static bool
8231 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8233 tree fns = cp_assignment_operator_id (NOP_EXPR);
8234 fns = lookup_fnfields_slot (type, fns);
8236 bool all_trivial = true;
8238 /* Iterate over overloads of the assignment operator, checking
8239 accessible copy assignments for triviality. */
8241 for (ovl_iterator oi (fns); oi; ++oi)
8243 tree f = *oi;
8245 /* Skip operators that aren't copy assignments. */
8246 if (!copy_fn_p (f))
8247 continue;
8249 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8250 || accessible_p (TYPE_BINFO (type), f, true));
8252 /* Skip template assignment operators and deleted functions. */
8253 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8254 continue;
8256 if (accessible)
8257 *hasassign = true;
8259 if (!accessible || !trivial_fn_p (f))
8260 all_trivial = false;
8262 /* Break early when both properties have been determined. */
8263 if (*hasassign && !all_trivial)
8264 break;
8267 /* Return true if they're all trivial and one of the expressions
8268 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8269 tree ref = cp_build_reference_type (type, false);
8270 return (all_trivial
8271 && (is_trivially_xible (MODIFY_EXPR, type, type)
8272 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8275 /* Return true if all copy and move ctor overloads for class TYPE are
8276 trivial and at least one of them is not deleted and, when ACCESS is
8277 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8278 to true when the TYPE has a (not necessarily trivial) default and copy
8279 (or move) ctor, respectively. */
8281 static bool
8282 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8284 tree fns = lookup_fnfields_slot (type, complete_ctor_identifier);
8286 bool all_trivial = true;
8288 for (ovl_iterator oi (fns); oi; ++oi)
8290 tree f = *oi;
8292 /* Skip template constructors. */
8293 if (TREE_CODE (f) != FUNCTION_DECL)
8294 continue;
8296 bool cpy_or_move_ctor_p = copy_fn_p (f);
8298 /* Skip ctors other than default, copy, and move. */
8299 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8300 continue;
8302 if (DECL_DELETED_FN (f))
8303 continue;
8305 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8306 || accessible_p (TYPE_BINFO (type), f, true));
8308 if (accessible)
8309 hasctor[cpy_or_move_ctor_p] = true;
8311 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8312 all_trivial = false;
8314 /* Break early when both properties have been determined. */
8315 if (hasctor[0] && hasctor[1] && !all_trivial)
8316 break;
8319 return all_trivial;
8322 /* Issue a warning on a call to the built-in function FNDECL if it is
8323 a raw memory write whose destination is not an object of (something
8324 like) trivial or standard layout type with a non-deleted assignment
8325 and copy ctor. Detects const correctness violations, corrupting
8326 references, virtual table pointers, and bypassing non-trivial
8327 assignments. */
8329 static void
8330 maybe_warn_class_memaccess (location_t loc, tree fndecl, tree *args)
8332 /* Except for bcopy where it's second, the destination pointer is
8333 the first argument for all functions handled here. Compute
8334 the index of the destination and source arguments. */
8335 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8336 unsigned srcidx = !dstidx;
8338 tree dest = args[dstidx];
8339 if (!dest || !TREE_TYPE (dest) || !POINTER_TYPE_P (TREE_TYPE (dest)))
8340 return;
8342 /* Remove the outermost (usually implicit) conversion to the void*
8343 argument type. */
8344 if (TREE_CODE (dest) == NOP_EXPR)
8345 dest = TREE_OPERAND (dest, 0);
8347 tree srctype = NULL_TREE;
8349 /* Determine the type of the pointed-to object and whether it's
8350 a complete class type. */
8351 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8353 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8354 return;
8356 /* Check to see if the raw memory call is made by a ctor or dtor
8357 with this as the destination argument for the destination type.
8358 If so, be more permissive. */
8359 if (current_function_decl
8360 && (DECL_CONSTRUCTOR_P (current_function_decl)
8361 || DECL_DESTRUCTOR_P (current_function_decl))
8362 && is_this_parameter (tree_strip_nop_conversions (dest)))
8364 tree ctx = DECL_CONTEXT (current_function_decl);
8365 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8367 tree binfo = TYPE_BINFO (ctx);
8369 /* A ctor and dtor for a class with no bases and no virtual functions
8370 can do whatever they want. Bail early with no further checking. */
8371 if (special && !BINFO_VTABLE (binfo) && !BINFO_N_BASE_BINFOS (binfo))
8372 return;
8375 /* True if the class is trivial. */
8376 bool trivial = trivial_type_p (desttype);
8378 /* Set to true if DESTYPE has an accessible copy assignment. */
8379 bool hasassign = false;
8380 /* True if all of the class' overloaded copy assignment operators
8381 are all trivial (and not deleted) and at least one of them is
8382 accessible. */
8383 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8385 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8386 respectively. */
8387 bool hasctors[2] = { false, false };
8389 /* True if all of the class' overloaded copy constructors are all
8390 trivial (and not deleted) and at least one of them is accessible. */
8391 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8393 /* Set FLD to the first private/protected member of the class. */
8394 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8396 /* The warning format string. */
8397 const char *warnfmt = NULL;
8398 /* A suggested alternative to offer instead of the raw memory call.
8399 Empty string when none can be come up with. */
8400 const char *suggest = "";
8401 bool warned = false;
8403 switch (DECL_FUNCTION_CODE (fndecl))
8405 case BUILT_IN_MEMSET:
8406 if (!integer_zerop (args[1]))
8408 /* Diagnose setting non-copy-assignable or non-trivial types,
8409 or types with a private member, to (potentially) non-zero
8410 bytes. Since the value of the bytes being written is unknown,
8411 suggest using assignment instead (if one exists). Also warn
8412 for writes into objects for which zero-initialization doesn't
8413 mean all bits clear (pointer-to-member data, where null is all
8414 bits set). Since the value being written is (most likely)
8415 non-zero, simply suggest assignment (but not copy assignment). */
8416 suggest = "; use assignment instead";
8417 if (!trivassign)
8418 warnfmt = G_("%qD writing to an object of type %#qT with "
8419 "no trivial copy-assignment");
8420 else if (!trivial)
8421 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8422 else if (fld)
8424 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8425 warned = warning_at (loc, OPT_Wclass_memaccess,
8426 "%qD writing to an object of type %#qT with "
8427 "%qs member %qD",
8428 fndecl, desttype, access, fld);
8430 else if (!zero_init_p (desttype))
8431 warnfmt = G_("%qD writing to an object of type %#qT containing "
8432 "a pointer to data member%s");
8434 break;
8436 /* Fall through. */
8438 case BUILT_IN_BZERO:
8439 /* Similarly to the above, diagnose clearing non-trivial or non-
8440 standard layout objects, or objects of types with no assignmenmt.
8441 Since the value being written is known to be zero, suggest either
8442 copy assignment, copy ctor, or default ctor as an alternative,
8443 depending on what's available. */
8445 if (hasassign && hasctors[0])
8446 suggest = G_("; use assignment or value-initialization instead");
8447 else if (hasassign)
8448 suggest = G_("; use assignment instead");
8449 else if (hasctors[0])
8450 suggest = G_("; use value-initialization instead");
8452 if (!trivassign)
8453 warnfmt = G_("%qD clearing an object of type %#qT with "
8454 "no trivial copy-assignment%s");
8455 else if (!trivial)
8456 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8457 else if (!zero_init_p (desttype))
8458 warnfmt = G_("%qD clearing an object of type %#qT containing "
8459 "a pointer-to-member%s");
8460 break;
8462 case BUILT_IN_BCOPY:
8463 case BUILT_IN_MEMCPY:
8464 case BUILT_IN_MEMMOVE:
8465 case BUILT_IN_MEMPCPY:
8466 /* Determine the type of the source object. */
8467 srctype = STRIP_NOPS (args[srcidx]);
8468 srctype = TREE_TYPE (TREE_TYPE (srctype));
8470 /* Since it's impossible to determine wheter the byte copy is
8471 being used in place of assignment to an existing object or
8472 as a substitute for initialization, assume it's the former.
8473 Determine the best alternative to use instead depending on
8474 what's not deleted. */
8475 if (hasassign && hasctors[1])
8476 suggest = G_("; use copy-assignment or copy-initialization instead");
8477 else if (hasassign)
8478 suggest = G_("; use copy-assignment instead");
8479 else if (hasctors[1])
8480 suggest = G_("; use copy-initialization instead");
8482 if (!trivassign)
8483 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8484 "copy-assignment%s");
8485 else if (!trivially_copyable_p (desttype))
8486 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8487 "type %#qT%s");
8488 else if (!trivcopy)
8489 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8491 else if (!trivial
8492 && !VOID_TYPE_P (srctype)
8493 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8494 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8495 srctype))
8497 /* Warn when copying into a non-trivial object from an object
8498 of a different type other than void or char. */
8499 warned = warning_at (loc, OPT_Wclass_memaccess,
8500 "%qD copying an object of non-trivial type "
8501 "%#qT from an array of %#qT",
8502 fndecl, desttype, srctype);
8504 else if (fld
8505 && !VOID_TYPE_P (srctype)
8506 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8507 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8508 srctype))
8510 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8511 warned = warning_at (loc, OPT_Wclass_memaccess,
8512 "%qD copying an object of type %#qT with "
8513 "%qs member %qD from an array of %#qT; use "
8514 "assignment or copy-initialization instead",
8515 fndecl, desttype, access, fld, srctype);
8517 else if (!trivial && TREE_CODE (args[2]) == INTEGER_CST)
8519 /* Finally, warn on partial copies. */
8520 unsigned HOST_WIDE_INT typesize
8521 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8522 if (unsigned HOST_WIDE_INT partial
8523 = tree_to_uhwi (args[2]) % typesize)
8524 warned = warning_at (loc, OPT_Wclass_memaccess,
8525 (typesize - partial > 1
8526 ? G_("%qD writing to an object of "
8527 "a non-trivial type %#qT leaves %wu "
8528 "bytes unchanged")
8529 : G_("%qD writing to an object of "
8530 "a non-trivial type %#qT leaves %wu "
8531 "byte unchanged")),
8532 fndecl, desttype, typesize - partial);
8534 break;
8536 case BUILT_IN_REALLOC:
8538 if (!trivially_copyable_p (desttype))
8539 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8540 "%#qT; use %<new%> and %<delete%> instead");
8541 else if (!trivcopy)
8542 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8543 "constructor; use %<new%> and %<delete%> instead");
8544 else if (!get_dtor (desttype, tf_none))
8545 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8546 "destructor");
8547 else if (!trivial
8548 && TREE_CODE (args[1]) == INTEGER_CST
8549 && tree_int_cst_lt (args[1], TYPE_SIZE_UNIT (desttype)))
8551 /* Finally, warn on reallocation into insufficient space. */
8552 warned = warning_at (loc, OPT_Wclass_memaccess,
8553 "%qD moving an object of non-trivial type "
8554 "%#qT and size %E into a region of size %E",
8555 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8556 args[1]);
8558 break;
8560 default:
8561 return;
8564 if (!warned && !warnfmt)
8565 return;
8567 if (warnfmt)
8569 if (suggest)
8570 warned = warning_at (loc, OPT_Wclass_memaccess,
8571 warnfmt, fndecl, desttype, suggest);
8572 else
8573 warned = warning_at (loc, OPT_Wclass_memaccess,
8574 warnfmt, fndecl, desttype);
8577 if (warned)
8578 inform (location_of (desttype), "%#qT declared here", desttype);
8581 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8582 This function performs no overload resolution, conversion, or other
8583 high-level operations. */
8585 tree
8586 build_cxx_call (tree fn, int nargs, tree *argarray,
8587 tsubst_flags_t complain)
8589 tree fndecl;
8591 /* Remember roughly where this call is. */
8592 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8593 fn = build_call_a (fn, nargs, argarray);
8594 SET_EXPR_LOCATION (fn, loc);
8596 fndecl = get_callee_fndecl (fn);
8598 /* Check that arguments to builtin functions match the expectations. */
8599 if (fndecl
8600 && DECL_BUILT_IN (fndecl)
8601 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8603 int i;
8605 /* We need to take care that values to BUILT_IN_NORMAL
8606 are reduced. */
8607 for (i = 0; i < nargs; i++)
8608 argarray[i] = fold_non_dependent_expr (argarray[i]);
8610 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8611 nargs, argarray))
8612 return error_mark_node;
8614 /* Warn if the built-in writes to an object of a non-trivial type. */
8615 if (nargs)
8616 maybe_warn_class_memaccess (loc, fndecl, argarray);
8619 /* If it is a built-in array notation function, then the return type of
8620 the function is the element type of the array passed in as array
8621 notation (i.e. the first parameter of the function). */
8622 if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR)
8624 enum built_in_function bif =
8625 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn));
8626 if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8627 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8628 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8629 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8630 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE
8631 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING)
8633 if (call_expr_nargs (fn) == 0)
8635 error_at (EXPR_LOCATION (fn), "Invalid builtin arguments");
8636 return error_mark_node;
8638 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8639 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8640 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8641 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8642 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8643 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8644 The pre-defined return-type is the correct one. */
8645 tree array_ntn = CALL_EXPR_ARG (fn, 0);
8646 TREE_TYPE (fn) = TREE_TYPE (array_ntn);
8647 return fn;
8651 if (VOID_TYPE_P (TREE_TYPE (fn)))
8652 return fn;
8654 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8655 function call is either the operand of a decltype-specifier or the
8656 right operand of a comma operator that is the operand of a
8657 decltype-specifier, a temporary object is not introduced for the
8658 prvalue. The type of the prvalue may be incomplete. */
8659 if (!(complain & tf_decltype))
8661 fn = require_complete_type_sfinae (fn, complain);
8662 if (fn == error_mark_node)
8663 return error_mark_node;
8665 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8667 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8668 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8671 return convert_from_reference (fn);
8674 /* Returns the value to use for the in-charge parameter when making a
8675 call to a function with the indicated NAME.
8677 FIXME:Can't we find a neater way to do this mapping? */
8679 tree
8680 in_charge_arg_for_name (tree name)
8682 if (IDENTIFIER_CTOR_P (name))
8684 if (name == complete_ctor_identifier)
8685 return integer_one_node;
8686 gcc_checking_assert (name == base_ctor_identifier);
8688 else
8690 if (name == complete_dtor_identifier)
8691 return integer_two_node;
8692 else if (name == deleting_dtor_identifier)
8693 return integer_three_node;
8694 gcc_checking_assert (name == base_dtor_identifier);
8697 return integer_zero_node;
8700 /* We've built up a constructor call RET. Complain if it delegates to the
8701 constructor we're currently compiling. */
8703 static void
8704 check_self_delegation (tree ret)
8706 if (TREE_CODE (ret) == TARGET_EXPR)
8707 ret = TARGET_EXPR_INITIAL (ret);
8708 tree fn = cp_get_callee_fndecl (ret);
8709 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8710 error ("constructor delegates to itself");
8713 /* Build a call to a constructor, destructor, or an assignment
8714 operator for INSTANCE, an expression with class type. NAME
8715 indicates the special member function to call; *ARGS are the
8716 arguments. ARGS may be NULL. This may change ARGS. BINFO
8717 indicates the base of INSTANCE that is to be passed as the `this'
8718 parameter to the member function called.
8720 FLAGS are the LOOKUP_* flags to use when processing the call.
8722 If NAME indicates a complete object constructor, INSTANCE may be
8723 NULL_TREE. In this case, the caller will call build_cplus_new to
8724 store the newly constructed object into a VAR_DECL. */
8726 tree
8727 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8728 tree binfo, int flags, tsubst_flags_t complain)
8730 tree fns;
8731 /* The type of the subobject to be constructed or destroyed. */
8732 tree class_type;
8733 vec<tree, va_gc> *allocated = NULL;
8734 tree ret;
8736 gcc_assert (IDENTIFIER_CDTOR_P (name)
8737 || name == cp_assignment_operator_id (NOP_EXPR));
8738 if (TYPE_P (binfo))
8740 /* Resolve the name. */
8741 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8742 return error_mark_node;
8744 binfo = TYPE_BINFO (binfo);
8747 gcc_assert (binfo != NULL_TREE);
8749 class_type = BINFO_TYPE (binfo);
8751 /* Handle the special case where INSTANCE is NULL_TREE. */
8752 if (name == complete_ctor_identifier && !instance)
8753 instance = build_dummy_object (class_type);
8754 else
8756 if (IDENTIFIER_DTOR_P (name))
8757 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8759 /* Convert to the base class, if necessary. */
8760 if (!same_type_ignoring_top_level_qualifiers_p
8761 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8763 if (name != cp_assignment_operator_id (NOP_EXPR))
8764 /* For constructors and destructors, either the base is
8765 non-virtual, or it is virtual but we are doing the
8766 conversion from a constructor or destructor for the
8767 complete object. In either case, we can convert
8768 statically. */
8769 instance = convert_to_base_statically (instance, binfo);
8770 else
8771 /* However, for assignment operators, we must convert
8772 dynamically if the base is virtual. */
8773 instance = build_base_path (PLUS_EXPR, instance,
8774 binfo, /*nonnull=*/1, complain);
8778 gcc_assert (instance != NULL_TREE);
8780 /* In C++17, "If the initializer expression is a prvalue and the
8781 cv-unqualified version of the source type is the same class as the class
8782 of the destination, the initializer expression is used to initialize the
8783 destination object." Handle that here to avoid doing overload
8784 resolution. */
8785 if (cxx_dialect >= cxx1z
8786 && args && vec_safe_length (*args) == 1
8787 && name == complete_ctor_identifier)
8789 tree arg = (**args)[0];
8791 /* FIXME P0135 doesn't say how to handle direct initialization from a
8792 type with a suitable conversion operator. Let's handle it like
8793 copy-initialization, but allowing explict conversions. */
8794 tsubst_flags_t sub_complain = tf_warning;
8795 if (!is_dummy_object (instance))
8796 /* If we're using this to initialize a non-temporary object, don't
8797 require the destructor to be accessible. */
8798 sub_complain |= tf_no_cleanup;
8799 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8800 arg = perform_implicit_conversion_flags (class_type, arg,
8801 sub_complain,
8802 flags);
8803 if ((TREE_CODE (arg) == TARGET_EXPR
8804 || TREE_CODE (arg) == CONSTRUCTOR)
8805 && (same_type_ignoring_top_level_qualifiers_p
8806 (class_type, TREE_TYPE (arg))))
8808 if (is_dummy_object (instance))
8809 return arg;
8810 if ((complain & tf_error)
8811 && (flags & LOOKUP_DELEGATING_CONS))
8812 check_self_delegation (arg);
8813 /* Avoid change of behavior on Wunused-var-2.C. */
8814 mark_lvalue_use (instance);
8815 return build2 (INIT_EXPR, class_type, instance, arg);
8819 fns = lookup_fnfields (binfo, name, 1);
8821 /* When making a call to a constructor or destructor for a subobject
8822 that uses virtual base classes, pass down a pointer to a VTT for
8823 the subobject. */
8824 if ((name == base_ctor_identifier
8825 || name == base_dtor_identifier)
8826 && CLASSTYPE_VBASECLASSES (class_type))
8828 tree vtt;
8829 tree sub_vtt;
8831 /* If the current function is a complete object constructor
8832 or destructor, then we fetch the VTT directly.
8833 Otherwise, we look it up using the VTT we were given. */
8834 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8835 vtt = decay_conversion (vtt, complain);
8836 if (vtt == error_mark_node)
8837 return error_mark_node;
8838 vtt = build_if_in_charge (vtt, current_vtt_parm);
8839 if (BINFO_SUBVTT_INDEX (binfo))
8840 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8841 else
8842 sub_vtt = vtt;
8844 if (args == NULL)
8846 allocated = make_tree_vector ();
8847 args = &allocated;
8850 vec_safe_insert (*args, 0, sub_vtt);
8853 ret = build_new_method_call (instance, fns, args,
8854 TYPE_BINFO (BINFO_TYPE (binfo)),
8855 flags, /*fn=*/NULL,
8856 complain);
8858 if (allocated != NULL)
8859 release_tree_vector (allocated);
8861 if ((complain & tf_error)
8862 && (flags & LOOKUP_DELEGATING_CONS)
8863 && name == complete_ctor_identifier)
8864 check_self_delegation (ret);
8866 return ret;
8869 /* Return the NAME, as a C string. The NAME indicates a function that
8870 is a member of TYPE. *FREE_P is set to true if the caller must
8871 free the memory returned.
8873 Rather than go through all of this, we should simply set the names
8874 of constructors and destructors appropriately, and dispense with
8875 ctor_identifier, dtor_identifier, etc. */
8877 static char *
8878 name_as_c_string (tree name, tree type, bool *free_p)
8880 const char *pretty_name;
8882 /* Assume that we will not allocate memory. */
8883 *free_p = false;
8884 /* Constructors and destructors are special. */
8885 if (IDENTIFIER_CDTOR_P (name))
8887 pretty_name
8888 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
8889 /* For a destructor, add the '~'. */
8890 if (IDENTIFIER_DTOR_P (name))
8892 pretty_name = concat ("~", pretty_name, NULL);
8893 /* Remember that we need to free the memory allocated. */
8894 *free_p = true;
8897 else if (IDENTIFIER_CONV_OP_P (name))
8899 pretty_name = concat ("operator ",
8900 type_as_string_translate (TREE_TYPE (name),
8901 TFF_PLAIN_IDENTIFIER),
8902 NULL);
8903 /* Remember that we need to free the memory allocated. */
8904 *free_p = true;
8906 else
8907 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
8909 return CONST_CAST (char *, pretty_name);
8912 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8913 be set, upon return, to the function called. ARGS may be NULL.
8914 This may change ARGS. */
8916 static tree
8917 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8918 tree conversion_path, int flags,
8919 tree *fn_p, tsubst_flags_t complain)
8921 struct z_candidate *candidates = 0, *cand;
8922 tree explicit_targs = NULL_TREE;
8923 tree basetype = NULL_TREE;
8924 tree access_binfo, binfo;
8925 tree optype;
8926 tree first_mem_arg = NULL_TREE;
8927 tree name;
8928 bool skip_first_for_error;
8929 vec<tree, va_gc> *user_args;
8930 tree call;
8931 tree fn;
8932 int template_only = 0;
8933 bool any_viable_p;
8934 tree orig_instance;
8935 tree orig_fns;
8936 vec<tree, va_gc> *orig_args = NULL;
8937 void *p;
8939 gcc_assert (instance != NULL_TREE);
8941 /* We don't know what function we're going to call, yet. */
8942 if (fn_p)
8943 *fn_p = NULL_TREE;
8945 if (error_operand_p (instance)
8946 || !fns || error_operand_p (fns))
8947 return error_mark_node;
8949 if (!BASELINK_P (fns))
8951 if (complain & tf_error)
8952 error ("call to non-function %qD", fns);
8953 return error_mark_node;
8956 orig_instance = instance;
8957 orig_fns = fns;
8959 /* Dismantle the baselink to collect all the information we need. */
8960 if (!conversion_path)
8961 conversion_path = BASELINK_BINFO (fns);
8962 access_binfo = BASELINK_ACCESS_BINFO (fns);
8963 binfo = BASELINK_BINFO (fns);
8964 optype = BASELINK_OPTYPE (fns);
8965 fns = BASELINK_FUNCTIONS (fns);
8966 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8968 explicit_targs = TREE_OPERAND (fns, 1);
8969 fns = TREE_OPERAND (fns, 0);
8970 template_only = 1;
8972 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8973 || TREE_CODE (fns) == TEMPLATE_DECL
8974 || TREE_CODE (fns) == OVERLOAD);
8975 fn = OVL_FIRST (fns);
8976 name = DECL_NAME (fn);
8978 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8979 gcc_assert (CLASS_TYPE_P (basetype));
8981 if (processing_template_decl)
8983 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8984 instance = build_non_dependent_expr (instance);
8985 if (args != NULL)
8986 make_args_non_dependent (*args);
8989 user_args = args == NULL ? NULL : *args;
8990 /* Under DR 147 A::A() is an invalid constructor call,
8991 not a functional cast. */
8992 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
8994 if (! (complain & tf_error))
8995 return error_mark_node;
8997 name = constructor_name (basetype);
8998 if (permerror (input_location,
8999 "cannot call constructor %<%T::%D%> directly",
9000 basetype, name))
9001 inform (input_location, "for a function-style cast, remove the "
9002 "redundant %<::%D%>", name);
9003 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9004 complain);
9005 return call;
9008 /* Process the argument list. */
9009 if (args != NULL && *args != NULL)
9011 *args = resolve_args (*args, complain);
9012 if (*args == NULL)
9013 return error_mark_node;
9016 /* Consider the object argument to be used even if we end up selecting a
9017 static member function. */
9018 instance = mark_type_use (instance);
9021 /* Figure out whether to skip the first argument for the error
9022 message we will display to users if an error occurs. We don't
9023 want to display any compiler-generated arguments. The "this"
9024 pointer hasn't been added yet. However, we must remove the VTT
9025 pointer if this is a call to a base-class constructor or
9026 destructor. */
9027 skip_first_for_error = false;
9028 if (IDENTIFIER_CDTOR_P (name))
9030 /* Callers should explicitly indicate whether they want to ctor
9031 the complete object or just the part without virtual bases. */
9032 gcc_assert (name != ctor_identifier);
9034 /* Remove the VTT pointer, if present. */
9035 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9036 && CLASSTYPE_VBASECLASSES (basetype))
9037 skip_first_for_error = true;
9039 /* It's OK to call destructors and constructors on cv-qualified
9040 objects. Therefore, convert the INSTANCE to the unqualified
9041 type, if necessary. */
9042 if (!same_type_p (basetype, TREE_TYPE (instance)))
9044 instance = build_this (instance);
9045 instance = build_nop (build_pointer_type (basetype), instance);
9046 instance = build_fold_indirect_ref (instance);
9049 else
9050 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9052 /* For the overload resolution we need to find the actual `this`
9053 that would be captured if the call turns out to be to a
9054 non-static member function. Do not actually capture it at this
9055 point. */
9056 if (DECL_CONSTRUCTOR_P (fn))
9057 /* Constructors don't use the enclosing 'this'. */
9058 first_mem_arg = instance;
9059 else
9060 first_mem_arg = maybe_resolve_dummy (instance, false);
9062 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9063 p = conversion_obstack_alloc (0);
9065 /* The number of arguments artificial parms in ARGS; we subtract one because
9066 there's no 'this' in ARGS. */
9067 unsigned skip = num_artificial_parms_for (fn) - 1;
9069 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9070 initializer, not T({ }). */
9071 if (DECL_CONSTRUCTOR_P (fn)
9072 && vec_safe_length (user_args) > skip
9073 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9075 tree init_list = (*user_args)[skip];
9076 tree init = NULL_TREE;
9078 gcc_assert (user_args->length () == skip + 1
9079 && !(flags & LOOKUP_ONLYCONVERTING));
9081 /* If the initializer list has no elements and T is a class type with
9082 a default constructor, the object is value-initialized. Handle
9083 this here so we don't need to handle it wherever we use
9084 build_special_member_call. */
9085 if (CONSTRUCTOR_NELTS (init_list) == 0
9086 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9087 /* For a user-provided default constructor, use the normal
9088 mechanisms so that protected access works. */
9089 && type_has_non_user_provided_default_constructor (basetype)
9090 && !processing_template_decl)
9091 init = build_value_init (basetype, complain);
9093 /* If BASETYPE is an aggregate, we need to do aggregate
9094 initialization. */
9095 else if (CP_AGGREGATE_TYPE_P (basetype))
9097 init = reshape_init (basetype, init_list, complain);
9098 init = digest_init (basetype, init, complain);
9101 if (init)
9103 if (is_dummy_object (instance))
9104 return get_target_expr_sfinae (init, complain);
9105 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9106 TREE_SIDE_EFFECTS (init) = true;
9107 return init;
9110 /* Otherwise go ahead with overload resolution. */
9111 add_list_candidates (fns, first_mem_arg, user_args,
9112 basetype, explicit_targs, template_only,
9113 conversion_path, access_binfo, flags,
9114 &candidates, complain);
9116 else
9117 add_candidates (fns, first_mem_arg, user_args, optype,
9118 explicit_targs, template_only, conversion_path,
9119 access_binfo, flags, &candidates, complain);
9121 any_viable_p = false;
9122 candidates = splice_viable (candidates, false, &any_viable_p);
9124 if (!any_viable_p)
9126 if (complain & tf_error)
9128 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9129 cxx_incomplete_type_error (instance, basetype);
9130 else if (optype)
9131 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9132 basetype, optype, build_tree_list_vec (user_args),
9133 TREE_TYPE (instance));
9134 else
9136 tree arglist = build_tree_list_vec (user_args);
9137 tree errname = name;
9138 bool twiddle = false;
9139 if (IDENTIFIER_CDTOR_P (errname))
9141 twiddle = IDENTIFIER_DTOR_P (errname);
9142 errname = constructor_name (basetype);
9144 if (explicit_targs)
9145 errname = lookup_template_function (errname, explicit_targs);
9146 if (skip_first_for_error)
9147 arglist = TREE_CHAIN (arglist);
9148 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9149 basetype, &"~"[!twiddle], errname, arglist,
9150 TREE_TYPE (instance));
9152 print_z_candidates (location_of (name), candidates);
9154 call = error_mark_node;
9156 else
9158 cand = tourney (candidates, complain);
9159 if (cand == 0)
9161 char *pretty_name;
9162 bool free_p;
9163 tree arglist;
9165 if (complain & tf_error)
9167 pretty_name = name_as_c_string (name, basetype, &free_p);
9168 arglist = build_tree_list_vec (user_args);
9169 if (skip_first_for_error)
9170 arglist = TREE_CHAIN (arglist);
9171 if (!any_strictly_viable (candidates))
9172 error ("no matching function for call to %<%s(%A)%>",
9173 pretty_name, arglist);
9174 else
9175 error ("call of overloaded %<%s(%A)%> is ambiguous",
9176 pretty_name, arglist);
9177 print_z_candidates (location_of (name), candidates);
9178 if (free_p)
9179 free (pretty_name);
9181 call = error_mark_node;
9183 else
9185 fn = cand->fn;
9186 call = NULL_TREE;
9188 if (!(flags & LOOKUP_NONVIRTUAL)
9189 && DECL_PURE_VIRTUAL_P (fn)
9190 && instance == current_class_ref
9191 && (complain & tf_warning))
9193 /* This is not an error, it is runtime undefined
9194 behavior. */
9195 if (!current_function_decl)
9196 warning (0, "pure virtual %q#D called from "
9197 "non-static data member initializer", fn);
9198 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9199 || DECL_DESTRUCTOR_P (current_function_decl))
9200 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9201 ? G_("pure virtual %q#D called from constructor")
9202 : G_("pure virtual %q#D called from destructor")),
9203 fn);
9206 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9207 && !DECL_CONSTRUCTOR_P (fn)
9208 && is_dummy_object (instance))
9210 instance = maybe_resolve_dummy (instance, true);
9211 if (instance == error_mark_node)
9212 call = error_mark_node;
9213 else if (!is_dummy_object (instance))
9215 /* We captured 'this' in the current lambda now that
9216 we know we really need it. */
9217 cand->first_arg = instance;
9219 else if (any_dependent_bases_p ())
9220 /* We can't tell until instantiation time whether we can use
9221 *this as the implicit object argument. */;
9222 else
9224 if (complain & tf_error)
9225 error ("cannot call member function %qD without object",
9226 fn);
9227 call = error_mark_node;
9231 if (call != error_mark_node)
9233 /* Optimize away vtable lookup if we know that this
9234 function can't be overridden. We need to check if
9235 the context and the type where we found fn are the same,
9236 actually FN might be defined in a different class
9237 type because of a using-declaration. In this case, we
9238 do not want to perform a non-virtual call. */
9239 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9240 && same_type_ignoring_top_level_qualifiers_p
9241 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9242 && resolves_to_fixed_type_p (instance, 0))
9243 flags |= LOOKUP_NONVIRTUAL;
9244 if (explicit_targs)
9245 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9246 /* Now we know what function is being called. */
9247 if (fn_p)
9248 *fn_p = fn;
9249 /* Build the actual CALL_EXPR. */
9250 call = build_over_call (cand, flags, complain);
9251 /* In an expression of the form `a->f()' where `f' turns
9252 out to be a static member function, `a' is
9253 none-the-less evaluated. */
9254 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9255 && !is_dummy_object (instance)
9256 && TREE_SIDE_EFFECTS (instance))
9257 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
9258 instance, call);
9259 else if (call != error_mark_node
9260 && DECL_DESTRUCTOR_P (cand->fn)
9261 && !VOID_TYPE_P (TREE_TYPE (call)))
9262 /* An explicit call of the form "x->~X()" has type
9263 "void". However, on platforms where destructors
9264 return "this" (i.e., those where
9265 targetm.cxx.cdtor_returns_this is true), such calls
9266 will appear to have a return value of pointer type
9267 to the low-level call machinery. We do not want to
9268 change the low-level machinery, since we want to be
9269 able to optimize "delete f()" on such platforms as
9270 "operator delete(~X(f()))" (rather than generating
9271 "t = f(), ~X(t), operator delete (t)"). */
9272 call = build_nop (void_type_node, call);
9277 if (processing_template_decl && call != error_mark_node)
9279 bool cast_to_void = false;
9281 if (TREE_CODE (call) == COMPOUND_EXPR)
9282 call = TREE_OPERAND (call, 1);
9283 else if (TREE_CODE (call) == NOP_EXPR)
9285 cast_to_void = true;
9286 call = TREE_OPERAND (call, 0);
9288 if (INDIRECT_REF_P (call))
9289 call = TREE_OPERAND (call, 0);
9290 call = (build_min_non_dep_call_vec
9291 (call,
9292 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9293 orig_instance, orig_fns, NULL_TREE),
9294 orig_args));
9295 SET_EXPR_LOCATION (call, input_location);
9296 call = convert_from_reference (call);
9297 if (cast_to_void)
9298 call = build_nop (void_type_node, call);
9301 /* Free all the conversions we allocated. */
9302 obstack_free (&conversion_obstack, p);
9304 if (orig_args != NULL)
9305 release_tree_vector (orig_args);
9307 return call;
9310 /* Wrapper for above. */
9312 tree
9313 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9314 tree conversion_path, int flags,
9315 tree *fn_p, tsubst_flags_t complain)
9317 tree ret;
9318 bool subtime = timevar_cond_start (TV_OVERLOAD);
9319 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9320 fn_p, complain);
9321 timevar_cond_stop (TV_OVERLOAD, subtime);
9322 return ret;
9325 /* Returns true iff standard conversion sequence ICS1 is a proper
9326 subsequence of ICS2. */
9328 static bool
9329 is_subseq (conversion *ics1, conversion *ics2)
9331 /* We can assume that a conversion of the same code
9332 between the same types indicates a subsequence since we only get
9333 here if the types we are converting from are the same. */
9335 while (ics1->kind == ck_rvalue
9336 || ics1->kind == ck_lvalue)
9337 ics1 = next_conversion (ics1);
9339 while (1)
9341 while (ics2->kind == ck_rvalue
9342 || ics2->kind == ck_lvalue)
9343 ics2 = next_conversion (ics2);
9345 if (ics2->kind == ck_user
9346 || ics2->kind == ck_ambig
9347 || ics2->kind == ck_aggr
9348 || ics2->kind == ck_list
9349 || ics2->kind == ck_identity)
9350 /* At this point, ICS1 cannot be a proper subsequence of
9351 ICS2. We can get a USER_CONV when we are comparing the
9352 second standard conversion sequence of two user conversion
9353 sequences. */
9354 return false;
9356 ics2 = next_conversion (ics2);
9358 while (ics2->kind == ck_rvalue
9359 || ics2->kind == ck_lvalue)
9360 ics2 = next_conversion (ics2);
9362 if (ics2->kind == ics1->kind
9363 && same_type_p (ics2->type, ics1->type)
9364 && (ics1->kind == ck_identity
9365 || same_type_p (next_conversion (ics2)->type,
9366 next_conversion (ics1)->type)))
9367 return true;
9371 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9372 be any _TYPE nodes. */
9374 bool
9375 is_properly_derived_from (tree derived, tree base)
9377 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9378 return false;
9380 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9381 considers every class derived from itself. */
9382 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9383 && DERIVED_FROM_P (base, derived));
9386 /* We build the ICS for an implicit object parameter as a pointer
9387 conversion sequence. However, such a sequence should be compared
9388 as if it were a reference conversion sequence. If ICS is the
9389 implicit conversion sequence for an implicit object parameter,
9390 modify it accordingly. */
9392 static void
9393 maybe_handle_implicit_object (conversion **ics)
9395 if ((*ics)->this_p)
9397 /* [over.match.funcs]
9399 For non-static member functions, the type of the
9400 implicit object parameter is "reference to cv X"
9401 where X is the class of which the function is a
9402 member and cv is the cv-qualification on the member
9403 function declaration. */
9404 conversion *t = *ics;
9405 tree reference_type;
9407 /* The `this' parameter is a pointer to a class type. Make the
9408 implicit conversion talk about a reference to that same class
9409 type. */
9410 reference_type = TREE_TYPE (t->type);
9411 reference_type = build_reference_type (reference_type);
9413 if (t->kind == ck_qual)
9414 t = next_conversion (t);
9415 if (t->kind == ck_ptr)
9416 t = next_conversion (t);
9417 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9418 t = direct_reference_binding (reference_type, t);
9419 t->this_p = 1;
9420 t->rvaluedness_matches_p = 0;
9421 *ics = t;
9425 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9426 and return the initial reference binding conversion. Otherwise,
9427 leave *ICS unchanged and return NULL. */
9429 static conversion *
9430 maybe_handle_ref_bind (conversion **ics)
9432 if ((*ics)->kind == ck_ref_bind)
9434 conversion *old_ics = *ics;
9435 *ics = next_conversion (old_ics);
9436 (*ics)->user_conv_p = old_ics->user_conv_p;
9437 return old_ics;
9440 return NULL;
9443 /* Compare two implicit conversion sequences according to the rules set out in
9444 [over.ics.rank]. Return values:
9446 1: ics1 is better than ics2
9447 -1: ics2 is better than ics1
9448 0: ics1 and ics2 are indistinguishable */
9450 static int
9451 compare_ics (conversion *ics1, conversion *ics2)
9453 tree from_type1;
9454 tree from_type2;
9455 tree to_type1;
9456 tree to_type2;
9457 tree deref_from_type1 = NULL_TREE;
9458 tree deref_from_type2 = NULL_TREE;
9459 tree deref_to_type1 = NULL_TREE;
9460 tree deref_to_type2 = NULL_TREE;
9461 conversion_rank rank1, rank2;
9463 /* REF_BINDING is nonzero if the result of the conversion sequence
9464 is a reference type. In that case REF_CONV is the reference
9465 binding conversion. */
9466 conversion *ref_conv1;
9467 conversion *ref_conv2;
9469 /* Compare badness before stripping the reference conversion. */
9470 if (ics1->bad_p > ics2->bad_p)
9471 return -1;
9472 else if (ics1->bad_p < ics2->bad_p)
9473 return 1;
9475 /* Handle implicit object parameters. */
9476 maybe_handle_implicit_object (&ics1);
9477 maybe_handle_implicit_object (&ics2);
9479 /* Handle reference parameters. */
9480 ref_conv1 = maybe_handle_ref_bind (&ics1);
9481 ref_conv2 = maybe_handle_ref_bind (&ics2);
9483 /* List-initialization sequence L1 is a better conversion sequence than
9484 list-initialization sequence L2 if L1 converts to
9485 std::initializer_list<X> for some X and L2 does not. */
9486 if (ics1->kind == ck_list && ics2->kind != ck_list)
9487 return 1;
9488 if (ics2->kind == ck_list && ics1->kind != ck_list)
9489 return -1;
9491 /* [over.ics.rank]
9493 When comparing the basic forms of implicit conversion sequences (as
9494 defined in _over.best.ics_)
9496 --a standard conversion sequence (_over.ics.scs_) is a better
9497 conversion sequence than a user-defined conversion sequence
9498 or an ellipsis conversion sequence, and
9500 --a user-defined conversion sequence (_over.ics.user_) is a
9501 better conversion sequence than an ellipsis conversion sequence
9502 (_over.ics.ellipsis_). */
9503 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9504 mismatch. If both ICS are bad, we try to make a decision based on
9505 what would have happened if they'd been good. This is not an
9506 extension, we'll still give an error when we build up the call; this
9507 just helps us give a more helpful error message. */
9508 rank1 = BAD_CONVERSION_RANK (ics1);
9509 rank2 = BAD_CONVERSION_RANK (ics2);
9511 if (rank1 > rank2)
9512 return -1;
9513 else if (rank1 < rank2)
9514 return 1;
9516 if (ics1->ellipsis_p)
9517 /* Both conversions are ellipsis conversions. */
9518 return 0;
9520 /* User-defined conversion sequence U1 is a better conversion sequence
9521 than another user-defined conversion sequence U2 if they contain the
9522 same user-defined conversion operator or constructor and if the sec-
9523 ond standard conversion sequence of U1 is better than the second
9524 standard conversion sequence of U2. */
9526 /* Handle list-conversion with the same code even though it isn't always
9527 ranked as a user-defined conversion and it doesn't have a second
9528 standard conversion sequence; it will still have the desired effect.
9529 Specifically, we need to do the reference binding comparison at the
9530 end of this function. */
9532 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9534 conversion *t1;
9535 conversion *t2;
9537 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9538 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9539 || t1->kind == ck_list)
9540 break;
9541 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9542 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9543 || t2->kind == ck_list)
9544 break;
9546 if (t1->kind != t2->kind)
9547 return 0;
9548 else if (t1->kind == ck_user)
9550 if (t1->cand->fn != t2->cand->fn)
9551 return 0;
9553 else
9555 /* For ambiguous or aggregate conversions, use the target type as
9556 a proxy for the conversion function. */
9557 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9558 return 0;
9561 /* We can just fall through here, after setting up
9562 FROM_TYPE1 and FROM_TYPE2. */
9563 from_type1 = t1->type;
9564 from_type2 = t2->type;
9566 else
9568 conversion *t1;
9569 conversion *t2;
9571 /* We're dealing with two standard conversion sequences.
9573 [over.ics.rank]
9575 Standard conversion sequence S1 is a better conversion
9576 sequence than standard conversion sequence S2 if
9578 --S1 is a proper subsequence of S2 (comparing the conversion
9579 sequences in the canonical form defined by _over.ics.scs_,
9580 excluding any Lvalue Transformation; the identity
9581 conversion sequence is considered to be a subsequence of
9582 any non-identity conversion sequence */
9584 t1 = ics1;
9585 while (t1->kind != ck_identity)
9586 t1 = next_conversion (t1);
9587 from_type1 = t1->type;
9589 t2 = ics2;
9590 while (t2->kind != ck_identity)
9591 t2 = next_conversion (t2);
9592 from_type2 = t2->type;
9595 /* One sequence can only be a subsequence of the other if they start with
9596 the same type. They can start with different types when comparing the
9597 second standard conversion sequence in two user-defined conversion
9598 sequences. */
9599 if (same_type_p (from_type1, from_type2))
9601 if (is_subseq (ics1, ics2))
9602 return 1;
9603 if (is_subseq (ics2, ics1))
9604 return -1;
9607 /* [over.ics.rank]
9609 Or, if not that,
9611 --the rank of S1 is better than the rank of S2 (by the rules
9612 defined below):
9614 Standard conversion sequences are ordered by their ranks: an Exact
9615 Match is a better conversion than a Promotion, which is a better
9616 conversion than a Conversion.
9618 Two conversion sequences with the same rank are indistinguishable
9619 unless one of the following rules applies:
9621 --A conversion that does not a convert a pointer, pointer to member,
9622 or std::nullptr_t to bool is better than one that does.
9624 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9625 so that we do not have to check it explicitly. */
9626 if (ics1->rank < ics2->rank)
9627 return 1;
9628 else if (ics2->rank < ics1->rank)
9629 return -1;
9631 to_type1 = ics1->type;
9632 to_type2 = ics2->type;
9634 /* A conversion from scalar arithmetic type to complex is worse than a
9635 conversion between scalar arithmetic types. */
9636 if (same_type_p (from_type1, from_type2)
9637 && ARITHMETIC_TYPE_P (from_type1)
9638 && ARITHMETIC_TYPE_P (to_type1)
9639 && ARITHMETIC_TYPE_P (to_type2)
9640 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9641 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9643 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9644 return -1;
9645 else
9646 return 1;
9649 if (TYPE_PTR_P (from_type1)
9650 && TYPE_PTR_P (from_type2)
9651 && TYPE_PTR_P (to_type1)
9652 && TYPE_PTR_P (to_type2))
9654 deref_from_type1 = TREE_TYPE (from_type1);
9655 deref_from_type2 = TREE_TYPE (from_type2);
9656 deref_to_type1 = TREE_TYPE (to_type1);
9657 deref_to_type2 = TREE_TYPE (to_type2);
9659 /* The rules for pointers to members A::* are just like the rules
9660 for pointers A*, except opposite: if B is derived from A then
9661 A::* converts to B::*, not vice versa. For that reason, we
9662 switch the from_ and to_ variables here. */
9663 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9664 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9665 || (TYPE_PTRMEMFUNC_P (from_type1)
9666 && TYPE_PTRMEMFUNC_P (from_type2)
9667 && TYPE_PTRMEMFUNC_P (to_type1)
9668 && TYPE_PTRMEMFUNC_P (to_type2)))
9670 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9671 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9672 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9673 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9676 if (deref_from_type1 != NULL_TREE
9677 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9678 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9680 /* This was one of the pointer or pointer-like conversions.
9682 [over.ics.rank]
9684 --If class B is derived directly or indirectly from class A,
9685 conversion of B* to A* is better than conversion of B* to
9686 void*, and conversion of A* to void* is better than
9687 conversion of B* to void*. */
9688 if (VOID_TYPE_P (deref_to_type1)
9689 && VOID_TYPE_P (deref_to_type2))
9691 if (is_properly_derived_from (deref_from_type1,
9692 deref_from_type2))
9693 return -1;
9694 else if (is_properly_derived_from (deref_from_type2,
9695 deref_from_type1))
9696 return 1;
9698 else if (VOID_TYPE_P (deref_to_type1)
9699 || VOID_TYPE_P (deref_to_type2))
9701 if (same_type_p (deref_from_type1, deref_from_type2))
9703 if (VOID_TYPE_P (deref_to_type2))
9705 if (is_properly_derived_from (deref_from_type1,
9706 deref_to_type1))
9707 return 1;
9709 /* We know that DEREF_TO_TYPE1 is `void' here. */
9710 else if (is_properly_derived_from (deref_from_type1,
9711 deref_to_type2))
9712 return -1;
9715 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9716 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9718 /* [over.ics.rank]
9720 --If class B is derived directly or indirectly from class A
9721 and class C is derived directly or indirectly from B,
9723 --conversion of C* to B* is better than conversion of C* to
9726 --conversion of B* to A* is better than conversion of C* to
9727 A* */
9728 if (same_type_p (deref_from_type1, deref_from_type2))
9730 if (is_properly_derived_from (deref_to_type1,
9731 deref_to_type2))
9732 return 1;
9733 else if (is_properly_derived_from (deref_to_type2,
9734 deref_to_type1))
9735 return -1;
9737 else if (same_type_p (deref_to_type1, deref_to_type2))
9739 if (is_properly_derived_from (deref_from_type2,
9740 deref_from_type1))
9741 return 1;
9742 else if (is_properly_derived_from (deref_from_type1,
9743 deref_from_type2))
9744 return -1;
9748 else if (CLASS_TYPE_P (non_reference (from_type1))
9749 && same_type_p (from_type1, from_type2))
9751 tree from = non_reference (from_type1);
9753 /* [over.ics.rank]
9755 --binding of an expression of type C to a reference of type
9756 B& is better than binding an expression of type C to a
9757 reference of type A&
9759 --conversion of C to B is better than conversion of C to A, */
9760 if (is_properly_derived_from (from, to_type1)
9761 && is_properly_derived_from (from, to_type2))
9763 if (is_properly_derived_from (to_type1, to_type2))
9764 return 1;
9765 else if (is_properly_derived_from (to_type2, to_type1))
9766 return -1;
9769 else if (CLASS_TYPE_P (non_reference (to_type1))
9770 && same_type_p (to_type1, to_type2))
9772 tree to = non_reference (to_type1);
9774 /* [over.ics.rank]
9776 --binding of an expression of type B to a reference of type
9777 A& is better than binding an expression of type C to a
9778 reference of type A&,
9780 --conversion of B to A is better than conversion of C to A */
9781 if (is_properly_derived_from (from_type1, to)
9782 && is_properly_derived_from (from_type2, to))
9784 if (is_properly_derived_from (from_type2, from_type1))
9785 return 1;
9786 else if (is_properly_derived_from (from_type1, from_type2))
9787 return -1;
9791 /* [over.ics.rank]
9793 --S1 and S2 differ only in their qualification conversion and yield
9794 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9795 qualification signature of type T1 is a proper subset of the cv-
9796 qualification signature of type T2 */
9797 if (ics1->kind == ck_qual
9798 && ics2->kind == ck_qual
9799 && same_type_p (from_type1, from_type2))
9801 int result = comp_cv_qual_signature (to_type1, to_type2);
9802 if (result != 0)
9803 return result;
9806 /* [over.ics.rank]
9808 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9809 to an implicit object parameter of a non-static member function
9810 declared without a ref-qualifier, and either S1 binds an lvalue
9811 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9812 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9813 draft standard, 13.3.3.2)
9815 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9816 types to which the references refer are the same type except for
9817 top-level cv-qualifiers, and the type to which the reference
9818 initialized by S2 refers is more cv-qualified than the type to
9819 which the reference initialized by S1 refers.
9821 DR 1328 [over.match.best]: the context is an initialization by
9822 conversion function for direct reference binding (13.3.1.6) of a
9823 reference to function type, the return type of F1 is the same kind of
9824 reference (i.e. lvalue or rvalue) as the reference being initialized,
9825 and the return type of F2 is not. */
9827 if (ref_conv1 && ref_conv2)
9829 if (!ref_conv1->this_p && !ref_conv2->this_p
9830 && (ref_conv1->rvaluedness_matches_p
9831 != ref_conv2->rvaluedness_matches_p)
9832 && (same_type_p (ref_conv1->type, ref_conv2->type)
9833 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9834 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9836 if (ref_conv1->bad_p
9837 && !same_type_p (TREE_TYPE (ref_conv1->type),
9838 TREE_TYPE (ref_conv2->type)))
9839 /* Don't prefer a bad conversion that drops cv-quals to a bad
9840 conversion with the wrong rvalueness. */
9841 return 0;
9842 return (ref_conv1->rvaluedness_matches_p
9843 - ref_conv2->rvaluedness_matches_p);
9846 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9848 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9849 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9850 if (ref_conv1->bad_p)
9852 /* Prefer the one that drops fewer cv-quals. */
9853 tree ftype = next_conversion (ref_conv1)->type;
9854 int fquals = cp_type_quals (ftype);
9855 q1 ^= fquals;
9856 q2 ^= fquals;
9858 return comp_cv_qualification (q2, q1);
9862 /* Neither conversion sequence is better than the other. */
9863 return 0;
9866 /* The source type for this standard conversion sequence. */
9868 static tree
9869 source_type (conversion *t)
9871 for (;; t = next_conversion (t))
9873 if (t->kind == ck_user
9874 || t->kind == ck_ambig
9875 || t->kind == ck_identity)
9876 return t->type;
9878 gcc_unreachable ();
9881 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9882 a pointer to LOSER and re-running joust to produce the warning if WINNER
9883 is actually used. */
9885 static void
9886 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9888 candidate_warning *cw = (candidate_warning *)
9889 conversion_obstack_alloc (sizeof (candidate_warning));
9890 cw->loser = loser;
9891 cw->next = winner->warnings;
9892 winner->warnings = cw;
9895 /* Compare two candidates for overloading as described in
9896 [over.match.best]. Return values:
9898 1: cand1 is better than cand2
9899 -1: cand2 is better than cand1
9900 0: cand1 and cand2 are indistinguishable */
9902 static int
9903 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9904 tsubst_flags_t complain)
9906 int winner = 0;
9907 int off1 = 0, off2 = 0;
9908 size_t i;
9909 size_t len;
9911 /* Candidates that involve bad conversions are always worse than those
9912 that don't. */
9913 if (cand1->viable > cand2->viable)
9914 return 1;
9915 if (cand1->viable < cand2->viable)
9916 return -1;
9918 /* If we have two pseudo-candidates for conversions to the same type,
9919 or two candidates for the same function, arbitrarily pick one. */
9920 if (cand1->fn == cand2->fn
9921 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9922 return 1;
9924 /* Prefer a non-deleted function over an implicitly deleted move
9925 constructor or assignment operator. This differs slightly from the
9926 wording for issue 1402 (which says the move op is ignored by overload
9927 resolution), but this way produces better error messages. */
9928 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9929 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9930 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9932 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9933 && move_fn_p (cand1->fn))
9934 return -1;
9935 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9936 && move_fn_p (cand2->fn))
9937 return 1;
9940 /* a viable function F1
9941 is defined to be a better function than another viable function F2 if
9942 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9943 ICSi(F2), and then */
9945 /* for some argument j, ICSj(F1) is a better conversion sequence than
9946 ICSj(F2) */
9948 /* For comparing static and non-static member functions, we ignore
9949 the implicit object parameter of the non-static function. The
9950 standard says to pretend that the static function has an object
9951 parm, but that won't work with operator overloading. */
9952 len = cand1->num_convs;
9953 if (len != cand2->num_convs)
9955 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9956 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9958 if (DECL_CONSTRUCTOR_P (cand1->fn)
9959 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9960 /* We're comparing a near-match list constructor and a near-match
9961 non-list constructor. Just treat them as unordered. */
9962 return 0;
9964 gcc_assert (static_1 != static_2);
9966 if (static_1)
9967 off2 = 1;
9968 else
9970 off1 = 1;
9971 --len;
9975 for (i = 0; i < len; ++i)
9977 conversion *t1 = cand1->convs[i + off1];
9978 conversion *t2 = cand2->convs[i + off2];
9979 int comp = compare_ics (t1, t2);
9981 if (comp != 0)
9983 if ((complain & tf_warning)
9984 && warn_sign_promo
9985 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9986 == cr_std + cr_promotion)
9987 && t1->kind == ck_std
9988 && t2->kind == ck_std
9989 && TREE_CODE (t1->type) == INTEGER_TYPE
9990 && TREE_CODE (t2->type) == INTEGER_TYPE
9991 && (TYPE_PRECISION (t1->type)
9992 == TYPE_PRECISION (t2->type))
9993 && (TYPE_UNSIGNED (next_conversion (t1)->type)
9994 || (TREE_CODE (next_conversion (t1)->type)
9995 == ENUMERAL_TYPE)))
9997 tree type = next_conversion (t1)->type;
9998 tree type1, type2;
9999 struct z_candidate *w, *l;
10000 if (comp > 0)
10001 type1 = t1->type, type2 = t2->type,
10002 w = cand1, l = cand2;
10003 else
10004 type1 = t2->type, type2 = t1->type,
10005 w = cand2, l = cand1;
10007 if (warn)
10009 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10010 type, type1, type2);
10011 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10013 else
10014 add_warning (w, l);
10017 if (winner && comp != winner)
10019 winner = 0;
10020 goto tweak;
10022 winner = comp;
10026 /* warn about confusing overload resolution for user-defined conversions,
10027 either between a constructor and a conversion op, or between two
10028 conversion ops. */
10029 if ((complain & tf_warning)
10030 && winner && warn_conversion && cand1->second_conv
10031 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10032 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10034 struct z_candidate *w, *l;
10035 bool give_warning = false;
10037 if (winner == 1)
10038 w = cand1, l = cand2;
10039 else
10040 w = cand2, l = cand1;
10042 /* We don't want to complain about `X::operator T1 ()'
10043 beating `X::operator T2 () const', when T2 is a no less
10044 cv-qualified version of T1. */
10045 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10046 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10048 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10049 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10051 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
10053 t = TREE_TYPE (t);
10054 f = TREE_TYPE (f);
10056 if (!comp_ptr_ttypes (t, f))
10057 give_warning = true;
10059 else
10060 give_warning = true;
10062 if (!give_warning)
10063 /*NOP*/;
10064 else if (warn)
10066 tree source = source_type (w->convs[0]);
10067 if (! DECL_CONSTRUCTOR_P (w->fn))
10068 source = TREE_TYPE (source);
10069 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10070 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10071 source, w->second_conv->type))
10073 inform (input_location, " because conversion sequence for the argument is better");
10076 else
10077 add_warning (w, l);
10080 if (winner)
10081 return winner;
10083 /* DR 495 moved this tiebreaker above the template ones. */
10084 /* or, if not that,
10085 the context is an initialization by user-defined conversion (see
10086 _dcl.init_ and _over.match.user_) and the standard conversion
10087 sequence from the return type of F1 to the destination type (i.e.,
10088 the type of the entity being initialized) is a better conversion
10089 sequence than the standard conversion sequence from the return type
10090 of F2 to the destination type. */
10092 if (cand1->second_conv)
10094 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10095 if (winner)
10096 return winner;
10099 /* or, if not that,
10100 F1 is a non-template function and F2 is a template function
10101 specialization. */
10103 if (!cand1->template_decl && cand2->template_decl)
10104 return 1;
10105 else if (cand1->template_decl && !cand2->template_decl)
10106 return -1;
10108 /* or, if not that,
10109 F1 and F2 are template functions and the function template for F1 is
10110 more specialized than the template for F2 according to the partial
10111 ordering rules. */
10113 if (cand1->template_decl && cand2->template_decl)
10115 winner = more_specialized_fn
10116 (TI_TEMPLATE (cand1->template_decl),
10117 TI_TEMPLATE (cand2->template_decl),
10118 /* [temp.func.order]: The presence of unused ellipsis and default
10119 arguments has no effect on the partial ordering of function
10120 templates. add_function_candidate() will not have
10121 counted the "this" argument for constructors. */
10122 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10123 if (winner)
10124 return winner;
10127 // C++ Concepts
10128 // or, if not that, F1 is more constrained than F2.
10129 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10131 winner = more_constrained (cand1->fn, cand2->fn);
10132 if (winner)
10133 return winner;
10136 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10137 if (deduction_guide_p (cand1->fn))
10139 gcc_assert (deduction_guide_p (cand2->fn));
10140 /* We distinguish between candidates from an explicit deduction guide and
10141 candidates built from a constructor based on DECL_ARTIFICIAL. */
10142 int art1 = DECL_ARTIFICIAL (cand1->fn);
10143 int art2 = DECL_ARTIFICIAL (cand2->fn);
10144 if (art1 != art2)
10145 return art2 - art1;
10147 if (art1)
10149 /* Prefer the special copy guide over a declared copy/move
10150 constructor. */
10151 if (copy_guide_p (cand1->fn))
10152 return 1;
10153 if (copy_guide_p (cand2->fn))
10154 return -1;
10156 /* Prefer a candidate generated from a non-template constructor. */
10157 int tg1 = template_guide_p (cand1->fn);
10158 int tg2 = template_guide_p (cand2->fn);
10159 if (tg1 != tg2)
10160 return tg2 - tg1;
10164 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10165 for all arguments the corresponding parameters of F1 and F2 have the same
10166 type (CWG 2273/2277). */
10167 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10168 && !DECL_CONV_FN_P (cand1->fn)
10169 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10170 && !DECL_CONV_FN_P (cand2->fn))
10172 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10173 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10175 bool used1 = false;
10176 bool used2 = false;
10177 if (base1 == base2)
10178 /* No difference. */;
10179 else if (DERIVED_FROM_P (base1, base2))
10180 used1 = true;
10181 else if (DERIVED_FROM_P (base2, base1))
10182 used2 = true;
10184 if (int diff = used2 - used1)
10186 for (i = 0; i < len; ++i)
10188 conversion *t1 = cand1->convs[i + off1];
10189 conversion *t2 = cand2->convs[i + off2];
10190 if (!same_type_p (t1->type, t2->type))
10191 break;
10193 if (i == len)
10194 return diff;
10198 /* Check whether we can discard a builtin candidate, either because we
10199 have two identical ones or matching builtin and non-builtin candidates.
10201 (Pedantically in the latter case the builtin which matched the user
10202 function should not be added to the overload set, but we spot it here.
10204 [over.match.oper]
10205 ... the builtin candidates include ...
10206 - do not have the same parameter type list as any non-template
10207 non-member candidate. */
10209 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10211 for (i = 0; i < len; ++i)
10212 if (!same_type_p (cand1->convs[i]->type,
10213 cand2->convs[i]->type))
10214 break;
10215 if (i == cand1->num_convs)
10217 if (cand1->fn == cand2->fn)
10218 /* Two built-in candidates; arbitrarily pick one. */
10219 return 1;
10220 else if (identifier_p (cand1->fn))
10221 /* cand1 is built-in; prefer cand2. */
10222 return -1;
10223 else
10224 /* cand2 is built-in; prefer cand1. */
10225 return 1;
10229 /* For candidates of a multi-versioned function, make the version with
10230 the highest priority win. This version will be checked for dispatching
10231 first. If this version can be inlined into the caller, the front-end
10232 will simply make a direct call to this function. */
10234 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10235 && DECL_FUNCTION_VERSIONED (cand1->fn)
10236 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10237 && DECL_FUNCTION_VERSIONED (cand2->fn))
10239 tree f1 = TREE_TYPE (cand1->fn);
10240 tree f2 = TREE_TYPE (cand2->fn);
10241 tree p1 = TYPE_ARG_TYPES (f1);
10242 tree p2 = TYPE_ARG_TYPES (f2);
10244 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10245 is possible that cand1->fn and cand2->fn are function versions but of
10246 different functions. Check types to see if they are versions of the same
10247 function. */
10248 if (compparms (p1, p2)
10249 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10251 /* Always make the version with the higher priority, more
10252 specialized, win. */
10253 gcc_assert (targetm.compare_version_priority);
10254 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10255 return 1;
10256 else
10257 return -1;
10261 /* If the two function declarations represent the same function (this can
10262 happen with declarations in multiple scopes and arg-dependent lookup),
10263 arbitrarily choose one. But first make sure the default args we're
10264 using match. */
10265 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10266 && equal_functions (cand1->fn, cand2->fn))
10268 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10269 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10271 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10273 for (i = 0; i < len; ++i)
10275 /* Don't crash if the fn is variadic. */
10276 if (!parms1)
10277 break;
10278 parms1 = TREE_CHAIN (parms1);
10279 parms2 = TREE_CHAIN (parms2);
10282 if (off1)
10283 parms1 = TREE_CHAIN (parms1);
10284 else if (off2)
10285 parms2 = TREE_CHAIN (parms2);
10287 for (; parms1; ++i)
10289 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10290 TREE_PURPOSE (parms2)))
10292 if (warn)
10294 if (complain & tf_error)
10296 if (permerror (input_location,
10297 "default argument mismatch in "
10298 "overload resolution"))
10300 inform (DECL_SOURCE_LOCATION (cand1->fn),
10301 " candidate 1: %q#F", cand1->fn);
10302 inform (DECL_SOURCE_LOCATION (cand2->fn),
10303 " candidate 2: %q#F", cand2->fn);
10306 else
10307 return 0;
10309 else
10310 add_warning (cand1, cand2);
10311 break;
10313 parms1 = TREE_CHAIN (parms1);
10314 parms2 = TREE_CHAIN (parms2);
10317 return 1;
10320 tweak:
10322 /* Extension: If the worst conversion for one candidate is worse than the
10323 worst conversion for the other, take the first. */
10324 if (!pedantic && (complain & tf_warning_or_error))
10326 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10327 struct z_candidate *w = 0, *l = 0;
10329 for (i = 0; i < len; ++i)
10331 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10332 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10333 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10334 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10336 if (rank1 < rank2)
10337 winner = 1, w = cand1, l = cand2;
10338 if (rank1 > rank2)
10339 winner = -1, w = cand2, l = cand1;
10340 if (winner)
10342 /* Don't choose a deleted function over ambiguity. */
10343 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10344 return 0;
10345 if (warn)
10347 pedwarn (input_location, 0,
10348 "ISO C++ says that these are ambiguous, even "
10349 "though the worst conversion for the first is better than "
10350 "the worst conversion for the second:");
10351 print_z_candidate (input_location, _("candidate 1:"), w);
10352 print_z_candidate (input_location, _("candidate 2:"), l);
10354 else
10355 add_warning (w, l);
10356 return winner;
10360 gcc_assert (!winner);
10361 return 0;
10364 /* Given a list of candidates for overloading, find the best one, if any.
10365 This algorithm has a worst case of O(2n) (winner is last), and a best
10366 case of O(n/2) (totally ambiguous); much better than a sorting
10367 algorithm. */
10369 static struct z_candidate *
10370 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10372 struct z_candidate *champ = candidates, *challenger;
10373 int fate;
10374 int champ_compared_to_predecessor = 0;
10376 /* Walk through the list once, comparing each current champ to the next
10377 candidate, knocking out a candidate or two with each comparison. */
10379 for (challenger = champ->next; challenger; )
10381 fate = joust (champ, challenger, 0, complain);
10382 if (fate == 1)
10383 challenger = challenger->next;
10384 else
10386 if (fate == 0)
10388 champ = challenger->next;
10389 if (champ == 0)
10390 return NULL;
10391 champ_compared_to_predecessor = 0;
10393 else
10395 champ = challenger;
10396 champ_compared_to_predecessor = 1;
10399 challenger = champ->next;
10403 /* Make sure the champ is better than all the candidates it hasn't yet
10404 been compared to. */
10406 for (challenger = candidates;
10407 challenger != champ
10408 && !(champ_compared_to_predecessor && challenger->next == champ);
10409 challenger = challenger->next)
10411 fate = joust (champ, challenger, 0, complain);
10412 if (fate != 1)
10413 return NULL;
10416 return champ;
10419 /* Returns nonzero if things of type FROM can be converted to TO. */
10421 bool
10422 can_convert (tree to, tree from, tsubst_flags_t complain)
10424 tree arg = NULL_TREE;
10425 /* implicit_conversion only considers user-defined conversions
10426 if it has an expression for the call argument list. */
10427 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10428 arg = build1 (CAST_EXPR, from, NULL_TREE);
10429 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10432 /* Returns nonzero if things of type FROM can be converted to TO with a
10433 standard conversion. */
10435 bool
10436 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10438 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10441 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10443 bool
10444 can_convert_arg (tree to, tree from, tree arg, int flags,
10445 tsubst_flags_t complain)
10447 conversion *t;
10448 void *p;
10449 bool ok_p;
10451 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10452 p = conversion_obstack_alloc (0);
10453 /* We want to discard any access checks done for this test,
10454 as we might not be in the appropriate access context and
10455 we'll do the check again when we actually perform the
10456 conversion. */
10457 push_deferring_access_checks (dk_deferred);
10459 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10460 flags, complain);
10461 ok_p = (t && !t->bad_p);
10463 /* Discard the access checks now. */
10464 pop_deferring_access_checks ();
10465 /* Free all the conversions we allocated. */
10466 obstack_free (&conversion_obstack, p);
10468 return ok_p;
10471 /* Like can_convert_arg, but allows dubious conversions as well. */
10473 bool
10474 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10475 tsubst_flags_t complain)
10477 conversion *t;
10478 void *p;
10480 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10481 p = conversion_obstack_alloc (0);
10482 /* Try to perform the conversion. */
10483 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10484 flags, complain);
10485 /* Free all the conversions we allocated. */
10486 obstack_free (&conversion_obstack, p);
10488 return t != NULL;
10491 /* Convert EXPR to TYPE. Return the converted expression.
10493 Note that we allow bad conversions here because by the time we get to
10494 this point we are committed to doing the conversion. If we end up
10495 doing a bad conversion, convert_like will complain. */
10497 tree
10498 perform_implicit_conversion_flags (tree type, tree expr,
10499 tsubst_flags_t complain, int flags)
10501 conversion *conv;
10502 void *p;
10503 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10505 if (error_operand_p (expr))
10506 return error_mark_node;
10508 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10509 p = conversion_obstack_alloc (0);
10511 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10512 /*c_cast_p=*/false,
10513 flags, complain);
10515 if (!conv)
10517 if (complain & tf_error)
10519 /* If expr has unknown type, then it is an overloaded function.
10520 Call instantiate_type to get good error messages. */
10521 if (TREE_TYPE (expr) == unknown_type_node)
10522 instantiate_type (type, expr, complain);
10523 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10524 /* We gave an error. */;
10525 else
10526 error_at (loc, "could not convert %qE from %qH to %qI", expr,
10527 TREE_TYPE (expr), type);
10529 expr = error_mark_node;
10531 else if (processing_template_decl && conv->kind != ck_identity)
10533 /* In a template, we are only concerned about determining the
10534 type of non-dependent expressions, so we do not have to
10535 perform the actual conversion. But for initializers, we
10536 need to be able to perform it at instantiation
10537 (or instantiate_non_dependent_expr) time. */
10538 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10539 if (!(flags & LOOKUP_ONLYCONVERTING))
10540 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10542 else
10543 expr = convert_like (conv, expr, complain);
10545 /* Free all the conversions we allocated. */
10546 obstack_free (&conversion_obstack, p);
10548 return expr;
10551 tree
10552 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10554 return perform_implicit_conversion_flags (type, expr, complain,
10555 LOOKUP_IMPLICIT);
10558 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10559 permitted. If the conversion is valid, the converted expression is
10560 returned. Otherwise, NULL_TREE is returned, except in the case
10561 that TYPE is a class type; in that case, an error is issued. If
10562 C_CAST_P is true, then this direct-initialization is taking
10563 place as part of a static_cast being attempted as part of a C-style
10564 cast. */
10566 tree
10567 perform_direct_initialization_if_possible (tree type,
10568 tree expr,
10569 bool c_cast_p,
10570 tsubst_flags_t complain)
10572 conversion *conv;
10573 void *p;
10575 if (type == error_mark_node || error_operand_p (expr))
10576 return error_mark_node;
10577 /* [dcl.init]
10579 If the destination type is a (possibly cv-qualified) class type:
10581 -- If the initialization is direct-initialization ...,
10582 constructors are considered. ... If no constructor applies, or
10583 the overload resolution is ambiguous, the initialization is
10584 ill-formed. */
10585 if (CLASS_TYPE_P (type))
10587 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10588 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10589 &args, type, LOOKUP_NORMAL, complain);
10590 release_tree_vector (args);
10591 return build_cplus_new (type, expr, complain);
10594 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10595 p = conversion_obstack_alloc (0);
10597 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10598 c_cast_p,
10599 LOOKUP_NORMAL, complain);
10600 if (!conv || conv->bad_p)
10601 expr = NULL_TREE;
10602 else
10603 expr = convert_like_real (conv, expr, NULL_TREE, 0,
10604 /*issue_conversion_warnings=*/false,
10605 c_cast_p,
10606 complain);
10608 /* Free all the conversions we allocated. */
10609 obstack_free (&conversion_obstack, p);
10611 return expr;
10614 /* When initializing a reference that lasts longer than a full-expression,
10615 this special rule applies:
10617 [class.temporary]
10619 The temporary to which the reference is bound or the temporary
10620 that is the complete object to which the reference is bound
10621 persists for the lifetime of the reference.
10623 The temporaries created during the evaluation of the expression
10624 initializing the reference, except the temporary to which the
10625 reference is bound, are destroyed at the end of the
10626 full-expression in which they are created.
10628 In that case, we store the converted expression into a new
10629 VAR_DECL in a new scope.
10631 However, we want to be careful not to create temporaries when
10632 they are not required. For example, given:
10634 struct B {};
10635 struct D : public B {};
10636 D f();
10637 const B& b = f();
10639 there is no need to copy the return value from "f"; we can just
10640 extend its lifetime. Similarly, given:
10642 struct S {};
10643 struct T { operator S(); };
10644 T t;
10645 const S& s = t;
10647 we can extend the lifetime of the return value of the conversion
10648 operator.
10650 The next several functions are involved in this lifetime extension. */
10652 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10653 reference is being bound to a temporary. Create and return a new
10654 VAR_DECL with the indicated TYPE; this variable will store the value to
10655 which the reference is bound. */
10657 tree
10658 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10660 tree var = create_temporary_var (type);
10662 /* Register the variable. */
10663 if (VAR_P (decl)
10664 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10666 /* Namespace-scope or local static; give it a mangled name. */
10667 /* FIXME share comdat with decl? */
10669 TREE_STATIC (var) = TREE_STATIC (decl);
10670 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10671 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10673 tree name = mangle_ref_init_variable (decl);
10674 DECL_NAME (var) = name;
10675 SET_DECL_ASSEMBLER_NAME (var, name);
10677 var = pushdecl (var);
10679 else
10680 /* Create a new cleanup level if necessary. */
10681 maybe_push_cleanup_level (type);
10683 return var;
10686 /* EXPR is the initializer for a variable DECL of reference or
10687 std::initializer_list type. Create, push and return a new VAR_DECL
10688 for the initializer so that it will live as long as DECL. Any
10689 cleanup for the new variable is returned through CLEANUP, and the
10690 code to initialize the new variable is returned through INITP. */
10692 static tree
10693 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10694 tree *initp)
10696 tree init;
10697 tree type;
10698 tree var;
10700 /* Create the temporary variable. */
10701 type = TREE_TYPE (expr);
10702 var = make_temporary_var_for_ref_to_temp (decl, type);
10703 layout_decl (var, 0);
10704 /* If the rvalue is the result of a function call it will be
10705 a TARGET_EXPR. If it is some other construct (such as a
10706 member access expression where the underlying object is
10707 itself the result of a function call), turn it into a
10708 TARGET_EXPR here. It is important that EXPR be a
10709 TARGET_EXPR below since otherwise the INIT_EXPR will
10710 attempt to make a bitwise copy of EXPR to initialize
10711 VAR. */
10712 if (TREE_CODE (expr) != TARGET_EXPR)
10713 expr = get_target_expr (expr);
10715 if (TREE_CODE (decl) == FIELD_DECL
10716 && extra_warnings && !TREE_NO_WARNING (decl))
10718 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10719 "until the constructor exits", decl);
10720 TREE_NO_WARNING (decl) = true;
10723 /* Recursively extend temps in this initializer. */
10724 TARGET_EXPR_INITIAL (expr)
10725 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10727 /* Any reference temp has a non-trivial initializer. */
10728 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10730 /* If the initializer is constant, put it in DECL_INITIAL so we get
10731 static initialization and use in constant expressions. */
10732 init = maybe_constant_init (expr);
10733 if (TREE_CONSTANT (init))
10735 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10737 /* 5.19 says that a constant expression can include an
10738 lvalue-rvalue conversion applied to "a glvalue of literal type
10739 that refers to a non-volatile temporary object initialized
10740 with a constant expression". Rather than try to communicate
10741 that this VAR_DECL is a temporary, just mark it constexpr.
10743 Currently this is only useful for initializer_list temporaries,
10744 since reference vars can't appear in constant expressions. */
10745 DECL_DECLARED_CONSTEXPR_P (var) = true;
10746 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10747 TREE_CONSTANT (var) = true;
10749 DECL_INITIAL (var) = init;
10750 init = NULL_TREE;
10752 else
10753 /* Create the INIT_EXPR that will initialize the temporary
10754 variable. */
10755 init = split_nonconstant_init (var, expr);
10756 if (at_function_scope_p ())
10758 add_decl_expr (var);
10760 if (TREE_STATIC (var))
10761 init = add_stmt_to_compound (init, register_dtor_fn (var));
10762 else
10764 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10765 if (cleanup)
10766 vec_safe_push (*cleanups, cleanup);
10769 /* We must be careful to destroy the temporary only
10770 after its initialization has taken place. If the
10771 initialization throws an exception, then the
10772 destructor should not be run. We cannot simply
10773 transform INIT into something like:
10775 (INIT, ({ CLEANUP_STMT; }))
10777 because emit_local_var always treats the
10778 initializer as a full-expression. Thus, the
10779 destructor would run too early; it would run at the
10780 end of initializing the reference variable, rather
10781 than at the end of the block enclosing the
10782 reference variable.
10784 The solution is to pass back a cleanup expression
10785 which the caller is responsible for attaching to
10786 the statement tree. */
10788 else
10790 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10791 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10793 if (CP_DECL_THREAD_LOCAL_P (var))
10794 tls_aggregates = tree_cons (NULL_TREE, var,
10795 tls_aggregates);
10796 else
10797 static_aggregates = tree_cons (NULL_TREE, var,
10798 static_aggregates);
10800 else
10801 /* Check whether the dtor is callable. */
10802 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10804 /* Avoid -Wunused-variable warning (c++/38958). */
10805 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10806 && VAR_P (decl))
10807 TREE_USED (decl) = DECL_READ_P (decl) = true;
10809 *initp = init;
10810 return var;
10813 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10814 initializing a variable of that TYPE. */
10816 tree
10817 initialize_reference (tree type, tree expr,
10818 int flags, tsubst_flags_t complain)
10820 conversion *conv;
10821 void *p;
10822 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10824 if (type == error_mark_node || error_operand_p (expr))
10825 return error_mark_node;
10827 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10828 p = conversion_obstack_alloc (0);
10830 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10831 flags, complain);
10832 if (!conv || conv->bad_p)
10834 if (complain & tf_error)
10836 if (conv)
10837 convert_like (conv, expr, complain);
10838 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10839 && !TYPE_REF_IS_RVALUE (type)
10840 && !lvalue_p (expr))
10841 error_at (loc, "invalid initialization of non-const reference of "
10842 "type %qH from an rvalue of type %qI",
10843 type, TREE_TYPE (expr));
10844 else
10845 error_at (loc, "invalid initialization of reference of type "
10846 "%qH from expression of type %qI", type,
10847 TREE_TYPE (expr));
10849 return error_mark_node;
10852 if (conv->kind == ck_ref_bind)
10853 /* Perform the conversion. */
10854 expr = convert_like (conv, expr, complain);
10855 else if (conv->kind == ck_ambig)
10856 /* We gave an error in build_user_type_conversion_1. */
10857 expr = error_mark_node;
10858 else
10859 gcc_unreachable ();
10861 /* Free all the conversions we allocated. */
10862 obstack_free (&conversion_obstack, p);
10864 return expr;
10867 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10868 which is bound either to a reference or a std::initializer_list. */
10870 static tree
10871 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10873 tree sub = init;
10874 tree *p;
10875 STRIP_NOPS (sub);
10876 if (TREE_CODE (sub) == COMPOUND_EXPR)
10878 TREE_OPERAND (sub, 1)
10879 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10880 return init;
10882 if (TREE_CODE (sub) != ADDR_EXPR)
10883 return init;
10884 /* Deal with binding to a subobject. */
10885 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10886 p = &TREE_OPERAND (*p, 0);
10887 if (TREE_CODE (*p) == TARGET_EXPR)
10889 tree subinit = NULL_TREE;
10890 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10891 recompute_tree_invariant_for_addr_expr (sub);
10892 if (init != sub)
10893 init = fold_convert (TREE_TYPE (init), sub);
10894 if (subinit)
10895 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10897 return init;
10900 /* INIT is part of the initializer for DECL. If there are any
10901 reference or initializer lists being initialized, extend their
10902 lifetime to match that of DECL. */
10904 tree
10905 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10907 tree type = TREE_TYPE (init);
10908 if (processing_template_decl)
10909 return init;
10910 if (TREE_CODE (type) == REFERENCE_TYPE)
10911 init = extend_ref_init_temps_1 (decl, init, cleanups);
10912 else
10914 tree ctor = init;
10915 if (TREE_CODE (ctor) == TARGET_EXPR)
10916 ctor = TARGET_EXPR_INITIAL (ctor);
10917 if (TREE_CODE (ctor) == CONSTRUCTOR)
10919 if (is_std_init_list (type))
10921 /* The temporary array underlying a std::initializer_list
10922 is handled like a reference temporary. */
10923 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10924 array = extend_ref_init_temps_1 (decl, array, cleanups);
10925 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10927 else
10929 unsigned i;
10930 constructor_elt *p;
10931 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10932 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10933 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10935 recompute_constructor_flags (ctor);
10936 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
10937 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10941 return init;
10944 /* Returns true iff an initializer for TYPE could contain temporaries that
10945 need to be extended because they are bound to references or
10946 std::initializer_list. */
10948 bool
10949 type_has_extended_temps (tree type)
10951 type = strip_array_types (type);
10952 if (TREE_CODE (type) == REFERENCE_TYPE)
10953 return true;
10954 if (CLASS_TYPE_P (type))
10956 if (is_std_init_list (type))
10957 return true;
10958 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10959 f; f = next_initializable_field (DECL_CHAIN (f)))
10960 if (type_has_extended_temps (TREE_TYPE (f)))
10961 return true;
10963 return false;
10966 /* Returns true iff TYPE is some variant of std::initializer_list. */
10968 bool
10969 is_std_init_list (tree type)
10971 if (!TYPE_P (type))
10972 return false;
10973 if (cxx_dialect == cxx98)
10974 return false;
10975 /* Look through typedefs. */
10976 type = TYPE_MAIN_VARIANT (type);
10977 return (CLASS_TYPE_P (type)
10978 && CP_TYPE_CONTEXT (type) == std_node
10979 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
10982 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10983 will accept an argument list of a single std::initializer_list<T>. */
10985 bool
10986 is_list_ctor (tree decl)
10988 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
10989 tree arg;
10991 if (!args || args == void_list_node)
10992 return false;
10994 arg = non_reference (TREE_VALUE (args));
10995 if (!is_std_init_list (arg))
10996 return false;
10998 args = TREE_CHAIN (args);
11000 if (args && args != void_list_node && !TREE_PURPOSE (args))
11001 /* There are more non-defaulted parms. */
11002 return false;
11004 return true;
11007 #include "gt-cp-call.h"