2015-11-22 Jerry DeLisle <jvdelisle@gcc.gnu.org>
[official-gcc.git] / gcc / cp / call.c
blob8cdda6200e18685556423403fe7e632b1037e7fd
1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2015 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_tsafe,
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 static tree build_java_interface_fn_ref (tree, tree);
150 #define convert_like(CONV, EXPR, COMPLAIN) \
151 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
152 /*issue_conversion_warnings=*/true, \
153 /*c_cast_p=*/false, (COMPLAIN))
154 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
155 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
156 /*issue_conversion_warnings=*/true, \
157 /*c_cast_p=*/false, (COMPLAIN))
158 static tree convert_like_real (conversion *, tree, tree, int, int, bool,
159 bool, tsubst_flags_t);
160 static void op_error (location_t, enum tree_code, enum tree_code, tree,
161 tree, tree, bool);
162 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
163 tsubst_flags_t);
164 static void print_z_candidate (location_t, const char *, struct z_candidate *);
165 static void print_z_candidates (location_t, struct z_candidate *);
166 static tree build_this (tree);
167 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
168 static bool any_strictly_viable (struct z_candidate *);
169 static struct z_candidate *add_template_candidate
170 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
171 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
172 static struct z_candidate *add_template_candidate_real
173 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
174 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
175 static void add_builtin_candidates
176 (struct z_candidate **, enum tree_code, enum tree_code,
177 tree, tree *, int, tsubst_flags_t);
178 static void add_builtin_candidate
179 (struct z_candidate **, enum tree_code, enum tree_code,
180 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
181 static bool is_complete (tree);
182 static void build_builtin_candidate
183 (struct z_candidate **, tree, tree, tree, tree *, tree *,
184 int, tsubst_flags_t);
185 static struct z_candidate *add_conv_candidate
186 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
187 tree, tsubst_flags_t);
188 static struct z_candidate *add_function_candidate
189 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
190 tree, int, tsubst_flags_t);
191 static conversion *implicit_conversion (tree, tree, tree, bool, int,
192 tsubst_flags_t);
193 static conversion *standard_conversion (tree, tree, tree, bool, int);
194 static conversion *reference_binding (tree, tree, tree, bool, int,
195 tsubst_flags_t);
196 static conversion *build_conv (conversion_kind, tree, conversion *);
197 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
198 static conversion *next_conversion (conversion *);
199 static bool is_subseq (conversion *, conversion *);
200 static conversion *maybe_handle_ref_bind (conversion **);
201 static void maybe_handle_implicit_object (conversion **);
202 static struct z_candidate *add_candidate
203 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
204 conversion **, tree, tree, int, struct rejection_reason *, int);
205 static tree source_type (conversion *);
206 static void add_warning (struct z_candidate *, struct z_candidate *);
207 static bool reference_compatible_p (tree, tree);
208 static conversion *direct_reference_binding (tree, conversion *);
209 static bool promoted_arithmetic_type_p (tree);
210 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
211 static char *name_as_c_string (tree, tree, bool *);
212 static tree prep_operand (tree);
213 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
214 bool, tree, tree, int, struct z_candidate **,
215 tsubst_flags_t);
216 static conversion *merge_conversion_sequences (conversion *, conversion *);
217 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
219 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
220 NAME can take many forms... */
222 bool
223 check_dtor_name (tree basetype, tree name)
225 /* Just accept something we've already complained about. */
226 if (name == error_mark_node)
227 return true;
229 if (TREE_CODE (name) == TYPE_DECL)
230 name = TREE_TYPE (name);
231 else if (TYPE_P (name))
232 /* OK */;
233 else if (identifier_p (name))
235 if ((MAYBE_CLASS_TYPE_P (basetype)
236 && name == constructor_name (basetype))
237 || (TREE_CODE (basetype) == ENUMERAL_TYPE
238 && name == TYPE_IDENTIFIER (basetype)))
239 return true;
240 else
241 name = get_type_value (name);
243 else
245 /* In the case of:
247 template <class T> struct S { ~S(); };
248 int i;
249 i.~S();
251 NAME will be a class template. */
252 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
253 return false;
256 if (!name || name == error_mark_node)
257 return false;
258 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
261 /* We want the address of a function or method. We avoid creating a
262 pointer-to-member function. */
264 tree
265 build_addr_func (tree function, tsubst_flags_t complain)
267 tree type = TREE_TYPE (function);
269 /* We have to do these by hand to avoid real pointer to member
270 functions. */
271 if (TREE_CODE (type) == METHOD_TYPE)
273 if (TREE_CODE (function) == OFFSET_REF)
275 tree object = build_address (TREE_OPERAND (function, 0));
276 return get_member_function_from_ptrfunc (&object,
277 TREE_OPERAND (function, 1),
278 complain);
280 function = build_address (function);
282 else
283 function = decay_conversion (function, complain, /*reject_builtin=*/false);
285 return function;
288 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
289 POINTER_TYPE to those. Note, pointer to member function types
290 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
291 two variants. build_call_a is the primitive taking an array of
292 arguments, while build_call_n is a wrapper that handles varargs. */
294 tree
295 build_call_n (tree function, int n, ...)
297 if (n == 0)
298 return build_call_a (function, 0, NULL);
299 else
301 tree *argarray = XALLOCAVEC (tree, n);
302 va_list ap;
303 int i;
305 va_start (ap, n);
306 for (i = 0; i < n; i++)
307 argarray[i] = va_arg (ap, tree);
308 va_end (ap);
309 return build_call_a (function, n, argarray);
313 /* Update various flags in cfun and the call itself based on what is being
314 called. Split out of build_call_a so that bot_manip can use it too. */
316 void
317 set_flags_from_callee (tree call)
319 bool nothrow;
320 tree decl = get_callee_fndecl (call);
322 /* We check both the decl and the type; a function may be known not to
323 throw without being declared throw(). */
324 nothrow = decl && TREE_NOTHROW (decl);
325 if (CALL_EXPR_FN (call))
326 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
327 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
328 nothrow = true;
330 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
331 cp_function_chain->can_throw = 1;
333 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
334 current_function_returns_abnormally = 1;
336 TREE_NOTHROW (call) = nothrow;
339 tree
340 build_call_a (tree function, int n, tree *argarray)
342 tree decl;
343 tree result_type;
344 tree fntype;
345 int i;
347 function = build_addr_func (function, tf_warning_or_error);
349 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
350 fntype = TREE_TYPE (TREE_TYPE (function));
351 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
352 || TREE_CODE (fntype) == METHOD_TYPE);
353 result_type = TREE_TYPE (fntype);
354 /* An rvalue has no cv-qualifiers. */
355 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
356 result_type = cv_unqualified (result_type);
358 function = build_call_array_loc (input_location,
359 result_type, function, n, argarray);
360 set_flags_from_callee (function);
362 decl = get_callee_fndecl (function);
364 if (decl && !TREE_USED (decl))
366 /* We invoke build_call directly for several library
367 functions. These may have been declared normally if
368 we're building libgcc, so we can't just check
369 DECL_ARTIFICIAL. */
370 gcc_assert (DECL_ARTIFICIAL (decl)
371 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
372 "__", 2));
373 mark_used (decl);
376 require_complete_eh_spec_types (fntype, decl);
378 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
380 /* Don't pass empty class objects by value. This is useful
381 for tags in STL, which are used to control overload resolution.
382 We don't need to handle other cases of copying empty classes. */
383 if (! decl || ! DECL_BUILT_IN (decl))
384 for (i = 0; i < n; i++)
386 tree arg = CALL_EXPR_ARG (function, i);
387 if (is_empty_class (TREE_TYPE (arg))
388 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
390 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
391 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
392 CALL_EXPR_ARG (function, i) = arg;
396 return function;
399 /* New overloading code. */
401 struct z_candidate;
403 struct candidate_warning {
404 z_candidate *loser;
405 candidate_warning *next;
408 /* Information for providing diagnostics about why overloading failed. */
410 enum rejection_reason_code {
411 rr_none,
412 rr_arity,
413 rr_explicit_conversion,
414 rr_template_conversion,
415 rr_arg_conversion,
416 rr_bad_arg_conversion,
417 rr_template_unification,
418 rr_invalid_copy,
419 rr_constraint_failure
422 struct conversion_info {
423 /* The index of the argument, 0-based. */
424 int n_arg;
425 /* The actual argument or its type. */
426 tree from;
427 /* The type of the parameter. */
428 tree to_type;
431 struct rejection_reason {
432 enum rejection_reason_code code;
433 union {
434 /* Information about an arity mismatch. */
435 struct {
436 /* The expected number of arguments. */
437 int expected;
438 /* The actual number of arguments in the call. */
439 int actual;
440 /* Whether the call was a varargs call. */
441 bool call_varargs_p;
442 } arity;
443 /* Information about an argument conversion mismatch. */
444 struct conversion_info conversion;
445 /* Same, but for bad argument conversions. */
446 struct conversion_info bad_conversion;
447 /* Information about template unification failures. These are the
448 parameters passed to fn_type_unification. */
449 struct {
450 tree tmpl;
451 tree explicit_targs;
452 int num_targs;
453 const tree *args;
454 unsigned int nargs;
455 tree return_type;
456 unification_kind_t strict;
457 int flags;
458 } template_unification;
459 /* Information about template instantiation failures. These are the
460 parameters passed to instantiate_template. */
461 struct {
462 tree tmpl;
463 tree targs;
464 } template_instantiation;
465 } u;
468 struct z_candidate {
469 /* The FUNCTION_DECL that will be called if this candidate is
470 selected by overload resolution. */
471 tree fn;
472 /* If not NULL_TREE, the first argument to use when calling this
473 function. */
474 tree first_arg;
475 /* The rest of the arguments to use when calling this function. If
476 there are no further arguments this may be NULL or it may be an
477 empty vector. */
478 const vec<tree, va_gc> *args;
479 /* The implicit conversion sequences for each of the arguments to
480 FN. */
481 conversion **convs;
482 /* The number of implicit conversion sequences. */
483 size_t num_convs;
484 /* If FN is a user-defined conversion, the standard conversion
485 sequence from the type returned by FN to the desired destination
486 type. */
487 conversion *second_conv;
488 struct rejection_reason *reason;
489 /* If FN is a member function, the binfo indicating the path used to
490 qualify the name of FN at the call site. This path is used to
491 determine whether or not FN is accessible if it is selected by
492 overload resolution. The DECL_CONTEXT of FN will always be a
493 (possibly improper) base of this binfo. */
494 tree access_path;
495 /* If FN is a non-static member function, the binfo indicating the
496 subobject to which the `this' pointer should be converted if FN
497 is selected by overload resolution. The type pointed to by
498 the `this' pointer must correspond to the most derived class
499 indicated by the CONVERSION_PATH. */
500 tree conversion_path;
501 tree template_decl;
502 tree explicit_targs;
503 candidate_warning *warnings;
504 z_candidate *next;
505 int viable;
507 /* The flags active in add_candidate. */
508 int flags;
511 /* Returns true iff T is a null pointer constant in the sense of
512 [conv.ptr]. */
514 bool
515 null_ptr_cst_p (tree t)
517 tree type = TREE_TYPE (t);
519 /* [conv.ptr]
521 A null pointer constant is an integral constant expression
522 (_expr.const_) rvalue of integer type that evaluates to zero or
523 an rvalue of type std::nullptr_t. */
524 if (NULLPTR_TYPE_P (type))
525 return true;
527 if (cxx_dialect >= cxx11)
529 /* Core issue 903 says only literal 0 is a null pointer constant. */
530 if (TREE_CODE (type) == INTEGER_TYPE
531 && TREE_CODE (t) == INTEGER_CST
532 && integer_zerop (t)
533 && !TREE_OVERFLOW (t))
534 return true;
536 else if (CP_INTEGRAL_TYPE_P (type))
538 t = fold_non_dependent_expr (t);
539 STRIP_NOPS (t);
540 if (integer_zerop (t) && !TREE_OVERFLOW (t))
541 return true;
544 return false;
547 /* Returns true iff T is a null member pointer value (4.11). */
549 bool
550 null_member_pointer_value_p (tree t)
552 tree type = TREE_TYPE (t);
553 if (!type)
554 return false;
555 else if (TYPE_PTRMEMFUNC_P (type))
556 return (TREE_CODE (t) == CONSTRUCTOR
557 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
558 else if (TYPE_PTRDATAMEM_P (type))
559 return integer_all_onesp (t);
560 else
561 return false;
564 /* Returns nonzero if PARMLIST consists of only default parms,
565 ellipsis, and/or undeduced parameter packs. */
567 bool
568 sufficient_parms_p (const_tree parmlist)
570 for (; parmlist && parmlist != void_list_node;
571 parmlist = TREE_CHAIN (parmlist))
572 if (!TREE_PURPOSE (parmlist)
573 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
574 return false;
575 return true;
578 /* Allocate N bytes of memory from the conversion obstack. The memory
579 is zeroed before being returned. */
581 static void *
582 conversion_obstack_alloc (size_t n)
584 void *p;
585 if (!conversion_obstack_initialized)
587 gcc_obstack_init (&conversion_obstack);
588 conversion_obstack_initialized = true;
590 p = obstack_alloc (&conversion_obstack, n);
591 memset (p, 0, n);
592 return p;
595 /* Allocate rejection reasons. */
597 static struct rejection_reason *
598 alloc_rejection (enum rejection_reason_code code)
600 struct rejection_reason *p;
601 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
602 p->code = code;
603 return p;
606 static struct rejection_reason *
607 arity_rejection (tree first_arg, int expected, int actual)
609 struct rejection_reason *r = alloc_rejection (rr_arity);
610 int adjust = first_arg != NULL_TREE;
611 r->u.arity.expected = expected - adjust;
612 r->u.arity.actual = actual - adjust;
613 return r;
616 static struct rejection_reason *
617 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
619 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
620 int adjust = first_arg != NULL_TREE;
621 r->u.conversion.n_arg = n_arg - adjust;
622 r->u.conversion.from = from;
623 r->u.conversion.to_type = to;
624 return r;
627 static struct rejection_reason *
628 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
630 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
631 int adjust = first_arg != NULL_TREE;
632 r->u.bad_conversion.n_arg = n_arg - adjust;
633 r->u.bad_conversion.from = from;
634 r->u.bad_conversion.to_type = to;
635 return r;
638 static struct rejection_reason *
639 explicit_conversion_rejection (tree from, tree to)
641 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
642 r->u.conversion.n_arg = 0;
643 r->u.conversion.from = from;
644 r->u.conversion.to_type = to;
645 return r;
648 static struct rejection_reason *
649 template_conversion_rejection (tree from, tree to)
651 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
652 r->u.conversion.n_arg = 0;
653 r->u.conversion.from = from;
654 r->u.conversion.to_type = to;
655 return r;
658 static struct rejection_reason *
659 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
660 const tree *args, unsigned int nargs,
661 tree return_type, unification_kind_t strict,
662 int flags)
664 size_t args_n_bytes = sizeof (*args) * nargs;
665 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
666 struct rejection_reason *r = alloc_rejection (rr_template_unification);
667 r->u.template_unification.tmpl = tmpl;
668 r->u.template_unification.explicit_targs = explicit_targs;
669 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
670 /* Copy args to our own storage. */
671 memcpy (args1, args, args_n_bytes);
672 r->u.template_unification.args = args1;
673 r->u.template_unification.nargs = nargs;
674 r->u.template_unification.return_type = return_type;
675 r->u.template_unification.strict = strict;
676 r->u.template_unification.flags = flags;
677 return r;
680 static struct rejection_reason *
681 template_unification_error_rejection (void)
683 return alloc_rejection (rr_template_unification);
686 static struct rejection_reason *
687 invalid_copy_with_fn_template_rejection (void)
689 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
690 return r;
693 // Build a constraint failure record, saving information into the
694 // template_instantiation field of the rejection. If FN is not a template
695 // declaration, the TMPL member is the FN declaration and TARGS is empty.
697 static struct rejection_reason *
698 constraint_failure (tree fn)
700 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
701 if (tree ti = DECL_TEMPLATE_INFO (fn))
703 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
704 r->u.template_instantiation.targs = TI_ARGS (ti);
706 else
708 r->u.template_instantiation.tmpl = fn;
709 r->u.template_instantiation.targs = NULL_TREE;
711 return r;
714 /* Dynamically allocate a conversion. */
716 static conversion *
717 alloc_conversion (conversion_kind kind)
719 conversion *c;
720 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
721 c->kind = kind;
722 return c;
725 /* Make sure that all memory on the conversion obstack has been
726 freed. */
728 void
729 validate_conversion_obstack (void)
731 if (conversion_obstack_initialized)
732 gcc_assert ((obstack_next_free (&conversion_obstack)
733 == obstack_base (&conversion_obstack)));
736 /* Dynamically allocate an array of N conversions. */
738 static conversion **
739 alloc_conversions (size_t n)
741 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
744 static conversion *
745 build_conv (conversion_kind code, tree type, conversion *from)
747 conversion *t;
748 conversion_rank rank = CONVERSION_RANK (from);
750 /* Note that the caller is responsible for filling in t->cand for
751 user-defined conversions. */
752 t = alloc_conversion (code);
753 t->type = type;
754 t->u.next = from;
756 switch (code)
758 case ck_ptr:
759 case ck_pmem:
760 case ck_base:
761 case ck_std:
762 if (rank < cr_std)
763 rank = cr_std;
764 break;
766 case ck_qual:
767 if (rank < cr_exact)
768 rank = cr_exact;
769 break;
771 default:
772 break;
774 t->rank = rank;
775 t->user_conv_p = (code == ck_user || from->user_conv_p);
776 t->bad_p = from->bad_p;
777 t->base_p = false;
778 return t;
781 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
782 specialization of std::initializer_list<T>, if such a conversion is
783 possible. */
785 static conversion *
786 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
788 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
789 unsigned len = CONSTRUCTOR_NELTS (ctor);
790 conversion **subconvs = alloc_conversions (len);
791 conversion *t;
792 unsigned i;
793 tree val;
795 /* Within a list-initialization we can have more user-defined
796 conversions. */
797 flags &= ~LOOKUP_NO_CONVERSION;
798 /* But no narrowing conversions. */
799 flags |= LOOKUP_NO_NARROWING;
801 /* Can't make an array of these types. */
802 if (TREE_CODE (elttype) == REFERENCE_TYPE
803 || TREE_CODE (elttype) == FUNCTION_TYPE
804 || VOID_TYPE_P (elttype))
805 return NULL;
807 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
809 conversion *sub
810 = implicit_conversion (elttype, TREE_TYPE (val), val,
811 false, flags, complain);
812 if (sub == NULL)
813 return NULL;
815 subconvs[i] = sub;
818 t = alloc_conversion (ck_list);
819 t->type = type;
820 t->u.list = subconvs;
821 t->rank = cr_exact;
823 for (i = 0; i < len; ++i)
825 conversion *sub = subconvs[i];
826 if (sub->rank > t->rank)
827 t->rank = sub->rank;
828 if (sub->user_conv_p)
829 t->user_conv_p = true;
830 if (sub->bad_p)
831 t->bad_p = true;
834 return t;
837 /* Return the next conversion of the conversion chain (if applicable),
838 or NULL otherwise. Please use this function instead of directly
839 accessing fields of struct conversion. */
841 static conversion *
842 next_conversion (conversion *conv)
844 if (conv == NULL
845 || conv->kind == ck_identity
846 || conv->kind == ck_ambig
847 || conv->kind == ck_list)
848 return NULL;
849 return conv->u.next;
852 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
853 is a valid aggregate initializer for array type ATYPE. */
855 static bool
856 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
858 unsigned i;
859 tree elttype = TREE_TYPE (atype);
860 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
862 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
863 bool ok;
864 if (TREE_CODE (elttype) == ARRAY_TYPE
865 && TREE_CODE (val) == CONSTRUCTOR)
866 ok = can_convert_array (elttype, val, flags, complain);
867 else
868 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
869 complain);
870 if (!ok)
871 return false;
873 return true;
876 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
877 aggregate class, if such a conversion is possible. */
879 static conversion *
880 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
882 unsigned HOST_WIDE_INT i = 0;
883 conversion *c;
884 tree field = next_initializable_field (TYPE_FIELDS (type));
885 tree empty_ctor = NULL_TREE;
887 /* We already called reshape_init in implicit_conversion. */
889 /* The conversions within the init-list aren't affected by the enclosing
890 context; they're always simple copy-initialization. */
891 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
893 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
895 tree ftype = TREE_TYPE (field);
896 tree val;
897 bool ok;
899 if (i < CONSTRUCTOR_NELTS (ctor))
900 val = CONSTRUCTOR_ELT (ctor, i)->value;
901 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
902 /* Value-initialization of reference is ill-formed. */
903 return NULL;
904 else
906 if (empty_ctor == NULL_TREE)
907 empty_ctor = build_constructor (init_list_type_node, NULL);
908 val = empty_ctor;
910 ++i;
912 if (TREE_CODE (ftype) == ARRAY_TYPE
913 && TREE_CODE (val) == CONSTRUCTOR)
914 ok = can_convert_array (ftype, val, flags, complain);
915 else
916 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
917 complain);
919 if (!ok)
920 return NULL;
922 if (TREE_CODE (type) == UNION_TYPE)
923 break;
926 if (i < CONSTRUCTOR_NELTS (ctor))
927 return NULL;
929 c = alloc_conversion (ck_aggr);
930 c->type = type;
931 c->rank = cr_exact;
932 c->user_conv_p = true;
933 c->check_narrowing = true;
934 c->u.next = NULL;
935 return c;
938 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
939 array type, if such a conversion is possible. */
941 static conversion *
942 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
944 conversion *c;
945 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
946 tree elttype = TREE_TYPE (type);
947 unsigned i;
948 tree val;
949 bool bad = false;
950 bool user = false;
951 enum conversion_rank rank = cr_exact;
953 /* We might need to propagate the size from the element to the array. */
954 complete_type (type);
956 if (TYPE_DOMAIN (type)
957 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
959 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
960 if (alen < len)
961 return NULL;
964 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
966 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
968 conversion *sub
969 = implicit_conversion (elttype, TREE_TYPE (val), val,
970 false, flags, complain);
971 if (sub == NULL)
972 return NULL;
974 if (sub->rank > rank)
975 rank = sub->rank;
976 if (sub->user_conv_p)
977 user = true;
978 if (sub->bad_p)
979 bad = true;
982 c = alloc_conversion (ck_aggr);
983 c->type = type;
984 c->rank = rank;
985 c->user_conv_p = user;
986 c->bad_p = bad;
987 c->u.next = NULL;
988 return c;
991 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
992 complex type, if such a conversion is possible. */
994 static conversion *
995 build_complex_conv (tree type, tree ctor, int flags,
996 tsubst_flags_t complain)
998 conversion *c;
999 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1000 tree elttype = TREE_TYPE (type);
1001 unsigned i;
1002 tree val;
1003 bool bad = false;
1004 bool user = false;
1005 enum conversion_rank rank = cr_exact;
1007 if (len != 2)
1008 return NULL;
1010 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1012 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1014 conversion *sub
1015 = implicit_conversion (elttype, TREE_TYPE (val), val,
1016 false, flags, complain);
1017 if (sub == NULL)
1018 return NULL;
1020 if (sub->rank > rank)
1021 rank = sub->rank;
1022 if (sub->user_conv_p)
1023 user = true;
1024 if (sub->bad_p)
1025 bad = true;
1028 c = alloc_conversion (ck_aggr);
1029 c->type = type;
1030 c->rank = rank;
1031 c->user_conv_p = user;
1032 c->bad_p = bad;
1033 c->u.next = NULL;
1034 return c;
1037 /* Build a representation of the identity conversion from EXPR to
1038 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1040 static conversion *
1041 build_identity_conv (tree type, tree expr)
1043 conversion *c;
1045 c = alloc_conversion (ck_identity);
1046 c->type = type;
1047 c->u.expr = expr;
1049 return c;
1052 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1053 were multiple user-defined conversions to accomplish the job.
1054 Build a conversion that indicates that ambiguity. */
1056 static conversion *
1057 build_ambiguous_conv (tree type, tree expr)
1059 conversion *c;
1061 c = alloc_conversion (ck_ambig);
1062 c->type = type;
1063 c->u.expr = expr;
1065 return c;
1068 tree
1069 strip_top_quals (tree t)
1071 if (TREE_CODE (t) == ARRAY_TYPE)
1072 return t;
1073 return cp_build_qualified_type (t, 0);
1076 /* Returns the standard conversion path (see [conv]) from type FROM to type
1077 TO, if any. For proper handling of null pointer constants, you must
1078 also pass the expression EXPR to convert from. If C_CAST_P is true,
1079 this conversion is coming from a C-style cast. */
1081 static conversion *
1082 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1083 int flags)
1085 enum tree_code fcode, tcode;
1086 conversion *conv;
1087 bool fromref = false;
1088 tree qualified_to;
1090 to = non_reference (to);
1091 if (TREE_CODE (from) == REFERENCE_TYPE)
1093 fromref = true;
1094 from = TREE_TYPE (from);
1096 qualified_to = to;
1097 to = strip_top_quals (to);
1098 from = strip_top_quals (from);
1100 if (expr && type_unknown_p (expr))
1102 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1104 tsubst_flags_t tflags = tf_conv;
1105 expr = instantiate_type (to, expr, tflags);
1106 if (expr == error_mark_node)
1107 return NULL;
1108 from = TREE_TYPE (expr);
1110 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1112 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1113 expr = resolve_nondeduced_context (expr);
1114 from = TREE_TYPE (expr);
1118 fcode = TREE_CODE (from);
1119 tcode = TREE_CODE (to);
1121 conv = build_identity_conv (from, expr);
1122 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1124 from = type_decays_to (from);
1125 fcode = TREE_CODE (from);
1126 conv = build_conv (ck_lvalue, from, conv);
1128 else if (fromref || (expr && lvalue_p (expr)))
1130 if (expr)
1132 tree bitfield_type;
1133 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1134 if (bitfield_type)
1136 from = strip_top_quals (bitfield_type);
1137 fcode = TREE_CODE (from);
1140 conv = build_conv (ck_rvalue, from, conv);
1141 if (flags & LOOKUP_PREFER_RVALUE)
1142 conv->rvaluedness_matches_p = true;
1145 /* Allow conversion between `__complex__' data types. */
1146 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1148 /* The standard conversion sequence to convert FROM to TO is
1149 the standard conversion sequence to perform componentwise
1150 conversion. */
1151 conversion *part_conv = standard_conversion
1152 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags);
1154 if (part_conv)
1156 conv = build_conv (part_conv->kind, to, conv);
1157 conv->rank = part_conv->rank;
1159 else
1160 conv = NULL;
1162 return conv;
1165 if (same_type_p (from, to))
1167 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1168 conv->type = qualified_to;
1169 return conv;
1172 /* [conv.ptr]
1173 A null pointer constant can be converted to a pointer type; ... A
1174 null pointer constant of integral type can be converted to an
1175 rvalue of type std::nullptr_t. */
1176 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1177 || NULLPTR_TYPE_P (to))
1178 && ((expr && null_ptr_cst_p (expr))
1179 || NULLPTR_TYPE_P (from)))
1180 conv = build_conv (ck_std, to, conv);
1181 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1182 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1184 /* For backwards brain damage compatibility, allow interconversion of
1185 pointers and integers with a pedwarn. */
1186 conv = build_conv (ck_std, to, conv);
1187 conv->bad_p = true;
1189 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1191 /* For backwards brain damage compatibility, allow interconversion of
1192 enums and integers with a pedwarn. */
1193 conv = build_conv (ck_std, to, conv);
1194 conv->bad_p = true;
1196 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1197 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1199 tree to_pointee;
1200 tree from_pointee;
1202 if (tcode == POINTER_TYPE
1203 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
1204 TREE_TYPE (to)))
1206 else if (VOID_TYPE_P (TREE_TYPE (to))
1207 && !TYPE_PTRDATAMEM_P (from)
1208 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
1210 tree nfrom = TREE_TYPE (from);
1211 /* Don't try to apply restrict to void. */
1212 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1213 from = build_pointer_type
1214 (cp_build_qualified_type (void_type_node, quals));
1215 conv = build_conv (ck_ptr, from, conv);
1217 else if (TYPE_PTRDATAMEM_P (from))
1219 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1220 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1222 if (DERIVED_FROM_P (fbase, tbase)
1223 && (same_type_ignoring_top_level_qualifiers_p
1224 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
1225 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
1227 from = build_ptrmem_type (tbase,
1228 TYPE_PTRMEM_POINTED_TO_TYPE (from));
1229 conv = build_conv (ck_pmem, from, conv);
1231 else if (!same_type_p (fbase, tbase))
1232 return NULL;
1234 else if (CLASS_TYPE_P (TREE_TYPE (from))
1235 && CLASS_TYPE_P (TREE_TYPE (to))
1236 /* [conv.ptr]
1238 An rvalue of type "pointer to cv D," where D is a
1239 class type, can be converted to an rvalue of type
1240 "pointer to cv B," where B is a base class (clause
1241 _class.derived_) of D. If B is an inaccessible
1242 (clause _class.access_) or ambiguous
1243 (_class.member.lookup_) base class of D, a program
1244 that necessitates this conversion is ill-formed.
1245 Therefore, we use DERIVED_FROM_P, and do not check
1246 access or uniqueness. */
1247 && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
1249 from =
1250 cp_build_qualified_type (TREE_TYPE (to),
1251 cp_type_quals (TREE_TYPE (from)));
1252 from = build_pointer_type (from);
1253 conv = build_conv (ck_ptr, from, conv);
1254 conv->base_p = true;
1256 else if (tx_safe_fn_type_p (TREE_TYPE (from)))
1258 /* A prvalue of type "pointer to transaction_safe function" can be
1259 converted to a prvalue of type "pointer to function". */
1260 tree unsafe = tx_unsafe_fn_variant (TREE_TYPE (from));
1261 if (same_type_p (unsafe, TREE_TYPE (to)))
1263 from = build_pointer_type (unsafe);
1264 conv = build_conv (ck_tsafe, from, conv);
1268 if (tcode == POINTER_TYPE)
1270 to_pointee = TREE_TYPE (to);
1271 from_pointee = TREE_TYPE (from);
1273 else
1275 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1276 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1279 if (same_type_p (from, to))
1280 /* OK */;
1281 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1282 /* In a C-style cast, we ignore CV-qualification because we
1283 are allowed to perform a static_cast followed by a
1284 const_cast. */
1285 conv = build_conv (ck_qual, to, conv);
1286 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1287 conv = build_conv (ck_qual, to, conv);
1288 else if (expr && string_conv_p (to, expr, 0))
1289 /* converting from string constant to char *. */
1290 conv = build_conv (ck_qual, to, conv);
1291 /* Allow conversions among compatible ObjC pointer types (base
1292 conversions have been already handled above). */
1293 else if (c_dialect_objc ()
1294 && objc_compare_types (to, from, -4, NULL_TREE))
1295 conv = build_conv (ck_ptr, to, conv);
1296 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1298 conv = build_conv (ck_ptr, to, conv);
1299 conv->bad_p = true;
1301 else
1302 return NULL;
1304 from = to;
1306 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1308 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1309 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1310 tree fbase = class_of_this_parm (fromfn);
1311 tree tbase = class_of_this_parm (tofn);
1313 if (!DERIVED_FROM_P (fbase, tbase)
1314 || !same_type_p (static_fn_type (fromfn),
1315 static_fn_type (tofn)))
1316 return NULL;
1318 from = build_memfn_type (fromfn,
1319 tbase,
1320 cp_type_quals (tbase),
1321 type_memfn_rqual (tofn));
1322 from = build_ptrmemfunc_type (build_pointer_type (from));
1323 conv = build_conv (ck_pmem, from, conv);
1324 conv->base_p = true;
1326 else if (tcode == BOOLEAN_TYPE)
1328 /* [conv.bool]
1330 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1331 to member type can be converted to a prvalue of type bool. ...
1332 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1333 std::nullptr_t can be converted to a prvalue of type bool; */
1334 if (ARITHMETIC_TYPE_P (from)
1335 || UNSCOPED_ENUM_P (from)
1336 || fcode == POINTER_TYPE
1337 || TYPE_PTRMEM_P (from)
1338 || NULLPTR_TYPE_P (from))
1340 conv = build_conv (ck_std, to, conv);
1341 if (fcode == POINTER_TYPE
1342 || TYPE_PTRDATAMEM_P (from)
1343 || (TYPE_PTRMEMFUNC_P (from)
1344 && conv->rank < cr_pbool)
1345 || NULLPTR_TYPE_P (from))
1346 conv->rank = cr_pbool;
1347 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1348 conv->bad_p = true;
1349 return conv;
1352 return NULL;
1354 /* We don't check for ENUMERAL_TYPE here because there are no standard
1355 conversions to enum type. */
1356 /* As an extension, allow conversion to complex type. */
1357 else if (ARITHMETIC_TYPE_P (to))
1359 if (! (INTEGRAL_CODE_P (fcode)
1360 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1361 || SCOPED_ENUM_P (from))
1362 return NULL;
1363 conv = build_conv (ck_std, to, conv);
1365 /* Give this a better rank if it's a promotion. */
1366 if (same_type_p (to, type_promotes_to (from))
1367 && next_conversion (conv)->rank <= cr_promotion)
1368 conv->rank = cr_promotion;
1370 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1371 && vector_types_convertible_p (from, to, false))
1372 return build_conv (ck_std, to, conv);
1373 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1374 && is_properly_derived_from (from, to))
1376 if (conv->kind == ck_rvalue)
1377 conv = next_conversion (conv);
1378 conv = build_conv (ck_base, to, conv);
1379 /* The derived-to-base conversion indicates the initialization
1380 of a parameter with base type from an object of a derived
1381 type. A temporary object is created to hold the result of
1382 the conversion unless we're binding directly to a reference. */
1383 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1385 else
1386 return NULL;
1388 if (flags & LOOKUP_NO_NARROWING)
1389 conv->check_narrowing = true;
1391 return conv;
1394 /* Returns nonzero if T1 is reference-related to T2. */
1396 bool
1397 reference_related_p (tree t1, tree t2)
1399 if (t1 == error_mark_node || t2 == error_mark_node)
1400 return false;
1402 t1 = TYPE_MAIN_VARIANT (t1);
1403 t2 = TYPE_MAIN_VARIANT (t2);
1405 /* [dcl.init.ref]
1407 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1408 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1409 of T2. */
1410 return (same_type_p (t1, t2)
1411 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1412 && DERIVED_FROM_P (t1, t2)));
1415 /* Returns nonzero if T1 is reference-compatible with T2. */
1417 static bool
1418 reference_compatible_p (tree t1, tree t2)
1420 /* [dcl.init.ref]
1422 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1423 reference-related to T2 and cv1 is the same cv-qualification as,
1424 or greater cv-qualification than, cv2. */
1425 return (reference_related_p (t1, t2)
1426 && at_least_as_qualified_p (t1, t2));
1429 /* A reference of the indicated TYPE is being bound directly to the
1430 expression represented by the implicit conversion sequence CONV.
1431 Return a conversion sequence for this binding. */
1433 static conversion *
1434 direct_reference_binding (tree type, conversion *conv)
1436 tree t;
1438 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1439 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1441 t = TREE_TYPE (type);
1443 /* [over.ics.rank]
1445 When a parameter of reference type binds directly
1446 (_dcl.init.ref_) to an argument expression, the implicit
1447 conversion sequence is the identity conversion, unless the
1448 argument expression has a type that is a derived class of the
1449 parameter type, in which case the implicit conversion sequence is
1450 a derived-to-base Conversion.
1452 If the parameter binds directly to the result of applying a
1453 conversion function to the argument expression, the implicit
1454 conversion sequence is a user-defined conversion sequence
1455 (_over.ics.user_), with the second standard conversion sequence
1456 either an identity conversion or, if the conversion function
1457 returns an entity of a type that is a derived class of the
1458 parameter type, a derived-to-base conversion. */
1459 if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type))
1461 /* Represent the derived-to-base conversion. */
1462 conv = build_conv (ck_base, t, conv);
1463 /* We will actually be binding to the base-class subobject in
1464 the derived class, so we mark this conversion appropriately.
1465 That way, convert_like knows not to generate a temporary. */
1466 conv->need_temporary_p = false;
1468 return build_conv (ck_ref_bind, type, conv);
1471 /* Returns the conversion path from type FROM to reference type TO for
1472 purposes of reference binding. For lvalue binding, either pass a
1473 reference type to FROM or an lvalue expression to EXPR. If the
1474 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1475 the conversion returned. If C_CAST_P is true, this
1476 conversion is coming from a C-style cast. */
1478 static conversion *
1479 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1480 tsubst_flags_t complain)
1482 conversion *conv = NULL;
1483 tree to = TREE_TYPE (rto);
1484 tree from = rfrom;
1485 tree tfrom;
1486 bool related_p;
1487 bool compatible_p;
1488 cp_lvalue_kind gl_kind;
1489 bool is_lvalue;
1491 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1493 expr = instantiate_type (to, expr, tf_none);
1494 if (expr == error_mark_node)
1495 return NULL;
1496 from = TREE_TYPE (expr);
1499 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1501 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1502 /* DR 1288: Otherwise, if the initializer list has a single element
1503 of type E and ... [T's] referenced type is reference-related to E,
1504 the object or reference is initialized from that element... */
1505 if (CONSTRUCTOR_NELTS (expr) == 1)
1507 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1508 if (error_operand_p (elt))
1509 return NULL;
1510 tree etype = TREE_TYPE (elt);
1511 if (reference_related_p (to, etype))
1513 expr = elt;
1514 from = etype;
1515 goto skip;
1518 /* Otherwise, if T is a reference type, a prvalue temporary of the
1519 type referenced by T is copy-list-initialized or
1520 direct-list-initialized, depending on the kind of initialization
1521 for the reference, and the reference is bound to that temporary. */
1522 conv = implicit_conversion (to, from, expr, c_cast_p,
1523 flags|LOOKUP_NO_TEMP_BIND, complain);
1524 skip:;
1527 if (TREE_CODE (from) == REFERENCE_TYPE)
1529 from = TREE_TYPE (from);
1530 if (!TYPE_REF_IS_RVALUE (rfrom)
1531 || TREE_CODE (from) == FUNCTION_TYPE)
1532 gl_kind = clk_ordinary;
1533 else
1534 gl_kind = clk_rvalueref;
1536 else if (expr)
1538 gl_kind = lvalue_kind (expr);
1539 if (gl_kind & clk_class)
1540 /* A class prvalue is not a glvalue. */
1541 gl_kind = clk_none;
1543 else
1544 gl_kind = clk_none;
1545 is_lvalue = gl_kind && !(gl_kind & clk_rvalueref);
1547 tfrom = from;
1548 if ((gl_kind & clk_bitfield) != 0)
1549 tfrom = unlowered_expr_type (expr);
1551 /* Figure out whether or not the types are reference-related and
1552 reference compatible. We have to do this after stripping
1553 references from FROM. */
1554 related_p = reference_related_p (to, tfrom);
1555 /* If this is a C cast, first convert to an appropriately qualified
1556 type, so that we can later do a const_cast to the desired type. */
1557 if (related_p && c_cast_p
1558 && !at_least_as_qualified_p (to, tfrom))
1559 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1560 compatible_p = reference_compatible_p (to, tfrom);
1562 /* Directly bind reference when target expression's type is compatible with
1563 the reference and expression is an lvalue. In DR391, the wording in
1564 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1565 const and rvalue references to rvalues of compatible class type.
1566 We should also do direct bindings for non-class xvalues. */
1567 if (related_p
1568 && (gl_kind
1569 || (!(flags & LOOKUP_NO_TEMP_BIND)
1570 && (CLASS_TYPE_P (from)
1571 || TREE_CODE (from) == ARRAY_TYPE))))
1573 /* [dcl.init.ref]
1575 If the initializer expression
1577 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1578 is reference-compatible with "cv2 T2,"
1580 the reference is bound directly to the initializer expression
1581 lvalue.
1583 [...]
1584 If the initializer expression is an rvalue, with T2 a class type,
1585 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1586 is bound to the object represented by the rvalue or to a sub-object
1587 within that object. */
1589 conv = build_identity_conv (tfrom, expr);
1590 conv = direct_reference_binding (rto, conv);
1592 if (flags & LOOKUP_PREFER_RVALUE)
1593 /* The top-level caller requested that we pretend that the lvalue
1594 be treated as an rvalue. */
1595 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1596 else if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1597 /* Handle rvalue reference to function properly. */
1598 conv->rvaluedness_matches_p
1599 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1600 else
1601 conv->rvaluedness_matches_p
1602 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1604 if ((gl_kind & clk_bitfield) != 0
1605 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1606 /* For the purposes of overload resolution, we ignore the fact
1607 this expression is a bitfield or packed field. (In particular,
1608 [over.ics.ref] says specifically that a function with a
1609 non-const reference parameter is viable even if the
1610 argument is a bitfield.)
1612 However, when we actually call the function we must create
1613 a temporary to which to bind the reference. If the
1614 reference is volatile, or isn't const, then we cannot make
1615 a temporary, so we just issue an error when the conversion
1616 actually occurs. */
1617 conv->need_temporary_p = true;
1619 /* Don't allow binding of lvalues (other than function lvalues) to
1620 rvalue references. */
1621 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1622 && TREE_CODE (to) != FUNCTION_TYPE
1623 && !(flags & LOOKUP_PREFER_RVALUE))
1624 conv->bad_p = true;
1626 /* Nor the reverse. */
1627 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1628 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1629 || (flags & LOOKUP_NO_RVAL_BIND))
1630 && TREE_CODE (to) != FUNCTION_TYPE)
1631 conv->bad_p = true;
1633 if (!compatible_p)
1634 conv->bad_p = true;
1636 return conv;
1638 /* [class.conv.fct] A conversion function is never used to convert a
1639 (possibly cv-qualified) object to the (possibly cv-qualified) same
1640 object type (or a reference to it), to a (possibly cv-qualified) base
1641 class of that type (or a reference to it).... */
1642 else if (CLASS_TYPE_P (from) && !related_p
1643 && !(flags & LOOKUP_NO_CONVERSION))
1645 /* [dcl.init.ref]
1647 If the initializer expression
1649 -- has a class type (i.e., T2 is a class type) can be
1650 implicitly converted to an lvalue of type "cv3 T3," where
1651 "cv1 T1" is reference-compatible with "cv3 T3". (this
1652 conversion is selected by enumerating the applicable
1653 conversion functions (_over.match.ref_) and choosing the
1654 best one through overload resolution. (_over.match_).
1656 the reference is bound to the lvalue result of the conversion
1657 in the second case. */
1658 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1659 complain);
1660 if (cand)
1661 return cand->second_conv;
1664 /* From this point on, we conceptually need temporaries, even if we
1665 elide them. Only the cases above are "direct bindings". */
1666 if (flags & LOOKUP_NO_TEMP_BIND)
1667 return NULL;
1669 /* [over.ics.rank]
1671 When a parameter of reference type is not bound directly to an
1672 argument expression, the conversion sequence is the one required
1673 to convert the argument expression to the underlying type of the
1674 reference according to _over.best.ics_. Conceptually, this
1675 conversion sequence corresponds to copy-initializing a temporary
1676 of the underlying type with the argument expression. Any
1677 difference in top-level cv-qualification is subsumed by the
1678 initialization itself and does not constitute a conversion. */
1680 /* [dcl.init.ref]
1682 Otherwise, the reference shall be an lvalue reference to a
1683 non-volatile const type, or the reference shall be an rvalue
1684 reference.
1686 We try below to treat this as a bad conversion to improve diagnostics,
1687 but if TO is an incomplete class, we need to reject this conversion
1688 now to avoid unnecessary instantiation. */
1689 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1690 && !COMPLETE_TYPE_P (to))
1691 return NULL;
1693 /* We're generating a temporary now, but don't bind any more in the
1694 conversion (specifically, don't slice the temporary returned by a
1695 conversion operator). */
1696 flags |= LOOKUP_NO_TEMP_BIND;
1698 /* Core issue 899: When [copy-]initializing a temporary to be bound
1699 to the first parameter of a copy constructor (12.8) called with
1700 a single argument in the context of direct-initialization,
1701 explicit conversion functions are also considered.
1703 So don't set LOOKUP_ONLYCONVERTING in that case. */
1704 if (!(flags & LOOKUP_COPY_PARM))
1705 flags |= LOOKUP_ONLYCONVERTING;
1707 if (!conv)
1708 conv = implicit_conversion (to, from, expr, c_cast_p,
1709 flags, complain);
1710 if (!conv)
1711 return NULL;
1713 if (conv->user_conv_p)
1715 /* If initializing the temporary used a conversion function,
1716 recalculate the second conversion sequence. */
1717 for (conversion *t = conv; t; t = next_conversion (t))
1718 if (t->kind == ck_user
1719 && DECL_CONV_FN_P (t->cand->fn))
1721 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1722 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1723 conversion *new_second
1724 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1725 sflags, complain);
1726 if (!new_second)
1727 return NULL;
1728 return merge_conversion_sequences (t, new_second);
1732 conv = build_conv (ck_ref_bind, rto, conv);
1733 /* This reference binding, unlike those above, requires the
1734 creation of a temporary. */
1735 conv->need_temporary_p = true;
1736 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1738 /* [dcl.init.ref]
1740 Otherwise, the reference shall be an lvalue reference to a
1741 non-volatile const type, or the reference shall be an rvalue
1742 reference. */
1743 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1744 conv->bad_p = true;
1746 /* [dcl.init.ref]
1748 Otherwise, a temporary of type "cv1 T1" is created and
1749 initialized from the initializer expression using the rules for a
1750 non-reference copy initialization. If T1 is reference-related to
1751 T2, cv1 must be the same cv-qualification as, or greater
1752 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1753 if (related_p && !at_least_as_qualified_p (to, from))
1754 conv->bad_p = true;
1756 return conv;
1759 /* Returns the implicit conversion sequence (see [over.ics]) from type
1760 FROM to type TO. The optional expression EXPR may affect the
1761 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1762 true, this conversion is coming from a C-style cast. */
1764 static conversion *
1765 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1766 int flags, tsubst_flags_t complain)
1768 conversion *conv;
1770 if (from == error_mark_node || to == error_mark_node
1771 || expr == error_mark_node)
1772 return NULL;
1774 /* Other flags only apply to the primary function in overload
1775 resolution, or after we've chosen one. */
1776 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1777 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1778 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1780 /* FIXME: actually we don't want warnings either, but we can't just
1781 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1782 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1783 We really ought not to issue that warning until we've committed
1784 to that conversion. */
1785 complain &= ~tf_error;
1787 /* Call reshape_init early to remove redundant braces. */
1788 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1789 && CLASS_TYPE_P (to)
1790 && COMPLETE_TYPE_P (complete_type (to))
1791 && !CLASSTYPE_NON_AGGREGATE (to))
1793 expr = reshape_init (to, expr, complain);
1794 if (expr == error_mark_node)
1795 return NULL;
1796 from = TREE_TYPE (expr);
1799 if (TREE_CODE (to) == REFERENCE_TYPE)
1800 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1801 else
1802 conv = standard_conversion (to, from, expr, c_cast_p, flags);
1804 if (conv)
1805 return conv;
1807 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1809 if (is_std_init_list (to))
1810 return build_list_conv (to, expr, flags, complain);
1812 /* As an extension, allow list-initialization of _Complex. */
1813 if (TREE_CODE (to) == COMPLEX_TYPE)
1815 conv = build_complex_conv (to, expr, flags, complain);
1816 if (conv)
1817 return conv;
1820 /* Allow conversion from an initializer-list with one element to a
1821 scalar type. */
1822 if (SCALAR_TYPE_P (to))
1824 int nelts = CONSTRUCTOR_NELTS (expr);
1825 tree elt;
1827 if (nelts == 0)
1828 elt = build_value_init (to, tf_none);
1829 else if (nelts == 1)
1830 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1831 else
1832 elt = error_mark_node;
1834 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1835 c_cast_p, flags, complain);
1836 if (conv)
1838 conv->check_narrowing = true;
1839 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1840 /* Too many levels of braces, i.e. '{{1}}'. */
1841 conv->bad_p = true;
1842 return conv;
1845 else if (TREE_CODE (to) == ARRAY_TYPE)
1846 return build_array_conv (to, expr, flags, complain);
1849 if (expr != NULL_TREE
1850 && (MAYBE_CLASS_TYPE_P (from)
1851 || MAYBE_CLASS_TYPE_P (to))
1852 && (flags & LOOKUP_NO_CONVERSION) == 0)
1854 struct z_candidate *cand;
1856 if (CLASS_TYPE_P (to)
1857 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1858 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1859 return build_aggr_conv (to, expr, flags, complain);
1861 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1862 if (cand)
1863 conv = cand->second_conv;
1865 /* We used to try to bind a reference to a temporary here, but that
1866 is now handled after the recursive call to this function at the end
1867 of reference_binding. */
1868 return conv;
1871 return NULL;
1874 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1875 functions. ARGS will not be changed until a single candidate is
1876 selected. */
1878 static struct z_candidate *
1879 add_candidate (struct z_candidate **candidates,
1880 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1881 size_t num_convs, conversion **convs,
1882 tree access_path, tree conversion_path,
1883 int viable, struct rejection_reason *reason,
1884 int flags)
1886 struct z_candidate *cand = (struct z_candidate *)
1887 conversion_obstack_alloc (sizeof (struct z_candidate));
1889 cand->fn = fn;
1890 cand->first_arg = first_arg;
1891 cand->args = args;
1892 cand->convs = convs;
1893 cand->num_convs = num_convs;
1894 cand->access_path = access_path;
1895 cand->conversion_path = conversion_path;
1896 cand->viable = viable;
1897 cand->reason = reason;
1898 cand->next = *candidates;
1899 cand->flags = flags;
1900 *candidates = cand;
1902 return cand;
1905 /* Return the number of remaining arguments in the parameter list
1906 beginning with ARG. */
1908 static int
1909 remaining_arguments (tree arg)
1911 int n;
1913 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1914 arg = TREE_CHAIN (arg))
1915 n++;
1917 return n;
1920 /* Create an overload candidate for the function or method FN called
1921 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1922 FLAGS is passed on to implicit_conversion.
1924 This does not change ARGS.
1926 CTYPE, if non-NULL, is the type we want to pretend this function
1927 comes from for purposes of overload resolution. */
1929 static struct z_candidate *
1930 add_function_candidate (struct z_candidate **candidates,
1931 tree fn, tree ctype, tree first_arg,
1932 const vec<tree, va_gc> *args, tree access_path,
1933 tree conversion_path, int flags,
1934 tsubst_flags_t complain)
1936 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1937 int i, len;
1938 conversion **convs;
1939 tree parmnode;
1940 tree orig_first_arg = first_arg;
1941 int skip;
1942 int viable = 1;
1943 struct rejection_reason *reason = NULL;
1945 /* At this point we should not see any functions which haven't been
1946 explicitly declared, except for friend functions which will have
1947 been found using argument dependent lookup. */
1948 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1950 /* The `this', `in_chrg' and VTT arguments to constructors are not
1951 considered in overload resolution. */
1952 if (DECL_CONSTRUCTOR_P (fn))
1954 parmlist = skip_artificial_parms_for (fn, parmlist);
1955 skip = num_artificial_parms_for (fn);
1956 if (skip > 0 && first_arg != NULL_TREE)
1958 --skip;
1959 first_arg = NULL_TREE;
1962 else
1963 skip = 0;
1965 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
1966 convs = alloc_conversions (len);
1968 /* 13.3.2 - Viable functions [over.match.viable]
1969 First, to be a viable function, a candidate function shall have enough
1970 parameters to agree in number with the arguments in the list.
1972 We need to check this first; otherwise, checking the ICSes might cause
1973 us to produce an ill-formed template instantiation. */
1975 parmnode = parmlist;
1976 for (i = 0; i < len; ++i)
1978 if (parmnode == NULL_TREE || parmnode == void_list_node)
1979 break;
1980 parmnode = TREE_CHAIN (parmnode);
1983 if ((i < len && parmnode)
1984 || !sufficient_parms_p (parmnode))
1986 int remaining = remaining_arguments (parmnode);
1987 viable = 0;
1988 reason = arity_rejection (first_arg, i + remaining, len);
1991 /* Second, for a function to be viable, its constraints must be
1992 satisfied. */
1993 if (flag_concepts && viable
1994 && !constraints_satisfied_p (fn))
1996 reason = constraint_failure (fn);
1997 viable = false;
2000 /* When looking for a function from a subobject from an implicit
2001 copy/move constructor/operator=, don't consider anything that takes (a
2002 reference to) an unrelated type. See c++/44909 and core 1092. */
2003 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2005 if (DECL_CONSTRUCTOR_P (fn))
2006 i = 1;
2007 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2008 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
2009 i = 2;
2010 else
2011 i = 0;
2012 if (i && len == i)
2014 parmnode = chain_index (i-1, parmlist);
2015 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2016 ctype))
2017 viable = 0;
2020 /* This only applies at the top level. */
2021 flags &= ~LOOKUP_DEFAULTED;
2024 if (! viable)
2025 goto out;
2027 /* Third, for F to be a viable function, there shall exist for each
2028 argument an implicit conversion sequence that converts that argument
2029 to the corresponding parameter of F. */
2031 parmnode = parmlist;
2033 for (i = 0; i < len; ++i)
2035 tree argtype, to_type;
2036 tree arg;
2037 conversion *t;
2038 int is_this;
2040 if (parmnode == void_list_node)
2041 break;
2043 if (i == 0 && first_arg != NULL_TREE)
2044 arg = first_arg;
2045 else
2046 arg = CONST_CAST_TREE (
2047 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2048 argtype = lvalue_type (arg);
2050 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2051 && ! DECL_CONSTRUCTOR_P (fn));
2053 if (parmnode)
2055 tree parmtype = TREE_VALUE (parmnode);
2056 int lflags = flags;
2058 parmnode = TREE_CHAIN (parmnode);
2060 /* The type of the implicit object parameter ('this') for
2061 overload resolution is not always the same as for the
2062 function itself; conversion functions are considered to
2063 be members of the class being converted, and functions
2064 introduced by a using-declaration are considered to be
2065 members of the class that uses them.
2067 Since build_over_call ignores the ICS for the `this'
2068 parameter, we can just change the parm type. */
2069 if (ctype && is_this)
2071 parmtype = cp_build_qualified_type
2072 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2073 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2075 /* If the function has a ref-qualifier, the implicit
2076 object parameter has reference type. */
2077 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2078 parmtype = cp_build_reference_type (parmtype, rv);
2079 /* The special handling of 'this' conversions in compare_ics
2080 does not apply if there is a ref-qualifier. */
2081 is_this = false;
2083 else
2085 parmtype = build_pointer_type (parmtype);
2086 arg = build_this (arg);
2087 argtype = lvalue_type (arg);
2091 /* Core issue 899: When [copy-]initializing a temporary to be bound
2092 to the first parameter of a copy constructor (12.8) called with
2093 a single argument in the context of direct-initialization,
2094 explicit conversion functions are also considered.
2096 So set LOOKUP_COPY_PARM to let reference_binding know that
2097 it's being called in that context. We generalize the above
2098 to handle move constructors and template constructors as well;
2099 the standardese should soon be updated similarly. */
2100 if (ctype && i == 0 && (len-skip == 1)
2101 && DECL_CONSTRUCTOR_P (fn)
2102 && parmtype != error_mark_node
2103 && (same_type_ignoring_top_level_qualifiers_p
2104 (non_reference (parmtype), ctype)))
2106 if (!(flags & LOOKUP_ONLYCONVERTING))
2107 lflags |= LOOKUP_COPY_PARM;
2108 /* We allow user-defined conversions within init-lists, but
2109 don't list-initialize the copy parm, as that would mean
2110 using two levels of braces for the same type. */
2111 if ((flags & LOOKUP_LIST_INIT_CTOR)
2112 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2113 lflags |= LOOKUP_NO_CONVERSION;
2115 else
2116 lflags |= LOOKUP_ONLYCONVERTING;
2118 t = implicit_conversion (parmtype, argtype, arg,
2119 /*c_cast_p=*/false, lflags, complain);
2120 to_type = parmtype;
2122 else
2124 t = build_identity_conv (argtype, arg);
2125 t->ellipsis_p = true;
2126 to_type = argtype;
2129 if (t && is_this)
2130 t->this_p = true;
2132 convs[i] = t;
2133 if (! t)
2135 viable = 0;
2136 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2137 break;
2140 if (t->bad_p)
2142 viable = -1;
2143 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2147 out:
2148 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2149 access_path, conversion_path, viable, reason, flags);
2152 /* Create an overload candidate for the conversion function FN which will
2153 be invoked for expression OBJ, producing a pointer-to-function which
2154 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2155 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2156 passed on to implicit_conversion.
2158 Actually, we don't really care about FN; we care about the type it
2159 converts to. There may be multiple conversion functions that will
2160 convert to that type, and we rely on build_user_type_conversion_1 to
2161 choose the best one; so when we create our candidate, we record the type
2162 instead of the function. */
2164 static struct z_candidate *
2165 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2166 const vec<tree, va_gc> *arglist,
2167 tree access_path, tree conversion_path,
2168 tsubst_flags_t complain)
2170 tree totype = TREE_TYPE (TREE_TYPE (fn));
2171 int i, len, viable, flags;
2172 tree parmlist, parmnode;
2173 conversion **convs;
2174 struct rejection_reason *reason;
2176 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2177 parmlist = TREE_TYPE (parmlist);
2178 parmlist = TYPE_ARG_TYPES (parmlist);
2180 len = vec_safe_length (arglist) + 1;
2181 convs = alloc_conversions (len);
2182 parmnode = parmlist;
2183 viable = 1;
2184 flags = LOOKUP_IMPLICIT;
2185 reason = NULL;
2187 /* Don't bother looking up the same type twice. */
2188 if (*candidates && (*candidates)->fn == totype)
2189 return NULL;
2191 for (i = 0; i < len; ++i)
2193 tree arg, argtype, convert_type = NULL_TREE;
2194 conversion *t;
2196 if (i == 0)
2197 arg = obj;
2198 else
2199 arg = (*arglist)[i - 1];
2200 argtype = lvalue_type (arg);
2202 if (i == 0)
2204 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2205 flags, complain);
2206 convert_type = totype;
2208 else if (parmnode == void_list_node)
2209 break;
2210 else if (parmnode)
2212 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2213 /*c_cast_p=*/false, flags, complain);
2214 convert_type = TREE_VALUE (parmnode);
2216 else
2218 t = build_identity_conv (argtype, arg);
2219 t->ellipsis_p = true;
2220 convert_type = argtype;
2223 convs[i] = t;
2224 if (! t)
2225 break;
2227 if (t->bad_p)
2229 viable = -1;
2230 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2233 if (i == 0)
2234 continue;
2236 if (parmnode)
2237 parmnode = TREE_CHAIN (parmnode);
2240 if (i < len
2241 || ! sufficient_parms_p (parmnode))
2243 int remaining = remaining_arguments (parmnode);
2244 viable = 0;
2245 reason = arity_rejection (NULL_TREE, i + remaining, len);
2248 return add_candidate (candidates, totype, obj, arglist, len, convs,
2249 access_path, conversion_path, viable, reason, flags);
2252 static void
2253 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2254 tree type1, tree type2, tree *args, tree *argtypes,
2255 int flags, tsubst_flags_t complain)
2257 conversion *t;
2258 conversion **convs;
2259 size_t num_convs;
2260 int viable = 1, i;
2261 tree types[2];
2262 struct rejection_reason *reason = NULL;
2264 types[0] = type1;
2265 types[1] = type2;
2267 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2268 convs = alloc_conversions (num_convs);
2270 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2271 conversion ops are allowed. We handle that here by just checking for
2272 boolean_type_node because other operators don't ask for it. COND_EXPR
2273 also does contextual conversion to bool for the first operand, but we
2274 handle that in build_conditional_expr, and type1 here is operand 2. */
2275 if (type1 != boolean_type_node)
2276 flags |= LOOKUP_ONLYCONVERTING;
2278 for (i = 0; i < 2; ++i)
2280 if (! args[i])
2281 break;
2283 t = implicit_conversion (types[i], argtypes[i], args[i],
2284 /*c_cast_p=*/false, flags, complain);
2285 if (! t)
2287 viable = 0;
2288 /* We need something for printing the candidate. */
2289 t = build_identity_conv (types[i], NULL_TREE);
2290 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2291 types[i]);
2293 else if (t->bad_p)
2295 viable = 0;
2296 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2297 types[i]);
2299 convs[i] = t;
2302 /* For COND_EXPR we rearranged the arguments; undo that now. */
2303 if (args[2])
2305 convs[2] = convs[1];
2306 convs[1] = convs[0];
2307 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2308 /*c_cast_p=*/false, flags,
2309 complain);
2310 if (t)
2311 convs[0] = t;
2312 else
2314 viable = 0;
2315 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2316 boolean_type_node);
2320 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2321 num_convs, convs,
2322 /*access_path=*/NULL_TREE,
2323 /*conversion_path=*/NULL_TREE,
2324 viable, reason, flags);
2327 static bool
2328 is_complete (tree t)
2330 return COMPLETE_TYPE_P (complete_type (t));
2333 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2335 static bool
2336 promoted_arithmetic_type_p (tree type)
2338 /* [over.built]
2340 In this section, the term promoted integral type is used to refer
2341 to those integral types which are preserved by integral promotion
2342 (including e.g. int and long but excluding e.g. char).
2343 Similarly, the term promoted arithmetic type refers to promoted
2344 integral types plus floating types. */
2345 return ((CP_INTEGRAL_TYPE_P (type)
2346 && same_type_p (type_promotes_to (type), type))
2347 || TREE_CODE (type) == REAL_TYPE);
2350 /* Create any builtin operator overload candidates for the operator in
2351 question given the converted operand types TYPE1 and TYPE2. The other
2352 args are passed through from add_builtin_candidates to
2353 build_builtin_candidate.
2355 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2356 If CODE is requires candidates operands of the same type of the kind
2357 of which TYPE1 and TYPE2 are, we add both candidates
2358 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2360 static void
2361 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2362 enum tree_code code2, tree fnname, tree type1,
2363 tree type2, tree *args, tree *argtypes, int flags,
2364 tsubst_flags_t complain)
2366 switch (code)
2368 case POSTINCREMENT_EXPR:
2369 case POSTDECREMENT_EXPR:
2370 args[1] = integer_zero_node;
2371 type2 = integer_type_node;
2372 break;
2373 default:
2374 break;
2377 switch (code)
2380 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2381 and VQ is either volatile or empty, there exist candidate operator
2382 functions of the form
2383 VQ T& operator++(VQ T&);
2384 T operator++(VQ T&, int);
2385 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2386 type other than bool, and VQ is either volatile or empty, there exist
2387 candidate operator functions of the form
2388 VQ T& operator--(VQ T&);
2389 T operator--(VQ T&, int);
2390 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2391 complete object type, and VQ is either volatile or empty, there exist
2392 candidate operator functions of the form
2393 T*VQ& operator++(T*VQ&);
2394 T*VQ& operator--(T*VQ&);
2395 T* operator++(T*VQ&, int);
2396 T* operator--(T*VQ&, int); */
2398 case POSTDECREMENT_EXPR:
2399 case PREDECREMENT_EXPR:
2400 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2401 return;
2402 case POSTINCREMENT_EXPR:
2403 case PREINCREMENT_EXPR:
2404 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2406 type1 = build_reference_type (type1);
2407 break;
2409 return;
2411 /* 7 For every cv-qualified or cv-unqualified object type T, there
2412 exist candidate operator functions of the form
2414 T& operator*(T*);
2416 8 For every function type T, there exist candidate operator functions of
2417 the form
2418 T& operator*(T*); */
2420 case INDIRECT_REF:
2421 if (TYPE_PTR_P (type1)
2422 && (TYPE_PTROB_P (type1)
2423 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2424 break;
2425 return;
2427 /* 9 For every type T, there exist candidate operator functions of the form
2428 T* operator+(T*);
2430 10For every promoted arithmetic type T, there exist candidate operator
2431 functions of the form
2432 T operator+(T);
2433 T operator-(T); */
2435 case UNARY_PLUS_EXPR: /* unary + */
2436 if (TYPE_PTR_P (type1))
2437 break;
2438 case NEGATE_EXPR:
2439 if (ARITHMETIC_TYPE_P (type1))
2440 break;
2441 return;
2443 /* 11For every promoted integral type T, there exist candidate operator
2444 functions of the form
2445 T operator~(T); */
2447 case BIT_NOT_EXPR:
2448 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2449 break;
2450 return;
2452 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2453 is the same type as C2 or is a derived class of C2, T is a complete
2454 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2455 there exist candidate operator functions of the form
2456 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2457 where CV12 is the union of CV1 and CV2. */
2459 case MEMBER_REF:
2460 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2462 tree c1 = TREE_TYPE (type1);
2463 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2465 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2466 && (TYPE_PTRMEMFUNC_P (type2)
2467 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2468 break;
2470 return;
2472 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2473 didate operator functions of the form
2474 LR operator*(L, R);
2475 LR operator/(L, R);
2476 LR operator+(L, R);
2477 LR operator-(L, R);
2478 bool operator<(L, R);
2479 bool operator>(L, R);
2480 bool operator<=(L, R);
2481 bool operator>=(L, R);
2482 bool operator==(L, R);
2483 bool operator!=(L, R);
2484 where LR is the result of the usual arithmetic conversions between
2485 types L and R.
2487 14For every pair of types T and I, where T is a cv-qualified or cv-
2488 unqualified complete object type and I is a promoted integral type,
2489 there exist candidate operator functions of the form
2490 T* operator+(T*, I);
2491 T& operator[](T*, I);
2492 T* operator-(T*, I);
2493 T* operator+(I, T*);
2494 T& operator[](I, T*);
2496 15For every T, where T is a pointer to complete object type, there exist
2497 candidate operator functions of the form112)
2498 ptrdiff_t operator-(T, T);
2500 16For every pointer or enumeration type T, there exist candidate operator
2501 functions of the form
2502 bool operator<(T, T);
2503 bool operator>(T, T);
2504 bool operator<=(T, T);
2505 bool operator>=(T, T);
2506 bool operator==(T, T);
2507 bool operator!=(T, T);
2509 17For every pointer to member type T, there exist candidate operator
2510 functions of the form
2511 bool operator==(T, T);
2512 bool operator!=(T, T); */
2514 case MINUS_EXPR:
2515 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2516 break;
2517 if (TYPE_PTROB_P (type1)
2518 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2520 type2 = ptrdiff_type_node;
2521 break;
2523 case MULT_EXPR:
2524 case TRUNC_DIV_EXPR:
2525 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2526 break;
2527 return;
2529 case EQ_EXPR:
2530 case NE_EXPR:
2531 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2532 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2533 break;
2534 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2536 type2 = type1;
2537 break;
2539 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2541 type1 = type2;
2542 break;
2544 /* Fall through. */
2545 case LT_EXPR:
2546 case GT_EXPR:
2547 case LE_EXPR:
2548 case GE_EXPR:
2549 case MAX_EXPR:
2550 case MIN_EXPR:
2551 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2552 break;
2553 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2554 break;
2555 if (TREE_CODE (type1) == ENUMERAL_TYPE
2556 && TREE_CODE (type2) == ENUMERAL_TYPE)
2557 break;
2558 if (TYPE_PTR_P (type1)
2559 && null_ptr_cst_p (args[1]))
2561 type2 = type1;
2562 break;
2564 if (null_ptr_cst_p (args[0])
2565 && TYPE_PTR_P (type2))
2567 type1 = type2;
2568 break;
2570 return;
2572 case PLUS_EXPR:
2573 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2574 break;
2575 case ARRAY_REF:
2576 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2578 type1 = ptrdiff_type_node;
2579 break;
2581 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2583 type2 = ptrdiff_type_node;
2584 break;
2586 return;
2588 /* 18For every pair of promoted integral types L and R, there exist candi-
2589 date operator functions of the form
2590 LR operator%(L, R);
2591 LR operator&(L, R);
2592 LR operator^(L, R);
2593 LR operator|(L, R);
2594 L operator<<(L, R);
2595 L operator>>(L, R);
2596 where LR is the result of the usual arithmetic conversions between
2597 types L and R. */
2599 case TRUNC_MOD_EXPR:
2600 case BIT_AND_EXPR:
2601 case BIT_IOR_EXPR:
2602 case BIT_XOR_EXPR:
2603 case LSHIFT_EXPR:
2604 case RSHIFT_EXPR:
2605 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2606 break;
2607 return;
2609 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2610 type, VQ is either volatile or empty, and R is a promoted arithmetic
2611 type, there exist candidate operator functions of the form
2612 VQ L& operator=(VQ L&, R);
2613 VQ L& operator*=(VQ L&, R);
2614 VQ L& operator/=(VQ L&, R);
2615 VQ L& operator+=(VQ L&, R);
2616 VQ L& operator-=(VQ L&, R);
2618 20For every pair T, VQ), where T is any type and VQ is either volatile
2619 or empty, there exist candidate operator functions of the form
2620 T*VQ& operator=(T*VQ&, T*);
2622 21For every pair T, VQ), where T is a pointer to member type and VQ is
2623 either volatile or empty, there exist candidate operator functions of
2624 the form
2625 VQ T& operator=(VQ T&, T);
2627 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2628 unqualified complete object type, VQ is either volatile or empty, and
2629 I is a promoted integral type, there exist candidate operator func-
2630 tions of the form
2631 T*VQ& operator+=(T*VQ&, I);
2632 T*VQ& operator-=(T*VQ&, I);
2634 23For every triple L, VQ, R), where L is an integral or enumeration
2635 type, VQ is either volatile or empty, and R is a promoted integral
2636 type, there exist candidate operator functions of the form
2638 VQ L& operator%=(VQ L&, R);
2639 VQ L& operator<<=(VQ L&, R);
2640 VQ L& operator>>=(VQ L&, R);
2641 VQ L& operator&=(VQ L&, R);
2642 VQ L& operator^=(VQ L&, R);
2643 VQ L& operator|=(VQ L&, R); */
2645 case MODIFY_EXPR:
2646 switch (code2)
2648 case PLUS_EXPR:
2649 case MINUS_EXPR:
2650 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2652 type2 = ptrdiff_type_node;
2653 break;
2655 case MULT_EXPR:
2656 case TRUNC_DIV_EXPR:
2657 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2658 break;
2659 return;
2661 case TRUNC_MOD_EXPR:
2662 case BIT_AND_EXPR:
2663 case BIT_IOR_EXPR:
2664 case BIT_XOR_EXPR:
2665 case LSHIFT_EXPR:
2666 case RSHIFT_EXPR:
2667 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2668 break;
2669 return;
2671 case NOP_EXPR:
2672 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2673 break;
2674 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2675 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2676 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2677 || ((TYPE_PTRMEMFUNC_P (type1)
2678 || TYPE_PTR_P (type1))
2679 && null_ptr_cst_p (args[1])))
2681 type2 = type1;
2682 break;
2684 return;
2686 default:
2687 gcc_unreachable ();
2689 type1 = build_reference_type (type1);
2690 break;
2692 case COND_EXPR:
2693 /* [over.built]
2695 For every pair of promoted arithmetic types L and R, there
2696 exist candidate operator functions of the form
2698 LR operator?(bool, L, R);
2700 where LR is the result of the usual arithmetic conversions
2701 between types L and R.
2703 For every type T, where T is a pointer or pointer-to-member
2704 type, there exist candidate operator functions of the form T
2705 operator?(bool, T, T); */
2707 if (promoted_arithmetic_type_p (type1)
2708 && promoted_arithmetic_type_p (type2))
2709 /* That's OK. */
2710 break;
2712 /* Otherwise, the types should be pointers. */
2713 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2714 return;
2716 /* We don't check that the two types are the same; the logic
2717 below will actually create two candidates; one in which both
2718 parameter types are TYPE1, and one in which both parameter
2719 types are TYPE2. */
2720 break;
2722 case REALPART_EXPR:
2723 case IMAGPART_EXPR:
2724 if (ARITHMETIC_TYPE_P (type1))
2725 break;
2726 return;
2728 default:
2729 gcc_unreachable ();
2732 /* Make sure we don't create builtin candidates with dependent types. */
2733 bool u1 = uses_template_parms (type1);
2734 bool u2 = type2 ? uses_template_parms (type2) : false;
2735 if (u1 || u2)
2737 /* Try to recover if one of the types is non-dependent. But if
2738 there's only one type, there's nothing we can do. */
2739 if (!type2)
2740 return;
2741 /* And we lose if both are dependent. */
2742 if (u1 && u2)
2743 return;
2744 /* Or if they have different forms. */
2745 if (TREE_CODE (type1) != TREE_CODE (type2))
2746 return;
2748 if (u1 && !u2)
2749 type1 = type2;
2750 else if (u2 && !u1)
2751 type2 = type1;
2754 /* If we're dealing with two pointer types or two enumeral types,
2755 we need candidates for both of them. */
2756 if (type2 && !same_type_p (type1, type2)
2757 && TREE_CODE (type1) == TREE_CODE (type2)
2758 && (TREE_CODE (type1) == REFERENCE_TYPE
2759 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2760 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2761 || TYPE_PTRMEMFUNC_P (type1)
2762 || MAYBE_CLASS_TYPE_P (type1)
2763 || TREE_CODE (type1) == ENUMERAL_TYPE))
2765 if (TYPE_PTR_OR_PTRMEM_P (type1))
2767 tree cptype = composite_pointer_type (type1, type2,
2768 error_mark_node,
2769 error_mark_node,
2770 CPO_CONVERSION,
2771 tf_none);
2772 if (cptype != error_mark_node)
2774 build_builtin_candidate
2775 (candidates, fnname, cptype, cptype, args, argtypes,
2776 flags, complain);
2777 return;
2781 build_builtin_candidate
2782 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2783 build_builtin_candidate
2784 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2785 return;
2788 build_builtin_candidate
2789 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2792 tree
2793 type_decays_to (tree type)
2795 if (TREE_CODE (type) == ARRAY_TYPE)
2796 return build_pointer_type (TREE_TYPE (type));
2797 if (TREE_CODE (type) == FUNCTION_TYPE)
2798 return build_pointer_type (type);
2799 return type;
2802 /* There are three conditions of builtin candidates:
2804 1) bool-taking candidates. These are the same regardless of the input.
2805 2) pointer-pair taking candidates. These are generated for each type
2806 one of the input types converts to.
2807 3) arithmetic candidates. According to the standard, we should generate
2808 all of these, but I'm trying not to...
2810 Here we generate a superset of the possible candidates for this particular
2811 case. That is a subset of the full set the standard defines, plus some
2812 other cases which the standard disallows. add_builtin_candidate will
2813 filter out the invalid set. */
2815 static void
2816 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2817 enum tree_code code2, tree fnname, tree *args,
2818 int flags, tsubst_flags_t complain)
2820 int ref1, i;
2821 int enum_p = 0;
2822 tree type, argtypes[3], t;
2823 /* TYPES[i] is the set of possible builtin-operator parameter types
2824 we will consider for the Ith argument. */
2825 vec<tree, va_gc> *types[2];
2826 unsigned ix;
2828 for (i = 0; i < 3; ++i)
2830 if (args[i])
2831 argtypes[i] = unlowered_expr_type (args[i]);
2832 else
2833 argtypes[i] = NULL_TREE;
2836 switch (code)
2838 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2839 and VQ is either volatile or empty, there exist candidate operator
2840 functions of the form
2841 VQ T& operator++(VQ T&); */
2843 case POSTINCREMENT_EXPR:
2844 case PREINCREMENT_EXPR:
2845 case POSTDECREMENT_EXPR:
2846 case PREDECREMENT_EXPR:
2847 case MODIFY_EXPR:
2848 ref1 = 1;
2849 break;
2851 /* 24There also exist candidate operator functions of the form
2852 bool operator!(bool);
2853 bool operator&&(bool, bool);
2854 bool operator||(bool, bool); */
2856 case TRUTH_NOT_EXPR:
2857 build_builtin_candidate
2858 (candidates, fnname, boolean_type_node,
2859 NULL_TREE, args, argtypes, flags, complain);
2860 return;
2862 case TRUTH_ORIF_EXPR:
2863 case TRUTH_ANDIF_EXPR:
2864 build_builtin_candidate
2865 (candidates, fnname, boolean_type_node,
2866 boolean_type_node, args, argtypes, flags, complain);
2867 return;
2869 case ADDR_EXPR:
2870 case COMPOUND_EXPR:
2871 case COMPONENT_REF:
2872 return;
2874 case COND_EXPR:
2875 case EQ_EXPR:
2876 case NE_EXPR:
2877 case LT_EXPR:
2878 case LE_EXPR:
2879 case GT_EXPR:
2880 case GE_EXPR:
2881 enum_p = 1;
2882 /* Fall through. */
2884 default:
2885 ref1 = 0;
2888 types[0] = make_tree_vector ();
2889 types[1] = make_tree_vector ();
2891 for (i = 0; i < 2; ++i)
2893 if (! args[i])
2895 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2897 tree convs;
2899 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2900 return;
2902 convs = lookup_conversions (argtypes[i]);
2904 if (code == COND_EXPR)
2906 if (real_lvalue_p (args[i]))
2907 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2909 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2912 else if (! convs)
2913 return;
2915 for (; convs; convs = TREE_CHAIN (convs))
2917 type = TREE_TYPE (convs);
2919 if (i == 0 && ref1
2920 && (TREE_CODE (type) != REFERENCE_TYPE
2921 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2922 continue;
2924 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2925 vec_safe_push (types[i], type);
2927 type = non_reference (type);
2928 if (i != 0 || ! ref1)
2930 type = cv_unqualified (type_decays_to (type));
2931 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2932 vec_safe_push (types[i], type);
2933 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2934 type = type_promotes_to (type);
2937 if (! vec_member (type, types[i]))
2938 vec_safe_push (types[i], type);
2941 else
2943 if (code == COND_EXPR && real_lvalue_p (args[i]))
2944 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2945 type = non_reference (argtypes[i]);
2946 if (i != 0 || ! ref1)
2948 type = cv_unqualified (type_decays_to (type));
2949 if (enum_p && UNSCOPED_ENUM_P (type))
2950 vec_safe_push (types[i], type);
2951 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2952 type = type_promotes_to (type);
2954 vec_safe_push (types[i], type);
2958 /* Run through the possible parameter types of both arguments,
2959 creating candidates with those parameter types. */
2960 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
2962 unsigned jx;
2963 tree u;
2965 if (!types[1]->is_empty ())
2966 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
2967 add_builtin_candidate
2968 (candidates, code, code2, fnname, t,
2969 u, args, argtypes, flags, complain);
2970 else
2971 add_builtin_candidate
2972 (candidates, code, code2, fnname, t,
2973 NULL_TREE, args, argtypes, flags, complain);
2976 release_tree_vector (types[0]);
2977 release_tree_vector (types[1]);
2981 /* If TMPL can be successfully instantiated as indicated by
2982 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2984 TMPL is the template. EXPLICIT_TARGS are any explicit template
2985 arguments. ARGLIST is the arguments provided at the call-site.
2986 This does not change ARGLIST. The RETURN_TYPE is the desired type
2987 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2988 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2989 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2991 static struct z_candidate*
2992 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2993 tree ctype, tree explicit_targs, tree first_arg,
2994 const vec<tree, va_gc> *arglist, tree return_type,
2995 tree access_path, tree conversion_path,
2996 int flags, tree obj, unification_kind_t strict,
2997 tsubst_flags_t complain)
2999 int ntparms = DECL_NTPARMS (tmpl);
3000 tree targs = make_tree_vec (ntparms);
3001 unsigned int len = vec_safe_length (arglist);
3002 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3003 unsigned int skip_without_in_chrg = 0;
3004 tree first_arg_without_in_chrg = first_arg;
3005 tree *args_without_in_chrg;
3006 unsigned int nargs_without_in_chrg;
3007 unsigned int ia, ix;
3008 tree arg;
3009 struct z_candidate *cand;
3010 tree fn;
3011 struct rejection_reason *reason = NULL;
3012 int errs;
3014 /* We don't do deduction on the in-charge parameter, the VTT
3015 parameter or 'this'. */
3016 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3018 if (first_arg_without_in_chrg != NULL_TREE)
3019 first_arg_without_in_chrg = NULL_TREE;
3020 else if (return_type && strict == DEDUCE_CALL)
3021 /* We're deducing for a call to the result of a template conversion
3022 function, so the args don't contain 'this'; leave them alone. */;
3023 else
3024 ++skip_without_in_chrg;
3027 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3028 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3029 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3031 if (first_arg_without_in_chrg != NULL_TREE)
3032 first_arg_without_in_chrg = NULL_TREE;
3033 else
3034 ++skip_without_in_chrg;
3037 if (len < skip_without_in_chrg)
3038 return NULL;
3040 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3041 + (len - skip_without_in_chrg));
3042 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3043 ia = 0;
3044 if (first_arg_without_in_chrg != NULL_TREE)
3046 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3047 ++ia;
3049 for (ix = skip_without_in_chrg;
3050 vec_safe_iterate (arglist, ix, &arg);
3051 ++ix)
3053 args_without_in_chrg[ia] = arg;
3054 ++ia;
3056 gcc_assert (ia == nargs_without_in_chrg);
3058 errs = errorcount+sorrycount;
3059 fn = fn_type_unification (tmpl, explicit_targs, targs,
3060 args_without_in_chrg,
3061 nargs_without_in_chrg,
3062 return_type, strict, flags, false,
3063 complain & tf_decltype);
3065 if (fn == error_mark_node)
3067 /* Don't repeat unification later if it already resulted in errors. */
3068 if (errorcount+sorrycount == errs)
3069 reason = template_unification_rejection (tmpl, explicit_targs,
3070 targs, args_without_in_chrg,
3071 nargs_without_in_chrg,
3072 return_type, strict, flags);
3073 else
3074 reason = template_unification_error_rejection ();
3075 goto fail;
3078 /* In [class.copy]:
3080 A member function template is never instantiated to perform the
3081 copy of a class object to an object of its class type.
3083 It's a little unclear what this means; the standard explicitly
3084 does allow a template to be used to copy a class. For example,
3087 struct A {
3088 A(A&);
3089 template <class T> A(const T&);
3091 const A f ();
3092 void g () { A a (f ()); }
3094 the member template will be used to make the copy. The section
3095 quoted above appears in the paragraph that forbids constructors
3096 whose only parameter is (a possibly cv-qualified variant of) the
3097 class type, and a logical interpretation is that the intent was
3098 to forbid the instantiation of member templates which would then
3099 have that form. */
3100 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3102 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3103 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3104 ctype))
3106 reason = invalid_copy_with_fn_template_rejection ();
3107 goto fail;
3111 if (obj != NULL_TREE)
3112 /* Aha, this is a conversion function. */
3113 cand = add_conv_candidate (candidates, fn, obj, arglist,
3114 access_path, conversion_path, complain);
3115 else
3116 cand = add_function_candidate (candidates, fn, ctype,
3117 first_arg, arglist, access_path,
3118 conversion_path, flags, complain);
3119 if (DECL_TI_TEMPLATE (fn) != tmpl)
3120 /* This situation can occur if a member template of a template
3121 class is specialized. Then, instantiate_template might return
3122 an instantiation of the specialization, in which case the
3123 DECL_TI_TEMPLATE field will point at the original
3124 specialization. For example:
3126 template <class T> struct S { template <class U> void f(U);
3127 template <> void f(int) {}; };
3128 S<double> sd;
3129 sd.f(3);
3131 Here, TMPL will be template <class U> S<double>::f(U).
3132 And, instantiate template will give us the specialization
3133 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3134 for this will point at template <class T> template <> S<T>::f(int),
3135 so that we can find the definition. For the purposes of
3136 overload resolution, however, we want the original TMPL. */
3137 cand->template_decl = build_template_info (tmpl, targs);
3138 else
3139 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3140 cand->explicit_targs = explicit_targs;
3142 return cand;
3143 fail:
3144 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3145 access_path, conversion_path, 0, reason, flags);
3149 static struct z_candidate *
3150 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3151 tree explicit_targs, tree first_arg,
3152 const vec<tree, va_gc> *arglist, tree return_type,
3153 tree access_path, tree conversion_path, int flags,
3154 unification_kind_t strict, tsubst_flags_t complain)
3156 return
3157 add_template_candidate_real (candidates, tmpl, ctype,
3158 explicit_targs, first_arg, arglist,
3159 return_type, access_path, conversion_path,
3160 flags, NULL_TREE, strict, complain);
3163 /* Create an overload candidate for the conversion function template TMPL,
3164 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3165 pointer-to-function which will in turn be called with the argument list
3166 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3167 passed on to implicit_conversion. */
3169 static struct z_candidate *
3170 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3171 tree obj,
3172 const vec<tree, va_gc> *arglist,
3173 tree return_type, tree access_path,
3174 tree conversion_path, tsubst_flags_t complain)
3176 return
3177 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3178 NULL_TREE, arglist, return_type, access_path,
3179 conversion_path, 0, obj, DEDUCE_CALL,
3180 complain);
3183 /* The CANDS are the set of candidates that were considered for
3184 overload resolution. Return the set of viable candidates, or CANDS
3185 if none are viable. If any of the candidates were viable, set
3186 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3187 considered viable only if it is strictly viable. */
3189 static struct z_candidate*
3190 splice_viable (struct z_candidate *cands,
3191 bool strict_p,
3192 bool *any_viable_p)
3194 struct z_candidate *viable;
3195 struct z_candidate **last_viable;
3196 struct z_candidate **cand;
3197 bool found_strictly_viable = false;
3199 /* Be strict inside templates, since build_over_call won't actually
3200 do the conversions to get pedwarns. */
3201 if (processing_template_decl)
3202 strict_p = true;
3204 viable = NULL;
3205 last_viable = &viable;
3206 *any_viable_p = false;
3208 cand = &cands;
3209 while (*cand)
3211 struct z_candidate *c = *cand;
3212 if (!strict_p
3213 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3215 /* Be strict in the presence of a viable candidate. Also if
3216 there are template candidates, so that we get deduction errors
3217 for them instead of silently preferring a bad conversion. */
3218 strict_p = true;
3219 if (viable && !found_strictly_viable)
3221 /* Put any spliced near matches back onto the main list so
3222 that we see them if there is no strict match. */
3223 *any_viable_p = false;
3224 *last_viable = cands;
3225 cands = viable;
3226 viable = NULL;
3227 last_viable = &viable;
3231 if (strict_p ? c->viable == 1 : c->viable)
3233 *last_viable = c;
3234 *cand = c->next;
3235 c->next = NULL;
3236 last_viable = &c->next;
3237 *any_viable_p = true;
3238 if (c->viable == 1)
3239 found_strictly_viable = true;
3241 else
3242 cand = &c->next;
3245 return viable ? viable : cands;
3248 static bool
3249 any_strictly_viable (struct z_candidate *cands)
3251 for (; cands; cands = cands->next)
3252 if (cands->viable == 1)
3253 return true;
3254 return false;
3257 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3258 words, it is about to become the "this" pointer for a member
3259 function call. Take the address of the object. */
3261 static tree
3262 build_this (tree obj)
3264 /* In a template, we are only concerned about the type of the
3265 expression, so we can take a shortcut. */
3266 if (processing_template_decl)
3267 return build_address (obj);
3269 return cp_build_addr_expr (obj, tf_warning_or_error);
3272 /* Returns true iff functions are equivalent. Equivalent functions are
3273 not '==' only if one is a function-local extern function or if
3274 both are extern "C". */
3276 static inline int
3277 equal_functions (tree fn1, tree fn2)
3279 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3280 return 0;
3281 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3282 return fn1 == fn2;
3283 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3284 || DECL_EXTERN_C_FUNCTION_P (fn1))
3285 return decls_match (fn1, fn2);
3286 return fn1 == fn2;
3289 /* Print information about a candidate being rejected due to INFO. */
3291 static void
3292 print_conversion_rejection (location_t loc, struct conversion_info *info)
3294 tree from = info->from;
3295 if (!TYPE_P (from))
3296 from = lvalue_type (from);
3297 if (info->n_arg == -1)
3299 /* Conversion of implicit `this' argument failed. */
3300 if (!TYPE_P (info->from))
3301 /* A bad conversion for 'this' must be discarding cv-quals. */
3302 inform (loc, " passing %qT as %<this%> "
3303 "argument discards qualifiers",
3304 from);
3305 else
3306 inform (loc, " no known conversion for implicit "
3307 "%<this%> parameter from %qT to %qT",
3308 from, info->to_type);
3310 else if (!TYPE_P (info->from))
3312 if (info->n_arg >= 0)
3313 inform (loc, " conversion of argument %d would be ill-formed:",
3314 info->n_arg + 1);
3315 perform_implicit_conversion (info->to_type, info->from,
3316 tf_warning_or_error);
3318 else if (info->n_arg == -2)
3319 /* Conversion of conversion function return value failed. */
3320 inform (loc, " no known conversion from %qT to %qT",
3321 from, info->to_type);
3322 else
3323 inform (loc, " no known conversion for argument %d from %qT to %qT",
3324 info->n_arg + 1, from, info->to_type);
3327 /* Print information about a candidate with WANT parameters and we found
3328 HAVE. */
3330 static void
3331 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3333 inform_n (loc, want,
3334 " candidate expects %d argument, %d provided",
3335 " candidate expects %d arguments, %d provided",
3336 want, have);
3339 /* Print information about one overload candidate CANDIDATE. MSGSTR
3340 is the text to print before the candidate itself.
3342 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3343 to have been run through gettext by the caller. This wart makes
3344 life simpler in print_z_candidates and for the translators. */
3346 static void
3347 print_z_candidate (location_t loc, const char *msgstr,
3348 struct z_candidate *candidate)
3350 const char *msg = (msgstr == NULL
3351 ? ""
3352 : ACONCAT ((msgstr, " ", NULL)));
3353 location_t cloc = location_of (candidate->fn);
3355 if (identifier_p (candidate->fn))
3357 cloc = loc;
3358 if (candidate->num_convs == 3)
3359 inform (cloc, "%s%D(%T, %T, %T) <built-in>", msg, candidate->fn,
3360 candidate->convs[0]->type,
3361 candidate->convs[1]->type,
3362 candidate->convs[2]->type);
3363 else if (candidate->num_convs == 2)
3364 inform (cloc, "%s%D(%T, %T) <built-in>", msg, candidate->fn,
3365 candidate->convs[0]->type,
3366 candidate->convs[1]->type);
3367 else
3368 inform (cloc, "%s%D(%T) <built-in>", msg, candidate->fn,
3369 candidate->convs[0]->type);
3371 else if (TYPE_P (candidate->fn))
3372 inform (cloc, "%s%T <conversion>", msg, candidate->fn);
3373 else if (candidate->viable == -1)
3374 inform (cloc, "%s%#D <near match>", msg, candidate->fn);
3375 else if (DECL_DELETED_FN (candidate->fn))
3376 inform (cloc, "%s%#D <deleted>", msg, candidate->fn);
3377 else
3378 inform (cloc, "%s%#D", msg, candidate->fn);
3379 /* Give the user some information about why this candidate failed. */
3380 if (candidate->reason != NULL)
3382 struct rejection_reason *r = candidate->reason;
3384 switch (r->code)
3386 case rr_arity:
3387 print_arity_information (cloc, r->u.arity.actual,
3388 r->u.arity.expected);
3389 break;
3390 case rr_arg_conversion:
3391 print_conversion_rejection (cloc, &r->u.conversion);
3392 break;
3393 case rr_bad_arg_conversion:
3394 print_conversion_rejection (cloc, &r->u.bad_conversion);
3395 break;
3396 case rr_explicit_conversion:
3397 inform (cloc, " return type %qT of explicit conversion function "
3398 "cannot be converted to %qT with a qualification "
3399 "conversion", r->u.conversion.from,
3400 r->u.conversion.to_type);
3401 break;
3402 case rr_template_conversion:
3403 inform (cloc, " conversion from return type %qT of template "
3404 "conversion function specialization to %qT is not an "
3405 "exact match", r->u.conversion.from,
3406 r->u.conversion.to_type);
3407 break;
3408 case rr_template_unification:
3409 /* We use template_unification_error_rejection if unification caused
3410 actual non-SFINAE errors, in which case we don't need to repeat
3411 them here. */
3412 if (r->u.template_unification.tmpl == NULL_TREE)
3414 inform (cloc, " substitution of deduced template arguments "
3415 "resulted in errors seen above");
3416 break;
3418 /* Re-run template unification with diagnostics. */
3419 inform (cloc, " template argument deduction/substitution failed:");
3420 fn_type_unification (r->u.template_unification.tmpl,
3421 r->u.template_unification.explicit_targs,
3422 (make_tree_vec
3423 (r->u.template_unification.num_targs)),
3424 r->u.template_unification.args,
3425 r->u.template_unification.nargs,
3426 r->u.template_unification.return_type,
3427 r->u.template_unification.strict,
3428 r->u.template_unification.flags,
3429 true, false);
3430 break;
3431 case rr_invalid_copy:
3432 inform (cloc,
3433 " a constructor taking a single argument of its own "
3434 "class type is invalid");
3435 break;
3436 case rr_constraint_failure:
3438 tree tmpl = r->u.template_instantiation.tmpl;
3439 tree args = r->u.template_instantiation.targs;
3440 diagnose_constraints (cloc, tmpl, args);
3442 break;
3443 case rr_none:
3444 default:
3445 /* This candidate didn't have any issues or we failed to
3446 handle a particular code. Either way... */
3447 gcc_unreachable ();
3452 static void
3453 print_z_candidates (location_t loc, struct z_candidate *candidates)
3455 struct z_candidate *cand1;
3456 struct z_candidate **cand2;
3458 if (!candidates)
3459 return;
3461 /* Remove non-viable deleted candidates. */
3462 cand1 = candidates;
3463 for (cand2 = &cand1; *cand2; )
3465 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3466 && !(*cand2)->viable
3467 && DECL_DELETED_FN ((*cand2)->fn))
3468 *cand2 = (*cand2)->next;
3469 else
3470 cand2 = &(*cand2)->next;
3472 /* ...if there are any non-deleted ones. */
3473 if (cand1)
3474 candidates = cand1;
3476 /* There may be duplicates in the set of candidates. We put off
3477 checking this condition as long as possible, since we have no way
3478 to eliminate duplicates from a set of functions in less than n^2
3479 time. Now we are about to emit an error message, so it is more
3480 permissible to go slowly. */
3481 for (cand1 = candidates; cand1; cand1 = cand1->next)
3483 tree fn = cand1->fn;
3484 /* Skip builtin candidates and conversion functions. */
3485 if (!DECL_P (fn))
3486 continue;
3487 cand2 = &cand1->next;
3488 while (*cand2)
3490 if (DECL_P ((*cand2)->fn)
3491 && equal_functions (fn, (*cand2)->fn))
3492 *cand2 = (*cand2)->next;
3493 else
3494 cand2 = &(*cand2)->next;
3498 for (; candidates; candidates = candidates->next)
3499 print_z_candidate (loc, "candidate:", candidates);
3502 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3503 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3504 the result of the conversion function to convert it to the final
3505 desired type. Merge the two sequences into a single sequence,
3506 and return the merged sequence. */
3508 static conversion *
3509 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3511 conversion **t;
3512 bool bad = user_seq->bad_p;
3514 gcc_assert (user_seq->kind == ck_user);
3516 /* Find the end of the second conversion sequence. */
3517 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3519 /* The entire sequence is a user-conversion sequence. */
3520 (*t)->user_conv_p = true;
3521 if (bad)
3522 (*t)->bad_p = true;
3525 /* Replace the identity conversion with the user conversion
3526 sequence. */
3527 *t = user_seq;
3529 return std_seq;
3532 /* Handle overload resolution for initializing an object of class type from
3533 an initializer list. First we look for a suitable constructor that
3534 takes a std::initializer_list; if we don't find one, we then look for a
3535 non-list constructor.
3537 Parameters are as for add_candidates, except that the arguments are in
3538 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3539 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3541 static void
3542 add_list_candidates (tree fns, tree first_arg,
3543 tree init_list, tree totype,
3544 tree explicit_targs, bool template_only,
3545 tree conversion_path, tree access_path,
3546 int flags,
3547 struct z_candidate **candidates,
3548 tsubst_flags_t complain)
3550 vec<tree, va_gc> *args;
3552 gcc_assert (*candidates == NULL);
3554 /* We're looking for a ctor for list-initialization. */
3555 flags |= LOOKUP_LIST_INIT_CTOR;
3556 /* And we don't allow narrowing conversions. We also use this flag to
3557 avoid the copy constructor call for copy-list-initialization. */
3558 flags |= LOOKUP_NO_NARROWING;
3560 /* Always use the default constructor if the list is empty (DR 990). */
3561 if (CONSTRUCTOR_NELTS (init_list) == 0
3562 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3564 /* If the class has a list ctor, try passing the list as a single
3565 argument first, but only consider list ctors. */
3566 else if (TYPE_HAS_LIST_CTOR (totype))
3568 flags |= LOOKUP_LIST_ONLY;
3569 args = make_tree_vector_single (init_list);
3570 add_candidates (fns, first_arg, args, NULL_TREE,
3571 explicit_targs, template_only, conversion_path,
3572 access_path, flags, candidates, complain);
3573 if (any_strictly_viable (*candidates))
3574 return;
3577 args = ctor_to_vec (init_list);
3579 /* We aren't looking for list-ctors anymore. */
3580 flags &= ~LOOKUP_LIST_ONLY;
3581 /* We allow more user-defined conversions within an init-list. */
3582 flags &= ~LOOKUP_NO_CONVERSION;
3584 add_candidates (fns, first_arg, args, NULL_TREE,
3585 explicit_targs, template_only, conversion_path,
3586 access_path, flags, candidates, complain);
3589 /* Returns the best overload candidate to perform the requested
3590 conversion. This function is used for three the overloading situations
3591 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3592 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3593 per [dcl.init.ref], so we ignore temporary bindings. */
3595 static struct z_candidate *
3596 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3597 tsubst_flags_t complain)
3599 struct z_candidate *candidates, *cand;
3600 tree fromtype;
3601 tree ctors = NULL_TREE;
3602 tree conv_fns = NULL_TREE;
3603 conversion *conv = NULL;
3604 tree first_arg = NULL_TREE;
3605 vec<tree, va_gc> *args = NULL;
3606 bool any_viable_p;
3607 int convflags;
3609 if (!expr)
3610 return NULL;
3612 fromtype = TREE_TYPE (expr);
3614 /* We represent conversion within a hierarchy using RVALUE_CONV and
3615 BASE_CONV, as specified by [over.best.ics]; these become plain
3616 constructor calls, as specified in [dcl.init]. */
3617 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3618 || !DERIVED_FROM_P (totype, fromtype));
3620 if (MAYBE_CLASS_TYPE_P (totype))
3621 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3622 creating a garbage BASELINK; constructors can't be inherited. */
3623 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3625 if (MAYBE_CLASS_TYPE_P (fromtype))
3627 tree to_nonref = non_reference (totype);
3628 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3629 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3630 && DERIVED_FROM_P (to_nonref, fromtype)))
3632 /* [class.conv.fct] A conversion function is never used to
3633 convert a (possibly cv-qualified) object to the (possibly
3634 cv-qualified) same object type (or a reference to it), to a
3635 (possibly cv-qualified) base class of that type (or a
3636 reference to it)... */
3638 else
3639 conv_fns = lookup_conversions (fromtype);
3642 candidates = 0;
3643 flags |= LOOKUP_NO_CONVERSION;
3644 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3645 flags |= LOOKUP_NO_NARROWING;
3647 /* It's OK to bind a temporary for converting constructor arguments, but
3648 not in converting the return value of a conversion operator. */
3649 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3650 | (flags & LOOKUP_NO_NARROWING));
3651 flags &= ~LOOKUP_NO_TEMP_BIND;
3653 if (ctors)
3655 int ctorflags = flags;
3657 first_arg = build_dummy_object (totype);
3659 /* We should never try to call the abstract or base constructor
3660 from here. */
3661 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
3662 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
3664 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3666 /* List-initialization. */
3667 add_list_candidates (ctors, first_arg, expr, totype, NULL_TREE,
3668 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3669 ctorflags, &candidates, complain);
3671 else
3673 args = make_tree_vector_single (expr);
3674 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3675 TYPE_BINFO (totype), TYPE_BINFO (totype),
3676 ctorflags, &candidates, complain);
3679 for (cand = candidates; cand; cand = cand->next)
3681 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3683 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3684 set, then this is copy-initialization. In that case, "The
3685 result of the call is then used to direct-initialize the
3686 object that is the destination of the copy-initialization."
3687 [dcl.init]
3689 We represent this in the conversion sequence with an
3690 rvalue conversion, which means a constructor call. */
3691 if (TREE_CODE (totype) != REFERENCE_TYPE
3692 && !(convflags & LOOKUP_NO_TEMP_BIND))
3693 cand->second_conv
3694 = build_conv (ck_rvalue, totype, cand->second_conv);
3698 if (conv_fns)
3699 first_arg = expr;
3701 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3703 tree conversion_path = TREE_PURPOSE (conv_fns);
3704 struct z_candidate *old_candidates;
3706 /* If we are called to convert to a reference type, we are trying to
3707 find a direct binding, so don't even consider temporaries. If
3708 we don't find a direct binding, the caller will try again to
3709 look for a temporary binding. */
3710 if (TREE_CODE (totype) == REFERENCE_TYPE)
3711 convflags |= LOOKUP_NO_TEMP_BIND;
3713 old_candidates = candidates;
3714 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3715 NULL_TREE, false,
3716 conversion_path, TYPE_BINFO (fromtype),
3717 flags, &candidates, complain);
3719 for (cand = candidates; cand != old_candidates; cand = cand->next)
3721 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3722 conversion *ics
3723 = implicit_conversion (totype,
3724 rettype,
3726 /*c_cast_p=*/false, convflags,
3727 complain);
3729 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3730 copy-initialization. In that case, "The result of the
3731 call is then used to direct-initialize the object that is
3732 the destination of the copy-initialization." [dcl.init]
3734 We represent this in the conversion sequence with an
3735 rvalue conversion, which means a constructor call. But
3736 don't add a second rvalue conversion if there's already
3737 one there. Which there really shouldn't be, but it's
3738 harmless since we'd add it here anyway. */
3739 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3740 && !(convflags & LOOKUP_NO_TEMP_BIND))
3741 ics = build_conv (ck_rvalue, totype, ics);
3743 cand->second_conv = ics;
3745 if (!ics)
3747 cand->viable = 0;
3748 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3749 rettype, totype);
3751 else if (DECL_NONCONVERTING_P (cand->fn)
3752 && ics->rank > cr_exact)
3754 /* 13.3.1.5: For direct-initialization, those explicit
3755 conversion functions that are not hidden within S and
3756 yield type T or a type that can be converted to type T
3757 with a qualification conversion (4.4) are also candidate
3758 functions. */
3759 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3760 I've raised this issue with the committee. --jason 9/2011 */
3761 cand->viable = -1;
3762 cand->reason = explicit_conversion_rejection (rettype, totype);
3764 else if (cand->viable == 1 && ics->bad_p)
3766 cand->viable = -1;
3767 cand->reason
3768 = bad_arg_conversion_rejection (NULL_TREE, -2,
3769 rettype, totype);
3771 else if (primary_template_instantiation_p (cand->fn)
3772 && ics->rank > cr_exact)
3774 /* 13.3.3.1.2: If the user-defined conversion is specified by
3775 a specialization of a conversion function template, the
3776 second standard conversion sequence shall have exact match
3777 rank. */
3778 cand->viable = -1;
3779 cand->reason = template_conversion_rejection (rettype, totype);
3784 candidates = splice_viable (candidates, false, &any_viable_p);
3785 if (!any_viable_p)
3787 if (args)
3788 release_tree_vector (args);
3789 return NULL;
3792 cand = tourney (candidates, complain);
3793 if (cand == 0)
3795 if (complain & tf_error)
3797 error ("conversion from %qT to %qT is ambiguous",
3798 fromtype, totype);
3799 print_z_candidates (location_of (expr), candidates);
3802 cand = candidates; /* any one will do */
3803 cand->second_conv = build_ambiguous_conv (totype, expr);
3804 cand->second_conv->user_conv_p = true;
3805 if (!any_strictly_viable (candidates))
3806 cand->second_conv->bad_p = true;
3807 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3808 ambiguous conversion is no worse than another user-defined
3809 conversion. */
3811 return cand;
3814 tree convtype;
3815 if (!DECL_CONSTRUCTOR_P (cand->fn))
3816 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3817 else if (cand->second_conv->kind == ck_rvalue)
3818 /* DR 5: [in the first step of copy-initialization]...if the function
3819 is a constructor, the call initializes a temporary of the
3820 cv-unqualified version of the destination type. */
3821 convtype = cv_unqualified (totype);
3822 else
3823 convtype = totype;
3824 /* Build the user conversion sequence. */
3825 conv = build_conv
3826 (ck_user,
3827 convtype,
3828 build_identity_conv (TREE_TYPE (expr), expr));
3829 conv->cand = cand;
3830 if (cand->viable == -1)
3831 conv->bad_p = true;
3833 /* Remember that this was a list-initialization. */
3834 if (flags & LOOKUP_NO_NARROWING)
3835 conv->check_narrowing = true;
3837 /* Combine it with the second conversion sequence. */
3838 cand->second_conv = merge_conversion_sequences (conv,
3839 cand->second_conv);
3841 return cand;
3844 /* Wrapper for above. */
3846 tree
3847 build_user_type_conversion (tree totype, tree expr, int flags,
3848 tsubst_flags_t complain)
3850 struct z_candidate *cand;
3851 tree ret;
3853 bool subtime = timevar_cond_start (TV_OVERLOAD);
3854 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3856 if (cand)
3858 if (cand->second_conv->kind == ck_ambig)
3859 ret = error_mark_node;
3860 else
3862 expr = convert_like (cand->second_conv, expr, complain);
3863 ret = convert_from_reference (expr);
3866 else
3867 ret = NULL_TREE;
3869 timevar_cond_stop (TV_OVERLOAD, subtime);
3870 return ret;
3873 /* Subroutine of convert_nontype_argument.
3875 EXPR is an argument for a template non-type parameter of integral or
3876 enumeration type. Do any necessary conversions (that are permitted for
3877 non-type arguments) to convert it to the parameter type.
3879 If conversion is successful, returns the converted expression;
3880 otherwise, returns error_mark_node. */
3882 tree
3883 build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain)
3885 conversion *conv;
3886 void *p;
3887 tree t;
3888 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
3890 if (error_operand_p (expr))
3891 return error_mark_node;
3893 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
3895 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3896 p = conversion_obstack_alloc (0);
3898 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
3899 /*c_cast_p=*/false,
3900 LOOKUP_IMPLICIT, complain);
3902 /* for a non-type template-parameter of integral or
3903 enumeration type, integral promotions (4.5) and integral
3904 conversions (4.7) are applied. */
3905 /* It should be sufficient to check the outermost conversion step, since
3906 there are no qualification conversions to integer type. */
3907 if (conv)
3908 switch (conv->kind)
3910 /* A conversion function is OK. If it isn't constexpr, we'll
3911 complain later that the argument isn't constant. */
3912 case ck_user:
3913 /* The lvalue-to-rvalue conversion is OK. */
3914 case ck_rvalue:
3915 case ck_identity:
3916 break;
3918 case ck_std:
3919 t = next_conversion (conv)->type;
3920 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t))
3921 break;
3923 if (complain & tf_error)
3924 error_at (loc, "conversion from %qT to %qT not considered for "
3925 "non-type template argument", t, type);
3926 /* and fall through. */
3928 default:
3929 conv = NULL;
3930 break;
3933 if (conv)
3934 expr = convert_like (conv, expr, complain);
3935 else
3936 expr = error_mark_node;
3938 /* Free all the conversions we allocated. */
3939 obstack_free (&conversion_obstack, p);
3941 return expr;
3944 /* Do any initial processing on the arguments to a function call. */
3946 static vec<tree, va_gc> *
3947 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
3949 unsigned int ix;
3950 tree arg;
3952 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
3954 if (error_operand_p (arg))
3955 return NULL;
3956 else if (VOID_TYPE_P (TREE_TYPE (arg)))
3958 if (complain & tf_error)
3959 error ("invalid use of void expression");
3960 return NULL;
3962 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
3963 return NULL;
3965 return args;
3968 /* Perform overload resolution on FN, which is called with the ARGS.
3970 Return the candidate function selected by overload resolution, or
3971 NULL if the event that overload resolution failed. In the case
3972 that overload resolution fails, *CANDIDATES will be the set of
3973 candidates considered, and ANY_VIABLE_P will be set to true or
3974 false to indicate whether or not any of the candidates were
3975 viable.
3977 The ARGS should already have gone through RESOLVE_ARGS before this
3978 function is called. */
3980 static struct z_candidate *
3981 perform_overload_resolution (tree fn,
3982 const vec<tree, va_gc> *args,
3983 struct z_candidate **candidates,
3984 bool *any_viable_p, tsubst_flags_t complain)
3986 struct z_candidate *cand;
3987 tree explicit_targs;
3988 int template_only;
3990 bool subtime = timevar_cond_start (TV_OVERLOAD);
3992 explicit_targs = NULL_TREE;
3993 template_only = 0;
3995 *candidates = NULL;
3996 *any_viable_p = true;
3998 /* Check FN. */
3999 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4000 || TREE_CODE (fn) == TEMPLATE_DECL
4001 || TREE_CODE (fn) == OVERLOAD
4002 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4004 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4006 explicit_targs = TREE_OPERAND (fn, 1);
4007 fn = TREE_OPERAND (fn, 0);
4008 template_only = 1;
4011 /* Add the various candidate functions. */
4012 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4013 explicit_targs, template_only,
4014 /*conversion_path=*/NULL_TREE,
4015 /*access_path=*/NULL_TREE,
4016 LOOKUP_NORMAL,
4017 candidates, complain);
4019 *candidates = splice_viable (*candidates, false, any_viable_p);
4020 if (*any_viable_p)
4021 cand = tourney (*candidates, complain);
4022 else
4023 cand = NULL;
4025 timevar_cond_stop (TV_OVERLOAD, subtime);
4026 return cand;
4029 /* Print an error message about being unable to build a call to FN with
4030 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4031 be located; CANDIDATES is a possibly empty list of such
4032 functions. */
4034 static void
4035 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4036 struct z_candidate *candidates)
4038 tree name = DECL_NAME (OVL_CURRENT (fn));
4039 location_t loc = location_of (name);
4041 if (!any_strictly_viable (candidates))
4042 error_at (loc, "no matching function for call to %<%D(%A)%>",
4043 name, build_tree_list_vec (args));
4044 else
4045 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4046 name, build_tree_list_vec (args));
4047 if (candidates)
4048 print_z_candidates (loc, candidates);
4051 /* Return an expression for a call to FN (a namespace-scope function,
4052 or a static member function) with the ARGS. This may change
4053 ARGS. */
4055 tree
4056 build_new_function_call (tree fn, vec<tree, va_gc> **args, bool koenig_p,
4057 tsubst_flags_t complain)
4059 struct z_candidate *candidates, *cand;
4060 bool any_viable_p;
4061 void *p;
4062 tree result;
4064 if (args != NULL && *args != NULL)
4066 *args = resolve_args (*args, complain);
4067 if (*args == NULL)
4068 return error_mark_node;
4071 if (flag_tm)
4072 tm_malloc_replacement (fn);
4074 /* If this function was found without using argument dependent
4075 lookup, then we want to ignore any undeclared friend
4076 functions. */
4077 if (!koenig_p)
4079 tree orig_fn = fn;
4081 fn = remove_hidden_names (fn);
4082 if (!fn)
4084 if (complain & tf_error)
4085 print_error_for_call_failure (orig_fn, *args, NULL);
4086 return error_mark_node;
4090 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4091 p = conversion_obstack_alloc (0);
4093 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4094 complain);
4096 if (!cand)
4098 if (complain & tf_error)
4100 // If there is a single (non-viable) function candidate,
4101 // let the error be diagnosed by cp_build_function_call_vec.
4102 if (!any_viable_p && candidates && ! candidates->next
4103 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4104 return cp_build_function_call_vec (candidates->fn, args, complain);
4106 // Otherwise, emit notes for non-viable candidates.
4107 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4108 fn = TREE_OPERAND (fn, 0);
4109 print_error_for_call_failure (fn, *args, candidates);
4111 result = error_mark_node;
4113 else
4115 int flags = LOOKUP_NORMAL;
4116 /* If fn is template_id_expr, the call has explicit template arguments
4117 (e.g. func<int>(5)), communicate this info to build_over_call
4118 through flags so that later we can use it to decide whether to warn
4119 about peculiar null pointer conversion. */
4120 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4122 /* If overload resolution selects a specialization of a
4123 function concept for non-dependent template arguments,
4124 the expression is true if the constraints are satisfied
4125 and false otherwise.
4127 NOTE: This is an extension of Concepts Lite TS that
4128 allows constraints to be used in expressions. */
4129 if (flag_concepts && !processing_template_decl)
4131 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4132 tree targs = DECL_TI_ARGS (cand->fn);
4133 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4134 if (DECL_DECLARED_CONCEPT_P (decl))
4135 return evaluate_function_concept (decl, targs);
4138 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4141 result = build_over_call (cand, flags, complain);
4144 /* Free all the conversions we allocated. */
4145 obstack_free (&conversion_obstack, p);
4147 return result;
4150 /* Build a call to a global operator new. FNNAME is the name of the
4151 operator (either "operator new" or "operator new[]") and ARGS are
4152 the arguments provided. This may change ARGS. *SIZE points to the
4153 total number of bytes required by the allocation, and is updated if
4154 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4155 be used. If this function determines that no cookie should be
4156 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4157 is not NULL_TREE, it is evaluated before calculating the final
4158 array size, and if it fails, the array size is replaced with
4159 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4160 is non-NULL, it will be set, upon return, to the allocation
4161 function called. */
4163 tree
4164 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4165 tree *size, tree *cookie_size, tree size_check,
4166 tree *fn, tsubst_flags_t complain)
4168 tree original_size = *size;
4169 tree fns;
4170 struct z_candidate *candidates;
4171 struct z_candidate *cand;
4172 bool any_viable_p;
4174 if (fn)
4175 *fn = NULL_TREE;
4176 /* Set to (size_t)-1 if the size check fails. */
4177 if (size_check != NULL_TREE)
4179 tree errval = TYPE_MAX_VALUE (sizetype);
4180 if (cxx_dialect >= cxx11 && flag_exceptions)
4181 errval = throw_bad_array_new_length ();
4182 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4183 original_size, errval);
4185 vec_safe_insert (*args, 0, *size);
4186 *args = resolve_args (*args, complain);
4187 if (*args == NULL)
4188 return error_mark_node;
4190 /* Based on:
4192 [expr.new]
4194 If this lookup fails to find the name, or if the allocated type
4195 is not a class type, the allocation function's name is looked
4196 up in the global scope.
4198 we disregard block-scope declarations of "operator new". */
4199 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
4201 /* Figure out what function is being called. */
4202 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4203 complain);
4205 /* If no suitable function could be found, issue an error message
4206 and give up. */
4207 if (!cand)
4209 if (complain & tf_error)
4210 print_error_for_call_failure (fns, *args, candidates);
4211 return error_mark_node;
4214 /* If a cookie is required, add some extra space. Whether
4215 or not a cookie is required cannot be determined until
4216 after we know which function was called. */
4217 if (*cookie_size)
4219 bool use_cookie = true;
4220 tree arg_types;
4222 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4223 /* Skip the size_t parameter. */
4224 arg_types = TREE_CHAIN (arg_types);
4225 /* Check the remaining parameters (if any). */
4226 if (arg_types
4227 && TREE_CHAIN (arg_types) == void_list_node
4228 && same_type_p (TREE_VALUE (arg_types),
4229 ptr_type_node))
4230 use_cookie = false;
4231 /* If we need a cookie, adjust the number of bytes allocated. */
4232 if (use_cookie)
4234 /* Update the total size. */
4235 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4236 if (size_check)
4238 /* Set to (size_t)-1 if the size check fails. */
4239 gcc_assert (size_check != NULL_TREE);
4240 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4241 *size, TYPE_MAX_VALUE (sizetype));
4243 /* Update the argument list to reflect the adjusted size. */
4244 (**args)[0] = *size;
4246 else
4247 *cookie_size = NULL_TREE;
4250 /* Tell our caller which function we decided to call. */
4251 if (fn)
4252 *fn = cand->fn;
4254 /* Build the CALL_EXPR. */
4255 return build_over_call (cand, LOOKUP_NORMAL, complain);
4258 /* Build a new call to operator(). This may change ARGS. */
4260 static tree
4261 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4263 struct z_candidate *candidates = 0, *cand;
4264 tree fns, convs, first_mem_arg = NULL_TREE;
4265 tree type = TREE_TYPE (obj);
4266 bool any_viable_p;
4267 tree result = NULL_TREE;
4268 void *p;
4270 if (error_operand_p (obj))
4271 return error_mark_node;
4273 obj = prep_operand (obj);
4275 if (TYPE_PTRMEMFUNC_P (type))
4277 if (complain & tf_error)
4278 /* It's no good looking for an overloaded operator() on a
4279 pointer-to-member-function. */
4280 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
4281 return error_mark_node;
4284 if (TYPE_BINFO (type))
4286 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
4287 if (fns == error_mark_node)
4288 return error_mark_node;
4290 else
4291 fns = NULL_TREE;
4293 if (args != NULL && *args != NULL)
4295 *args = resolve_args (*args, complain);
4296 if (*args == NULL)
4297 return error_mark_node;
4300 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4301 p = conversion_obstack_alloc (0);
4303 if (fns)
4305 first_mem_arg = obj;
4307 add_candidates (BASELINK_FUNCTIONS (fns),
4308 first_mem_arg, *args, NULL_TREE,
4309 NULL_TREE, false,
4310 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4311 LOOKUP_NORMAL, &candidates, complain);
4314 convs = lookup_conversions (type);
4316 for (; convs; convs = TREE_CHAIN (convs))
4318 tree fns = TREE_VALUE (convs);
4319 tree totype = TREE_TYPE (convs);
4321 if (TYPE_PTRFN_P (totype)
4322 || TYPE_REFFN_P (totype)
4323 || (TREE_CODE (totype) == REFERENCE_TYPE
4324 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4325 for (; fns; fns = OVL_NEXT (fns))
4327 tree fn = OVL_CURRENT (fns);
4329 if (DECL_NONCONVERTING_P (fn))
4330 continue;
4332 if (TREE_CODE (fn) == TEMPLATE_DECL)
4333 add_template_conv_candidate
4334 (&candidates, fn, obj, *args, totype,
4335 /*access_path=*/NULL_TREE,
4336 /*conversion_path=*/NULL_TREE, complain);
4337 else
4338 add_conv_candidate (&candidates, fn, obj,
4339 *args, /*conversion_path=*/NULL_TREE,
4340 /*access_path=*/NULL_TREE, complain);
4344 /* Be strict here because if we choose a bad conversion candidate, the
4345 errors we get won't mention the call context. */
4346 candidates = splice_viable (candidates, true, &any_viable_p);
4347 if (!any_viable_p)
4349 if (complain & tf_error)
4351 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4352 build_tree_list_vec (*args));
4353 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4355 result = error_mark_node;
4357 else
4359 cand = tourney (candidates, complain);
4360 if (cand == 0)
4362 if (complain & tf_error)
4364 error ("call of %<(%T) (%A)%> is ambiguous",
4365 TREE_TYPE (obj), build_tree_list_vec (*args));
4366 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4368 result = error_mark_node;
4370 /* Since cand->fn will be a type, not a function, for a conversion
4371 function, we must be careful not to unconditionally look at
4372 DECL_NAME here. */
4373 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4374 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4375 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4376 else
4378 obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1,
4379 complain);
4380 obj = convert_from_reference (obj);
4381 result = cp_build_function_call_vec (obj, args, complain);
4385 /* Free all the conversions we allocated. */
4386 obstack_free (&conversion_obstack, p);
4388 return result;
4391 /* Wrapper for above. */
4393 tree
4394 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4396 tree ret;
4397 bool subtime = timevar_cond_start (TV_OVERLOAD);
4398 ret = build_op_call_1 (obj, args, complain);
4399 timevar_cond_stop (TV_OVERLOAD, subtime);
4400 return ret;
4403 /* Called by op_error to prepare format strings suitable for the error
4404 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4405 and a suffix (controlled by NTYPES). */
4407 static const char *
4408 op_error_string (const char *errmsg, int ntypes, bool match)
4410 const char *msg;
4412 const char *msgp = concat (match ? G_("ambiguous overload for ")
4413 : G_("no match for "), errmsg, NULL);
4415 if (ntypes == 3)
4416 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4417 else if (ntypes == 2)
4418 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4419 else
4420 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4422 return msg;
4425 static void
4426 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4427 tree arg1, tree arg2, tree arg3, bool match)
4429 const char *opname;
4431 if (code == MODIFY_EXPR)
4432 opname = assignment_operator_name_info[code2].name;
4433 else
4434 opname = operator_name_info[code].name;
4436 switch (code)
4438 case COND_EXPR:
4439 if (flag_diagnostics_show_caret)
4440 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4441 3, match),
4442 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4443 else
4444 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4445 "in %<%E ? %E : %E%>"), 3, match),
4446 arg1, arg2, arg3,
4447 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4448 break;
4450 case POSTINCREMENT_EXPR:
4451 case POSTDECREMENT_EXPR:
4452 if (flag_diagnostics_show_caret)
4453 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4454 opname, TREE_TYPE (arg1));
4455 else
4456 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4457 1, match),
4458 opname, arg1, opname, TREE_TYPE (arg1));
4459 break;
4461 case ARRAY_REF:
4462 if (flag_diagnostics_show_caret)
4463 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4464 TREE_TYPE (arg1), TREE_TYPE (arg2));
4465 else
4466 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4467 2, match),
4468 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4469 break;
4471 case REALPART_EXPR:
4472 case IMAGPART_EXPR:
4473 if (flag_diagnostics_show_caret)
4474 error_at (loc, op_error_string (G_("%qs"), 1, match),
4475 opname, TREE_TYPE (arg1));
4476 else
4477 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4478 opname, opname, arg1, TREE_TYPE (arg1));
4479 break;
4481 default:
4482 if (arg2)
4483 if (flag_diagnostics_show_caret)
4484 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4485 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4486 else
4487 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4488 2, match),
4489 opname, arg1, opname, arg2,
4490 TREE_TYPE (arg1), TREE_TYPE (arg2));
4491 else
4492 if (flag_diagnostics_show_caret)
4493 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4494 opname, TREE_TYPE (arg1));
4495 else
4496 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4497 1, match),
4498 opname, opname, arg1, TREE_TYPE (arg1));
4499 break;
4503 /* Return the implicit conversion sequence that could be used to
4504 convert E1 to E2 in [expr.cond]. */
4506 static conversion *
4507 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4509 tree t1 = non_reference (TREE_TYPE (e1));
4510 tree t2 = non_reference (TREE_TYPE (e2));
4511 conversion *conv;
4512 bool good_base;
4514 /* [expr.cond]
4516 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4517 implicitly converted (clause _conv_) to the type "lvalue reference to
4518 T2", subject to the constraint that in the conversion the
4519 reference must bind directly (_dcl.init.ref_) to an lvalue.
4521 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4522 implicitly converted to the type "rvalue reference to T2", subject to
4523 the constraint that the reference must bind directly. */
4524 if (lvalue_or_rvalue_with_address_p (e2))
4526 tree rtype = cp_build_reference_type (t2, !real_lvalue_p (e2));
4527 conv = implicit_conversion (rtype,
4530 /*c_cast_p=*/false,
4531 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4532 |LOOKUP_ONLYCONVERTING,
4533 complain);
4534 if (conv && !conv->bad_p)
4535 return conv;
4538 /* If E2 is a prvalue or if neither of the conversions above can be done
4539 and at least one of the operands has (possibly cv-qualified) class
4540 type: */
4541 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4542 return NULL;
4544 /* [expr.cond]
4546 If E1 and E2 have class type, and the underlying class types are
4547 the same or one is a base class of the other: E1 can be converted
4548 to match E2 if the class of T2 is the same type as, or a base
4549 class of, the class of T1, and the cv-qualification of T2 is the
4550 same cv-qualification as, or a greater cv-qualification than, the
4551 cv-qualification of T1. If the conversion is applied, E1 is
4552 changed to an rvalue of type T2 that still refers to the original
4553 source class object (or the appropriate subobject thereof). */
4554 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4555 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4557 if (good_base && at_least_as_qualified_p (t2, t1))
4559 conv = build_identity_conv (t1, e1);
4560 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4561 TYPE_MAIN_VARIANT (t2)))
4562 conv = build_conv (ck_base, t2, conv);
4563 else
4564 conv = build_conv (ck_rvalue, t2, conv);
4565 return conv;
4567 else
4568 return NULL;
4570 else
4571 /* [expr.cond]
4573 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4574 converted to the type that expression E2 would have if E2 were
4575 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4576 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4577 LOOKUP_IMPLICIT, complain);
4580 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4581 arguments to the conditional expression. */
4583 static tree
4584 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4585 tsubst_flags_t complain)
4587 tree arg2_type;
4588 tree arg3_type;
4589 tree result = NULL_TREE;
4590 tree result_type = NULL_TREE;
4591 bool lvalue_p = true;
4592 struct z_candidate *candidates = 0;
4593 struct z_candidate *cand;
4594 void *p;
4595 tree orig_arg2, orig_arg3;
4597 /* As a G++ extension, the second argument to the conditional can be
4598 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4599 c'.) If the second operand is omitted, make sure it is
4600 calculated only once. */
4601 if (!arg2)
4603 if (complain & tf_error)
4604 pedwarn (loc, OPT_Wpedantic,
4605 "ISO C++ forbids omitting the middle term of a ?: expression");
4607 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4608 if (real_lvalue_p (arg1))
4609 arg2 = arg1 = stabilize_reference (arg1);
4610 else
4611 arg2 = arg1 = save_expr (arg1);
4614 /* If something has already gone wrong, just pass that fact up the
4615 tree. */
4616 if (error_operand_p (arg1)
4617 || error_operand_p (arg2)
4618 || error_operand_p (arg3))
4619 return error_mark_node;
4621 orig_arg2 = arg2;
4622 orig_arg3 = arg3;
4624 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4626 /* If arg1 is another cond_expr choosing between -1 and 0,
4627 then we can use its comparison. It may help to avoid
4628 additional comparison, produce more accurate diagnostics
4629 and enables folding. */
4630 if (TREE_CODE (arg1) == VEC_COND_EXPR
4631 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4632 && integer_zerop (TREE_OPERAND (arg1, 2)))
4633 arg1 = TREE_OPERAND (arg1, 0);
4635 arg1 = force_rvalue (arg1, complain);
4636 arg2 = force_rvalue (arg2, complain);
4637 arg3 = force_rvalue (arg3, complain);
4639 /* force_rvalue can return error_mark on valid arguments. */
4640 if (error_operand_p (arg1)
4641 || error_operand_p (arg2)
4642 || error_operand_p (arg3))
4643 return error_mark_node;
4645 tree arg1_type = TREE_TYPE (arg1);
4646 arg2_type = TREE_TYPE (arg2);
4647 arg3_type = TREE_TYPE (arg3);
4649 if (!VECTOR_TYPE_P (arg2_type)
4650 && !VECTOR_TYPE_P (arg3_type))
4652 /* Rely on the error messages of the scalar version. */
4653 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4654 orig_arg2, orig_arg3, complain);
4655 if (scal == error_mark_node)
4656 return error_mark_node;
4657 tree stype = TREE_TYPE (scal);
4658 tree ctype = TREE_TYPE (arg1_type);
4659 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4660 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4662 if (complain & tf_error)
4663 error_at (loc, "inferred scalar type %qT is not an integer or "
4664 "floating point type of the same size as %qT", stype,
4665 COMPARISON_CLASS_P (arg1)
4666 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4667 : ctype);
4668 return error_mark_node;
4671 tree vtype = build_opaque_vector_type (stype,
4672 TYPE_VECTOR_SUBPARTS (arg1_type));
4673 /* We could pass complain & tf_warning to unsafe_conversion_p,
4674 but the warnings (like Wsign-conversion) have already been
4675 given by the scalar build_conditional_expr_1. We still check
4676 unsafe_conversion_p to forbid truncating long long -> float. */
4677 if (unsafe_conversion_p (loc, stype, arg2, false))
4679 if (complain & tf_error)
4680 error_at (loc, "conversion of scalar %qT to vector %qT "
4681 "involves truncation", arg2_type, vtype);
4682 return error_mark_node;
4684 if (unsafe_conversion_p (loc, stype, arg3, false))
4686 if (complain & tf_error)
4687 error_at (loc, "conversion of scalar %qT to vector %qT "
4688 "involves truncation", arg3_type, vtype);
4689 return error_mark_node;
4692 arg2 = cp_convert (stype, arg2, complain);
4693 arg2 = save_expr (arg2);
4694 arg2 = build_vector_from_val (vtype, arg2);
4695 arg2_type = vtype;
4696 arg3 = cp_convert (stype, arg3, complain);
4697 arg3 = save_expr (arg3);
4698 arg3 = build_vector_from_val (vtype, arg3);
4699 arg3_type = vtype;
4702 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4704 enum stv_conv convert_flag =
4705 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4706 complain & tf_error);
4708 switch (convert_flag)
4710 case stv_error:
4711 return error_mark_node;
4712 case stv_firstarg:
4714 arg2 = save_expr (arg2);
4715 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4716 arg2 = build_vector_from_val (arg3_type, arg2);
4717 arg2_type = TREE_TYPE (arg2);
4718 break;
4720 case stv_secondarg:
4722 arg3 = save_expr (arg3);
4723 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4724 arg3 = build_vector_from_val (arg2_type, arg3);
4725 arg3_type = TREE_TYPE (arg3);
4726 break;
4728 default:
4729 break;
4733 if (!same_type_p (arg2_type, arg3_type)
4734 || TYPE_VECTOR_SUBPARTS (arg1_type)
4735 != TYPE_VECTOR_SUBPARTS (arg2_type)
4736 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4738 if (complain & tf_error)
4739 error_at (loc,
4740 "incompatible vector types in conditional expression: "
4741 "%qT, %qT and %qT", TREE_TYPE (arg1),
4742 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4743 return error_mark_node;
4746 if (!COMPARISON_CLASS_P (arg1))
4748 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4749 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4751 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4754 /* [expr.cond]
4756 The first expression is implicitly converted to bool (clause
4757 _conv_). */
4758 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4759 LOOKUP_NORMAL);
4760 if (error_operand_p (arg1))
4761 return error_mark_node;
4763 /* [expr.cond]
4765 If either the second or the third operand has type (possibly
4766 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4767 array-to-pointer (_conv.array_), and function-to-pointer
4768 (_conv.func_) standard conversions are performed on the second
4769 and third operands. */
4770 arg2_type = unlowered_expr_type (arg2);
4771 arg3_type = unlowered_expr_type (arg3);
4772 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4774 /* Do the conversions. We don't these for `void' type arguments
4775 since it can't have any effect and since decay_conversion
4776 does not handle that case gracefully. */
4777 if (!VOID_TYPE_P (arg2_type))
4778 arg2 = decay_conversion (arg2, complain);
4779 if (!VOID_TYPE_P (arg3_type))
4780 arg3 = decay_conversion (arg3, complain);
4781 arg2_type = TREE_TYPE (arg2);
4782 arg3_type = TREE_TYPE (arg3);
4784 /* [expr.cond]
4786 One of the following shall hold:
4788 --The second or the third operand (but not both) is a
4789 throw-expression (_except.throw_); the result is of the
4790 type of the other and is an rvalue.
4792 --Both the second and the third operands have type void; the
4793 result is of type void and is an rvalue.
4795 We must avoid calling force_rvalue for expressions of type
4796 "void" because it will complain that their value is being
4797 used. */
4798 if (TREE_CODE (arg2) == THROW_EXPR
4799 && TREE_CODE (arg3) != THROW_EXPR)
4801 if (!VOID_TYPE_P (arg3_type))
4803 arg3 = force_rvalue (arg3, complain);
4804 if (arg3 == error_mark_node)
4805 return error_mark_node;
4807 arg3_type = TREE_TYPE (arg3);
4808 result_type = arg3_type;
4810 else if (TREE_CODE (arg2) != THROW_EXPR
4811 && TREE_CODE (arg3) == THROW_EXPR)
4813 if (!VOID_TYPE_P (arg2_type))
4815 arg2 = force_rvalue (arg2, complain);
4816 if (arg2 == error_mark_node)
4817 return error_mark_node;
4819 arg2_type = TREE_TYPE (arg2);
4820 result_type = arg2_type;
4822 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
4823 result_type = void_type_node;
4824 else
4826 if (complain & tf_error)
4828 if (VOID_TYPE_P (arg2_type))
4829 error_at (EXPR_LOC_OR_LOC (arg3, loc),
4830 "second operand to the conditional operator "
4831 "is of type %<void%>, but the third operand is "
4832 "neither a throw-expression nor of type %<void%>");
4833 else
4834 error_at (EXPR_LOC_OR_LOC (arg2, loc),
4835 "third operand to the conditional operator "
4836 "is of type %<void%>, but the second operand is "
4837 "neither a throw-expression nor of type %<void%>");
4839 return error_mark_node;
4842 lvalue_p = false;
4843 goto valid_operands;
4845 /* [expr.cond]
4847 Otherwise, if the second and third operand have different types,
4848 and either has (possibly cv-qualified) class type, or if both are
4849 glvalues of the same value category and the same type except for
4850 cv-qualification, an attempt is made to convert each of those operands
4851 to the type of the other. */
4852 else if (!same_type_p (arg2_type, arg3_type)
4853 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
4854 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
4855 arg3_type)
4856 && lvalue_or_rvalue_with_address_p (arg2)
4857 && lvalue_or_rvalue_with_address_p (arg3)
4858 && real_lvalue_p (arg2) == real_lvalue_p (arg3))))
4860 conversion *conv2;
4861 conversion *conv3;
4862 bool converted = false;
4864 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4865 p = conversion_obstack_alloc (0);
4867 conv2 = conditional_conversion (arg2, arg3, complain);
4868 conv3 = conditional_conversion (arg3, arg2, complain);
4870 /* [expr.cond]
4872 If both can be converted, or one can be converted but the
4873 conversion is ambiguous, the program is ill-formed. If
4874 neither can be converted, the operands are left unchanged and
4875 further checking is performed as described below. If exactly
4876 one conversion is possible, that conversion is applied to the
4877 chosen operand and the converted operand is used in place of
4878 the original operand for the remainder of this section. */
4879 if ((conv2 && !conv2->bad_p
4880 && conv3 && !conv3->bad_p)
4881 || (conv2 && conv2->kind == ck_ambig)
4882 || (conv3 && conv3->kind == ck_ambig))
4884 if (complain & tf_error)
4886 error_at (loc, "operands to ?: have different types %qT and %qT",
4887 arg2_type, arg3_type);
4888 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
4889 inform (loc, " and each type can be converted to the other");
4890 else if (conv2 && conv2->kind == ck_ambig)
4891 convert_like (conv2, arg2, complain);
4892 else
4893 convert_like (conv3, arg3, complain);
4895 result = error_mark_node;
4897 else if (conv2 && !conv2->bad_p)
4899 arg2 = convert_like (conv2, arg2, complain);
4900 arg2 = convert_from_reference (arg2);
4901 arg2_type = TREE_TYPE (arg2);
4902 /* Even if CONV2 is a valid conversion, the result of the
4903 conversion may be invalid. For example, if ARG3 has type
4904 "volatile X", and X does not have a copy constructor
4905 accepting a "volatile X&", then even if ARG2 can be
4906 converted to X, the conversion will fail. */
4907 if (error_operand_p (arg2))
4908 result = error_mark_node;
4909 converted = true;
4911 else if (conv3 && !conv3->bad_p)
4913 arg3 = convert_like (conv3, arg3, complain);
4914 arg3 = convert_from_reference (arg3);
4915 arg3_type = TREE_TYPE (arg3);
4916 if (error_operand_p (arg3))
4917 result = error_mark_node;
4918 converted = true;
4921 /* Free all the conversions we allocated. */
4922 obstack_free (&conversion_obstack, p);
4924 if (result)
4925 return result;
4927 /* If, after the conversion, both operands have class type,
4928 treat the cv-qualification of both operands as if it were the
4929 union of the cv-qualification of the operands.
4931 The standard is not clear about what to do in this
4932 circumstance. For example, if the first operand has type
4933 "const X" and the second operand has a user-defined
4934 conversion to "volatile X", what is the type of the second
4935 operand after this step? Making it be "const X" (matching
4936 the first operand) seems wrong, as that discards the
4937 qualification without actually performing a copy. Leaving it
4938 as "volatile X" seems wrong as that will result in the
4939 conditional expression failing altogether, even though,
4940 according to this step, the one operand could be converted to
4941 the type of the other. */
4942 if (converted
4943 && CLASS_TYPE_P (arg2_type)
4944 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
4945 arg2_type = arg3_type =
4946 cp_build_qualified_type (arg2_type,
4947 cp_type_quals (arg2_type)
4948 | cp_type_quals (arg3_type));
4951 /* [expr.cond]
4953 If the second and third operands are glvalues of the same value
4954 category and have the same type, the result is of that type and
4955 value category. */
4956 if (((real_lvalue_p (arg2) && real_lvalue_p (arg3))
4957 || (xvalue_p (arg2) && xvalue_p (arg3)))
4958 && same_type_p (arg2_type, arg3_type))
4960 result_type = arg2_type;
4961 arg2 = mark_lvalue_use (arg2);
4962 arg3 = mark_lvalue_use (arg3);
4963 goto valid_operands;
4966 /* [expr.cond]
4968 Otherwise, the result is an rvalue. If the second and third
4969 operand do not have the same type, and either has (possibly
4970 cv-qualified) class type, overload resolution is used to
4971 determine the conversions (if any) to be applied to the operands
4972 (_over.match.oper_, _over.built_). */
4973 lvalue_p = false;
4974 if (!same_type_p (arg2_type, arg3_type)
4975 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4977 tree args[3];
4978 conversion *conv;
4979 bool any_viable_p;
4981 /* Rearrange the arguments so that add_builtin_candidate only has
4982 to know about two args. In build_builtin_candidate, the
4983 arguments are unscrambled. */
4984 args[0] = arg2;
4985 args[1] = arg3;
4986 args[2] = arg1;
4987 add_builtin_candidates (&candidates,
4988 COND_EXPR,
4989 NOP_EXPR,
4990 ansi_opname (COND_EXPR),
4991 args,
4992 LOOKUP_NORMAL, complain);
4994 /* [expr.cond]
4996 If the overload resolution fails, the program is
4997 ill-formed. */
4998 candidates = splice_viable (candidates, false, &any_viable_p);
4999 if (!any_viable_p)
5001 if (complain & tf_error)
5002 error_at (loc, "operands to ?: have different types %qT and %qT",
5003 arg2_type, arg3_type);
5004 return error_mark_node;
5006 cand = tourney (candidates, complain);
5007 if (!cand)
5009 if (complain & tf_error)
5011 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5012 print_z_candidates (loc, candidates);
5014 return error_mark_node;
5017 /* [expr.cond]
5019 Otherwise, the conversions thus determined are applied, and
5020 the converted operands are used in place of the original
5021 operands for the remainder of this section. */
5022 conv = cand->convs[0];
5023 arg1 = convert_like (conv, arg1, complain);
5024 conv = cand->convs[1];
5025 arg2 = convert_like (conv, arg2, complain);
5026 arg2_type = TREE_TYPE (arg2);
5027 conv = cand->convs[2];
5028 arg3 = convert_like (conv, arg3, complain);
5029 arg3_type = TREE_TYPE (arg3);
5032 /* [expr.cond]
5034 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5035 and function-to-pointer (_conv.func_) standard conversions are
5036 performed on the second and third operands.
5038 We need to force the lvalue-to-rvalue conversion here for class types,
5039 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5040 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5041 regions. */
5043 arg2 = force_rvalue (arg2, complain);
5044 if (!CLASS_TYPE_P (arg2_type))
5045 arg2_type = TREE_TYPE (arg2);
5047 arg3 = force_rvalue (arg3, complain);
5048 if (!CLASS_TYPE_P (arg3_type))
5049 arg3_type = TREE_TYPE (arg3);
5051 if (arg2 == error_mark_node || arg3 == error_mark_node)
5052 return error_mark_node;
5054 /* [expr.cond]
5056 After those conversions, one of the following shall hold:
5058 --The second and third operands have the same type; the result is of
5059 that type. */
5060 if (same_type_p (arg2_type, arg3_type))
5061 result_type = arg2_type;
5062 /* [expr.cond]
5064 --The second and third operands have arithmetic or enumeration
5065 type; the usual arithmetic conversions are performed to bring
5066 them to a common type, and the result is of that type. */
5067 else if ((ARITHMETIC_TYPE_P (arg2_type)
5068 || UNSCOPED_ENUM_P (arg2_type))
5069 && (ARITHMETIC_TYPE_P (arg3_type)
5070 || UNSCOPED_ENUM_P (arg3_type)))
5072 /* In this case, there is always a common type. */
5073 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5074 arg3_type);
5075 if (complain & tf_warning)
5076 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5077 "implicit conversion from %qT to %qT to "
5078 "match other result of conditional",
5079 loc);
5081 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5082 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5084 if (TREE_CODE (orig_arg2) == CONST_DECL
5085 && TREE_CODE (orig_arg3) == CONST_DECL
5086 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5087 /* Two enumerators from the same enumeration can have different
5088 types when the enumeration is still being defined. */;
5089 else if (complain & tf_warning)
5090 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5091 "conditional expression: %qT vs %qT",
5092 arg2_type, arg3_type);
5094 else if (extra_warnings
5095 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5096 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5097 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5098 && !same_type_p (arg2_type,
5099 type_promotes_to (arg3_type)))))
5101 if (complain & tf_warning)
5102 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5103 "conditional expression");
5106 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5107 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5109 /* [expr.cond]
5111 --The second and third operands have pointer type, or one has
5112 pointer type and the other is a null pointer constant; pointer
5113 conversions (_conv.ptr_) and qualification conversions
5114 (_conv.qual_) are performed to bring them to their composite
5115 pointer type (_expr.rel_). The result is of the composite
5116 pointer type.
5118 --The second and third operands have pointer to member type, or
5119 one has pointer to member type and the other is a null pointer
5120 constant; pointer to member conversions (_conv.mem_) and
5121 qualification conversions (_conv.qual_) are performed to bring
5122 them to a common type, whose cv-qualification shall match the
5123 cv-qualification of either the second or the third operand.
5124 The result is of the common type. */
5125 else if ((null_ptr_cst_p (arg2)
5126 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5127 || (null_ptr_cst_p (arg3)
5128 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5129 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5130 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5131 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5133 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5134 arg3, CPO_CONDITIONAL_EXPR,
5135 complain);
5136 if (result_type == error_mark_node)
5137 return error_mark_node;
5138 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5139 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5142 if (!result_type)
5144 if (complain & tf_error)
5145 error_at (loc, "operands to ?: have different types %qT and %qT",
5146 arg2_type, arg3_type);
5147 return error_mark_node;
5150 if (arg2 == error_mark_node || arg3 == error_mark_node)
5151 return error_mark_node;
5153 valid_operands:
5154 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5156 /* We can't use result_type below, as fold might have returned a
5157 throw_expr. */
5159 if (!lvalue_p)
5161 /* Expand both sides into the same slot, hopefully the target of
5162 the ?: expression. We used to check for TARGET_EXPRs here,
5163 but now we sometimes wrap them in NOP_EXPRs so the test would
5164 fail. */
5165 if (CLASS_TYPE_P (TREE_TYPE (result)))
5166 result = get_target_expr_sfinae (result, complain);
5167 /* If this expression is an rvalue, but might be mistaken for an
5168 lvalue, we must add a NON_LVALUE_EXPR. */
5169 result = rvalue (result);
5171 else
5172 result = force_paren_expr (result);
5174 return result;
5177 /* Wrapper for above. */
5179 tree
5180 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5181 tsubst_flags_t complain)
5183 tree ret;
5184 bool subtime = timevar_cond_start (TV_OVERLOAD);
5185 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5186 timevar_cond_stop (TV_OVERLOAD, subtime);
5187 return ret;
5190 /* OPERAND is an operand to an expression. Perform necessary steps
5191 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5192 returned. */
5194 static tree
5195 prep_operand (tree operand)
5197 if (operand)
5199 if (CLASS_TYPE_P (TREE_TYPE (operand))
5200 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5201 /* Make sure the template type is instantiated now. */
5202 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5205 return operand;
5208 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5209 OVERLOAD) to the CANDIDATES, returning an updated list of
5210 CANDIDATES. The ARGS are the arguments provided to the call;
5211 if FIRST_ARG is non-null it is the implicit object argument,
5212 otherwise the first element of ARGS is used if needed. The
5213 EXPLICIT_TARGS are explicit template arguments provided.
5214 TEMPLATE_ONLY is true if only template functions should be
5215 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5216 add_function_candidate. */
5218 static void
5219 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5220 tree return_type,
5221 tree explicit_targs, bool template_only,
5222 tree conversion_path, tree access_path,
5223 int flags,
5224 struct z_candidate **candidates,
5225 tsubst_flags_t complain)
5227 tree ctype;
5228 const vec<tree, va_gc> *non_static_args;
5229 bool check_list_ctor;
5230 bool check_converting;
5231 unification_kind_t strict;
5232 tree fn;
5234 if (!fns)
5235 return;
5237 /* Precalculate special handling of constructors and conversion ops. */
5238 fn = OVL_CURRENT (fns);
5239 if (DECL_CONV_FN_P (fn))
5241 check_list_ctor = false;
5242 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
5243 if (flags & LOOKUP_NO_CONVERSION)
5244 /* We're doing return_type(x). */
5245 strict = DEDUCE_CONV;
5246 else
5247 /* We're doing x.operator return_type(). */
5248 strict = DEDUCE_EXACT;
5249 /* [over.match.funcs] For conversion functions, the function
5250 is considered to be a member of the class of the implicit
5251 object argument for the purpose of defining the type of
5252 the implicit object parameter. */
5253 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5255 else
5257 if (DECL_CONSTRUCTOR_P (fn))
5259 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
5260 /* For list-initialization we consider explicit constructors
5261 and complain if one is chosen. */
5262 check_converting
5263 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5264 == LOOKUP_ONLYCONVERTING);
5266 else
5268 check_list_ctor = false;
5269 check_converting = false;
5271 strict = DEDUCE_CALL;
5272 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5275 if (first_arg)
5276 non_static_args = args;
5277 else
5278 /* Delay creating the implicit this parameter until it is needed. */
5279 non_static_args = NULL;
5281 for (; fns; fns = OVL_NEXT (fns))
5283 tree fn_first_arg;
5284 const vec<tree, va_gc> *fn_args;
5286 fn = OVL_CURRENT (fns);
5288 if (check_converting && DECL_NONCONVERTING_P (fn))
5289 continue;
5290 if (check_list_ctor && !is_list_ctor (fn))
5291 continue;
5293 /* Figure out which set of arguments to use. */
5294 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5296 /* If this function is a non-static member and we didn't get an
5297 implicit object argument, move it out of args. */
5298 if (first_arg == NULL_TREE)
5300 unsigned int ix;
5301 tree arg;
5302 vec<tree, va_gc> *tempvec;
5303 vec_alloc (tempvec, args->length () - 1);
5304 for (ix = 1; args->iterate (ix, &arg); ++ix)
5305 tempvec->quick_push (arg);
5306 non_static_args = tempvec;
5307 first_arg = (*args)[0];
5310 fn_first_arg = first_arg;
5311 fn_args = non_static_args;
5313 else
5315 /* Otherwise, just use the list of arguments provided. */
5316 fn_first_arg = NULL_TREE;
5317 fn_args = args;
5320 if (TREE_CODE (fn) == TEMPLATE_DECL)
5321 add_template_candidate (candidates,
5323 ctype,
5324 explicit_targs,
5325 fn_first_arg,
5326 fn_args,
5327 return_type,
5328 access_path,
5329 conversion_path,
5330 flags,
5331 strict,
5332 complain);
5333 else if (!template_only)
5334 add_function_candidate (candidates,
5336 ctype,
5337 fn_first_arg,
5338 fn_args,
5339 access_path,
5340 conversion_path,
5341 flags,
5342 complain);
5346 static tree
5347 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5348 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5350 struct z_candidate *candidates = 0, *cand;
5351 vec<tree, va_gc> *arglist;
5352 tree fnname;
5353 tree args[3];
5354 tree result = NULL_TREE;
5355 bool result_valid_p = false;
5356 enum tree_code code2 = NOP_EXPR;
5357 enum tree_code code_orig_arg1 = ERROR_MARK;
5358 enum tree_code code_orig_arg2 = ERROR_MARK;
5359 conversion *conv;
5360 void *p;
5361 bool strict_p;
5362 bool any_viable_p;
5364 if (error_operand_p (arg1)
5365 || error_operand_p (arg2)
5366 || error_operand_p (arg3))
5367 return error_mark_node;
5369 if (code == MODIFY_EXPR)
5371 code2 = TREE_CODE (arg3);
5372 arg3 = NULL_TREE;
5373 fnname = ansi_assopname (code2);
5375 else
5376 fnname = ansi_opname (code);
5378 arg1 = prep_operand (arg1);
5380 bool memonly = false;
5381 switch (code)
5383 case NEW_EXPR:
5384 case VEC_NEW_EXPR:
5385 case VEC_DELETE_EXPR:
5386 case DELETE_EXPR:
5387 /* Use build_op_new_call and build_op_delete_call instead. */
5388 gcc_unreachable ();
5390 case CALL_EXPR:
5391 /* Use build_op_call instead. */
5392 gcc_unreachable ();
5394 case TRUTH_ORIF_EXPR:
5395 case TRUTH_ANDIF_EXPR:
5396 case TRUTH_AND_EXPR:
5397 case TRUTH_OR_EXPR:
5398 /* These are saved for the sake of warn_logical_operator. */
5399 code_orig_arg1 = TREE_CODE (arg1);
5400 code_orig_arg2 = TREE_CODE (arg2);
5401 break;
5402 case GT_EXPR:
5403 case LT_EXPR:
5404 case GE_EXPR:
5405 case LE_EXPR:
5406 case EQ_EXPR:
5407 case NE_EXPR:
5408 /* These are saved for the sake of maybe_warn_bool_compare. */
5409 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5410 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5411 break;
5413 /* =, ->, [], () must be non-static member functions. */
5414 case MODIFY_EXPR:
5415 if (code2 != NOP_EXPR)
5416 break;
5417 case COMPONENT_REF:
5418 case ARRAY_REF:
5419 memonly = true;
5420 break;
5422 default:
5423 break;
5426 arg2 = prep_operand (arg2);
5427 arg3 = prep_operand (arg3);
5429 if (code == COND_EXPR)
5430 /* Use build_conditional_expr instead. */
5431 gcc_unreachable ();
5432 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5433 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5434 goto builtin;
5436 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5437 arg2 = integer_zero_node;
5439 vec_alloc (arglist, 3);
5440 arglist->quick_push (arg1);
5441 if (arg2 != NULL_TREE)
5442 arglist->quick_push (arg2);
5443 if (arg3 != NULL_TREE)
5444 arglist->quick_push (arg3);
5446 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5447 p = conversion_obstack_alloc (0);
5449 /* Add namespace-scope operators to the list of functions to
5450 consider. */
5451 if (!memonly)
5452 add_candidates (lookup_function_nonclass (fnname, arglist,
5453 /*block_p=*/true),
5454 NULL_TREE, arglist, NULL_TREE,
5455 NULL_TREE, false, NULL_TREE, NULL_TREE,
5456 flags, &candidates, complain);
5458 args[0] = arg1;
5459 args[1] = arg2;
5460 args[2] = NULL_TREE;
5462 /* Add class-member operators to the candidate set. */
5463 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5465 tree fns;
5467 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5468 if (fns == error_mark_node)
5470 result = error_mark_node;
5471 goto user_defined_result_ready;
5473 if (fns)
5474 add_candidates (BASELINK_FUNCTIONS (fns),
5475 NULL_TREE, arglist, NULL_TREE,
5476 NULL_TREE, false,
5477 BASELINK_BINFO (fns),
5478 BASELINK_ACCESS_BINFO (fns),
5479 flags, &candidates, complain);
5481 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5482 only non-member functions that have type T1 or reference to
5483 cv-qualified-opt T1 for the first argument, if the first argument
5484 has an enumeration type, or T2 or reference to cv-qualified-opt
5485 T2 for the second argument, if the second argument has an
5486 enumeration type. Filter out those that don't match. */
5487 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5489 struct z_candidate **candp, **next;
5491 for (candp = &candidates; *candp; candp = next)
5493 tree parmlist, parmtype;
5494 int i, nargs = (arg2 ? 2 : 1);
5496 cand = *candp;
5497 next = &cand->next;
5499 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5501 for (i = 0; i < nargs; ++i)
5503 parmtype = TREE_VALUE (parmlist);
5505 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5506 parmtype = TREE_TYPE (parmtype);
5507 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5508 && (same_type_ignoring_top_level_qualifiers_p
5509 (TREE_TYPE (args[i]), parmtype)))
5510 break;
5512 parmlist = TREE_CHAIN (parmlist);
5515 /* No argument has an appropriate type, so remove this
5516 candidate function from the list. */
5517 if (i == nargs)
5519 *candp = cand->next;
5520 next = candp;
5525 add_builtin_candidates (&candidates, code, code2, fnname, args,
5526 flags, complain);
5528 switch (code)
5530 case COMPOUND_EXPR:
5531 case ADDR_EXPR:
5532 /* For these, the built-in candidates set is empty
5533 [over.match.oper]/3. We don't want non-strict matches
5534 because exact matches are always possible with built-in
5535 operators. The built-in candidate set for COMPONENT_REF
5536 would be empty too, but since there are no such built-in
5537 operators, we accept non-strict matches for them. */
5538 strict_p = true;
5539 break;
5541 default:
5542 strict_p = false;
5543 break;
5546 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5547 if (!any_viable_p)
5549 switch (code)
5551 case POSTINCREMENT_EXPR:
5552 case POSTDECREMENT_EXPR:
5553 /* Don't try anything fancy if we're not allowed to produce
5554 errors. */
5555 if (!(complain & tf_error))
5556 return error_mark_node;
5558 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5559 distinguish between prefix and postfix ++ and
5560 operator++() was used for both, so we allow this with
5561 -fpermissive. */
5562 else
5564 const char *msg = (flag_permissive)
5565 ? G_("no %<%D(int)%> declared for postfix %qs,"
5566 " trying prefix operator instead")
5567 : G_("no %<%D(int)%> declared for postfix %qs");
5568 permerror (loc, msg, fnname, operator_name_info[code].name);
5571 if (!flag_permissive)
5572 return error_mark_node;
5574 if (code == POSTINCREMENT_EXPR)
5575 code = PREINCREMENT_EXPR;
5576 else
5577 code = PREDECREMENT_EXPR;
5578 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5579 NULL_TREE, overload, complain);
5580 break;
5582 /* The caller will deal with these. */
5583 case ADDR_EXPR:
5584 case COMPOUND_EXPR:
5585 case COMPONENT_REF:
5586 result = NULL_TREE;
5587 result_valid_p = true;
5588 break;
5590 default:
5591 if (complain & tf_error)
5593 /* If one of the arguments of the operator represents
5594 an invalid use of member function pointer, try to report
5595 a meaningful error ... */
5596 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5597 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5598 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5599 /* We displayed the error message. */;
5600 else
5602 /* ... Otherwise, report the more generic
5603 "no matching operator found" error */
5604 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5605 print_z_candidates (loc, candidates);
5608 result = error_mark_node;
5609 break;
5612 else
5614 cand = tourney (candidates, complain);
5615 if (cand == 0)
5617 if (complain & tf_error)
5619 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5620 print_z_candidates (loc, candidates);
5622 result = error_mark_node;
5624 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5626 if (overload)
5627 *overload = cand->fn;
5629 if (resolve_args (arglist, complain) == NULL)
5630 result = error_mark_node;
5631 else
5632 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5634 else
5636 /* Give any warnings we noticed during overload resolution. */
5637 if (cand->warnings && (complain & tf_warning))
5639 struct candidate_warning *w;
5640 for (w = cand->warnings; w; w = w->next)
5641 joust (cand, w->loser, 1, complain);
5644 /* Check for comparison of different enum types. */
5645 switch (code)
5647 case GT_EXPR:
5648 case LT_EXPR:
5649 case GE_EXPR:
5650 case LE_EXPR:
5651 case EQ_EXPR:
5652 case NE_EXPR:
5653 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5654 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5655 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5656 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5657 && (complain & tf_warning))
5659 warning (OPT_Wenum_compare,
5660 "comparison between %q#T and %q#T",
5661 TREE_TYPE (arg1), TREE_TYPE (arg2));
5663 break;
5664 default:
5665 break;
5668 /* We need to strip any leading REF_BIND so that bitfields
5669 don't cause errors. This should not remove any important
5670 conversions, because builtins don't apply to class
5671 objects directly. */
5672 conv = cand->convs[0];
5673 if (conv->kind == ck_ref_bind)
5674 conv = next_conversion (conv);
5675 arg1 = convert_like (conv, arg1, complain);
5677 if (arg2)
5679 conv = cand->convs[1];
5680 if (conv->kind == ck_ref_bind)
5681 conv = next_conversion (conv);
5682 else
5683 arg2 = decay_conversion (arg2, complain);
5685 /* We need to call warn_logical_operator before
5686 converting arg2 to a boolean_type, but after
5687 decaying an enumerator to its value. */
5688 if (complain & tf_warning)
5689 warn_logical_operator (loc, code, boolean_type_node,
5690 code_orig_arg1, fold (arg1),
5691 code_orig_arg2, fold (arg2));
5693 arg2 = convert_like (conv, arg2, complain);
5695 if (arg3)
5697 conv = cand->convs[2];
5698 if (conv->kind == ck_ref_bind)
5699 conv = next_conversion (conv);
5700 arg3 = convert_like (conv, arg3, complain);
5706 user_defined_result_ready:
5708 /* Free all the conversions we allocated. */
5709 obstack_free (&conversion_obstack, p);
5711 if (result || result_valid_p)
5712 return result;
5714 builtin:
5715 switch (code)
5717 case MODIFY_EXPR:
5718 return cp_build_modify_expr (arg1, code2, arg2, complain);
5720 case INDIRECT_REF:
5721 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5723 case TRUTH_ANDIF_EXPR:
5724 case TRUTH_ORIF_EXPR:
5725 case TRUTH_AND_EXPR:
5726 case TRUTH_OR_EXPR:
5727 if (complain & tf_warning)
5728 warn_logical_operator (loc, code, boolean_type_node,
5729 code_orig_arg1, fold (arg1),
5730 code_orig_arg2, fold (arg2));
5731 /* Fall through. */
5732 case GT_EXPR:
5733 case LT_EXPR:
5734 case GE_EXPR:
5735 case LE_EXPR:
5736 case EQ_EXPR:
5737 case NE_EXPR:
5738 if ((complain & tf_warning)
5739 && ((code_orig_arg1 == BOOLEAN_TYPE)
5740 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5741 maybe_warn_bool_compare (loc, code, fold (arg1),
5742 fold (arg2));
5743 if (complain & tf_warning && warn_tautological_compare)
5744 warn_tautological_cmp (loc, code, arg1, arg2);
5745 /* Fall through. */
5746 case PLUS_EXPR:
5747 case MINUS_EXPR:
5748 case MULT_EXPR:
5749 case TRUNC_DIV_EXPR:
5750 case MAX_EXPR:
5751 case MIN_EXPR:
5752 case LSHIFT_EXPR:
5753 case RSHIFT_EXPR:
5754 case TRUNC_MOD_EXPR:
5755 case BIT_AND_EXPR:
5756 case BIT_IOR_EXPR:
5757 case BIT_XOR_EXPR:
5758 return cp_build_binary_op (loc, code, arg1, arg2, complain);
5760 case UNARY_PLUS_EXPR:
5761 case NEGATE_EXPR:
5762 case BIT_NOT_EXPR:
5763 case TRUTH_NOT_EXPR:
5764 case PREINCREMENT_EXPR:
5765 case POSTINCREMENT_EXPR:
5766 case PREDECREMENT_EXPR:
5767 case POSTDECREMENT_EXPR:
5768 case REALPART_EXPR:
5769 case IMAGPART_EXPR:
5770 case ABS_EXPR:
5771 return cp_build_unary_op (code, arg1, candidates != 0, complain);
5773 case ARRAY_REF:
5774 return cp_build_array_ref (input_location, arg1, arg2, complain);
5776 case MEMBER_REF:
5777 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
5778 complain),
5779 arg2, complain);
5781 /* The caller will deal with these. */
5782 case ADDR_EXPR:
5783 case COMPONENT_REF:
5784 case COMPOUND_EXPR:
5785 return NULL_TREE;
5787 default:
5788 gcc_unreachable ();
5790 return NULL_TREE;
5793 /* Wrapper for above. */
5795 tree
5796 build_new_op (location_t loc, enum tree_code code, int flags,
5797 tree arg1, tree arg2, tree arg3,
5798 tree *overload, tsubst_flags_t complain)
5800 tree ret;
5801 bool subtime = timevar_cond_start (TV_OVERLOAD);
5802 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
5803 overload, complain);
5804 timevar_cond_stop (TV_OVERLOAD, subtime);
5805 return ret;
5808 /* Returns true if FN has two parameters, of which the second has type
5809 size_t. */
5811 static bool
5812 second_parm_is_size_t (tree fn)
5814 tree t = FUNCTION_ARG_CHAIN (fn);
5815 return (t
5816 && same_type_p (TREE_VALUE (t), size_type_node)
5817 && TREE_CHAIN (t) == void_list_node);
5820 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5821 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5823 bool
5824 non_placement_deallocation_fn_p (tree t)
5826 /* A template instance is never a usual deallocation function,
5827 regardless of its signature. */
5828 if (TREE_CODE (t) == TEMPLATE_DECL
5829 || primary_template_instantiation_p (t))
5830 return false;
5832 /* If a class T has a member deallocation function named operator delete
5833 with exactly one parameter, then that function is a usual
5834 (non-placement) deallocation function. If class T does not declare
5835 such an operator delete but does declare a member deallocation
5836 function named operator delete with exactly two parameters, the second
5837 of which has type std::size_t (18.2), then this function is a usual
5838 deallocation function. */
5839 bool global = DECL_NAMESPACE_SCOPE_P (t);
5840 if (FUNCTION_ARG_CHAIN (t) == void_list_node
5841 || ((!global || flag_sized_deallocation)
5842 && second_parm_is_size_t (t)))
5843 return true;
5844 return false;
5847 /* Build a call to operator delete. This has to be handled very specially,
5848 because the restrictions on what signatures match are different from all
5849 other call instances. For a normal delete, only a delete taking (void *)
5850 or (void *, size_t) is accepted. For a placement delete, only an exact
5851 match with the placement new is accepted.
5853 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5854 ADDR is the pointer to be deleted.
5855 SIZE is the size of the memory block to be deleted.
5856 GLOBAL_P is true if the delete-expression should not consider
5857 class-specific delete operators.
5858 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5860 If this call to "operator delete" is being generated as part to
5861 deallocate memory allocated via a new-expression (as per [expr.new]
5862 which requires that if the initialization throws an exception then
5863 we call a deallocation function), then ALLOC_FN is the allocation
5864 function. */
5866 tree
5867 build_op_delete_call (enum tree_code code, tree addr, tree size,
5868 bool global_p, tree placement,
5869 tree alloc_fn, tsubst_flags_t complain)
5871 tree fn = NULL_TREE;
5872 tree fns, fnname, type, t;
5874 if (addr == error_mark_node)
5875 return error_mark_node;
5877 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
5879 fnname = ansi_opname (code);
5881 if (CLASS_TYPE_P (type)
5882 && COMPLETE_TYPE_P (complete_type (type))
5883 && !global_p)
5884 /* In [class.free]
5886 If the result of the lookup is ambiguous or inaccessible, or if
5887 the lookup selects a placement deallocation function, the
5888 program is ill-formed.
5890 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5892 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
5893 if (fns == error_mark_node)
5894 return error_mark_node;
5896 else
5897 fns = NULL_TREE;
5899 if (fns == NULL_TREE)
5900 fns = lookup_name_nonclass (fnname);
5902 /* Strip const and volatile from addr. */
5903 addr = cp_convert (ptr_type_node, addr, complain);
5905 if (placement)
5907 /* "A declaration of a placement deallocation function matches the
5908 declaration of a placement allocation function if it has the same
5909 number of parameters and, after parameter transformations (8.3.5),
5910 all parameter types except the first are identical."
5912 So we build up the function type we want and ask instantiate_type
5913 to get it for us. */
5914 t = FUNCTION_ARG_CHAIN (alloc_fn);
5915 t = tree_cons (NULL_TREE, ptr_type_node, t);
5916 t = build_function_type (void_type_node, t);
5918 fn = instantiate_type (t, fns, tf_none);
5919 if (fn == error_mark_node)
5920 return NULL_TREE;
5922 if (BASELINK_P (fn))
5923 fn = BASELINK_FUNCTIONS (fn);
5925 /* "If the lookup finds the two-parameter form of a usual deallocation
5926 function (3.7.4.2) and that function, considered as a placement
5927 deallocation function, would have been selected as a match for the
5928 allocation function, the program is ill-formed." */
5929 if (second_parm_is_size_t (fn))
5931 const char *msg1
5932 = G_("exception cleanup for this placement new selects "
5933 "non-placement operator delete");
5934 const char *msg2
5935 = G_("%qD is a usual (non-placement) deallocation "
5936 "function in C++14 (or with -fsized-deallocation)");
5938 /* But if the class has an operator delete (void *), then that is
5939 the usual deallocation function, so we shouldn't complain
5940 about using the operator delete (void *, size_t). */
5941 if (DECL_CLASS_SCOPE_P (fn))
5942 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5943 t; t = OVL_NEXT (t))
5945 tree elt = OVL_CURRENT (t);
5946 if (non_placement_deallocation_fn_p (elt)
5947 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
5948 goto ok;
5950 /* Before C++14 a two-parameter global deallocation function is
5951 always a placement deallocation function, but warn if
5952 -Wc++14-compat. */
5953 else if (!flag_sized_deallocation)
5955 if ((complain & tf_warning)
5956 && warning (OPT_Wc__14_compat, msg1))
5957 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
5958 goto ok;
5961 if (complain & tf_warning_or_error)
5963 if (permerror (input_location, msg1))
5965 /* Only mention C++14 for namespace-scope delete. */
5966 if (DECL_NAMESPACE_SCOPE_P (fn))
5967 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
5968 else
5969 inform (DECL_SOURCE_LOCATION (fn),
5970 "%qD is a usual (non-placement) deallocation "
5971 "function", fn);
5974 else
5975 return error_mark_node;
5976 ok:;
5979 else
5980 /* "Any non-placement deallocation function matches a non-placement
5981 allocation function. If the lookup finds a single matching
5982 deallocation function, that function will be called; otherwise, no
5983 deallocation function will be called." */
5984 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5985 t; t = OVL_NEXT (t))
5987 tree elt = OVL_CURRENT (t);
5988 if (non_placement_deallocation_fn_p (elt))
5990 fn = elt;
5991 /* "If a class T has a member deallocation function named
5992 operator delete with exactly one parameter, then that
5993 function is a usual (non-placement) deallocation
5994 function. If class T does not declare such an operator
5995 delete but does declare a member deallocation function named
5996 operator delete with exactly two parameters, the second of
5997 which has type std::size_t (18.2), then this function is a
5998 usual deallocation function."
6000 So in a class (void*) beats (void*, size_t). */
6001 if (DECL_CLASS_SCOPE_P (fn))
6003 if (FUNCTION_ARG_CHAIN (fn) == void_list_node)
6004 break;
6006 /* At global scope (in C++14 and above) the rules are different:
6008 If deallocation function lookup finds both a usual
6009 deallocation function with only a pointer parameter and a
6010 usual deallocation function with both a pointer parameter
6011 and a size parameter, the function to be called is selected
6012 as follows:
6014 * If the type is complete and if, for the second alternative
6015 (delete array) only, the operand is a pointer to a class
6016 type with a non-trivial destructor or a (possibly
6017 multi-dimensional) array thereof, the function with two
6018 parameters is selected.
6020 * Otherwise, it is unspecified which of the two deallocation
6021 functions is selected. */
6022 else
6024 bool want_size = COMPLETE_TYPE_P (type);
6025 if (code == VEC_DELETE_EXPR
6026 && !TYPE_VEC_NEW_USES_COOKIE (type))
6027 /* We need a cookie to determine the array size. */
6028 want_size = false;
6029 bool have_size = (FUNCTION_ARG_CHAIN (fn) != void_list_node);
6030 if (want_size == have_size)
6031 break;
6036 /* If we have a matching function, call it. */
6037 if (fn)
6039 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6041 /* If the FN is a member function, make sure that it is
6042 accessible. */
6043 if (BASELINK_P (fns))
6044 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6045 complain);
6047 /* Core issue 901: It's ok to new a type with deleted delete. */
6048 if (DECL_DELETED_FN (fn) && alloc_fn)
6049 return NULL_TREE;
6051 if (placement)
6053 /* The placement args might not be suitable for overload
6054 resolution at this point, so build the call directly. */
6055 int nargs = call_expr_nargs (placement);
6056 tree *argarray = XALLOCAVEC (tree, nargs);
6057 int i;
6058 argarray[0] = addr;
6059 for (i = 1; i < nargs; i++)
6060 argarray[i] = CALL_EXPR_ARG (placement, i);
6061 if (!mark_used (fn, complain) && !(complain & tf_error))
6062 return error_mark_node;
6063 return build_cxx_call (fn, nargs, argarray, complain);
6065 else
6067 tree ret;
6068 vec<tree, va_gc> *args = make_tree_vector ();
6069 args->quick_push (addr);
6070 if (FUNCTION_ARG_CHAIN (fn) != void_list_node)
6071 args->quick_push (size);
6072 ret = cp_build_function_call_vec (fn, &args, complain);
6073 release_tree_vector (args);
6074 return ret;
6078 /* [expr.new]
6080 If no unambiguous matching deallocation function can be found,
6081 propagating the exception does not cause the object's memory to
6082 be freed. */
6083 if (alloc_fn)
6085 if ((complain & tf_warning)
6086 && !placement)
6087 warning (0, "no corresponding deallocation function for %qD",
6088 alloc_fn);
6089 return NULL_TREE;
6092 if (complain & tf_error)
6093 error ("no suitable %<operator %s%> for %qT",
6094 operator_name_info[(int)code].name, type);
6095 return error_mark_node;
6098 /* If the current scope isn't allowed to access DECL along
6099 BASETYPE_PATH, give an error. The most derived class in
6100 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6101 the declaration to use in the error diagnostic. */
6103 bool
6104 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6105 tsubst_flags_t complain)
6107 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6109 if (!accessible_p (basetype_path, decl, true))
6111 if (complain & tf_error)
6113 if (TREE_PRIVATE (decl))
6115 error ("%q#D is private within this context", diag_decl);
6116 inform (DECL_SOURCE_LOCATION (diag_decl),
6117 "declared private here");
6119 else if (TREE_PROTECTED (decl))
6121 error ("%q#D is protected within this context", diag_decl);
6122 inform (DECL_SOURCE_LOCATION (diag_decl),
6123 "declared protected here");
6125 else
6127 error ("%q#D is inaccessible within this context", diag_decl);
6128 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6131 return false;
6134 return true;
6137 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6138 bitwise or of LOOKUP_* values. If any errors are warnings are
6139 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6140 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6141 to NULL. */
6143 static tree
6144 build_temp (tree expr, tree type, int flags,
6145 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6147 int savew, savee;
6148 vec<tree, va_gc> *args;
6150 savew = warningcount + werrorcount, savee = errorcount;
6151 args = make_tree_vector_single (expr);
6152 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6153 &args, type, flags, complain);
6154 release_tree_vector (args);
6155 if (warningcount + werrorcount > savew)
6156 *diagnostic_kind = DK_WARNING;
6157 else if (errorcount > savee)
6158 *diagnostic_kind = DK_ERROR;
6159 else
6160 *diagnostic_kind = DK_UNSPECIFIED;
6161 return expr;
6164 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6165 EXPR is implicitly converted to type TOTYPE.
6166 FN and ARGNUM are used for diagnostics. */
6168 static void
6169 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6171 /* Issue warnings about peculiar, but valid, uses of NULL. */
6172 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
6173 && ARITHMETIC_TYPE_P (totype))
6175 source_location loc =
6176 expansion_point_location_if_in_system_header (input_location);
6178 if (fn)
6179 warning_at (loc, OPT_Wconversion_null,
6180 "passing NULL to non-pointer argument %P of %qD",
6181 argnum, fn);
6182 else
6183 warning_at (loc, OPT_Wconversion_null,
6184 "converting to non-pointer type %qT from NULL", totype);
6187 /* Issue warnings if "false" is converted to a NULL pointer */
6188 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6189 && TYPE_PTR_P (totype))
6191 if (fn)
6192 warning_at (input_location, OPT_Wconversion_null,
6193 "converting %<false%> to pointer type for argument %P "
6194 "of %qD", argnum, fn);
6195 else
6196 warning_at (input_location, OPT_Wconversion_null,
6197 "converting %<false%> to pointer type %qT", totype);
6201 /* We gave a diagnostic during a conversion. If this was in the second
6202 standard conversion sequence of a user-defined conversion sequence, say
6203 which user-defined conversion. */
6205 static void
6206 maybe_print_user_conv_context (conversion *convs)
6208 if (convs->user_conv_p)
6209 for (conversion *t = convs; t; t = next_conversion (t))
6210 if (t->kind == ck_user)
6212 print_z_candidate (0, " after user-defined conversion:",
6213 t->cand);
6214 break;
6218 /* Perform the conversions in CONVS on the expression EXPR. FN and
6219 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6220 indicates the `this' argument of a method. INNER is nonzero when
6221 being called to continue a conversion chain. It is negative when a
6222 reference binding will be applied, positive otherwise. If
6223 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6224 conversions will be emitted if appropriate. If C_CAST_P is true,
6225 this conversion is coming from a C-style cast; in that case,
6226 conversions to inaccessible bases are permitted. */
6228 static tree
6229 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6230 int inner, bool issue_conversion_warnings,
6231 bool c_cast_p, tsubst_flags_t complain)
6233 tree totype = convs->type;
6234 diagnostic_t diag_kind;
6235 int flags;
6236 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6238 if (convs->bad_p && !(complain & tf_error))
6239 return error_mark_node;
6241 if (convs->bad_p
6242 && convs->kind != ck_user
6243 && convs->kind != ck_list
6244 && convs->kind != ck_ambig
6245 && (convs->kind != ck_ref_bind
6246 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6247 && (convs->kind != ck_rvalue
6248 || SCALAR_TYPE_P (totype))
6249 && convs->kind != ck_base)
6251 bool complained = false;
6252 conversion *t = convs;
6254 /* Give a helpful error if this is bad because of excess braces. */
6255 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6256 && SCALAR_TYPE_P (totype)
6257 && CONSTRUCTOR_NELTS (expr) > 0
6258 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6260 complained = permerror (loc, "too many braces around initializer "
6261 "for %qT", totype);
6262 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6263 && CONSTRUCTOR_NELTS (expr) == 1)
6264 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6267 /* Give a helpful error if this is bad because a conversion to bool
6268 from std::nullptr_t requires direct-initialization. */
6269 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6270 && TREE_CODE (totype) == BOOLEAN_TYPE)
6271 complained = permerror (loc, "converting to %qT from %qT requires "
6272 "direct-initialization",
6273 totype, TREE_TYPE (expr));
6275 for (; t ; t = next_conversion (t))
6277 if (t->kind == ck_user && t->cand->reason)
6279 complained = permerror (loc, "invalid user-defined conversion "
6280 "from %qT to %qT", TREE_TYPE (expr),
6281 totype);
6282 if (complained)
6283 print_z_candidate (loc, "candidate is:", t->cand);
6284 expr = convert_like_real (t, expr, fn, argnum, 1,
6285 /*issue_conversion_warnings=*/false,
6286 /*c_cast_p=*/false,
6287 complain);
6288 if (convs->kind == ck_ref_bind)
6289 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6290 LOOKUP_NORMAL, NULL_TREE,
6291 complain);
6292 else
6293 expr = cp_convert (totype, expr, complain);
6294 if (complained && fn)
6295 inform (DECL_SOURCE_LOCATION (fn),
6296 " initializing argument %P of %qD", argnum, fn);
6297 return expr;
6299 else if (t->kind == ck_user || !t->bad_p)
6301 expr = convert_like_real (t, expr, fn, argnum, 1,
6302 /*issue_conversion_warnings=*/false,
6303 /*c_cast_p=*/false,
6304 complain);
6305 break;
6307 else if (t->kind == ck_ambig)
6308 return convert_like_real (t, expr, fn, argnum, 1,
6309 /*issue_conversion_warnings=*/false,
6310 /*c_cast_p=*/false,
6311 complain);
6312 else if (t->kind == ck_identity)
6313 break;
6315 if (!complained)
6316 complained = permerror (loc, "invalid conversion from %qT to %qT",
6317 TREE_TYPE (expr), totype);
6318 if (complained && fn)
6319 inform (DECL_SOURCE_LOCATION (fn),
6320 " initializing argument %P of %qD", argnum, fn);
6322 return cp_convert (totype, expr, complain);
6325 if (issue_conversion_warnings && (complain & tf_warning))
6326 conversion_null_warnings (totype, expr, fn, argnum);
6328 switch (convs->kind)
6330 case ck_user:
6332 struct z_candidate *cand = convs->cand;
6333 tree convfn = cand->fn;
6334 unsigned i;
6336 /* When converting from an init list we consider explicit
6337 constructors, but actually trying to call one is an error. */
6338 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6339 /* Unless this is for direct-list-initialization. */
6340 && !DIRECT_LIST_INIT_P (expr)
6341 /* And in C++98 a default constructor can't be explicit. */
6342 && cxx_dialect >= cxx11)
6344 if (!(complain & tf_error))
6345 return error_mark_node;
6346 location_t loc = location_of (expr);
6347 if (CONSTRUCTOR_NELTS (expr) == 0
6348 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6350 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6351 "would use explicit constructor %qD",
6352 totype, convfn))
6353 inform (loc, "in C++11 and above a default constructor "
6354 "can be explicit");
6356 else
6357 error ("converting to %qT from initializer list would use "
6358 "explicit constructor %qD", totype, convfn);
6361 /* If we're initializing from {}, it's value-initialization. */
6362 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6363 && CONSTRUCTOR_NELTS (expr) == 0
6364 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6366 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6367 expr = build_value_init (totype, complain);
6368 expr = get_target_expr_sfinae (expr, complain);
6369 if (expr != error_mark_node)
6371 TARGET_EXPR_LIST_INIT_P (expr) = true;
6372 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6374 return expr;
6377 expr = mark_rvalue_use (expr);
6379 /* Set user_conv_p on the argument conversions, so rvalue/base
6380 handling knows not to allow any more UDCs. */
6381 for (i = 0; i < cand->num_convs; ++i)
6382 cand->convs[i]->user_conv_p = true;
6384 expr = build_over_call (cand, LOOKUP_NORMAL, complain);
6386 /* If this is a constructor or a function returning an aggr type,
6387 we need to build up a TARGET_EXPR. */
6388 if (DECL_CONSTRUCTOR_P (convfn))
6390 expr = build_cplus_new (totype, expr, complain);
6392 /* Remember that this was list-initialization. */
6393 if (convs->check_narrowing && expr != error_mark_node)
6394 TARGET_EXPR_LIST_INIT_P (expr) = true;
6397 return expr;
6399 case ck_identity:
6400 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6402 int nelts = CONSTRUCTOR_NELTS (expr);
6403 if (nelts == 0)
6404 expr = build_value_init (totype, complain);
6405 else if (nelts == 1)
6406 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6407 else
6408 gcc_unreachable ();
6410 expr = mark_rvalue_use (expr);
6412 if (type_unknown_p (expr))
6413 expr = instantiate_type (totype, expr, complain);
6414 /* Convert a constant to its underlying value, unless we are
6415 about to bind it to a reference, in which case we need to
6416 leave it as an lvalue. */
6417 if (inner >= 0)
6419 expr = scalar_constant_value (expr);
6420 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
6421 /* If __null has been converted to an integer type, we do not
6422 want to warn about uses of EXPR as an integer, rather than
6423 as a pointer. */
6424 expr = build_int_cst (totype, 0);
6426 return expr;
6427 case ck_ambig:
6428 /* We leave bad_p off ck_ambig because overload resolution considers
6429 it valid, it just fails when we try to perform it. So we need to
6430 check complain here, too. */
6431 if (complain & tf_error)
6433 /* Call build_user_type_conversion again for the error. */
6434 build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL,
6435 complain);
6436 if (fn)
6437 inform (DECL_SOURCE_LOCATION (fn),
6438 " initializing argument %P of %qD", argnum, fn);
6440 return error_mark_node;
6442 case ck_list:
6444 /* Conversion to std::initializer_list<T>. */
6445 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6446 tree new_ctor = build_constructor (init_list_type_node, NULL);
6447 unsigned len = CONSTRUCTOR_NELTS (expr);
6448 tree array, val, field;
6449 vec<constructor_elt, va_gc> *vec = NULL;
6450 unsigned ix;
6452 /* Convert all the elements. */
6453 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6455 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6456 1, false, false, complain);
6457 if (sub == error_mark_node)
6458 return sub;
6459 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6460 && !check_narrowing (TREE_TYPE (sub), val, complain))
6461 return error_mark_node;
6462 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6463 if (!TREE_CONSTANT (sub))
6464 TREE_CONSTANT (new_ctor) = false;
6466 /* Build up the array. */
6467 elttype = cp_build_qualified_type
6468 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6469 array = build_array_of_n_type (elttype, len);
6470 array = finish_compound_literal (array, new_ctor, complain);
6471 /* Take the address explicitly rather than via decay_conversion
6472 to avoid the error about taking the address of a temporary. */
6473 array = cp_build_addr_expr (array, complain);
6474 array = cp_convert (build_pointer_type (elttype), array, complain);
6475 if (array == error_mark_node)
6476 return error_mark_node;
6478 /* Build up the initializer_list object. */
6479 totype = complete_type (totype);
6480 field = next_initializable_field (TYPE_FIELDS (totype));
6481 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6482 field = next_initializable_field (DECL_CHAIN (field));
6483 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6484 new_ctor = build_constructor (totype, vec);
6485 return get_target_expr_sfinae (new_ctor, complain);
6488 case ck_aggr:
6489 if (TREE_CODE (totype) == COMPLEX_TYPE)
6491 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6492 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6493 real = perform_implicit_conversion (TREE_TYPE (totype),
6494 real, complain);
6495 imag = perform_implicit_conversion (TREE_TYPE (totype),
6496 imag, complain);
6497 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6498 return expr;
6500 expr = reshape_init (totype, expr, complain);
6501 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6502 complain);
6503 if (expr != error_mark_node)
6504 TARGET_EXPR_LIST_INIT_P (expr) = true;
6505 return expr;
6507 default:
6508 break;
6511 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6512 convs->kind == ck_ref_bind ? -1 : 1,
6513 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6514 c_cast_p,
6515 complain);
6516 if (expr == error_mark_node)
6517 return error_mark_node;
6519 switch (convs->kind)
6521 case ck_rvalue:
6522 expr = decay_conversion (expr, complain);
6523 if (expr == error_mark_node)
6524 return error_mark_node;
6526 if (! MAYBE_CLASS_TYPE_P (totype))
6527 return expr;
6528 /* Else fall through. */
6529 case ck_base:
6530 if (convs->kind == ck_base && !convs->need_temporary_p)
6532 /* We are going to bind a reference directly to a base-class
6533 subobject of EXPR. */
6534 /* Build an expression for `*((base*) &expr)'. */
6535 expr = convert_to_base (expr, totype,
6536 !c_cast_p, /*nonnull=*/true, complain);
6537 return expr;
6540 /* Copy-initialization where the cv-unqualified version of the source
6541 type is the same class as, or a derived class of, the class of the
6542 destination [is treated as direct-initialization]. [dcl.init] */
6543 flags = LOOKUP_NORMAL;
6544 if (convs->user_conv_p)
6545 /* This conversion is being done in the context of a user-defined
6546 conversion (i.e. the second step of copy-initialization), so
6547 don't allow any more. */
6548 flags |= LOOKUP_NO_CONVERSION;
6549 else
6550 flags |= LOOKUP_ONLYCONVERTING;
6551 if (convs->rvaluedness_matches_p)
6552 flags |= LOOKUP_PREFER_RVALUE;
6553 if (TREE_CODE (expr) == TARGET_EXPR
6554 && TARGET_EXPR_LIST_INIT_P (expr))
6555 /* Copy-list-initialization doesn't actually involve a copy. */
6556 return expr;
6557 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6558 if (diag_kind && complain)
6560 maybe_print_user_conv_context (convs);
6561 if (fn)
6562 inform (DECL_SOURCE_LOCATION (fn),
6563 " initializing argument %P of %qD", argnum, fn);
6566 return build_cplus_new (totype, expr, complain);
6568 case ck_ref_bind:
6570 tree ref_type = totype;
6572 if (convs->bad_p && !next_conversion (convs)->bad_p)
6574 tree extype = TREE_TYPE (expr);
6575 if (TYPE_REF_IS_RVALUE (ref_type)
6576 && real_lvalue_p (expr))
6577 error_at (loc, "cannot bind %qT lvalue to %qT",
6578 extype, totype);
6579 else if (!TYPE_REF_IS_RVALUE (ref_type) && !real_lvalue_p (expr)
6580 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6581 error_at (loc, "invalid initialization of non-const reference of "
6582 "type %qT from an rvalue of type %qT", totype, extype);
6583 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6584 error_at (loc, "binding %qT to reference of type %qT "
6585 "discards qualifiers", extype, totype);
6586 else
6587 gcc_unreachable ();
6588 maybe_print_user_conv_context (convs);
6589 if (fn)
6590 inform (DECL_SOURCE_LOCATION (fn),
6591 " initializing argument %P of %qD", argnum, fn);
6592 return error_mark_node;
6595 /* If necessary, create a temporary.
6597 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6598 that need temporaries, even when their types are reference
6599 compatible with the type of reference being bound, so the
6600 upcoming call to cp_build_addr_expr doesn't fail. */
6601 if (convs->need_temporary_p
6602 || TREE_CODE (expr) == CONSTRUCTOR
6603 || TREE_CODE (expr) == VA_ARG_EXPR)
6605 /* Otherwise, a temporary of type "cv1 T1" is created and
6606 initialized from the initializer expression using the rules
6607 for a non-reference copy-initialization (8.5). */
6609 tree type = TREE_TYPE (ref_type);
6610 cp_lvalue_kind lvalue = real_lvalue_p (expr);
6612 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6613 (type, next_conversion (convs)->type));
6614 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
6615 && !TYPE_REF_IS_RVALUE (ref_type))
6617 /* If the reference is volatile or non-const, we
6618 cannot create a temporary. */
6619 if (lvalue & clk_bitfield)
6620 error_at (loc, "cannot bind bitfield %qE to %qT",
6621 expr, ref_type);
6622 else if (lvalue & clk_packed)
6623 error_at (loc, "cannot bind packed field %qE to %qT",
6624 expr, ref_type);
6625 else
6626 error_at (loc, "cannot bind rvalue %qE to %qT",
6627 expr, ref_type);
6628 return error_mark_node;
6630 /* If the source is a packed field, and we must use a copy
6631 constructor, then building the target expr will require
6632 binding the field to the reference parameter to the
6633 copy constructor, and we'll end up with an infinite
6634 loop. If we can use a bitwise copy, then we'll be
6635 OK. */
6636 if ((lvalue & clk_packed)
6637 && CLASS_TYPE_P (type)
6638 && type_has_nontrivial_copy_init (type))
6640 error_at (loc, "cannot bind packed field %qE to %qT",
6641 expr, ref_type);
6642 return error_mark_node;
6644 if (lvalue & clk_bitfield)
6646 expr = convert_bitfield_to_declared_type (expr);
6647 expr = fold_convert (type, expr);
6649 expr = build_target_expr_with_type (expr, type, complain);
6652 /* Take the address of the thing to which we will bind the
6653 reference. */
6654 expr = cp_build_addr_expr (expr, complain);
6655 if (expr == error_mark_node)
6656 return error_mark_node;
6658 /* Convert it to a pointer to the type referred to by the
6659 reference. This will adjust the pointer if a derived to
6660 base conversion is being performed. */
6661 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
6662 expr, complain);
6663 /* Convert the pointer to the desired reference type. */
6664 return build_nop (ref_type, expr);
6667 case ck_lvalue:
6668 return decay_conversion (expr, complain);
6670 case ck_tsafe:
6671 /* ??? Should the address of a transaction-safe pointer point to the TM
6672 clone, and this conversion look up the primary function? */
6673 return build_nop (totype, expr);
6675 case ck_qual:
6676 /* Warn about deprecated conversion if appropriate. */
6677 string_conv_p (totype, expr, 1);
6678 break;
6680 case ck_ptr:
6681 if (convs->base_p)
6682 expr = convert_to_base (expr, totype, !c_cast_p,
6683 /*nonnull=*/false, complain);
6684 return build_nop (totype, expr);
6686 case ck_pmem:
6687 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
6688 c_cast_p, complain);
6690 default:
6691 break;
6694 if (convs->check_narrowing
6695 && !check_narrowing (totype, expr, complain))
6696 return error_mark_node;
6698 if (issue_conversion_warnings)
6699 expr = cp_convert_and_check (totype, expr, complain);
6700 else
6701 expr = cp_convert (totype, expr, complain);
6703 return expr;
6706 /* ARG is being passed to a varargs function. Perform any conversions
6707 required. Return the converted value. */
6709 tree
6710 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
6712 tree arg_type;
6713 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
6715 /* [expr.call]
6717 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6718 standard conversions are performed. */
6719 arg = decay_conversion (arg, complain);
6720 arg_type = TREE_TYPE (arg);
6721 /* [expr.call]
6723 If the argument has integral or enumeration type that is subject
6724 to the integral promotions (_conv.prom_), or a floating point
6725 type that is subject to the floating point promotion
6726 (_conv.fpprom_), the value of the argument is converted to the
6727 promoted type before the call. */
6728 if (TREE_CODE (arg_type) == REAL_TYPE
6729 && (TYPE_PRECISION (arg_type)
6730 < TYPE_PRECISION (double_type_node))
6731 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
6733 if ((complain & tf_warning)
6734 && warn_double_promotion && !c_inhibit_evaluation_warnings)
6735 warning_at (loc, OPT_Wdouble_promotion,
6736 "implicit conversion from %qT to %qT when passing "
6737 "argument to function",
6738 arg_type, double_type_node);
6739 arg = convert_to_real_nofold (double_type_node, arg);
6741 else if (NULLPTR_TYPE_P (arg_type))
6742 arg = null_pointer_node;
6743 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
6745 if (SCOPED_ENUM_P (arg_type))
6747 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
6748 complain);
6749 prom = cp_perform_integral_promotions (prom, complain);
6750 if (abi_version_crosses (6)
6751 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
6752 && (complain & tf_warning))
6753 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
6754 "%qT before -fabi-version=6, %qT after", arg_type,
6755 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
6756 if (!abi_version_at_least (6))
6757 arg = prom;
6759 else
6760 arg = cp_perform_integral_promotions (arg, complain);
6763 arg = require_complete_type_sfinae (arg, complain);
6764 arg_type = TREE_TYPE (arg);
6766 if (arg != error_mark_node
6767 /* In a template (or ill-formed code), we can have an incomplete type
6768 even after require_complete_type_sfinae, in which case we don't know
6769 whether it has trivial copy or not. */
6770 && COMPLETE_TYPE_P (arg_type))
6772 /* Build up a real lvalue-to-rvalue conversion in case the
6773 copy constructor is trivial but not callable. */
6774 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
6775 force_rvalue (arg, complain);
6777 /* [expr.call] 5.2.2/7:
6778 Passing a potentially-evaluated argument of class type (Clause 9)
6779 with a non-trivial copy constructor or a non-trivial destructor
6780 with no corresponding parameter is conditionally-supported, with
6781 implementation-defined semantics.
6783 We support it as pass-by-invisible-reference, just like a normal
6784 value parameter.
6786 If the call appears in the context of a sizeof expression,
6787 it is not potentially-evaluated. */
6788 if (cp_unevaluated_operand == 0
6789 && (type_has_nontrivial_copy_init (arg_type)
6790 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
6792 if (complain & tf_warning)
6793 warning (OPT_Wconditionally_supported,
6794 "passing objects of non-trivially-copyable "
6795 "type %q#T through %<...%> is conditionally supported",
6796 arg_type);
6797 return cp_build_addr_expr (arg, complain);
6801 return arg;
6804 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6806 tree
6807 build_x_va_arg (source_location loc, tree expr, tree type)
6809 if (processing_template_decl)
6811 tree r = build_min (VA_ARG_EXPR, type, expr);
6812 SET_EXPR_LOCATION (r, loc);
6813 return r;
6816 type = complete_type_or_else (type, NULL_TREE);
6818 if (expr == error_mark_node || !type)
6819 return error_mark_node;
6821 expr = mark_lvalue_use (expr);
6823 if (TREE_CODE (type) == REFERENCE_TYPE)
6825 error ("cannot receive reference type %qT through %<...%>", type);
6826 return error_mark_node;
6829 if (type_has_nontrivial_copy_init (type)
6830 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
6832 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
6833 it as pass by invisible reference. */
6834 warning_at (loc, OPT_Wconditionally_supported,
6835 "receiving objects of non-trivially-copyable type %q#T "
6836 "through %<...%> is conditionally-supported", type);
6838 tree ref = cp_build_reference_type (type, false);
6839 expr = build_va_arg (loc, expr, ref);
6840 return convert_from_reference (expr);
6843 return build_va_arg (loc, expr, type);
6846 /* TYPE has been given to va_arg. Apply the default conversions which
6847 would have happened when passed via ellipsis. Return the promoted
6848 type, or the passed type if there is no change. */
6850 tree
6851 cxx_type_promotes_to (tree type)
6853 tree promote;
6855 /* Perform the array-to-pointer and function-to-pointer
6856 conversions. */
6857 type = type_decays_to (type);
6859 promote = type_promotes_to (type);
6860 if (same_type_p (type, promote))
6861 promote = type;
6863 return promote;
6866 /* ARG is a default argument expression being passed to a parameter of
6867 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6868 zero-based argument number. Do any required conversions. Return
6869 the converted value. */
6871 static GTY(()) vec<tree, va_gc> *default_arg_context;
6872 void
6873 push_defarg_context (tree fn)
6874 { vec_safe_push (default_arg_context, fn); }
6876 void
6877 pop_defarg_context (void)
6878 { default_arg_context->pop (); }
6880 tree
6881 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
6882 tsubst_flags_t complain)
6884 int i;
6885 tree t;
6887 /* See through clones. */
6888 fn = DECL_ORIGIN (fn);
6890 /* Detect recursion. */
6891 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
6892 if (t == fn)
6894 if (complain & tf_error)
6895 error ("recursive evaluation of default argument for %q#D", fn);
6896 return error_mark_node;
6899 /* If the ARG is an unparsed default argument expression, the
6900 conversion cannot be performed. */
6901 if (TREE_CODE (arg) == DEFAULT_ARG)
6903 if (complain & tf_error)
6904 error ("call to %qD uses the default argument for parameter %P, which "
6905 "is not yet defined", fn, parmnum);
6906 return error_mark_node;
6909 push_defarg_context (fn);
6911 if (fn && DECL_TEMPLATE_INFO (fn))
6912 arg = tsubst_default_argument (fn, type, arg, complain);
6914 /* Due to:
6916 [dcl.fct.default]
6918 The names in the expression are bound, and the semantic
6919 constraints are checked, at the point where the default
6920 expressions appears.
6922 we must not perform access checks here. */
6923 push_deferring_access_checks (dk_no_check);
6924 /* We must make a copy of ARG, in case subsequent processing
6925 alters any part of it. */
6926 arg = break_out_target_exprs (arg);
6927 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
6928 ICR_DEFAULT_ARGUMENT, fn, parmnum,
6929 complain);
6930 arg = convert_for_arg_passing (type, arg, complain);
6931 pop_deferring_access_checks();
6933 pop_defarg_context ();
6935 return arg;
6938 /* Returns the type which will really be used for passing an argument of
6939 type TYPE. */
6941 tree
6942 type_passed_as (tree type)
6944 /* Pass classes with copy ctors by invisible reference. */
6945 if (TREE_ADDRESSABLE (type))
6947 type = build_reference_type (type);
6948 /* There are no other pointers to this temporary. */
6949 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
6951 else if (targetm.calls.promote_prototypes (type)
6952 && INTEGRAL_TYPE_P (type)
6953 && COMPLETE_TYPE_P (type)
6954 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
6955 type = integer_type_node;
6957 return type;
6960 /* Actually perform the appropriate conversion. */
6962 tree
6963 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
6965 tree bitfield_type;
6967 /* If VAL is a bitfield, then -- since it has already been converted
6968 to TYPE -- it cannot have a precision greater than TYPE.
6970 If it has a smaller precision, we must widen it here. For
6971 example, passing "int f:3;" to a function expecting an "int" will
6972 not result in any conversion before this point.
6974 If the precision is the same we must not risk widening. For
6975 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6976 often have type "int", even though the C++ type for the field is
6977 "long long". If the value is being passed to a function
6978 expecting an "int", then no conversions will be required. But,
6979 if we call convert_bitfield_to_declared_type, the bitfield will
6980 be converted to "long long". */
6981 bitfield_type = is_bitfield_expr_with_lowered_type (val);
6982 if (bitfield_type
6983 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
6984 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
6986 if (val == error_mark_node)
6988 /* Pass classes with copy ctors by invisible reference. */
6989 else if (TREE_ADDRESSABLE (type))
6990 val = build1 (ADDR_EXPR, build_reference_type (type), val);
6991 else if (targetm.calls.promote_prototypes (type)
6992 && INTEGRAL_TYPE_P (type)
6993 && COMPLETE_TYPE_P (type)
6994 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
6995 val = cp_perform_integral_promotions (val, complain);
6996 if ((complain & tf_warning)
6997 && warn_suggest_attribute_format)
6999 tree rhstype = TREE_TYPE (val);
7000 const enum tree_code coder = TREE_CODE (rhstype);
7001 const enum tree_code codel = TREE_CODE (type);
7002 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7003 && coder == codel
7004 && check_missing_format_attribute (type, rhstype))
7005 warning (OPT_Wsuggest_attribute_format,
7006 "argument of function call might be a candidate for a format attribute");
7008 return val;
7011 /* Returns true iff FN is a function with magic varargs, i.e. ones for
7012 which no conversions at all should be done. This is true for some
7013 builtins which don't act like normal functions. */
7015 bool
7016 magic_varargs_p (tree fn)
7018 if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE)
7019 return true;
7021 if (DECL_BUILT_IN (fn))
7022 switch (DECL_FUNCTION_CODE (fn))
7024 case BUILT_IN_CLASSIFY_TYPE:
7025 case BUILT_IN_CONSTANT_P:
7026 case BUILT_IN_NEXT_ARG:
7027 case BUILT_IN_VA_START:
7028 return true;
7030 default:;
7031 return lookup_attribute ("type generic",
7032 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7035 return false;
7038 /* Returns the decl of the dispatcher function if FN is a function version. */
7040 tree
7041 get_function_version_dispatcher (tree fn)
7043 tree dispatcher_decl = NULL;
7045 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7046 && DECL_FUNCTION_VERSIONED (fn));
7048 gcc_assert (targetm.get_function_versions_dispatcher);
7049 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7051 if (dispatcher_decl == NULL)
7053 error_at (input_location, "use of multiversioned function "
7054 "without a default");
7055 return NULL;
7058 retrofit_lang_decl (dispatcher_decl);
7059 gcc_assert (dispatcher_decl != NULL);
7060 return dispatcher_decl;
7063 /* fn is a function version dispatcher that is marked used. Mark all the
7064 semantically identical function versions it will dispatch as used. */
7066 void
7067 mark_versions_used (tree fn)
7069 struct cgraph_node *node;
7070 struct cgraph_function_version_info *node_v;
7071 struct cgraph_function_version_info *it_v;
7073 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7075 node = cgraph_node::get (fn);
7076 if (node == NULL)
7077 return;
7079 gcc_assert (node->dispatcher_function);
7081 node_v = node->function_version ();
7082 if (node_v == NULL)
7083 return;
7085 /* All semantically identical versions are chained. Traverse and mark each
7086 one of them as used. */
7087 it_v = node_v->next;
7088 while (it_v != NULL)
7090 mark_used (it_v->this_node->decl);
7091 it_v = it_v->next;
7095 /* Build a call to "the copy constructor" for the type of A, even if it
7096 wouldn't be selected by normal overload resolution. Used for
7097 diagnostics. */
7099 static tree
7100 call_copy_ctor (tree a, tsubst_flags_t complain)
7102 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7103 tree binfo = TYPE_BINFO (ctype);
7104 tree copy = get_copy_ctor (ctype, complain);
7105 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7106 tree ob = build_dummy_object (ctype);
7107 vec<tree, va_gc>* args = make_tree_vector_single (a);
7108 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7109 LOOKUP_NORMAL, NULL, complain);
7110 release_tree_vector (args);
7111 return r;
7114 /* Return true iff T refers to a base field. */
7116 static bool
7117 is_base_field_ref (tree t)
7119 STRIP_NOPS (t);
7120 if (TREE_CODE (t) == ADDR_EXPR)
7121 t = TREE_OPERAND (t, 0);
7122 if (TREE_CODE (t) == COMPONENT_REF)
7123 t = TREE_OPERAND (t, 1);
7124 if (TREE_CODE (t) == FIELD_DECL)
7125 return DECL_FIELD_IS_BASE (t);
7126 return false;
7129 /* We can't elide a copy from a function returning by value to a base
7130 subobject, as the callee might clobber tail padding. Return true iff this
7131 could be that case. */
7133 static bool
7134 unsafe_copy_elision_p (tree target, tree exp)
7136 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7137 if (type == CLASSTYPE_AS_BASE (type))
7138 return false;
7139 if (!is_base_field_ref (target)
7140 && resolves_to_fixed_type_p (target, NULL))
7141 return false;
7142 tree init = TARGET_EXPR_INITIAL (exp);
7143 return (TREE_CODE (init) == AGGR_INIT_EXPR
7144 && !AGGR_INIT_VIA_CTOR_P (init));
7147 /* Subroutine of the various build_*_call functions. Overload resolution
7148 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7149 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7150 bitmask of various LOOKUP_* flags which apply to the call itself. */
7152 static tree
7153 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7155 tree fn = cand->fn;
7156 const vec<tree, va_gc> *args = cand->args;
7157 tree first_arg = cand->first_arg;
7158 conversion **convs = cand->convs;
7159 conversion *conv;
7160 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7161 int parmlen;
7162 tree val;
7163 int i = 0;
7164 int j = 0;
7165 unsigned int arg_index = 0;
7166 int is_method = 0;
7167 int nargs;
7168 tree *argarray;
7169 bool already_used = false;
7171 /* In a template, there is no need to perform all of the work that
7172 is normally done. We are only interested in the type of the call
7173 expression, i.e., the return type of the function. Any semantic
7174 errors will be deferred until the template is instantiated. */
7175 if (processing_template_decl)
7177 tree expr, addr;
7178 tree return_type;
7179 const tree *argarray;
7180 unsigned int nargs;
7182 return_type = TREE_TYPE (TREE_TYPE (fn));
7183 nargs = vec_safe_length (args);
7184 if (first_arg == NULL_TREE)
7185 argarray = args->address ();
7186 else
7188 tree *alcarray;
7189 unsigned int ix;
7190 tree arg;
7192 ++nargs;
7193 alcarray = XALLOCAVEC (tree, nargs);
7194 alcarray[0] = build_this (first_arg);
7195 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7196 alcarray[ix + 1] = arg;
7197 argarray = alcarray;
7200 addr = build_addr_func (fn, complain);
7201 if (addr == error_mark_node)
7202 return error_mark_node;
7203 expr = build_call_array_loc (input_location, return_type,
7204 addr, nargs, argarray);
7205 if (TREE_THIS_VOLATILE (fn) && cfun)
7206 current_function_returns_abnormally = 1;
7207 return convert_from_reference (expr);
7210 /* Give any warnings we noticed during overload resolution. */
7211 if (cand->warnings && (complain & tf_warning))
7213 struct candidate_warning *w;
7214 for (w = cand->warnings; w; w = w->next)
7215 joust (cand, w->loser, 1, complain);
7218 /* Make =delete work with SFINAE. */
7219 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7220 return error_mark_node;
7222 if (DECL_FUNCTION_MEMBER_P (fn))
7224 tree access_fn;
7225 /* If FN is a template function, two cases must be considered.
7226 For example:
7228 struct A {
7229 protected:
7230 template <class T> void f();
7232 template <class T> struct B {
7233 protected:
7234 void g();
7236 struct C : A, B<int> {
7237 using A::f; // #1
7238 using B<int>::g; // #2
7241 In case #1 where `A::f' is a member template, DECL_ACCESS is
7242 recorded in the primary template but not in its specialization.
7243 We check access of FN using its primary template.
7245 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7246 because it is a member of class template B, DECL_ACCESS is
7247 recorded in the specialization `B<int>::g'. We cannot use its
7248 primary template because `B<T>::g' and `B<int>::g' may have
7249 different access. */
7250 if (DECL_TEMPLATE_INFO (fn)
7251 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7252 access_fn = DECL_TI_TEMPLATE (fn);
7253 else
7254 access_fn = fn;
7255 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7256 fn, complain))
7257 return error_mark_node;
7260 /* If we're checking for implicit delete, don't bother with argument
7261 conversions. */
7262 if (flags & LOOKUP_SPECULATIVE)
7264 if (DECL_DELETED_FN (fn))
7266 if (complain & tf_error)
7267 mark_used (fn);
7268 return error_mark_node;
7270 if (cand->viable == 1)
7271 return fn;
7272 else if (!(complain & tf_error))
7273 /* Reject bad conversions now. */
7274 return error_mark_node;
7275 /* else continue to get conversion error. */
7278 /* N3276 magic doesn't apply to nested calls. */
7279 int decltype_flag = (complain & tf_decltype);
7280 complain &= ~tf_decltype;
7282 /* Find maximum size of vector to hold converted arguments. */
7283 parmlen = list_length (parm);
7284 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7285 if (parmlen > nargs)
7286 nargs = parmlen;
7287 argarray = XALLOCAVEC (tree, nargs);
7289 /* The implicit parameters to a constructor are not considered by overload
7290 resolution, and must be of the proper type. */
7291 if (DECL_CONSTRUCTOR_P (fn))
7293 tree object_arg;
7294 if (first_arg != NULL_TREE)
7296 object_arg = first_arg;
7297 first_arg = NULL_TREE;
7299 else
7301 object_arg = (*args)[arg_index];
7302 ++arg_index;
7304 argarray[j++] = build_this (object_arg);
7305 parm = TREE_CHAIN (parm);
7306 /* We should never try to call the abstract constructor. */
7307 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7309 if (DECL_HAS_VTT_PARM_P (fn))
7311 argarray[j++] = (*args)[arg_index];
7312 ++arg_index;
7313 parm = TREE_CHAIN (parm);
7316 /* Bypass access control for 'this' parameter. */
7317 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7319 tree parmtype = TREE_VALUE (parm);
7320 tree arg = build_this (first_arg != NULL_TREE
7321 ? first_arg
7322 : (*args)[arg_index]);
7323 tree argtype = TREE_TYPE (arg);
7324 tree converted_arg;
7325 tree base_binfo;
7327 if (convs[i]->bad_p)
7329 if (complain & tf_error)
7331 if (permerror (input_location, "passing %qT as %<this%> "
7332 "argument discards qualifiers",
7333 TREE_TYPE (argtype)))
7334 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7336 else
7337 return error_mark_node;
7340 /* See if the function member or the whole class type is declared
7341 final and the call can be devirtualized. */
7342 if (DECL_FINAL_P (fn)
7343 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7344 flags |= LOOKUP_NONVIRTUAL;
7346 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7347 X is called for an object that is not of type X, or of a type
7348 derived from X, the behavior is undefined.
7350 So we can assume that anything passed as 'this' is non-null, and
7351 optimize accordingly. */
7352 gcc_assert (TYPE_PTR_P (parmtype));
7353 /* Convert to the base in which the function was declared. */
7354 gcc_assert (cand->conversion_path != NULL_TREE);
7355 converted_arg = build_base_path (PLUS_EXPR,
7356 arg,
7357 cand->conversion_path,
7358 1, complain);
7359 /* Check that the base class is accessible. */
7360 if (!accessible_base_p (TREE_TYPE (argtype),
7361 BINFO_TYPE (cand->conversion_path), true))
7363 if (complain & tf_error)
7364 error ("%qT is not an accessible base of %qT",
7365 BINFO_TYPE (cand->conversion_path),
7366 TREE_TYPE (argtype));
7367 else
7368 return error_mark_node;
7370 /* If fn was found by a using declaration, the conversion path
7371 will be to the derived class, not the base declaring fn. We
7372 must convert from derived to base. */
7373 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7374 TREE_TYPE (parmtype), ba_unique,
7375 NULL, complain);
7376 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7377 base_binfo, 1, complain);
7379 argarray[j++] = converted_arg;
7380 parm = TREE_CHAIN (parm);
7381 if (first_arg != NULL_TREE)
7382 first_arg = NULL_TREE;
7383 else
7384 ++arg_index;
7385 ++i;
7386 is_method = 1;
7389 gcc_assert (first_arg == NULL_TREE);
7390 for (; arg_index < vec_safe_length (args) && parm;
7391 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7393 tree type = TREE_VALUE (parm);
7394 tree arg = (*args)[arg_index];
7395 bool conversion_warning = true;
7397 conv = convs[i];
7399 /* If the argument is NULL and used to (implicitly) instantiate a
7400 template function (and bind one of the template arguments to
7401 the type of 'long int'), we don't want to warn about passing NULL
7402 to non-pointer argument.
7403 For example, if we have this template function:
7405 template<typename T> void func(T x) {}
7407 we want to warn (when -Wconversion is enabled) in this case:
7409 void foo() {
7410 func<int>(NULL);
7413 but not in this case:
7415 void foo() {
7416 func(NULL);
7419 if (arg == null_node
7420 && DECL_TEMPLATE_INFO (fn)
7421 && cand->template_decl
7422 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7423 conversion_warning = false;
7425 /* Warn about initializer_list deduction that isn't currently in the
7426 working draft. */
7427 if (cxx_dialect > cxx98
7428 && flag_deduce_init_list
7429 && cand->template_decl
7430 && is_std_init_list (non_reference (type))
7431 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7433 tree tmpl = TI_TEMPLATE (cand->template_decl);
7434 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7435 tree patparm = get_pattern_parm (realparm, tmpl);
7436 tree pattype = TREE_TYPE (patparm);
7437 if (PACK_EXPANSION_P (pattype))
7438 pattype = PACK_EXPANSION_PATTERN (pattype);
7439 pattype = non_reference (pattype);
7441 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7442 && (cand->explicit_targs == NULL_TREE
7443 || (TREE_VEC_LENGTH (cand->explicit_targs)
7444 <= TEMPLATE_TYPE_IDX (pattype))))
7446 pedwarn (input_location, 0, "deducing %qT as %qT",
7447 non_reference (TREE_TYPE (patparm)),
7448 non_reference (type));
7449 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7450 " in call to %qD", cand->fn);
7451 pedwarn (input_location, 0,
7452 " (you can disable this with -fno-deduce-init-list)");
7455 val = convert_like_with_context (conv, arg, fn, i - is_method,
7456 conversion_warning
7457 ? complain
7458 : complain & (~tf_warning));
7460 val = convert_for_arg_passing (type, val, complain);
7462 if (val == error_mark_node)
7463 return error_mark_node;
7464 else
7465 argarray[j++] = val;
7468 /* Default arguments */
7469 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7471 if (TREE_VALUE (parm) == error_mark_node)
7472 return error_mark_node;
7473 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
7474 TREE_PURPOSE (parm),
7475 fn, i - is_method,
7476 complain);
7479 /* Ellipsis */
7480 for (; arg_index < vec_safe_length (args); ++arg_index)
7482 tree a = (*args)[arg_index];
7483 if (magic_varargs_p (fn))
7484 /* Do no conversions for magic varargs. */
7485 a = mark_type_use (a);
7486 else if (DECL_CONSTRUCTOR_P (fn)
7487 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7488 TREE_TYPE (a)))
7490 /* Avoid infinite recursion trying to call A(...). */
7491 if (complain & tf_error)
7492 /* Try to call the actual copy constructor for a good error. */
7493 call_copy_ctor (a, complain);
7494 return error_mark_node;
7496 else
7497 a = convert_arg_to_ellipsis (a, complain);
7498 argarray[j++] = a;
7501 gcc_assert (j <= nargs);
7502 nargs = j;
7504 /* Avoid to do argument-transformation, if warnings for format, and for
7505 nonnull are disabled. Just in case that at least one of them is active
7506 the check_function_arguments function might warn about something. */
7508 if (warn_nonnull || warn_format || warn_suggest_attribute_format)
7510 tree *fargs = (!nargs ? argarray
7511 : (tree *) alloca (nargs * sizeof (tree)));
7512 for (j = 0; j < nargs; j++)
7513 fargs[j] = maybe_constant_value (argarray[j]);
7515 check_function_arguments (TREE_TYPE (fn), nargs, fargs);
7518 /* Avoid actually calling copy constructors and copy assignment operators,
7519 if possible. */
7521 if (! flag_elide_constructors)
7522 /* Do things the hard way. */;
7523 else if (cand->num_convs == 1
7524 && (DECL_COPY_CONSTRUCTOR_P (fn)
7525 || DECL_MOVE_CONSTRUCTOR_P (fn))
7526 /* It's unsafe to elide the constructor when handling
7527 a noexcept-expression, it may evaluate to the wrong
7528 value (c++/53025). */
7529 && cp_noexcept_operand == 0)
7531 tree targ;
7532 tree arg = argarray[num_artificial_parms_for (fn)];
7533 tree fa;
7534 bool trivial = trivial_fn_p (fn);
7536 /* Pull out the real argument, disregarding const-correctness. */
7537 targ = arg;
7538 while (CONVERT_EXPR_P (targ)
7539 || TREE_CODE (targ) == NON_LVALUE_EXPR)
7540 targ = TREE_OPERAND (targ, 0);
7541 if (TREE_CODE (targ) == ADDR_EXPR)
7543 targ = TREE_OPERAND (targ, 0);
7544 if (!same_type_ignoring_top_level_qualifiers_p
7545 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
7546 targ = NULL_TREE;
7548 else
7549 targ = NULL_TREE;
7551 if (targ)
7552 arg = targ;
7553 else
7554 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
7556 /* [class.copy]: the copy constructor is implicitly defined even if
7557 the implementation elided its use. */
7558 if (!trivial || DECL_DELETED_FN (fn))
7560 if (!mark_used (fn, complain) && !(complain & tf_error))
7561 return error_mark_node;
7562 already_used = true;
7565 /* If we're creating a temp and we already have one, don't create a
7566 new one. If we're not creating a temp but we get one, use
7567 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7568 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7569 temp or an INIT_EXPR otherwise. */
7570 fa = argarray[0];
7571 if (is_dummy_object (fa))
7573 if (TREE_CODE (arg) == TARGET_EXPR)
7574 return arg;
7575 else if (trivial)
7576 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
7578 else if (trivial
7579 || (TREE_CODE (arg) == TARGET_EXPR
7580 && !unsafe_copy_elision_p (fa, arg)))
7582 tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL,
7583 complain));
7585 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
7586 return val;
7589 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
7590 && trivial_fn_p (fn)
7591 && !DECL_DELETED_FN (fn))
7593 tree to = stabilize_reference
7594 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
7595 tree type = TREE_TYPE (to);
7596 tree as_base = CLASSTYPE_AS_BASE (type);
7597 tree arg = argarray[1];
7599 if (is_really_empty_class (type))
7601 /* Avoid copying empty classes. */
7602 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
7603 TREE_NO_WARNING (val) = 1;
7604 val = build2 (COMPOUND_EXPR, type, val, to);
7605 TREE_NO_WARNING (val) = 1;
7607 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
7609 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
7610 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
7612 else
7614 /* We must only copy the non-tail padding parts. */
7615 tree arg0, arg2, t;
7616 tree array_type, alias_set;
7618 arg2 = TYPE_SIZE_UNIT (as_base);
7619 arg0 = cp_build_addr_expr (to, complain);
7621 array_type = build_array_type (char_type_node,
7622 build_index_type
7623 (size_binop (MINUS_EXPR,
7624 arg2, size_int (1))));
7625 alias_set = build_int_cst (build_pointer_type (type), 0);
7626 t = build2 (MODIFY_EXPR, void_type_node,
7627 build2 (MEM_REF, array_type, arg0, alias_set),
7628 build2 (MEM_REF, array_type, arg, alias_set));
7629 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
7630 TREE_NO_WARNING (val) = 1;
7633 return val;
7635 else if (DECL_DESTRUCTOR_P (fn)
7636 && trivial_fn_p (fn)
7637 && !DECL_DELETED_FN (fn))
7638 return fold_convert (void_type_node, argarray[0]);
7639 /* FIXME handle trivial default constructor, too. */
7641 /* For calls to a multi-versioned function, overload resolution
7642 returns the function with the highest target priority, that is,
7643 the version that will checked for dispatching first. If this
7644 version is inlinable, a direct call to this version can be made
7645 otherwise the call should go through the dispatcher. */
7647 if (DECL_FUNCTION_VERSIONED (fn)
7648 && (current_function_decl == NULL
7649 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
7651 fn = get_function_version_dispatcher (fn);
7652 if (fn == NULL)
7653 return NULL;
7654 if (!already_used)
7655 mark_versions_used (fn);
7658 if (!already_used
7659 && !mark_used (fn, complain))
7660 return error_mark_node;
7662 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
7663 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
7664 virtual functions can't be constexpr. */
7665 && !in_template_function ())
7667 tree t;
7668 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
7669 DECL_CONTEXT (fn),
7670 ba_any, NULL, complain);
7671 gcc_assert (binfo && binfo != error_mark_node);
7673 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
7674 complain);
7675 if (TREE_SIDE_EFFECTS (argarray[0]))
7676 argarray[0] = save_expr (argarray[0]);
7677 t = build_pointer_type (TREE_TYPE (fn));
7678 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
7679 fn = build_java_interface_fn_ref (fn, argarray[0]);
7680 else
7681 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
7682 TREE_TYPE (fn) = t;
7684 else
7686 fn = build_addr_func (fn, complain);
7687 if (fn == error_mark_node)
7688 return error_mark_node;
7691 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
7692 if (TREE_CODE (call) == CALL_EXPR
7693 && (cand->flags & LOOKUP_LIST_INIT_CTOR))
7694 CALL_EXPR_LIST_INIT_P (call) = true;
7695 return call;
7698 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7699 This function performs no overload resolution, conversion, or other
7700 high-level operations. */
7702 tree
7703 build_cxx_call (tree fn, int nargs, tree *argarray,
7704 tsubst_flags_t complain)
7706 tree fndecl;
7708 /* Remember roughly where this call is. */
7709 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
7710 fn = build_call_a (fn, nargs, argarray);
7711 SET_EXPR_LOCATION (fn, loc);
7713 fndecl = get_callee_fndecl (fn);
7715 /* Check that arguments to builtin functions match the expectations. */
7716 if (fndecl
7717 && DECL_BUILT_IN (fndecl)
7718 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
7720 int i;
7722 /* We need to take care that values to BUILT_IN_NORMAL
7723 are reduced. */
7724 for (i = 0; i < nargs; i++)
7725 argarray[i] = maybe_constant_value (argarray[i]);
7727 if (!check_builtin_function_arguments (fndecl, nargs, argarray))
7728 return error_mark_node;
7731 /* If it is a built-in array notation function, then the return type of
7732 the function is the element type of the array passed in as array
7733 notation (i.e. the first parameter of the function). */
7734 if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR)
7736 enum built_in_function bif =
7737 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn));
7738 if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7739 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7740 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7741 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7742 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE
7743 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING)
7745 if (call_expr_nargs (fn) == 0)
7747 error_at (EXPR_LOCATION (fn), "Invalid builtin arguments");
7748 return error_mark_node;
7750 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7751 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7752 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7753 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7754 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7755 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7756 The pre-defined return-type is the correct one. */
7757 tree array_ntn = CALL_EXPR_ARG (fn, 0);
7758 TREE_TYPE (fn) = TREE_TYPE (array_ntn);
7759 return fn;
7763 if (VOID_TYPE_P (TREE_TYPE (fn)))
7764 return fn;
7766 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7767 function call is either the operand of a decltype-specifier or the
7768 right operand of a comma operator that is the operand of a
7769 decltype-specifier, a temporary object is not introduced for the
7770 prvalue. The type of the prvalue may be incomplete. */
7771 if (!(complain & tf_decltype))
7773 fn = require_complete_type_sfinae (fn, complain);
7774 if (fn == error_mark_node)
7775 return error_mark_node;
7777 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
7778 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
7780 return convert_from_reference (fn);
7783 static GTY(()) tree java_iface_lookup_fn;
7785 /* Make an expression which yields the address of the Java interface
7786 method FN. This is achieved by generating a call to libjava's
7787 _Jv_LookupInterfaceMethodIdx(). */
7789 static tree
7790 build_java_interface_fn_ref (tree fn, tree instance)
7792 tree lookup_fn, method, idx;
7793 tree klass_ref, iface, iface_ref;
7794 int i;
7796 if (!java_iface_lookup_fn)
7798 tree ftype = build_function_type_list (ptr_type_node,
7799 ptr_type_node, ptr_type_node,
7800 java_int_type_node, NULL_TREE);
7801 java_iface_lookup_fn
7802 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype,
7803 0, NOT_BUILT_IN, NULL, NULL_TREE);
7806 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7807 This is the first entry in the vtable. */
7808 klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL,
7809 tf_warning_or_error),
7810 integer_zero_node);
7812 /* Get the java.lang.Class pointer for the interface being called. */
7813 iface = DECL_CONTEXT (fn);
7814 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
7815 if (!iface_ref || !VAR_P (iface_ref)
7816 || DECL_CONTEXT (iface_ref) != iface)
7818 error ("could not find class$ field in java interface type %qT",
7819 iface);
7820 return error_mark_node;
7822 iface_ref = build_address (iface_ref);
7823 iface_ref = convert (build_pointer_type (iface), iface_ref);
7825 /* Determine the itable index of FN. */
7826 i = 1;
7827 for (method = TYPE_METHODS (iface); method; method = DECL_CHAIN (method))
7829 if (!DECL_VIRTUAL_P (method))
7830 continue;
7831 if (fn == method)
7832 break;
7833 i++;
7835 idx = build_int_cst (NULL_TREE, i);
7837 lookup_fn = build1 (ADDR_EXPR,
7838 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
7839 java_iface_lookup_fn);
7840 return build_call_nary (ptr_type_node, lookup_fn,
7841 3, klass_ref, iface_ref, idx);
7844 /* Returns the value to use for the in-charge parameter when making a
7845 call to a function with the indicated NAME.
7847 FIXME:Can't we find a neater way to do this mapping? */
7849 tree
7850 in_charge_arg_for_name (tree name)
7852 if (name == base_ctor_identifier
7853 || name == base_dtor_identifier)
7854 return integer_zero_node;
7855 else if (name == complete_ctor_identifier)
7856 return integer_one_node;
7857 else if (name == complete_dtor_identifier)
7858 return integer_two_node;
7859 else if (name == deleting_dtor_identifier)
7860 return integer_three_node;
7862 /* This function should only be called with one of the names listed
7863 above. */
7864 gcc_unreachable ();
7865 return NULL_TREE;
7868 /* Build a call to a constructor, destructor, or an assignment
7869 operator for INSTANCE, an expression with class type. NAME
7870 indicates the special member function to call; *ARGS are the
7871 arguments. ARGS may be NULL. This may change ARGS. BINFO
7872 indicates the base of INSTANCE that is to be passed as the `this'
7873 parameter to the member function called.
7875 FLAGS are the LOOKUP_* flags to use when processing the call.
7877 If NAME indicates a complete object constructor, INSTANCE may be
7878 NULL_TREE. In this case, the caller will call build_cplus_new to
7879 store the newly constructed object into a VAR_DECL. */
7881 tree
7882 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
7883 tree binfo, int flags, tsubst_flags_t complain)
7885 tree fns;
7886 /* The type of the subobject to be constructed or destroyed. */
7887 tree class_type;
7888 vec<tree, va_gc> *allocated = NULL;
7889 tree ret;
7891 gcc_assert (name == complete_ctor_identifier
7892 || name == base_ctor_identifier
7893 || name == complete_dtor_identifier
7894 || name == base_dtor_identifier
7895 || name == deleting_dtor_identifier
7896 || name == ansi_assopname (NOP_EXPR));
7897 if (TYPE_P (binfo))
7899 /* Resolve the name. */
7900 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
7901 return error_mark_node;
7903 binfo = TYPE_BINFO (binfo);
7906 gcc_assert (binfo != NULL_TREE);
7908 class_type = BINFO_TYPE (binfo);
7910 /* Handle the special case where INSTANCE is NULL_TREE. */
7911 if (name == complete_ctor_identifier && !instance)
7912 instance = build_dummy_object (class_type);
7913 else
7915 if (name == complete_dtor_identifier
7916 || name == base_dtor_identifier
7917 || name == deleting_dtor_identifier)
7918 gcc_assert (args == NULL || vec_safe_is_empty (*args));
7920 /* Convert to the base class, if necessary. */
7921 if (!same_type_ignoring_top_level_qualifiers_p
7922 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
7924 if (name != ansi_assopname (NOP_EXPR))
7925 /* For constructors and destructors, either the base is
7926 non-virtual, or it is virtual but we are doing the
7927 conversion from a constructor or destructor for the
7928 complete object. In either case, we can convert
7929 statically. */
7930 instance = convert_to_base_statically (instance, binfo);
7931 else
7932 /* However, for assignment operators, we must convert
7933 dynamically if the base is virtual. */
7934 instance = build_base_path (PLUS_EXPR, instance,
7935 binfo, /*nonnull=*/1, complain);
7939 gcc_assert (instance != NULL_TREE);
7941 fns = lookup_fnfields (binfo, name, 1);
7943 /* When making a call to a constructor or destructor for a subobject
7944 that uses virtual base classes, pass down a pointer to a VTT for
7945 the subobject. */
7946 if ((name == base_ctor_identifier
7947 || name == base_dtor_identifier)
7948 && CLASSTYPE_VBASECLASSES (class_type))
7950 tree vtt;
7951 tree sub_vtt;
7953 /* If the current function is a complete object constructor
7954 or destructor, then we fetch the VTT directly.
7955 Otherwise, we look it up using the VTT we were given. */
7956 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
7957 vtt = decay_conversion (vtt, complain);
7958 if (vtt == error_mark_node)
7959 return error_mark_node;
7960 vtt = build3 (COND_EXPR, TREE_TYPE (vtt),
7961 build2 (EQ_EXPR, boolean_type_node,
7962 current_in_charge_parm, integer_zero_node),
7963 current_vtt_parm,
7964 vtt);
7965 if (BINFO_SUBVTT_INDEX (binfo))
7966 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
7967 else
7968 sub_vtt = vtt;
7970 if (args == NULL)
7972 allocated = make_tree_vector ();
7973 args = &allocated;
7976 vec_safe_insert (*args, 0, sub_vtt);
7979 ret = build_new_method_call (instance, fns, args,
7980 TYPE_BINFO (BINFO_TYPE (binfo)),
7981 flags, /*fn=*/NULL,
7982 complain);
7984 if (allocated != NULL)
7985 release_tree_vector (allocated);
7987 if ((complain & tf_error)
7988 && (flags & LOOKUP_DELEGATING_CONS)
7989 && name == complete_ctor_identifier
7990 && TREE_CODE (ret) == CALL_EXPR
7991 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret), 0))
7992 == current_function_decl))
7993 error ("constructor delegates to itself");
7995 return ret;
7998 /* Return the NAME, as a C string. The NAME indicates a function that
7999 is a member of TYPE. *FREE_P is set to true if the caller must
8000 free the memory returned.
8002 Rather than go through all of this, we should simply set the names
8003 of constructors and destructors appropriately, and dispense with
8004 ctor_identifier, dtor_identifier, etc. */
8006 static char *
8007 name_as_c_string (tree name, tree type, bool *free_p)
8009 char *pretty_name;
8011 /* Assume that we will not allocate memory. */
8012 *free_p = false;
8013 /* Constructors and destructors are special. */
8014 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
8016 pretty_name
8017 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
8018 /* For a destructor, add the '~'. */
8019 if (name == complete_dtor_identifier
8020 || name == base_dtor_identifier
8021 || name == deleting_dtor_identifier)
8023 pretty_name = concat ("~", pretty_name, NULL);
8024 /* Remember that we need to free the memory allocated. */
8025 *free_p = true;
8028 else if (IDENTIFIER_TYPENAME_P (name))
8030 pretty_name = concat ("operator ",
8031 type_as_string_translate (TREE_TYPE (name),
8032 TFF_PLAIN_IDENTIFIER),
8033 NULL);
8034 /* Remember that we need to free the memory allocated. */
8035 *free_p = true;
8037 else
8038 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
8040 return pretty_name;
8043 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8044 be set, upon return, to the function called. ARGS may be NULL.
8045 This may change ARGS. */
8047 static tree
8048 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8049 tree conversion_path, int flags,
8050 tree *fn_p, tsubst_flags_t complain)
8052 struct z_candidate *candidates = 0, *cand;
8053 tree explicit_targs = NULL_TREE;
8054 tree basetype = NULL_TREE;
8055 tree access_binfo, binfo;
8056 tree optype;
8057 tree first_mem_arg = NULL_TREE;
8058 tree name;
8059 bool skip_first_for_error;
8060 vec<tree, va_gc> *user_args;
8061 tree call;
8062 tree fn;
8063 int template_only = 0;
8064 bool any_viable_p;
8065 tree orig_instance;
8066 tree orig_fns;
8067 vec<tree, va_gc> *orig_args = NULL;
8068 void *p;
8070 gcc_assert (instance != NULL_TREE);
8072 /* We don't know what function we're going to call, yet. */
8073 if (fn_p)
8074 *fn_p = NULL_TREE;
8076 if (error_operand_p (instance)
8077 || !fns || error_operand_p (fns))
8078 return error_mark_node;
8080 if (!BASELINK_P (fns))
8082 if (complain & tf_error)
8083 error ("call to non-function %qD", fns);
8084 return error_mark_node;
8087 orig_instance = instance;
8088 orig_fns = fns;
8090 /* Dismantle the baselink to collect all the information we need. */
8091 if (!conversion_path)
8092 conversion_path = BASELINK_BINFO (fns);
8093 access_binfo = BASELINK_ACCESS_BINFO (fns);
8094 binfo = BASELINK_BINFO (fns);
8095 optype = BASELINK_OPTYPE (fns);
8096 fns = BASELINK_FUNCTIONS (fns);
8097 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8099 explicit_targs = TREE_OPERAND (fns, 1);
8100 fns = TREE_OPERAND (fns, 0);
8101 template_only = 1;
8103 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8104 || TREE_CODE (fns) == TEMPLATE_DECL
8105 || TREE_CODE (fns) == OVERLOAD);
8106 fn = get_first_fn (fns);
8107 name = DECL_NAME (fn);
8109 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8110 gcc_assert (CLASS_TYPE_P (basetype));
8112 if (processing_template_decl)
8114 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8115 instance = build_non_dependent_expr (instance);
8116 if (args != NULL)
8117 make_args_non_dependent (*args);
8120 user_args = args == NULL ? NULL : *args;
8121 /* Under DR 147 A::A() is an invalid constructor call,
8122 not a functional cast. */
8123 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
8125 if (! (complain & tf_error))
8126 return error_mark_node;
8128 if (permerror (input_location,
8129 "cannot call constructor %<%T::%D%> directly",
8130 basetype, name))
8131 inform (input_location, "for a function-style cast, remove the "
8132 "redundant %<::%D%>", name);
8133 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
8134 complain);
8135 return call;
8138 /* Figure out whether to skip the first argument for the error
8139 message we will display to users if an error occurs. We don't
8140 want to display any compiler-generated arguments. The "this"
8141 pointer hasn't been added yet. However, we must remove the VTT
8142 pointer if this is a call to a base-class constructor or
8143 destructor. */
8144 skip_first_for_error = false;
8145 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
8147 /* Callers should explicitly indicate whether they want to construct
8148 the complete object or just the part without virtual bases. */
8149 gcc_assert (name != ctor_identifier);
8150 /* Similarly for destructors. */
8151 gcc_assert (name != dtor_identifier);
8152 /* Remove the VTT pointer, if present. */
8153 if ((name == base_ctor_identifier || name == base_dtor_identifier)
8154 && CLASSTYPE_VBASECLASSES (basetype))
8155 skip_first_for_error = true;
8158 /* Process the argument list. */
8159 if (args != NULL && *args != NULL)
8161 *args = resolve_args (*args, complain);
8162 if (*args == NULL)
8163 return error_mark_node;
8166 /* Consider the object argument to be used even if we end up selecting a
8167 static member function. */
8168 instance = mark_type_use (instance);
8170 /* It's OK to call destructors and constructors on cv-qualified objects.
8171 Therefore, convert the INSTANCE to the unqualified type, if
8172 necessary. */
8173 if (DECL_DESTRUCTOR_P (fn)
8174 || DECL_CONSTRUCTOR_P (fn))
8176 if (!same_type_p (basetype, TREE_TYPE (instance)))
8178 instance = build_this (instance);
8179 instance = build_nop (build_pointer_type (basetype), instance);
8180 instance = build_fold_indirect_ref (instance);
8183 if (DECL_DESTRUCTOR_P (fn))
8184 name = complete_dtor_identifier;
8186 /* For the overload resolution we need to find the actual `this`
8187 that would be captured if the call turns out to be to a
8188 non-static member function. Do not actually capture it at this
8189 point. */
8190 if (DECL_CONSTRUCTOR_P (fn))
8191 /* Constructors don't use the enclosing 'this'. */
8192 first_mem_arg = instance;
8193 else
8194 first_mem_arg = maybe_resolve_dummy (instance, false);
8196 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8197 p = conversion_obstack_alloc (0);
8199 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8200 initializer, not T({ }). */
8201 if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !vec_safe_is_empty (*args)
8202 && DIRECT_LIST_INIT_P ((**args)[0]))
8204 tree init_list = (**args)[0];
8205 tree init = NULL_TREE;
8207 gcc_assert ((*args)->length () == 1
8208 && !(flags & LOOKUP_ONLYCONVERTING));
8210 /* If the initializer list has no elements and T is a class type with
8211 a default constructor, the object is value-initialized. Handle
8212 this here so we don't need to handle it wherever we use
8213 build_special_member_call. */
8214 if (CONSTRUCTOR_NELTS (init_list) == 0
8215 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
8216 /* For a user-provided default constructor, use the normal
8217 mechanisms so that protected access works. */
8218 && type_has_non_user_provided_default_constructor (basetype)
8219 && !processing_template_decl)
8220 init = build_value_init (basetype, complain);
8222 /* If BASETYPE is an aggregate, we need to do aggregate
8223 initialization. */
8224 else if (CP_AGGREGATE_TYPE_P (basetype))
8226 init = reshape_init (basetype, init_list, complain);
8227 init = digest_init (basetype, init, complain);
8230 if (init)
8232 if (is_dummy_object (instance))
8233 return get_target_expr_sfinae (init, complain);
8234 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
8235 TREE_SIDE_EFFECTS (init) = true;
8236 return init;
8239 /* Otherwise go ahead with overload resolution. */
8240 add_list_candidates (fns, first_mem_arg, init_list,
8241 basetype, explicit_targs, template_only,
8242 conversion_path, access_binfo, flags,
8243 &candidates, complain);
8245 else
8247 add_candidates (fns, first_mem_arg, user_args, optype,
8248 explicit_targs, template_only, conversion_path,
8249 access_binfo, flags, &candidates, complain);
8251 any_viable_p = false;
8252 candidates = splice_viable (candidates, false, &any_viable_p);
8254 if (!any_viable_p)
8256 if (complain & tf_error)
8258 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
8259 cxx_incomplete_type_error (instance, basetype);
8260 else if (optype)
8261 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8262 basetype, optype, build_tree_list_vec (user_args),
8263 TREE_TYPE (instance));
8264 else
8266 char *pretty_name;
8267 bool free_p;
8268 tree arglist;
8270 pretty_name = name_as_c_string (name, basetype, &free_p);
8271 arglist = build_tree_list_vec (user_args);
8272 if (skip_first_for_error)
8273 arglist = TREE_CHAIN (arglist);
8274 error ("no matching function for call to %<%T::%s(%A)%#V%>",
8275 basetype, pretty_name, arglist,
8276 TREE_TYPE (instance));
8277 if (free_p)
8278 free (pretty_name);
8280 print_z_candidates (location_of (name), candidates);
8282 call = error_mark_node;
8284 else
8286 cand = tourney (candidates, complain);
8287 if (cand == 0)
8289 char *pretty_name;
8290 bool free_p;
8291 tree arglist;
8293 if (complain & tf_error)
8295 pretty_name = name_as_c_string (name, basetype, &free_p);
8296 arglist = build_tree_list_vec (user_args);
8297 if (skip_first_for_error)
8298 arglist = TREE_CHAIN (arglist);
8299 if (!any_strictly_viable (candidates))
8300 error ("no matching function for call to %<%s(%A)%>",
8301 pretty_name, arglist);
8302 else
8303 error ("call of overloaded %<%s(%A)%> is ambiguous",
8304 pretty_name, arglist);
8305 print_z_candidates (location_of (name), candidates);
8306 if (free_p)
8307 free (pretty_name);
8309 call = error_mark_node;
8311 else
8313 fn = cand->fn;
8314 call = NULL_TREE;
8316 if (!(flags & LOOKUP_NONVIRTUAL)
8317 && DECL_PURE_VIRTUAL_P (fn)
8318 && instance == current_class_ref
8319 && (complain & tf_warning))
8321 /* This is not an error, it is runtime undefined
8322 behavior. */
8323 if (!current_function_decl)
8324 warning (0, "pure virtual %q#D called from "
8325 "non-static data member initializer", fn);
8326 else if (DECL_CONSTRUCTOR_P (current_function_decl)
8327 || DECL_DESTRUCTOR_P (current_function_decl))
8328 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
8329 ? "pure virtual %q#D called from constructor"
8330 : "pure virtual %q#D called from destructor"),
8331 fn);
8334 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
8335 && !DECL_CONSTRUCTOR_P (fn)
8336 && is_dummy_object (instance))
8338 instance = maybe_resolve_dummy (instance, true);
8339 if (instance == error_mark_node)
8340 call = error_mark_node;
8341 else if (!is_dummy_object (instance))
8343 /* We captured 'this' in the current lambda now that
8344 we know we really need it. */
8345 cand->first_arg = instance;
8347 else
8349 if (complain & tf_error)
8350 error ("cannot call member function %qD without object",
8351 fn);
8352 call = error_mark_node;
8356 if (call != error_mark_node)
8358 /* Optimize away vtable lookup if we know that this
8359 function can't be overridden. We need to check if
8360 the context and the type where we found fn are the same,
8361 actually FN might be defined in a different class
8362 type because of a using-declaration. In this case, we
8363 do not want to perform a non-virtual call. */
8364 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
8365 && same_type_ignoring_top_level_qualifiers_p
8366 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
8367 && resolves_to_fixed_type_p (instance, 0))
8368 flags |= LOOKUP_NONVIRTUAL;
8369 if (explicit_targs)
8370 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
8371 /* Now we know what function is being called. */
8372 if (fn_p)
8373 *fn_p = fn;
8374 /* Build the actual CALL_EXPR. */
8375 call = build_over_call (cand, flags, complain);
8376 /* In an expression of the form `a->f()' where `f' turns
8377 out to be a static member function, `a' is
8378 none-the-less evaluated. */
8379 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
8380 && !is_dummy_object (instance)
8381 && TREE_SIDE_EFFECTS (instance))
8382 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
8383 instance, call);
8384 else if (call != error_mark_node
8385 && DECL_DESTRUCTOR_P (cand->fn)
8386 && !VOID_TYPE_P (TREE_TYPE (call)))
8387 /* An explicit call of the form "x->~X()" has type
8388 "void". However, on platforms where destructors
8389 return "this" (i.e., those where
8390 targetm.cxx.cdtor_returns_this is true), such calls
8391 will appear to have a return value of pointer type
8392 to the low-level call machinery. We do not want to
8393 change the low-level machinery, since we want to be
8394 able to optimize "delete f()" on such platforms as
8395 "operator delete(~X(f()))" (rather than generating
8396 "t = f(), ~X(t), operator delete (t)"). */
8397 call = build_nop (void_type_node, call);
8402 if (processing_template_decl && call != error_mark_node)
8404 bool cast_to_void = false;
8406 if (TREE_CODE (call) == COMPOUND_EXPR)
8407 call = TREE_OPERAND (call, 1);
8408 else if (TREE_CODE (call) == NOP_EXPR)
8410 cast_to_void = true;
8411 call = TREE_OPERAND (call, 0);
8413 if (INDIRECT_REF_P (call))
8414 call = TREE_OPERAND (call, 0);
8415 call = (build_min_non_dep_call_vec
8416 (call,
8417 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
8418 orig_instance, orig_fns, NULL_TREE),
8419 orig_args));
8420 SET_EXPR_LOCATION (call, input_location);
8421 call = convert_from_reference (call);
8422 if (cast_to_void)
8423 call = build_nop (void_type_node, call);
8426 /* Free all the conversions we allocated. */
8427 obstack_free (&conversion_obstack, p);
8429 if (orig_args != NULL)
8430 release_tree_vector (orig_args);
8432 return call;
8435 /* Wrapper for above. */
8437 tree
8438 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
8439 tree conversion_path, int flags,
8440 tree *fn_p, tsubst_flags_t complain)
8442 tree ret;
8443 bool subtime = timevar_cond_start (TV_OVERLOAD);
8444 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
8445 fn_p, complain);
8446 timevar_cond_stop (TV_OVERLOAD, subtime);
8447 return ret;
8450 /* Returns true iff standard conversion sequence ICS1 is a proper
8451 subsequence of ICS2. */
8453 static bool
8454 is_subseq (conversion *ics1, conversion *ics2)
8456 /* We can assume that a conversion of the same code
8457 between the same types indicates a subsequence since we only get
8458 here if the types we are converting from are the same. */
8460 while (ics1->kind == ck_rvalue
8461 || ics1->kind == ck_lvalue)
8462 ics1 = next_conversion (ics1);
8464 while (1)
8466 while (ics2->kind == ck_rvalue
8467 || ics2->kind == ck_lvalue)
8468 ics2 = next_conversion (ics2);
8470 if (ics2->kind == ck_user
8471 || ics2->kind == ck_ambig
8472 || ics2->kind == ck_aggr
8473 || ics2->kind == ck_list
8474 || ics2->kind == ck_identity)
8475 /* At this point, ICS1 cannot be a proper subsequence of
8476 ICS2. We can get a USER_CONV when we are comparing the
8477 second standard conversion sequence of two user conversion
8478 sequences. */
8479 return false;
8481 ics2 = next_conversion (ics2);
8483 if (ics2->kind == ics1->kind
8484 && same_type_p (ics2->type, ics1->type)
8485 && same_type_p (next_conversion (ics2)->type,
8486 next_conversion (ics1)->type))
8487 return true;
8491 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8492 be any _TYPE nodes. */
8494 bool
8495 is_properly_derived_from (tree derived, tree base)
8497 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
8498 return false;
8500 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8501 considers every class derived from itself. */
8502 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
8503 && DERIVED_FROM_P (base, derived));
8506 /* We build the ICS for an implicit object parameter as a pointer
8507 conversion sequence. However, such a sequence should be compared
8508 as if it were a reference conversion sequence. If ICS is the
8509 implicit conversion sequence for an implicit object parameter,
8510 modify it accordingly. */
8512 static void
8513 maybe_handle_implicit_object (conversion **ics)
8515 if ((*ics)->this_p)
8517 /* [over.match.funcs]
8519 For non-static member functions, the type of the
8520 implicit object parameter is "reference to cv X"
8521 where X is the class of which the function is a
8522 member and cv is the cv-qualification on the member
8523 function declaration. */
8524 conversion *t = *ics;
8525 tree reference_type;
8527 /* The `this' parameter is a pointer to a class type. Make the
8528 implicit conversion talk about a reference to that same class
8529 type. */
8530 reference_type = TREE_TYPE (t->type);
8531 reference_type = build_reference_type (reference_type);
8533 if (t->kind == ck_qual)
8534 t = next_conversion (t);
8535 if (t->kind == ck_ptr)
8536 t = next_conversion (t);
8537 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
8538 t = direct_reference_binding (reference_type, t);
8539 t->this_p = 1;
8540 t->rvaluedness_matches_p = 0;
8541 *ics = t;
8545 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8546 and return the initial reference binding conversion. Otherwise,
8547 leave *ICS unchanged and return NULL. */
8549 static conversion *
8550 maybe_handle_ref_bind (conversion **ics)
8552 if ((*ics)->kind == ck_ref_bind)
8554 conversion *old_ics = *ics;
8555 *ics = next_conversion (old_ics);
8556 (*ics)->user_conv_p = old_ics->user_conv_p;
8557 return old_ics;
8560 return NULL;
8563 /* Compare two implicit conversion sequences according to the rules set out in
8564 [over.ics.rank]. Return values:
8566 1: ics1 is better than ics2
8567 -1: ics2 is better than ics1
8568 0: ics1 and ics2 are indistinguishable */
8570 static int
8571 compare_ics (conversion *ics1, conversion *ics2)
8573 tree from_type1;
8574 tree from_type2;
8575 tree to_type1;
8576 tree to_type2;
8577 tree deref_from_type1 = NULL_TREE;
8578 tree deref_from_type2 = NULL_TREE;
8579 tree deref_to_type1 = NULL_TREE;
8580 tree deref_to_type2 = NULL_TREE;
8581 conversion_rank rank1, rank2;
8583 /* REF_BINDING is nonzero if the result of the conversion sequence
8584 is a reference type. In that case REF_CONV is the reference
8585 binding conversion. */
8586 conversion *ref_conv1;
8587 conversion *ref_conv2;
8589 /* Compare badness before stripping the reference conversion. */
8590 if (ics1->bad_p > ics2->bad_p)
8591 return -1;
8592 else if (ics1->bad_p < ics2->bad_p)
8593 return 1;
8595 /* Handle implicit object parameters. */
8596 maybe_handle_implicit_object (&ics1);
8597 maybe_handle_implicit_object (&ics2);
8599 /* Handle reference parameters. */
8600 ref_conv1 = maybe_handle_ref_bind (&ics1);
8601 ref_conv2 = maybe_handle_ref_bind (&ics2);
8603 /* List-initialization sequence L1 is a better conversion sequence than
8604 list-initialization sequence L2 if L1 converts to
8605 std::initializer_list<X> for some X and L2 does not. */
8606 if (ics1->kind == ck_list && ics2->kind != ck_list)
8607 return 1;
8608 if (ics2->kind == ck_list && ics1->kind != ck_list)
8609 return -1;
8611 /* [over.ics.rank]
8613 When comparing the basic forms of implicit conversion sequences (as
8614 defined in _over.best.ics_)
8616 --a standard conversion sequence (_over.ics.scs_) is a better
8617 conversion sequence than a user-defined conversion sequence
8618 or an ellipsis conversion sequence, and
8620 --a user-defined conversion sequence (_over.ics.user_) is a
8621 better conversion sequence than an ellipsis conversion sequence
8622 (_over.ics.ellipsis_). */
8623 /* Use BAD_CONVERSION_RANK because we already checked for a badness
8624 mismatch. If both ICS are bad, we try to make a decision based on
8625 what would have happened if they'd been good. This is not an
8626 extension, we'll still give an error when we build up the call; this
8627 just helps us give a more helpful error message. */
8628 rank1 = BAD_CONVERSION_RANK (ics1);
8629 rank2 = BAD_CONVERSION_RANK (ics2);
8631 if (rank1 > rank2)
8632 return -1;
8633 else if (rank1 < rank2)
8634 return 1;
8636 if (ics1->ellipsis_p)
8637 /* Both conversions are ellipsis conversions. */
8638 return 0;
8640 /* User-defined conversion sequence U1 is a better conversion sequence
8641 than another user-defined conversion sequence U2 if they contain the
8642 same user-defined conversion operator or constructor and if the sec-
8643 ond standard conversion sequence of U1 is better than the second
8644 standard conversion sequence of U2. */
8646 /* Handle list-conversion with the same code even though it isn't always
8647 ranked as a user-defined conversion and it doesn't have a second
8648 standard conversion sequence; it will still have the desired effect.
8649 Specifically, we need to do the reference binding comparison at the
8650 end of this function. */
8652 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
8654 conversion *t1;
8655 conversion *t2;
8657 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
8658 if (t1->kind == ck_ambig || t1->kind == ck_aggr
8659 || t1->kind == ck_list)
8660 break;
8661 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
8662 if (t2->kind == ck_ambig || t2->kind == ck_aggr
8663 || t2->kind == ck_list)
8664 break;
8666 if (t1->kind != t2->kind)
8667 return 0;
8668 else if (t1->kind == ck_user)
8670 if (t1->cand->fn != t2->cand->fn)
8671 return 0;
8673 else
8675 /* For ambiguous or aggregate conversions, use the target type as
8676 a proxy for the conversion function. */
8677 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
8678 return 0;
8681 /* We can just fall through here, after setting up
8682 FROM_TYPE1 and FROM_TYPE2. */
8683 from_type1 = t1->type;
8684 from_type2 = t2->type;
8686 else
8688 conversion *t1;
8689 conversion *t2;
8691 /* We're dealing with two standard conversion sequences.
8693 [over.ics.rank]
8695 Standard conversion sequence S1 is a better conversion
8696 sequence than standard conversion sequence S2 if
8698 --S1 is a proper subsequence of S2 (comparing the conversion
8699 sequences in the canonical form defined by _over.ics.scs_,
8700 excluding any Lvalue Transformation; the identity
8701 conversion sequence is considered to be a subsequence of
8702 any non-identity conversion sequence */
8704 t1 = ics1;
8705 while (t1->kind != ck_identity)
8706 t1 = next_conversion (t1);
8707 from_type1 = t1->type;
8709 t2 = ics2;
8710 while (t2->kind != ck_identity)
8711 t2 = next_conversion (t2);
8712 from_type2 = t2->type;
8715 /* One sequence can only be a subsequence of the other if they start with
8716 the same type. They can start with different types when comparing the
8717 second standard conversion sequence in two user-defined conversion
8718 sequences. */
8719 if (same_type_p (from_type1, from_type2))
8721 if (is_subseq (ics1, ics2))
8722 return 1;
8723 if (is_subseq (ics2, ics1))
8724 return -1;
8727 /* [over.ics.rank]
8729 Or, if not that,
8731 --the rank of S1 is better than the rank of S2 (by the rules
8732 defined below):
8734 Standard conversion sequences are ordered by their ranks: an Exact
8735 Match is a better conversion than a Promotion, which is a better
8736 conversion than a Conversion.
8738 Two conversion sequences with the same rank are indistinguishable
8739 unless one of the following rules applies:
8741 --A conversion that does not a convert a pointer, pointer to member,
8742 or std::nullptr_t to bool is better than one that does.
8744 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8745 so that we do not have to check it explicitly. */
8746 if (ics1->rank < ics2->rank)
8747 return 1;
8748 else if (ics2->rank < ics1->rank)
8749 return -1;
8751 to_type1 = ics1->type;
8752 to_type2 = ics2->type;
8754 /* A conversion from scalar arithmetic type to complex is worse than a
8755 conversion between scalar arithmetic types. */
8756 if (same_type_p (from_type1, from_type2)
8757 && ARITHMETIC_TYPE_P (from_type1)
8758 && ARITHMETIC_TYPE_P (to_type1)
8759 && ARITHMETIC_TYPE_P (to_type2)
8760 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
8761 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
8763 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
8764 return -1;
8765 else
8766 return 1;
8769 if (TYPE_PTR_P (from_type1)
8770 && TYPE_PTR_P (from_type2)
8771 && TYPE_PTR_P (to_type1)
8772 && TYPE_PTR_P (to_type2))
8774 deref_from_type1 = TREE_TYPE (from_type1);
8775 deref_from_type2 = TREE_TYPE (from_type2);
8776 deref_to_type1 = TREE_TYPE (to_type1);
8777 deref_to_type2 = TREE_TYPE (to_type2);
8779 /* The rules for pointers to members A::* are just like the rules
8780 for pointers A*, except opposite: if B is derived from A then
8781 A::* converts to B::*, not vice versa. For that reason, we
8782 switch the from_ and to_ variables here. */
8783 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
8784 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
8785 || (TYPE_PTRMEMFUNC_P (from_type1)
8786 && TYPE_PTRMEMFUNC_P (from_type2)
8787 && TYPE_PTRMEMFUNC_P (to_type1)
8788 && TYPE_PTRMEMFUNC_P (to_type2)))
8790 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
8791 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
8792 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
8793 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
8796 if (deref_from_type1 != NULL_TREE
8797 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
8798 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
8800 /* This was one of the pointer or pointer-like conversions.
8802 [over.ics.rank]
8804 --If class B is derived directly or indirectly from class A,
8805 conversion of B* to A* is better than conversion of B* to
8806 void*, and conversion of A* to void* is better than
8807 conversion of B* to void*. */
8808 if (VOID_TYPE_P (deref_to_type1)
8809 && VOID_TYPE_P (deref_to_type2))
8811 if (is_properly_derived_from (deref_from_type1,
8812 deref_from_type2))
8813 return -1;
8814 else if (is_properly_derived_from (deref_from_type2,
8815 deref_from_type1))
8816 return 1;
8818 else if (VOID_TYPE_P (deref_to_type1)
8819 || VOID_TYPE_P (deref_to_type2))
8821 if (same_type_p (deref_from_type1, deref_from_type2))
8823 if (VOID_TYPE_P (deref_to_type2))
8825 if (is_properly_derived_from (deref_from_type1,
8826 deref_to_type1))
8827 return 1;
8829 /* We know that DEREF_TO_TYPE1 is `void' here. */
8830 else if (is_properly_derived_from (deref_from_type1,
8831 deref_to_type2))
8832 return -1;
8835 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
8836 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
8838 /* [over.ics.rank]
8840 --If class B is derived directly or indirectly from class A
8841 and class C is derived directly or indirectly from B,
8843 --conversion of C* to B* is better than conversion of C* to
8846 --conversion of B* to A* is better than conversion of C* to
8847 A* */
8848 if (same_type_p (deref_from_type1, deref_from_type2))
8850 if (is_properly_derived_from (deref_to_type1,
8851 deref_to_type2))
8852 return 1;
8853 else if (is_properly_derived_from (deref_to_type2,
8854 deref_to_type1))
8855 return -1;
8857 else if (same_type_p (deref_to_type1, deref_to_type2))
8859 if (is_properly_derived_from (deref_from_type2,
8860 deref_from_type1))
8861 return 1;
8862 else if (is_properly_derived_from (deref_from_type1,
8863 deref_from_type2))
8864 return -1;
8868 else if (CLASS_TYPE_P (non_reference (from_type1))
8869 && same_type_p (from_type1, from_type2))
8871 tree from = non_reference (from_type1);
8873 /* [over.ics.rank]
8875 --binding of an expression of type C to a reference of type
8876 B& is better than binding an expression of type C to a
8877 reference of type A&
8879 --conversion of C to B is better than conversion of C to A, */
8880 if (is_properly_derived_from (from, to_type1)
8881 && is_properly_derived_from (from, to_type2))
8883 if (is_properly_derived_from (to_type1, to_type2))
8884 return 1;
8885 else if (is_properly_derived_from (to_type2, to_type1))
8886 return -1;
8889 else if (CLASS_TYPE_P (non_reference (to_type1))
8890 && same_type_p (to_type1, to_type2))
8892 tree to = non_reference (to_type1);
8894 /* [over.ics.rank]
8896 --binding of an expression of type B to a reference of type
8897 A& is better than binding an expression of type C to a
8898 reference of type A&,
8900 --conversion of B to A is better than conversion of C to A */
8901 if (is_properly_derived_from (from_type1, to)
8902 && is_properly_derived_from (from_type2, to))
8904 if (is_properly_derived_from (from_type2, from_type1))
8905 return 1;
8906 else if (is_properly_derived_from (from_type1, from_type2))
8907 return -1;
8911 /* [over.ics.rank]
8913 --S1 and S2 differ only in their qualification conversion and yield
8914 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8915 qualification signature of type T1 is a proper subset of the cv-
8916 qualification signature of type T2 */
8917 if (ics1->kind == ck_qual
8918 && ics2->kind == ck_qual
8919 && same_type_p (from_type1, from_type2))
8921 int result = comp_cv_qual_signature (to_type1, to_type2);
8922 if (result != 0)
8923 return result;
8926 /* [over.ics.rank]
8928 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8929 to an implicit object parameter of a non-static member function
8930 declared without a ref-qualifier, and either S1 binds an lvalue
8931 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
8932 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
8933 draft standard, 13.3.3.2)
8935 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8936 types to which the references refer are the same type except for
8937 top-level cv-qualifiers, and the type to which the reference
8938 initialized by S2 refers is more cv-qualified than the type to
8939 which the reference initialized by S1 refers.
8941 DR 1328 [over.match.best]: the context is an initialization by
8942 conversion function for direct reference binding (13.3.1.6) of a
8943 reference to function type, the return type of F1 is the same kind of
8944 reference (i.e. lvalue or rvalue) as the reference being initialized,
8945 and the return type of F2 is not. */
8947 if (ref_conv1 && ref_conv2)
8949 if (!ref_conv1->this_p && !ref_conv2->this_p
8950 && (ref_conv1->rvaluedness_matches_p
8951 != ref_conv2->rvaluedness_matches_p)
8952 && (same_type_p (ref_conv1->type, ref_conv2->type)
8953 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
8954 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
8956 if (ref_conv1->bad_p
8957 && !same_type_p (TREE_TYPE (ref_conv1->type),
8958 TREE_TYPE (ref_conv2->type)))
8959 /* Don't prefer a bad conversion that drops cv-quals to a bad
8960 conversion with the wrong rvalueness. */
8961 return 0;
8962 return (ref_conv1->rvaluedness_matches_p
8963 - ref_conv2->rvaluedness_matches_p);
8966 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
8968 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
8969 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
8970 if (ref_conv1->bad_p)
8972 /* Prefer the one that drops fewer cv-quals. */
8973 tree ftype = next_conversion (ref_conv1)->type;
8974 int fquals = cp_type_quals (ftype);
8975 q1 ^= fquals;
8976 q2 ^= fquals;
8978 return comp_cv_qualification (q2, q1);
8982 /* Neither conversion sequence is better than the other. */
8983 return 0;
8986 /* The source type for this standard conversion sequence. */
8988 static tree
8989 source_type (conversion *t)
8991 for (;; t = next_conversion (t))
8993 if (t->kind == ck_user
8994 || t->kind == ck_ambig
8995 || t->kind == ck_identity)
8996 return t->type;
8998 gcc_unreachable ();
9001 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9002 a pointer to LOSER and re-running joust to produce the warning if WINNER
9003 is actually used. */
9005 static void
9006 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9008 candidate_warning *cw = (candidate_warning *)
9009 conversion_obstack_alloc (sizeof (candidate_warning));
9010 cw->loser = loser;
9011 cw->next = winner->warnings;
9012 winner->warnings = cw;
9015 /* Compare two candidates for overloading as described in
9016 [over.match.best]. Return values:
9018 1: cand1 is better than cand2
9019 -1: cand2 is better than cand1
9020 0: cand1 and cand2 are indistinguishable */
9022 static int
9023 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9024 tsubst_flags_t complain)
9026 int winner = 0;
9027 int off1 = 0, off2 = 0;
9028 size_t i;
9029 size_t len;
9031 /* Candidates that involve bad conversions are always worse than those
9032 that don't. */
9033 if (cand1->viable > cand2->viable)
9034 return 1;
9035 if (cand1->viable < cand2->viable)
9036 return -1;
9038 /* If we have two pseudo-candidates for conversions to the same type,
9039 or two candidates for the same function, arbitrarily pick one. */
9040 if (cand1->fn == cand2->fn
9041 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9042 return 1;
9044 /* Prefer a non-deleted function over an implicitly deleted move
9045 constructor or assignment operator. This differs slightly from the
9046 wording for issue 1402 (which says the move op is ignored by overload
9047 resolution), but this way produces better error messages. */
9048 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9049 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9050 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9052 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9053 && move_fn_p (cand1->fn))
9054 return -1;
9055 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9056 && move_fn_p (cand2->fn))
9057 return 1;
9060 /* a viable function F1
9061 is defined to be a better function than another viable function F2 if
9062 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9063 ICSi(F2), and then */
9065 /* for some argument j, ICSj(F1) is a better conversion sequence than
9066 ICSj(F2) */
9068 /* For comparing static and non-static member functions, we ignore
9069 the implicit object parameter of the non-static function. The
9070 standard says to pretend that the static function has an object
9071 parm, but that won't work with operator overloading. */
9072 len = cand1->num_convs;
9073 if (len != cand2->num_convs)
9075 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9076 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9078 if (DECL_CONSTRUCTOR_P (cand1->fn)
9079 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9080 /* We're comparing a near-match list constructor and a near-match
9081 non-list constructor. Just treat them as unordered. */
9082 return 0;
9084 gcc_assert (static_1 != static_2);
9086 if (static_1)
9087 off2 = 1;
9088 else
9090 off1 = 1;
9091 --len;
9095 for (i = 0; i < len; ++i)
9097 conversion *t1 = cand1->convs[i + off1];
9098 conversion *t2 = cand2->convs[i + off2];
9099 int comp = compare_ics (t1, t2);
9101 if (comp != 0)
9103 if ((complain & tf_warning)
9104 && warn_sign_promo
9105 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9106 == cr_std + cr_promotion)
9107 && t1->kind == ck_std
9108 && t2->kind == ck_std
9109 && TREE_CODE (t1->type) == INTEGER_TYPE
9110 && TREE_CODE (t2->type) == INTEGER_TYPE
9111 && (TYPE_PRECISION (t1->type)
9112 == TYPE_PRECISION (t2->type))
9113 && (TYPE_UNSIGNED (next_conversion (t1)->type)
9114 || (TREE_CODE (next_conversion (t1)->type)
9115 == ENUMERAL_TYPE)))
9117 tree type = next_conversion (t1)->type;
9118 tree type1, type2;
9119 struct z_candidate *w, *l;
9120 if (comp > 0)
9121 type1 = t1->type, type2 = t2->type,
9122 w = cand1, l = cand2;
9123 else
9124 type1 = t2->type, type2 = t1->type,
9125 w = cand2, l = cand1;
9127 if (warn)
9129 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
9130 type, type1, type2);
9131 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
9133 else
9134 add_warning (w, l);
9137 if (winner && comp != winner)
9139 winner = 0;
9140 goto tweak;
9142 winner = comp;
9146 /* warn about confusing overload resolution for user-defined conversions,
9147 either between a constructor and a conversion op, or between two
9148 conversion ops. */
9149 if ((complain & tf_warning)
9150 && winner && warn_conversion && cand1->second_conv
9151 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
9152 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
9154 struct z_candidate *w, *l;
9155 bool give_warning = false;
9157 if (winner == 1)
9158 w = cand1, l = cand2;
9159 else
9160 w = cand2, l = cand1;
9162 /* We don't want to complain about `X::operator T1 ()'
9163 beating `X::operator T2 () const', when T2 is a no less
9164 cv-qualified version of T1. */
9165 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
9166 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
9168 tree t = TREE_TYPE (TREE_TYPE (l->fn));
9169 tree f = TREE_TYPE (TREE_TYPE (w->fn));
9171 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
9173 t = TREE_TYPE (t);
9174 f = TREE_TYPE (f);
9176 if (!comp_ptr_ttypes (t, f))
9177 give_warning = true;
9179 else
9180 give_warning = true;
9182 if (!give_warning)
9183 /*NOP*/;
9184 else if (warn)
9186 tree source = source_type (w->convs[0]);
9187 if (! DECL_CONSTRUCTOR_P (w->fn))
9188 source = TREE_TYPE (source);
9189 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
9190 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
9191 source, w->second_conv->type))
9193 inform (input_location, " because conversion sequence for the argument is better");
9196 else
9197 add_warning (w, l);
9200 if (winner)
9201 return winner;
9203 /* DR 495 moved this tiebreaker above the template ones. */
9204 /* or, if not that,
9205 the context is an initialization by user-defined conversion (see
9206 _dcl.init_ and _over.match.user_) and the standard conversion
9207 sequence from the return type of F1 to the destination type (i.e.,
9208 the type of the entity being initialized) is a better conversion
9209 sequence than the standard conversion sequence from the return type
9210 of F2 to the destination type. */
9212 if (cand1->second_conv)
9214 winner = compare_ics (cand1->second_conv, cand2->second_conv);
9215 if (winner)
9216 return winner;
9219 /* or, if not that,
9220 F1 is a non-template function and F2 is a template function
9221 specialization. */
9223 if (!cand1->template_decl && cand2->template_decl)
9224 return 1;
9225 else if (cand1->template_decl && !cand2->template_decl)
9226 return -1;
9228 /* or, if not that,
9229 F1 and F2 are template functions and the function template for F1 is
9230 more specialized than the template for F2 according to the partial
9231 ordering rules. */
9233 if (cand1->template_decl && cand2->template_decl)
9235 winner = more_specialized_fn
9236 (TI_TEMPLATE (cand1->template_decl),
9237 TI_TEMPLATE (cand2->template_decl),
9238 /* [temp.func.order]: The presence of unused ellipsis and default
9239 arguments has no effect on the partial ordering of function
9240 templates. add_function_candidate() will not have
9241 counted the "this" argument for constructors. */
9242 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
9243 if (winner)
9244 return winner;
9247 // C++ Concepts
9248 // or, if not that, F1 is more constrained than F2.
9249 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
9251 winner = more_constrained (cand1->fn, cand2->fn);
9252 if (winner)
9253 return winner;
9256 /* Check whether we can discard a builtin candidate, either because we
9257 have two identical ones or matching builtin and non-builtin candidates.
9259 (Pedantically in the latter case the builtin which matched the user
9260 function should not be added to the overload set, but we spot it here.
9262 [over.match.oper]
9263 ... the builtin candidates include ...
9264 - do not have the same parameter type list as any non-template
9265 non-member candidate. */
9267 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
9269 for (i = 0; i < len; ++i)
9270 if (!same_type_p (cand1->convs[i]->type,
9271 cand2->convs[i]->type))
9272 break;
9273 if (i == cand1->num_convs)
9275 if (cand1->fn == cand2->fn)
9276 /* Two built-in candidates; arbitrarily pick one. */
9277 return 1;
9278 else if (identifier_p (cand1->fn))
9279 /* cand1 is built-in; prefer cand2. */
9280 return -1;
9281 else
9282 /* cand2 is built-in; prefer cand1. */
9283 return 1;
9287 /* For candidates of a multi-versioned function, make the version with
9288 the highest priority win. This version will be checked for dispatching
9289 first. If this version can be inlined into the caller, the front-end
9290 will simply make a direct call to this function. */
9292 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9293 && DECL_FUNCTION_VERSIONED (cand1->fn)
9294 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9295 && DECL_FUNCTION_VERSIONED (cand2->fn))
9297 tree f1 = TREE_TYPE (cand1->fn);
9298 tree f2 = TREE_TYPE (cand2->fn);
9299 tree p1 = TYPE_ARG_TYPES (f1);
9300 tree p2 = TYPE_ARG_TYPES (f2);
9302 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9303 is possible that cand1->fn and cand2->fn are function versions but of
9304 different functions. Check types to see if they are versions of the same
9305 function. */
9306 if (compparms (p1, p2)
9307 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9309 /* Always make the version with the higher priority, more
9310 specialized, win. */
9311 gcc_assert (targetm.compare_version_priority);
9312 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
9313 return 1;
9314 else
9315 return -1;
9319 /* If the two function declarations represent the same function (this can
9320 happen with declarations in multiple scopes and arg-dependent lookup),
9321 arbitrarily choose one. But first make sure the default args we're
9322 using match. */
9323 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
9324 && equal_functions (cand1->fn, cand2->fn))
9326 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
9327 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
9329 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
9331 for (i = 0; i < len; ++i)
9333 /* Don't crash if the fn is variadic. */
9334 if (!parms1)
9335 break;
9336 parms1 = TREE_CHAIN (parms1);
9337 parms2 = TREE_CHAIN (parms2);
9340 if (off1)
9341 parms1 = TREE_CHAIN (parms1);
9342 else if (off2)
9343 parms2 = TREE_CHAIN (parms2);
9345 for (; parms1; ++i)
9347 if (!cp_tree_equal (TREE_PURPOSE (parms1),
9348 TREE_PURPOSE (parms2)))
9350 if (warn)
9352 if (complain & tf_error)
9354 if (permerror (input_location,
9355 "default argument mismatch in "
9356 "overload resolution"))
9358 inform (input_location,
9359 " candidate 1: %q+#F", cand1->fn);
9360 inform (input_location,
9361 " candidate 2: %q+#F", cand2->fn);
9364 else
9365 return 0;
9367 else
9368 add_warning (cand1, cand2);
9369 break;
9371 parms1 = TREE_CHAIN (parms1);
9372 parms2 = TREE_CHAIN (parms2);
9375 return 1;
9378 tweak:
9380 /* Extension: If the worst conversion for one candidate is worse than the
9381 worst conversion for the other, take the first. */
9382 if (!pedantic && (complain & tf_warning_or_error))
9384 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
9385 struct z_candidate *w = 0, *l = 0;
9387 for (i = 0; i < len; ++i)
9389 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
9390 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
9391 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
9392 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
9394 if (rank1 < rank2)
9395 winner = 1, w = cand1, l = cand2;
9396 if (rank1 > rank2)
9397 winner = -1, w = cand2, l = cand1;
9398 if (winner)
9400 /* Don't choose a deleted function over ambiguity. */
9401 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
9402 return 0;
9403 if (warn)
9405 pedwarn (input_location, 0,
9406 "ISO C++ says that these are ambiguous, even "
9407 "though the worst conversion for the first is better than "
9408 "the worst conversion for the second:");
9409 print_z_candidate (input_location, _("candidate 1:"), w);
9410 print_z_candidate (input_location, _("candidate 2:"), l);
9412 else
9413 add_warning (w, l);
9414 return winner;
9418 gcc_assert (!winner);
9419 return 0;
9422 /* Given a list of candidates for overloading, find the best one, if any.
9423 This algorithm has a worst case of O(2n) (winner is last), and a best
9424 case of O(n/2) (totally ambiguous); much better than a sorting
9425 algorithm. */
9427 static struct z_candidate *
9428 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
9430 struct z_candidate *champ = candidates, *challenger;
9431 int fate;
9432 int champ_compared_to_predecessor = 0;
9434 /* Walk through the list once, comparing each current champ to the next
9435 candidate, knocking out a candidate or two with each comparison. */
9437 for (challenger = champ->next; challenger; )
9439 fate = joust (champ, challenger, 0, complain);
9440 if (fate == 1)
9441 challenger = challenger->next;
9442 else
9444 if (fate == 0)
9446 champ = challenger->next;
9447 if (champ == 0)
9448 return NULL;
9449 champ_compared_to_predecessor = 0;
9451 else
9453 champ = challenger;
9454 champ_compared_to_predecessor = 1;
9457 challenger = champ->next;
9461 /* Make sure the champ is better than all the candidates it hasn't yet
9462 been compared to. */
9464 for (challenger = candidates;
9465 challenger != champ
9466 && !(champ_compared_to_predecessor && challenger->next == champ);
9467 challenger = challenger->next)
9469 fate = joust (champ, challenger, 0, complain);
9470 if (fate != 1)
9471 return NULL;
9474 return champ;
9477 /* Returns nonzero if things of type FROM can be converted to TO. */
9479 bool
9480 can_convert (tree to, tree from, tsubst_flags_t complain)
9482 tree arg = NULL_TREE;
9483 /* implicit_conversion only considers user-defined conversions
9484 if it has an expression for the call argument list. */
9485 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
9486 arg = build1 (CAST_EXPR, from, NULL_TREE);
9487 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
9490 /* Returns nonzero if things of type FROM can be converted to TO with a
9491 standard conversion. */
9493 bool
9494 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
9496 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
9499 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9501 bool
9502 can_convert_arg (tree to, tree from, tree arg, int flags,
9503 tsubst_flags_t complain)
9505 conversion *t;
9506 void *p;
9507 bool ok_p;
9509 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9510 p = conversion_obstack_alloc (0);
9511 /* We want to discard any access checks done for this test,
9512 as we might not be in the appropriate access context and
9513 we'll do the check again when we actually perform the
9514 conversion. */
9515 push_deferring_access_checks (dk_deferred);
9517 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
9518 flags, complain);
9519 ok_p = (t && !t->bad_p);
9521 /* Discard the access checks now. */
9522 pop_deferring_access_checks ();
9523 /* Free all the conversions we allocated. */
9524 obstack_free (&conversion_obstack, p);
9526 return ok_p;
9529 /* Like can_convert_arg, but allows dubious conversions as well. */
9531 bool
9532 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
9533 tsubst_flags_t complain)
9535 conversion *t;
9536 void *p;
9538 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9539 p = conversion_obstack_alloc (0);
9540 /* Try to perform the conversion. */
9541 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
9542 flags, complain);
9543 /* Free all the conversions we allocated. */
9544 obstack_free (&conversion_obstack, p);
9546 return t != NULL;
9549 /* Convert EXPR to TYPE. Return the converted expression.
9551 Note that we allow bad conversions here because by the time we get to
9552 this point we are committed to doing the conversion. If we end up
9553 doing a bad conversion, convert_like will complain. */
9555 tree
9556 perform_implicit_conversion_flags (tree type, tree expr,
9557 tsubst_flags_t complain, int flags)
9559 conversion *conv;
9560 void *p;
9561 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
9563 if (error_operand_p (expr))
9564 return error_mark_node;
9566 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9567 p = conversion_obstack_alloc (0);
9569 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
9570 /*c_cast_p=*/false,
9571 flags, complain);
9573 if (!conv)
9575 if (complain & tf_error)
9577 /* If expr has unknown type, then it is an overloaded function.
9578 Call instantiate_type to get good error messages. */
9579 if (TREE_TYPE (expr) == unknown_type_node)
9580 instantiate_type (type, expr, complain);
9581 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
9582 /* We gave an error. */;
9583 else
9584 error_at (loc, "could not convert %qE from %qT to %qT", expr,
9585 TREE_TYPE (expr), type);
9587 expr = error_mark_node;
9589 else if (processing_template_decl && conv->kind != ck_identity)
9591 /* In a template, we are only concerned about determining the
9592 type of non-dependent expressions, so we do not have to
9593 perform the actual conversion. But for initializers, we
9594 need to be able to perform it at instantiation
9595 (or instantiate_non_dependent_expr) time. */
9596 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
9597 if (!(flags & LOOKUP_ONLYCONVERTING))
9598 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
9600 else
9601 expr = convert_like (conv, expr, complain);
9603 /* Free all the conversions we allocated. */
9604 obstack_free (&conversion_obstack, p);
9606 return expr;
9609 tree
9610 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
9612 return perform_implicit_conversion_flags (type, expr, complain,
9613 LOOKUP_IMPLICIT);
9616 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9617 permitted. If the conversion is valid, the converted expression is
9618 returned. Otherwise, NULL_TREE is returned, except in the case
9619 that TYPE is a class type; in that case, an error is issued. If
9620 C_CAST_P is true, then this direct-initialization is taking
9621 place as part of a static_cast being attempted as part of a C-style
9622 cast. */
9624 tree
9625 perform_direct_initialization_if_possible (tree type,
9626 tree expr,
9627 bool c_cast_p,
9628 tsubst_flags_t complain)
9630 conversion *conv;
9631 void *p;
9633 if (type == error_mark_node || error_operand_p (expr))
9634 return error_mark_node;
9635 /* [dcl.init]
9637 If the destination type is a (possibly cv-qualified) class type:
9639 -- If the initialization is direct-initialization ...,
9640 constructors are considered. ... If no constructor applies, or
9641 the overload resolution is ambiguous, the initialization is
9642 ill-formed. */
9643 if (CLASS_TYPE_P (type))
9645 vec<tree, va_gc> *args = make_tree_vector_single (expr);
9646 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
9647 &args, type, LOOKUP_NORMAL, complain);
9648 release_tree_vector (args);
9649 return build_cplus_new (type, expr, complain);
9652 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9653 p = conversion_obstack_alloc (0);
9655 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
9656 c_cast_p,
9657 LOOKUP_NORMAL, complain);
9658 if (!conv || conv->bad_p)
9659 expr = NULL_TREE;
9660 else
9661 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
9662 /*issue_conversion_warnings=*/false,
9663 c_cast_p,
9664 complain);
9666 /* Free all the conversions we allocated. */
9667 obstack_free (&conversion_obstack, p);
9669 return expr;
9672 /* When initializing a reference that lasts longer than a full-expression,
9673 this special rule applies:
9675 [class.temporary]
9677 The temporary to which the reference is bound or the temporary
9678 that is the complete object to which the reference is bound
9679 persists for the lifetime of the reference.
9681 The temporaries created during the evaluation of the expression
9682 initializing the reference, except the temporary to which the
9683 reference is bound, are destroyed at the end of the
9684 full-expression in which they are created.
9686 In that case, we store the converted expression into a new
9687 VAR_DECL in a new scope.
9689 However, we want to be careful not to create temporaries when
9690 they are not required. For example, given:
9692 struct B {};
9693 struct D : public B {};
9694 D f();
9695 const B& b = f();
9697 there is no need to copy the return value from "f"; we can just
9698 extend its lifetime. Similarly, given:
9700 struct S {};
9701 struct T { operator S(); };
9702 T t;
9703 const S& s = t;
9705 we can extend the lifetime of the return value of the conversion
9706 operator.
9708 The next several functions are involved in this lifetime extension. */
9710 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9711 reference is being bound to a temporary. Create and return a new
9712 VAR_DECL with the indicated TYPE; this variable will store the value to
9713 which the reference is bound. */
9715 tree
9716 make_temporary_var_for_ref_to_temp (tree decl, tree type)
9718 tree var;
9720 /* Create the variable. */
9721 var = create_temporary_var (type);
9723 /* Register the variable. */
9724 if (VAR_P (decl)
9725 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
9727 /* Namespace-scope or local static; give it a mangled name. */
9728 /* FIXME share comdat with decl? */
9729 tree name;
9731 TREE_STATIC (var) = TREE_STATIC (decl);
9732 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
9733 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
9734 name = mangle_ref_init_variable (decl);
9735 DECL_NAME (var) = name;
9736 SET_DECL_ASSEMBLER_NAME (var, name);
9737 var = pushdecl_top_level (var);
9739 else
9740 /* Create a new cleanup level if necessary. */
9741 maybe_push_cleanup_level (type);
9743 return var;
9746 /* EXPR is the initializer for a variable DECL of reference or
9747 std::initializer_list type. Create, push and return a new VAR_DECL
9748 for the initializer so that it will live as long as DECL. Any
9749 cleanup for the new variable is returned through CLEANUP, and the
9750 code to initialize the new variable is returned through INITP. */
9752 static tree
9753 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
9754 tree *initp)
9756 tree init;
9757 tree type;
9758 tree var;
9760 /* Create the temporary variable. */
9761 type = TREE_TYPE (expr);
9762 var = make_temporary_var_for_ref_to_temp (decl, type);
9763 layout_decl (var, 0);
9764 /* If the rvalue is the result of a function call it will be
9765 a TARGET_EXPR. If it is some other construct (such as a
9766 member access expression where the underlying object is
9767 itself the result of a function call), turn it into a
9768 TARGET_EXPR here. It is important that EXPR be a
9769 TARGET_EXPR below since otherwise the INIT_EXPR will
9770 attempt to make a bitwise copy of EXPR to initialize
9771 VAR. */
9772 if (TREE_CODE (expr) != TARGET_EXPR)
9773 expr = get_target_expr (expr);
9775 if (TREE_CODE (decl) == FIELD_DECL
9776 && extra_warnings && !TREE_NO_WARNING (decl))
9778 warning (OPT_Wextra, "a temporary bound to %qD only persists "
9779 "until the constructor exits", decl);
9780 TREE_NO_WARNING (decl) = true;
9783 /* Recursively extend temps in this initializer. */
9784 TARGET_EXPR_INITIAL (expr)
9785 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
9787 /* Any reference temp has a non-trivial initializer. */
9788 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
9790 /* If the initializer is constant, put it in DECL_INITIAL so we get
9791 static initialization and use in constant expressions. */
9792 init = maybe_constant_init (expr);
9793 if (TREE_CONSTANT (init))
9795 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
9797 /* 5.19 says that a constant expression can include an
9798 lvalue-rvalue conversion applied to "a glvalue of literal type
9799 that refers to a non-volatile temporary object initialized
9800 with a constant expression". Rather than try to communicate
9801 that this VAR_DECL is a temporary, just mark it constexpr.
9803 Currently this is only useful for initializer_list temporaries,
9804 since reference vars can't appear in constant expressions. */
9805 DECL_DECLARED_CONSTEXPR_P (var) = true;
9806 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
9807 TREE_CONSTANT (var) = true;
9809 DECL_INITIAL (var) = init;
9810 init = NULL_TREE;
9812 else
9813 /* Create the INIT_EXPR that will initialize the temporary
9814 variable. */
9815 init = split_nonconstant_init (var, expr);
9816 if (at_function_scope_p ())
9818 add_decl_expr (var);
9820 if (TREE_STATIC (var))
9821 init = add_stmt_to_compound (init, register_dtor_fn (var));
9822 else
9824 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
9825 if (cleanup)
9826 vec_safe_push (*cleanups, cleanup);
9829 /* We must be careful to destroy the temporary only
9830 after its initialization has taken place. If the
9831 initialization throws an exception, then the
9832 destructor should not be run. We cannot simply
9833 transform INIT into something like:
9835 (INIT, ({ CLEANUP_STMT; }))
9837 because emit_local_var always treats the
9838 initializer as a full-expression. Thus, the
9839 destructor would run too early; it would run at the
9840 end of initializing the reference variable, rather
9841 than at the end of the block enclosing the
9842 reference variable.
9844 The solution is to pass back a cleanup expression
9845 which the caller is responsible for attaching to
9846 the statement tree. */
9848 else
9850 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
9851 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
9853 if (CP_DECL_THREAD_LOCAL_P (var))
9854 tls_aggregates = tree_cons (NULL_TREE, var,
9855 tls_aggregates);
9856 else
9857 static_aggregates = tree_cons (NULL_TREE, var,
9858 static_aggregates);
9860 else
9861 /* Check whether the dtor is callable. */
9862 cxx_maybe_build_cleanup (var, tf_warning_or_error);
9864 /* Avoid -Wunused-variable warning (c++/38958). */
9865 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
9866 && VAR_P (decl))
9867 TREE_USED (decl) = DECL_READ_P (decl) = true;
9869 *initp = init;
9870 return var;
9873 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9874 initializing a variable of that TYPE. */
9876 tree
9877 initialize_reference (tree type, tree expr,
9878 int flags, tsubst_flags_t complain)
9880 conversion *conv;
9881 void *p;
9882 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
9884 if (type == error_mark_node || error_operand_p (expr))
9885 return error_mark_node;
9887 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9888 p = conversion_obstack_alloc (0);
9890 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
9891 flags, complain);
9892 if (!conv || conv->bad_p)
9894 if (complain & tf_error)
9896 if (conv)
9897 convert_like (conv, expr, complain);
9898 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
9899 && !TYPE_REF_IS_RVALUE (type)
9900 && !real_lvalue_p (expr))
9901 error_at (loc, "invalid initialization of non-const reference of "
9902 "type %qT from an rvalue of type %qT",
9903 type, TREE_TYPE (expr));
9904 else
9905 error_at (loc, "invalid initialization of reference of type "
9906 "%qT from expression of type %qT", type,
9907 TREE_TYPE (expr));
9909 return error_mark_node;
9912 if (conv->kind == ck_ref_bind)
9913 /* Perform the conversion. */
9914 expr = convert_like (conv, expr, complain);
9915 else if (conv->kind == ck_ambig)
9916 /* We gave an error in build_user_type_conversion_1. */
9917 expr = error_mark_node;
9918 else
9919 gcc_unreachable ();
9921 /* Free all the conversions we allocated. */
9922 obstack_free (&conversion_obstack, p);
9924 return expr;
9927 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9928 which is bound either to a reference or a std::initializer_list. */
9930 static tree
9931 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
9933 tree sub = init;
9934 tree *p;
9935 STRIP_NOPS (sub);
9936 if (TREE_CODE (sub) == COMPOUND_EXPR)
9938 TREE_OPERAND (sub, 1)
9939 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
9940 return init;
9942 if (TREE_CODE (sub) != ADDR_EXPR)
9943 return init;
9944 /* Deal with binding to a subobject. */
9945 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
9946 p = &TREE_OPERAND (*p, 0);
9947 if (TREE_CODE (*p) == TARGET_EXPR)
9949 tree subinit = NULL_TREE;
9950 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
9951 recompute_tree_invariant_for_addr_expr (sub);
9952 if (init != sub)
9953 init = fold_convert (TREE_TYPE (init), sub);
9954 if (subinit)
9955 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
9957 return init;
9960 /* INIT is part of the initializer for DECL. If there are any
9961 reference or initializer lists being initialized, extend their
9962 lifetime to match that of DECL. */
9964 tree
9965 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
9967 tree type = TREE_TYPE (init);
9968 if (processing_template_decl)
9969 return init;
9970 if (TREE_CODE (type) == REFERENCE_TYPE)
9971 init = extend_ref_init_temps_1 (decl, init, cleanups);
9972 else if (is_std_init_list (type))
9974 /* The temporary array underlying a std::initializer_list
9975 is handled like a reference temporary. */
9976 tree ctor = init;
9977 if (TREE_CODE (ctor) == TARGET_EXPR)
9978 ctor = TARGET_EXPR_INITIAL (ctor);
9979 if (TREE_CODE (ctor) == CONSTRUCTOR)
9981 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
9982 array = extend_ref_init_temps_1 (decl, array, cleanups);
9983 CONSTRUCTOR_ELT (ctor, 0)->value = array;
9986 else if (TREE_CODE (init) == CONSTRUCTOR)
9988 unsigned i;
9989 constructor_elt *p;
9990 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (init);
9991 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
9992 p->value = extend_ref_init_temps (decl, p->value, cleanups);
9995 return init;
9998 /* Returns true iff an initializer for TYPE could contain temporaries that
9999 need to be extended because they are bound to references or
10000 std::initializer_list. */
10002 bool
10003 type_has_extended_temps (tree type)
10005 type = strip_array_types (type);
10006 if (TREE_CODE (type) == REFERENCE_TYPE)
10007 return true;
10008 if (CLASS_TYPE_P (type))
10010 if (is_std_init_list (type))
10011 return true;
10012 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10013 f; f = next_initializable_field (DECL_CHAIN (f)))
10014 if (type_has_extended_temps (TREE_TYPE (f)))
10015 return true;
10017 return false;
10020 /* Returns true iff TYPE is some variant of std::initializer_list. */
10022 bool
10023 is_std_init_list (tree type)
10025 /* Look through typedefs. */
10026 if (!TYPE_P (type))
10027 return false;
10028 if (cxx_dialect == cxx98)
10029 return false;
10030 type = TYPE_MAIN_VARIANT (type);
10031 return (CLASS_TYPE_P (type)
10032 && CP_TYPE_CONTEXT (type) == std_node
10033 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
10036 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10037 will accept an argument list of a single std::initializer_list<T>. */
10039 bool
10040 is_list_ctor (tree decl)
10042 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
10043 tree arg;
10045 if (!args || args == void_list_node)
10046 return false;
10048 arg = non_reference (TREE_VALUE (args));
10049 if (!is_std_init_list (arg))
10050 return false;
10052 args = TREE_CHAIN (args);
10054 if (args && args != void_list_node && !TREE_PURPOSE (args))
10055 /* There are more non-defaulted parms. */
10056 return false;
10058 return true;
10061 #include "gt-cp-call.h"