]>
Commit | Line | Data |
---|---|---|
e57b697d | 1 | /* Functions related to invoking -*- C++ -*- methods and overloaded functions. |
a5544970 | 2 | Copyright (C) 1987-2019 Free Software Foundation, Inc. |
8d08fdba | 3 | Contributed by Michael Tiemann (tiemann@cygnus.com) and |
e5e809f4 | 4 | modified by Brendan Kehoe (brendan@cygnus.com). |
8d08fdba | 5 | |
f5adbb8d | 6 | This file is part of GCC. |
8d08fdba | 7 | |
f5adbb8d | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 9 | it under the terms of the GNU General Public License as published by |
e77f031d | 10 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
11 | any later version. |
12 | ||
f5adbb8d | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
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. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
21 | |
22 | ||
e92cc029 | 23 | /* High-level class interface. */ |
8d08fdba MS |
24 | |
25 | #include "config.h" | |
8d052bc7 | 26 | #include "system.h" |
4977bab6 | 27 | #include "coretypes.h" |
2adfab87 | 28 | #include "target.h" |
2adfab87 AM |
29 | #include "cp-tree.h" |
30 | #include "timevar.h" | |
31 | #include "stringpool.h" | |
32 | #include "cgraph.h" | |
d8a2d370 DN |
33 | #include "stor-layout.h" |
34 | #include "trans-mem.h" | |
8d08fdba | 35 | #include "flags.h" |
54f92bfb | 36 | #include "toplev.h" |
d2a6f3c0 | 37 | #include "intl.h" |
7b6d72fc | 38 | #include "convert.h" |
c79efc4d | 39 | #include "langhooks.h" |
61d3ce20 | 40 | #include "c-family/c-objc.h" |
35228ac7 | 41 | #include "internal-fn.h" |
314e6352 ML |
42 | #include "stringpool.h" |
43 | #include "attribs.h" | |
96e6ae57 | 44 | #include "gcc-rich-location.h" |
8d08fdba | 45 | |
5bd61841 MM |
46 | /* The various kinds of conversion. */ |
47 | ||
a79683d5 | 48 | enum conversion_kind { |
5bd61841 MM |
49 | ck_identity, |
50 | ck_lvalue, | |
51dc6603 | 51 | ck_fnptr, |
5bd61841 MM |
52 | ck_qual, |
53 | ck_std, | |
54 | ck_ptr, | |
55 | ck_pmem, | |
56 | ck_base, | |
57 | ck_ref_bind, | |
58 | ck_user, | |
59 | ck_ambig, | |
09357846 JM |
60 | ck_list, |
61 | ck_aggr, | |
5bd61841 | 62 | ck_rvalue |
a79683d5 | 63 | }; |
5bd61841 MM |
64 | |
65 | /* The rank of the conversion. Order of the enumerals matters; better | |
66 | conversions should come earlier in the list. */ | |
67 | ||
a79683d5 | 68 | enum conversion_rank { |
5bd61841 MM |
69 | cr_identity, |
70 | cr_exact, | |
71 | cr_promotion, | |
72 | cr_std, | |
73 | cr_pbool, | |
74 | cr_user, | |
75 | cr_ellipsis, | |
76 | cr_bad | |
a79683d5 | 77 | }; |
5bd61841 MM |
78 | |
79 | /* An implicit conversion sequence, in the sense of [over.best.ics]. | |
80 | The first conversion to be performed is at the end of the chain. | |
c72a1a86 | 81 | That conversion is always a cr_identity conversion. */ |
5bd61841 | 82 | |
5bd61841 MM |
83 | struct conversion { |
84 | /* The kind of conversion represented by this step. */ | |
85 | conversion_kind kind; | |
86 | /* The rank of this conversion. */ | |
87 | conversion_rank rank; | |
88 | BOOL_BITFIELD user_conv_p : 1; | |
89 | BOOL_BITFIELD ellipsis_p : 1; | |
90 | BOOL_BITFIELD this_p : 1; | |
feb6efc1 NF |
91 | /* True if this conversion would be permitted with a bending of |
92 | language standards, e.g. disregarding pointer qualifiers or | |
93 | converting integers to pointers. */ | |
5bd61841 MM |
94 | BOOL_BITFIELD bad_p : 1; |
95 | /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a | |
96 | temporary should be created to hold the result of the | |
929a0122 JM |
97 | conversion. If KIND is ck_ambig, true if the context is |
98 | copy-initialization. */ | |
5bd61841 | 99 | BOOL_BITFIELD need_temporary_p : 1; |
08e17d9d | 100 | /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion |
c8094d83 | 101 | from a pointer-to-derived to pointer-to-base is being performed. */ |
33c25e5c | 102 | BOOL_BITFIELD base_p : 1; |
8af2fec4 RY |
103 | /* If KIND is ck_ref_bind, true when either an lvalue reference is |
104 | being bound to an lvalue expression or an rvalue reference is | |
e5ba9b70 | 105 | being bound to an rvalue expression. If KIND is ck_rvalue or ck_base, |
4ce8c5de | 106 | true when we are treating an lvalue as an rvalue (12.8p33). If |
e5ba9b70 MP |
107 | ck_identity, we will be binding a reference directly or decaying to |
108 | a pointer. */ | |
8af2fec4 | 109 | BOOL_BITFIELD rvaluedness_matches_p: 1; |
09357846 | 110 | BOOL_BITFIELD check_narrowing: 1; |
ed4f2c00 MP |
111 | /* Whether check_narrowing should only check TREE_CONSTANTs; used |
112 | in build_converted_constant_expr. */ | |
113 | BOOL_BITFIELD check_narrowing_const_only: 1; | |
5bd61841 MM |
114 | /* The type of the expression resulting from the conversion. */ |
115 | tree type; | |
116 | union { | |
117 | /* The next conversion in the chain. Since the conversions are | |
118 | arranged from outermost to innermost, the NEXT conversion will | |
119 | actually be performed before this conversion. This variant is | |
3c72114c DS |
120 | used only when KIND is neither ck_identity, ck_ambig nor |
121 | ck_list. Please use the next_conversion function instead | |
122 | of using this field directly. */ | |
5bd61841 MM |
123 | conversion *next; |
124 | /* The expression at the beginning of the conversion chain. This | |
125 | variant is used only if KIND is ck_identity or ck_ambig. */ | |
126 | tree expr; | |
3c72114c DS |
127 | /* The array of conversions for an initializer_list, so this |
128 | variant is used only when KIN D is ck_list. */ | |
09357846 | 129 | conversion **list; |
5bd61841 MM |
130 | } u; |
131 | /* The function candidate corresponding to this conversion | |
132 | sequence. This field is only used if KIND is ck_user. */ | |
133 | struct z_candidate *cand; | |
134 | }; | |
135 | ||
136 | #define CONVERSION_RANK(NODE) \ | |
137 | ((NODE)->bad_p ? cr_bad \ | |
138 | : (NODE)->ellipsis_p ? cr_ellipsis \ | |
139 | : (NODE)->user_conv_p ? cr_user \ | |
140 | : (NODE)->rank) | |
141 | ||
cef62ad4 JM |
142 | #define BAD_CONVERSION_RANK(NODE) \ |
143 | ((NODE)->ellipsis_p ? cr_ellipsis \ | |
144 | : (NODE)->user_conv_p ? cr_user \ | |
145 | : (NODE)->rank) | |
146 | ||
5bd61841 MM |
147 | static struct obstack conversion_obstack; |
148 | static bool conversion_obstack_initialized; | |
feb6efc1 | 149 | struct rejection_reason; |
5bd61841 | 150 | |
b40e334f | 151 | static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t); |
94be8403 | 152 | static int equal_functions (tree, tree); |
b40e334f PC |
153 | static int joust (struct z_candidate *, struct z_candidate *, bool, |
154 | tsubst_flags_t); | |
5bd61841 | 155 | static int compare_ics (conversion *, conversion *); |
e99ef408 JJ |
156 | static void maybe_warn_class_memaccess (location_t, tree, |
157 | const vec<tree, va_gc> *); | |
5ade1ed2 | 158 | static tree build_over_call (struct z_candidate *, int, tsubst_flags_t); |
5ade1ed2 | 159 | #define convert_like(CONV, EXPR, COMPLAIN) \ |
bf31620c | 160 | convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \ |
33c25e5c | 161 | /*issue_conversion_warnings=*/true, \ |
5ade1ed2 DG |
162 | /*c_cast_p=*/false, (COMPLAIN)) |
163 | #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \ | |
bf31620c | 164 | convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \ |
5ade1ed2 DG |
165 | /*issue_conversion_warnings=*/true, \ |
166 | /*c_cast_p=*/false, (COMPLAIN)) | |
bf31620c | 167 | static tree convert_like_real (conversion *, tree, tree, int, bool, |
5ade1ed2 | 168 | bool, tsubst_flags_t); |
a14feb3c DM |
169 | static void op_error (const op_location_t &, enum tree_code, enum tree_code, |
170 | tree, tree, tree, bool); | |
b40e334f PC |
171 | static struct z_candidate *build_user_type_conversion_1 (tree, tree, int, |
172 | tsubst_flags_t); | |
498ad15e | 173 | static void print_z_candidate (location_t, const char *, struct z_candidate *); |
feb6efc1 | 174 | static void print_z_candidates (location_t, struct z_candidate *); |
94be8403 | 175 | static tree build_this (tree); |
436f8a4c | 176 | static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *); |
94be8403 GDR |
177 | static bool any_strictly_viable (struct z_candidate *); |
178 | static struct z_candidate *add_template_candidate | |
9771b263 | 179 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
b40e334f | 180 | tree, tree, tree, int, unification_kind_t, tsubst_flags_t); |
94be8403 | 181 | static struct z_candidate *add_template_candidate_real |
9771b263 | 182 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
b40e334f | 183 | tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t); |
7993382e MM |
184 | static void add_builtin_candidates |
185 | (struct z_candidate **, enum tree_code, enum tree_code, | |
b40e334f | 186 | tree, tree *, int, tsubst_flags_t); |
7993382e MM |
187 | static void add_builtin_candidate |
188 | (struct z_candidate **, enum tree_code, enum tree_code, | |
b40e334f | 189 | tree, tree, tree, tree *, tree *, int, tsubst_flags_t); |
94be8403 | 190 | static bool is_complete (tree); |
c8094d83 | 191 | static void build_builtin_candidate |
7993382e | 192 | (struct z_candidate **, tree, tree, tree, tree *, tree *, |
b40e334f | 193 | int, tsubst_flags_t); |
c8094d83 | 194 | static struct z_candidate *add_conv_candidate |
d4db5060 | 195 | (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree, |
b40e334f | 196 | tree, tsubst_flags_t); |
c8094d83 | 197 | static struct z_candidate *add_function_candidate |
9771b263 | 198 | (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree, |
6147a53a | 199 | tree, int, conversion**, tsubst_flags_t); |
b40e334f PC |
200 | static conversion *implicit_conversion (tree, tree, tree, bool, int, |
201 | tsubst_flags_t); | |
b40e334f PC |
202 | static conversion *reference_binding (tree, tree, tree, bool, int, |
203 | tsubst_flags_t); | |
5bd61841 | 204 | static conversion *build_conv (conversion_kind, tree, conversion *); |
b40e334f | 205 | static conversion *build_list_conv (tree, tree, int, tsubst_flags_t); |
3c72114c | 206 | static conversion *next_conversion (conversion *); |
5bd61841 | 207 | static bool is_subseq (conversion *, conversion *); |
8af2fec4 | 208 | static conversion *maybe_handle_ref_bind (conversion **); |
5bd61841 | 209 | static void maybe_handle_implicit_object (conversion **); |
c8094d83 | 210 | static struct z_candidate *add_candidate |
9771b263 | 211 | (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t, |
4561285b | 212 | conversion **, tree, tree, int, struct rejection_reason *, int); |
5bd61841 | 213 | static tree source_type (conversion *); |
94be8403 | 214 | static void add_warning (struct z_candidate *, struct z_candidate *); |
94be8403 | 215 | static bool reference_compatible_p (tree, tree); |
5bd61841 | 216 | static conversion *direct_reference_binding (tree, conversion *); |
94be8403 | 217 | static bool promoted_arithmetic_type_p (tree); |
b40e334f | 218 | static conversion *conditional_conversion (tree, tree, tsubst_flags_t); |
a723baf1 | 219 | static char *name_as_c_string (tree, tree, bool *); |
14d22dd6 | 220 | static tree prep_operand (tree); |
9771b263 DN |
221 | static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree, |
222 | bool, tree, tree, int, struct z_candidate **, | |
b40e334f | 223 | tsubst_flags_t); |
5bd61841 | 224 | static conversion *merge_conversion_sequences (conversion *, conversion *); |
248ce2f8 | 225 | static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t); |
49c249e1 | 226 | |
1b3d28a8 VR |
227 | /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE. |
228 | NAME can take many forms... */ | |
1c2c08a5 | 229 | |
94be8403 GDR |
230 | bool |
231 | check_dtor_name (tree basetype, tree name) | |
1c2c08a5 | 232 | { |
ee996e9e | 233 | /* Just accept something we've already complained about. */ |
f3400fe2 | 234 | if (name == error_mark_node) |
94be8403 | 235 | return true; |
f3400fe2 | 236 | |
1c2c08a5 JM |
237 | if (TREE_CODE (name) == TYPE_DECL) |
238 | name = TREE_TYPE (name); | |
2f939d94 | 239 | else if (TYPE_P (name)) |
1c2c08a5 | 240 | /* OK */; |
9dc6f476 | 241 | else if (identifier_p (name)) |
1c2c08a5 | 242 | { |
9e1e64ec | 243 | if ((MAYBE_CLASS_TYPE_P (basetype) |
56b2a94b NS |
244 | || TREE_CODE (basetype) == ENUMERAL_TYPE) |
245 | && name == constructor_name (basetype)) | |
1b3d28a8 | 246 | return true; |
1c2c08a5 JM |
247 | else |
248 | name = get_type_value (name); | |
249 | } | |
250 | else | |
8dc2b103 NS |
251 | { |
252 | /* In the case of: | |
c8094d83 | 253 | |
0cbd7506 MS |
254 | template <class T> struct S { ~S(); }; |
255 | int i; | |
256 | i.~S(); | |
c8094d83 | 257 | |
0cbd7506 | 258 | NAME will be a class template. */ |
8dc2b103 NS |
259 | gcc_assert (DECL_CLASS_TEMPLATE_P (name)); |
260 | return false; | |
261 | } | |
1c2c08a5 | 262 | |
b792a33c | 263 | if (!name || name == error_mark_node) |
1b3d28a8 VR |
264 | return false; |
265 | return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name)); | |
1c2c08a5 JM |
266 | } |
267 | ||
277294d7 JM |
268 | /* We want the address of a function or method. We avoid creating a |
269 | pointer-to-member function. */ | |
270 | ||
271 | tree | |
89fcabaf | 272 | build_addr_func (tree function, tsubst_flags_t complain) |
277294d7 JM |
273 | { |
274 | tree type = TREE_TYPE (function); | |
878cd289 | 275 | |
277294d7 JM |
276 | /* We have to do these by hand to avoid real pointer to member |
277 | functions. */ | |
278 | if (TREE_CODE (type) == METHOD_TYPE) | |
8d08fdba | 279 | { |
d6b4ea85 MM |
280 | if (TREE_CODE (function) == OFFSET_REF) |
281 | { | |
282 | tree object = build_address (TREE_OPERAND (function, 0)); | |
283 | return get_member_function_from_ptrfunc (&object, | |
89fcabaf PC |
284 | TREE_OPERAND (function, 1), |
285 | complain); | |
d6b4ea85 MM |
286 | } |
287 | function = build_address (function); | |
277294d7 JM |
288 | } |
289 | else | |
1807ffc1 | 290 | function = decay_conversion (function, complain, /*reject_builtin=*/false); |
8d08fdba | 291 | |
277294d7 JM |
292 | return function; |
293 | } | |
8d08fdba | 294 | |
277294d7 JM |
295 | /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or |
296 | POINTER_TYPE to those. Note, pointer to member function types | |
94a0dd7b SL |
297 | (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are |
298 | two variants. build_call_a is the primitive taking an array of | |
299 | arguments, while build_call_n is a wrapper that handles varargs. */ | |
8d08fdba MS |
300 | |
301 | tree | |
94a0dd7b SL |
302 | build_call_n (tree function, int n, ...) |
303 | { | |
304 | if (n == 0) | |
305 | return build_call_a (function, 0, NULL); | |
306 | else | |
307 | { | |
86b8fed1 | 308 | tree *argarray = XALLOCAVEC (tree, n); |
94a0dd7b SL |
309 | va_list ap; |
310 | int i; | |
311 | ||
312 | va_start (ap, n); | |
313 | for (i = 0; i < n; i++) | |
314 | argarray[i] = va_arg (ap, tree); | |
315 | va_end (ap); | |
316 | return build_call_a (function, n, argarray); | |
317 | } | |
318 | } | |
319 | ||
5507a6c3 JM |
320 | /* Update various flags in cfun and the call itself based on what is being |
321 | called. Split out of build_call_a so that bot_manip can use it too. */ | |
322 | ||
323 | void | |
324 | set_flags_from_callee (tree call) | |
325 | { | |
0932d398 MP |
326 | /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */ |
327 | tree decl = cp_get_callee_fndecl_nofold (call); | |
5507a6c3 JM |
328 | |
329 | /* We check both the decl and the type; a function may be known not to | |
330 | throw without being declared throw(). */ | |
0932d398 MP |
331 | bool nothrow = decl && TREE_NOTHROW (decl); |
332 | tree callee = cp_get_callee (call); | |
333 | if (callee) | |
334 | nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee))); | |
335 | else if (TREE_CODE (call) == CALL_EXPR | |
336 | && internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW) | |
35228ac7 | 337 | nothrow = true; |
5507a6c3 JM |
338 | |
339 | if (!nothrow && at_function_scope_p () && cfun && cp_function_chain) | |
340 | cp_function_chain->can_throw = 1; | |
341 | ||
342 | if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain) | |
343 | current_function_returns_abnormally = 1; | |
344 | ||
345 | TREE_NOTHROW (call) = nothrow; | |
346 | } | |
347 | ||
94a0dd7b SL |
348 | tree |
349 | build_call_a (tree function, int n, tree *argarray) | |
8d08fdba | 350 | { |
7c76b292 | 351 | tree decl; |
0c11ada6 | 352 | tree result_type; |
5aa3396c | 353 | tree fntype; |
94a0dd7b | 354 | int i; |
8d08fdba | 355 | |
89fcabaf | 356 | function = build_addr_func (function, tf_warning_or_error); |
8d08fdba | 357 | |
d4f0f205 | 358 | gcc_assert (TYPE_PTR_P (TREE_TYPE (function))); |
5aa3396c | 359 | fntype = TREE_TYPE (TREE_TYPE (function)); |
d4f0f205 MM |
360 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE |
361 | || TREE_CODE (fntype) == METHOD_TYPE); | |
5aa3396c | 362 | result_type = TREE_TYPE (fntype); |
a638b034 JM |
363 | /* An rvalue has no cv-qualifiers. */ |
364 | if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type)) | |
365 | result_type = cv_unqualified (result_type); | |
0c11ada6 | 366 | |
5507a6c3 JM |
367 | function = build_call_array_loc (input_location, |
368 | result_type, function, n, argarray); | |
369 | set_flags_from_callee (function); | |
e23bd218 | 370 | |
5507a6c3 | 371 | decl = get_callee_fndecl (function); |
8288cc73 | 372 | |
5507a6c3 JM |
373 | if (decl && !TREE_USED (decl)) |
374 | { | |
375 | /* We invoke build_call directly for several library | |
376 | functions. These may have been declared normally if | |
377 | we're building libgcc, so we can't just check | |
378 | DECL_ARTIFICIAL. */ | |
379 | gcc_assert (DECL_ARTIFICIAL (decl) | |
380 | || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)), | |
381 | "__", 2)); | |
382 | mark_used (decl); | |
383 | } | |
efe49da0 | 384 | |
5aa3396c | 385 | require_complete_eh_spec_types (fntype, decl); |
e23bd218 | 386 | |
5507a6c3 | 387 | TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl)); |
8d08fdba | 388 | |
7c76b292 | 389 | /* Don't pass empty class objects by value. This is useful |
570221c2 JM |
390 | for tags in STL, which are used to control overload resolution. |
391 | We don't need to handle other cases of copying empty classes. */ | |
3d78e008 | 392 | if (!decl || !fndecl_built_in_p (decl)) |
94a0dd7b | 393 | for (i = 0; i < n; i++) |
5507a6c3 JM |
394 | { |
395 | tree arg = CALL_EXPR_ARG (function, i); | |
9f285ccb JM |
396 | if (is_empty_class (TREE_TYPE (arg)) |
397 | && ! TREE_ADDRESSABLE (TREE_TYPE (arg))) | |
5507a6c3 | 398 | { |
9f285ccb JM |
399 | tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg)); |
400 | arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t); | |
401 | CALL_EXPR_ARG (function, i) = arg; | |
2ee35bea | 402 | } |
5507a6c3 | 403 | } |
c8094d83 | 404 | |
277294d7 JM |
405 | return function; |
406 | } | |
8d08fdba | 407 | |
c73964b2 MS |
408 | /* New overloading code. */ |
409 | ||
a79683d5 | 410 | struct z_candidate; |
5bd61841 | 411 | |
5bd61841 MM |
412 | struct candidate_warning { |
413 | z_candidate *loser; | |
414 | candidate_warning *next; | |
415 | }; | |
416 | ||
feb6efc1 NF |
417 | /* Information for providing diagnostics about why overloading failed. */ |
418 | ||
419 | enum rejection_reason_code { | |
420 | rr_none, | |
421 | rr_arity, | |
b028af11 | 422 | rr_explicit_conversion, |
c8580138 | 423 | rr_template_conversion, |
feb6efc1 | 424 | rr_arg_conversion, |
3d2f6864 NF |
425 | rr_bad_arg_conversion, |
426 | rr_template_unification, | |
971e17ff | 427 | rr_invalid_copy, |
31f7f784 | 428 | rr_inherited_ctor, |
971e17ff | 429 | rr_constraint_failure |
feb6efc1 NF |
430 | }; |
431 | ||
432 | struct conversion_info { | |
433 | /* The index of the argument, 0-based. */ | |
434 | int n_arg; | |
89606913 JM |
435 | /* The actual argument or its type. */ |
436 | tree from; | |
437 | /* The type of the parameter. */ | |
feb6efc1 | 438 | tree to_type; |
4911b24d DM |
439 | /* The location of the argument. */ |
440 | location_t loc; | |
feb6efc1 NF |
441 | }; |
442 | ||
443 | struct rejection_reason { | |
444 | enum rejection_reason_code code; | |
445 | union { | |
446 | /* Information about an arity mismatch. */ | |
447 | struct { | |
448 | /* The expected number of arguments. */ | |
449 | int expected; | |
450 | /* The actual number of arguments in the call. */ | |
451 | int actual; | |
452 | /* Whether the call was a varargs call. */ | |
453 | bool call_varargs_p; | |
454 | } arity; | |
455 | /* Information about an argument conversion mismatch. */ | |
456 | struct conversion_info conversion; | |
457 | /* Same, but for bad argument conversions. */ | |
458 | struct conversion_info bad_conversion; | |
3d2f6864 NF |
459 | /* Information about template unification failures. These are the |
460 | parameters passed to fn_type_unification. */ | |
461 | struct { | |
462 | tree tmpl; | |
463 | tree explicit_targs; | |
cd057e3a | 464 | int num_targs; |
3d2f6864 NF |
465 | const tree *args; |
466 | unsigned int nargs; | |
467 | tree return_type; | |
468 | unification_kind_t strict; | |
469 | int flags; | |
470 | } template_unification; | |
471 | /* Information about template instantiation failures. These are the | |
472 | parameters passed to instantiate_template. */ | |
473 | struct { | |
474 | tree tmpl; | |
475 | tree targs; | |
476 | } template_instantiation; | |
feb6efc1 NF |
477 | } u; |
478 | }; | |
479 | ||
5bd61841 | 480 | struct z_candidate { |
4ba126e4 MM |
481 | /* The FUNCTION_DECL that will be called if this candidate is |
482 | selected by overload resolution. */ | |
c73964b2 | 483 | tree fn; |
c166b898 ILT |
484 | /* If not NULL_TREE, the first argument to use when calling this |
485 | function. */ | |
486 | tree first_arg; | |
487 | /* The rest of the arguments to use when calling this function. If | |
488 | there are no further arguments this may be NULL or it may be an | |
489 | empty vector. */ | |
9771b263 | 490 | const vec<tree, va_gc> *args; |
3d938426 MM |
491 | /* The implicit conversion sequences for each of the arguments to |
492 | FN. */ | |
5bd61841 MM |
493 | conversion **convs; |
494 | /* The number of implicit conversion sequences. */ | |
495 | size_t num_convs; | |
3d938426 MM |
496 | /* If FN is a user-defined conversion, the standard conversion |
497 | sequence from the type returned by FN to the desired destination | |
498 | type. */ | |
5bd61841 | 499 | conversion *second_conv; |
feb6efc1 | 500 | struct rejection_reason *reason; |
4ba126e4 MM |
501 | /* If FN is a member function, the binfo indicating the path used to |
502 | qualify the name of FN at the call site. This path is used to | |
503 | determine whether or not FN is accessible if it is selected by | |
504 | overload resolution. The DECL_CONTEXT of FN will always be a | |
505 | (possibly improper) base of this binfo. */ | |
506 | tree access_path; | |
507 | /* If FN is a non-static member function, the binfo indicating the | |
508 | subobject to which the `this' pointer should be converted if FN | |
4bedcb19 | 509 | is selected by overload resolution. The type pointed to by |
4ba126e4 MM |
510 | the `this' pointer must correspond to the most derived class |
511 | indicated by the CONVERSION_PATH. */ | |
512 | tree conversion_path; | |
ea0ad329 | 513 | tree template_decl; |
f18ea1bf | 514 | tree explicit_targs; |
5bd61841 MM |
515 | candidate_warning *warnings; |
516 | z_candidate *next; | |
4561285b JM |
517 | int viable; |
518 | ||
519 | /* The flags active in add_candidate. */ | |
520 | int flags; | |
c73964b2 MS |
521 | }; |
522 | ||
c30b4add MM |
523 | /* Returns true iff T is a null pointer constant in the sense of |
524 | [conv.ptr]. */ | |
525 | ||
94be8403 GDR |
526 | bool |
527 | null_ptr_cst_p (tree t) | |
c73964b2 | 528 | { |
5916cfd0 PC |
529 | tree type = TREE_TYPE (t); |
530 | ||
a7a64a77 MM |
531 | /* [conv.ptr] |
532 | ||
533 | A null pointer constant is an integral constant expression | |
14c2101d JM |
534 | (_expr.const_) rvalue of integer type that evaluates to zero or |
535 | an rvalue of type std::nullptr_t. */ | |
5916cfd0 | 536 | if (NULLPTR_TYPE_P (type)) |
94be8403 | 537 | return true; |
5916cfd0 PC |
538 | |
539 | if (cxx_dialect >= cxx11) | |
41990f96 | 540 | { |
9a004410 DM |
541 | STRIP_ANY_LOCATION_WRAPPER (t); |
542 | ||
27bec7bf | 543 | /* Core issue 903 says only literal 0 is a null pointer constant. */ |
5916cfd0 | 544 | if (TREE_CODE (type) == INTEGER_TYPE |
c67c64ef | 545 | && !char_type_p (type) |
5916cfd0 PC |
546 | && TREE_CODE (t) == INTEGER_CST |
547 | && integer_zerop (t) | |
548 | && !TREE_OVERFLOW (t)) | |
549 | return true; | |
550 | } | |
551 | else if (CP_INTEGRAL_TYPE_P (type)) | |
552 | { | |
e56f6629 | 553 | t = fold_non_dependent_expr (t, tf_none); |
5a6bdb0d | 554 | STRIP_NOPS (t); |
27bec7bf JM |
555 | if (integer_zerop (t) && !TREE_OVERFLOW (t)) |
556 | return true; | |
41990f96 | 557 | } |
5916cfd0 | 558 | |
94be8403 | 559 | return false; |
c73964b2 MS |
560 | } |
561 | ||
e90abaa0 JM |
562 | /* Returns true iff T is a null member pointer value (4.11). */ |
563 | ||
564 | bool | |
565 | null_member_pointer_value_p (tree t) | |
566 | { | |
567 | tree type = TREE_TYPE (t); | |
568 | if (!type) | |
569 | return false; | |
570 | else if (TYPE_PTRMEMFUNC_P (type)) | |
571 | return (TREE_CODE (t) == CONSTRUCTOR | |
572 | && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value)); | |
66b1156a | 573 | else if (TYPE_PTRDATAMEM_P (type)) |
e90abaa0 JM |
574 | return integer_all_onesp (t); |
575 | else | |
576 | return false; | |
577 | } | |
578 | ||
2602f8fe JM |
579 | /* Returns nonzero if PARMLIST consists of only default parms, |
580 | ellipsis, and/or undeduced parameter packs. */ | |
a11d04b5 | 581 | |
94be8403 | 582 | bool |
58f9752a | 583 | sufficient_parms_p (const_tree parmlist) |
a11d04b5 NS |
584 | { |
585 | for (; parmlist && parmlist != void_list_node; | |
586 | parmlist = TREE_CHAIN (parmlist)) | |
2602f8fe JM |
587 | if (!TREE_PURPOSE (parmlist) |
588 | && !PACK_EXPANSION_P (TREE_VALUE (parmlist))) | |
94be8403 GDR |
589 | return false; |
590 | return true; | |
a11d04b5 NS |
591 | } |
592 | ||
5bd61841 MM |
593 | /* Allocate N bytes of memory from the conversion obstack. The memory |
594 | is zeroed before being returned. */ | |
595 | ||
596 | static void * | |
597 | conversion_obstack_alloc (size_t n) | |
c73964b2 | 598 | { |
5bd61841 MM |
599 | void *p; |
600 | if (!conversion_obstack_initialized) | |
601 | { | |
602 | gcc_obstack_init (&conversion_obstack); | |
603 | conversion_obstack_initialized = true; | |
604 | } | |
605 | p = obstack_alloc (&conversion_obstack, n); | |
606 | memset (p, 0, n); | |
607 | return p; | |
608 | } | |
609 | ||
feb6efc1 NF |
610 | /* Allocate rejection reasons. */ |
611 | ||
612 | static struct rejection_reason * | |
613 | alloc_rejection (enum rejection_reason_code code) | |
614 | { | |
615 | struct rejection_reason *p; | |
616 | p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p); | |
617 | p->code = code; | |
618 | return p; | |
619 | } | |
620 | ||
621 | static struct rejection_reason * | |
622 | arity_rejection (tree first_arg, int expected, int actual) | |
623 | { | |
624 | struct rejection_reason *r = alloc_rejection (rr_arity); | |
625 | int adjust = first_arg != NULL_TREE; | |
626 | r->u.arity.expected = expected - adjust; | |
627 | r->u.arity.actual = actual - adjust; | |
628 | return r; | |
629 | } | |
630 | ||
631 | static struct rejection_reason * | |
4911b24d DM |
632 | arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to, |
633 | location_t loc) | |
feb6efc1 NF |
634 | { |
635 | struct rejection_reason *r = alloc_rejection (rr_arg_conversion); | |
636 | int adjust = first_arg != NULL_TREE; | |
637 | r->u.conversion.n_arg = n_arg - adjust; | |
89606913 | 638 | r->u.conversion.from = from; |
feb6efc1 | 639 | r->u.conversion.to_type = to; |
4911b24d | 640 | r->u.conversion.loc = loc; |
feb6efc1 NF |
641 | return r; |
642 | } | |
643 | ||
644 | static struct rejection_reason * | |
4911b24d DM |
645 | bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to, |
646 | location_t loc) | |
feb6efc1 NF |
647 | { |
648 | struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion); | |
649 | int adjust = first_arg != NULL_TREE; | |
650 | r->u.bad_conversion.n_arg = n_arg - adjust; | |
89606913 | 651 | r->u.bad_conversion.from = from; |
feb6efc1 | 652 | r->u.bad_conversion.to_type = to; |
4911b24d | 653 | r->u.bad_conversion.loc = loc; |
feb6efc1 NF |
654 | return r; |
655 | } | |
656 | ||
b028af11 JM |
657 | static struct rejection_reason * |
658 | explicit_conversion_rejection (tree from, tree to) | |
659 | { | |
660 | struct rejection_reason *r = alloc_rejection (rr_explicit_conversion); | |
661 | r->u.conversion.n_arg = 0; | |
89606913 | 662 | r->u.conversion.from = from; |
b028af11 | 663 | r->u.conversion.to_type = to; |
4911b24d | 664 | r->u.conversion.loc = UNKNOWN_LOCATION; |
b028af11 JM |
665 | return r; |
666 | } | |
667 | ||
c8580138 JM |
668 | static struct rejection_reason * |
669 | template_conversion_rejection (tree from, tree to) | |
670 | { | |
671 | struct rejection_reason *r = alloc_rejection (rr_template_conversion); | |
672 | r->u.conversion.n_arg = 0; | |
89606913 | 673 | r->u.conversion.from = from; |
c8580138 | 674 | r->u.conversion.to_type = to; |
4911b24d | 675 | r->u.conversion.loc = UNKNOWN_LOCATION; |
c8580138 JM |
676 | return r; |
677 | } | |
678 | ||
3d2f6864 NF |
679 | static struct rejection_reason * |
680 | template_unification_rejection (tree tmpl, tree explicit_targs, tree targs, | |
681 | const tree *args, unsigned int nargs, | |
682 | tree return_type, unification_kind_t strict, | |
683 | int flags) | |
684 | { | |
685 | size_t args_n_bytes = sizeof (*args) * nargs; | |
686 | tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes); | |
687 | struct rejection_reason *r = alloc_rejection (rr_template_unification); | |
688 | r->u.template_unification.tmpl = tmpl; | |
689 | r->u.template_unification.explicit_targs = explicit_targs; | |
cd057e3a | 690 | r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs); |
3d2f6864 NF |
691 | /* Copy args to our own storage. */ |
692 | memcpy (args1, args, args_n_bytes); | |
693 | r->u.template_unification.args = args1; | |
694 | r->u.template_unification.nargs = nargs; | |
695 | r->u.template_unification.return_type = return_type; | |
696 | r->u.template_unification.strict = strict; | |
697 | r->u.template_unification.flags = flags; | |
698 | return r; | |
699 | } | |
700 | ||
701 | static struct rejection_reason * | |
702 | template_unification_error_rejection (void) | |
703 | { | |
704 | return alloc_rejection (rr_template_unification); | |
705 | } | |
706 | ||
3d2f6864 NF |
707 | static struct rejection_reason * |
708 | invalid_copy_with_fn_template_rejection (void) | |
709 | { | |
710 | struct rejection_reason *r = alloc_rejection (rr_invalid_copy); | |
711 | return r; | |
712 | } | |
713 | ||
31f7f784 JM |
714 | static struct rejection_reason * |
715 | inherited_ctor_rejection (void) | |
716 | { | |
717 | struct rejection_reason *r = alloc_rejection (rr_inherited_ctor); | |
718 | return r; | |
719 | } | |
720 | ||
971e17ff AS |
721 | // Build a constraint failure record, saving information into the |
722 | // template_instantiation field of the rejection. If FN is not a template | |
723 | // declaration, the TMPL member is the FN declaration and TARGS is empty. | |
724 | ||
725 | static struct rejection_reason * | |
726 | constraint_failure (tree fn) | |
727 | { | |
728 | struct rejection_reason *r = alloc_rejection (rr_constraint_failure); | |
729 | if (tree ti = DECL_TEMPLATE_INFO (fn)) | |
730 | { | |
731 | r->u.template_instantiation.tmpl = TI_TEMPLATE (ti); | |
732 | r->u.template_instantiation.targs = TI_ARGS (ti); | |
733 | } | |
734 | else | |
735 | { | |
736 | r->u.template_instantiation.tmpl = fn; | |
737 | r->u.template_instantiation.targs = NULL_TREE; | |
738 | } | |
739 | return r; | |
740 | } | |
741 | ||
5bd61841 MM |
742 | /* Dynamically allocate a conversion. */ |
743 | ||
744 | static conversion * | |
745 | alloc_conversion (conversion_kind kind) | |
746 | { | |
747 | conversion *c; | |
67f5655f | 748 | c = (conversion *) conversion_obstack_alloc (sizeof (conversion)); |
5bd61841 MM |
749 | c->kind = kind; |
750 | return c; | |
751 | } | |
752 | ||
5bd61841 MM |
753 | /* Make sure that all memory on the conversion obstack has been |
754 | freed. */ | |
755 | ||
756 | void | |
757 | validate_conversion_obstack (void) | |
758 | { | |
759 | if (conversion_obstack_initialized) | |
c8094d83 | 760 | gcc_assert ((obstack_next_free (&conversion_obstack) |
50bc768d | 761 | == obstack_base (&conversion_obstack))); |
5bd61841 MM |
762 | } |
763 | ||
5bd61841 MM |
764 | /* Dynamically allocate an array of N conversions. */ |
765 | ||
766 | static conversion ** | |
767 | alloc_conversions (size_t n) | |
768 | { | |
67f5655f | 769 | return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *)); |
5bd61841 MM |
770 | } |
771 | ||
772 | static conversion * | |
773 | build_conv (conversion_kind code, tree type, conversion *from) | |
774 | { | |
775 | conversion *t; | |
776 | conversion_rank rank = CONVERSION_RANK (from); | |
519c9806 | 777 | |
09357846 JM |
778 | /* Note that the caller is responsible for filling in t->cand for |
779 | user-defined conversions. */ | |
5bd61841 MM |
780 | t = alloc_conversion (code); |
781 | t->type = type; | |
782 | t->u.next = from; | |
519c9806 | 783 | |
c73964b2 MS |
784 | switch (code) |
785 | { | |
5bd61841 MM |
786 | case ck_ptr: |
787 | case ck_pmem: | |
788 | case ck_base: | |
789 | case ck_std: | |
790 | if (rank < cr_std) | |
791 | rank = cr_std; | |
c73964b2 MS |
792 | break; |
793 | ||
5bd61841 | 794 | case ck_qual: |
51dc6603 | 795 | case ck_fnptr: |
5bd61841 MM |
796 | if (rank < cr_exact) |
797 | rank = cr_exact; | |
798 | break; | |
c73964b2 MS |
799 | |
800 | default: | |
801 | break; | |
802 | } | |
5bd61841 MM |
803 | t->rank = rank; |
804 | t->user_conv_p = (code == ck_user || from->user_conv_p); | |
805 | t->bad_p = from->bad_p; | |
33c25e5c | 806 | t->base_p = false; |
c73964b2 MS |
807 | return t; |
808 | } | |
809 | ||
09357846 JM |
810 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a |
811 | specialization of std::initializer_list<T>, if such a conversion is | |
812 | possible. */ | |
813 | ||
814 | static conversion * | |
b40e334f | 815 | build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
09357846 JM |
816 | { |
817 | tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0); | |
818 | unsigned len = CONSTRUCTOR_NELTS (ctor); | |
819 | conversion **subconvs = alloc_conversions (len); | |
820 | conversion *t; | |
821 | unsigned i; | |
822 | tree val; | |
823 | ||
e5901560 JM |
824 | /* Within a list-initialization we can have more user-defined |
825 | conversions. */ | |
826 | flags &= ~LOOKUP_NO_CONVERSION; | |
827 | /* But no narrowing conversions. */ | |
828 | flags |= LOOKUP_NO_NARROWING; | |
829 | ||
5806f771 | 830 | /* Can't make an array of these types. */ |
9f613f06 | 831 | if (TYPE_REF_P (elttype) |
5806f771 JM |
832 | || TREE_CODE (elttype) == FUNCTION_TYPE |
833 | || VOID_TYPE_P (elttype)) | |
834 | return NULL; | |
835 | ||
09357846 JM |
836 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
837 | { | |
838 | conversion *sub | |
839 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 840 | false, flags, complain); |
09357846 JM |
841 | if (sub == NULL) |
842 | return NULL; | |
843 | ||
844 | subconvs[i] = sub; | |
845 | } | |
846 | ||
847 | t = alloc_conversion (ck_list); | |
848 | t->type = type; | |
849 | t->u.list = subconvs; | |
850 | t->rank = cr_exact; | |
851 | ||
852 | for (i = 0; i < len; ++i) | |
853 | { | |
854 | conversion *sub = subconvs[i]; | |
855 | if (sub->rank > t->rank) | |
856 | t->rank = sub->rank; | |
857 | if (sub->user_conv_p) | |
858 | t->user_conv_p = true; | |
859 | if (sub->bad_p) | |
860 | t->bad_p = true; | |
861 | } | |
862 | ||
863 | return t; | |
864 | } | |
865 | ||
3c72114c DS |
866 | /* Return the next conversion of the conversion chain (if applicable), |
867 | or NULL otherwise. Please use this function instead of directly | |
868 | accessing fields of struct conversion. */ | |
869 | ||
870 | static conversion * | |
871 | next_conversion (conversion *conv) | |
872 | { | |
873 | if (conv == NULL | |
874 | || conv->kind == ck_identity | |
875 | || conv->kind == ck_ambig | |
876 | || conv->kind == ck_list) | |
877 | return NULL; | |
878 | return conv->u.next; | |
879 | } | |
880 | ||
bc99421e JM |
881 | /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list, |
882 | is a valid aggregate initializer for array type ATYPE. */ | |
883 | ||
884 | static bool | |
b40e334f | 885 | can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain) |
bc99421e JM |
886 | { |
887 | unsigned i; | |
888 | tree elttype = TREE_TYPE (atype); | |
889 | for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i) | |
890 | { | |
891 | tree val = CONSTRUCTOR_ELT (ctor, i)->value; | |
892 | bool ok; | |
893 | if (TREE_CODE (elttype) == ARRAY_TYPE | |
894 | && TREE_CODE (val) == CONSTRUCTOR) | |
b40e334f | 895 | ok = can_convert_array (elttype, val, flags, complain); |
bc99421e | 896 | else |
b40e334f PC |
897 | ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags, |
898 | complain); | |
bc99421e JM |
899 | if (!ok) |
900 | return false; | |
901 | } | |
902 | return true; | |
903 | } | |
904 | ||
09357846 JM |
905 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an |
906 | aggregate class, if such a conversion is possible. */ | |
907 | ||
908 | static conversion * | |
b40e334f | 909 | build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
09357846 JM |
910 | { |
911 | unsigned HOST_WIDE_INT i = 0; | |
912 | conversion *c; | |
d4b5fb22 | 913 | tree field = next_initializable_field (TYPE_FIELDS (type)); |
4c9b3895 | 914 | tree empty_ctor = NULL_TREE; |
09357846 | 915 | |
9fa6ffe1 | 916 | /* We already called reshape_init in implicit_conversion. */ |
743af85b | 917 | |
a33ad58b JM |
918 | /* The conversions within the init-list aren't affected by the enclosing |
919 | context; they're always simple copy-initialization. */ | |
920 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; | |
408249b2 | 921 | |
910ad8de | 922 | for (; field; field = next_initializable_field (DECL_CHAIN (field))) |
09357846 | 923 | { |
bc99421e JM |
924 | tree ftype = TREE_TYPE (field); |
925 | tree val; | |
926 | bool ok; | |
927 | ||
09357846 | 928 | if (i < CONSTRUCTOR_NELTS (ctor)) |
bc99421e | 929 | val = CONSTRUCTOR_ELT (ctor, i)->value; |
45c3e69b | 930 | else if (DECL_INITIAL (field)) |
9fb82e65 | 931 | val = get_nsdmi (field, /*ctor*/false, complain); |
9f613f06 | 932 | else if (TYPE_REF_P (ftype)) |
1b87c991 JM |
933 | /* Value-initialization of reference is ill-formed. */ |
934 | return NULL; | |
4c9b3895 JM |
935 | else |
936 | { | |
937 | if (empty_ctor == NULL_TREE) | |
938 | empty_ctor = build_constructor (init_list_type_node, NULL); | |
bc99421e | 939 | val = empty_ctor; |
4c9b3895 | 940 | } |
bc99421e JM |
941 | ++i; |
942 | ||
943 | if (TREE_CODE (ftype) == ARRAY_TYPE | |
944 | && TREE_CODE (val) == CONSTRUCTOR) | |
b40e334f | 945 | ok = can_convert_array (ftype, val, flags, complain); |
bc99421e | 946 | else |
b40e334f PC |
947 | ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags, |
948 | complain); | |
bc99421e JM |
949 | |
950 | if (!ok) | |
951 | return NULL; | |
952 | ||
953 | if (TREE_CODE (type) == UNION_TYPE) | |
954 | break; | |
09357846 JM |
955 | } |
956 | ||
d4b5fb22 JM |
957 | if (i < CONSTRUCTOR_NELTS (ctor)) |
958 | return NULL; | |
959 | ||
09357846 JM |
960 | c = alloc_conversion (ck_aggr); |
961 | c->type = type; | |
962 | c->rank = cr_exact; | |
963 | c->user_conv_p = true; | |
408249b2 | 964 | c->check_narrowing = true; |
09357846 JM |
965 | c->u.next = NULL; |
966 | return c; | |
967 | } | |
968 | ||
dd35aac7 JM |
969 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an |
970 | array type, if such a conversion is possible. */ | |
971 | ||
972 | static conversion * | |
b40e334f | 973 | build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
dd35aac7 JM |
974 | { |
975 | conversion *c; | |
976 | unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor); | |
977 | tree elttype = TREE_TYPE (type); | |
978 | unsigned i; | |
979 | tree val; | |
980 | bool bad = false; | |
981 | bool user = false; | |
982 | enum conversion_rank rank = cr_exact; | |
983 | ||
24991604 JM |
984 | /* We might need to propagate the size from the element to the array. */ |
985 | complete_type (type); | |
986 | ||
cd3ef6f7 JM |
987 | if (TYPE_DOMAIN (type) |
988 | && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE)) | |
dd35aac7 | 989 | { |
ae7e9ddd | 990 | unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type)); |
dd35aac7 JM |
991 | if (alen < len) |
992 | return NULL; | |
993 | } | |
994 | ||
a33ad58b JM |
995 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
996 | ||
dd35aac7 JM |
997 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
998 | { | |
999 | conversion *sub | |
1000 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 1001 | false, flags, complain); |
dd35aac7 JM |
1002 | if (sub == NULL) |
1003 | return NULL; | |
1004 | ||
1005 | if (sub->rank > rank) | |
1006 | rank = sub->rank; | |
1007 | if (sub->user_conv_p) | |
1008 | user = true; | |
1009 | if (sub->bad_p) | |
1010 | bad = true; | |
1011 | } | |
1012 | ||
1013 | c = alloc_conversion (ck_aggr); | |
1014 | c->type = type; | |
1015 | c->rank = rank; | |
1016 | c->user_conv_p = user; | |
1017 | c->bad_p = bad; | |
1018 | c->u.next = NULL; | |
1019 | return c; | |
1020 | } | |
1021 | ||
77a30e9a JM |
1022 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a |
1023 | complex type, if such a conversion is possible. */ | |
1024 | ||
1025 | static conversion * | |
b40e334f PC |
1026 | build_complex_conv (tree type, tree ctor, int flags, |
1027 | tsubst_flags_t complain) | |
77a30e9a JM |
1028 | { |
1029 | conversion *c; | |
1030 | unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor); | |
1031 | tree elttype = TREE_TYPE (type); | |
1032 | unsigned i; | |
1033 | tree val; | |
1034 | bool bad = false; | |
1035 | bool user = false; | |
1036 | enum conversion_rank rank = cr_exact; | |
1037 | ||
1038 | if (len != 2) | |
1039 | return NULL; | |
1040 | ||
a33ad58b JM |
1041 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
1042 | ||
77a30e9a JM |
1043 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
1044 | { | |
1045 | conversion *sub | |
1046 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 1047 | false, flags, complain); |
77a30e9a JM |
1048 | if (sub == NULL) |
1049 | return NULL; | |
1050 | ||
1051 | if (sub->rank > rank) | |
1052 | rank = sub->rank; | |
1053 | if (sub->user_conv_p) | |
1054 | user = true; | |
1055 | if (sub->bad_p) | |
1056 | bad = true; | |
1057 | } | |
1058 | ||
1059 | c = alloc_conversion (ck_aggr); | |
1060 | c->type = type; | |
1061 | c->rank = rank; | |
1062 | c->user_conv_p = user; | |
1063 | c->bad_p = bad; | |
1064 | c->u.next = NULL; | |
1065 | return c; | |
1066 | } | |
1067 | ||
5bd61841 | 1068 | /* Build a representation of the identity conversion from EXPR to |
78dcd41a | 1069 | itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */ |
5bd61841 MM |
1070 | |
1071 | static conversion * | |
1072 | build_identity_conv (tree type, tree expr) | |
1073 | { | |
1074 | conversion *c; | |
c8094d83 | 1075 | |
5bd61841 MM |
1076 | c = alloc_conversion (ck_identity); |
1077 | c->type = type; | |
1078 | c->u.expr = expr; | |
1079 | ||
1080 | return c; | |
1081 | } | |
1082 | ||
1083 | /* Converting from EXPR to TYPE was ambiguous in the sense that there | |
1084 | were multiple user-defined conversions to accomplish the job. | |
1085 | Build a conversion that indicates that ambiguity. */ | |
1086 | ||
1087 | static conversion * | |
1088 | build_ambiguous_conv (tree type, tree expr) | |
1089 | { | |
1090 | conversion *c; | |
1091 | ||
1092 | c = alloc_conversion (ck_ambig); | |
1093 | c->type = type; | |
1094 | c->u.expr = expr; | |
1095 | ||
1096 | return c; | |
1097 | } | |
1098 | ||
a7a64a77 | 1099 | tree |
94be8403 | 1100 | strip_top_quals (tree t) |
de22184b MS |
1101 | { |
1102 | if (TREE_CODE (t) == ARRAY_TYPE) | |
1103 | return t; | |
7d149679 | 1104 | return cp_build_qualified_type (t, 0); |
de22184b MS |
1105 | } |
1106 | ||
c73964b2 MS |
1107 | /* Returns the standard conversion path (see [conv]) from type FROM to type |
1108 | TO, if any. For proper handling of null pointer constants, you must | |
34b5375f MM |
1109 | also pass the expression EXPR to convert from. If C_CAST_P is true, |
1110 | this conversion is coming from a C-style cast. */ | |
c73964b2 | 1111 | |
5bd61841 | 1112 | static conversion * |
34b5375f | 1113 | standard_conversion (tree to, tree from, tree expr, bool c_cast_p, |
46f0d909 | 1114 | int flags, tsubst_flags_t complain) |
c73964b2 MS |
1115 | { |
1116 | enum tree_code fcode, tcode; | |
5bd61841 | 1117 | conversion *conv; |
94be8403 | 1118 | bool fromref = false; |
8d4bcc35 | 1119 | tree qualified_to; |
de22184b | 1120 | |
ee76b931 | 1121 | to = non_reference (to); |
9f613f06 | 1122 | if (TYPE_REF_P (from)) |
de22184b | 1123 | { |
94be8403 | 1124 | fromref = true; |
de22184b MS |
1125 | from = TREE_TYPE (from); |
1126 | } | |
8d4bcc35 | 1127 | qualified_to = to; |
de22184b MS |
1128 | to = strip_top_quals (to); |
1129 | from = strip_top_quals (from); | |
c73964b2 | 1130 | |
835dee55 | 1131 | if (expr && type_unknown_p (expr)) |
e6e174e5 | 1132 | { |
835dee55 PC |
1133 | if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to)) |
1134 | { | |
1135 | tsubst_flags_t tflags = tf_conv; | |
1136 | expr = instantiate_type (to, expr, tflags); | |
1137 | if (expr == error_mark_node) | |
1138 | return NULL; | |
1139 | from = TREE_TYPE (expr); | |
1140 | } | |
1141 | else if (TREE_CODE (to) == BOOLEAN_TYPE) | |
1142 | { | |
1143 | /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */ | |
46f0d909 | 1144 | expr = resolve_nondeduced_context (expr, complain); |
835dee55 PC |
1145 | from = TREE_TYPE (expr); |
1146 | } | |
e6e174e5 JM |
1147 | } |
1148 | ||
c73964b2 MS |
1149 | fcode = TREE_CODE (from); |
1150 | tcode = TREE_CODE (to); | |
1151 | ||
5bd61841 | 1152 | conv = build_identity_conv (from, expr); |
725d6b87 | 1153 | if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE) |
c73964b2 | 1154 | { |
725d6b87 | 1155 | from = type_decays_to (from); |
c73964b2 | 1156 | fcode = TREE_CODE (from); |
3569f81f JM |
1157 | /* Tell convert_like_real that we're using the address. */ |
1158 | conv->rvaluedness_matches_p = true; | |
5bd61841 | 1159 | conv = build_conv (ck_lvalue, from, conv); |
c73964b2 | 1160 | } |
bb19d4af JM |
1161 | /* Wrapping a ck_rvalue around a class prvalue (as a result of using |
1162 | obvalue_p) seems odd, since it's already a prvalue, but that's how we | |
1163 | express the copy constructor call required by copy-initialization. */ | |
1164 | else if (fromref || (expr && obvalue_p (expr))) | |
38a4afee MM |
1165 | { |
1166 | if (expr) | |
1167 | { | |
1168 | tree bitfield_type; | |
1169 | bitfield_type = is_bitfield_expr_with_lowered_type (expr); | |
1170 | if (bitfield_type) | |
725d6b87 MM |
1171 | { |
1172 | from = strip_top_quals (bitfield_type); | |
1173 | fcode = TREE_CODE (from); | |
1174 | } | |
38a4afee MM |
1175 | } |
1176 | conv = build_conv (ck_rvalue, from, conv); | |
f8f12278 | 1177 | if (flags & LOOKUP_PREFER_RVALUE) |
4ce8c5de | 1178 | /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */ |
f8f12278 | 1179 | conv->rvaluedness_matches_p = true; |
38a4afee | 1180 | } |
de22184b | 1181 | |
04c06002 | 1182 | /* Allow conversion between `__complex__' data types. */ |
a04678ca GDR |
1183 | if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE) |
1184 | { | |
1185 | /* The standard conversion sequence to convert FROM to TO is | |
0cbd7506 MS |
1186 | the standard conversion sequence to perform componentwise |
1187 | conversion. */ | |
5bd61841 | 1188 | conversion *part_conv = standard_conversion |
46f0d909 JM |
1189 | (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags, |
1190 | complain); | |
c8094d83 | 1191 | |
a04678ca | 1192 | if (part_conv) |
0cbd7506 | 1193 | { |
5bd61841 MM |
1194 | conv = build_conv (part_conv->kind, to, conv); |
1195 | conv->rank = part_conv->rank; | |
0cbd7506 | 1196 | } |
a04678ca | 1197 | else |
0cbd7506 | 1198 | conv = NULL; |
a04678ca GDR |
1199 | |
1200 | return conv; | |
1201 | } | |
1202 | ||
a7a64a77 | 1203 | if (same_type_p (from, to)) |
8d4bcc35 JM |
1204 | { |
1205 | if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue) | |
1206 | conv->type = qualified_to; | |
1207 | return conv; | |
1208 | } | |
c73964b2 | 1209 | |
14c2101d JM |
1210 | /* [conv.ptr] |
1211 | A null pointer constant can be converted to a pointer type; ... A | |
1212 | null pointer constant of integral type can be converted to an | |
1213 | rvalue of type std::nullptr_t. */ | |
66b1156a | 1214 | if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to) |
5116acc6 | 1215 | || NULLPTR_TYPE_P (to)) |
2ad2e0af PC |
1216 | && ((expr && null_ptr_cst_p (expr)) |
1217 | || NULLPTR_TYPE_P (from))) | |
5bd61841 | 1218 | conv = build_conv (ck_std, to, conv); |
72a08131 JM |
1219 | else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE) |
1220 | || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE)) | |
1221 | { | |
1222 | /* For backwards brain damage compatibility, allow interconversion of | |
1223 | pointers and integers with a pedwarn. */ | |
5bd61841 MM |
1224 | conv = build_conv (ck_std, to, conv); |
1225 | conv->bad_p = true; | |
72a08131 | 1226 | } |
adf2edec | 1227 | else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE) |
8a2b77e7 JM |
1228 | { |
1229 | /* For backwards brain damage compatibility, allow interconversion of | |
1230 | enums and integers with a pedwarn. */ | |
5bd61841 MM |
1231 | conv = build_conv (ck_std, to, conv); |
1232 | conv->bad_p = true; | |
8a2b77e7 | 1233 | } |
a5ac359a | 1234 | else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE) |
66b1156a | 1235 | || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from))) |
c73964b2 | 1236 | { |
a5ac359a MM |
1237 | tree to_pointee; |
1238 | tree from_pointee; | |
c73964b2 | 1239 | |
452811eb JM |
1240 | if (tcode == POINTER_TYPE) |
1241 | { | |
1242 | to_pointee = TREE_TYPE (to); | |
1243 | from_pointee = TREE_TYPE (from); | |
1244 | ||
1245 | /* Since this is the target of a pointer, it can't have function | |
1246 | qualifiers, so any TYPE_QUALS must be for attributes const or | |
1247 | noreturn. Strip them. */ | |
1248 | if (TREE_CODE (to_pointee) == FUNCTION_TYPE | |
1249 | && TYPE_QUALS (to_pointee)) | |
1250 | to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED); | |
1251 | if (TREE_CODE (from_pointee) == FUNCTION_TYPE | |
1252 | && TYPE_QUALS (from_pointee)) | |
1253 | from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED); | |
1254 | } | |
1255 | else | |
1256 | { | |
1257 | to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to); | |
1258 | from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from); | |
1259 | } | |
1260 | ||
a5ac359a | 1261 | if (tcode == POINTER_TYPE |
452811eb JM |
1262 | && same_type_ignoring_top_level_qualifiers_p (from_pointee, |
1263 | to_pointee)) | |
4d50dd69 | 1264 | ; |
452811eb | 1265 | else if (VOID_TYPE_P (to_pointee) |
66b1156a | 1266 | && !TYPE_PTRDATAMEM_P (from) |
452811eb | 1267 | && TREE_CODE (from_pointee) != FUNCTION_TYPE) |
c73964b2 | 1268 | { |
e426b47b | 1269 | tree nfrom = TREE_TYPE (from); |
c663bc6a JM |
1270 | /* Don't try to apply restrict to void. */ |
1271 | int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT; | |
452811eb JM |
1272 | from_pointee = cp_build_qualified_type (void_type_node, quals); |
1273 | from = build_pointer_type (from_pointee); | |
5bd61841 | 1274 | conv = build_conv (ck_ptr, from, conv); |
c73964b2 | 1275 | } |
66b1156a | 1276 | else if (TYPE_PTRDATAMEM_P (from)) |
c73964b2 | 1277 | { |
a5ac359a MM |
1278 | tree fbase = TYPE_PTRMEM_CLASS_TYPE (from); |
1279 | tree tbase = TYPE_PTRMEM_CLASS_TYPE (to); | |
c73964b2 | 1280 | |
8b8b203a JM |
1281 | if (same_type_p (fbase, tbase)) |
1282 | /* No base conversion needed. */; | |
1283 | else if (DERIVED_FROM_P (fbase, tbase) | |
1284 | && (same_type_ignoring_top_level_qualifiers_p | |
1285 | (from_pointee, to_pointee))) | |
c73964b2 | 1286 | { |
452811eb | 1287 | from = build_ptrmem_type (tbase, from_pointee); |
5bd61841 | 1288 | conv = build_conv (ck_pmem, from, conv); |
c73964b2 | 1289 | } |
8b8b203a | 1290 | else |
539599c1 | 1291 | return NULL; |
c73964b2 | 1292 | } |
452811eb JM |
1293 | else if (CLASS_TYPE_P (from_pointee) |
1294 | && CLASS_TYPE_P (to_pointee) | |
385bce06 | 1295 | /* [conv.ptr] |
c8094d83 | 1296 | |
0cbd7506 | 1297 | An rvalue of type "pointer to cv D," where D is a |
385bce06 MM |
1298 | class type, can be converted to an rvalue of type |
1299 | "pointer to cv B," where B is a base class (clause | |
1300 | _class.derived_) of D. If B is an inaccessible | |
1301 | (clause _class.access_) or ambiguous | |
1302 | (_class.member.lookup_) base class of D, a program | |
18e4be85 | 1303 | that necessitates this conversion is ill-formed. |
0cbd7506 MS |
1304 | Therefore, we use DERIVED_FROM_P, and do not check |
1305 | access or uniqueness. */ | |
452811eb | 1306 | && DERIVED_FROM_P (to_pointee, from_pointee)) |
c73964b2 | 1307 | { |
452811eb JM |
1308 | from_pointee |
1309 | = cp_build_qualified_type (to_pointee, | |
1310 | cp_type_quals (from_pointee)); | |
1311 | from = build_pointer_type (from_pointee); | |
5bd61841 | 1312 | conv = build_conv (ck_ptr, from, conv); |
33c25e5c | 1313 | conv->base_p = true; |
c73964b2 | 1314 | } |
c73964b2 | 1315 | |
3bfdc719 | 1316 | if (same_type_p (from, to)) |
798eed5e | 1317 | /* OK */; |
34b5375f MM |
1318 | else if (c_cast_p && comp_ptr_ttypes_const (to, from)) |
1319 | /* In a C-style cast, we ignore CV-qualification because we | |
1320 | are allowed to perform a static_cast followed by a | |
1321 | const_cast. */ | |
1322 | conv = build_conv (ck_qual, to, conv); | |
1323 | else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee)) | |
5bd61841 | 1324 | conv = build_conv (ck_qual, to, conv); |
d9cf7c82 JM |
1325 | else if (expr && string_conv_p (to, expr, 0)) |
1326 | /* converting from string constant to char *. */ | |
5bd61841 | 1327 | conv = build_conv (ck_qual, to, conv); |
51dc6603 JM |
1328 | else if (fnptr_conv_p (to, from)) |
1329 | conv = build_conv (ck_fnptr, to, conv); | |
b581b85b NP |
1330 | /* Allow conversions among compatible ObjC pointer types (base |
1331 | conversions have been already handled above). */ | |
1332 | else if (c_dialect_objc () | |
1333 | && objc_compare_types (to, from, -4, NULL_TREE)) | |
1334 | conv = build_conv (ck_ptr, to, conv); | |
a5ac359a | 1335 | else if (ptr_reasonably_similar (to_pointee, from_pointee)) |
c73964b2 | 1336 | { |
5bd61841 MM |
1337 | conv = build_conv (ck_ptr, to, conv); |
1338 | conv->bad_p = true; | |
c73964b2 | 1339 | } |
d11ad92e | 1340 | else |
5bd61841 | 1341 | return NULL; |
d11ad92e MS |
1342 | |
1343 | from = to; | |
c73964b2 MS |
1344 | } |
1345 | else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from)) | |
1346 | { | |
1347 | tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from)); | |
1348 | tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to)); | |
7e1352fe NF |
1349 | tree fbase = class_of_this_parm (fromfn); |
1350 | tree tbase = class_of_this_parm (tofn); | |
c73964b2 | 1351 | |
51dc6603 JM |
1352 | if (!DERIVED_FROM_P (fbase, tbase)) |
1353 | return NULL; | |
1354 | ||
1355 | tree fstat = static_fn_type (fromfn); | |
1356 | tree tstat = static_fn_type (tofn); | |
1357 | if (same_type_p (tstat, fstat) | |
1358 | || fnptr_conv_p (tstat, fstat)) | |
1359 | /* OK */; | |
1360 | else | |
6aed477a | 1361 | return NULL; |
c73964b2 | 1362 | |
51dc6603 JM |
1363 | if (!same_type_p (fbase, tbase)) |
1364 | { | |
1365 | from = build_memfn_type (fstat, | |
1366 | tbase, | |
1367 | cp_type_quals (tbase), | |
1368 | type_memfn_rqual (tofn)); | |
1369 | from = build_ptrmemfunc_type (build_pointer_type (from)); | |
1370 | conv = build_conv (ck_pmem, from, conv); | |
1371 | conv->base_p = true; | |
1372 | } | |
1373 | if (fnptr_conv_p (tstat, fstat)) | |
1374 | conv = build_conv (ck_fnptr, to, conv); | |
c73964b2 MS |
1375 | } |
1376 | else if (tcode == BOOLEAN_TYPE) | |
1377 | { | |
a5ac359a | 1378 | /* [conv.bool] |
c73964b2 | 1379 | |
3c61a5ba PC |
1380 | A prvalue of arithmetic, unscoped enumeration, pointer, or pointer |
1381 | to member type can be converted to a prvalue of type bool. ... | |
1382 | For direct-initialization (8.5 [dcl.init]), a prvalue of type | |
1383 | std::nullptr_t can be converted to a prvalue of type bool; */ | |
a5ac359a | 1384 | if (ARITHMETIC_TYPE_P (from) |
adf2edec | 1385 | || UNSCOPED_ENUM_P (from) |
a5ac359a | 1386 | || fcode == POINTER_TYPE |
66b1156a | 1387 | || TYPE_PTRMEM_P (from) |
5116acc6 | 1388 | || NULLPTR_TYPE_P (from)) |
a5ac359a | 1389 | { |
5bd61841 | 1390 | conv = build_conv (ck_std, to, conv); |
a5ac359a | 1391 | if (fcode == POINTER_TYPE |
66b1156a | 1392 | || TYPE_PTRDATAMEM_P (from) |
c8094d83 | 1393 | || (TYPE_PTRMEMFUNC_P (from) |
14c2101d | 1394 | && conv->rank < cr_pbool) |
5116acc6 | 1395 | || NULLPTR_TYPE_P (from)) |
5bd61841 | 1396 | conv->rank = cr_pbool; |
3c61a5ba PC |
1397 | if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING)) |
1398 | conv->bad_p = true; | |
992931ba MP |
1399 | if (flags & LOOKUP_NO_NARROWING) |
1400 | conv->check_narrowing = true; | |
a5ac359a MM |
1401 | return conv; |
1402 | } | |
c8094d83 | 1403 | |
5bd61841 | 1404 | return NULL; |
c73964b2 MS |
1405 | } |
1406 | /* We don't check for ENUMERAL_TYPE here because there are no standard | |
1407 | conversions to enum type. */ | |
b6219f42 JM |
1408 | /* As an extension, allow conversion to complex type. */ |
1409 | else if (ARITHMETIC_TYPE_P (to)) | |
c73964b2 | 1410 | { |
715a572a PC |
1411 | if (! (INTEGRAL_CODE_P (fcode) |
1412 | || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL))) | |
adf2edec | 1413 | || SCOPED_ENUM_P (from)) |
6aed477a | 1414 | return NULL; |
5bd61841 | 1415 | conv = build_conv (ck_std, to, conv); |
c73964b2 MS |
1416 | |
1417 | /* Give this a better rank if it's a promotion. */ | |
f3c2dfc6 | 1418 | if (same_type_p (to, type_promotes_to (from)) |
40703fdf | 1419 | && next_conversion (conv)->rank <= cr_promotion) |
5bd61841 | 1420 | conv->rank = cr_promotion; |
c73964b2 | 1421 | } |
7d149679 | 1422 | else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE |
00c8e9f6 | 1423 | && vector_types_convertible_p (from, to, false)) |
5bd61841 | 1424 | return build_conv (ck_std, to, conv); |
9e1e64ec | 1425 | else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from) |
a7a64a77 | 1426 | && is_properly_derived_from (from, to)) |
2dbfb418 | 1427 | { |
5bd61841 | 1428 | if (conv->kind == ck_rvalue) |
40703fdf | 1429 | conv = next_conversion (conv); |
5bd61841 | 1430 | conv = build_conv (ck_base, to, conv); |
27b8d0cd MM |
1431 | /* The derived-to-base conversion indicates the initialization |
1432 | of a parameter with base type from an object of a derived | |
1433 | type. A temporary object is created to hold the result of | |
6f4fd536 JM |
1434 | the conversion unless we're binding directly to a reference. */ |
1435 | conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND); | |
e5ba9b70 MP |
1436 | if (flags & LOOKUP_PREFER_RVALUE) |
1437 | /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */ | |
1438 | conv->rvaluedness_matches_p = true; | |
2dbfb418 | 1439 | } |
c73964b2 | 1440 | else |
5bd61841 | 1441 | return NULL; |
c73964b2 | 1442 | |
09357846 JM |
1443 | if (flags & LOOKUP_NO_NARROWING) |
1444 | conv->check_narrowing = true; | |
1445 | ||
c73964b2 MS |
1446 | return conv; |
1447 | } | |
1448 | ||
838dfd8a | 1449 | /* Returns nonzero if T1 is reference-related to T2. */ |
27b8d0cd | 1450 | |
e7f1930f | 1451 | bool |
94be8403 | 1452 | reference_related_p (tree t1, tree t2) |
27b8d0cd | 1453 | { |
f0d9b836 JM |
1454 | if (t1 == error_mark_node || t2 == error_mark_node) |
1455 | return false; | |
1456 | ||
27b8d0cd MM |
1457 | t1 = TYPE_MAIN_VARIANT (t1); |
1458 | t2 = TYPE_MAIN_VARIANT (t2); | |
1459 | ||
1460 | /* [dcl.init.ref] | |
1461 | ||
1462 | Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related | |
1463 | to "cv2 T2" if T1 is the same type as T2, or T1 is a base class | |
1464 | of T2. */ | |
1465 | return (same_type_p (t1, t2) | |
1466 | || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2) | |
1467 | && DERIVED_FROM_P (t1, t2))); | |
1468 | } | |
1469 | ||
838dfd8a | 1470 | /* Returns nonzero if T1 is reference-compatible with T2. */ |
27b8d0cd | 1471 | |
94be8403 GDR |
1472 | static bool |
1473 | reference_compatible_p (tree t1, tree t2) | |
27b8d0cd MM |
1474 | { |
1475 | /* [dcl.init.ref] | |
1476 | ||
51dc6603 JM |
1477 | "cv1 T1" is reference compatible with "cv2 T2" if |
1478 | * T1 is reference-related to T2 or | |
1479 | * T2 is "noexcept function" and T1 is "function", where the | |
1480 | function types are otherwise the same, | |
1481 | and cv1 is the same cv-qualification as, or greater cv-qualification | |
1482 | than, cv2. */ | |
1483 | return ((reference_related_p (t1, t2) | |
1484 | || fnptr_conv_p (t1, t2)) | |
27b8d0cd MM |
1485 | && at_least_as_qualified_p (t1, t2)); |
1486 | } | |
1487 | ||
27b8d0cd MM |
1488 | /* A reference of the indicated TYPE is being bound directly to the |
1489 | expression represented by the implicit conversion sequence CONV. | |
1490 | Return a conversion sequence for this binding. */ | |
1491 | ||
5bd61841 MM |
1492 | static conversion * |
1493 | direct_reference_binding (tree type, conversion *conv) | |
27b8d0cd | 1494 | { |
3d938426 MM |
1495 | tree t; |
1496 | ||
9f613f06 PC |
1497 | gcc_assert (TYPE_REF_P (type)); |
1498 | gcc_assert (!TYPE_REF_P (conv->type)); | |
3d938426 MM |
1499 | |
1500 | t = TREE_TYPE (type); | |
27b8d0cd | 1501 | |
5a752e3f NS |
1502 | if (conv->kind == ck_identity) |
1503 | /* Mark the identity conv as to not decay to rvalue. */ | |
1504 | conv->rvaluedness_matches_p = true; | |
1505 | ||
c8094d83 MS |
1506 | /* [over.ics.rank] |
1507 | ||
27b8d0cd MM |
1508 | When a parameter of reference type binds directly |
1509 | (_dcl.init.ref_) to an argument expression, the implicit | |
1510 | conversion sequence is the identity conversion, unless the | |
1511 | argument expression has a type that is a derived class of the | |
1512 | parameter type, in which case the implicit conversion sequence is | |
1513 | a derived-to-base Conversion. | |
c8094d83 | 1514 | |
27b8d0cd MM |
1515 | If the parameter binds directly to the result of applying a |
1516 | conversion function to the argument expression, the implicit | |
1517 | conversion sequence is a user-defined conversion sequence | |
1518 | (_over.ics.user_), with the second standard conversion sequence | |
1519 | either an identity conversion or, if the conversion function | |
1520 | returns an entity of a type that is a derived class of the | |
1521 | parameter type, a derived-to-base conversion. */ | |
51dc6603 | 1522 | if (is_properly_derived_from (conv->type, t)) |
27b8d0cd MM |
1523 | { |
1524 | /* Represent the derived-to-base conversion. */ | |
5bd61841 | 1525 | conv = build_conv (ck_base, t, conv); |
27b8d0cd MM |
1526 | /* We will actually be binding to the base-class subobject in |
1527 | the derived class, so we mark this conversion appropriately. | |
1528 | That way, convert_like knows not to generate a temporary. */ | |
5bd61841 | 1529 | conv->need_temporary_p = false; |
27b8d0cd | 1530 | } |
5a752e3f | 1531 | |
5bd61841 | 1532 | return build_conv (ck_ref_bind, type, conv); |
27b8d0cd MM |
1533 | } |
1534 | ||
c73964b2 MS |
1535 | /* Returns the conversion path from type FROM to reference type TO for |
1536 | purposes of reference binding. For lvalue binding, either pass a | |
c7f9c6f5 MM |
1537 | reference type to FROM or an lvalue expression to EXPR. If the |
1538 | reference will be bound to a temporary, NEED_TEMPORARY_P is set for | |
44ba4c4e JM |
1539 | the conversion returned. If C_CAST_P is true, this |
1540 | conversion is coming from a C-style cast. */ | |
c73964b2 | 1541 | |
5bd61841 | 1542 | static conversion * |
b40e334f PC |
1543 | reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags, |
1544 | tsubst_flags_t complain) | |
c73964b2 | 1545 | { |
5bd61841 | 1546 | conversion *conv = NULL; |
c73964b2 | 1547 | tree to = TREE_TYPE (rto); |
de22184b | 1548 | tree from = rfrom; |
24030e4c | 1549 | tree tfrom; |
94be8403 GDR |
1550 | bool related_p; |
1551 | bool compatible_p; | |
dbbc379e JM |
1552 | cp_lvalue_kind gl_kind; |
1553 | bool is_lvalue; | |
c73964b2 | 1554 | |
e6e174e5 JM |
1555 | if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr)) |
1556 | { | |
c2ea3a40 | 1557 | expr = instantiate_type (to, expr, tf_none); |
e6e174e5 | 1558 | if (expr == error_mark_node) |
5bd61841 | 1559 | return NULL; |
e6e174e5 JM |
1560 | from = TREE_TYPE (expr); |
1561 | } | |
1562 | ||
bd1f11be JM |
1563 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1564 | { | |
848f237b | 1565 | maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS); |
f235ad11 JM |
1566 | /* DR 1288: Otherwise, if the initializer list has a single element |
1567 | of type E and ... [T's] referenced type is reference-related to E, | |
1568 | the object or reference is initialized from that element... */ | |
1569 | if (CONSTRUCTOR_NELTS (expr) == 1) | |
bd1f11be | 1570 | { |
f235ad11 JM |
1571 | tree elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1572 | if (error_operand_p (elt)) | |
d22f0231 | 1573 | return NULL; |
f235ad11 JM |
1574 | tree etype = TREE_TYPE (elt); |
1575 | if (reference_related_p (to, etype)) | |
1576 | { | |
1577 | expr = elt; | |
1578 | from = etype; | |
1579 | goto skip; | |
1580 | } | |
bd1f11be | 1581 | } |
d86d6e27 JM |
1582 | /* Otherwise, if T is a reference type, a prvalue temporary of the type |
1583 | referenced by T is copy-list-initialized, and the reference is bound | |
1584 | to that temporary. */ | |
1585 | CONSTRUCTOR_IS_DIRECT_INIT (expr) = false; | |
f235ad11 | 1586 | skip:; |
bd1f11be JM |
1587 | } |
1588 | ||
9f613f06 | 1589 | if (TYPE_REF_P (from)) |
dbbc379e JM |
1590 | { |
1591 | from = TREE_TYPE (from); | |
1592 | if (!TYPE_REF_IS_RVALUE (rfrom) | |
1593 | || TREE_CODE (from) == FUNCTION_TYPE) | |
1594 | gl_kind = clk_ordinary; | |
1595 | else | |
1596 | gl_kind = clk_rvalueref; | |
1597 | } | |
1598 | else if (expr) | |
5794b9f6 JM |
1599 | gl_kind = lvalue_kind (expr); |
1600 | else if (CLASS_TYPE_P (from) | |
1601 | || TREE_CODE (from) == ARRAY_TYPE) | |
1602 | gl_kind = clk_class; | |
dbbc379e JM |
1603 | else |
1604 | gl_kind = clk_none; | |
5794b9f6 JM |
1605 | |
1606 | /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */ | |
1607 | if ((flags & LOOKUP_NO_TEMP_BIND) | |
1608 | && (gl_kind & clk_class)) | |
1609 | gl_kind = clk_none; | |
1610 | ||
1611 | /* Same mask as real_lvalue_p. */ | |
1612 | is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class)); | |
eb66be0e | 1613 | |
24030e4c | 1614 | tfrom = from; |
dbbc379e | 1615 | if ((gl_kind & clk_bitfield) != 0) |
24030e4c JJ |
1616 | tfrom = unlowered_expr_type (expr); |
1617 | ||
b0385db8 | 1618 | /* Figure out whether or not the types are reference-related and |
026c3cfd | 1619 | reference compatible. We have to do this after stripping |
b0385db8 | 1620 | references from FROM. */ |
24030e4c | 1621 | related_p = reference_related_p (to, tfrom); |
44ba4c4e JM |
1622 | /* If this is a C cast, first convert to an appropriately qualified |
1623 | type, so that we can later do a const_cast to the desired type. */ | |
1624 | if (related_p && c_cast_p | |
24030e4c | 1625 | && !at_least_as_qualified_p (to, tfrom)) |
a3360e77 | 1626 | to = cp_build_qualified_type (to, cp_type_quals (tfrom)); |
24030e4c | 1627 | compatible_p = reference_compatible_p (to, tfrom); |
b0385db8 | 1628 | |
8af2fec4 | 1629 | /* Directly bind reference when target expression's type is compatible with |
6f4fd536 JM |
1630 | the reference and expression is an lvalue. In DR391, the wording in |
1631 | [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for | |
9771799c | 1632 | const and rvalue references to rvalues of compatible class type. |
dbbc379e | 1633 | We should also do direct bindings for non-class xvalues. */ |
51dc6603 | 1634 | if ((related_p || compatible_p) && gl_kind) |
c73964b2 | 1635 | { |
27b8d0cd | 1636 | /* [dcl.init.ref] |
c73964b2 | 1637 | |
c8094d83 MS |
1638 | If the initializer expression |
1639 | ||
27b8d0cd MM |
1640 | -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1" |
1641 | is reference-compatible with "cv2 T2," | |
c8094d83 | 1642 | |
34cd5ae7 | 1643 | the reference is bound directly to the initializer expression |
6f4fd536 JM |
1644 | lvalue. |
1645 | ||
1646 | [...] | |
1647 | If the initializer expression is an rvalue, with T2 a class type, | |
1648 | and "cv1 T1" is reference-compatible with "cv2 T2", the reference | |
1649 | is bound to the object represented by the rvalue or to a sub-object | |
1650 | within that object. */ | |
1651 | ||
24030e4c | 1652 | conv = build_identity_conv (tfrom, expr); |
27b8d0cd | 1653 | conv = direct_reference_binding (rto, conv); |
8af2fec4 | 1654 | |
9f613f06 | 1655 | if (TYPE_REF_P (rfrom)) |
0ad2cde8 JM |
1656 | /* Handle rvalue reference to function properly. */ |
1657 | conv->rvaluedness_matches_p | |
1658 | = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom)); | |
8af2fec4 RY |
1659 | else |
1660 | conv->rvaluedness_matches_p | |
9771799c | 1661 | = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue); |
8af2fec4 | 1662 | |
dbbc379e JM |
1663 | if ((gl_kind & clk_bitfield) != 0 |
1664 | || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to))) | |
27b8d0cd | 1665 | /* For the purposes of overload resolution, we ignore the fact |
e0d1297c | 1666 | this expression is a bitfield or packed field. (In particular, |
27b8d0cd MM |
1667 | [over.ics.ref] says specifically that a function with a |
1668 | non-const reference parameter is viable even if the | |
1669 | argument is a bitfield.) | |
1670 | ||
1671 | However, when we actually call the function we must create | |
1672 | a temporary to which to bind the reference. If the | |
1673 | reference is volatile, or isn't const, then we cannot make | |
1674 | a temporary, so we just issue an error when the conversion | |
1675 | actually occurs. */ | |
5bd61841 | 1676 | conv->need_temporary_p = true; |
c8094d83 | 1677 | |
b24290fb JM |
1678 | /* Don't allow binding of lvalues (other than function lvalues) to |
1679 | rvalue references. */ | |
e7f1930f | 1680 | if (is_lvalue && TYPE_REF_IS_RVALUE (rto) |
4ce8c5de | 1681 | && TREE_CODE (to) != FUNCTION_TYPE) |
e7f1930f JM |
1682 | conv->bad_p = true; |
1683 | ||
d02f620d JM |
1684 | /* Nor the reverse. */ |
1685 | if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto) | |
1686 | && (!CP_TYPE_CONST_NON_VOLATILE_P (to) | |
1687 | || (flags & LOOKUP_NO_RVAL_BIND)) | |
1688 | && TREE_CODE (to) != FUNCTION_TYPE) | |
1689 | conv->bad_p = true; | |
1690 | ||
1691 | if (!compatible_p) | |
1692 | conv->bad_p = true; | |
1693 | ||
27b8d0cd | 1694 | return conv; |
c73964b2 | 1695 | } |
9380ed84 JM |
1696 | /* [class.conv.fct] A conversion function is never used to convert a |
1697 | (possibly cv-qualified) object to the (possibly cv-qualified) same | |
1698 | object type (or a reference to it), to a (possibly cv-qualified) base | |
1699 | class of that type (or a reference to it).... */ | |
1700 | else if (CLASS_TYPE_P (from) && !related_p | |
1701 | && !(flags & LOOKUP_NO_CONVERSION)) | |
c73964b2 | 1702 | { |
27b8d0cd MM |
1703 | /* [dcl.init.ref] |
1704 | ||
34cd5ae7 | 1705 | If the initializer expression |
27b8d0cd MM |
1706 | |
1707 | -- has a class type (i.e., T2 is a class type) can be | |
1708 | implicitly converted to an lvalue of type "cv3 T3," where | |
1709 | "cv1 T1" is reference-compatible with "cv3 T3". (this | |
1710 | conversion is selected by enumerating the applicable | |
1711 | conversion functions (_over.match.ref_) and choosing the | |
c8094d83 | 1712 | best one through overload resolution. (_over.match_). |
27b8d0cd | 1713 | |
0cbd7506 | 1714 | the reference is bound to the lvalue result of the conversion |
27b8d0cd | 1715 | in the second case. */ |
b40e334f PC |
1716 | z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, |
1717 | complain); | |
62a405dd JM |
1718 | if (cand) |
1719 | return cand->second_conv; | |
27b8d0cd | 1720 | } |
c73964b2 | 1721 | |
a7a64a77 MM |
1722 | /* From this point on, we conceptually need temporaries, even if we |
1723 | elide them. Only the cases above are "direct bindings". */ | |
1724 | if (flags & LOOKUP_NO_TEMP_BIND) | |
5bd61841 | 1725 | return NULL; |
a7a64a77 | 1726 | |
27b8d0cd | 1727 | /* [over.ics.rank] |
c8094d83 | 1728 | |
27b8d0cd MM |
1729 | When a parameter of reference type is not bound directly to an |
1730 | argument expression, the conversion sequence is the one required | |
1731 | to convert the argument expression to the underlying type of the | |
1732 | reference according to _over.best.ics_. Conceptually, this | |
1733 | conversion sequence corresponds to copy-initializing a temporary | |
1734 | of the underlying type with the argument expression. Any | |
1735 | difference in top-level cv-qualification is subsumed by the | |
1736 | initialization itself and does not constitute a conversion. */ | |
1737 | ||
f9b600ba JM |
1738 | /* [dcl.init.ref] |
1739 | ||
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 | ||
1744 | We try below to treat this as a bad conversion to improve diagnostics, | |
1745 | but if TO is an incomplete class, we need to reject this conversion | |
1746 | now to avoid unnecessary instantiation. */ | |
1747 | if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto) | |
1748 | && !COMPLETE_TYPE_P (to)) | |
1749 | return NULL; | |
1750 | ||
6f4fd536 JM |
1751 | /* We're generating a temporary now, but don't bind any more in the |
1752 | conversion (specifically, don't slice the temporary returned by a | |
1753 | conversion operator). */ | |
1754 | flags |= LOOKUP_NO_TEMP_BIND; | |
1755 | ||
cef62ad4 JM |
1756 | /* Core issue 899: When [copy-]initializing a temporary to be bound |
1757 | to the first parameter of a copy constructor (12.8) called with | |
1758 | a single argument in the context of direct-initialization, | |
1759 | explicit conversion functions are also considered. | |
1760 | ||
1761 | So don't set LOOKUP_ONLYCONVERTING in that case. */ | |
e57d93c6 JM |
1762 | if (!(flags & LOOKUP_COPY_PARM)) |
1763 | flags |= LOOKUP_ONLYCONVERTING; | |
1764 | ||
bd1f11be JM |
1765 | if (!conv) |
1766 | conv = implicit_conversion (to, from, expr, c_cast_p, | |
b40e334f | 1767 | flags, complain); |
27b8d0cd | 1768 | if (!conv) |
5bd61841 | 1769 | return NULL; |
27b8d0cd | 1770 | |
fc45aeee JM |
1771 | if (conv->user_conv_p) |
1772 | { | |
1773 | /* If initializing the temporary used a conversion function, | |
1774 | recalculate the second conversion sequence. */ | |
1775 | for (conversion *t = conv; t; t = next_conversion (t)) | |
1776 | if (t->kind == ck_user | |
1777 | && DECL_CONV_FN_P (t->cand->fn)) | |
1778 | { | |
1779 | tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn)); | |
1780 | int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND; | |
1781 | conversion *new_second | |
1782 | = reference_binding (rto, ftype, NULL_TREE, c_cast_p, | |
1783 | sflags, complain); | |
1784 | if (!new_second) | |
1785 | return NULL; | |
1786 | return merge_conversion_sequences (t, new_second); | |
1787 | } | |
1788 | } | |
1789 | ||
2f75f515 | 1790 | conv = build_conv (ck_ref_bind, rto, conv); |
27b8d0cd MM |
1791 | /* This reference binding, unlike those above, requires the |
1792 | creation of a temporary. */ | |
5bd61841 | 1793 | conv->need_temporary_p = true; |
fc45aeee | 1794 | conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto); |
27b8d0cd | 1795 | |
d02f620d JM |
1796 | /* [dcl.init.ref] |
1797 | ||
1798 | Otherwise, the reference shall be an lvalue reference to a | |
1799 | non-volatile const type, or the reference shall be an rvalue | |
1800 | reference. */ | |
1801 | if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)) | |
1802 | conv->bad_p = true; | |
1803 | ||
1804 | /* [dcl.init.ref] | |
1805 | ||
1806 | Otherwise, a temporary of type "cv1 T1" is created and | |
1807 | initialized from the initializer expression using the rules for a | |
1808 | non-reference copy initialization. If T1 is reference-related to | |
1809 | T2, cv1 must be the same cv-qualification as, or greater | |
1810 | cv-qualification than, cv2; otherwise, the program is ill-formed. */ | |
1811 | if (related_p && !at_least_as_qualified_p (to, from)) | |
1812 | conv->bad_p = true; | |
1813 | ||
c73964b2 MS |
1814 | return conv; |
1815 | } | |
1816 | ||
34b5375f MM |
1817 | /* Returns the implicit conversion sequence (see [over.ics]) from type |
1818 | FROM to type TO. The optional expression EXPR may affect the | |
248e1b22 MM |
1819 | conversion. FLAGS are the usual overloading flags. If C_CAST_P is |
1820 | true, this conversion is coming from a C-style cast. */ | |
c73964b2 | 1821 | |
5bd61841 | 1822 | static conversion * |
34b5375f | 1823 | implicit_conversion (tree to, tree from, tree expr, bool c_cast_p, |
b40e334f | 1824 | int flags, tsubst_flags_t complain) |
c73964b2 | 1825 | { |
5bd61841 | 1826 | conversion *conv; |
c73964b2 | 1827 | |
5d73aa63 MM |
1828 | if (from == error_mark_node || to == error_mark_node |
1829 | || expr == error_mark_node) | |
5bd61841 | 1830 | return NULL; |
5d73aa63 | 1831 | |
12b03642 JM |
1832 | /* Other flags only apply to the primary function in overload |
1833 | resolution, or after we've chosen one. */ | |
1834 | flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM | |
1835 | |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE | |
715a572a | 1836 | |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL); |
12b03642 | 1837 | |
4b978f96 PC |
1838 | /* FIXME: actually we don't want warnings either, but we can't just |
1839 | have 'complain &= ~(tf_warning|tf_error)' because it would cause | |
1840 | the regression of, eg, g++.old-deja/g++.benjamin/16077.C. | |
1841 | We really ought not to issue that warning until we've committed | |
1842 | to that conversion. */ | |
1843 | complain &= ~tf_error; | |
1844 | ||
9fa6ffe1 JM |
1845 | /* Call reshape_init early to remove redundant braces. */ |
1846 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr) | |
e8a3c597 | 1847 | && CLASS_TYPE_P (to) |
9fa6ffe1 | 1848 | && COMPLETE_TYPE_P (complete_type (to)) |
e8a3c597 | 1849 | && !CLASSTYPE_NON_AGGREGATE (to)) |
9fa6ffe1 JM |
1850 | { |
1851 | expr = reshape_init (to, expr, complain); | |
1852 | if (expr == error_mark_node) | |
1853 | return NULL; | |
1854 | from = TREE_TYPE (expr); | |
1855 | } | |
1856 | ||
9f613f06 | 1857 | if (TYPE_REF_P (to)) |
b40e334f | 1858 | conv = reference_binding (to, from, expr, c_cast_p, flags, complain); |
c73964b2 | 1859 | else |
46f0d909 | 1860 | conv = standard_conversion (to, from, expr, c_cast_p, flags, complain); |
c73964b2 MS |
1861 | |
1862 | if (conv) | |
b80f8ef3 MM |
1863 | return conv; |
1864 | ||
c5adc427 JM |
1865 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1866 | { | |
1867 | if (is_std_init_list (to)) | |
b40e334f | 1868 | return build_list_conv (to, expr, flags, complain); |
c5adc427 | 1869 | |
77a30e9a JM |
1870 | /* As an extension, allow list-initialization of _Complex. */ |
1871 | if (TREE_CODE (to) == COMPLEX_TYPE) | |
1872 | { | |
b40e334f | 1873 | conv = build_complex_conv (to, expr, flags, complain); |
77a30e9a JM |
1874 | if (conv) |
1875 | return conv; | |
1876 | } | |
1877 | ||
c5adc427 | 1878 | /* Allow conversion from an initializer-list with one element to a |
4ea08463 JM |
1879 | scalar type. */ |
1880 | if (SCALAR_TYPE_P (to)) | |
c5adc427 | 1881 | { |
4ea08463 | 1882 | int nelts = CONSTRUCTOR_NELTS (expr); |
c5adc427 | 1883 | tree elt; |
4ea08463 JM |
1884 | |
1885 | if (nelts == 0) | |
1c53d72b | 1886 | elt = build_value_init (to, tf_none); |
4ea08463 | 1887 | else if (nelts == 1) |
c5adc427 JM |
1888 | elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1889 | else | |
4ea08463 JM |
1890 | elt = error_mark_node; |
1891 | ||
c5adc427 | 1892 | conv = implicit_conversion (to, TREE_TYPE (elt), elt, |
b40e334f | 1893 | c_cast_p, flags, complain); |
c5adc427 JM |
1894 | if (conv) |
1895 | { | |
1896 | conv->check_narrowing = true; | |
4ea08463 JM |
1897 | if (BRACE_ENCLOSED_INITIALIZER_P (elt)) |
1898 | /* Too many levels of braces, i.e. '{{1}}'. */ | |
1899 | conv->bad_p = true; | |
c5adc427 JM |
1900 | return conv; |
1901 | } | |
1902 | } | |
dd35aac7 | 1903 | else if (TREE_CODE (to) == ARRAY_TYPE) |
b40e334f | 1904 | return build_array_conv (to, expr, flags, complain); |
c5adc427 | 1905 | } |
09357846 | 1906 | |
b80f8ef3 | 1907 | if (expr != NULL_TREE |
9e1e64ec PC |
1908 | && (MAYBE_CLASS_TYPE_P (from) |
1909 | || MAYBE_CLASS_TYPE_P (to)) | |
b80f8ef3 | 1910 | && (flags & LOOKUP_NO_CONVERSION) == 0) |
c73964b2 | 1911 | { |
7993382e MM |
1912 | struct z_candidate *cand; |
1913 | ||
09357846 | 1914 | if (CLASS_TYPE_P (to) |
4ce1e770 JM |
1915 | && BRACE_ENCLOSED_INITIALIZER_P (expr) |
1916 | && !CLASSTYPE_NON_AGGREGATE (complete_type (to))) | |
b40e334f | 1917 | return build_aggr_conv (to, expr, flags, complain); |
09357846 | 1918 | |
b40e334f | 1919 | cand = build_user_type_conversion_1 (to, expr, flags, complain); |
eb66be0e | 1920 | if (cand) |
218e9dde JM |
1921 | { |
1922 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
1923 | && CONSTRUCTOR_NELTS (expr) == 1 | |
1924 | && !is_list_ctor (cand->fn)) | |
1925 | { | |
1926 | /* "If C is not an initializer-list constructor and the | |
1927 | initializer list has a single element of type cv U, where U is | |
1928 | X or a class derived from X, the implicit conversion sequence | |
1929 | has Exact Match rank if U is X, or Conversion rank if U is | |
1930 | derived from X." */ | |
1931 | tree elt = CONSTRUCTOR_ELT (expr, 0)->value; | |
1932 | tree elttype = TREE_TYPE (elt); | |
1933 | if (reference_related_p (to, elttype)) | |
1934 | return implicit_conversion (to, elttype, elt, | |
1935 | c_cast_p, flags, complain); | |
1936 | } | |
1937 | conv = cand->second_conv; | |
1938 | } | |
5e818b93 JM |
1939 | |
1940 | /* We used to try to bind a reference to a temporary here, but that | |
8af2fec4 | 1941 | is now handled after the recursive call to this function at the end |
5e818b93 | 1942 | of reference_binding. */ |
b80f8ef3 | 1943 | return conv; |
c73964b2 MS |
1944 | } |
1945 | ||
5bd61841 | 1946 | return NULL; |
c73964b2 MS |
1947 | } |
1948 | ||
6147a53a JM |
1949 | /* Like implicit_conversion, but return NULL if the conversion is bad. |
1950 | ||
1951 | This is not static so that check_non_deducible_conversion can call it within | |
1952 | add_template_candidate_real as part of overload resolution; it should not be | |
1953 | called outside of overload resolution. */ | |
1954 | ||
1955 | conversion * | |
1956 | good_conversion (tree to, tree from, tree expr, | |
1957 | int flags, tsubst_flags_t complain) | |
1958 | { | |
1959 | conversion *c = implicit_conversion (to, from, expr, /*cast*/false, | |
1960 | flags, complain); | |
1961 | if (c && c->bad_p) | |
1962 | c = NULL; | |
1963 | return c; | |
1964 | } | |
1965 | ||
5ffe581d | 1966 | /* Add a new entry to the list of candidates. Used by the add_*_candidate |
c166b898 ILT |
1967 | functions. ARGS will not be changed until a single candidate is |
1968 | selected. */ | |
5ffe581d JM |
1969 | |
1970 | static struct z_candidate * | |
c8094d83 | 1971 | add_candidate (struct z_candidate **candidates, |
9771b263 | 1972 | tree fn, tree first_arg, const vec<tree, va_gc> *args, |
c8094d83 MS |
1973 | size_t num_convs, conversion **convs, |
1974 | tree access_path, tree conversion_path, | |
4561285b JM |
1975 | int viable, struct rejection_reason *reason, |
1976 | int flags) | |
5ffe581d | 1977 | { |
67f5655f GDR |
1978 | struct z_candidate *cand = (struct z_candidate *) |
1979 | conversion_obstack_alloc (sizeof (struct z_candidate)); | |
5ffe581d JM |
1980 | |
1981 | cand->fn = fn; | |
c166b898 | 1982 | cand->first_arg = first_arg; |
b80f8ef3 | 1983 | cand->args = args; |
5ffe581d | 1984 | cand->convs = convs; |
5bd61841 | 1985 | cand->num_convs = num_convs; |
4ba126e4 MM |
1986 | cand->access_path = access_path; |
1987 | cand->conversion_path = conversion_path; | |
5ffe581d | 1988 | cand->viable = viable; |
feb6efc1 | 1989 | cand->reason = reason; |
7993382e | 1990 | cand->next = *candidates; |
4561285b | 1991 | cand->flags = flags; |
7993382e | 1992 | *candidates = cand; |
5ffe581d JM |
1993 | |
1994 | return cand; | |
1995 | } | |
1996 | ||
feb6efc1 NF |
1997 | /* Return the number of remaining arguments in the parameter list |
1998 | beginning with ARG. */ | |
1999 | ||
2207c599 | 2000 | int |
feb6efc1 NF |
2001 | remaining_arguments (tree arg) |
2002 | { | |
2003 | int n; | |
2004 | ||
2005 | for (n = 0; arg != NULL_TREE && arg != void_list_node; | |
2006 | arg = TREE_CHAIN (arg)) | |
2007 | n++; | |
2008 | ||
2009 | return n; | |
2010 | } | |
2011 | ||
6147a53a JM |
2012 | /* [over.match.copy]: When initializing a temporary object (12.2) to be bound |
2013 | to the first parameter of a constructor where the parameter is of type | |
2014 | "reference to possibly cv-qualified T" and the constructor is called with a | |
2015 | single argument in the context of direct-initialization of an object of type | |
2016 | "cv2 T", explicit conversion functions are also considered. | |
2017 | ||
2018 | So set LOOKUP_COPY_PARM to let reference_binding know that | |
2019 | it's being called in that context. */ | |
2020 | ||
2021 | int | |
2022 | conv_flags (int i, int nargs, tree fn, tree arg, int flags) | |
2023 | { | |
2024 | int lflags = flags; | |
2025 | tree t; | |
2026 | if (i == 0 && nargs == 1 && DECL_CONSTRUCTOR_P (fn) | |
2027 | && (t = FUNCTION_FIRST_USER_PARMTYPE (fn)) | |
2028 | && (same_type_ignoring_top_level_qualifiers_p | |
2029 | (non_reference (TREE_VALUE (t)), DECL_CONTEXT (fn)))) | |
2030 | { | |
2031 | if (!(flags & LOOKUP_ONLYCONVERTING)) | |
2032 | lflags |= LOOKUP_COPY_PARM; | |
2033 | if ((flags & LOOKUP_LIST_INIT_CTOR) | |
2034 | && BRACE_ENCLOSED_INITIALIZER_P (arg)) | |
2035 | lflags |= LOOKUP_NO_CONVERSION; | |
2036 | } | |
2037 | else | |
2038 | lflags |= LOOKUP_ONLYCONVERTING; | |
2039 | ||
2040 | return lflags; | |
2041 | } | |
2042 | ||
c166b898 ILT |
2043 | /* Create an overload candidate for the function or method FN called |
2044 | with the argument list FIRST_ARG/ARGS and add it to CANDIDATES. | |
2045 | FLAGS is passed on to implicit_conversion. | |
2046 | ||
2047 | This does not change ARGS. | |
aa52c1ff JM |
2048 | |
2049 | CTYPE, if non-NULL, is the type we want to pretend this function | |
2050 | comes from for purposes of overload resolution. */ | |
c73964b2 MS |
2051 | |
2052 | static struct z_candidate * | |
c8094d83 | 2053 | add_function_candidate (struct z_candidate **candidates, |
c166b898 | 2054 | tree fn, tree ctype, tree first_arg, |
9771b263 | 2055 | const vec<tree, va_gc> *args, tree access_path, |
b40e334f | 2056 | tree conversion_path, int flags, |
6147a53a | 2057 | conversion **convs, |
b40e334f | 2058 | tsubst_flags_t complain) |
c73964b2 MS |
2059 | { |
2060 | tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
2061 | int i, len; | |
c166b898 ILT |
2062 | tree parmnode; |
2063 | tree orig_first_arg = first_arg; | |
2064 | int skip; | |
c73964b2 | 2065 | int viable = 1; |
feb6efc1 | 2066 | struct rejection_reason *reason = NULL; |
c73964b2 | 2067 | |
d63d5d0c ILT |
2068 | /* At this point we should not see any functions which haven't been |
2069 | explicitly declared, except for friend functions which will have | |
2070 | been found using argument dependent lookup. */ | |
2071 | gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn)); | |
089d6ea7 | 2072 | |
e0fff4b3 JM |
2073 | /* The `this', `in_chrg' and VTT arguments to constructors are not |
2074 | considered in overload resolution. */ | |
c73964b2 MS |
2075 | if (DECL_CONSTRUCTOR_P (fn)) |
2076 | { | |
19e8a45f JM |
2077 | if (ctor_omit_inherited_parms (fn)) |
2078 | /* Bring back parameters omitted from an inherited ctor. */ | |
2079 | parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn)); | |
2080 | else | |
2081 | parmlist = skip_artificial_parms_for (fn, parmlist); | |
c166b898 ILT |
2082 | skip = num_artificial_parms_for (fn); |
2083 | if (skip > 0 && first_arg != NULL_TREE) | |
2084 | { | |
2085 | --skip; | |
2086 | first_arg = NULL_TREE; | |
2087 | } | |
c73964b2 | 2088 | } |
c8094d83 | 2089 | else |
c166b898 | 2090 | skip = 0; |
c73964b2 | 2091 | |
9771b263 | 2092 | len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0); |
6147a53a JM |
2093 | if (!convs) |
2094 | convs = alloc_conversions (len); | |
8f96c7ac JM |
2095 | |
2096 | /* 13.3.2 - Viable functions [over.match.viable] | |
2097 | First, to be a viable function, a candidate function shall have enough | |
2098 | parameters to agree in number with the arguments in the list. | |
2099 | ||
2100 | We need to check this first; otherwise, checking the ICSes might cause | |
2101 | us to produce an ill-formed template instantiation. */ | |
2102 | ||
2103 | parmnode = parmlist; | |
2104 | for (i = 0; i < len; ++i) | |
2105 | { | |
2106 | if (parmnode == NULL_TREE || parmnode == void_list_node) | |
2107 | break; | |
2108 | parmnode = TREE_CHAIN (parmnode); | |
2109 | } | |
2110 | ||
feb6efc1 NF |
2111 | if ((i < len && parmnode) |
2112 | || !sufficient_parms_p (parmnode)) | |
2113 | { | |
2114 | int remaining = remaining_arguments (parmnode); | |
2115 | viable = 0; | |
2116 | reason = arity_rejection (first_arg, i + remaining, len); | |
2117 | } | |
971e17ff | 2118 | |
310a7f96 | 2119 | /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first |
03e88100 JM |
2120 | parameter of type "reference to cv C" (including such a constructor |
2121 | instantiated from a template) is excluded from the set of candidate | |
310a7f96 JM |
2122 | functions when used to construct an object of type D with an argument list |
2123 | containing a single argument if C is reference-related to D. */ | |
03e88100 JM |
2124 | if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn) |
2125 | && flag_new_inheriting_ctors | |
2126 | && DECL_INHERITED_CTOR (fn)) | |
2127 | { | |
2128 | tree ptype = non_reference (TREE_VALUE (parmlist)); | |
310a7f96 | 2129 | tree dtype = DECL_CONTEXT (fn); |
b80dfe44 JM |
2130 | tree btype = DECL_INHERITED_CTOR_BASE (fn); |
2131 | if (reference_related_p (ptype, dtype) | |
2132 | && reference_related_p (btype, ptype)) | |
03e88100 JM |
2133 | { |
2134 | viable = false; | |
2135 | reason = inherited_ctor_rejection (); | |
2136 | } | |
2137 | } | |
2138 | ||
971e17ff AS |
2139 | /* Second, for a function to be viable, its constraints must be |
2140 | satisfied. */ | |
2141 | if (flag_concepts && viable | |
2142 | && !constraints_satisfied_p (fn)) | |
2143 | { | |
2144 | reason = constraint_failure (fn); | |
2145 | viable = false; | |
2146 | } | |
2147 | ||
b8bf6ad9 JM |
2148 | /* When looking for a function from a subobject from an implicit |
2149 | copy/move constructor/operator=, don't consider anything that takes (a | |
2150 | reference to) an unrelated type. See c++/44909 and core 1092. */ | |
971e17ff | 2151 | if (viable && parmlist && (flags & LOOKUP_DEFAULTED)) |
10746f37 JM |
2152 | { |
2153 | if (DECL_CONSTRUCTOR_P (fn)) | |
2154 | i = 1; | |
2155 | else if (DECL_ASSIGNMENT_OPERATOR_P (fn) | |
137073d3 | 2156 | && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)) |
10746f37 JM |
2157 | i = 2; |
2158 | else | |
2159 | i = 0; | |
2160 | if (i && len == i) | |
2161 | { | |
2162 | parmnode = chain_index (i-1, parmlist); | |
f0d9b836 JM |
2163 | if (!reference_related_p (non_reference (TREE_VALUE (parmnode)), |
2164 | ctype)) | |
10746f37 JM |
2165 | viable = 0; |
2166 | } | |
b8bf6ad9 JM |
2167 | |
2168 | /* This only applies at the top level. */ | |
2169 | flags &= ~LOOKUP_DEFAULTED; | |
10746f37 JM |
2170 | } |
2171 | ||
8f96c7ac JM |
2172 | if (! viable) |
2173 | goto out; | |
2174 | ||
971e17ff | 2175 | /* Third, for F to be a viable function, there shall exist for each |
8f96c7ac JM |
2176 | argument an implicit conversion sequence that converts that argument |
2177 | to the corresponding parameter of F. */ | |
2178 | ||
2179 | parmnode = parmlist; | |
c73964b2 MS |
2180 | |
2181 | for (i = 0; i < len; ++i) | |
2182 | { | |
0823efed DN |
2183 | tree argtype, to_type; |
2184 | tree arg; | |
5bd61841 | 2185 | conversion *t; |
aa52c1ff | 2186 | int is_this; |
c73964b2 | 2187 | |
c73964b2 MS |
2188 | if (parmnode == void_list_node) |
2189 | break; | |
aa45967f | 2190 | |
6147a53a JM |
2191 | if (convs[i]) |
2192 | { | |
2193 | /* Already set during deduction. */ | |
2194 | parmnode = TREE_CHAIN (parmnode); | |
2195 | continue; | |
2196 | } | |
2197 | ||
c166b898 ILT |
2198 | if (i == 0 && first_arg != NULL_TREE) |
2199 | arg = first_arg; | |
2200 | else | |
0823efed | 2201 | arg = CONST_CAST_TREE ( |
9771b263 | 2202 | (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]); |
c166b898 ILT |
2203 | argtype = lvalue_type (arg); |
2204 | ||
aa52c1ff JM |
2205 | is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
2206 | && ! DECL_CONSTRUCTOR_P (fn)); | |
2207 | ||
aa45967f JM |
2208 | if (parmnode) |
2209 | { | |
2210 | tree parmtype = TREE_VALUE (parmnode); | |
2211 | ||
cef62ad4 JM |
2212 | parmnode = TREE_CHAIN (parmnode); |
2213 | ||
aa52c1ff JM |
2214 | /* The type of the implicit object parameter ('this') for |
2215 | overload resolution is not always the same as for the | |
2216 | function itself; conversion functions are considered to | |
2217 | be members of the class being converted, and functions | |
2218 | introduced by a using-declaration are considered to be | |
2219 | members of the class that uses them. | |
aa45967f | 2220 | |
aa52c1ff JM |
2221 | Since build_over_call ignores the ICS for the `this' |
2222 | parameter, we can just change the parm type. */ | |
2223 | if (ctype && is_this) | |
aa45967f | 2224 | { |
a3360e77 JM |
2225 | parmtype = cp_build_qualified_type |
2226 | (ctype, cp_type_quals (TREE_TYPE (parmtype))); | |
2eed8e37 BK |
2227 | if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn))) |
2228 | { | |
2229 | /* If the function has a ref-qualifier, the implicit | |
2230 | object parameter has reference type. */ | |
2231 | bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn)); | |
2232 | parmtype = cp_build_reference_type (parmtype, rv); | |
caa40bc0 JM |
2233 | /* The special handling of 'this' conversions in compare_ics |
2234 | does not apply if there is a ref-qualifier. */ | |
2235 | is_this = false; | |
2eed8e37 BK |
2236 | } |
2237 | else | |
a7175123 JM |
2238 | { |
2239 | parmtype = build_pointer_type (parmtype); | |
84dd815f JM |
2240 | /* We don't use build_this here because we don't want to |
2241 | capture the object argument until we've chosen a | |
2242 | non-static member function. */ | |
2243 | arg = build_address (arg); | |
a7175123 JM |
2244 | argtype = lvalue_type (arg); |
2245 | } | |
aa45967f JM |
2246 | } |
2247 | ||
6147a53a | 2248 | int lflags = conv_flags (i, len-skip, fn, arg, flags); |
09357846 | 2249 | |
aa7349eb | 2250 | t = implicit_conversion (parmtype, argtype, arg, |
b40e334f | 2251 | /*c_cast_p=*/false, lflags, complain); |
feb6efc1 | 2252 | to_type = parmtype; |
aa45967f | 2253 | } |
c73964b2 MS |
2254 | else |
2255 | { | |
5bd61841 MM |
2256 | t = build_identity_conv (argtype, arg); |
2257 | t->ellipsis_p = true; | |
feb6efc1 | 2258 | to_type = argtype; |
c73964b2 MS |
2259 | } |
2260 | ||
aa52c1ff | 2261 | if (t && is_this) |
5bd61841 | 2262 | t->this_p = true; |
d11ad92e | 2263 | |
5bd61841 | 2264 | convs[i] = t; |
c73964b2 | 2265 | if (! t) |
8f96c7ac JM |
2266 | { |
2267 | viable = 0; | |
4911b24d DM |
2268 | reason = arg_conversion_rejection (first_arg, i, argtype, to_type, |
2269 | EXPR_LOCATION (arg)); | |
8f96c7ac JM |
2270 | break; |
2271 | } | |
c73964b2 | 2272 | |
5bd61841 | 2273 | if (t->bad_p) |
feb6efc1 NF |
2274 | { |
2275 | viable = -1; | |
4911b24d DM |
2276 | reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type, |
2277 | EXPR_LOCATION (arg)); | |
2278 | ||
feb6efc1 | 2279 | } |
c73964b2 MS |
2280 | } |
2281 | ||
8f96c7ac | 2282 | out: |
c166b898 | 2283 | return add_candidate (candidates, fn, orig_first_arg, args, len, convs, |
4561285b | 2284 | access_path, conversion_path, viable, reason, flags); |
c73964b2 MS |
2285 | } |
2286 | ||
2287 | /* Create an overload candidate for the conversion function FN which will | |
2288 | be invoked for expression OBJ, producing a pointer-to-function which | |
c166b898 ILT |
2289 | will in turn be called with the argument list FIRST_ARG/ARGLIST, |
2290 | and add it to CANDIDATES. This does not change ARGLIST. FLAGS is | |
2291 | passed on to implicit_conversion. | |
37b6eb34 JM |
2292 | |
2293 | Actually, we don't really care about FN; we care about the type it | |
2294 | converts to. There may be multiple conversion functions that will | |
2295 | convert to that type, and we rely on build_user_type_conversion_1 to | |
2296 | choose the best one; so when we create our candidate, we record the type | |
2297 | instead of the function. */ | |
c73964b2 MS |
2298 | |
2299 | static struct z_candidate * | |
7993382e | 2300 | add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj, |
d4db5060 | 2301 | const vec<tree, va_gc> *arglist, |
b40e334f PC |
2302 | tree access_path, tree conversion_path, |
2303 | tsubst_flags_t complain) | |
c73964b2 MS |
2304 | { |
2305 | tree totype = TREE_TYPE (TREE_TYPE (fn)); | |
477f6664 | 2306 | int i, len, viable, flags; |
c166b898 | 2307 | tree parmlist, parmnode; |
5bd61841 | 2308 | conversion **convs; |
feb6efc1 | 2309 | struct rejection_reason *reason; |
477f6664 JM |
2310 | |
2311 | for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; ) | |
2312 | parmlist = TREE_TYPE (parmlist); | |
2313 | parmlist = TYPE_ARG_TYPES (parmlist); | |
2314 | ||
d4db5060 | 2315 | len = vec_safe_length (arglist) + 1; |
5bd61841 | 2316 | convs = alloc_conversions (len); |
477f6664 | 2317 | parmnode = parmlist; |
477f6664 | 2318 | viable = 1; |
e57d93c6 | 2319 | flags = LOOKUP_IMPLICIT; |
feb6efc1 | 2320 | reason = NULL; |
c73964b2 | 2321 | |
37b6eb34 | 2322 | /* Don't bother looking up the same type twice. */ |
7993382e MM |
2323 | if (*candidates && (*candidates)->fn == totype) |
2324 | return NULL; | |
37b6eb34 | 2325 | |
c73964b2 MS |
2326 | for (i = 0; i < len; ++i) |
2327 | { | |
feb6efc1 | 2328 | tree arg, argtype, convert_type = NULL_TREE; |
5bd61841 | 2329 | conversion *t; |
c73964b2 | 2330 | |
c166b898 ILT |
2331 | if (i == 0) |
2332 | arg = obj; | |
c166b898 | 2333 | else |
d4db5060 | 2334 | arg = (*arglist)[i - 1]; |
c166b898 ILT |
2335 | argtype = lvalue_type (arg); |
2336 | ||
c73964b2 | 2337 | if (i == 0) |
feb6efc1 | 2338 | { |
1a9de5b6 JM |
2339 | t = build_identity_conv (argtype, NULL_TREE); |
2340 | t = build_conv (ck_user, totype, t); | |
2341 | /* Leave the 'cand' field null; we'll figure out the conversion in | |
2342 | convert_like_real if this candidate is chosen. */ | |
feb6efc1 NF |
2343 | convert_type = totype; |
2344 | } | |
c73964b2 MS |
2345 | else if (parmnode == void_list_node) |
2346 | break; | |
2347 | else if (parmnode) | |
feb6efc1 NF |
2348 | { |
2349 | t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg, | |
b40e334f | 2350 | /*c_cast_p=*/false, flags, complain); |
feb6efc1 NF |
2351 | convert_type = TREE_VALUE (parmnode); |
2352 | } | |
c73964b2 MS |
2353 | else |
2354 | { | |
5bd61841 MM |
2355 | t = build_identity_conv (argtype, arg); |
2356 | t->ellipsis_p = true; | |
feb6efc1 | 2357 | convert_type = argtype; |
c73964b2 MS |
2358 | } |
2359 | ||
5bd61841 | 2360 | convs[i] = t; |
c73964b2 MS |
2361 | if (! t) |
2362 | break; | |
2363 | ||
5bd61841 | 2364 | if (t->bad_p) |
feb6efc1 NF |
2365 | { |
2366 | viable = -1; | |
4911b24d DM |
2367 | reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type, |
2368 | EXPR_LOCATION (arg)); | |
feb6efc1 | 2369 | } |
d11ad92e | 2370 | |
c73964b2 MS |
2371 | if (i == 0) |
2372 | continue; | |
2373 | ||
2374 | if (parmnode) | |
2375 | parmnode = TREE_CHAIN (parmnode); | |
c73964b2 MS |
2376 | } |
2377 | ||
feb6efc1 NF |
2378 | if (i < len |
2379 | || ! sufficient_parms_p (parmnode)) | |
2380 | { | |
2381 | int remaining = remaining_arguments (parmnode); | |
2382 | viable = 0; | |
2383 | reason = arity_rejection (NULL_TREE, i + remaining, len); | |
2384 | } | |
c73964b2 | 2385 | |
d4db5060 | 2386 | return add_candidate (candidates, totype, obj, arglist, len, convs, |
4561285b | 2387 | access_path, conversion_path, viable, reason, flags); |
c73964b2 MS |
2388 | } |
2389 | ||
7993382e MM |
2390 | static void |
2391 | build_builtin_candidate (struct z_candidate **candidates, tree fnname, | |
0cbd7506 | 2392 | tree type1, tree type2, tree *args, tree *argtypes, |
b40e334f | 2393 | int flags, tsubst_flags_t complain) |
c73964b2 | 2394 | { |
5bd61841 MM |
2395 | conversion *t; |
2396 | conversion **convs; | |
2397 | size_t num_convs; | |
c73964b2 | 2398 | int viable = 1, i; |
c73964b2 | 2399 | tree types[2]; |
feb6efc1 | 2400 | struct rejection_reason *reason = NULL; |
c73964b2 MS |
2401 | |
2402 | types[0] = type1; | |
2403 | types[1] = type2; | |
2404 | ||
5bd61841 MM |
2405 | num_convs = args[2] ? 3 : (args[1] ? 2 : 1); |
2406 | convs = alloc_conversions (num_convs); | |
1dad57e6 JM |
2407 | |
2408 | /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit | |
2409 | conversion ops are allowed. We handle that here by just checking for | |
2410 | boolean_type_node because other operators don't ask for it. COND_EXPR | |
2411 | also does contextual conversion to bool for the first operand, but we | |
2412 | handle that in build_conditional_expr, and type1 here is operand 2. */ | |
2413 | if (type1 != boolean_type_node) | |
2414 | flags |= LOOKUP_ONLYCONVERTING; | |
c73964b2 MS |
2415 | |
2416 | for (i = 0; i < 2; ++i) | |
2417 | { | |
2418 | if (! args[i]) | |
2419 | break; | |
2420 | ||
aa7349eb | 2421 | t = implicit_conversion (types[i], argtypes[i], args[i], |
b40e334f | 2422 | /*c_cast_p=*/false, flags, complain); |
c73964b2 MS |
2423 | if (! t) |
2424 | { | |
2425 | viable = 0; | |
2426 | /* We need something for printing the candidate. */ | |
5bd61841 | 2427 | t = build_identity_conv (types[i], NULL_TREE); |
b40e334f | 2428 | reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i], |
4911b24d | 2429 | types[i], EXPR_LOCATION (args[i])); |
c73964b2 | 2430 | } |
5bd61841 | 2431 | else if (t->bad_p) |
feb6efc1 NF |
2432 | { |
2433 | viable = 0; | |
89606913 | 2434 | reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i], |
4911b24d DM |
2435 | types[i], |
2436 | EXPR_LOCATION (args[i])); | |
feb6efc1 | 2437 | } |
5bd61841 | 2438 | convs[i] = t; |
c73964b2 MS |
2439 | } |
2440 | ||
2441 | /* For COND_EXPR we rearranged the arguments; undo that now. */ | |
2442 | if (args[2]) | |
2443 | { | |
5bd61841 MM |
2444 | convs[2] = convs[1]; |
2445 | convs[1] = convs[0]; | |
aa7349eb | 2446 | t = implicit_conversion (boolean_type_node, argtypes[2], args[2], |
b40e334f PC |
2447 | /*c_cast_p=*/false, flags, |
2448 | complain); | |
c73964b2 | 2449 | if (t) |
5bd61841 | 2450 | convs[0] = t; |
c73964b2 | 2451 | else |
feb6efc1 NF |
2452 | { |
2453 | viable = 0; | |
2454 | reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2], | |
4911b24d DM |
2455 | boolean_type_node, |
2456 | EXPR_LOCATION (args[2])); | |
feb6efc1 | 2457 | } |
c8094d83 | 2458 | } |
c73964b2 | 2459 | |
c166b898 | 2460 | add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL, |
c8094d83 | 2461 | num_convs, convs, |
7993382e MM |
2462 | /*access_path=*/NULL_TREE, |
2463 | /*conversion_path=*/NULL_TREE, | |
4561285b | 2464 | viable, reason, flags); |
c73964b2 MS |
2465 | } |
2466 | ||
94be8403 GDR |
2467 | static bool |
2468 | is_complete (tree t) | |
c73964b2 | 2469 | { |
d0f062fb | 2470 | return COMPLETE_TYPE_P (complete_type (t)); |
c73964b2 MS |
2471 | } |
2472 | ||
838dfd8a | 2473 | /* Returns nonzero if TYPE is a promoted arithmetic type. */ |
a7a64a77 | 2474 | |
94be8403 GDR |
2475 | static bool |
2476 | promoted_arithmetic_type_p (tree type) | |
a7a64a77 MM |
2477 | { |
2478 | /* [over.built] | |
2479 | ||
2480 | In this section, the term promoted integral type is used to refer | |
2481 | to those integral types which are preserved by integral promotion | |
2482 | (including e.g. int and long but excluding e.g. char). | |
2483 | Similarly, the term promoted arithmetic type refers to promoted | |
2484 | integral types plus floating types. */ | |
550a799d | 2485 | return ((CP_INTEGRAL_TYPE_P (type) |
a7a64a77 MM |
2486 | && same_type_p (type_promotes_to (type), type)) |
2487 | || TREE_CODE (type) == REAL_TYPE); | |
2488 | } | |
2489 | ||
c73964b2 MS |
2490 | /* Create any builtin operator overload candidates for the operator in |
2491 | question given the converted operand types TYPE1 and TYPE2. The other | |
2492 | args are passed through from add_builtin_candidates to | |
c8094d83 MS |
2493 | build_builtin_candidate. |
2494 | ||
2495 | TYPE1 and TYPE2 may not be permissible, and we must filter them. | |
4cff6abe NS |
2496 | If CODE is requires candidates operands of the same type of the kind |
2497 | of which TYPE1 and TYPE2 are, we add both candidates | |
2498 | CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */ | |
c73964b2 | 2499 | |
7993382e MM |
2500 | static void |
2501 | add_builtin_candidate (struct z_candidate **candidates, enum tree_code code, | |
0cbd7506 | 2502 | enum tree_code code2, tree fnname, tree type1, |
b40e334f PC |
2503 | tree type2, tree *args, tree *argtypes, int flags, |
2504 | tsubst_flags_t complain) | |
c73964b2 MS |
2505 | { |
2506 | switch (code) | |
2507 | { | |
2508 | case POSTINCREMENT_EXPR: | |
2509 | case POSTDECREMENT_EXPR: | |
2510 | args[1] = integer_zero_node; | |
2511 | type2 = integer_type_node; | |
7f85441b KG |
2512 | break; |
2513 | default: | |
2514 | break; | |
c73964b2 MS |
2515 | } |
2516 | ||
2517 | switch (code) | |
2518 | { | |
2519 | ||
2520 | /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type, | |
2521 | and VQ is either volatile or empty, there exist candidate operator | |
2522 | functions of the form | |
2523 | VQ T& operator++(VQ T&); | |
2524 | T operator++(VQ T&, int); | |
2525 | 5 For every pair T, VQ), where T is an enumeration type or an arithmetic | |
2526 | type other than bool, and VQ is either volatile or empty, there exist | |
2527 | candidate operator functions of the form | |
2528 | VQ T& operator--(VQ T&); | |
2529 | T operator--(VQ T&, int); | |
2530 | 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified | |
2531 | complete object type, and VQ is either volatile or empty, there exist | |
2532 | candidate operator functions of the form | |
2533 | T*VQ& operator++(T*VQ&); | |
2534 | T*VQ& operator--(T*VQ&); | |
2535 | T* operator++(T*VQ&, int); | |
2536 | T* operator--(T*VQ&, int); */ | |
2537 | ||
2538 | case POSTDECREMENT_EXPR: | |
2539 | case PREDECREMENT_EXPR: | |
2540 | if (TREE_CODE (type1) == BOOLEAN_TYPE) | |
7993382e | 2541 | return; |
191816a3 | 2542 | /* FALLTHRU */ |
c73964b2 MS |
2543 | case POSTINCREMENT_EXPR: |
2544 | case PREINCREMENT_EXPR: | |
4cff6abe | 2545 | if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1)) |
c73964b2 MS |
2546 | { |
2547 | type1 = build_reference_type (type1); | |
2548 | break; | |
2549 | } | |
7993382e | 2550 | return; |
c73964b2 | 2551 | |
b057bff4 | 2552 | /* 7 For every cv-qualified or cv-unqualified object type T, there |
c73964b2 MS |
2553 | exist candidate operator functions of the form |
2554 | ||
2555 | T& operator*(T*); | |
2556 | ||
2557 | 8 For every function type T, there exist candidate operator functions of | |
2558 | the form | |
2559 | T& operator*(T*); */ | |
2560 | ||
2561 | case INDIRECT_REF: | |
50e10fa8 | 2562 | if (TYPE_PTR_P (type1) |
c11b6f21 | 2563 | && (TYPE_PTROB_P (type1) |
c73964b2 MS |
2564 | || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)) |
2565 | break; | |
c8094d83 | 2566 | return; |
c73964b2 MS |
2567 | |
2568 | /* 9 For every type T, there exist candidate operator functions of the form | |
2569 | T* operator+(T*); | |
2570 | ||
2571 | 10For every promoted arithmetic type T, there exist candidate operator | |
2572 | functions of the form | |
2573 | T operator+(T); | |
2574 | T operator-(T); */ | |
2575 | ||
392e3d51 | 2576 | case UNARY_PLUS_EXPR: /* unary + */ |
50e10fa8 | 2577 | if (TYPE_PTR_P (type1)) |
c73964b2 | 2578 | break; |
191816a3 | 2579 | /* FALLTHRU */ |
c73964b2 MS |
2580 | case NEGATE_EXPR: |
2581 | if (ARITHMETIC_TYPE_P (type1)) | |
2582 | break; | |
7993382e | 2583 | return; |
c73964b2 MS |
2584 | |
2585 | /* 11For every promoted integral type T, there exist candidate operator | |
2586 | functions of the form | |
2587 | T operator~(T); */ | |
2588 | ||
2589 | case BIT_NOT_EXPR: | |
550a799d | 2590 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1)) |
c73964b2 | 2591 | break; |
7993382e | 2592 | return; |
c73964b2 MS |
2593 | |
2594 | /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1 | |
2595 | is the same type as C2 or is a derived class of C2, T is a complete | |
2596 | object type or a function type, and CV1 and CV2 are cv-qualifier-seqs, | |
2597 | there exist candidate operator functions of the form | |
2598 | CV12 T& operator->*(CV1 C1*, CV2 T C2::*); | |
2599 | where CV12 is the union of CV1 and CV2. */ | |
2600 | ||
2601 | case MEMBER_REF: | |
50e10fa8 | 2602 | if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2)) |
c73964b2 MS |
2603 | { |
2604 | tree c1 = TREE_TYPE (type1); | |
a5ac359a | 2605 | tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2); |
c73964b2 | 2606 | |
9e1e64ec | 2607 | if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1) |
c73964b2 | 2608 | && (TYPE_PTRMEMFUNC_P (type2) |
796cccfc | 2609 | || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2)))) |
c73964b2 MS |
2610 | break; |
2611 | } | |
7993382e | 2612 | return; |
c73964b2 MS |
2613 | |
2614 | /* 13For every pair of promoted arithmetic types L and R, there exist can- | |
2615 | didate operator functions of the form | |
2616 | LR operator*(L, R); | |
2617 | LR operator/(L, R); | |
2618 | LR operator+(L, R); | |
2619 | LR operator-(L, R); | |
2620 | bool operator<(L, R); | |
2621 | bool operator>(L, R); | |
2622 | bool operator<=(L, R); | |
2623 | bool operator>=(L, R); | |
2624 | bool operator==(L, R); | |
2625 | bool operator!=(L, R); | |
2626 | where LR is the result of the usual arithmetic conversions between | |
2627 | types L and R. | |
2628 | ||
2629 | 14For every pair of types T and I, where T is a cv-qualified or cv- | |
2630 | unqualified complete object type and I is a promoted integral type, | |
2631 | there exist candidate operator functions of the form | |
2632 | T* operator+(T*, I); | |
2633 | T& operator[](T*, I); | |
2634 | T* operator-(T*, I); | |
2635 | T* operator+(I, T*); | |
2636 | T& operator[](I, T*); | |
2637 | ||
2638 | 15For every T, where T is a pointer to complete object type, there exist | |
2639 | candidate operator functions of the form112) | |
2640 | ptrdiff_t operator-(T, T); | |
2641 | ||
e5596aef | 2642 | 16For every pointer or enumeration type T, there exist candidate operator |
4cff6abe | 2643 | functions of the form |
c73964b2 MS |
2644 | bool operator<(T, T); |
2645 | bool operator>(T, T); | |
2646 | bool operator<=(T, T); | |
2647 | bool operator>=(T, T); | |
2648 | bool operator==(T, T); | |
2649 | bool operator!=(T, T); | |
2650 | ||
2651 | 17For every pointer to member type T, there exist candidate operator | |
2652 | functions of the form | |
2653 | bool operator==(T, T); | |
2654 | bool operator!=(T, T); */ | |
2655 | ||
2656 | case MINUS_EXPR: | |
c11b6f21 | 2657 | if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2)) |
c73964b2 | 2658 | break; |
550a799d JM |
2659 | if (TYPE_PTROB_P (type1) |
2660 | && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) | |
c73964b2 MS |
2661 | { |
2662 | type2 = ptrdiff_type_node; | |
2663 | break; | |
2664 | } | |
9c62c873 | 2665 | /* FALLTHRU */ |
c73964b2 MS |
2666 | case MULT_EXPR: |
2667 | case TRUNC_DIV_EXPR: | |
2668 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2669 | break; | |
7993382e | 2670 | return; |
c73964b2 MS |
2671 | |
2672 | case EQ_EXPR: | |
2673 | case NE_EXPR: | |
a703fb38 | 2674 | if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2)) |
66b1156a | 2675 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))) |
c73964b2 | 2676 | break; |
66b1156a | 2677 | if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1])) |
c73964b2 MS |
2678 | { |
2679 | type2 = type1; | |
2680 | break; | |
2681 | } | |
66b1156a | 2682 | if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0])) |
c73964b2 MS |
2683 | { |
2684 | type1 = type2; | |
2685 | break; | |
2686 | } | |
f4f206f4 | 2687 | /* Fall through. */ |
c73964b2 MS |
2688 | case LT_EXPR: |
2689 | case GT_EXPR: | |
2690 | case LE_EXPR: | |
2691 | case GE_EXPR: | |
2692 | case MAX_EXPR: | |
2693 | case MIN_EXPR: | |
4cff6abe | 2694 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) |
0cbd7506 | 2695 | break; |
4cff6abe | 2696 | if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
c73964b2 | 2697 | break; |
7b5d1e27 MM |
2698 | if (TREE_CODE (type1) == ENUMERAL_TYPE |
2699 | && TREE_CODE (type2) == ENUMERAL_TYPE) | |
0cbd7506 | 2700 | break; |
7b5d1e27 | 2701 | if (TYPE_PTR_P (type1) |
3c4e06c2 | 2702 | && null_ptr_cst_p (args[1])) |
c73964b2 MS |
2703 | { |
2704 | type2 = type1; | |
2705 | break; | |
2706 | } | |
7b5d1e27 | 2707 | if (null_ptr_cst_p (args[0]) |
3c4e06c2 | 2708 | && TYPE_PTR_P (type2)) |
c73964b2 MS |
2709 | { |
2710 | type1 = type2; | |
2711 | break; | |
2712 | } | |
7993382e | 2713 | return; |
c73964b2 MS |
2714 | |
2715 | case PLUS_EXPR: | |
2716 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2717 | break; | |
191816a3 | 2718 | /* FALLTHRU */ |
c73964b2 | 2719 | case ARRAY_REF: |
550a799d | 2720 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2)) |
c73964b2 MS |
2721 | { |
2722 | type1 = ptrdiff_type_node; | |
2723 | break; | |
2724 | } | |
550a799d | 2725 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 MS |
2726 | { |
2727 | type2 = ptrdiff_type_node; | |
2728 | break; | |
2729 | } | |
7993382e | 2730 | return; |
c73964b2 MS |
2731 | |
2732 | /* 18For every pair of promoted integral types L and R, there exist candi- | |
2733 | date operator functions of the form | |
2734 | LR operator%(L, R); | |
2735 | LR operator&(L, R); | |
2736 | LR operator^(L, R); | |
2737 | LR operator|(L, R); | |
2738 | L operator<<(L, R); | |
2739 | L operator>>(L, R); | |
2740 | where LR is the result of the usual arithmetic conversions between | |
2741 | types L and R. */ | |
2742 | ||
2743 | case TRUNC_MOD_EXPR: | |
2744 | case BIT_AND_EXPR: | |
2745 | case BIT_IOR_EXPR: | |
2746 | case BIT_XOR_EXPR: | |
2747 | case LSHIFT_EXPR: | |
2748 | case RSHIFT_EXPR: | |
550a799d | 2749 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 | 2750 | break; |
7993382e | 2751 | return; |
c73964b2 MS |
2752 | |
2753 | /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration | |
2754 | type, VQ is either volatile or empty, and R is a promoted arithmetic | |
2755 | type, there exist candidate operator functions of the form | |
2756 | VQ L& operator=(VQ L&, R); | |
2757 | VQ L& operator*=(VQ L&, R); | |
2758 | VQ L& operator/=(VQ L&, R); | |
2759 | VQ L& operator+=(VQ L&, R); | |
2760 | VQ L& operator-=(VQ L&, R); | |
2761 | ||
2762 | 20For every pair T, VQ), where T is any type and VQ is either volatile | |
2763 | or empty, there exist candidate operator functions of the form | |
2764 | T*VQ& operator=(T*VQ&, T*); | |
2765 | ||
2766 | 21For every pair T, VQ), where T is a pointer to member type and VQ is | |
2767 | either volatile or empty, there exist candidate operator functions of | |
2768 | the form | |
2769 | VQ T& operator=(VQ T&, T); | |
2770 | ||
2771 | 22For every triple T, VQ, I), where T is a cv-qualified or cv- | |
2772 | unqualified complete object type, VQ is either volatile or empty, and | |
2773 | I is a promoted integral type, there exist candidate operator func- | |
2774 | tions of the form | |
2775 | T*VQ& operator+=(T*VQ&, I); | |
2776 | T*VQ& operator-=(T*VQ&, I); | |
2777 | ||
2778 | 23For every triple L, VQ, R), where L is an integral or enumeration | |
2779 | type, VQ is either volatile or empty, and R is a promoted integral | |
2780 | type, there exist candidate operator functions of the form | |
2781 | ||
2782 | VQ L& operator%=(VQ L&, R); | |
2783 | VQ L& operator<<=(VQ L&, R); | |
2784 | VQ L& operator>>=(VQ L&, R); | |
2785 | VQ L& operator&=(VQ L&, R); | |
2786 | VQ L& operator^=(VQ L&, R); | |
2787 | VQ L& operator|=(VQ L&, R); */ | |
2788 | ||
2789 | case MODIFY_EXPR: | |
2790 | switch (code2) | |
2791 | { | |
2792 | case PLUS_EXPR: | |
2793 | case MINUS_EXPR: | |
550a799d | 2794 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 MS |
2795 | { |
2796 | type2 = ptrdiff_type_node; | |
2797 | break; | |
2798 | } | |
191816a3 | 2799 | /* FALLTHRU */ |
c73964b2 MS |
2800 | case MULT_EXPR: |
2801 | case TRUNC_DIV_EXPR: | |
2802 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2803 | break; | |
7993382e | 2804 | return; |
c73964b2 MS |
2805 | |
2806 | case TRUNC_MOD_EXPR: | |
2807 | case BIT_AND_EXPR: | |
2808 | case BIT_IOR_EXPR: | |
2809 | case BIT_XOR_EXPR: | |
2810 | case LSHIFT_EXPR: | |
2811 | case RSHIFT_EXPR: | |
550a799d | 2812 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 | 2813 | break; |
7993382e | 2814 | return; |
c73964b2 MS |
2815 | |
2816 | case NOP_EXPR: | |
2817 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2818 | break; | |
2819 | if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2)) | |
2820 | || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) | |
66b1156a | 2821 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
c73964b2 | 2822 | || ((TYPE_PTRMEMFUNC_P (type1) |
50e10fa8 | 2823 | || TYPE_PTR_P (type1)) |
c73964b2 MS |
2824 | && null_ptr_cst_p (args[1]))) |
2825 | { | |
2826 | type2 = type1; | |
2827 | break; | |
2828 | } | |
7993382e | 2829 | return; |
c73964b2 MS |
2830 | |
2831 | default: | |
8dc2b103 | 2832 | gcc_unreachable (); |
c73964b2 MS |
2833 | } |
2834 | type1 = build_reference_type (type1); | |
2835 | break; | |
2836 | ||
2837 | case COND_EXPR: | |
5b0c5896 | 2838 | /* [over.built] |
a7a64a77 MM |
2839 | |
2840 | For every pair of promoted arithmetic types L and R, there | |
c8094d83 | 2841 | exist candidate operator functions of the form |
de22184b | 2842 | |
c8094d83 | 2843 | LR operator?(bool, L, R); |
a7a64a77 MM |
2844 | |
2845 | where LR is the result of the usual arithmetic conversions | |
2846 | between types L and R. | |
2847 | ||
2848 | For every type T, where T is a pointer or pointer-to-member | |
2849 | type, there exist candidate operator functions of the form T | |
2850 | operator?(bool, T, T); */ | |
2851 | ||
2852 | if (promoted_arithmetic_type_p (type1) | |
2853 | && promoted_arithmetic_type_p (type2)) | |
2854 | /* That's OK. */ | |
c73964b2 | 2855 | break; |
a7a64a77 MM |
2856 | |
2857 | /* Otherwise, the types should be pointers. */ | |
66b1156a | 2858 | if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2)) |
7993382e | 2859 | return; |
c8094d83 | 2860 | |
a7a64a77 MM |
2861 | /* We don't check that the two types are the same; the logic |
2862 | below will actually create two candidates; one in which both | |
2863 | parameter types are TYPE1, and one in which both parameter | |
2864 | types are TYPE2. */ | |
7993382e | 2865 | break; |
c73964b2 | 2866 | |
6add7e94 PC |
2867 | case REALPART_EXPR: |
2868 | case IMAGPART_EXPR: | |
2869 | if (ARITHMETIC_TYPE_P (type1)) | |
2870 | break; | |
2871 | return; | |
2872 | ||
c73964b2 | 2873 | default: |
8dc2b103 | 2874 | gcc_unreachable (); |
c73964b2 MS |
2875 | } |
2876 | ||
3c4e06c2 JM |
2877 | /* Make sure we don't create builtin candidates with dependent types. */ |
2878 | bool u1 = uses_template_parms (type1); | |
2879 | bool u2 = type2 ? uses_template_parms (type2) : false; | |
2880 | if (u1 || u2) | |
2881 | { | |
2882 | /* Try to recover if one of the types is non-dependent. But if | |
2883 | there's only one type, there's nothing we can do. */ | |
2884 | if (!type2) | |
2885 | return; | |
2886 | /* And we lose if both are dependent. */ | |
2887 | if (u1 && u2) | |
2888 | return; | |
2889 | /* Or if they have different forms. */ | |
2890 | if (TREE_CODE (type1) != TREE_CODE (type2)) | |
2891 | return; | |
2892 | ||
2893 | if (u1 && !u2) | |
2894 | type1 = type2; | |
2895 | else if (u2 && !u1) | |
2896 | type2 = type1; | |
2897 | } | |
2898 | ||
4cff6abe NS |
2899 | /* If we're dealing with two pointer types or two enumeral types, |
2900 | we need candidates for both of them. */ | |
a7a64a77 | 2901 | if (type2 && !same_type_p (type1, type2) |
c73964b2 | 2902 | && TREE_CODE (type1) == TREE_CODE (type2) |
9f613f06 | 2903 | && (TYPE_REF_P (type1) |
a5ac359a | 2904 | || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
66b1156a | 2905 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
c73964b2 | 2906 | || TYPE_PTRMEMFUNC_P (type1) |
9e1e64ec | 2907 | || MAYBE_CLASS_TYPE_P (type1) |
4cff6abe | 2908 | || TREE_CODE (type1) == ENUMERAL_TYPE)) |
c73964b2 | 2909 | { |
66b1156a | 2910 | if (TYPE_PTR_OR_PTRMEM_P (type1)) |
008d5fcc PC |
2911 | { |
2912 | tree cptype = composite_pointer_type (type1, type2, | |
2913 | error_mark_node, | |
2914 | error_mark_node, | |
2915 | CPO_CONVERSION, | |
2916 | tf_none); | |
2917 | if (cptype != error_mark_node) | |
2918 | { | |
2919 | build_builtin_candidate | |
b40e334f PC |
2920 | (candidates, fnname, cptype, cptype, args, argtypes, |
2921 | flags, complain); | |
008d5fcc PC |
2922 | return; |
2923 | } | |
2924 | } | |
2925 | ||
7993382e | 2926 | build_builtin_candidate |
b40e334f | 2927 | (candidates, fnname, type1, type1, args, argtypes, flags, complain); |
7993382e | 2928 | build_builtin_candidate |
b40e334f | 2929 | (candidates, fnname, type2, type2, args, argtypes, flags, complain); |
7993382e | 2930 | return; |
c73964b2 MS |
2931 | } |
2932 | ||
7993382e | 2933 | build_builtin_candidate |
b40e334f | 2934 | (candidates, fnname, type1, type2, args, argtypes, flags, complain); |
c73964b2 MS |
2935 | } |
2936 | ||
2937 | tree | |
94be8403 | 2938 | type_decays_to (tree type) |
c73964b2 MS |
2939 | { |
2940 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2941 | return build_pointer_type (TREE_TYPE (type)); | |
2942 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
2943 | return build_pointer_type (type); | |
2944 | return type; | |
2945 | } | |
2946 | ||
2947 | /* There are three conditions of builtin candidates: | |
2948 | ||
2949 | 1) bool-taking candidates. These are the same regardless of the input. | |
2950 | 2) pointer-pair taking candidates. These are generated for each type | |
2951 | one of the input types converts to. | |
cab1f180 | 2952 | 3) arithmetic candidates. According to the standard, we should generate |
4cff6abe | 2953 | all of these, but I'm trying not to... |
c8094d83 | 2954 | |
4cff6abe NS |
2955 | Here we generate a superset of the possible candidates for this particular |
2956 | case. That is a subset of the full set the standard defines, plus some | |
2957 | other cases which the standard disallows. add_builtin_candidate will | |
0e339752 | 2958 | filter out the invalid set. */ |
c73964b2 | 2959 | |
7993382e MM |
2960 | static void |
2961 | add_builtin_candidates (struct z_candidate **candidates, enum tree_code code, | |
0cbd7506 | 2962 | enum tree_code code2, tree fnname, tree *args, |
b40e334f | 2963 | int flags, tsubst_flags_t complain) |
c73964b2 MS |
2964 | { |
2965 | int ref1, i; | |
4cff6abe | 2966 | int enum_p = 0; |
bfc48cd8 | 2967 | tree type, argtypes[3], t; |
a7a64a77 | 2968 | /* TYPES[i] is the set of possible builtin-operator parameter types |
bfc48cd8 | 2969 | we will consider for the Ith argument. */ |
9771b263 | 2970 | vec<tree, va_gc> *types[2]; |
bfc48cd8 | 2971 | unsigned ix; |
c73964b2 MS |
2972 | |
2973 | for (i = 0; i < 3; ++i) | |
2974 | { | |
2975 | if (args[i]) | |
24030e4c | 2976 | argtypes[i] = unlowered_expr_type (args[i]); |
c73964b2 MS |
2977 | else |
2978 | argtypes[i] = NULL_TREE; | |
2979 | } | |
2980 | ||
2981 | switch (code) | |
2982 | { | |
2983 | /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type, | |
2984 | and VQ is either volatile or empty, there exist candidate operator | |
2985 | functions of the form | |
2986 | VQ T& operator++(VQ T&); */ | |
2987 | ||
2988 | case POSTINCREMENT_EXPR: | |
2989 | case PREINCREMENT_EXPR: | |
2990 | case POSTDECREMENT_EXPR: | |
2991 | case PREDECREMENT_EXPR: | |
2992 | case MODIFY_EXPR: | |
2993 | ref1 = 1; | |
2994 | break; | |
2995 | ||
2996 | /* 24There also exist candidate operator functions of the form | |
2997 | bool operator!(bool); | |
2998 | bool operator&&(bool, bool); | |
2999 | bool operator||(bool, bool); */ | |
3000 | ||
3001 | case TRUTH_NOT_EXPR: | |
7993382e | 3002 | build_builtin_candidate |
c73964b2 | 3003 | (candidates, fnname, boolean_type_node, |
b40e334f | 3004 | NULL_TREE, args, argtypes, flags, complain); |
7993382e | 3005 | return; |
c73964b2 MS |
3006 | |
3007 | case TRUTH_ORIF_EXPR: | |
3008 | case TRUTH_ANDIF_EXPR: | |
7993382e | 3009 | build_builtin_candidate |
c73964b2 | 3010 | (candidates, fnname, boolean_type_node, |
b40e334f | 3011 | boolean_type_node, args, argtypes, flags, complain); |
7993382e | 3012 | return; |
c73964b2 MS |
3013 | |
3014 | case ADDR_EXPR: | |
3015 | case COMPOUND_EXPR: | |
3016 | case COMPONENT_REF: | |
7993382e | 3017 | return; |
c73964b2 | 3018 | |
4cff6abe NS |
3019 | case COND_EXPR: |
3020 | case EQ_EXPR: | |
3021 | case NE_EXPR: | |
3022 | case LT_EXPR: | |
3023 | case LE_EXPR: | |
3024 | case GT_EXPR: | |
3025 | case GE_EXPR: | |
3026 | enum_p = 1; | |
f4f206f4 | 3027 | /* Fall through. */ |
c8094d83 | 3028 | |
c73964b2 MS |
3029 | default: |
3030 | ref1 = 0; | |
3031 | } | |
3032 | ||
bfc48cd8 NF |
3033 | types[0] = make_tree_vector (); |
3034 | types[1] = make_tree_vector (); | |
c73964b2 MS |
3035 | |
3036 | for (i = 0; i < 2; ++i) | |
3037 | { | |
3038 | if (! args[i]) | |
3039 | ; | |
9e1e64ec | 3040 | else if (MAYBE_CLASS_TYPE_P (argtypes[i])) |
c73964b2 | 3041 | { |
47898a19 | 3042 | tree convs; |
c73964b2 | 3043 | |
02020185 | 3044 | if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR) |
7993382e | 3045 | return; |
02020185 | 3046 | |
9c7d5cae | 3047 | convs = lookup_conversions (argtypes[i]); |
02020185 | 3048 | |
c73964b2 MS |
3049 | if (code == COND_EXPR) |
3050 | { | |
72b3e203 | 3051 | if (lvalue_p (args[i])) |
9771b263 | 3052 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
c73964b2 | 3053 | |
9771b263 | 3054 | vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i])); |
c73964b2 | 3055 | } |
02020185 JM |
3056 | |
3057 | else if (! convs) | |
7993382e | 3058 | return; |
c73964b2 MS |
3059 | |
3060 | for (; convs; convs = TREE_CHAIN (convs)) | |
3061 | { | |
e57d93c6 | 3062 | type = TREE_TYPE (convs); |
c73964b2 MS |
3063 | |
3064 | if (i == 0 && ref1 | |
9f613f06 | 3065 | && (!TYPE_REF_P (type) |
91063b51 | 3066 | || CP_TYPE_CONST_P (TREE_TYPE (type)))) |
c73964b2 MS |
3067 | continue; |
3068 | ||
9f613f06 | 3069 | if (code == COND_EXPR && TYPE_REF_P (type)) |
9771b263 | 3070 | vec_safe_push (types[i], type); |
c73964b2 MS |
3071 | |
3072 | type = non_reference (type); | |
3073 | if (i != 0 || ! ref1) | |
3074 | { | |
ccaff498 | 3075 | type = cv_unqualified (type_decays_to (type)); |
0cbd7506 | 3076 | if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE) |
9771b263 | 3077 | vec_safe_push (types[i], type); |
550a799d | 3078 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
c73964b2 MS |
3079 | type = type_promotes_to (type); |
3080 | } | |
3081 | ||
bfc48cd8 | 3082 | if (! vec_member (type, types[i])) |
9771b263 | 3083 | vec_safe_push (types[i], type); |
c73964b2 MS |
3084 | } |
3085 | } | |
3086 | else | |
3087 | { | |
72b3e203 | 3088 | if (code == COND_EXPR && lvalue_p (args[i])) |
9771b263 | 3089 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
c73964b2 MS |
3090 | type = non_reference (argtypes[i]); |
3091 | if (i != 0 || ! ref1) | |
3092 | { | |
ccaff498 | 3093 | type = cv_unqualified (type_decays_to (type)); |
550a799d | 3094 | if (enum_p && UNSCOPED_ENUM_P (type)) |
9771b263 | 3095 | vec_safe_push (types[i], type); |
550a799d | 3096 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
c73964b2 MS |
3097 | type = type_promotes_to (type); |
3098 | } | |
9771b263 | 3099 | vec_safe_push (types[i], type); |
c73964b2 MS |
3100 | } |
3101 | } | |
3102 | ||
a7a64a77 MM |
3103 | /* Run through the possible parameter types of both arguments, |
3104 | creating candidates with those parameter types. */ | |
9771b263 | 3105 | FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t) |
c73964b2 | 3106 | { |
bfc48cd8 NF |
3107 | unsigned jx; |
3108 | tree u; | |
3109 | ||
9771b263 DN |
3110 | if (!types[1]->is_empty ()) |
3111 | FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u) | |
7993382e | 3112 | add_builtin_candidate |
bfc48cd8 | 3113 | (candidates, code, code2, fnname, t, |
b40e334f | 3114 | u, args, argtypes, flags, complain); |
c73964b2 | 3115 | else |
7993382e | 3116 | add_builtin_candidate |
bfc48cd8 | 3117 | (candidates, code, code2, fnname, t, |
b40e334f | 3118 | NULL_TREE, args, argtypes, flags, complain); |
c73964b2 | 3119 | } |
bfc48cd8 NF |
3120 | |
3121 | release_tree_vector (types[0]); | |
3122 | release_tree_vector (types[1]); | |
c73964b2 MS |
3123 | } |
3124 | ||
e1467ff2 | 3125 | |
386b8a85 JM |
3126 | /* If TMPL can be successfully instantiated as indicated by |
3127 | EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES. | |
3128 | ||
e1467ff2 MM |
3129 | TMPL is the template. EXPLICIT_TARGS are any explicit template |
3130 | arguments. ARGLIST is the arguments provided at the call-site. | |
c166b898 ILT |
3131 | This does not change ARGLIST. The RETURN_TYPE is the desired type |
3132 | for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are | |
3133 | as for add_function_candidate. If an OBJ is supplied, FLAGS and | |
3134 | CTYPE are ignored, and OBJ is as for add_conv_candidate. */ | |
e1467ff2 MM |
3135 | |
3136 | static struct z_candidate* | |
7993382e | 3137 | add_template_candidate_real (struct z_candidate **candidates, tree tmpl, |
c166b898 | 3138 | tree ctype, tree explicit_targs, tree first_arg, |
9771b263 | 3139 | const vec<tree, va_gc> *arglist, tree return_type, |
c166b898 | 3140 | tree access_path, tree conversion_path, |
b40e334f PC |
3141 | int flags, tree obj, unification_kind_t strict, |
3142 | tsubst_flags_t complain) | |
c73964b2 | 3143 | { |
98c1c668 | 3144 | int ntparms = DECL_NTPARMS (tmpl); |
f31c0a32 | 3145 | tree targs = make_tree_vec (ntparms); |
9771b263 | 3146 | unsigned int len = vec_safe_length (arglist); |
9c39ceab PC |
3147 | unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len; |
3148 | unsigned int skip_without_in_chrg = 0; | |
3149 | tree first_arg_without_in_chrg = first_arg; | |
c166b898 ILT |
3150 | tree *args_without_in_chrg; |
3151 | unsigned int nargs_without_in_chrg; | |
3152 | unsigned int ia, ix; | |
3153 | tree arg; | |
c73964b2 | 3154 | struct z_candidate *cand; |
c73964b2 | 3155 | tree fn; |
feb6efc1 | 3156 | struct rejection_reason *reason = NULL; |
3d2f6864 | 3157 | int errs; |
6147a53a | 3158 | conversion **convs = NULL; |
c73964b2 | 3159 | |
e5214479 JM |
3160 | /* We don't do deduction on the in-charge parameter, the VTT |
3161 | parameter or 'this'. */ | |
3162 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl)) | |
c166b898 ILT |
3163 | { |
3164 | if (first_arg_without_in_chrg != NULL_TREE) | |
3165 | first_arg_without_in_chrg = NULL_TREE; | |
ba2b189e JM |
3166 | else if (return_type && strict == DEDUCE_CALL) |
3167 | /* We're deducing for a call to the result of a template conversion | |
3168 | function, so the args don't contain 'this'; leave them alone. */; | |
c166b898 ILT |
3169 | else |
3170 | ++skip_without_in_chrg; | |
3171 | } | |
e5214479 | 3172 | |
71a19881 MM |
3173 | if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl) |
3174 | || DECL_BASE_CONSTRUCTOR_P (tmpl)) | |
5775a06a | 3175 | && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl))) |
c166b898 ILT |
3176 | { |
3177 | if (first_arg_without_in_chrg != NULL_TREE) | |
3178 | first_arg_without_in_chrg = NULL_TREE; | |
3179 | else | |
3180 | ++skip_without_in_chrg; | |
3181 | } | |
3182 | ||
9c39ceab PC |
3183 | if (len < skip_without_in_chrg) |
3184 | return NULL; | |
3185 | ||
ee9661d4 JM |
3186 | if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2 |
3187 | && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg), | |
3188 | TREE_TYPE ((*arglist)[0]))) | |
3189 | { | |
3190 | /* 12.8/6 says, "A declaration of a constructor for a class X is | |
3191 | ill-formed if its first parameter is of type (optionally cv-qualified) | |
3192 | X and either there are no other parameters or else all other | |
3193 | parameters have default arguments. A member function template is never | |
3194 | instantiated to produce such a constructor signature." | |
3195 | ||
3196 | So if we're trying to copy an object of the containing class, don't | |
3197 | consider a template constructor that has a first parameter type that | |
3198 | is just a template parameter, as we would deduce a signature that we | |
3199 | would then reject in the code below. */ | |
3200 | if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl)) | |
3201 | { | |
3202 | firstparm = TREE_VALUE (firstparm); | |
3203 | if (PACK_EXPANSION_P (firstparm)) | |
3204 | firstparm = PACK_EXPANSION_PATTERN (firstparm); | |
3205 | if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM) | |
3206 | { | |
3207 | gcc_assert (!explicit_targs); | |
3208 | reason = invalid_copy_with_fn_template_rejection (); | |
3209 | goto fail; | |
3210 | } | |
3211 | } | |
3212 | } | |
3213 | ||
c166b898 | 3214 | nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0) |
9c39ceab | 3215 | + (len - skip_without_in_chrg)); |
c166b898 ILT |
3216 | args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg); |
3217 | ia = 0; | |
3218 | if (first_arg_without_in_chrg != NULL_TREE) | |
3219 | { | |
3220 | args_without_in_chrg[ia] = first_arg_without_in_chrg; | |
3221 | ++ia; | |
3222 | } | |
3223 | for (ix = skip_without_in_chrg; | |
9771b263 | 3224 | vec_safe_iterate (arglist, ix, &arg); |
c166b898 ILT |
3225 | ++ix) |
3226 | { | |
3227 | args_without_in_chrg[ia] = arg; | |
3228 | ++ia; | |
3229 | } | |
3230 | gcc_assert (ia == nargs_without_in_chrg); | |
71a19881 | 3231 | |
3d2f6864 | 3232 | errs = errorcount+sorrycount; |
6147a53a JM |
3233 | if (!obj) |
3234 | convs = alloc_conversions (nargs); | |
cd057e3a JM |
3235 | fn = fn_type_unification (tmpl, explicit_targs, targs, |
3236 | args_without_in_chrg, | |
3237 | nargs_without_in_chrg, | |
6147a53a JM |
3238 | return_type, strict, flags, convs, |
3239 | false, complain & tf_decltype); | |
98c1c668 | 3240 | |
cd057e3a | 3241 | if (fn == error_mark_node) |
3d2f6864 NF |
3242 | { |
3243 | /* Don't repeat unification later if it already resulted in errors. */ | |
3244 | if (errorcount+sorrycount == errs) | |
3245 | reason = template_unification_rejection (tmpl, explicit_targs, | |
3246 | targs, args_without_in_chrg, | |
3247 | nargs_without_in_chrg, | |
3248 | return_type, strict, flags); | |
3249 | else | |
3250 | reason = template_unification_error_rejection (); | |
3251 | goto fail; | |
3252 | } | |
c73964b2 | 3253 | |
b5ff4f5c MP |
3254 | /* Now the explicit specifier might have been deduced; check if this |
3255 | declaration is explicit. If it is and we're ignoring non-converting | |
3256 | constructors, don't add this function to the set of candidates. */ | |
3257 | if ((flags & LOOKUP_ONLYCONVERTING) && DECL_NONCONVERTING_P (fn)) | |
3258 | return NULL; | |
3259 | ||
c166b898 | 3260 | if (DECL_CONSTRUCTOR_P (fn) && nargs == 2) |
9928a3d5 MM |
3261 | { |
3262 | tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
3263 | if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)), | |
3264 | ctype)) | |
3d2f6864 | 3265 | { |
ee9661d4 JM |
3266 | /* We're trying to produce a constructor with a prohibited signature, |
3267 | as discussed above; handle here any cases we didn't catch then, | |
3268 | such as X(X<T>). */ | |
3d2f6864 NF |
3269 | reason = invalid_copy_with_fn_template_rejection (); |
3270 | goto fail; | |
3271 | } | |
9928a3d5 MM |
3272 | } |
3273 | ||
e1467ff2 MM |
3274 | if (obj != NULL_TREE) |
3275 | /* Aha, this is a conversion function. */ | |
d4db5060 | 3276 | cand = add_conv_candidate (candidates, fn, obj, arglist, |
b40e334f | 3277 | access_path, conversion_path, complain); |
e1467ff2 | 3278 | else |
aa52c1ff | 3279 | cand = add_function_candidate (candidates, fn, ctype, |
c166b898 | 3280 | first_arg, arglist, access_path, |
6147a53a | 3281 | conversion_path, flags, convs, complain); |
e1467ff2 MM |
3282 | if (DECL_TI_TEMPLATE (fn) != tmpl) |
3283 | /* This situation can occur if a member template of a template | |
3284 | class is specialized. Then, instantiate_template might return | |
3285 | an instantiation of the specialization, in which case the | |
3286 | DECL_TI_TEMPLATE field will point at the original | |
3287 | specialization. For example: | |
3288 | ||
3289 | template <class T> struct S { template <class U> void f(U); | |
3290 | template <> void f(int) {}; }; | |
3291 | S<double> sd; | |
3292 | sd.f(3); | |
3293 | ||
3294 | Here, TMPL will be template <class U> S<double>::f(U). | |
3295 | And, instantiate template will give us the specialization | |
3296 | template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field | |
3297 | for this will point at template <class T> template <> S<T>::f(int), | |
3298 | so that we can find the definition. For the purposes of | |
3299 | overload resolution, however, we want the original TMPL. */ | |
aa373032 | 3300 | cand->template_decl = build_template_info (tmpl, targs); |
e1467ff2 | 3301 | else |
ea0ad329 | 3302 | cand->template_decl = DECL_TEMPLATE_INFO (fn); |
f18ea1bf | 3303 | cand->explicit_targs = explicit_targs; |
e1467ff2 | 3304 | |
c73964b2 | 3305 | return cand; |
3784b33c JM |
3306 | fail: |
3307 | return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL, | |
4561285b | 3308 | access_path, conversion_path, 0, reason, flags); |
c73964b2 MS |
3309 | } |
3310 | ||
786b5245 MM |
3311 | |
3312 | static struct z_candidate * | |
7993382e | 3313 | add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype, |
c166b898 | 3314 | tree explicit_targs, tree first_arg, |
9771b263 | 3315 | const vec<tree, va_gc> *arglist, tree return_type, |
0cbd7506 | 3316 | tree access_path, tree conversion_path, int flags, |
b40e334f | 3317 | unification_kind_t strict, tsubst_flags_t complain) |
786b5245 | 3318 | { |
c8094d83 | 3319 | return |
aa52c1ff | 3320 | add_template_candidate_real (candidates, tmpl, ctype, |
c166b898 ILT |
3321 | explicit_targs, first_arg, arglist, |
3322 | return_type, access_path, conversion_path, | |
b40e334f | 3323 | flags, NULL_TREE, strict, complain); |
e1467ff2 | 3324 | } |
786b5245 | 3325 | |
ba2b189e JM |
3326 | /* Create an overload candidate for the conversion function template TMPL, |
3327 | returning RETURN_TYPE, which will be invoked for expression OBJ to produce a | |
3328 | pointer-to-function which will in turn be called with the argument list | |
3329 | ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is | |
3330 | passed on to implicit_conversion. */ | |
786b5245 | 3331 | |
e1467ff2 | 3332 | static struct z_candidate * |
7993382e | 3333 | add_template_conv_candidate (struct z_candidate **candidates, tree tmpl, |
d4db5060 | 3334 | tree obj, |
9771b263 | 3335 | const vec<tree, va_gc> *arglist, |
c166b898 | 3336 | tree return_type, tree access_path, |
b40e334f | 3337 | tree conversion_path, tsubst_flags_t complain) |
e1467ff2 | 3338 | { |
bd40bc8e JM |
3339 | /* Making this work broke PR 71117 and 85118, so until the committee resolves |
3340 | core issue 2189, let's disable this candidate if there are any call | |
4d031550 | 3341 | operators. */ |
bd40bc8e | 3342 | if (*candidates) |
4d031550 JM |
3343 | return NULL; |
3344 | ||
c8094d83 | 3345 | return |
aa52c1ff | 3346 | add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE, |
d4db5060 | 3347 | NULL_TREE, arglist, return_type, access_path, |
ba2b189e | 3348 | conversion_path, 0, obj, DEDUCE_CALL, |
b40e334f | 3349 | complain); |
786b5245 MM |
3350 | } |
3351 | ||
436f8a4c | 3352 | /* The CANDS are the set of candidates that were considered for |
3784b33c JM |
3353 | overload resolution. Return the set of viable candidates, or CANDS |
3354 | if none are viable. If any of the candidates were viable, set | |
3355 | *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be | |
3356 | considered viable only if it is strictly viable. */ | |
786b5245 | 3357 | |
436f8a4c MM |
3358 | static struct z_candidate* |
3359 | splice_viable (struct z_candidate *cands, | |
3360 | bool strict_p, | |
3361 | bool *any_viable_p) | |
c73964b2 | 3362 | { |
436f8a4c MM |
3363 | struct z_candidate *viable; |
3364 | struct z_candidate **last_viable; | |
3365 | struct z_candidate **cand; | |
89606913 | 3366 | bool found_strictly_viable = false; |
436f8a4c | 3367 | |
4d7f99c7 JM |
3368 | /* Be strict inside templates, since build_over_call won't actually |
3369 | do the conversions to get pedwarns. */ | |
3370 | if (processing_template_decl) | |
3371 | strict_p = true; | |
3372 | ||
436f8a4c MM |
3373 | viable = NULL; |
3374 | last_viable = &viable; | |
3375 | *any_viable_p = false; | |
3376 | ||
c8094d83 MS |
3377 | cand = &cands; |
3378 | while (*cand) | |
436f8a4c MM |
3379 | { |
3380 | struct z_candidate *c = *cand; | |
89606913 JM |
3381 | if (!strict_p |
3382 | && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL)) | |
3383 | { | |
3384 | /* Be strict in the presence of a viable candidate. Also if | |
3385 | there are template candidates, so that we get deduction errors | |
3386 | for them instead of silently preferring a bad conversion. */ | |
3387 | strict_p = true; | |
3388 | if (viable && !found_strictly_viable) | |
3389 | { | |
3390 | /* Put any spliced near matches back onto the main list so | |
3391 | that we see them if there is no strict match. */ | |
3392 | *any_viable_p = false; | |
3393 | *last_viable = cands; | |
3394 | cands = viable; | |
3395 | viable = NULL; | |
3396 | last_viable = &viable; | |
3397 | } | |
3398 | } | |
3399 | ||
436f8a4c MM |
3400 | if (strict_p ? c->viable == 1 : c->viable) |
3401 | { | |
3402 | *last_viable = c; | |
3403 | *cand = c->next; | |
3404 | c->next = NULL; | |
3405 | last_viable = &c->next; | |
3406 | *any_viable_p = true; | |
89606913 JM |
3407 | if (c->viable == 1) |
3408 | found_strictly_viable = true; | |
436f8a4c MM |
3409 | } |
3410 | else | |
3411 | cand = &c->next; | |
3412 | } | |
3413 | ||
3414 | return viable ? viable : cands; | |
c73964b2 MS |
3415 | } |
3416 | ||
94be8403 GDR |
3417 | static bool |
3418 | any_strictly_viable (struct z_candidate *cands) | |
ecc42c14 AO |
3419 | { |
3420 | for (; cands; cands = cands->next) | |
3421 | if (cands->viable == 1) | |
94be8403 GDR |
3422 | return true; |
3423 | return false; | |
ecc42c14 AO |
3424 | } |
3425 | ||
dfb5c523 MM |
3426 | /* OBJ is being used in an expression like "OBJ.f (...)". In other |
3427 | words, it is about to become the "this" pointer for a member | |
3428 | function call. Take the address of the object. */ | |
3429 | ||
824b9a4c | 3430 | static tree |
94be8403 | 3431 | build_this (tree obj) |
c73964b2 | 3432 | { |
dfb5c523 MM |
3433 | /* In a template, we are only concerned about the type of the |
3434 | expression, so we can take a shortcut. */ | |
c1051bf7 | 3435 | if (processing_template_decl) |
dfb5c523 MM |
3436 | return build_address (obj); |
3437 | ||
93c0e0bb | 3438 | return cp_build_addr_expr (obj, tf_warning_or_error); |
c73964b2 MS |
3439 | } |
3440 | ||
436f8a4c MM |
3441 | /* Returns true iff functions are equivalent. Equivalent functions are |
3442 | not '==' only if one is a function-local extern function or if | |
3443 | both are extern "C". */ | |
3444 | ||
3445 | static inline int | |
3446 | equal_functions (tree fn1, tree fn2) | |
3447 | { | |
3784b33c JM |
3448 | if (TREE_CODE (fn1) != TREE_CODE (fn2)) |
3449 | return 0; | |
3450 | if (TREE_CODE (fn1) == TEMPLATE_DECL) | |
3451 | return fn1 == fn2; | |
436f8a4c MM |
3452 | if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2) |
3453 | || DECL_EXTERN_C_FUNCTION_P (fn1)) | |
3454 | return decls_match (fn1, fn2); | |
3455 | return fn1 == fn2; | |
3456 | } | |
3457 | ||
66e58259 | 3458 | /* Print information about a candidate FN being rejected due to INFO. */ |
feb6efc1 NF |
3459 | |
3460 | static void | |
66e58259 DM |
3461 | print_conversion_rejection (location_t loc, struct conversion_info *info, |
3462 | tree fn) | |
feb6efc1 | 3463 | { |
89606913 JM |
3464 | tree from = info->from; |
3465 | if (!TYPE_P (from)) | |
3466 | from = lvalue_type (from); | |
feb6efc1 | 3467 | if (info->n_arg == -1) |
89606913 JM |
3468 | { |
3469 | /* Conversion of implicit `this' argument failed. */ | |
3470 | if (!TYPE_P (info->from)) | |
3471 | /* A bad conversion for 'this' must be discarding cv-quals. */ | |
8fa53379 | 3472 | inform (loc, " passing %qT as %<this%> " |
89606913 JM |
3473 | "argument discards qualifiers", |
3474 | from); | |
3475 | else | |
3476 | inform (loc, " no known conversion for implicit " | |
f012c8ef | 3477 | "%<this%> parameter from %qH to %qI", |
89606913 JM |
3478 | from, info->to_type); |
3479 | } | |
3480 | else if (!TYPE_P (info->from)) | |
3481 | { | |
3482 | if (info->n_arg >= 0) | |
3483 | inform (loc, " conversion of argument %d would be ill-formed:", | |
8fa53379 | 3484 | info->n_arg + 1); |
89606913 JM |
3485 | perform_implicit_conversion (info->to_type, info->from, |
3486 | tf_warning_or_error); | |
3487 | } | |
241172a5 JM |
3488 | else if (info->n_arg == -2) |
3489 | /* Conversion of conversion function return value failed. */ | |
f012c8ef | 3490 | inform (loc, " no known conversion from %qH to %qI", |
89606913 | 3491 | from, info->to_type); |
feb6efc1 | 3492 | else |
66e58259 DM |
3493 | { |
3494 | if (TREE_CODE (fn) == FUNCTION_DECL) | |
3495 | loc = get_fndecl_argument_location (fn, info->n_arg); | |
3496 | inform (loc, " no known conversion for argument %d from %qH to %qI", | |
3497 | info->n_arg + 1, from, info->to_type); | |
3498 | } | |
feb6efc1 NF |
3499 | } |
3500 | ||
3d2f6864 NF |
3501 | /* Print information about a candidate with WANT parameters and we found |
3502 | HAVE. */ | |
3503 | ||
3504 | static void | |
3505 | print_arity_information (location_t loc, unsigned int have, unsigned int want) | |
3506 | { | |
3507 | inform_n (loc, want, | |
3508 | " candidate expects %d argument, %d provided", | |
3509 | " candidate expects %d arguments, %d provided", | |
3510 | want, have); | |
3511 | } | |
3512 | ||
d2a6f3c0 ZW |
3513 | /* Print information about one overload candidate CANDIDATE. MSGSTR |
3514 | is the text to print before the candidate itself. | |
3515 | ||
3516 | NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected | |
3517 | to have been run through gettext by the caller. This wart makes | |
3518 | life simpler in print_z_candidates and for the translators. */ | |
b9747e59 JM |
3519 | |
3520 | static void | |
498ad15e PC |
3521 | print_z_candidate (location_t loc, const char *msgstr, |
3522 | struct z_candidate *candidate) | |
b9747e59 | 3523 | { |
feb6efc1 NF |
3524 | const char *msg = (msgstr == NULL |
3525 | ? "" | |
3526 | : ACONCAT ((msgstr, " ", NULL))); | |
31f7f784 JM |
3527 | tree fn = candidate->fn; |
3528 | if (flag_new_inheriting_ctors) | |
3529 | fn = strip_inheriting_ctors (fn); | |
3530 | location_t cloc = location_of (fn); | |
feb6efc1 | 3531 | |
31f7f784 | 3532 | if (identifier_p (fn)) |
b9747e59 | 3533 | { |
498ad15e | 3534 | cloc = loc; |
5bd61841 | 3535 | if (candidate->num_convs == 3) |
d4a5c4eb | 3536 | inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn, |
5bd61841 MM |
3537 | candidate->convs[0]->type, |
3538 | candidate->convs[1]->type, | |
3539 | candidate->convs[2]->type); | |
3540 | else if (candidate->num_convs == 2) | |
d4a5c4eb | 3541 | inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn, |
5bd61841 MM |
3542 | candidate->convs[0]->type, |
3543 | candidate->convs[1]->type); | |
b9747e59 | 3544 | else |
d4a5c4eb | 3545 | inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn, |
5bd61841 | 3546 | candidate->convs[0]->type); |
b9747e59 | 3547 | } |
31f7f784 | 3548 | else if (TYPE_P (fn)) |
0f2c4a8f | 3549 | inform (cloc, "%s%qT <conversion>", msg, fn); |
d2a6f3c0 | 3550 | else if (candidate->viable == -1) |
0f2c4a8f | 3551 | inform (cloc, "%s%#qD <near match>", msg, fn); |
31f7f784 | 3552 | else if (DECL_DELETED_FN (fn)) |
0f2c4a8f | 3553 | inform (cloc, "%s%#qD <deleted>", msg, fn); |
b9747e59 | 3554 | else |
0f2c4a8f | 3555 | inform (cloc, "%s%#qD", msg, fn); |
31f7f784 JM |
3556 | if (fn != candidate->fn) |
3557 | { | |
3558 | cloc = location_of (candidate->fn); | |
3559 | inform (cloc, " inherited here"); | |
3560 | } | |
feb6efc1 NF |
3561 | /* Give the user some information about why this candidate failed. */ |
3562 | if (candidate->reason != NULL) | |
3563 | { | |
3564 | struct rejection_reason *r = candidate->reason; | |
3565 | ||
3566 | switch (r->code) | |
3567 | { | |
3568 | case rr_arity: | |
498ad15e | 3569 | print_arity_information (cloc, r->u.arity.actual, |
3d2f6864 | 3570 | r->u.arity.expected); |
feb6efc1 NF |
3571 | break; |
3572 | case rr_arg_conversion: | |
66e58259 | 3573 | print_conversion_rejection (cloc, &r->u.conversion, fn); |
feb6efc1 NF |
3574 | break; |
3575 | case rr_bad_arg_conversion: | |
66e58259 | 3576 | print_conversion_rejection (cloc, &r->u.bad_conversion, fn); |
feb6efc1 | 3577 | break; |
b028af11 | 3578 | case rr_explicit_conversion: |
498ad15e | 3579 | inform (cloc, " return type %qT of explicit conversion function " |
b028af11 | 3580 | "cannot be converted to %qT with a qualification " |
89606913 | 3581 | "conversion", r->u.conversion.from, |
b028af11 JM |
3582 | r->u.conversion.to_type); |
3583 | break; | |
c8580138 | 3584 | case rr_template_conversion: |
498ad15e | 3585 | inform (cloc, " conversion from return type %qT of template " |
c8580138 | 3586 | "conversion function specialization to %qT is not an " |
89606913 | 3587 | "exact match", r->u.conversion.from, |
c8580138 JM |
3588 | r->u.conversion.to_type); |
3589 | break; | |
3d2f6864 NF |
3590 | case rr_template_unification: |
3591 | /* We use template_unification_error_rejection if unification caused | |
3592 | actual non-SFINAE errors, in which case we don't need to repeat | |
3593 | them here. */ | |
3594 | if (r->u.template_unification.tmpl == NULL_TREE) | |
3595 | { | |
498ad15e | 3596 | inform (cloc, " substitution of deduced template arguments " |
3d2f6864 NF |
3597 | "resulted in errors seen above"); |
3598 | break; | |
3599 | } | |
3600 | /* Re-run template unification with diagnostics. */ | |
498ad15e | 3601 | inform (cloc, " template argument deduction/substitution failed:"); |
3d2f6864 NF |
3602 | fn_type_unification (r->u.template_unification.tmpl, |
3603 | r->u.template_unification.explicit_targs, | |
cd057e3a JM |
3604 | (make_tree_vec |
3605 | (r->u.template_unification.num_targs)), | |
3d2f6864 NF |
3606 | r->u.template_unification.args, |
3607 | r->u.template_unification.nargs, | |
3608 | r->u.template_unification.return_type, | |
3609 | r->u.template_unification.strict, | |
3610 | r->u.template_unification.flags, | |
6147a53a | 3611 | NULL, true, false); |
3d2f6864 | 3612 | break; |
3d2f6864 | 3613 | case rr_invalid_copy: |
498ad15e | 3614 | inform (cloc, |
3d2f6864 NF |
3615 | " a constructor taking a single argument of its own " |
3616 | "class type is invalid"); | |
3617 | break; | |
971e17ff AS |
3618 | case rr_constraint_failure: |
3619 | { | |
3620 | tree tmpl = r->u.template_instantiation.tmpl; | |
3621 | tree args = r->u.template_instantiation.targs; | |
3622 | diagnose_constraints (cloc, tmpl, args); | |
3623 | } | |
3624 | break; | |
31f7f784 JM |
3625 | case rr_inherited_ctor: |
3626 | inform (cloc, " an inherited constructor is not a candidate for " | |
3627 | "initialization from an expression of the same or derived " | |
3628 | "type"); | |
3629 | break; | |
feb6efc1 NF |
3630 | case rr_none: |
3631 | default: | |
3632 | /* This candidate didn't have any issues or we failed to | |
3633 | handle a particular code. Either way... */ | |
3634 | gcc_unreachable (); | |
3635 | } | |
3636 | } | |
b9747e59 JM |
3637 | } |
3638 | ||
c73964b2 | 3639 | static void |
feb6efc1 | 3640 | print_z_candidates (location_t loc, struct z_candidate *candidates) |
c73964b2 | 3641 | { |
436f8a4c MM |
3642 | struct z_candidate *cand1; |
3643 | struct z_candidate **cand2; | |
3644 | ||
f0673555 JM |
3645 | if (!candidates) |
3646 | return; | |
3647 | ||
e14eaea4 | 3648 | /* Remove non-viable deleted candidates. */ |
f0673555 JM |
3649 | cand1 = candidates; |
3650 | for (cand2 = &cand1; *cand2; ) | |
3651 | { | |
3652 | if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL | |
e14eaea4 | 3653 | && !(*cand2)->viable |
f0673555 JM |
3654 | && DECL_DELETED_FN ((*cand2)->fn)) |
3655 | *cand2 = (*cand2)->next; | |
3656 | else | |
3657 | cand2 = &(*cand2)->next; | |
3658 | } | |
3659 | /* ...if there are any non-deleted ones. */ | |
3660 | if (cand1) | |
3661 | candidates = cand1; | |
3662 | ||
436f8a4c MM |
3663 | /* There may be duplicates in the set of candidates. We put off |
3664 | checking this condition as long as possible, since we have no way | |
3665 | to eliminate duplicates from a set of functions in less than n^2 | |
3666 | time. Now we are about to emit an error message, so it is more | |
3667 | permissible to go slowly. */ | |
3668 | for (cand1 = candidates; cand1; cand1 = cand1->next) | |
3669 | { | |
3670 | tree fn = cand1->fn; | |
3671 | /* Skip builtin candidates and conversion functions. */ | |
3784b33c | 3672 | if (!DECL_P (fn)) |
436f8a4c MM |
3673 | continue; |
3674 | cand2 = &cand1->next; | |
3675 | while (*cand2) | |
3676 | { | |
3784b33c | 3677 | if (DECL_P ((*cand2)->fn) |
436f8a4c MM |
3678 | && equal_functions (fn, (*cand2)->fn)) |
3679 | *cand2 = (*cand2)->next; | |
3680 | else | |
3681 | cand2 = &(*cand2)->next; | |
3682 | } | |
3683 | } | |
3684 | ||
6ba6f70d | 3685 | for (; candidates; candidates = candidates->next) |
89606913 | 3686 | print_z_candidate (loc, "candidate:", candidates); |
c73964b2 MS |
3687 | } |
3688 | ||
3d938426 MM |
3689 | /* USER_SEQ is a user-defined conversion sequence, beginning with a |
3690 | USER_CONV. STD_SEQ is the standard conversion sequence applied to | |
3691 | the result of the conversion function to convert it to the final | |
78dcd41a | 3692 | desired type. Merge the two sequences into a single sequence, |
3d938426 MM |
3693 | and return the merged sequence. */ |
3694 | ||
5bd61841 MM |
3695 | static conversion * |
3696 | merge_conversion_sequences (conversion *user_seq, conversion *std_seq) | |
3d938426 | 3697 | { |
5bd61841 | 3698 | conversion **t; |
940023f4 | 3699 | bool bad = user_seq->bad_p; |
3d938426 | 3700 | |
50bc768d | 3701 | gcc_assert (user_seq->kind == ck_user); |
3d938426 MM |
3702 | |
3703 | /* Find the end of the second conversion sequence. */ | |
940023f4 JM |
3704 | for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next)) |
3705 | { | |
3706 | /* The entire sequence is a user-conversion sequence. */ | |
3707 | (*t)->user_conv_p = true; | |
3708 | if (bad) | |
3709 | (*t)->bad_p = true; | |
3710 | } | |
3d938426 | 3711 | |
da0c8d97 JM |
3712 | if ((*t)->rvaluedness_matches_p) |
3713 | /* We're binding a reference directly to the result of the conversion. | |
3714 | build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return | |
3715 | type, but we want it back. */ | |
3716 | user_seq->type = TREE_TYPE (TREE_TYPE (user_seq->cand->fn)); | |
3717 | ||
3d938426 MM |
3718 | /* Replace the identity conversion with the user conversion |
3719 | sequence. */ | |
3720 | *t = user_seq; | |
3721 | ||
3d938426 MM |
3722 | return std_seq; |
3723 | } | |
3724 | ||
4c9b3895 JM |
3725 | /* Handle overload resolution for initializing an object of class type from |
3726 | an initializer list. First we look for a suitable constructor that | |
3727 | takes a std::initializer_list; if we don't find one, we then look for a | |
3728 | non-list constructor. | |
3729 | ||
3730 | Parameters are as for add_candidates, except that the arguments are in | |
9771b263 | 3731 | the form of a CONSTRUCTOR (the initializer list) rather than a vector, and |
4c9b3895 JM |
3732 | the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */ |
3733 | ||
3734 | static void | |
3735 | add_list_candidates (tree fns, tree first_arg, | |
bd84e560 | 3736 | const vec<tree, va_gc> *args, tree totype, |
4c9b3895 JM |
3737 | tree explicit_targs, bool template_only, |
3738 | tree conversion_path, tree access_path, | |
3739 | int flags, | |
b40e334f PC |
3740 | struct z_candidate **candidates, |
3741 | tsubst_flags_t complain) | |
4c9b3895 | 3742 | { |
4c9b3895 JM |
3743 | gcc_assert (*candidates == NULL); |
3744 | ||
11c71a22 JM |
3745 | /* We're looking for a ctor for list-initialization. */ |
3746 | flags |= LOOKUP_LIST_INIT_CTOR; | |
4c9b3895 JM |
3747 | /* And we don't allow narrowing conversions. We also use this flag to |
3748 | avoid the copy constructor call for copy-list-initialization. */ | |
3749 | flags |= LOOKUP_NO_NARROWING; | |
3750 | ||
6f2f4050 | 3751 | unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1; |
bd84e560 JM |
3752 | tree init_list = (*args)[nart]; |
3753 | ||
4c9b3895 JM |
3754 | /* Always use the default constructor if the list is empty (DR 990). */ |
3755 | if (CONSTRUCTOR_NELTS (init_list) == 0 | |
3756 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)) | |
3757 | ; | |
3758 | /* If the class has a list ctor, try passing the list as a single | |
3759 | argument first, but only consider list ctors. */ | |
3760 | else if (TYPE_HAS_LIST_CTOR (totype)) | |
3761 | { | |
3762 | flags |= LOOKUP_LIST_ONLY; | |
4c9b3895 JM |
3763 | add_candidates (fns, first_arg, args, NULL_TREE, |
3764 | explicit_targs, template_only, conversion_path, | |
b40e334f | 3765 | access_path, flags, candidates, complain); |
4c9b3895 JM |
3766 | if (any_strictly_viable (*candidates)) |
3767 | return; | |
3768 | } | |
3769 | ||
bd84e560 JM |
3770 | /* Expand the CONSTRUCTOR into a new argument vec. */ |
3771 | vec<tree, va_gc> *new_args; | |
3772 | vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list)); | |
3773 | for (unsigned i = 0; i < nart; ++i) | |
3774 | new_args->quick_push ((*args)[i]); | |
3775 | for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i) | |
3776 | new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value); | |
4c9b3895 JM |
3777 | |
3778 | /* We aren't looking for list-ctors anymore. */ | |
3779 | flags &= ~LOOKUP_LIST_ONLY; | |
3780 | /* We allow more user-defined conversions within an init-list. */ | |
3781 | flags &= ~LOOKUP_NO_CONVERSION; | |
4c9b3895 | 3782 | |
bd84e560 | 3783 | add_candidates (fns, first_arg, new_args, NULL_TREE, |
4c9b3895 | 3784 | explicit_targs, template_only, conversion_path, |
b40e334f | 3785 | access_path, flags, candidates, complain); |
4c9b3895 JM |
3786 | } |
3787 | ||
c73964b2 | 3788 | /* Returns the best overload candidate to perform the requested |
eb66be0e MS |
3789 | conversion. This function is used for three the overloading situations |
3790 | described in [over.match.copy], [over.match.conv], and [over.match.ref]. | |
62a405dd | 3791 | If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as |
eb66be0e | 3792 | per [dcl.init.ref], so we ignore temporary bindings. */ |
c73964b2 MS |
3793 | |
3794 | static struct z_candidate * | |
b40e334f PC |
3795 | build_user_type_conversion_1 (tree totype, tree expr, int flags, |
3796 | tsubst_flags_t complain) | |
c73964b2 MS |
3797 | { |
3798 | struct z_candidate *candidates, *cand; | |
c2985fe5 | 3799 | tree fromtype; |
5bd61841 MM |
3800 | tree ctors = NULL_TREE; |
3801 | tree conv_fns = NULL_TREE; | |
3802 | conversion *conv = NULL; | |
c166b898 | 3803 | tree first_arg = NULL_TREE; |
9771b263 | 3804 | vec<tree, va_gc> *args = NULL; |
436f8a4c | 3805 | bool any_viable_p; |
6f4fd536 | 3806 | int convflags; |
c73964b2 | 3807 | |
c2985fe5 PC |
3808 | if (!expr) |
3809 | return NULL; | |
3810 | ||
3811 | fromtype = TREE_TYPE (expr); | |
3812 | ||
5e818b93 JM |
3813 | /* We represent conversion within a hierarchy using RVALUE_CONV and |
3814 | BASE_CONV, as specified by [over.best.ics]; these become plain | |
3815 | constructor calls, as specified in [dcl.init]. */ | |
9e1e64ec | 3816 | gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype) |
50bc768d | 3817 | || !DERIVED_FROM_P (totype, fromtype)); |
5e818b93 | 3818 | |
e4f0733a | 3819 | if (CLASS_TYPE_P (totype)) |
c9b55889 JM |
3820 | /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid |
3821 | creating a garbage BASELINK; constructors can't be inherited. */ | |
527b7b19 | 3822 | ctors = get_class_binding (totype, complete_ctor_identifier); |
db9b2174 | 3823 | |
9e1e64ec | 3824 | if (MAYBE_CLASS_TYPE_P (fromtype)) |
a9a81e7d SM |
3825 | { |
3826 | tree to_nonref = non_reference (totype); | |
3827 | if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) || | |
3828 | (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype) | |
3829 | && DERIVED_FROM_P (to_nonref, fromtype))) | |
3830 | { | |
3831 | /* [class.conv.fct] A conversion function is never used to | |
3832 | convert a (possibly cv-qualified) object to the (possibly | |
3833 | cv-qualified) same object type (or a reference to it), to a | |
3834 | (possibly cv-qualified) base class of that type (or a | |
3835 | reference to it)... */ | |
3836 | } | |
3837 | else | |
9c7d5cae | 3838 | conv_fns = lookup_conversions (fromtype); |
a9a81e7d | 3839 | } |
c73964b2 MS |
3840 | |
3841 | candidates = 0; | |
3842 | flags |= LOOKUP_NO_CONVERSION; | |
5c824000 JM |
3843 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
3844 | flags |= LOOKUP_NO_NARROWING; | |
c73964b2 | 3845 | |
6f4fd536 JM |
3846 | /* It's OK to bind a temporary for converting constructor arguments, but |
3847 | not in converting the return value of a conversion operator. */ | |
2410819b PC |
3848 | convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION |
3849 | | (flags & LOOKUP_NO_NARROWING)); | |
6f4fd536 JM |
3850 | flags &= ~LOOKUP_NO_TEMP_BIND; |
3851 | ||
c73964b2 MS |
3852 | if (ctors) |
3853 | { | |
5c824000 | 3854 | int ctorflags = flags; |
454fa7a7 | 3855 | |
1dbdb756 | 3856 | first_arg = build_dummy_object (totype); |
c166b898 | 3857 | |
41f5d4b1 NS |
3858 | /* We should never try to call the abstract or base constructor |
3859 | from here. */ | |
a736411a NS |
3860 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors)) |
3861 | && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors))); | |
c73964b2 | 3862 | |
bd84e560 | 3863 | args = make_tree_vector_single (expr); |
4c9b3895 | 3864 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
d451d5b2 | 3865 | { |
4c9b3895 | 3866 | /* List-initialization. */ |
bd84e560 | 3867 | add_list_candidates (ctors, first_arg, args, totype, NULL_TREE, |
4c9b3895 | 3868 | false, TYPE_BINFO (totype), TYPE_BINFO (totype), |
b40e334f | 3869 | ctorflags, &candidates, complain); |
d451d5b2 | 3870 | } |
4c9b3895 | 3871 | else |
d451d5b2 | 3872 | { |
d451d5b2 JM |
3873 | add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false, |
3874 | TYPE_BINFO (totype), TYPE_BINFO (totype), | |
b40e334f | 3875 | ctorflags, &candidates, complain); |
d451d5b2 | 3876 | } |
98c1c668 | 3877 | |
5c824000 | 3878 | for (cand = candidates; cand; cand = cand->next) |
46225e26 JM |
3879 | { |
3880 | cand->second_conv = build_identity_conv (totype, NULL_TREE); | |
3881 | ||
3882 | /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't | |
3883 | set, then this is copy-initialization. In that case, "The | |
3884 | result of the call is then used to direct-initialize the | |
3885 | object that is the destination of the copy-initialization." | |
3886 | [dcl.init] | |
3887 | ||
3888 | We represent this in the conversion sequence with an | |
3889 | rvalue conversion, which means a constructor call. */ | |
9f613f06 | 3890 | if (!TYPE_REF_P (totype) |
46225e26 JM |
3891 | && !(convflags & LOOKUP_NO_TEMP_BIND)) |
3892 | cand->second_conv | |
3893 | = build_conv (ck_rvalue, totype, cand->second_conv); | |
3894 | } | |
c73964b2 MS |
3895 | } |
3896 | ||
5bd61841 | 3897 | if (conv_fns) |
36cbfdb0 JM |
3898 | { |
3899 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) | |
36cbfdb0 JM |
3900 | first_arg = CONSTRUCTOR_ELT (expr, 0)->value; |
3901 | else | |
3902 | first_arg = expr; | |
3903 | } | |
c73964b2 | 3904 | |
5bd61841 | 3905 | for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns)) |
c73964b2 | 3906 | { |
5bd61841 | 3907 | tree conversion_path = TREE_PURPOSE (conv_fns); |
5c824000 | 3908 | struct z_candidate *old_candidates; |
eb66be0e MS |
3909 | |
3910 | /* If we are called to convert to a reference type, we are trying to | |
dbbc379e JM |
3911 | find a direct binding, so don't even consider temporaries. If |
3912 | we don't find a direct binding, the caller will try again to | |
eb66be0e | 3913 | look for a temporary binding. */ |
9f613f06 | 3914 | if (TYPE_REF_P (totype)) |
eb66be0e | 3915 | convflags |= LOOKUP_NO_TEMP_BIND; |
c8094d83 | 3916 | |
5c824000 JM |
3917 | old_candidates = candidates; |
3918 | add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype, | |
3919 | NULL_TREE, false, | |
3920 | conversion_path, TYPE_BINFO (fromtype), | |
b40e334f | 3921 | flags, &candidates, complain); |
5c824000 JM |
3922 | |
3923 | for (cand = candidates; cand != old_candidates; cand = cand->next) | |
5dd236e2 | 3924 | { |
b028af11 | 3925 | tree rettype = TREE_TYPE (TREE_TYPE (cand->fn)); |
5c824000 JM |
3926 | conversion *ics |
3927 | = implicit_conversion (totype, | |
b028af11 | 3928 | rettype, |
5c824000 | 3929 | 0, |
b40e334f PC |
3930 | /*c_cast_p=*/false, convflags, |
3931 | complain); | |
5dd236e2 | 3932 | |
5c824000 JM |
3933 | /* If LOOKUP_NO_TEMP_BIND isn't set, then this is |
3934 | copy-initialization. In that case, "The result of the | |
3935 | call is then used to direct-initialize the object that is | |
3936 | the destination of the copy-initialization." [dcl.init] | |
3937 | ||
3938 | We represent this in the conversion sequence with an | |
3939 | rvalue conversion, which means a constructor call. But | |
3940 | don't add a second rvalue conversion if there's already | |
3941 | one there. Which there really shouldn't be, but it's | |
3942 | harmless since we'd add it here anyway. */ | |
3943 | if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue | |
3944 | && !(convflags & LOOKUP_NO_TEMP_BIND)) | |
3945 | ics = build_conv (ck_rvalue, totype, ics); | |
3946 | ||
3947 | cand->second_conv = ics; | |
3948 | ||
3949 | if (!ics) | |
feb6efc1 | 3950 | { |
feb6efc1 | 3951 | cand->viable = 0; |
241172a5 | 3952 | cand->reason = arg_conversion_rejection (NULL_TREE, -2, |
4911b24d DM |
3953 | rettype, totype, |
3954 | EXPR_LOCATION (expr)); | |
feb6efc1 | 3955 | } |
b028af11 JM |
3956 | else if (DECL_NONCONVERTING_P (cand->fn) |
3957 | && ics->rank > cr_exact) | |
3958 | { | |
3959 | /* 13.3.1.5: For direct-initialization, those explicit | |
3960 | conversion functions that are not hidden within S and | |
3961 | yield type T or a type that can be converted to type T | |
3962 | with a qualification conversion (4.4) are also candidate | |
3963 | functions. */ | |
62a405dd JM |
3964 | /* 13.3.1.6 doesn't have a parallel restriction, but it should; |
3965 | I've raised this issue with the committee. --jason 9/2011 */ | |
b028af11 JM |
3966 | cand->viable = -1; |
3967 | cand->reason = explicit_conversion_rejection (rettype, totype); | |
3968 | } | |
5c824000 | 3969 | else if (cand->viable == 1 && ics->bad_p) |
feb6efc1 | 3970 | { |
feb6efc1 NF |
3971 | cand->viable = -1; |
3972 | cand->reason | |
241172a5 | 3973 | = bad_arg_conversion_rejection (NULL_TREE, -2, |
4911b24d DM |
3974 | rettype, totype, |
3975 | EXPR_LOCATION (expr)); | |
feb6efc1 | 3976 | } |
528c7559 | 3977 | else if (primary_template_specialization_p (cand->fn) |
c8580138 JM |
3978 | && ics->rank > cr_exact) |
3979 | { | |
3980 | /* 13.3.3.1.2: If the user-defined conversion is specified by | |
3981 | a specialization of a conversion function template, the | |
3982 | second standard conversion sequence shall have exact match | |
3983 | rank. */ | |
3984 | cand->viable = -1; | |
3985 | cand->reason = template_conversion_rejection (rettype, totype); | |
3986 | } | |
5dd236e2 | 3987 | } |
c73964b2 MS |
3988 | } |
3989 | ||
89606913 | 3990 | candidates = splice_viable (candidates, false, &any_viable_p); |
436f8a4c | 3991 | if (!any_viable_p) |
c9b55889 JM |
3992 | { |
3993 | if (args) | |
3994 | release_tree_vector (args); | |
3995 | return NULL; | |
3996 | } | |
c73964b2 | 3997 | |
b40e334f | 3998 | cand = tourney (candidates, complain); |
62c21cee | 3999 | if (cand == NULL) |
c73964b2 | 4000 | { |
4b978f96 | 4001 | if (complain & tf_error) |
c73964b2 | 4002 | { |
097f82ec | 4003 | auto_diagnostic_group d; |
f012c8ef | 4004 | error ("conversion from %qH to %qI is ambiguous", |
b40e334f | 4005 | fromtype, totype); |
feb6efc1 | 4006 | print_z_candidates (location_of (expr), candidates); |
c73964b2 MS |
4007 | } |
4008 | ||
4009 | cand = candidates; /* any one will do */ | |
5bd61841 MM |
4010 | cand->second_conv = build_ambiguous_conv (totype, expr); |
4011 | cand->second_conv->user_conv_p = true; | |
f576dfc4 | 4012 | if (!any_strictly_viable (candidates)) |
5bd61841 | 4013 | cand->second_conv->bad_p = true; |
929a0122 JM |
4014 | if (flags & LOOKUP_ONLYCONVERTING) |
4015 | cand->second_conv->need_temporary_p = true; | |
f576dfc4 JM |
4016 | /* If there are viable candidates, don't set ICS_BAD_FLAG; an |
4017 | ambiguous conversion is no worse than another user-defined | |
4018 | conversion. */ | |
c73964b2 MS |
4019 | |
4020 | return cand; | |
4021 | } | |
4022 | ||
bfa58951 JM |
4023 | tree convtype; |
4024 | if (!DECL_CONSTRUCTOR_P (cand->fn)) | |
4025 | convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn))); | |
4026 | else if (cand->second_conv->kind == ck_rvalue) | |
4027 | /* DR 5: [in the first step of copy-initialization]...if the function | |
4028 | is a constructor, the call initializes a temporary of the | |
4029 | cv-unqualified version of the destination type. */ | |
4030 | convtype = cv_unqualified (totype); | |
4031 | else | |
4032 | convtype = totype; | |
3d938426 | 4033 | /* Build the user conversion sequence. */ |
5bd61841 MM |
4034 | conv = build_conv |
4035 | (ck_user, | |
bfa58951 | 4036 | convtype, |
5bd61841 MM |
4037 | build_identity_conv (TREE_TYPE (expr), expr)); |
4038 | conv->cand = cand; | |
940023f4 JM |
4039 | if (cand->viable == -1) |
4040 | conv->bad_p = true; | |
3d938426 | 4041 | |
62c21cee | 4042 | /* We're performing the maybe-rvalue overload resolution and |
17b20aa9 MP |
4043 | a conversion function is in play. Reject converting the return |
4044 | value of the conversion function to a base class. */ | |
62c21cee | 4045 | if ((flags & LOOKUP_PREFER_RVALUE) && !DECL_CONSTRUCTOR_P (cand->fn)) |
17b20aa9 MP |
4046 | for (conversion *t = cand->second_conv; t; t = next_conversion (t)) |
4047 | if (t->kind == ck_base) | |
4048 | return NULL; | |
62c21cee | 4049 | |
3f6079dd JM |
4050 | /* Remember that this was a list-initialization. */ |
4051 | if (flags & LOOKUP_NO_NARROWING) | |
4052 | conv->check_narrowing = true; | |
4053 | ||
3d938426 | 4054 | /* Combine it with the second conversion sequence. */ |
5bd61841 | 4055 | cand->second_conv = merge_conversion_sequences (conv, |
3d938426 MM |
4056 | cand->second_conv); |
4057 | ||
c73964b2 MS |
4058 | return cand; |
4059 | } | |
4060 | ||
575bfb00 LC |
4061 | /* Wrapper for above. */ |
4062 | ||
c73964b2 | 4063 | tree |
b40e334f PC |
4064 | build_user_type_conversion (tree totype, tree expr, int flags, |
4065 | tsubst_flags_t complain) | |
c73964b2 | 4066 | { |
575bfb00 LC |
4067 | struct z_candidate *cand; |
4068 | tree ret; | |
4069 | ||
4877e471 | 4070 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
b40e334f | 4071 | cand = build_user_type_conversion_1 (totype, expr, flags, complain); |
c73964b2 MS |
4072 | |
4073 | if (cand) | |
4074 | { | |
5bd61841 | 4075 | if (cand->second_conv->kind == ck_ambig) |
575bfb00 LC |
4076 | ret = error_mark_node; |
4077 | else | |
4078 | { | |
b40e334f | 4079 | expr = convert_like (cand->second_conv, expr, complain); |
575bfb00 LC |
4080 | ret = convert_from_reference (expr); |
4081 | } | |
c73964b2 | 4082 | } |
575bfb00 LC |
4083 | else |
4084 | ret = NULL_TREE; | |
4085 | ||
4877e471 | 4086 | timevar_cond_stop (TV_OVERLOAD, subtime); |
575bfb00 | 4087 | return ret; |
c73964b2 MS |
4088 | } |
4089 | ||
61f8d165 JM |
4090 | /* Subroutine of convert_nontype_argument. |
4091 | ||
e6d7d618 JM |
4092 | EXPR is an expression used in a context that requires a converted |
4093 | constant-expression, such as a template non-type parameter. Do any | |
4094 | necessary conversions (that are permitted for converted | |
4095 | constant-expressions) to convert it to the desired type. | |
61f8d165 JM |
4096 | |
4097 | If conversion is successful, returns the converted expression; | |
4098 | otherwise, returns error_mark_node. */ | |
4099 | ||
4100 | tree | |
e6d7d618 | 4101 | build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain) |
61f8d165 JM |
4102 | { |
4103 | conversion *conv; | |
4104 | void *p; | |
4105 | tree t; | |
6bdfada4 | 4106 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
61f8d165 JM |
4107 | |
4108 | if (error_operand_p (expr)) | |
4109 | return error_mark_node; | |
4110 | ||
61f8d165 JM |
4111 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4112 | p = conversion_obstack_alloc (0); | |
4113 | ||
4114 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, | |
4115 | /*c_cast_p=*/false, | |
b40e334f | 4116 | LOOKUP_IMPLICIT, complain); |
61f8d165 | 4117 | |
e6d7d618 JM |
4118 | /* A converted constant expression of type T is an expression, implicitly |
4119 | converted to type T, where the converted expression is a constant | |
4120 | expression and the implicit conversion sequence contains only | |
4121 | ||
4122 | * user-defined conversions, | |
4123 | * lvalue-to-rvalue conversions (7.1), | |
4124 | * array-to-pointer conversions (7.2), | |
4125 | * function-to-pointer conversions (7.3), | |
4126 | * qualification conversions (7.5), | |
4127 | * integral promotions (7.6), | |
4128 | * integral conversions (7.8) other than narrowing conversions (11.6.4), | |
4129 | * null pointer conversions (7.11) from std::nullptr_t, | |
4130 | * null member pointer conversions (7.12) from std::nullptr_t, and | |
4131 | * function pointer conversions (7.13), | |
4132 | ||
4133 | and where the reference binding (if any) binds directly. */ | |
4134 | ||
4135 | for (conversion *c = conv; | |
4136 | conv && c->kind != ck_identity; | |
4137 | c = next_conversion (c)) | |
4138 | { | |
4139 | switch (c->kind) | |
4140 | { | |
4141 | /* A conversion function is OK. If it isn't constexpr, we'll | |
4142 | complain later that the argument isn't constant. */ | |
4143 | case ck_user: | |
4144 | /* The lvalue-to-rvalue conversion is OK. */ | |
4145 | case ck_rvalue: | |
4146 | /* Array-to-pointer and function-to-pointer. */ | |
4147 | case ck_lvalue: | |
4148 | /* Function pointer conversions. */ | |
4149 | case ck_fnptr: | |
4150 | /* Qualification conversions. */ | |
4151 | case ck_qual: | |
4152 | break; | |
61f8d165 | 4153 | |
e6d7d618 JM |
4154 | case ck_ref_bind: |
4155 | if (c->need_temporary_p) | |
4156 | { | |
4157 | if (complain & tf_error) | |
4158 | error_at (loc, "initializing %qH with %qI in converted " | |
4159 | "constant expression does not bind directly", | |
4160 | type, next_conversion (c)->type); | |
4161 | conv = NULL; | |
4162 | } | |
61f8d165 JM |
4163 | break; |
4164 | ||
e6d7d618 JM |
4165 | case ck_base: |
4166 | case ck_pmem: | |
4167 | case ck_ptr: | |
4168 | case ck_std: | |
4169 | t = next_conversion (c)->type; | |
4170 | if (INTEGRAL_OR_ENUMERATION_TYPE_P (t) | |
4171 | && INTEGRAL_OR_ENUMERATION_TYPE_P (type)) | |
4172 | /* Integral promotion or conversion. */ | |
4173 | break; | |
4174 | if (NULLPTR_TYPE_P (t)) | |
4175 | /* Conversion from nullptr to pointer or pointer-to-member. */ | |
4176 | break; | |
4177 | ||
4178 | if (complain & tf_error) | |
4179 | error_at (loc, "conversion from %qH to %qI in a " | |
4180 | "converted constant expression", t, type); | |
4181 | /* fall through. */ | |
61f8d165 | 4182 | |
e6d7d618 JM |
4183 | default: |
4184 | conv = NULL; | |
4185 | break; | |
4186 | } | |
4187 | } | |
4188 | ||
4189 | /* Avoid confusing convert_nontype_argument by introducing | |
4190 | a redundant conversion to the same reference type. */ | |
4191 | if (conv && conv->kind == ck_ref_bind | |
4192 | && REFERENCE_REF_P (expr)) | |
4193 | { | |
4194 | tree ref = TREE_OPERAND (expr, 0); | |
4195 | if (same_type_p (type, TREE_TYPE (ref))) | |
4196 | return ref; | |
4197 | } | |
61f8d165 JM |
4198 | |
4199 | if (conv) | |
ed4f2c00 MP |
4200 | { |
4201 | conv->check_narrowing = true; | |
4202 | conv->check_narrowing_const_only = true; | |
4203 | expr = convert_like (conv, expr, complain); | |
4204 | } | |
61f8d165 | 4205 | else |
ed4f2c00 MP |
4206 | { |
4207 | if (complain & tf_error) | |
4208 | error_at (loc, "could not convert %qE from %qH to %qI", expr, | |
4209 | TREE_TYPE (expr), type); | |
4210 | expr = error_mark_node; | |
4211 | } | |
61f8d165 JM |
4212 | |
4213 | /* Free all the conversions we allocated. */ | |
4214 | obstack_free (&conversion_obstack, p); | |
4215 | ||
4216 | return expr; | |
4217 | } | |
4218 | ||
86e6f22f JM |
4219 | /* Do any initial processing on the arguments to a function call. */ |
4220 | ||
9771b263 DN |
4221 | static vec<tree, va_gc> * |
4222 | resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain) | |
86e6f22f | 4223 | { |
c166b898 ILT |
4224 | unsigned int ix; |
4225 | tree arg; | |
c8094d83 | 4226 | |
9771b263 | 4227 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
c166b898 | 4228 | { |
88217f44 | 4229 | if (error_operand_p (arg)) |
c166b898 | 4230 | return NULL; |
648c2206 | 4231 | else if (VOID_TYPE_P (TREE_TYPE (arg))) |
86e6f22f | 4232 | { |
b46c79a1 JM |
4233 | if (complain & tf_error) |
4234 | error ("invalid use of void expression"); | |
c166b898 | 4235 | return NULL; |
86e6f22f | 4236 | } |
d72a3672 | 4237 | else if (invalid_nonstatic_memfn_p (arg->exp.locus, arg, complain)) |
c166b898 | 4238 | return NULL; |
86e6f22f JM |
4239 | } |
4240 | return args; | |
4241 | } | |
4ba126e4 | 4242 | |
125e6594 MM |
4243 | /* Perform overload resolution on FN, which is called with the ARGS. |
4244 | ||
4245 | Return the candidate function selected by overload resolution, or | |
4246 | NULL if the event that overload resolution failed. In the case | |
4247 | that overload resolution fails, *CANDIDATES will be the set of | |
4248 | candidates considered, and ANY_VIABLE_P will be set to true or | |
4249 | false to indicate whether or not any of the candidates were | |
c8094d83 | 4250 | viable. |
125e6594 MM |
4251 | |
4252 | The ARGS should already have gone through RESOLVE_ARGS before this | |
4253 | function is called. */ | |
4254 | ||
4255 | static struct z_candidate * | |
c8094d83 | 4256 | perform_overload_resolution (tree fn, |
9771b263 | 4257 | const vec<tree, va_gc> *args, |
125e6594 | 4258 | struct z_candidate **candidates, |
b40e334f | 4259 | bool *any_viable_p, tsubst_flags_t complain) |
c73964b2 | 4260 | { |
125e6594 | 4261 | struct z_candidate *cand; |
575bfb00 LC |
4262 | tree explicit_targs; |
4263 | int template_only; | |
4264 | ||
4265 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
4266 | ||
4267 | explicit_targs = NULL_TREE; | |
4268 | template_only = 0; | |
386b8a85 | 4269 | |
125e6594 MM |
4270 | *candidates = NULL; |
4271 | *any_viable_p = true; | |
4272 | ||
c166b898 | 4273 | /* Check FN. */ |
c8094d83 | 4274 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL |
50bc768d NS |
4275 | || TREE_CODE (fn) == TEMPLATE_DECL |
4276 | || TREE_CODE (fn) == OVERLOAD | |
4277 | || TREE_CODE (fn) == TEMPLATE_ID_EXPR); | |
4ba126e4 | 4278 | |
386b8a85 JM |
4279 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) |
4280 | { | |
4281 | explicit_targs = TREE_OPERAND (fn, 1); | |
4282 | fn = TREE_OPERAND (fn, 0); | |
c32381b1 | 4283 | template_only = 1; |
386b8a85 JM |
4284 | } |
4285 | ||
125e6594 | 4286 | /* Add the various candidate functions. */ |
5c824000 JM |
4287 | add_candidates (fn, NULL_TREE, args, NULL_TREE, |
4288 | explicit_targs, template_only, | |
125e6594 MM |
4289 | /*conversion_path=*/NULL_TREE, |
4290 | /*access_path=*/NULL_TREE, | |
4291 | LOOKUP_NORMAL, | |
b40e334f | 4292 | candidates, complain); |
125e6594 | 4293 | |
89606913 | 4294 | *candidates = splice_viable (*candidates, false, any_viable_p); |
575bfb00 | 4295 | if (*any_viable_p) |
b40e334f | 4296 | cand = tourney (*candidates, complain); |
575bfb00 LC |
4297 | else |
4298 | cand = NULL; | |
c73964b2 | 4299 | |
575bfb00 | 4300 | timevar_cond_stop (TV_OVERLOAD, subtime); |
125e6594 MM |
4301 | return cand; |
4302 | } | |
86e6f22f | 4303 | |
feb6efc1 NF |
4304 | /* Print an error message about being unable to build a call to FN with |
4305 | ARGS. ANY_VIABLE_P indicates whether any candidate functions could | |
4306 | be located; CANDIDATES is a possibly empty list of such | |
4307 | functions. */ | |
4308 | ||
4309 | static void | |
c29f393f | 4310 | print_error_for_call_failure (tree fn, vec<tree, va_gc> *args, |
feb6efc1 NF |
4311 | struct z_candidate *candidates) |
4312 | { | |
e7555e42 JM |
4313 | tree targs = NULL_TREE; |
4314 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
4315 | { | |
4316 | targs = TREE_OPERAND (fn, 1); | |
4317 | fn = TREE_OPERAND (fn, 0); | |
4318 | } | |
a736411a | 4319 | tree name = OVL_NAME (fn); |
feb6efc1 | 4320 | location_t loc = location_of (name); |
e7555e42 JM |
4321 | if (targs) |
4322 | name = lookup_template_function (name, targs); | |
feb6efc1 | 4323 | |
097f82ec | 4324 | auto_diagnostic_group d; |
c29f393f | 4325 | if (!any_strictly_viable (candidates)) |
feb6efc1 NF |
4326 | error_at (loc, "no matching function for call to %<%D(%A)%>", |
4327 | name, build_tree_list_vec (args)); | |
4328 | else | |
4329 | error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous", | |
4330 | name, build_tree_list_vec (args)); | |
4331 | if (candidates) | |
4332 | print_z_candidates (loc, candidates); | |
4333 | } | |
4334 | ||
125e6594 | 4335 | /* Return an expression for a call to FN (a namespace-scope function, |
c166b898 ILT |
4336 | or a static member function) with the ARGS. This may change |
4337 | ARGS. */ | |
c8094d83 | 4338 | |
125e6594 | 4339 | tree |
268de039 | 4340 | build_new_function_call (tree fn, vec<tree, va_gc> **args, |
5ade1ed2 | 4341 | tsubst_flags_t complain) |
125e6594 MM |
4342 | { |
4343 | struct z_candidate *candidates, *cand; | |
4344 | bool any_viable_p; | |
5bd61841 MM |
4345 | void *p; |
4346 | tree result; | |
8f032717 | 4347 | |
c166b898 ILT |
4348 | if (args != NULL && *args != NULL) |
4349 | { | |
b46c79a1 | 4350 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4351 | if (*args == NULL) |
4352 | return error_mark_node; | |
4353 | } | |
a723baf1 | 4354 | |
0a35513e AH |
4355 | if (flag_tm) |
4356 | tm_malloc_replacement (fn); | |
4357 | ||
5bd61841 MM |
4358 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4359 | p = conversion_obstack_alloc (0); | |
4360 | ||
b40e334f PC |
4361 | cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p, |
4362 | complain); | |
c73964b2 | 4363 | |
125e6594 MM |
4364 | if (!cand) |
4365 | { | |
5ade1ed2 DG |
4366 | if (complain & tf_error) |
4367 | { | |
971e17ff AS |
4368 | // If there is a single (non-viable) function candidate, |
4369 | // let the error be diagnosed by cp_build_function_call_vec. | |
3784b33c JM |
4370 | if (!any_viable_p && candidates && ! candidates->next |
4371 | && (TREE_CODE (candidates->fn) == FUNCTION_DECL)) | |
c166b898 | 4372 | return cp_build_function_call_vec (candidates->fn, args, complain); |
971e17ff AS |
4373 | |
4374 | // Otherwise, emit notes for non-viable candidates. | |
c29f393f | 4375 | print_error_for_call_failure (fn, *args, candidates); |
5ade1ed2 | 4376 | } |
5bd61841 | 4377 | result = error_mark_node; |
125e6594 | 4378 | } |
5bd61841 | 4379 | else |
2e1df0f0 DN |
4380 | { |
4381 | int flags = LOOKUP_NORMAL; | |
4382 | /* If fn is template_id_expr, the call has explicit template arguments | |
4383 | (e.g. func<int>(5)), communicate this info to build_over_call | |
4384 | through flags so that later we can use it to decide whether to warn | |
4385 | about peculiar null pointer conversion. */ | |
4386 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
971e17ff AS |
4387 | { |
4388 | /* If overload resolution selects a specialization of a | |
4389 | function concept for non-dependent template arguments, | |
4390 | the expression is true if the constraints are satisfied | |
4391 | and false otherwise. | |
4392 | ||
4393 | NOTE: This is an extension of Concepts Lite TS that | |
4394 | allows constraints to be used in expressions. */ | |
4395 | if (flag_concepts && !processing_template_decl) | |
4396 | { | |
4397 | tree tmpl = DECL_TI_TEMPLATE (cand->fn); | |
4398 | tree targs = DECL_TI_ARGS (cand->fn); | |
4399 | tree decl = DECL_TEMPLATE_RESULT (tmpl); | |
4400 | if (DECL_DECLARED_CONCEPT_P (decl)) | |
4401 | return evaluate_function_concept (decl, targs); | |
4402 | } | |
4403 | ||
4404 | flags |= LOOKUP_EXPLICIT_TMPL_ARGS; | |
4405 | } | |
4406 | ||
2e1df0f0 DN |
4407 | result = build_over_call (cand, flags, complain); |
4408 | } | |
c73964b2 | 4409 | |
5bd61841 MM |
4410 | /* Free all the conversions we allocated. */ |
4411 | obstack_free (&conversion_obstack, p); | |
4412 | ||
4413 | return result; | |
125e6594 | 4414 | } |
c73964b2 | 4415 | |
125e6594 MM |
4416 | /* Build a call to a global operator new. FNNAME is the name of the |
4417 | operator (either "operator new" or "operator new[]") and ARGS are | |
c166b898 ILT |
4418 | the arguments provided. This may change ARGS. *SIZE points to the |
4419 | total number of bytes required by the allocation, and is updated if | |
4420 | that is changed here. *COOKIE_SIZE is non-NULL if a cookie should | |
4421 | be used. If this function determines that no cookie should be | |
4a84253c FW |
4422 | used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK |
4423 | is not NULL_TREE, it is evaluated before calculating the final | |
4424 | array size, and if it fails, the array size is replaced with | |
4425 | (size_t)-1 (usually triggering a std::bad_alloc exception). If FN | |
4426 | is non-NULL, it will be set, upon return, to the allocation | |
4427 | function called. */ | |
c73964b2 | 4428 | |
125e6594 | 4429 | tree |
9771b263 | 4430 | build_operator_new_call (tree fnname, vec<tree, va_gc> **args, |
af63ba4b JM |
4431 | tree *size, tree *cookie_size, |
4432 | tree align_arg, tree size_check, | |
b40e334f | 4433 | tree *fn, tsubst_flags_t complain) |
125e6594 | 4434 | { |
4a84253c | 4435 | tree original_size = *size; |
125e6594 MM |
4436 | tree fns; |
4437 | struct z_candidate *candidates; | |
af63ba4b | 4438 | struct z_candidate *cand = NULL; |
125e6594 MM |
4439 | bool any_viable_p; |
4440 | ||
63c9a190 MM |
4441 | if (fn) |
4442 | *fn = NULL_TREE; | |
4a84253c FW |
4443 | /* Set to (size_t)-1 if the size check fails. */ |
4444 | if (size_check != NULL_TREE) | |
7d5e76c8 JM |
4445 | { |
4446 | tree errval = TYPE_MAX_VALUE (sizetype); | |
f391b44b | 4447 | if (cxx_dialect >= cxx11 && flag_exceptions) |
7d5e76c8 JM |
4448 | errval = throw_bad_array_new_length (); |
4449 | *size = fold_build3 (COND_EXPR, sizetype, size_check, | |
4450 | original_size, errval); | |
4451 | } | |
9771b263 | 4452 | vec_safe_insert (*args, 0, *size); |
b40e334f | 4453 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4454 | if (*args == NULL) |
4455 | return error_mark_node; | |
125e6594 | 4456 | |
12cf89fa MM |
4457 | /* Based on: |
4458 | ||
4459 | [expr.new] | |
4460 | ||
4461 | If this lookup fails to find the name, or if the allocated type | |
4462 | is not a class type, the allocation function's name is looked | |
4463 | up in the global scope. | |
4464 | ||
4465 | we disregard block-scope declarations of "operator new". */ | |
e1cad930 NS |
4466 | fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0); |
4467 | fns = lookup_arg_dependent (fnname, fns, *args); | |
2c73f9f5 | 4468 | |
af63ba4b JM |
4469 | if (align_arg) |
4470 | { | |
4471 | vec<tree, va_gc>* align_args | |
4472 | = vec_copy_and_insert (*args, align_arg, 1); | |
4473 | cand = perform_overload_resolution (fns, align_args, &candidates, | |
4474 | &any_viable_p, tf_none); | |
e3704417 JM |
4475 | if (cand) |
4476 | *args = align_args; | |
af63ba4b JM |
4477 | /* If no aligned allocation function matches, try again without the |
4478 | alignment. */ | |
4479 | } | |
4480 | ||
125e6594 | 4481 | /* Figure out what function is being called. */ |
af63ba4b JM |
4482 | if (!cand) |
4483 | cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p, | |
4484 | complain); | |
c8094d83 | 4485 | |
125e6594 MM |
4486 | /* If no suitable function could be found, issue an error message |
4487 | and give up. */ | |
4488 | if (!cand) | |
4489 | { | |
b40e334f | 4490 | if (complain & tf_error) |
c29f393f | 4491 | print_error_for_call_failure (fns, *args, candidates); |
125e6594 MM |
4492 | return error_mark_node; |
4493 | } | |
4494 | ||
4495 | /* If a cookie is required, add some extra space. Whether | |
4496 | or not a cookie is required cannot be determined until | |
4497 | after we know which function was called. */ | |
4498 | if (*cookie_size) | |
4499 | { | |
4500 | bool use_cookie = true; | |
90d84934 JM |
4501 | tree arg_types; |
4502 | ||
4503 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn)); | |
4504 | /* Skip the size_t parameter. */ | |
4505 | arg_types = TREE_CHAIN (arg_types); | |
4506 | /* Check the remaining parameters (if any). */ | |
4507 | if (arg_types | |
4508 | && TREE_CHAIN (arg_types) == void_list_node | |
4509 | && same_type_p (TREE_VALUE (arg_types), | |
4510 | ptr_type_node)) | |
4511 | use_cookie = false; | |
125e6594 MM |
4512 | /* If we need a cookie, adjust the number of bytes allocated. */ |
4513 | if (use_cookie) | |
4514 | { | |
4515 | /* Update the total size. */ | |
4a84253c | 4516 | *size = size_binop (PLUS_EXPR, original_size, *cookie_size); |
685c8340 MS |
4517 | if (size_check) |
4518 | { | |
4519 | /* Set to (size_t)-1 if the size check fails. */ | |
4520 | gcc_assert (size_check != NULL_TREE); | |
4521 | *size = fold_build3 (COND_EXPR, sizetype, size_check, | |
4522 | *size, TYPE_MAX_VALUE (sizetype)); | |
4523 | } | |
125e6594 | 4524 | /* Update the argument list to reflect the adjusted size. */ |
9771b263 | 4525 | (**args)[0] = *size; |
125e6594 MM |
4526 | } |
4527 | else | |
4528 | *cookie_size = NULL_TREE; | |
4529 | } | |
4530 | ||
63c9a190 MM |
4531 | /* Tell our caller which function we decided to call. */ |
4532 | if (fn) | |
4533 | *fn = cand->fn; | |
4534 | ||
125e6594 | 4535 | /* Build the CALL_EXPR. */ |
b40e334f | 4536 | return build_over_call (cand, LOOKUP_NORMAL, complain); |
c73964b2 MS |
4537 | } |
4538 | ||
c166b898 ILT |
4539 | /* Build a new call to operator(). This may change ARGS. */ |
4540 | ||
575bfb00 | 4541 | static tree |
9771b263 | 4542 | build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
c73964b2 MS |
4543 | { |
4544 | struct z_candidate *candidates = 0, *cand; | |
c166b898 | 4545 | tree fns, convs, first_mem_arg = NULL_TREE; |
436f8a4c | 4546 | bool any_viable_p; |
5bd61841 MM |
4547 | tree result = NULL_TREE; |
4548 | void *p; | |
c73964b2 | 4549 | |
84dd815f JM |
4550 | obj = mark_lvalue_use (obj); |
4551 | ||
c166b898 ILT |
4552 | if (error_operand_p (obj)) |
4553 | return error_mark_node; | |
4554 | ||
84dd815f JM |
4555 | tree type = TREE_TYPE (obj); |
4556 | ||
c166b898 ILT |
4557 | obj = prep_operand (obj); |
4558 | ||
297dcfb3 MM |
4559 | if (TYPE_PTRMEMFUNC_P (type)) |
4560 | { | |
5ade1ed2 DG |
4561 | if (complain & tf_error) |
4562 | /* It's no good looking for an overloaded operator() on a | |
4563 | pointer-to-member-function. */ | |
0f2c4a8f MS |
4564 | error ("pointer-to-member function %qE cannot be called without " |
4565 | "an object; consider using %<.*%> or %<->*%>", obj); | |
297dcfb3 MM |
4566 | return error_mark_node; |
4567 | } | |
4568 | ||
687d71b3 DE |
4569 | if (TYPE_BINFO (type)) |
4570 | { | |
137073d3 | 4571 | fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1); |
687d71b3 DE |
4572 | if (fns == error_mark_node) |
4573 | return error_mark_node; | |
4574 | } | |
4575 | else | |
4576 | fns = NULL_TREE; | |
c73964b2 | 4577 | |
c166b898 ILT |
4578 | if (args != NULL && *args != NULL) |
4579 | { | |
b46c79a1 | 4580 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4581 | if (*args == NULL) |
4582 | return error_mark_node; | |
4583 | } | |
86e6f22f | 4584 | |
5bd61841 MM |
4585 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4586 | p = conversion_obstack_alloc (0); | |
4587 | ||
c73964b2 MS |
4588 | if (fns) |
4589 | { | |
a7175123 | 4590 | first_mem_arg = obj; |
c73964b2 | 4591 | |
5c824000 JM |
4592 | add_candidates (BASELINK_FUNCTIONS (fns), |
4593 | first_mem_arg, *args, NULL_TREE, | |
4594 | NULL_TREE, false, | |
4595 | BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns), | |
b40e334f | 4596 | LOOKUP_NORMAL, &candidates, complain); |
c73964b2 MS |
4597 | } |
4598 | ||
9c7d5cae | 4599 | convs = lookup_conversions (type); |
c73964b2 MS |
4600 | |
4601 | for (; convs; convs = TREE_CHAIN (convs)) | |
4602 | { | |
e57d93c6 | 4603 | tree totype = TREE_TYPE (convs); |
c73964b2 | 4604 | |
5950480c PC |
4605 | if (TYPE_PTRFN_P (totype) |
4606 | || TYPE_REFFN_P (totype) | |
9f613f06 | 4607 | || (TYPE_REF_P (totype) |
5950480c | 4608 | && TYPE_PTRFN_P (TREE_TYPE (totype)))) |
a736411a | 4609 | for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter) |
c73964b2 | 4610 | { |
a736411a | 4611 | tree fn = *iter; |
e57d93c6 JM |
4612 | |
4613 | if (DECL_NONCONVERTING_P (fn)) | |
4614 | continue; | |
4615 | ||
c8094d83 MS |
4616 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
4617 | add_template_conv_candidate | |
d4db5060 | 4618 | (&candidates, fn, obj, *args, totype, |
7993382e | 4619 | /*access_path=*/NULL_TREE, |
b40e334f | 4620 | /*conversion_path=*/NULL_TREE, complain); |
786b5245 | 4621 | else |
d4db5060 | 4622 | add_conv_candidate (&candidates, fn, obj, |
c166b898 | 4623 | *args, /*conversion_path=*/NULL_TREE, |
b40e334f | 4624 | /*access_path=*/NULL_TREE, complain); |
c73964b2 MS |
4625 | } |
4626 | } | |
4627 | ||
89606913 JM |
4628 | /* Be strict here because if we choose a bad conversion candidate, the |
4629 | errors we get won't mention the call context. */ | |
4630 | candidates = splice_viable (candidates, true, &any_viable_p); | |
436f8a4c | 4631 | if (!any_viable_p) |
c73964b2 | 4632 | { |
5ade1ed2 DG |
4633 | if (complain & tf_error) |
4634 | { | |
097f82ec | 4635 | auto_diagnostic_group d; |
c166b898 ILT |
4636 | error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj), |
4637 | build_tree_list_vec (*args)); | |
feb6efc1 | 4638 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
5ade1ed2 | 4639 | } |
5bd61841 | 4640 | result = error_mark_node; |
c73964b2 | 4641 | } |
5bd61841 | 4642 | else |
c73964b2 | 4643 | { |
b40e334f | 4644 | cand = tourney (candidates, complain); |
5bd61841 MM |
4645 | if (cand == 0) |
4646 | { | |
5ade1ed2 DG |
4647 | if (complain & tf_error) |
4648 | { | |
097f82ec | 4649 | auto_diagnostic_group d; |
5ade1ed2 | 4650 | error ("call of %<(%T) (%A)%> is ambiguous", |
c166b898 | 4651 | TREE_TYPE (obj), build_tree_list_vec (*args)); |
feb6efc1 | 4652 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
5ade1ed2 | 4653 | } |
5bd61841 MM |
4654 | result = error_mark_node; |
4655 | } | |
5bd61841 | 4656 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL |
137073d3 NS |
4657 | && DECL_OVERLOADED_OPERATOR_P (cand->fn) |
4658 | && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR)) | |
5ade1ed2 | 4659 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
5bd61841 MM |
4660 | else |
4661 | { | |
ff630487 | 4662 | if (TREE_CODE (cand->fn) == FUNCTION_DECL) |
99516432 JJ |
4663 | obj = convert_like_with_context (cand->convs[0], obj, cand->fn, |
4664 | -1, complain); | |
4665 | else | |
ff630487 NS |
4666 | { |
4667 | gcc_checking_assert (TYPE_P (cand->fn)); | |
4668 | obj = convert_like (cand->convs[0], obj, complain); | |
4669 | } | |
db24eb1f | 4670 | obj = convert_from_reference (obj); |
c166b898 | 4671 | result = cp_build_function_call_vec (obj, args, complain); |
5bd61841 | 4672 | } |
c73964b2 MS |
4673 | } |
4674 | ||
5bd61841 MM |
4675 | /* Free all the conversions we allocated. */ |
4676 | obstack_free (&conversion_obstack, p); | |
c73964b2 | 4677 | |
5bd61841 | 4678 | return result; |
c73964b2 MS |
4679 | } |
4680 | ||
575bfb00 LC |
4681 | /* Wrapper for above. */ |
4682 | ||
4683 | tree | |
9771b263 | 4684 | build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
575bfb00 LC |
4685 | { |
4686 | tree ret; | |
4877e471 | 4687 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
575bfb00 | 4688 | ret = build_op_call_1 (obj, args, complain); |
4877e471 | 4689 | timevar_cond_stop (TV_OVERLOAD, subtime); |
575bfb00 LC |
4690 | return ret; |
4691 | } | |
4692 | ||
051b40ff PC |
4693 | /* Called by op_error to prepare format strings suitable for the error |
4694 | function. It concatenates a prefix (controlled by MATCH), ERRMSG, | |
4695 | and a suffix (controlled by NTYPES). */ | |
4696 | ||
4697 | static const char * | |
4698 | op_error_string (const char *errmsg, int ntypes, bool match) | |
4699 | { | |
4700 | const char *msg; | |
4701 | ||
4702 | const char *msgp = concat (match ? G_("ambiguous overload for ") | |
4703 | : G_("no match for "), errmsg, NULL); | |
4704 | ||
4705 | if (ntypes == 3) | |
4706 | msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL); | |
4707 | else if (ntypes == 2) | |
4708 | msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL); | |
4709 | else | |
4710 | msg = concat (msgp, G_(" (operand type is %qT)"), NULL); | |
4711 | ||
4712 | return msg; | |
4713 | } | |
4714 | ||
c73964b2 | 4715 | static void |
a14feb3c DM |
4716 | op_error (const op_location_t &loc, |
4717 | enum tree_code code, enum tree_code code2, | |
4cd5a50a | 4718 | tree arg1, tree arg2, tree arg3, bool match) |
c73964b2 | 4719 | { |
88a819be NS |
4720 | bool assop = code == MODIFY_EXPR; |
4721 | const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name; | |
c73964b2 MS |
4722 | |
4723 | switch (code) | |
4724 | { | |
4725 | case COND_EXPR: | |
051b40ff | 4726 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4727 | error_at (loc, op_error_string (G_("ternary %<operator?:%>"), |
4728 | 3, match), | |
4729 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
4cd5a50a | 4730 | else |
4fe977f2 PC |
4731 | error_at (loc, op_error_string (G_("ternary %<operator?:%> " |
4732 | "in %<%E ? %E : %E%>"), 3, match), | |
4733 | arg1, arg2, arg3, | |
4734 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
c73964b2 | 4735 | break; |
c8094d83 | 4736 | |
c73964b2 MS |
4737 | case POSTINCREMENT_EXPR: |
4738 | case POSTDECREMENT_EXPR: | |
051b40ff | 4739 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4740 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4741 | opname, TREE_TYPE (arg1)); | |
4cd5a50a | 4742 | else |
4fe977f2 PC |
4743 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"), |
4744 | 1, match), | |
4745 | opname, arg1, opname, TREE_TYPE (arg1)); | |
c73964b2 | 4746 | break; |
c8094d83 | 4747 | |
c73964b2 | 4748 | case ARRAY_REF: |
051b40ff | 4749 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4750 | error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match), |
4751 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
4cd5a50a | 4752 | else |
4fe977f2 PC |
4753 | error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"), |
4754 | 2, match), | |
4755 | arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
c73964b2 | 4756 | break; |
19948e32 GDR |
4757 | |
4758 | case REALPART_EXPR: | |
4759 | case IMAGPART_EXPR: | |
051b40ff | 4760 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4761 | error_at (loc, op_error_string (G_("%qs"), 1, match), |
4762 | opname, TREE_TYPE (arg1)); | |
4cd5a50a | 4763 | else |
4fe977f2 PC |
4764 | error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match), |
4765 | opname, opname, arg1, TREE_TYPE (arg1)); | |
19948e32 | 4766 | break; |
c8094d83 | 4767 | |
c73964b2 MS |
4768 | default: |
4769 | if (arg2) | |
051b40ff | 4770 | if (flag_diagnostics_show_caret) |
a14feb3c DM |
4771 | { |
4772 | binary_op_rich_location richloc (loc, arg1, arg2, true); | |
4773 | error_at (&richloc, | |
4774 | op_error_string (G_("%<operator%s%>"), 2, match), | |
4775 | opname, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
4776 | } | |
051b40ff | 4777 | else |
4fe977f2 PC |
4778 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"), |
4779 | 2, match), | |
4780 | opname, arg1, opname, arg2, | |
4781 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
c73964b2 | 4782 | else |
051b40ff | 4783 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4784 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4785 | opname, TREE_TYPE (arg1)); | |
051b40ff | 4786 | else |
4fe977f2 PC |
4787 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"), |
4788 | 1, match), | |
4789 | opname, opname, arg1, TREE_TYPE (arg1)); | |
84cc377e | 4790 | break; |
c73964b2 MS |
4791 | } |
4792 | } | |
4793 | ||
a7a64a77 MM |
4794 | /* Return the implicit conversion sequence that could be used to |
4795 | convert E1 to E2 in [expr.cond]. */ | |
4796 | ||
5bd61841 | 4797 | static conversion * |
b40e334f | 4798 | conditional_conversion (tree e1, tree e2, tsubst_flags_t complain) |
a7a64a77 MM |
4799 | { |
4800 | tree t1 = non_reference (TREE_TYPE (e1)); | |
4801 | tree t2 = non_reference (TREE_TYPE (e2)); | |
5bd61841 | 4802 | conversion *conv; |
9cefd2ca | 4803 | bool good_base; |
a7a64a77 MM |
4804 | |
4805 | /* [expr.cond] | |
4806 | ||
4807 | If E2 is an lvalue: E1 can be converted to match E2 if E1 can be | |
dbbc379e | 4808 | implicitly converted (clause _conv_) to the type "lvalue reference to |
a7a64a77 | 4809 | T2", subject to the constraint that in the conversion the |
e8ee694a JM |
4810 | reference must bind directly (_dcl.init.ref_) to an lvalue. |
4811 | ||
4812 | If E2 is an xvalue: E1 can be converted to match E2 if E1 can be | |
4813 | implicitly converted to the type "rvalue reference to T2", subject to | |
4814 | the constraint that the reference must bind directly. */ | |
c3edc633 | 4815 | if (glvalue_p (e2)) |
a7a64a77 | 4816 | { |
72b3e203 | 4817 | tree rtype = cp_build_reference_type (t2, !lvalue_p (e2)); |
e8ee694a | 4818 | conv = implicit_conversion (rtype, |
a7a64a77 MM |
4819 | t1, |
4820 | e1, | |
34b5375f | 4821 | /*c_cast_p=*/false, |
dbbc379e | 4822 | LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND |
b40e334f PC |
4823 | |LOOKUP_ONLYCONVERTING, |
4824 | complain); | |
e8ee694a | 4825 | if (conv && !conv->bad_p) |
a7a64a77 MM |
4826 | return conv; |
4827 | } | |
4828 | ||
e8ee694a JM |
4829 | /* If E2 is a prvalue or if neither of the conversions above can be done |
4830 | and at least one of the operands has (possibly cv-qualified) class | |
4831 | type: */ | |
4832 | if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2)) | |
4833 | return NULL; | |
4834 | ||
a7a64a77 MM |
4835 | /* [expr.cond] |
4836 | ||
4837 | If E1 and E2 have class type, and the underlying class types are | |
4838 | the same or one is a base class of the other: E1 can be converted | |
4839 | to match E2 if the class of T2 is the same type as, or a base | |
4840 | class of, the class of T1, and the cv-qualification of T2 is the | |
4841 | same cv-qualification as, or a greater cv-qualification than, the | |
4842 | cv-qualification of T1. If the conversion is applied, E1 is | |
4843 | changed to an rvalue of type T2 that still refers to the original | |
26bcf8fc | 4844 | source class object (or the appropriate subobject thereof). */ |
a7a64a77 | 4845 | if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2) |
9cefd2ca | 4846 | && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2))) |
a7a64a77 | 4847 | { |
9cefd2ca | 4848 | if (good_base && at_least_as_qualified_p (t2, t1)) |
a7a64a77 | 4849 | { |
5bd61841 | 4850 | conv = build_identity_conv (t1, e1); |
c8094d83 | 4851 | if (!same_type_p (TYPE_MAIN_VARIANT (t1), |
4f0aa416 | 4852 | TYPE_MAIN_VARIANT (t2))) |
26bcf8fc | 4853 | conv = build_conv (ck_base, t2, conv); |
5f7262e6 | 4854 | else |
5bd61841 | 4855 | conv = build_conv (ck_rvalue, t2, conv); |
a7a64a77 MM |
4856 | return conv; |
4857 | } | |
4858 | else | |
5bd61841 | 4859 | return NULL; |
a7a64a77 | 4860 | } |
9cefd2ca JM |
4861 | else |
4862 | /* [expr.cond] | |
a7a64a77 | 4863 | |
9cefd2ca JM |
4864 | Otherwise: E1 can be converted to match E2 if E1 can be implicitly |
4865 | converted to the type that expression E2 would have if E2 were | |
4866 | converted to an rvalue (or the type it has, if E2 is an rvalue). */ | |
34b5375f | 4867 | return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false, |
b40e334f | 4868 | LOOKUP_IMPLICIT, complain); |
a7a64a77 MM |
4869 | } |
4870 | ||
4871 | /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three | |
4ba126e4 | 4872 | arguments to the conditional expression. */ |
a7a64a77 | 4873 | |
575bfb00 | 4874 | static tree |
a14feb3c DM |
4875 | build_conditional_expr_1 (const op_location_t &loc, |
4876 | tree arg1, tree arg2, tree arg3, | |
575bfb00 | 4877 | tsubst_flags_t complain) |
a7a64a77 MM |
4878 | { |
4879 | tree arg2_type; | |
4880 | tree arg3_type; | |
5bd61841 | 4881 | tree result = NULL_TREE; |
a7a64a77 | 4882 | tree result_type = NULL_TREE; |
23d63b45 | 4883 | bool is_glvalue = true; |
a7a64a77 MM |
4884 | struct z_candidate *candidates = 0; |
4885 | struct z_candidate *cand; | |
5bd61841 | 4886 | void *p; |
8d0d1915 | 4887 | tree orig_arg2, orig_arg3; |
a7a64a77 MM |
4888 | |
4889 | /* As a G++ extension, the second argument to the conditional can be | |
4890 | omitted. (So that `a ? : c' is roughly equivalent to `a ? a : | |
09dd27d4 MM |
4891 | c'.) If the second operand is omitted, make sure it is |
4892 | calculated only once. */ | |
a7a64a77 MM |
4893 | if (!arg2) |
4894 | { | |
fcf73884 | 4895 | if (complain & tf_error) |
54dcdb88 | 4896 | pedwarn (loc, OPT_Wpedantic, |
fcf73884 | 4897 | "ISO C++ forbids omitting the middle term of a ?: expression"); |
4e8dca1c | 4898 | |
54dcdb88 BE |
4899 | if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1))) |
4900 | warn_for_omitted_condop (loc, arg1); | |
4901 | ||
4e8dca1c | 4902 | /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */ |
72b3e203 | 4903 | if (lvalue_p (arg1)) |
5a0802ea | 4904 | arg2 = arg1 = cp_stabilize_reference (arg1); |
4e8dca1c | 4905 | else |
3a9ad4c1 | 4906 | arg2 = arg1 = cp_save_expr (arg1); |
a7a64a77 MM |
4907 | } |
4908 | ||
93100c6b MG |
4909 | /* If something has already gone wrong, just pass that fact up the |
4910 | tree. */ | |
4911 | if (error_operand_p (arg1) | |
4912 | || error_operand_p (arg2) | |
4913 | || error_operand_p (arg3)) | |
4914 | return error_mark_node; | |
4915 | ||
4916 | orig_arg2 = arg2; | |
4917 | orig_arg3 = arg3; | |
4918 | ||
4919 | if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1))) | |
4920 | { | |
6cedf922 IE |
4921 | tree arg1_type = TREE_TYPE (arg1); |
4922 | ||
9f47c7e5 IE |
4923 | /* If arg1 is another cond_expr choosing between -1 and 0, |
4924 | then we can use its comparison. It may help to avoid | |
4925 | additional comparison, produce more accurate diagnostics | |
4926 | and enables folding. */ | |
4927 | if (TREE_CODE (arg1) == VEC_COND_EXPR | |
4928 | && integer_minus_onep (TREE_OPERAND (arg1, 1)) | |
4929 | && integer_zerop (TREE_OPERAND (arg1, 2))) | |
4930 | arg1 = TREE_OPERAND (arg1, 0); | |
4931 | ||
93100c6b MG |
4932 | arg1 = force_rvalue (arg1, complain); |
4933 | arg2 = force_rvalue (arg2, complain); | |
4934 | arg3 = force_rvalue (arg3, complain); | |
4935 | ||
25c541b4 MG |
4936 | /* force_rvalue can return error_mark on valid arguments. */ |
4937 | if (error_operand_p (arg1) | |
4938 | || error_operand_p (arg2) | |
4939 | || error_operand_p (arg3)) | |
4940 | return error_mark_node; | |
4941 | ||
93100c6b MG |
4942 | arg2_type = TREE_TYPE (arg2); |
4943 | arg3_type = TREE_TYPE (arg3); | |
4944 | ||
b55b02ea MP |
4945 | if (!VECTOR_TYPE_P (arg2_type) |
4946 | && !VECTOR_TYPE_P (arg3_type)) | |
93100c6b | 4947 | { |
07298ffd MG |
4948 | /* Rely on the error messages of the scalar version. */ |
4949 | tree scal = build_conditional_expr_1 (loc, integer_one_node, | |
4950 | orig_arg2, orig_arg3, complain); | |
4951 | if (scal == error_mark_node) | |
4952 | return error_mark_node; | |
4953 | tree stype = TREE_TYPE (scal); | |
4954 | tree ctype = TREE_TYPE (arg1_type); | |
4955 | if (TYPE_SIZE (stype) != TYPE_SIZE (ctype) | |
4956 | || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype))) | |
4957 | { | |
4958 | if (complain & tf_error) | |
4959 | error_at (loc, "inferred scalar type %qT is not an integer or " | |
4960 | "floating point type of the same size as %qT", stype, | |
4961 | COMPARISON_CLASS_P (arg1) | |
4962 | ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0))) | |
4963 | : ctype); | |
4964 | return error_mark_node; | |
4965 | } | |
4966 | ||
4967 | tree vtype = build_opaque_vector_type (stype, | |
4968 | TYPE_VECTOR_SUBPARTS (arg1_type)); | |
4969 | /* We could pass complain & tf_warning to unsafe_conversion_p, | |
4970 | but the warnings (like Wsign-conversion) have already been | |
4971 | given by the scalar build_conditional_expr_1. We still check | |
4972 | unsafe_conversion_p to forbid truncating long long -> float. */ | |
3cd211af | 4973 | if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false)) |
07298ffd MG |
4974 | { |
4975 | if (complain & tf_error) | |
f012c8ef | 4976 | error_at (loc, "conversion of scalar %qH to vector %qI " |
07298ffd MG |
4977 | "involves truncation", arg2_type, vtype); |
4978 | return error_mark_node; | |
4979 | } | |
3cd211af | 4980 | if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false)) |
07298ffd MG |
4981 | { |
4982 | if (complain & tf_error) | |
f012c8ef | 4983 | error_at (loc, "conversion of scalar %qH to vector %qI " |
07298ffd MG |
4984 | "involves truncation", arg3_type, vtype); |
4985 | return error_mark_node; | |
4986 | } | |
4987 | ||
4988 | arg2 = cp_convert (stype, arg2, complain); | |
4989 | arg2 = save_expr (arg2); | |
4990 | arg2 = build_vector_from_val (vtype, arg2); | |
4991 | arg2_type = vtype; | |
4992 | arg3 = cp_convert (stype, arg3, complain); | |
4993 | arg3 = save_expr (arg3); | |
4994 | arg3 = build_vector_from_val (vtype, arg3); | |
4995 | arg3_type = vtype; | |
93100c6b MG |
4996 | } |
4997 | ||
b55b02ea | 4998 | if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type)) |
93100c6b MG |
4999 | { |
5000 | enum stv_conv convert_flag = | |
4cbc4bd7 | 5001 | scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3, |
93100c6b MG |
5002 | complain & tf_error); |
5003 | ||
5004 | switch (convert_flag) | |
5005 | { | |
5006 | case stv_error: | |
5007 | return error_mark_node; | |
5008 | case stv_firstarg: | |
5009 | { | |
07298ffd | 5010 | arg2 = save_expr (arg2); |
93100c6b MG |
5011 | arg2 = convert (TREE_TYPE (arg3_type), arg2); |
5012 | arg2 = build_vector_from_val (arg3_type, arg2); | |
5013 | arg2_type = TREE_TYPE (arg2); | |
5014 | break; | |
5015 | } | |
5016 | case stv_secondarg: | |
5017 | { | |
07298ffd | 5018 | arg3 = save_expr (arg3); |
93100c6b MG |
5019 | arg3 = convert (TREE_TYPE (arg2_type), arg3); |
5020 | arg3 = build_vector_from_val (arg2_type, arg3); | |
5021 | arg3_type = TREE_TYPE (arg3); | |
5022 | break; | |
5023 | } | |
5024 | default: | |
5025 | break; | |
5026 | } | |
5027 | } | |
5028 | ||
5029 | if (!same_type_p (arg2_type, arg3_type) | |
928686b1 RS |
5030 | || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type), |
5031 | TYPE_VECTOR_SUBPARTS (arg2_type)) | |
93100c6b MG |
5032 | || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type)) |
5033 | { | |
5034 | if (complain & tf_error) | |
4cbc4bd7 PC |
5035 | error_at (loc, |
5036 | "incompatible vector types in conditional expression: " | |
5037 | "%qT, %qT and %qT", TREE_TYPE (arg1), | |
5038 | TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3)); | |
93100c6b MG |
5039 | return error_mark_node; |
5040 | } | |
5041 | ||
5042 | if (!COMPARISON_CLASS_P (arg1)) | |
9f47c7e5 IE |
5043 | { |
5044 | tree cmp_type = build_same_sized_truth_vector_type (arg1_type); | |
5045 | arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type)); | |
5046 | } | |
cda0a029 | 5047 | return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3); |
93100c6b MG |
5048 | } |
5049 | ||
07c88314 | 5050 | /* [expr.cond] |
c8094d83 | 5051 | |
39a13be5 | 5052 | The first expression is implicitly converted to bool (clause |
07c88314 | 5053 | _conv_). */ |
1dad57e6 JM |
5054 | arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain, |
5055 | LOOKUP_NORMAL); | |
93100c6b | 5056 | if (error_operand_p (arg1)) |
a7a64a77 MM |
5057 | return error_mark_node; |
5058 | ||
a7a64a77 MM |
5059 | /* [expr.cond] |
5060 | ||
5061 | If either the second or the third operand has type (possibly | |
5062 | cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_), | |
5063 | array-to-pointer (_conv.array_), and function-to-pointer | |
5064 | (_conv.func_) standard conversions are performed on the second | |
5065 | and third operands. */ | |
f9aa54d3 MM |
5066 | arg2_type = unlowered_expr_type (arg2); |
5067 | arg3_type = unlowered_expr_type (arg3); | |
b72801e2 | 5068 | if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type)) |
a7a64a77 | 5069 | { |
a7a64a77 MM |
5070 | /* [expr.cond] |
5071 | ||
5072 | One of the following shall hold: | |
5073 | ||
5074 | --The second or the third operand (but not both) is a | |
30a52a6d JM |
5075 | throw-expression (_except.throw_); the result is of the type |
5076 | and value category of the other. | |
a7a64a77 MM |
5077 | |
5078 | --Both the second and the third operands have type void; the | |
30a52a6d | 5079 | result is of type void and is a prvalue. */ |
c8094d83 | 5080 | if (TREE_CODE (arg2) == THROW_EXPR |
41dffe62 MM |
5081 | && TREE_CODE (arg3) != THROW_EXPR) |
5082 | { | |
41dffe62 | 5083 | result_type = arg3_type; |
30a52a6d | 5084 | is_glvalue = glvalue_p (arg3); |
41dffe62 | 5085 | } |
c8094d83 | 5086 | else if (TREE_CODE (arg2) != THROW_EXPR |
41dffe62 MM |
5087 | && TREE_CODE (arg3) == THROW_EXPR) |
5088 | { | |
41dffe62 | 5089 | result_type = arg2_type; |
30a52a6d | 5090 | is_glvalue = glvalue_p (arg2); |
41dffe62 | 5091 | } |
b72801e2 | 5092 | else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type)) |
30a52a6d JM |
5093 | { |
5094 | result_type = void_type_node; | |
5095 | is_glvalue = false; | |
5096 | } | |
a7a64a77 MM |
5097 | else |
5098 | { | |
5ade1ed2 DG |
5099 | if (complain & tf_error) |
5100 | { | |
5101 | if (VOID_TYPE_P (arg2_type)) | |
6bdfada4 | 5102 | error_at (cp_expr_loc_or_loc (arg3, loc), |
4cbc4bd7 PC |
5103 | "second operand to the conditional operator " |
5104 | "is of type %<void%>, but the third operand is " | |
5105 | "neither a throw-expression nor of type %<void%>"); | |
5ade1ed2 | 5106 | else |
6bdfada4 | 5107 | error_at (cp_expr_loc_or_loc (arg2, loc), |
4cbc4bd7 PC |
5108 | "third operand to the conditional operator " |
5109 | "is of type %<void%>, but the second operand is " | |
5110 | "neither a throw-expression nor of type %<void%>"); | |
5ade1ed2 | 5111 | } |
a7a64a77 MM |
5112 | return error_mark_node; |
5113 | } | |
5114 | ||
a7a64a77 MM |
5115 | goto valid_operands; |
5116 | } | |
5117 | /* [expr.cond] | |
5118 | ||
5119 | Otherwise, if the second and third operand have different types, | |
e8ee694a JM |
5120 | and either has (possibly cv-qualified) class type, or if both are |
5121 | glvalues of the same value category and the same type except for | |
5122 | cv-qualification, an attempt is made to convert each of those operands | |
5123 | to the type of the other. */ | |
a7a64a77 | 5124 | else if (!same_type_p (arg2_type, arg3_type) |
e8ee694a JM |
5125 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type) |
5126 | || (same_type_ignoring_top_level_qualifiers_p (arg2_type, | |
5127 | arg3_type) | |
c3edc633 | 5128 | && glvalue_p (arg2) && glvalue_p (arg3) |
72b3e203 | 5129 | && lvalue_p (arg2) == lvalue_p (arg3)))) |
a7a64a77 | 5130 | { |
5bd61841 MM |
5131 | conversion *conv2; |
5132 | conversion *conv3; | |
0eb5f158 | 5133 | bool converted = false; |
c8094d83 | 5134 | |
5bd61841 MM |
5135 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
5136 | p = conversion_obstack_alloc (0); | |
5137 | ||
b40e334f PC |
5138 | conv2 = conditional_conversion (arg2, arg3, complain); |
5139 | conv3 = conditional_conversion (arg3, arg2, complain); | |
5bd61841 | 5140 | |
a7a64a77 MM |
5141 | /* [expr.cond] |
5142 | ||
5143 | If both can be converted, or one can be converted but the | |
5144 | conversion is ambiguous, the program is ill-formed. If | |
5145 | neither can be converted, the operands are left unchanged and | |
5146 | further checking is performed as described below. If exactly | |
5147 | one conversion is possible, that conversion is applied to the | |
5148 | chosen operand and the converted operand is used in place of | |
5149 | the original operand for the remainder of this section. */ | |
5bd61841 MM |
5150 | if ((conv2 && !conv2->bad_p |
5151 | && conv3 && !conv3->bad_p) | |
5152 | || (conv2 && conv2->kind == ck_ambig) | |
5153 | || (conv3 && conv3->kind == ck_ambig)) | |
a7a64a77 | 5154 | { |
76545796 | 5155 | if (complain & tf_error) |
5f901ccf JM |
5156 | { |
5157 | error_at (loc, "operands to ?: have different types %qT and %qT", | |
5158 | arg2_type, arg3_type); | |
5159 | if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p) | |
5160 | inform (loc, " and each type can be converted to the other"); | |
5161 | else if (conv2 && conv2->kind == ck_ambig) | |
5162 | convert_like (conv2, arg2, complain); | |
5163 | else | |
5164 | convert_like (conv3, arg3, complain); | |
5165 | } | |
5bd61841 | 5166 | result = error_mark_node; |
a7a64a77 | 5167 | } |
bb8b1f69 | 5168 | else if (conv2 && !conv2->bad_p) |
a7a64a77 | 5169 | { |
5ade1ed2 | 5170 | arg2 = convert_like (conv2, arg2, complain); |
442aa4ec | 5171 | arg2 = convert_from_reference (arg2); |
a7a64a77 | 5172 | arg2_type = TREE_TYPE (arg2); |
2954333a MM |
5173 | /* Even if CONV2 is a valid conversion, the result of the |
5174 | conversion may be invalid. For example, if ARG3 has type | |
5175 | "volatile X", and X does not have a copy constructor | |
5176 | accepting a "volatile X&", then even if ARG2 can be | |
5177 | converted to X, the conversion will fail. */ | |
5178 | if (error_operand_p (arg2)) | |
5179 | result = error_mark_node; | |
0eb5f158 | 5180 | converted = true; |
a7a64a77 | 5181 | } |
bb8b1f69 | 5182 | else if (conv3 && !conv3->bad_p) |
a7a64a77 | 5183 | { |
5ade1ed2 | 5184 | arg3 = convert_like (conv3, arg3, complain); |
442aa4ec | 5185 | arg3 = convert_from_reference (arg3); |
a7a64a77 | 5186 | arg3_type = TREE_TYPE (arg3); |
2954333a MM |
5187 | if (error_operand_p (arg3)) |
5188 | result = error_mark_node; | |
0eb5f158 | 5189 | converted = true; |
a7a64a77 | 5190 | } |
5bd61841 MM |
5191 | |
5192 | /* Free all the conversions we allocated. */ | |
5193 | obstack_free (&conversion_obstack, p); | |
5194 | ||
5195 | if (result) | |
5196 | return result; | |
d2f2c87b MM |
5197 | |
5198 | /* If, after the conversion, both operands have class type, | |
5199 | treat the cv-qualification of both operands as if it were the | |
c8094d83 | 5200 | union of the cv-qualification of the operands. |
d2f2c87b MM |
5201 | |
5202 | The standard is not clear about what to do in this | |
5203 | circumstance. For example, if the first operand has type | |
5204 | "const X" and the second operand has a user-defined | |
5205 | conversion to "volatile X", what is the type of the second | |
5206 | operand after this step? Making it be "const X" (matching | |
5207 | the first operand) seems wrong, as that discards the | |
4ee31f1e | 5208 | qualification without actually performing a copy. Leaving it |
d2f2c87b MM |
5209 | as "volatile X" seems wrong as that will result in the |
5210 | conditional expression failing altogether, even though, | |
5211 | according to this step, the one operand could be converted to | |
5212 | the type of the other. */ | |
0eb5f158 | 5213 | if (converted |
d2f2c87b | 5214 | && CLASS_TYPE_P (arg2_type) |
a3360e77 | 5215 | && cp_type_quals (arg2_type) != cp_type_quals (arg3_type)) |
c8094d83 | 5216 | arg2_type = arg3_type = |
d2f2c87b | 5217 | cp_build_qualified_type (arg2_type, |
a3360e77 JM |
5218 | cp_type_quals (arg2_type) |
5219 | | cp_type_quals (arg3_type)); | |
a7a64a77 MM |
5220 | } |
5221 | ||
5222 | /* [expr.cond] | |
5223 | ||
76c7bf65 MG |
5224 | If the second and third operands are glvalues of the same value |
5225 | category and have the same type, the result is of that type and | |
5226 | value category. */ | |
72b3e203 | 5227 | if (((lvalue_p (arg2) && lvalue_p (arg3)) |
76c7bf65 | 5228 | || (xvalue_p (arg2) && xvalue_p (arg3))) |
d18a8251 | 5229 | && same_type_p (arg2_type, arg3_type)) |
a7a64a77 MM |
5230 | { |
5231 | result_type = arg2_type; | |
416f380b JJ |
5232 | arg2 = mark_lvalue_use (arg2); |
5233 | arg3 = mark_lvalue_use (arg3); | |
a7a64a77 MM |
5234 | goto valid_operands; |
5235 | } | |
5236 | ||
5237 | /* [expr.cond] | |
5238 | ||
5239 | Otherwise, the result is an rvalue. If the second and third | |
5240 | operand do not have the same type, and either has (possibly | |
5241 | cv-qualified) class type, overload resolution is used to | |
5242 | determine the conversions (if any) to be applied to the operands | |
5243 | (_over.match.oper_, _over.built_). */ | |
23d63b45 | 5244 | is_glvalue = false; |
a7a64a77 MM |
5245 | if (!same_type_p (arg2_type, arg3_type) |
5246 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type))) | |
5247 | { | |
5248 | tree args[3]; | |
5bd61841 | 5249 | conversion *conv; |
436f8a4c | 5250 | bool any_viable_p; |
a7a64a77 MM |
5251 | |
5252 | /* Rearrange the arguments so that add_builtin_candidate only has | |
7919d7b4 | 5253 | to know about two args. In build_builtin_candidate, the |
a7a64a77 MM |
5254 | arguments are unscrambled. */ |
5255 | args[0] = arg2; | |
5256 | args[1] = arg3; | |
5257 | args[2] = arg1; | |
c8094d83 MS |
5258 | add_builtin_candidates (&candidates, |
5259 | COND_EXPR, | |
7993382e | 5260 | NOP_EXPR, |
88a819be | 5261 | ovl_op_identifier (false, COND_EXPR), |
7993382e | 5262 | args, |
b40e334f | 5263 | LOOKUP_NORMAL, complain); |
a7a64a77 MM |
5264 | |
5265 | /* [expr.cond] | |
5266 | ||
5267 | If the overload resolution fails, the program is | |
5268 | ill-formed. */ | |
89606913 | 5269 | candidates = splice_viable (candidates, false, &any_viable_p); |
436f8a4c | 5270 | if (!any_viable_p) |
a7a64a77 | 5271 | { |
5ade1ed2 | 5272 | if (complain & tf_error) |
5f901ccf JM |
5273 | error_at (loc, "operands to ?: have different types %qT and %qT", |
5274 | arg2_type, arg3_type); | |
a7a64a77 MM |
5275 | return error_mark_node; |
5276 | } | |
b40e334f | 5277 | cand = tourney (candidates, complain); |
a7a64a77 MM |
5278 | if (!cand) |
5279 | { | |
5ade1ed2 DG |
5280 | if (complain & tf_error) |
5281 | { | |
097f82ec | 5282 | auto_diagnostic_group d; |
4cbc4bd7 PC |
5283 | op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE); |
5284 | print_z_candidates (loc, candidates); | |
5ade1ed2 | 5285 | } |
a7a64a77 MM |
5286 | return error_mark_node; |
5287 | } | |
5288 | ||
5289 | /* [expr.cond] | |
5290 | ||
5291 | Otherwise, the conversions thus determined are applied, and | |
5292 | the converted operands are used in place of the original | |
5293 | operands for the remainder of this section. */ | |
5bd61841 | 5294 | conv = cand->convs[0]; |
5ade1ed2 | 5295 | arg1 = convert_like (conv, arg1, complain); |
5bd61841 | 5296 | conv = cand->convs[1]; |
5ade1ed2 | 5297 | arg2 = convert_like (conv, arg2, complain); |
7919d7b4 | 5298 | arg2_type = TREE_TYPE (arg2); |
5bd61841 | 5299 | conv = cand->convs[2]; |
5ade1ed2 | 5300 | arg3 = convert_like (conv, arg3, complain); |
7919d7b4 | 5301 | arg3_type = TREE_TYPE (arg3); |
a7a64a77 MM |
5302 | } |
5303 | ||
5304 | /* [expr.cond] | |
5305 | ||
5306 | Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_), | |
5307 | and function-to-pointer (_conv.func_) standard conversions are | |
50fd6343 JM |
5308 | performed on the second and third operands. |
5309 | ||
5310 | We need to force the lvalue-to-rvalue conversion here for class types, | |
5311 | so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues | |
5312 | that isn't wrapped with a TARGET_EXPR plays havoc with exception | |
d2f2c87b | 5313 | regions. */ |
50fd6343 | 5314 | |
574cfaa4 | 5315 | arg2 = force_rvalue (arg2, complain); |
d2f2c87b MM |
5316 | if (!CLASS_TYPE_P (arg2_type)) |
5317 | arg2_type = TREE_TYPE (arg2); | |
50fd6343 | 5318 | |
574cfaa4 | 5319 | arg3 = force_rvalue (arg3, complain); |
7919d7b4 | 5320 | if (!CLASS_TYPE_P (arg3_type)) |
d2f2c87b | 5321 | arg3_type = TREE_TYPE (arg3); |
a7a64a77 | 5322 | |
40260429 NS |
5323 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5324 | return error_mark_node; | |
c8094d83 | 5325 | |
a7a64a77 | 5326 | /* [expr.cond] |
c8094d83 | 5327 | |
a7a64a77 MM |
5328 | After those conversions, one of the following shall hold: |
5329 | ||
5330 | --The second and third operands have the same type; the result is of | |
5331 | that type. */ | |
5332 | if (same_type_p (arg2_type, arg3_type)) | |
5333 | result_type = arg2_type; | |
5334 | /* [expr.cond] | |
5335 | ||
5336 | --The second and third operands have arithmetic or enumeration | |
5337 | type; the usual arithmetic conversions are performed to bring | |
5338 | them to a common type, and the result is of that type. */ | |
c8094d83 | 5339 | else if ((ARITHMETIC_TYPE_P (arg2_type) |
adf2edec | 5340 | || UNSCOPED_ENUM_P (arg2_type)) |
a7a64a77 | 5341 | && (ARITHMETIC_TYPE_P (arg3_type) |
adf2edec | 5342 | || UNSCOPED_ENUM_P (arg3_type))) |
a7a64a77 MM |
5343 | { |
5344 | /* In this case, there is always a common type. */ | |
c8094d83 | 5345 | result_type = type_after_usual_arithmetic_conversions (arg2_type, |
a7a64a77 | 5346 | arg3_type); |
76545796 PC |
5347 | if (complain & tf_warning) |
5348 | do_warn_double_promotion (result_type, arg2_type, arg3_type, | |
f012c8ef | 5349 | "implicit conversion from %qH to %qI to " |
76545796 | 5350 | "match other result of conditional", |
4cbc4bd7 | 5351 | loc); |
c8094d83 | 5352 | |
1b4d752a | 5353 | if (TREE_CODE (arg2_type) == ENUMERAL_TYPE |
0cbd7506 | 5354 | && TREE_CODE (arg3_type) == ENUMERAL_TYPE) |
5ade1ed2 | 5355 | { |
dfd7fdca DM |
5356 | tree stripped_orig_arg2 = tree_strip_any_location_wrapper (orig_arg2); |
5357 | tree stripped_orig_arg3 = tree_strip_any_location_wrapper (orig_arg3); | |
5358 | if (TREE_CODE (stripped_orig_arg2) == CONST_DECL | |
5359 | && TREE_CODE (stripped_orig_arg3) == CONST_DECL | |
5360 | && (DECL_CONTEXT (stripped_orig_arg2) | |
5361 | == DECL_CONTEXT (stripped_orig_arg3))) | |
8d0d1915 JM |
5362 | /* Two enumerators from the same enumeration can have different |
5363 | types when the enumeration is still being defined. */; | |
5364 | else if (complain & tf_warning) | |
4cbc4bd7 PC |
5365 | warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in " |
5366 | "conditional expression: %qT vs %qT", | |
5367 | arg2_type, arg3_type); | |
5ade1ed2 | 5368 | } |
1b4d752a | 5369 | else if (extra_warnings |
0cbd7506 MS |
5370 | && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE |
5371 | && !same_type_p (arg3_type, type_promotes_to (arg2_type))) | |
5372 | || (TREE_CODE (arg3_type) == ENUMERAL_TYPE | |
4cbc4bd7 PC |
5373 | && !same_type_p (arg2_type, |
5374 | type_promotes_to (arg3_type))))) | |
5ade1ed2 DG |
5375 | { |
5376 | if (complain & tf_warning) | |
598fc085 | 5377 | warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in " |
4cbc4bd7 | 5378 | "conditional expression"); |
5ade1ed2 | 5379 | } |
c8094d83 | 5380 | |
5ade1ed2 DG |
5381 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5382 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
a7a64a77 MM |
5383 | } |
5384 | /* [expr.cond] | |
5385 | ||
5386 | --The second and third operands have pointer type, or one has | |
5387 | pointer type and the other is a null pointer constant; pointer | |
5388 | conversions (_conv.ptr_) and qualification conversions | |
5389 | (_conv.qual_) are performed to bring them to their composite | |
5390 | pointer type (_expr.rel_). The result is of the composite | |
5391 | pointer type. | |
5392 | ||
5393 | --The second and third operands have pointer to member type, or | |
5394 | one has pointer to member type and the other is a null pointer | |
5395 | constant; pointer to member conversions (_conv.mem_) and | |
5396 | qualification conversions (_conv.qual_) are performed to bring | |
5397 | them to a common type, whose cv-qualification shall match the | |
5398 | cv-qualification of either the second or the third operand. | |
00a17e31 | 5399 | The result is of the common type. */ |
c8094d83 | 5400 | else if ((null_ptr_cst_p (arg2) |
66b1156a | 5401 | && TYPE_PTR_OR_PTRMEM_P (arg3_type)) |
c8094d83 | 5402 | || (null_ptr_cst_p (arg3) |
66b1156a | 5403 | && TYPE_PTR_OR_PTRMEM_P (arg2_type)) |
a7a64a77 | 5404 | || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type)) |
66b1156a | 5405 | || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type)) |
a5ac359a | 5406 | || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type))) |
a7a64a77 MM |
5407 | { |
5408 | result_type = composite_pointer_type (arg2_type, arg3_type, arg2, | |
c86818cf | 5409 | arg3, CPO_CONDITIONAL_EXPR, |
5ade1ed2 | 5410 | complain); |
6cf4d1bc MM |
5411 | if (result_type == error_mark_node) |
5412 | return error_mark_node; | |
5ade1ed2 DG |
5413 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5414 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
a7a64a77 MM |
5415 | } |
5416 | ||
5417 | if (!result_type) | |
5418 | { | |
5ade1ed2 | 5419 | if (complain & tf_error) |
4cbc4bd7 PC |
5420 | error_at (loc, "operands to ?: have different types %qT and %qT", |
5421 | arg2_type, arg3_type); | |
a7a64a77 MM |
5422 | return error_mark_node; |
5423 | } | |
5424 | ||
22854930 PC |
5425 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5426 | return error_mark_node; | |
5427 | ||
a7a64a77 | 5428 | valid_operands: |
30a52a6d JM |
5429 | if (processing_template_decl && is_glvalue) |
5430 | { | |
5431 | /* Let lvalue_kind know this was a glvalue. */ | |
5432 | tree arg = (result_type == arg2_type ? arg2 : arg3); | |
5433 | result_type = cp_build_reference_type (result_type, xvalue_p (arg)); | |
5434 | } | |
5435 | ||
46836b0e | 5436 | result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3); |
f33e4dd7 | 5437 | |
2ebd93e1 MP |
5438 | /* If the ARG2 and ARG3 are the same and don't have side-effects, |
5439 | warn here, because the COND_EXPR will be turned into ARG2. */ | |
5440 | if (warn_duplicated_branches | |
6bebae75 | 5441 | && (complain & tf_warning) |
2ebd93e1 MP |
5442 | && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0))) |
5443 | warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches, | |
5444 | "this condition has identical branches"); | |
5445 | ||
a65fd2d7 JM |
5446 | /* We can't use result_type below, as fold might have returned a |
5447 | throw_expr. */ | |
5448 | ||
23d63b45 | 5449 | if (!is_glvalue) |
41990f96 MM |
5450 | { |
5451 | /* Expand both sides into the same slot, hopefully the target of | |
5452 | the ?: expression. We used to check for TARGET_EXPRs here, | |
5453 | but now we sometimes wrap them in NOP_EXPRs so the test would | |
5454 | fail. */ | |
5455 | if (CLASS_TYPE_P (TREE_TYPE (result))) | |
81bd268c | 5456 | result = get_target_expr_sfinae (result, complain); |
41990f96 MM |
5457 | /* If this expression is an rvalue, but might be mistaken for an |
5458 | lvalue, we must add a NON_LVALUE_EXPR. */ | |
5459 | result = rvalue (result); | |
5460 | } | |
10c6dc8e JM |
5461 | else |
5462 | result = force_paren_expr (result); | |
a7a64a77 MM |
5463 | |
5464 | return result; | |
5465 | } | |
5466 | ||
575bfb00 LC |
5467 | /* Wrapper for above. */ |
5468 | ||
5469 | tree | |
a14feb3c DM |
5470 | build_conditional_expr (const op_location_t &loc, |
5471 | tree arg1, tree arg2, tree arg3, | |
575bfb00 LC |
5472 | tsubst_flags_t complain) |
5473 | { | |
5474 | tree ret; | |
5475 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
4cbc4bd7 | 5476 | ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain); |
575bfb00 LC |
5477 | timevar_cond_stop (TV_OVERLOAD, subtime); |
5478 | return ret; | |
5479 | } | |
5480 | ||
14d22dd6 MM |
5481 | /* OPERAND is an operand to an expression. Perform necessary steps |
5482 | required before using it. If OPERAND is NULL_TREE, NULL_TREE is | |
5483 | returned. */ | |
5484 | ||
5485 | static tree | |
5486 | prep_operand (tree operand) | |
5487 | { | |
5488 | if (operand) | |
5489 | { | |
14d22dd6 MM |
5490 | if (CLASS_TYPE_P (TREE_TYPE (operand)) |
5491 | && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand))) | |
5492 | /* Make sure the template type is instantiated now. */ | |
5493 | instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand))); | |
5494 | } | |
5495 | ||
5496 | return operand; | |
5497 | } | |
5498 | ||
b80f8ef3 MM |
5499 | /* Add each of the viable functions in FNS (a FUNCTION_DECL or |
5500 | OVERLOAD) to the CANDIDATES, returning an updated list of | |
5c824000 JM |
5501 | CANDIDATES. The ARGS are the arguments provided to the call; |
5502 | if FIRST_ARG is non-null it is the implicit object argument, | |
5503 | otherwise the first element of ARGS is used if needed. The | |
c166b898 ILT |
5504 | EXPLICIT_TARGS are explicit template arguments provided. |
5505 | TEMPLATE_ONLY is true if only template functions should be | |
5506 | considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for | |
5507 | add_function_candidate. */ | |
b80f8ef3 | 5508 | |
7993382e | 5509 | static void |
9771b263 | 5510 | add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args, |
5c824000 | 5511 | tree return_type, |
125e6594 | 5512 | tree explicit_targs, bool template_only, |
b80f8ef3 MM |
5513 | tree conversion_path, tree access_path, |
5514 | int flags, | |
b40e334f PC |
5515 | struct z_candidate **candidates, |
5516 | tsubst_flags_t complain) | |
b80f8ef3 MM |
5517 | { |
5518 | tree ctype; | |
9771b263 | 5519 | const vec<tree, va_gc> *non_static_args; |
60f80e65 NS |
5520 | bool check_list_ctor = false; |
5521 | bool check_converting = false; | |
5c824000 | 5522 | unification_kind_t strict; |
5c824000 JM |
5523 | |
5524 | if (!fns) | |
5525 | return; | |
5526 | ||
5527 | /* Precalculate special handling of constructors and conversion ops. */ | |
a736411a | 5528 | tree fn = OVL_FIRST (fns); |
5c824000 JM |
5529 | if (DECL_CONV_FN_P (fn)) |
5530 | { | |
d451d5b2 | 5531 | check_list_ctor = false; |
60f80e65 | 5532 | check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0; |
404f08f8 JM |
5533 | if (flags & LOOKUP_NO_CONVERSION) |
5534 | /* We're doing return_type(x). */ | |
5535 | strict = DEDUCE_CONV; | |
5536 | else | |
5537 | /* We're doing x.operator return_type(). */ | |
5538 | strict = DEDUCE_EXACT; | |
5c824000 JM |
5539 | /* [over.match.funcs] For conversion functions, the function |
5540 | is considered to be a member of the class of the implicit | |
5541 | object argument for the purpose of defining the type of | |
5542 | the implicit object parameter. */ | |
a7175123 | 5543 | ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg)); |
5c824000 JM |
5544 | } |
5545 | else | |
5546 | { | |
5547 | if (DECL_CONSTRUCTOR_P (fn)) | |
d451d5b2 | 5548 | { |
60f80e65 | 5549 | check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0; |
11c71a22 JM |
5550 | /* For list-initialization we consider explicit constructors |
5551 | and complain if one is chosen. */ | |
5552 | check_converting | |
5553 | = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR)) | |
5554 | == LOOKUP_ONLYCONVERTING); | |
d451d5b2 | 5555 | } |
5c824000 JM |
5556 | strict = DEDUCE_CALL; |
5557 | ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE; | |
5558 | } | |
b80f8ef3 | 5559 | |
5c824000 JM |
5560 | if (first_arg) |
5561 | non_static_args = args; | |
5562 | else | |
5563 | /* Delay creating the implicit this parameter until it is needed. */ | |
5564 | non_static_args = NULL; | |
b80f8ef3 | 5565 | |
a736411a | 5566 | for (lkp_iterator iter (fns); iter; ++iter) |
b80f8ef3 | 5567 | { |
a736411a | 5568 | fn = *iter; |
5c824000 JM |
5569 | |
5570 | if (check_converting && DECL_NONCONVERTING_P (fn)) | |
5571 | continue; | |
d451d5b2 JM |
5572 | if (check_list_ctor && !is_list_ctor (fn)) |
5573 | continue; | |
5c824000 | 5574 | |
60f80e65 NS |
5575 | tree fn_first_arg = NULL_TREE; |
5576 | const vec<tree, va_gc> *fn_args = args; | |
5577 | ||
125e6594 | 5578 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) |
b80f8ef3 | 5579 | { |
60f80e65 NS |
5580 | /* Figure out where the object arg comes from. If this |
5581 | function is a non-static member and we didn't get an | |
5c824000 JM |
5582 | implicit object argument, move it out of args. */ |
5583 | if (first_arg == NULL_TREE) | |
c166b898 ILT |
5584 | { |
5585 | unsigned int ix; | |
5586 | tree arg; | |
9771b263 DN |
5587 | vec<tree, va_gc> *tempvec; |
5588 | vec_alloc (tempvec, args->length () - 1); | |
5589 | for (ix = 1; args->iterate (ix, &arg); ++ix) | |
5590 | tempvec->quick_push (arg); | |
5c824000 | 5591 | non_static_args = tempvec; |
a7175123 | 5592 | first_arg = (*args)[0]; |
c166b898 | 5593 | } |
5c824000 | 5594 | |
c166b898 | 5595 | fn_first_arg = first_arg; |
b80f8ef3 MM |
5596 | fn_args = non_static_args; |
5597 | } | |
b80f8ef3 MM |
5598 | |
5599 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
c8094d83 MS |
5600 | add_template_candidate (candidates, |
5601 | fn, | |
7993382e | 5602 | ctype, |
125e6594 | 5603 | explicit_targs, |
c166b898 | 5604 | fn_first_arg, |
7993382e | 5605 | fn_args, |
5c824000 | 5606 | return_type, |
7993382e MM |
5607 | access_path, |
5608 | conversion_path, | |
5609 | flags, | |
b40e334f PC |
5610 | strict, |
5611 | complain); | |
125e6594 | 5612 | else if (!template_only) |
7993382e MM |
5613 | add_function_candidate (candidates, |
5614 | fn, | |
5615 | ctype, | |
c166b898 | 5616 | fn_first_arg, |
7993382e MM |
5617 | fn_args, |
5618 | access_path, | |
5619 | conversion_path, | |
b40e334f | 5620 | flags, |
6147a53a | 5621 | NULL, |
b40e334f | 5622 | complain); |
b80f8ef3 | 5623 | } |
b80f8ef3 MM |
5624 | } |
5625 | ||
4eb24e01 JM |
5626 | /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first, |
5627 | -1 if the RHS is evaluated first, or 0 if the order is unspecified. */ | |
5628 | ||
5629 | static int | |
5630 | op_is_ordered (tree_code code) | |
5631 | { | |
4eb24e01 JM |
5632 | switch (code) |
5633 | { | |
5634 | // 5. b @= a | |
5635 | case MODIFY_EXPR: | |
d0cf395a JM |
5636 | return (flag_strong_eval_order > 1 ? -1 : 0); |
5637 | ||
5638 | // 6. a[b] | |
5639 | case ARRAY_REF: | |
5640 | return (flag_strong_eval_order > 1 ? 1 : 0); | |
4eb24e01 JM |
5641 | |
5642 | // 1. a.b | |
5643 | // Not overloadable (yet). | |
5644 | // 2. a->b | |
5645 | // Only one argument. | |
5646 | // 3. a->*b | |
5647 | case MEMBER_REF: | |
4eb24e01 JM |
5648 | // 7. a << b |
5649 | case LSHIFT_EXPR: | |
5650 | // 8. a >> b | |
5651 | case RSHIFT_EXPR: | |
d0cf395a | 5652 | return (flag_strong_eval_order ? 1 : 0); |
4eb24e01 JM |
5653 | |
5654 | default: | |
5655 | return 0; | |
5656 | } | |
5657 | } | |
5658 | ||
575bfb00 | 5659 | static tree |
a14feb3c DM |
5660 | build_new_op_1 (const op_location_t &loc, enum tree_code code, int flags, |
5661 | tree arg1, tree arg2, tree arg3, tree *overload, | |
5662 | tsubst_flags_t complain) | |
c73964b2 MS |
5663 | { |
5664 | struct z_candidate *candidates = 0, *cand; | |
9771b263 | 5665 | vec<tree, va_gc> *arglist; |
b80f8ef3 | 5666 | tree args[3]; |
5bd61841 MM |
5667 | tree result = NULL_TREE; |
5668 | bool result_valid_p = false; | |
c73964b2 | 5669 | enum tree_code code2 = NOP_EXPR; |
ca409efd MLI |
5670 | enum tree_code code_orig_arg1 = ERROR_MARK; |
5671 | enum tree_code code_orig_arg2 = ERROR_MARK; | |
5bd61841 MM |
5672 | conversion *conv; |
5673 | void *p; | |
436f8a4c MM |
5674 | bool strict_p; |
5675 | bool any_viable_p; | |
c73964b2 | 5676 | |
c8094d83 MS |
5677 | if (error_operand_p (arg1) |
5678 | || error_operand_p (arg2) | |
a723baf1 | 5679 | || error_operand_p (arg3)) |
c73964b2 MS |
5680 | return error_mark_node; |
5681 | ||
88a819be NS |
5682 | bool ismodop = code == MODIFY_EXPR; |
5683 | if (ismodop) | |
c73964b2 MS |
5684 | { |
5685 | code2 = TREE_CODE (arg3); | |
5686 | arg3 = NULL_TREE; | |
c73964b2 | 5687 | } |
88a819be | 5688 | tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code); |
c73964b2 | 5689 | |
14d22dd6 | 5690 | arg1 = prep_operand (arg1); |
c8094d83 | 5691 | |
e1926435 | 5692 | bool memonly = false; |
c73964b2 MS |
5693 | switch (code) |
5694 | { | |
5695 | case NEW_EXPR: | |
5696 | case VEC_NEW_EXPR: | |
c73964b2 MS |
5697 | case VEC_DELETE_EXPR: |
5698 | case DELETE_EXPR: | |
00a17e31 | 5699 | /* Use build_op_new_call and build_op_delete_call instead. */ |
8dc2b103 | 5700 | gcc_unreachable (); |
c73964b2 MS |
5701 | |
5702 | case CALL_EXPR: | |
c166b898 ILT |
5703 | /* Use build_op_call instead. */ |
5704 | gcc_unreachable (); | |
7f85441b | 5705 | |
63a08740 DM |
5706 | case TRUTH_ORIF_EXPR: |
5707 | case TRUTH_ANDIF_EXPR: | |
5708 | case TRUTH_AND_EXPR: | |
5709 | case TRUTH_OR_EXPR: | |
ca409efd MLI |
5710 | /* These are saved for the sake of warn_logical_operator. */ |
5711 | code_orig_arg1 = TREE_CODE (arg1); | |
5712 | code_orig_arg2 = TREE_CODE (arg2); | |
04159acf MP |
5713 | break; |
5714 | case GT_EXPR: | |
5715 | case LT_EXPR: | |
5716 | case GE_EXPR: | |
5717 | case LE_EXPR: | |
5718 | case EQ_EXPR: | |
5719 | case NE_EXPR: | |
5720 | /* These are saved for the sake of maybe_warn_bool_compare. */ | |
5721 | code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1)); | |
5722 | code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2)); | |
5723 | break; | |
e1926435 JM |
5724 | |
5725 | /* =, ->, [], () must be non-static member functions. */ | |
5726 | case MODIFY_EXPR: | |
5727 | if (code2 != NOP_EXPR) | |
5728 | break; | |
191816a3 | 5729 | /* FALLTHRU */ |
e1926435 JM |
5730 | case COMPONENT_REF: |
5731 | case ARRAY_REF: | |
5732 | memonly = true; | |
5733 | break; | |
5734 | ||
7f85441b KG |
5735 | default: |
5736 | break; | |
c73964b2 MS |
5737 | } |
5738 | ||
14d22dd6 MM |
5739 | arg2 = prep_operand (arg2); |
5740 | arg3 = prep_operand (arg3); | |
c8094d83 | 5741 | |
5156628f | 5742 | if (code == COND_EXPR) |
7919d7b4 JM |
5743 | /* Use build_conditional_expr instead. */ |
5744 | gcc_unreachable (); | |
73243d63 PC |
5745 | else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1)) |
5746 | && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2)))) | |
c73964b2 MS |
5747 | goto builtin; |
5748 | ||
5749 | if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR) | |
5750 | arg2 = integer_zero_node; | |
5751 | ||
9771b263 DN |
5752 | vec_alloc (arglist, 3); |
5753 | arglist->quick_push (arg1); | |
c166b898 | 5754 | if (arg2 != NULL_TREE) |
9771b263 | 5755 | arglist->quick_push (arg2); |
c166b898 | 5756 | if (arg3 != NULL_TREE) |
9771b263 | 5757 | arglist->quick_push (arg3); |
c73964b2 | 5758 | |
5bd61841 MM |
5759 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
5760 | p = conversion_obstack_alloc (0); | |
5761 | ||
b80f8ef3 MM |
5762 | /* Add namespace-scope operators to the list of functions to |
5763 | consider. */ | |
e1926435 | 5764 | if (!memonly) |
e1cad930 NS |
5765 | { |
5766 | tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0); | |
5767 | fns = lookup_arg_dependent (fnname, fns, arglist); | |
5768 | add_candidates (fns, NULL_TREE, arglist, NULL_TREE, | |
5769 | NULL_TREE, false, NULL_TREE, NULL_TREE, | |
5770 | flags, &candidates, complain); | |
5771 | } | |
52243905 AO |
5772 | |
5773 | args[0] = arg1; | |
5774 | args[1] = arg2; | |
5775 | args[2] = NULL_TREE; | |
5776 | ||
b80f8ef3 MM |
5777 | /* Add class-member operators to the candidate set. */ |
5778 | if (CLASS_TYPE_P (TREE_TYPE (arg1))) | |
c73964b2 | 5779 | { |
b80f8ef3 | 5780 | tree fns; |
c73964b2 | 5781 | |
cad7e87b | 5782 | fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1); |
734e8cc5 | 5783 | if (fns == error_mark_node) |
5bd61841 MM |
5784 | { |
5785 | result = error_mark_node; | |
5786 | goto user_defined_result_ready; | |
5787 | } | |
b80f8ef3 | 5788 | if (fns) |
5c824000 JM |
5789 | add_candidates (BASELINK_FUNCTIONS (fns), |
5790 | NULL_TREE, arglist, NULL_TREE, | |
125e6594 | 5791 | NULL_TREE, false, |
7993382e | 5792 | BASELINK_BINFO (fns), |
5c824000 | 5793 | BASELINK_ACCESS_BINFO (fns), |
b40e334f | 5794 | flags, &candidates, complain); |
734e8cc5 | 5795 | } |
52243905 AO |
5796 | /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then |
5797 | only non-member functions that have type T1 or reference to | |
5798 | cv-qualified-opt T1 for the first argument, if the first argument | |
5799 | has an enumeration type, or T2 or reference to cv-qualified-opt | |
026c3cfd | 5800 | T2 for the second argument, if the second argument has an |
52243905 AO |
5801 | enumeration type. Filter out those that don't match. */ |
5802 | else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2))) | |
5803 | { | |
5804 | struct z_candidate **candp, **next; | |
c73964b2 | 5805 | |
52243905 AO |
5806 | for (candp = &candidates; *candp; candp = next) |
5807 | { | |
5808 | tree parmlist, parmtype; | |
5809 | int i, nargs = (arg2 ? 2 : 1); | |
5810 | ||
5811 | cand = *candp; | |
5812 | next = &cand->next; | |
5813 | ||
5814 | parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn)); | |
5815 | ||
5816 | for (i = 0; i < nargs; ++i) | |
5817 | { | |
5818 | parmtype = TREE_VALUE (parmlist); | |
5819 | ||
9f613f06 | 5820 | if (TYPE_REF_P (parmtype)) |
52243905 AO |
5821 | parmtype = TREE_TYPE (parmtype); |
5822 | if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE | |
5823 | && (same_type_ignoring_top_level_qualifiers_p | |
5824 | (TREE_TYPE (args[i]), parmtype))) | |
5825 | break; | |
5826 | ||
5827 | parmlist = TREE_CHAIN (parmlist); | |
5828 | } | |
5829 | ||
5830 | /* No argument has an appropriate type, so remove this | |
5831 | candidate function from the list. */ | |
5832 | if (i == nargs) | |
5833 | { | |
5834 | *candp = cand->next; | |
5835 | next = candp; | |
5836 | } | |
5837 | } | |
5838 | } | |
c73964b2 | 5839 | |
b40e334f PC |
5840 | add_builtin_candidates (&candidates, code, code2, fnname, args, |
5841 | flags, complain); | |
c73964b2 | 5842 | |
ecc42c14 AO |
5843 | switch (code) |
5844 | { | |
5845 | case COMPOUND_EXPR: | |
5846 | case ADDR_EXPR: | |
5847 | /* For these, the built-in candidates set is empty | |
5848 | [over.match.oper]/3. We don't want non-strict matches | |
5849 | because exact matches are always possible with built-in | |
5850 | operators. The built-in candidate set for COMPONENT_REF | |
5851 | would be empty too, but since there are no such built-in | |
5852 | operators, we accept non-strict matches for them. */ | |
436f8a4c | 5853 | strict_p = true; |
ecc42c14 AO |
5854 | break; |
5855 | ||
5856 | default: | |
89606913 | 5857 | strict_p = false; |
ecc42c14 | 5858 | break; |
c8094d83 | 5859 | } |
ecc42c14 | 5860 | |
436f8a4c MM |
5861 | candidates = splice_viable (candidates, strict_p, &any_viable_p); |
5862 | if (!any_viable_p) | |
c73964b2 MS |
5863 | { |
5864 | switch (code) | |
5865 | { | |
5866 | case POSTINCREMENT_EXPR: | |
5867 | case POSTDECREMENT_EXPR: | |
5ade1ed2 DG |
5868 | /* Don't try anything fancy if we're not allowed to produce |
5869 | errors. */ | |
5870 | if (!(complain & tf_error)) | |
5871 | return error_mark_node; | |
5872 | ||
481817e4 MLI |
5873 | /* Look for an `operator++ (int)'. Pre-1985 C++ didn't |
5874 | distinguish between prefix and postfix ++ and | |
5875 | operator++() was used for both, so we allow this with | |
5876 | -fpermissive. */ | |
4b978f96 | 5877 | else |
481817e4 MLI |
5878 | { |
5879 | const char *msg = (flag_permissive) | |
5880 | ? G_("no %<%D(int)%> declared for postfix %qs," | |
5881 | " trying prefix operator instead") | |
5882 | : G_("no %<%D(int)%> declared for postfix %qs"); | |
88a819be | 5883 | permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name); |
481817e4 MLI |
5884 | } |
5885 | ||
5886 | if (!flag_permissive) | |
5887 | return error_mark_node; | |
5888 | ||
c73964b2 MS |
5889 | if (code == POSTINCREMENT_EXPR) |
5890 | code = PREINCREMENT_EXPR; | |
5891 | else | |
c8094d83 | 5892 | code = PREDECREMENT_EXPR; |
4fe977f2 PC |
5893 | result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE, |
5894 | NULL_TREE, overload, complain); | |
5bd61841 MM |
5895 | break; |
5896 | ||
c73964b2 MS |
5897 | /* The caller will deal with these. */ |
5898 | case ADDR_EXPR: | |
5899 | case COMPOUND_EXPR: | |
5900 | case COMPONENT_REF: | |
5bd61841 MM |
5901 | result = NULL_TREE; |
5902 | result_valid_p = true; | |
5903 | break; | |
7f85441b KG |
5904 | |
5905 | default: | |
4b978f96 | 5906 | if (complain & tf_error) |
5bd61841 | 5907 | { |
111a28c2 DS |
5908 | /* If one of the arguments of the operator represents |
5909 | an invalid use of member function pointer, try to report | |
5910 | a meaningful error ... */ | |
d3ea4c06 MLI |
5911 | if (invalid_nonstatic_memfn_p (loc, arg1, tf_error) |
5912 | || invalid_nonstatic_memfn_p (loc, arg2, tf_error) | |
5913 | || invalid_nonstatic_memfn_p (loc, arg3, tf_error)) | |
111a28c2 DS |
5914 | /* We displayed the error message. */; |
5915 | else | |
5916 | { | |
5917 | /* ... Otherwise, report the more generic | |
5918 | "no matching operator found" error */ | |
097f82ec | 5919 | auto_diagnostic_group d; |
4fe977f2 PC |
5920 | op_error (loc, code, code2, arg1, arg2, arg3, FALSE); |
5921 | print_z_candidates (loc, candidates); | |
111a28c2 | 5922 | } |
5bd61841 MM |
5923 | } |
5924 | result = error_mark_node; | |
7f85441b | 5925 | break; |
c73964b2 | 5926 | } |
c73964b2 | 5927 | } |
5bd61841 | 5928 | else |
c73964b2 | 5929 | { |
b40e334f | 5930 | cand = tourney (candidates, complain); |
5bd61841 | 5931 | if (cand == 0) |
c73964b2 | 5932 | { |
4b978f96 | 5933 | if (complain & tf_error) |
5bd61841 | 5934 | { |
097f82ec | 5935 | auto_diagnostic_group d; |
4fe977f2 PC |
5936 | op_error (loc, code, code2, arg1, arg2, arg3, TRUE); |
5937 | print_z_candidates (loc, candidates); | |
5bd61841 MM |
5938 | } |
5939 | result = error_mark_node; | |
c73964b2 | 5940 | } |
5bd61841 | 5941 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL) |
c73964b2 | 5942 | { |
6904f4b4 DK |
5943 | if (overload) |
5944 | *overload = cand->fn; | |
ec835fb2 | 5945 | |
b46c79a1 | 5946 | if (resolve_args (arglist, complain) == NULL) |
ffbf5813 JJ |
5947 | result = error_mark_node; |
5948 | else | |
5ade1ed2 | 5949 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
fcb9363e | 5950 | |
4eb24e01 JM |
5951 | if (trivial_fn_p (cand->fn)) |
5952 | /* There won't be a CALL_EXPR. */; | |
5953 | else if (result && result != error_mark_node) | |
fcb9363e | 5954 | { |
4eb24e01 JM |
5955 | tree call = extract_call_expr (result); |
5956 | CALL_EXPR_OPERATOR_SYNTAX (call) = true; | |
5957 | ||
5958 | if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn)) | |
5959 | /* This prevents build_new_function_call from discarding this | |
5960 | function during instantiation of the enclosing template. */ | |
5961 | KOENIG_LOOKUP_P (call) = 1; | |
5962 | ||
5963 | /* Specify evaluation order as per P0145R2. */ | |
5964 | CALL_EXPR_ORDERED_ARGS (call) = false; | |
5965 | switch (op_is_ordered (code)) | |
5966 | { | |
5967 | case -1: | |
5968 | CALL_EXPR_REVERSE_ARGS (call) = true; | |
5969 | break; | |
5970 | ||
5971 | case 1: | |
5972 | CALL_EXPR_ORDERED_ARGS (call) = true; | |
5973 | break; | |
5974 | ||
5975 | default: | |
5976 | break; | |
5977 | } | |
fcb9363e | 5978 | } |
5bd61841 MM |
5979 | } |
5980 | else | |
d11ad92e | 5981 | { |
4fe2a1a7 | 5982 | /* Give any warnings we noticed during overload resolution. */ |
5ade1ed2 | 5983 | if (cand->warnings && (complain & tf_warning)) |
4fe2a1a7 JM |
5984 | { |
5985 | struct candidate_warning *w; | |
5986 | for (w = cand->warnings; w; w = w->next) | |
b40e334f | 5987 | joust (cand, w->loser, 1, complain); |
4fe2a1a7 JM |
5988 | } |
5989 | ||
5bd61841 MM |
5990 | /* Check for comparison of different enum types. */ |
5991 | switch (code) | |
5992 | { | |
5993 | case GT_EXPR: | |
5994 | case LT_EXPR: | |
5995 | case GE_EXPR: | |
5996 | case LE_EXPR: | |
5997 | case EQ_EXPR: | |
5998 | case NE_EXPR: | |
c8094d83 MS |
5999 | if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE |
6000 | && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE | |
5bd61841 | 6001 | && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) |
5ade1ed2 DG |
6002 | != TYPE_MAIN_VARIANT (TREE_TYPE (arg2))) |
6003 | && (complain & tf_warning)) | |
5bd61841 | 6004 | { |
a3299096 MM |
6005 | warning (OPT_Wenum_compare, |
6006 | "comparison between %q#T and %q#T", | |
0cbd7506 | 6007 | TREE_TYPE (arg1), TREE_TYPE (arg2)); |
5bd61841 MM |
6008 | } |
6009 | break; | |
6010 | default: | |
6011 | break; | |
6012 | } | |
6013 | ||
6014 | /* We need to strip any leading REF_BIND so that bitfields | |
6015 | don't cause errors. This should not remove any important | |
6016 | conversions, because builtins don't apply to class | |
6017 | objects directly. */ | |
6018 | conv = cand->convs[0]; | |
6019 | if (conv->kind == ck_ref_bind) | |
40703fdf | 6020 | conv = next_conversion (conv); |
5ade1ed2 | 6021 | arg1 = convert_like (conv, arg1, complain); |
ca409efd | 6022 | |
5bd61841 MM |
6023 | if (arg2) |
6024 | { | |
8d0d1915 JM |
6025 | conv = cand->convs[1]; |
6026 | if (conv->kind == ck_ref_bind) | |
6027 | conv = next_conversion (conv); | |
6028 | else | |
6029 | arg2 = decay_conversion (arg2, complain); | |
6030 | ||
ca409efd | 6031 | /* We need to call warn_logical_operator before |
8d0d1915 JM |
6032 | converting arg2 to a boolean_type, but after |
6033 | decaying an enumerator to its value. */ | |
ca409efd | 6034 | if (complain & tf_warning) |
4fe977f2 | 6035 | warn_logical_operator (loc, code, boolean_type_node, |
f479b43d JM |
6036 | code_orig_arg1, arg1, |
6037 | code_orig_arg2, arg2); | |
ca409efd | 6038 | |
5ade1ed2 | 6039 | arg2 = convert_like (conv, arg2, complain); |
5bd61841 MM |
6040 | } |
6041 | if (arg3) | |
6042 | { | |
6043 | conv = cand->convs[2]; | |
6044 | if (conv->kind == ck_ref_bind) | |
40703fdf | 6045 | conv = next_conversion (conv); |
5ade1ed2 | 6046 | arg3 = convert_like (conv, arg3, complain); |
5bd61841 | 6047 | } |
63a08740 | 6048 | |
d11ad92e MS |
6049 | } |
6050 | } | |
6051 | ||
5bd61841 MM |
6052 | user_defined_result_ready: |
6053 | ||
6054 | /* Free all the conversions we allocated. */ | |
6055 | obstack_free (&conversion_obstack, p); | |
6056 | ||
6057 | if (result || result_valid_p) | |
6058 | return result; | |
c73964b2 | 6059 | |
8dc2b103 | 6060 | builtin: |
c73964b2 MS |
6061 | switch (code) |
6062 | { | |
6063 | case MODIFY_EXPR: | |
4f2e1536 | 6064 | return cp_build_modify_expr (loc, arg1, code2, arg2, complain); |
c73964b2 MS |
6065 | |
6066 | case INDIRECT_REF: | |
dd865ef6 | 6067 | return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain); |
c73964b2 | 6068 | |
63a08740 DM |
6069 | case TRUTH_ANDIF_EXPR: |
6070 | case TRUTH_ORIF_EXPR: | |
6071 | case TRUTH_AND_EXPR: | |
6072 | case TRUTH_OR_EXPR: | |
cd95a0d5 MM |
6073 | if (complain & tf_warning) |
6074 | warn_logical_operator (loc, code, boolean_type_node, | |
f479b43d JM |
6075 | code_orig_arg1, arg1, |
6076 | code_orig_arg2, arg2); | |
ca409efd | 6077 | /* Fall through. */ |
c73964b2 MS |
6078 | case GT_EXPR: |
6079 | case LT_EXPR: | |
6080 | case GE_EXPR: | |
6081 | case LE_EXPR: | |
6082 | case EQ_EXPR: | |
6083 | case NE_EXPR: | |
cd95a0d5 MM |
6084 | if ((complain & tf_warning) |
6085 | && ((code_orig_arg1 == BOOLEAN_TYPE) | |
6086 | ^ (code_orig_arg2 == BOOLEAN_TYPE))) | |
f479b43d | 6087 | maybe_warn_bool_compare (loc, code, arg1, arg2); |
05b28fd6 | 6088 | if (complain & tf_warning && warn_tautological_compare) |
38e5f045 | 6089 | warn_tautological_cmp (loc, code, arg1, arg2); |
04159acf MP |
6090 | /* Fall through. */ |
6091 | case PLUS_EXPR: | |
6092 | case MINUS_EXPR: | |
6093 | case MULT_EXPR: | |
6094 | case TRUNC_DIV_EXPR: | |
c73964b2 MS |
6095 | case MAX_EXPR: |
6096 | case MIN_EXPR: | |
6097 | case LSHIFT_EXPR: | |
6098 | case RSHIFT_EXPR: | |
6099 | case TRUNC_MOD_EXPR: | |
6100 | case BIT_AND_EXPR: | |
6101 | case BIT_IOR_EXPR: | |
6102 | case BIT_XOR_EXPR: | |
3c1247f0 | 6103 | return cp_build_binary_op (loc, code, arg1, arg2, complain); |
c73964b2 | 6104 | |
392e3d51 | 6105 | case UNARY_PLUS_EXPR: |
c73964b2 MS |
6106 | case NEGATE_EXPR: |
6107 | case BIT_NOT_EXPR: | |
6108 | case TRUTH_NOT_EXPR: | |
6109 | case PREINCREMENT_EXPR: | |
6110 | case POSTINCREMENT_EXPR: | |
6111 | case PREDECREMENT_EXPR: | |
6112 | case POSTDECREMENT_EXPR: | |
37c46b43 MS |
6113 | case REALPART_EXPR: |
6114 | case IMAGPART_EXPR: | |
6908120a | 6115 | case ABS_EXPR: |
5ade1ed2 | 6116 | return cp_build_unary_op (code, arg1, candidates != 0, complain); |
c73964b2 MS |
6117 | |
6118 | case ARRAY_REF: | |
3a11c665 | 6119 | return cp_build_array_ref (input_location, arg1, arg2, complain); |
c73964b2 | 6120 | |
c73964b2 | 6121 | case MEMBER_REF: |
5e54f81d | 6122 | return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR, |
5ade1ed2 | 6123 | complain), |
89fcabaf | 6124 | arg2, complain); |
c73964b2 MS |
6125 | |
6126 | /* The caller will deal with these. */ | |
6127 | case ADDR_EXPR: | |
6128 | case COMPONENT_REF: | |
6129 | case COMPOUND_EXPR: | |
6130 | return NULL_TREE; | |
6131 | ||
6132 | default: | |
8dc2b103 | 6133 | gcc_unreachable (); |
c73964b2 | 6134 | } |
8dc2b103 | 6135 | return NULL_TREE; |
c73964b2 MS |
6136 | } |
6137 | ||
575bfb00 LC |
6138 | /* Wrapper for above. */ |
6139 | ||
6140 | tree | |
a14feb3c | 6141 | build_new_op (const op_location_t &loc, enum tree_code code, int flags, |
4fe977f2 | 6142 | tree arg1, tree arg2, tree arg3, |
6904f4b4 | 6143 | tree *overload, tsubst_flags_t complain) |
575bfb00 LC |
6144 | { |
6145 | tree ret; | |
6146 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
4fe977f2 PC |
6147 | ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3, |
6148 | overload, complain); | |
575bfb00 LC |
6149 | timevar_cond_stop (TV_OVERLOAD, subtime); |
6150 | return ret; | |
6151 | } | |
6152 | ||
4eb24e01 JM |
6153 | /* CALL was returned by some call-building function; extract the actual |
6154 | CALL_EXPR from any bits that have been tacked on, e.g. by | |
6155 | convert_from_reference. */ | |
6156 | ||
6157 | tree | |
6158 | extract_call_expr (tree call) | |
6159 | { | |
6160 | while (TREE_CODE (call) == COMPOUND_EXPR) | |
6161 | call = TREE_OPERAND (call, 1); | |
6162 | if (REFERENCE_REF_P (call)) | |
6163 | call = TREE_OPERAND (call, 0); | |
6164 | if (TREE_CODE (call) == TARGET_EXPR) | |
6165 | call = TARGET_EXPR_INITIAL (call); | |
6166 | gcc_assert (TREE_CODE (call) == CALL_EXPR | |
6167 | || TREE_CODE (call) == AGGR_INIT_EXPR | |
6168 | || call == error_mark_node); | |
6169 | return call; | |
6170 | } | |
6171 | ||
12101053 JM |
6172 | /* Returns true if FN has two parameters, of which the second has type |
6173 | size_t. */ | |
6174 | ||
6175 | static bool | |
6176 | second_parm_is_size_t (tree fn) | |
6177 | { | |
6178 | tree t = FUNCTION_ARG_CHAIN (fn); | |
af63ba4b JM |
6179 | if (!t || !same_type_p (TREE_VALUE (t), size_type_node)) |
6180 | return false; | |
6181 | t = TREE_CHAIN (t); | |
6182 | if (t == void_list_node) | |
6183 | return true; | |
2e1c20b1 | 6184 | if (aligned_new_threshold && t |
af63ba4b JM |
6185 | && same_type_p (TREE_VALUE (t), align_type_node) |
6186 | && TREE_CHAIN (t) == void_list_node) | |
6187 | return true; | |
6188 | return false; | |
6189 | } | |
6190 | ||
6191 | /* True if T, an allocation function, has std::align_val_t as its second | |
6192 | argument. */ | |
6193 | ||
6194 | bool | |
6195 | aligned_allocation_fn_p (tree t) | |
6196 | { | |
2e1c20b1 | 6197 | if (!aligned_new_threshold) |
af63ba4b JM |
6198 | return false; |
6199 | ||
6200 | tree a = FUNCTION_ARG_CHAIN (t); | |
6201 | return (a && same_type_p (TREE_VALUE (a), align_type_node)); | |
6202 | } | |
6203 | ||
a6bb6b07 JM |
6204 | /* True if T is std::destroying_delete_t. */ |
6205 | ||
6206 | static bool | |
6207 | std_destroying_delete_t_p (tree t) | |
6208 | { | |
6209 | return (TYPE_CONTEXT (t) == std_node | |
6210 | && id_equal (TYPE_IDENTIFIER (t), "destroying_delete_t")); | |
6211 | } | |
6212 | ||
6213 | /* A deallocation function with at least two parameters whose second parameter | |
6214 | type is of type std::destroying_delete_t is a destroying operator delete. A | |
6215 | destroying operator delete shall be a class member function named operator | |
6216 | delete. [ Note: Array deletion cannot use a destroying operator | |
6217 | delete. --end note ] */ | |
6218 | ||
6219 | tree | |
6220 | destroying_delete_p (tree t) | |
6221 | { | |
6222 | tree a = TYPE_ARG_TYPES (TREE_TYPE (t)); | |
6223 | if (!a || !TREE_CHAIN (a)) | |
6224 | return NULL_TREE; | |
6225 | tree type = TREE_VALUE (TREE_CHAIN (a)); | |
6226 | return std_destroying_delete_t_p (type) ? type : NULL_TREE; | |
6227 | } | |
6228 | ||
af63ba4b JM |
6229 | /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation |
6230 | function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of | |
6231 | std::align_val_t. */ | |
6232 | ||
6233 | static bool | |
6234 | aligned_deallocation_fn_p (tree t) | |
6235 | { | |
2e1c20b1 | 6236 | if (!aligned_new_threshold) |
af63ba4b JM |
6237 | return false; |
6238 | ||
6239 | /* A template instance is never a usual deallocation function, | |
6240 | regardless of its signature. */ | |
6241 | if (TREE_CODE (t) == TEMPLATE_DECL | |
528c7559 | 6242 | || primary_template_specialization_p (t)) |
af63ba4b JM |
6243 | return false; |
6244 | ||
6245 | tree a = FUNCTION_ARG_CHAIN (t); | |
a6bb6b07 JM |
6246 | if (destroying_delete_p (t)) |
6247 | a = TREE_CHAIN (a); | |
af63ba4b JM |
6248 | if (same_type_p (TREE_VALUE (a), align_type_node) |
6249 | && TREE_CHAIN (a) == void_list_node) | |
6250 | return true; | |
6251 | if (!same_type_p (TREE_VALUE (a), size_type_node)) | |
6252 | return false; | |
6253 | a = TREE_CHAIN (a); | |
6254 | if (a && same_type_p (TREE_VALUE (a), align_type_node) | |
6255 | && TREE_CHAIN (a) == void_list_node) | |
6256 | return true; | |
6257 | return false; | |
12101053 JM |
6258 | } |
6259 | ||
58926110 JM |
6260 | /* Returns true iff T, an element of an OVERLOAD chain, is a usual |
6261 | deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */ | |
6262 | ||
20b06add | 6263 | bool |
af63ba4b | 6264 | usual_deallocation_fn_p (tree t) |
58926110 JM |
6265 | { |
6266 | /* A template instance is never a usual deallocation function, | |
6267 | regardless of its signature. */ | |
6268 | if (TREE_CODE (t) == TEMPLATE_DECL | |
528c7559 | 6269 | || primary_template_specialization_p (t)) |
58926110 JM |
6270 | return false; |
6271 | ||
6272 | /* If a class T has a member deallocation function named operator delete | |
6273 | with exactly one parameter, then that function is a usual | |
6274 | (non-placement) deallocation function. If class T does not declare | |
6275 | such an operator delete but does declare a member deallocation | |
6276 | function named operator delete with exactly two parameters, the second | |
6277 | of which has type std::size_t (18.2), then this function is a usual | |
6278 | deallocation function. */ | |
20b06add | 6279 | bool global = DECL_NAMESPACE_SCOPE_P (t); |
af63ba4b JM |
6280 | tree chain = FUNCTION_ARG_CHAIN (t); |
6281 | if (!chain) | |
6282 | return false; | |
a6bb6b07 JM |
6283 | if (destroying_delete_p (t)) |
6284 | chain = TREE_CHAIN (chain); | |
af63ba4b | 6285 | if (chain == void_list_node |
12101053 JM |
6286 | || ((!global || flag_sized_deallocation) |
6287 | && second_parm_is_size_t (t))) | |
58926110 | 6288 | return true; |
af63ba4b JM |
6289 | if (aligned_deallocation_fn_p (t)) |
6290 | return true; | |
58926110 JM |
6291 | return false; |
6292 | } | |
6293 | ||
da4768fe JM |
6294 | /* Build a call to operator delete. This has to be handled very specially, |
6295 | because the restrictions on what signatures match are different from all | |
6296 | other call instances. For a normal delete, only a delete taking (void *) | |
6297 | or (void *, size_t) is accepted. For a placement delete, only an exact | |
6298 | match with the placement new is accepted. | |
6299 | ||
6300 | CODE is either DELETE_EXPR or VEC_DELETE_EXPR. | |
0ac7f923 | 6301 | ADDR is the pointer to be deleted. |
da4768fe | 6302 | SIZE is the size of the memory block to be deleted. |
5bd61841 MM |
6303 | GLOBAL_P is true if the delete-expression should not consider |
6304 | class-specific delete operators. | |
63c9a190 | 6305 | PLACEMENT is the corresponding placement new call, or NULL_TREE. |
32a11c08 MM |
6306 | |
6307 | If this call to "operator delete" is being generated as part to | |
6308 | deallocate memory allocated via a new-expression (as per [expr.new] | |
6309 | which requires that if the initialization throws an exception then | |
6310 | we call a deallocation function), then ALLOC_FN is the allocation | |
6311 | function. */ | |
da4768fe JM |
6312 | |
6313 | tree | |
94be8403 | 6314 | build_op_delete_call (enum tree_code code, tree addr, tree size, |
63c9a190 | 6315 | bool global_p, tree placement, |
4b978f96 | 6316 | tree alloc_fn, tsubst_flags_t complain) |
da4768fe | 6317 | { |
ae0ed63a | 6318 | tree fn = NULL_TREE; |
58926110 | 6319 | tree fns, fnname, type, t; |
da4768fe JM |
6320 | |
6321 | if (addr == error_mark_node) | |
6322 | return error_mark_node; | |
6323 | ||
8d4ce389 | 6324 | type = strip_array_types (TREE_TYPE (TREE_TYPE (addr))); |
c3e899c1 | 6325 | |
88a819be | 6326 | fnname = ovl_op_identifier (false, code); |
da4768fe | 6327 | |
c8094d83 | 6328 | if (CLASS_TYPE_P (type) |
6e5bdc64 MM |
6329 | && COMPLETE_TYPE_P (complete_type (type)) |
6330 | && !global_p) | |
734e8cc5 MM |
6331 | /* In [class.free] |
6332 | ||
6333 | If the result of the lookup is ambiguous or inaccessible, or if | |
6334 | the lookup selects a placement deallocation function, the | |
6335 | program is ill-formed. | |
c8094d83 | 6336 | |
cd0be382 | 6337 | Therefore, we ask lookup_fnfields to complain about ambiguity. */ |
734e8cc5 MM |
6338 | { |
6339 | fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1); | |
6340 | if (fns == error_mark_node) | |
6341 | return error_mark_node; | |
6342 | } | |
da4768fe JM |
6343 | else |
6344 | fns = NULL_TREE; | |
6345 | ||
519ebd1e | 6346 | if (fns == NULL_TREE) |
da4768fe JM |
6347 | fns = lookup_name_nonclass (fnname); |
6348 | ||
94a0dd7b | 6349 | /* Strip const and volatile from addr. */ |
a6bb6b07 | 6350 | tree oaddr = addr; |
4b978f96 | 6351 | addr = cp_convert (ptr_type_node, addr, complain); |
94a0dd7b | 6352 | |
da4768fe JM |
6353 | if (placement) |
6354 | { | |
58926110 JM |
6355 | /* "A declaration of a placement deallocation function matches the |
6356 | declaration of a placement allocation function if it has the same | |
6357 | number of parameters and, after parameter transformations (8.3.5), | |
6358 | all parameter types except the first are identical." | |
6359 | ||
6360 | So we build up the function type we want and ask instantiate_type | |
6361 | to get it for us. */ | |
6362 | t = FUNCTION_ARG_CHAIN (alloc_fn); | |
6363 | t = tree_cons (NULL_TREE, ptr_type_node, t); | |
6364 | t = build_function_type (void_type_node, t); | |
6365 | ||
6366 | fn = instantiate_type (t, fns, tf_none); | |
6367 | if (fn == error_mark_node) | |
6368 | return NULL_TREE; | |
3f41ffd8 | 6369 | |
a736411a | 6370 | fn = MAYBE_BASELINK_FUNCTIONS (fn); |
3f41ffd8 | 6371 | |
58926110 JM |
6372 | /* "If the lookup finds the two-parameter form of a usual deallocation |
6373 | function (3.7.4.2) and that function, considered as a placement | |
6374 | deallocation function, would have been selected as a match for the | |
6375 | allocation function, the program is ill-formed." */ | |
12101053 | 6376 | if (second_parm_is_size_t (fn)) |
1e799955 | 6377 | { |
9d975cb6 | 6378 | const char *const msg1 |
12101053 JM |
6379 | = G_("exception cleanup for this placement new selects " |
6380 | "non-placement operator delete"); | |
9d975cb6 | 6381 | const char *const msg2 |
4b1cbcee | 6382 | = G_("%qD is a usual (non-placement) deallocation " |
12101053 JM |
6383 | "function in C++14 (or with -fsized-deallocation)"); |
6384 | ||
5cd25f07 JM |
6385 | /* But if the class has an operator delete (void *), then that is |
6386 | the usual deallocation function, so we shouldn't complain | |
6387 | about using the operator delete (void *, size_t). */ | |
12101053 | 6388 | if (DECL_CLASS_SCOPE_P (fn)) |
a736411a NS |
6389 | for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); |
6390 | iter; ++iter) | |
12101053 | 6391 | { |
a736411a | 6392 | tree elt = *iter; |
af63ba4b | 6393 | if (usual_deallocation_fn_p (elt) |
12101053 JM |
6394 | && FUNCTION_ARG_CHAIN (elt) == void_list_node) |
6395 | goto ok; | |
6396 | } | |
6397 | /* Before C++14 a two-parameter global deallocation function is | |
6398 | always a placement deallocation function, but warn if | |
6399 | -Wc++14-compat. */ | |
6400 | else if (!flag_sized_deallocation) | |
5cd25f07 | 6401 | { |
097f82ec DM |
6402 | if (complain & tf_warning) |
6403 | { | |
6404 | auto_diagnostic_group d; | |
6405 | if (warning (OPT_Wc__14_compat, msg1)) | |
6406 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); | |
6407 | } | |
12101053 | 6408 | goto ok; |
5cd25f07 | 6409 | } |
12101053 JM |
6410 | |
6411 | if (complain & tf_warning_or_error) | |
4b978f96 | 6412 | { |
097f82ec | 6413 | auto_diagnostic_group d; |
12101053 JM |
6414 | if (permerror (input_location, msg1)) |
6415 | { | |
6416 | /* Only mention C++14 for namespace-scope delete. */ | |
6417 | if (DECL_NAMESPACE_SCOPE_P (fn)) | |
4b1cbcee | 6418 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); |
12101053 | 6419 | else |
4b1cbcee PC |
6420 | inform (DECL_SOURCE_LOCATION (fn), |
6421 | "%qD is a usual (non-placement) deallocation " | |
12101053 JM |
6422 | "function", fn); |
6423 | } | |
4b978f96 PC |
6424 | } |
6425 | else | |
6426 | return error_mark_node; | |
5cd25f07 | 6427 | ok:; |
1e799955 | 6428 | } |
3f41ffd8 | 6429 | } |
58926110 JM |
6430 | else |
6431 | /* "Any non-placement deallocation function matches a non-placement | |
6432 | allocation function. If the lookup finds a single matching | |
6433 | deallocation function, that function will be called; otherwise, no | |
6434 | deallocation function will be called." */ | |
a736411a | 6435 | for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter) |
58926110 | 6436 | { |
a736411a | 6437 | tree elt = *iter; |
af63ba4b | 6438 | if (usual_deallocation_fn_p (elt)) |
58926110 | 6439 | { |
af63ba4b | 6440 | if (!fn) |
20b06add | 6441 | { |
af63ba4b JM |
6442 | fn = elt; |
6443 | continue; | |
20b06add | 6444 | } |
af63ba4b JM |
6445 | |
6446 | /* -- If the type has new-extended alignment, a function with a | |
6447 | parameter of type std::align_val_t is preferred; otherwise a | |
6448 | function without such a parameter is preferred. If exactly one | |
6449 | preferred function is found, that function is selected and the | |
6450 | selection process terminates. If more than one preferred | |
6451 | function is found, all non-preferred functions are eliminated | |
6452 | from further consideration. */ | |
2e1c20b1 | 6453 | if (aligned_new_threshold) |
af63ba4b JM |
6454 | { |
6455 | bool want_align = type_has_new_extended_alignment (type); | |
6456 | bool fn_align = aligned_deallocation_fn_p (fn); | |
6457 | bool elt_align = aligned_deallocation_fn_p (elt); | |
6458 | ||
6459 | if (elt_align != fn_align) | |
6460 | { | |
6461 | if (want_align == elt_align) | |
6462 | fn = elt; | |
6463 | continue; | |
6464 | } | |
6465 | } | |
6466 | ||
6467 | /* -- If the deallocation functions have class scope, the one | |
6468 | without a parameter of type std::size_t is selected. */ | |
6469 | bool want_size; | |
6470 | if (DECL_CLASS_SCOPE_P (fn)) | |
6471 | want_size = false; | |
6472 | ||
6473 | /* -- If the type is complete and if, for the second alternative | |
6474 | (delete array) only, the operand is a pointer to a class type | |
6475 | with a non-trivial destructor or a (possibly multi-dimensional) | |
6476 | array thereof, the function with a parameter of type std::size_t | |
6477 | is selected. | |
6478 | ||
6479 | -- Otherwise, it is unspecified whether a deallocation function | |
6480 | with a parameter of type std::size_t is selected. */ | |
20b06add JM |
6481 | else |
6482 | { | |
af63ba4b | 6483 | want_size = COMPLETE_TYPE_P (type); |
20b06add JM |
6484 | if (code == VEC_DELETE_EXPR |
6485 | && !TYPE_VEC_NEW_USES_COOKIE (type)) | |
6486 | /* We need a cookie to determine the array size. */ | |
6487 | want_size = false; | |
20b06add | 6488 | } |
af63ba4b JM |
6489 | bool fn_size = second_parm_is_size_t (fn); |
6490 | bool elt_size = second_parm_is_size_t (elt); | |
6491 | gcc_assert (fn_size != elt_size); | |
6492 | if (want_size == elt_size) | |
6493 | fn = elt; | |
58926110 JM |
6494 | } |
6495 | } | |
3f41ffd8 MM |
6496 | |
6497 | /* If we have a matching function, call it. */ | |
6498 | if (fn) | |
6499 | { | |
58926110 | 6500 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); |
3f41ffd8 MM |
6501 | |
6502 | /* If the FN is a member function, make sure that it is | |
6503 | accessible. */ | |
58926110 | 6504 | if (BASELINK_P (fns)) |
0e69fdf0 PC |
6505 | perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn, |
6506 | complain); | |
3f41ffd8 | 6507 | |
67a6e816 JM |
6508 | /* Core issue 901: It's ok to new a type with deleted delete. */ |
6509 | if (DECL_DELETED_FN (fn) && alloc_fn) | |
6510 | return NULL_TREE; | |
6511 | ||
a6111661 JM |
6512 | if (placement) |
6513 | { | |
6514 | /* The placement args might not be suitable for overload | |
6515 | resolution at this point, so build the call directly. */ | |
94a0dd7b | 6516 | int nargs = call_expr_nargs (placement); |
86b8fed1 | 6517 | tree *argarray = XALLOCAVEC (tree, nargs); |
94a0dd7b SL |
6518 | int i; |
6519 | argarray[0] = addr; | |
6520 | for (i = 1; i < nargs; i++) | |
6521 | argarray[i] = CALL_EXPR_ARG (placement, i); | |
9f635aba PC |
6522 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
6523 | return error_mark_node; | |
e2e03032 | 6524 | return build_cxx_call (fn, nargs, argarray, complain); |
a6111661 JM |
6525 | } |
6526 | else | |
94a0dd7b | 6527 | { |
a6bb6b07 JM |
6528 | tree destroying = destroying_delete_p (fn); |
6529 | if (destroying) | |
6530 | { | |
6531 | /* Strip const and volatile from addr but retain the type of the | |
6532 | object. */ | |
6533 | tree rtype = TREE_TYPE (TREE_TYPE (oaddr)); | |
6534 | rtype = cv_unqualified (rtype); | |
6535 | rtype = TYPE_POINTER_TO (rtype); | |
6536 | addr = cp_convert (rtype, oaddr, complain); | |
6537 | destroying = build_functional_cast (destroying, NULL_TREE, | |
6538 | complain); | |
6539 | } | |
6540 | ||
c166b898 | 6541 | tree ret; |
928d850f | 6542 | vec<tree, va_gc> *args = make_tree_vector (); |
9771b263 | 6543 | args->quick_push (addr); |
a6bb6b07 JM |
6544 | if (destroying) |
6545 | args->quick_push (destroying); | |
af63ba4b | 6546 | if (second_parm_is_size_t (fn)) |
9771b263 | 6547 | args->quick_push (size); |
af63ba4b JM |
6548 | if (aligned_deallocation_fn_p (fn)) |
6549 | { | |
6550 | tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type)); | |
6551 | args->quick_push (al); | |
6552 | } | |
4b978f96 | 6553 | ret = cp_build_function_call_vec (fn, &args, complain); |
928d850f | 6554 | release_tree_vector (args); |
c166b898 | 6555 | return ret; |
94a0dd7b | 6556 | } |
519ebd1e JM |
6557 | } |
6558 | ||
32a11c08 MM |
6559 | /* [expr.new] |
6560 | ||
6561 | If no unambiguous matching deallocation function can be found, | |
6562 | propagating the exception does not cause the object's memory to | |
6563 | be freed. */ | |
6564 | if (alloc_fn) | |
6565 | { | |
4b978f96 PC |
6566 | if ((complain & tf_warning) |
6567 | && !placement) | |
bcac2b89 | 6568 | warning (0, "no corresponding deallocation function for %qD", |
32a11c08 MM |
6569 | alloc_fn); |
6570 | return NULL_TREE; | |
6571 | } | |
da4768fe | 6572 | |
4b978f96 PC |
6573 | if (complain & tf_error) |
6574 | error ("no suitable %<operator %s%> for %qT", | |
88a819be | 6575 | OVL_OP_INFO (false, code)->name, type); |
da4768fe JM |
6576 | return error_mark_node; |
6577 | } | |
6578 | ||
03f6d32e DM |
6579 | /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL |
6580 | in the diagnostics. | |
6581 | ||
6582 | If ISSUE_ERROR is true, then issue an error about the | |
6583 | access, followed by a note showing the declaration. | |
6584 | Otherwise, just show the note. */ | |
6585 | ||
6586 | void | |
6587 | complain_about_access (tree decl, tree diag_decl, bool issue_error) | |
6588 | { | |
6589 | if (TREE_PRIVATE (decl)) | |
6590 | { | |
6591 | if (issue_error) | |
6592 | error ("%q#D is private within this context", diag_decl); | |
6593 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6594 | "declared private here"); | |
6595 | } | |
6596 | else if (TREE_PROTECTED (decl)) | |
6597 | { | |
6598 | if (issue_error) | |
6599 | error ("%q#D is protected within this context", diag_decl); | |
6600 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6601 | "declared protected here"); | |
6602 | } | |
6603 | else | |
6604 | { | |
6605 | if (issue_error) | |
6606 | error ("%q#D is inaccessible within this context", diag_decl); | |
6607 | inform (DECL_SOURCE_LOCATION (diag_decl), "declared here"); | |
6608 | } | |
6609 | } | |
6610 | ||
38afd588 | 6611 | /* If the current scope isn't allowed to access DECL along |
d6479fe7 | 6612 | BASETYPE_PATH, give an error. The most derived class in |
02022f3a SM |
6613 | BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is |
6614 | the declaration to use in the error diagnostic. */ | |
da4768fe | 6615 | |
94be8403 | 6616 | bool |
0e69fdf0 | 6617 | enforce_access (tree basetype_path, tree decl, tree diag_decl, |
10791753 | 6618 | tsubst_flags_t complain, access_failure_info *afi) |
c73964b2 | 6619 | { |
50bc768d | 6620 | gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO); |
c8094d83 | 6621 | |
31f7f784 JM |
6622 | if (flag_new_inheriting_ctors |
6623 | && DECL_INHERITED_CTOR (decl)) | |
6624 | { | |
6625 | /* 7.3.3/18: The additional constructors are accessible if they would be | |
6626 | accessible when used to construct an object of the corresponding base | |
6627 | class. */ | |
6628 | decl = strip_inheriting_ctors (decl); | |
c16b872c JM |
6629 | basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl), |
6630 | ba_any, NULL, complain); | |
31f7f784 JM |
6631 | } |
6632 | ||
18e4be85 | 6633 | if (!accessible_p (basetype_path, decl, true)) |
c73964b2 | 6634 | { |
03f6d32e DM |
6635 | if (flag_new_inheriting_ctors) |
6636 | diag_decl = strip_inheriting_ctors (diag_decl); | |
0e69fdf0 | 6637 | if (complain & tf_error) |
03f6d32e DM |
6638 | complain_about_access (decl, diag_decl, true); |
6639 | if (afi) | |
6640 | afi->record_access_failure (basetype_path, decl, diag_decl); | |
94be8403 | 6641 | return false; |
c73964b2 | 6642 | } |
d6479fe7 | 6643 | |
94be8403 | 6644 | return true; |
c73964b2 MS |
6645 | } |
6646 | ||
4f8163b1 MM |
6647 | /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a |
6648 | bitwise or of LOOKUP_* values. If any errors are warnings are | |
6649 | generated, set *DIAGNOSTIC_FN to "error" or "warning", | |
6650 | respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN | |
6651 | to NULL. */ | |
6652 | ||
6653 | static tree | |
c8094d83 | 6654 | build_temp (tree expr, tree type, int flags, |
248ce2f8 | 6655 | diagnostic_t *diagnostic_kind, tsubst_flags_t complain) |
4f8163b1 MM |
6656 | { |
6657 | int savew, savee; | |
9771b263 | 6658 | vec<tree, va_gc> *args; |
c8094d83 | 6659 | |
b7558a2c JM |
6660 | *diagnostic_kind = DK_UNSPECIFIED; |
6661 | ||
b7558a2c JM |
6662 | /* If the source is a packed field, calling the copy constructor will require |
6663 | binding the field to the reference parameter to the copy constructor, and | |
6664 | we'll end up with an infinite loop. If we can use a bitwise copy, then | |
6665 | do that now. */ | |
6666 | if ((lvalue_kind (expr) & clk_packed) | |
6667 | && CLASS_TYPE_P (TREE_TYPE (expr)) | |
6668 | && !type_has_nontrivial_copy_init (TREE_TYPE (expr))) | |
6669 | return get_target_expr_sfinae (expr, complain); | |
6670 | ||
37e99116 | 6671 | savew = warningcount + werrorcount, savee = errorcount; |
c166b898 ILT |
6672 | args = make_tree_vector_single (expr); |
6673 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
248ce2f8 | 6674 | &args, type, flags, complain); |
c166b898 | 6675 | release_tree_vector (args); |
37e99116 | 6676 | if (warningcount + werrorcount > savew) |
71205d17 | 6677 | *diagnostic_kind = DK_WARNING; |
4f8163b1 | 6678 | else if (errorcount > savee) |
71205d17 | 6679 | *diagnostic_kind = DK_ERROR; |
4f8163b1 MM |
6680 | return expr; |
6681 | } | |
c8094d83 | 6682 | |
07231d4f | 6683 | /* Perform warnings about peculiar, but valid, conversions from/to NULL. |
752e7593 | 6684 | Also handle a subset of zero as null warnings. |
07231d4f | 6685 | EXPR is implicitly converted to type TOTYPE. |
1f7f19c4 DM |
6686 | FN and ARGNUM are used for diagnostics. */ |
6687 | ||
6688 | static void | |
07231d4f | 6689 | conversion_null_warnings (tree totype, tree expr, tree fn, int argnum) |
1f7f19c4 | 6690 | { |
1f7f19c4 | 6691 | /* Issue warnings about peculiar, but valid, uses of NULL. */ |
9a004410 | 6692 | if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE |
6dc99b79 | 6693 | && ARITHMETIC_TYPE_P (totype)) |
1f7f19c4 | 6694 | { |
f11854d4 DM |
6695 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
6696 | loc = expansion_point_location_if_in_system_header (loc); | |
1f7f19c4 | 6697 | if (fn) |
f11854d4 DM |
6698 | { |
6699 | auto_diagnostic_group d; | |
6700 | if (warning_at (loc, OPT_Wconversion_null, | |
6701 | "passing NULL to non-pointer argument %P of %qD", | |
6702 | argnum, fn)) | |
6703 | inform (get_fndecl_argument_location (fn, argnum), | |
6704 | " declared here"); | |
6705 | } | |
1f7f19c4 | 6706 | else |
70dc395a | 6707 | warning_at (loc, OPT_Wconversion_null, |
6dc99b79 | 6708 | "converting to non-pointer type %qT from NULL", totype); |
1f7f19c4 DM |
6709 | } |
6710 | ||
1f7f19c4 | 6711 | /* Issue warnings if "false" is converted to a NULL pointer */ |
92b4d64c PC |
6712 | else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE |
6713 | && TYPE_PTR_P (totype)) | |
2e1df0f0 | 6714 | { |
f11854d4 | 6715 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
2e1df0f0 | 6716 | if (fn) |
f11854d4 DM |
6717 | { |
6718 | auto_diagnostic_group d; | |
6719 | if (warning_at (loc, OPT_Wconversion_null, | |
6720 | "converting %<false%> to pointer type for argument " | |
6721 | "%P of %qD", argnum, fn)) | |
6722 | inform (get_fndecl_argument_location (fn, argnum), | |
6723 | " declared here"); | |
6724 | } | |
2e1df0f0 | 6725 | else |
f11854d4 | 6726 | warning_at (loc, OPT_Wconversion_null, |
6dc99b79 | 6727 | "converting %<false%> to pointer type %qT", totype); |
2e1df0f0 | 6728 | } |
752e7593 VV |
6729 | /* Handle zero as null pointer warnings for cases other |
6730 | than EQ_EXPR and NE_EXPR */ | |
6731 | else if (null_ptr_cst_p (expr) && | |
6732 | (TYPE_PTR_OR_PTRMEM_P (totype) || NULLPTR_TYPE_P (totype))) | |
6733 | { | |
620e594b | 6734 | location_t loc = |
752e7593 VV |
6735 | expansion_point_location_if_in_system_header (input_location); |
6736 | maybe_warn_zero_as_null_pointer_constant (expr, loc); | |
6737 | } | |
1f7f19c4 | 6738 | } |
4f8163b1 | 6739 | |
3f55e16a JM |
6740 | /* We gave a diagnostic during a conversion. If this was in the second |
6741 | standard conversion sequence of a user-defined conversion sequence, say | |
6742 | which user-defined conversion. */ | |
6743 | ||
6744 | static void | |
6745 | maybe_print_user_conv_context (conversion *convs) | |
6746 | { | |
6747 | if (convs->user_conv_p) | |
6748 | for (conversion *t = convs; t; t = next_conversion (t)) | |
6749 | if (t->kind == ck_user) | |
6750 | { | |
6751 | print_z_candidate (0, " after user-defined conversion:", | |
6752 | t->cand); | |
6753 | break; | |
6754 | } | |
6755 | } | |
6756 | ||
9003adc7 DM |
6757 | /* Locate the parameter with the given index within FNDECL. |
6758 | ARGNUM is zero based, -1 indicates the `this' argument of a method. | |
6759 | Return the location of the FNDECL itself if there are problems. */ | |
6760 | ||
672c767b | 6761 | location_t |
9003adc7 DM |
6762 | get_fndecl_argument_location (tree fndecl, int argnum) |
6763 | { | |
f11854d4 DM |
6764 | /* The locations of implicitly-declared functions are likely to be |
6765 | more meaningful than those of their parameters. */ | |
6766 | if (DECL_ARTIFICIAL (fndecl)) | |
6767 | return DECL_SOURCE_LOCATION (fndecl); | |
6768 | ||
9003adc7 DM |
6769 | int i; |
6770 | tree param; | |
6771 | ||
6772 | /* Locate param by index within DECL_ARGUMENTS (fndecl). */ | |
6773 | for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl); | |
6774 | i < argnum && param; | |
6775 | i++, param = TREE_CHAIN (param)) | |
6776 | ; | |
6777 | ||
6778 | /* If something went wrong (e.g. if we have a builtin and thus no arguments), | |
6779 | return the location of FNDECL. */ | |
6780 | if (param == NULL) | |
6781 | return DECL_SOURCE_LOCATION (fndecl); | |
6782 | ||
6783 | return DECL_SOURCE_LOCATION (param); | |
6784 | } | |
6785 | ||
f11854d4 DM |
6786 | /* If FNDECL is non-NULL, issue a note highlighting ARGNUM |
6787 | within its declaration (or the fndecl itself if something went | |
6788 | wrong). */ | |
6789 | ||
6790 | void | |
6791 | maybe_inform_about_fndecl_for_bogus_argument_init (tree fn, int argnum) | |
6792 | { | |
6793 | if (fn) | |
6794 | inform (get_fndecl_argument_location (fn, argnum), | |
6795 | " initializing argument %P of %qD", argnum, fn); | |
6796 | } | |
6797 | ||
3fe18f1d MM |
6798 | /* Perform the conversions in CONVS on the expression EXPR. FN and |
6799 | ARGNUM are used for diagnostics. ARGNUM is zero based, -1 | |
838dfd8a | 6800 | indicates the `this' argument of a method. INNER is nonzero when |
78fe06c2 | 6801 | being called to continue a conversion chain. It is negative when a |
3fe18f1d MM |
6802 | reference binding will be applied, positive otherwise. If |
6803 | ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious | |
33c25e5c MM |
6804 | conversions will be emitted if appropriate. If C_CAST_P is true, |
6805 | this conversion is coming from a C-style cast; in that case, | |
6806 | conversions to inaccessible bases are permitted. */ | |
c73964b2 MS |
6807 | |
6808 | static tree | |
c8094d83 | 6809 | convert_like_real (conversion *convs, tree expr, tree fn, int argnum, |
bf31620c | 6810 | bool issue_conversion_warnings, |
5ade1ed2 | 6811 | bool c_cast_p, tsubst_flags_t complain) |
c73964b2 | 6812 | { |
5bd61841 | 6813 | tree totype = convs->type; |
71205d17 | 6814 | diagnostic_t diag_kind; |
156d614f | 6815 | int flags; |
6bdfada4 | 6816 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
5e818b93 | 6817 | |
7888350f JM |
6818 | if (convs->bad_p && !(complain & tf_error)) |
6819 | return error_mark_node; | |
6820 | ||
5bd61841 MM |
6821 | if (convs->bad_p |
6822 | && convs->kind != ck_user | |
c5adc427 | 6823 | && convs->kind != ck_list |
5bd61841 | 6824 | && convs->kind != ck_ambig |
940023f4 | 6825 | && (convs->kind != ck_ref_bind |
63a18c8e | 6826 | || (convs->user_conv_p && next_conversion (convs)->bad_p)) |
11074000 JM |
6827 | && (convs->kind != ck_rvalue |
6828 | || SCALAR_TYPE_P (totype)) | |
6b3a665c | 6829 | && convs->kind != ck_base) |
d11ad92e | 6830 | { |
11074000 | 6831 | bool complained = false; |
5bd61841 | 6832 | conversion *t = convs; |
4ea08463 JM |
6833 | |
6834 | /* Give a helpful error if this is bad because of excess braces. */ | |
6835 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6836 | && SCALAR_TYPE_P (totype) | |
6837 | && CONSTRUCTOR_NELTS (expr) > 0 | |
6838 | && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value)) | |
11074000 JM |
6839 | { |
6840 | complained = permerror (loc, "too many braces around initializer " | |
6841 | "for %qT", totype); | |
6842 | while (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6843 | && CONSTRUCTOR_NELTS (expr) == 1) | |
6844 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6845 | } | |
4ea08463 | 6846 | |
3c61a5ba PC |
6847 | /* Give a helpful error if this is bad because a conversion to bool |
6848 | from std::nullptr_t requires direct-initialization. */ | |
6849 | if (NULLPTR_TYPE_P (TREE_TYPE (expr)) | |
6850 | && TREE_CODE (totype) == BOOLEAN_TYPE) | |
f012c8ef | 6851 | complained = permerror (loc, "converting to %qH from %qI requires " |
3c61a5ba PC |
6852 | "direct-initialization", |
6853 | totype, TREE_TYPE (expr)); | |
6854 | ||
3c72114c | 6855 | for (; t ; t = next_conversion (t)) |
d11ad92e | 6856 | { |
b028af11 JM |
6857 | if (t->kind == ck_user && t->cand->reason) |
6858 | { | |
097f82ec | 6859 | auto_diagnostic_group d; |
603a0084 | 6860 | complained = permerror (loc, "invalid user-defined conversion " |
f012c8ef | 6861 | "from %qH to %qI", TREE_TYPE (expr), |
603a0084 PC |
6862 | totype); |
6863 | if (complained) | |
6864 | print_z_candidate (loc, "candidate is:", t->cand); | |
bf31620c | 6865 | expr = convert_like_real (t, expr, fn, argnum, |
b028af11 JM |
6866 | /*issue_conversion_warnings=*/false, |
6867 | /*c_cast_p=*/false, | |
6868 | complain); | |
940023f4 | 6869 | if (convs->kind == ck_ref_bind) |
3f55e16a | 6870 | expr = convert_to_reference (totype, expr, CONV_IMPLICIT, |
4b978f96 PC |
6871 | LOOKUP_NORMAL, NULL_TREE, |
6872 | complain); | |
940023f4 | 6873 | else |
3f55e16a | 6874 | expr = cp_convert (totype, expr, complain); |
f11854d4 DM |
6875 | if (complained) |
6876 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); | |
3f55e16a | 6877 | return expr; |
b028af11 JM |
6878 | } |
6879 | else if (t->kind == ck_user || !t->bad_p) | |
d11ad92e | 6880 | { |
bf31620c | 6881 | expr = convert_like_real (t, expr, fn, argnum, |
33c25e5c | 6882 | /*issue_conversion_warnings=*/false, |
5ade1ed2 DG |
6883 | /*c_cast_p=*/false, |
6884 | complain); | |
d11ad92e MS |
6885 | break; |
6886 | } | |
5bd61841 | 6887 | else if (t->kind == ck_ambig) |
bf31620c | 6888 | return convert_like_real (t, expr, fn, argnum, |
33c25e5c | 6889 | /*issue_conversion_warnings=*/false, |
5ade1ed2 DG |
6890 | /*c_cast_p=*/false, |
6891 | complain); | |
5bd61841 | 6892 | else if (t->kind == ck_identity) |
d11ad92e MS |
6893 | break; |
6894 | } | |
11074000 | 6895 | if (!complained) |
96e6ae57 DM |
6896 | { |
6897 | range_label_for_type_mismatch label (TREE_TYPE (expr), totype); | |
6898 | gcc_rich_location richloc (loc, &label); | |
6899 | complained = permerror (&richloc, | |
6900 | "invalid conversion from %qH to %qI", | |
6901 | TREE_TYPE (expr), totype); | |
6902 | } | |
f11854d4 DM |
6903 | if (complained) |
6904 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); | |
5ade1ed2 | 6905 | |
4b978f96 | 6906 | return cp_convert (totype, expr, complain); |
d11ad92e | 6907 | } |
c8094d83 | 6908 | |
5ade1ed2 | 6909 | if (issue_conversion_warnings && (complain & tf_warning)) |
07231d4f | 6910 | conversion_null_warnings (totype, expr, fn, argnum); |
6fc98adf | 6911 | |
5bd61841 | 6912 | switch (convs->kind) |
c73964b2 | 6913 | { |
5bd61841 | 6914 | case ck_user: |
c73964b2 | 6915 | { |
5bd61841 | 6916 | struct z_candidate *cand = convs->cand; |
1a9de5b6 JM |
6917 | |
6918 | if (cand == NULL) | |
6919 | /* We chose the surrogate function from add_conv_candidate, now we | |
6920 | actually need to build the conversion. */ | |
6921 | cand = build_user_type_conversion_1 (totype, expr, | |
6922 | LOOKUP_NO_CONVERSION, complain); | |
6923 | ||
5e818b93 | 6924 | tree convfn = cand->fn; |
156d614f | 6925 | |
e7838ec9 JM |
6926 | /* When converting from an init list we consider explicit |
6927 | constructors, but actually trying to call one is an error. */ | |
6928 | if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn) | |
20309c6e | 6929 | && BRACE_ENCLOSED_INITIALIZER_P (expr) |
e7838ec9 | 6930 | /* Unless this is for direct-list-initialization. */ |
20309c6e | 6931 | && !CONSTRUCTOR_IS_DIRECT_INIT (expr) |
e7838ec9 JM |
6932 | /* And in C++98 a default constructor can't be explicit. */ |
6933 | && cxx_dialect >= cxx11) | |
6934 | { | |
6935 | if (!(complain & tf_error)) | |
6936 | return error_mark_node; | |
6937 | location_t loc = location_of (expr); | |
6938 | if (CONSTRUCTOR_NELTS (expr) == 0 | |
6939 | && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node) | |
6940 | { | |
097f82ec | 6941 | auto_diagnostic_group d; |
e7838ec9 JM |
6942 | if (pedwarn (loc, 0, "converting to %qT from initializer list " |
6943 | "would use explicit constructor %qD", | |
6944 | totype, convfn)) | |
6945 | inform (loc, "in C++11 and above a default constructor " | |
6946 | "can be explicit"); | |
6947 | } | |
6948 | else | |
6949 | error ("converting to %qT from initializer list would use " | |
6950 | "explicit constructor %qD", totype, convfn); | |
6951 | } | |
6952 | ||
6953 | /* If we're initializing from {}, it's value-initialization. */ | |
2061820e JM |
6954 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) |
6955 | && CONSTRUCTOR_NELTS (expr) == 0 | |
6956 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)) | |
6957 | { | |
e08cc018 | 6958 | bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr); |
73b7d28f PC |
6959 | if (abstract_virtuals_error_sfinae (NULL_TREE, totype, complain)) |
6960 | return error_mark_node; | |
2061820e JM |
6961 | expr = build_value_init (totype, complain); |
6962 | expr = get_target_expr_sfinae (expr, complain); | |
6963 | if (expr != error_mark_node) | |
e08cc018 JM |
6964 | { |
6965 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
6966 | TARGET_EXPR_DIRECT_INIT_P (expr) = direct; | |
6967 | } | |
2061820e JM |
6968 | return expr; |
6969 | } | |
6970 | ||
03a904b5 JJ |
6971 | expr = mark_rvalue_use (expr); |
6972 | ||
36cbfdb0 JM |
6973 | /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow |
6974 | any more UDCs. */ | |
6975 | expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION, | |
6976 | complain); | |
c73964b2 MS |
6977 | |
6978 | /* If this is a constructor or a function returning an aggr type, | |
6979 | we need to build up a TARGET_EXPR. */ | |
5e818b93 | 6980 | if (DECL_CONSTRUCTOR_P (convfn)) |
3f6079dd | 6981 | { |
362115a9 | 6982 | expr = build_cplus_new (totype, expr, complain); |
3f6079dd JM |
6983 | |
6984 | /* Remember that this was list-initialization. */ | |
fe7eb484 | 6985 | if (convs->check_narrowing && expr != error_mark_node) |
3f6079dd JM |
6986 | TARGET_EXPR_LIST_INIT_P (expr) = true; |
6987 | } | |
5e818b93 | 6988 | |
c73964b2 MS |
6989 | return expr; |
6990 | } | |
5bd61841 | 6991 | case ck_identity: |
c5adc427 JM |
6992 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
6993 | { | |
6994 | int nelts = CONSTRUCTOR_NELTS (expr); | |
6995 | if (nelts == 0) | |
2061820e | 6996 | expr = build_value_init (totype, complain); |
c5adc427 JM |
6997 | else if (nelts == 1) |
6998 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6999 | else | |
7000 | gcc_unreachable (); | |
7001 | } | |
5a752e3f NS |
7002 | expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p, |
7003 | /*read_p=*/true, UNKNOWN_LOCATION, | |
7004 | /*reject_builtin=*/true); | |
c5adc427 | 7005 | |
c73964b2 | 7006 | if (type_unknown_p (expr)) |
5ade1ed2 | 7007 | expr = instantiate_type (totype, expr, complain); |
d2edcd70 JM |
7008 | if (expr == null_node |
7009 | && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype)) | |
7010 | /* If __null has been converted to an integer type, we do not want to | |
7011 | continue to warn about uses of EXPR as an integer, rather than as a | |
7012 | pointer. */ | |
7013 | expr = build_int_cst (totype, 0); | |
391c4bc5 | 7014 | return expr; |
5bd61841 | 7015 | case ck_ambig: |
0ab71f30 JM |
7016 | /* We leave bad_p off ck_ambig because overload resolution considers |
7017 | it valid, it just fails when we try to perform it. So we need to | |
7018 | check complain here, too. */ | |
0842c29f JM |
7019 | if (complain & tf_error) |
7020 | { | |
7021 | /* Call build_user_type_conversion again for the error. */ | |
929a0122 JM |
7022 | int flags = (convs->need_temporary_p |
7023 | ? LOOKUP_IMPLICIT : LOOKUP_NORMAL); | |
7024 | build_user_type_conversion (totype, convs->u.expr, flags, complain); | |
7025 | gcc_assert (seen_error ()); | |
f11854d4 | 7026 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
0842c29f JM |
7027 | } |
7028 | return error_mark_node; | |
7f85441b | 7029 | |
09357846 JM |
7030 | case ck_list: |
7031 | { | |
7032 | /* Conversion to std::initializer_list<T>. */ | |
7033 | tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0); | |
7034 | tree new_ctor = build_constructor (init_list_type_node, NULL); | |
7035 | unsigned len = CONSTRUCTOR_NELTS (expr); | |
88d37ae6 | 7036 | tree array, val, field; |
9771b263 | 7037 | vec<constructor_elt, va_gc> *vec = NULL; |
09357846 JM |
7038 | unsigned ix; |
7039 | ||
7040 | /* Convert all the elements. */ | |
7041 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val) | |
7042 | { | |
7043 | tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum, | |
bf31620c | 7044 | false, false, complain); |
09357846 JM |
7045 | if (sub == error_mark_node) |
7046 | return sub; | |
6a6bdc3d PC |
7047 | if (!BRACE_ENCLOSED_INITIALIZER_P (val) |
7048 | && !check_narrowing (TREE_TYPE (sub), val, complain)) | |
7049 | return error_mark_node; | |
09357846 | 7050 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub); |
c06ce6e4 JM |
7051 | if (!TREE_CONSTANT (sub)) |
7052 | TREE_CONSTANT (new_ctor) = false; | |
09357846 JM |
7053 | } |
7054 | /* Build up the array. */ | |
7055 | elttype = cp_build_qualified_type | |
a3360e77 | 7056 | (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST); |
09357846 | 7057 | array = build_array_of_n_type (elttype, len); |
834aa426 | 7058 | array = finish_compound_literal (array, new_ctor, complain); |
1f37c583 JM |
7059 | /* Take the address explicitly rather than via decay_conversion |
7060 | to avoid the error about taking the address of a temporary. */ | |
7061 | array = cp_build_addr_expr (array, complain); | |
4b978f96 | 7062 | array = cp_convert (build_pointer_type (elttype), array, complain); |
408249b2 JM |
7063 | if (array == error_mark_node) |
7064 | return error_mark_node; | |
09357846 | 7065 | |
61f84e25 PC |
7066 | /* Build up the initializer_list object. Note: fail gracefully |
7067 | if the object cannot be completed because, for example, no | |
7068 | definition is provided (c++/80956). */ | |
7069 | totype = complete_type_or_maybe_complain (totype, NULL_TREE, complain); | |
7070 | if (!totype) | |
7071 | return error_mark_node; | |
88d37ae6 | 7072 | field = next_initializable_field (TYPE_FIELDS (totype)); |
1f37c583 | 7073 | CONSTRUCTOR_APPEND_ELT (vec, field, array); |
88d37ae6 JM |
7074 | field = next_initializable_field (DECL_CHAIN (field)); |
7075 | CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len)); | |
7076 | new_ctor = build_constructor (totype, vec); | |
81bd268c | 7077 | return get_target_expr_sfinae (new_ctor, complain); |
09357846 JM |
7078 | } |
7079 | ||
7080 | case ck_aggr: | |
77a30e9a JM |
7081 | if (TREE_CODE (totype) == COMPLEX_TYPE) |
7082 | { | |
7083 | tree real = CONSTRUCTOR_ELT (expr, 0)->value; | |
7084 | tree imag = CONSTRUCTOR_ELT (expr, 1)->value; | |
7085 | real = perform_implicit_conversion (TREE_TYPE (totype), | |
7086 | real, complain); | |
7087 | imag = perform_implicit_conversion (TREE_TYPE (totype), | |
7088 | imag, complain); | |
7089 | expr = build2 (COMPLEX_EXPR, totype, real, imag); | |
cda0a029 | 7090 | return expr; |
77a30e9a | 7091 | } |
743af85b | 7092 | expr = reshape_init (totype, expr, complain); |
408249b2 | 7093 | expr = get_target_expr_sfinae (digest_init (totype, expr, complain), |
81bd268c | 7094 | complain); |
408249b2 JM |
7095 | if (expr != error_mark_node) |
7096 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
7097 | return expr; | |
09357846 | 7098 | |
7f85441b KG |
7099 | default: |
7100 | break; | |
c73964b2 MS |
7101 | }; |
7102 | ||
40703fdf | 7103 | expr = convert_like_real (next_conversion (convs), expr, fn, argnum, |
b8461915 NS |
7104 | convs->kind == ck_ref_bind |
7105 | ? issue_conversion_warnings : false, | |
7106 | c_cast_p, complain); | |
c73964b2 MS |
7107 | if (expr == error_mark_node) |
7108 | return error_mark_node; | |
7109 | ||
5bd61841 | 7110 | switch (convs->kind) |
c73964b2 | 7111 | { |
5bd61841 | 7112 | case ck_rvalue: |
89fcabaf PC |
7113 | expr = decay_conversion (expr, complain); |
7114 | if (expr == error_mark_node) | |
56233bd6 | 7115 | { |
37a80bf9 | 7116 | if (complain & tf_error) |
56233bd6 | 7117 | { |
097f82ec | 7118 | auto_diagnostic_group d; |
56233bd6 | 7119 | maybe_print_user_conv_context (convs); |
f11854d4 | 7120 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
56233bd6 JM |
7121 | } |
7122 | return error_mark_node; | |
7123 | } | |
89fcabaf | 7124 | |
9e1e64ec | 7125 | if (! MAYBE_CLASS_TYPE_P (totype)) |
de22184b | 7126 | return expr; |
31f7f784 JM |
7127 | |
7128 | /* Don't introduce copies when passing arguments along to the inherited | |
7129 | constructor. */ | |
7130 | if (current_function_decl | |
7131 | && flag_new_inheriting_ctors | |
c2f2350e | 7132 | && DECL_INHERITED_CTOR (current_function_decl)) |
31f7f784 JM |
7133 | return expr; |
7134 | ||
d78aecf4 JM |
7135 | if (TREE_CODE (expr) == TARGET_EXPR |
7136 | && TARGET_EXPR_LIST_INIT_P (expr)) | |
7137 | /* Copy-list-initialization doesn't actually involve a copy. */ | |
7138 | return expr; | |
7139 | ||
191816a3 | 7140 | /* Fall through. */ |
5bd61841 MM |
7141 | case ck_base: |
7142 | if (convs->kind == ck_base && !convs->need_temporary_p) | |
4f0aa416 MM |
7143 | { |
7144 | /* We are going to bind a reference directly to a base-class | |
7145 | subobject of EXPR. */ | |
4f0aa416 | 7146 | /* Build an expression for `*((base*) &expr)'. */ |
d1522e8f | 7147 | expr = convert_to_base (expr, totype, |
798ec807 | 7148 | !c_cast_p, /*nonnull=*/true, complain); |
4f0aa416 MM |
7149 | return expr; |
7150 | } | |
7151 | ||
5e818b93 JM |
7152 | /* Copy-initialization where the cv-unqualified version of the source |
7153 | type is the same class as, or a derived class of, the class of the | |
7154 | destination [is treated as direct-initialization]. [dcl.init] */ | |
0a73242e | 7155 | flags = LOOKUP_NORMAL; |
156d614f JM |
7156 | if (convs->user_conv_p) |
7157 | /* This conversion is being done in the context of a user-defined | |
46225e26 JM |
7158 | conversion (i.e. the second step of copy-initialization), so |
7159 | don't allow any more. */ | |
156d614f | 7160 | flags |= LOOKUP_NO_CONVERSION; |
0a73242e PC |
7161 | else |
7162 | flags |= LOOKUP_ONLYCONVERTING; | |
f8f12278 | 7163 | if (convs->rvaluedness_matches_p) |
4ce8c5de | 7164 | /* standard_conversion got LOOKUP_PREFER_RVALUE. */ |
f8f12278 | 7165 | flags |= LOOKUP_PREFER_RVALUE; |
248ce2f8 | 7166 | expr = build_temp (expr, totype, flags, &diag_kind, complain); |
3f55e16a JM |
7167 | if (diag_kind && complain) |
7168 | { | |
097f82ec | 7169 | auto_diagnostic_group d; |
3f55e16a | 7170 | maybe_print_user_conv_context (convs); |
f11854d4 | 7171 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
3f55e16a JM |
7172 | } |
7173 | ||
362115a9 | 7174 | return build_cplus_new (totype, expr, complain); |
41efda8f | 7175 | |
5bd61841 | 7176 | case ck_ref_bind: |
27b8d0cd | 7177 | { |
5e818b93 | 7178 | tree ref_type = totype; |
27b8d0cd | 7179 | |
40703fdf | 7180 | if (convs->bad_p && !next_conversion (convs)->bad_p) |
e7f1930f | 7181 | { |
d02f620d | 7182 | tree extype = TREE_TYPE (expr); |
097f82ec | 7183 | auto_diagnostic_group d; |
d02f620d | 7184 | if (TYPE_REF_IS_RVALUE (ref_type) |
72b3e203 | 7185 | && lvalue_p (expr)) |
f012c8ef DM |
7186 | error_at (loc, "cannot bind rvalue reference of type %qH to " |
7187 | "lvalue of type %qI", totype, extype); | |
72b3e203 | 7188 | else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr) |
d02f620d | 7189 | && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type))) |
fa76f2c6 | 7190 | error_at (loc, "cannot bind non-const lvalue reference of " |
f012c8ef | 7191 | "type %qH to an rvalue of type %qI", totype, extype); |
d02f620d | 7192 | else if (!reference_compatible_p (TREE_TYPE (totype), extype)) |
f012c8ef | 7193 | error_at (loc, "binding reference of type %qH to %qI " |
fa76f2c6 | 7194 | "discards qualifiers", totype, extype); |
d02f620d JM |
7195 | else |
7196 | gcc_unreachable (); | |
3f55e16a | 7197 | maybe_print_user_conv_context (convs); |
f11854d4 DM |
7198 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
7199 | ||
e7f1930f JM |
7200 | return error_mark_node; |
7201 | } | |
7202 | ||
8af2fec4 RY |
7203 | /* If necessary, create a temporary. |
7204 | ||
7205 | VA_ARG_EXPR and CONSTRUCTOR expressions are special cases | |
7206 | that need temporaries, even when their types are reference | |
7207 | compatible with the type of reference being bound, so the | |
93c0e0bb | 7208 | upcoming call to cp_build_addr_expr doesn't fail. */ |
8af2fec4 RY |
7209 | if (convs->need_temporary_p |
7210 | || TREE_CODE (expr) == CONSTRUCTOR | |
7211 | || TREE_CODE (expr) == VA_ARG_EXPR) | |
27b8d0cd | 7212 | { |
02a39a93 JM |
7213 | /* Otherwise, a temporary of type "cv1 T1" is created and |
7214 | initialized from the initializer expression using the rules | |
7215 | for a non-reference copy-initialization (8.5). */ | |
7216 | ||
7217 | tree type = TREE_TYPE (ref_type); | |
478ed1fa | 7218 | cp_lvalue_kind lvalue = lvalue_kind (expr); |
e0d1297c | 7219 | |
02a39a93 | 7220 | gcc_assert (same_type_ignoring_top_level_qualifiers_p |
40703fdf | 7221 | (type, next_conversion (convs)->type)); |
02a39a93 | 7222 | if (!CP_TYPE_CONST_NON_VOLATILE_P (type) |
8af2fec4 | 7223 | && !TYPE_REF_IS_RVALUE (ref_type)) |
e0d1297c | 7224 | { |
0ab71f30 JM |
7225 | /* If the reference is volatile or non-const, we |
7226 | cannot create a temporary. */ | |
7227 | if (lvalue & clk_bitfield) | |
5a3c9cf2 PC |
7228 | error_at (loc, "cannot bind bitfield %qE to %qT", |
7229 | expr, ref_type); | |
0ab71f30 | 7230 | else if (lvalue & clk_packed) |
5a3c9cf2 PC |
7231 | error_at (loc, "cannot bind packed field %qE to %qT", |
7232 | expr, ref_type); | |
0ab71f30 | 7233 | else |
5a3c9cf2 PC |
7234 | error_at (loc, "cannot bind rvalue %qE to %qT", |
7235 | expr, ref_type); | |
e0d1297c NS |
7236 | return error_mark_node; |
7237 | } | |
943e3ede MM |
7238 | /* If the source is a packed field, and we must use a copy |
7239 | constructor, then building the target expr will require | |
7240 | binding the field to the reference parameter to the | |
7241 | copy constructor, and we'll end up with an infinite | |
7242 | loop. If we can use a bitwise copy, then we'll be | |
7243 | OK. */ | |
c8094d83 MS |
7244 | if ((lvalue & clk_packed) |
7245 | && CLASS_TYPE_P (type) | |
d758e847 | 7246 | && type_has_nontrivial_copy_init (type)) |
943e3ede | 7247 | { |
5a3c9cf2 PC |
7248 | error_at (loc, "cannot bind packed field %qE to %qT", |
7249 | expr, ref_type); | |
943e3ede MM |
7250 | return error_mark_node; |
7251 | } | |
04941f76 | 7252 | if (lvalue & clk_bitfield) |
bced8304 AO |
7253 | { |
7254 | expr = convert_bitfield_to_declared_type (expr); | |
7255 | expr = fold_convert (type, expr); | |
7256 | } | |
574cfaa4 | 7257 | expr = build_target_expr_with_type (expr, type, complain); |
27b8d0cd MM |
7258 | } |
7259 | ||
7260 | /* Take the address of the thing to which we will bind the | |
7261 | reference. */ | |
93c0e0bb | 7262 | expr = cp_build_addr_expr (expr, complain); |
27b8d0cd MM |
7263 | if (expr == error_mark_node) |
7264 | return error_mark_node; | |
7265 | ||
7266 | /* Convert it to a pointer to the type referred to by the | |
7267 | reference. This will adjust the pointer if a derived to | |
7268 | base conversion is being performed. */ | |
c8094d83 | 7269 | expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)), |
4b978f96 | 7270 | expr, complain); |
27b8d0cd | 7271 | /* Convert the pointer to the desired reference type. */ |
7993382e | 7272 | return build_nop (ref_type, expr); |
27b8d0cd MM |
7273 | } |
7274 | ||
5bd61841 | 7275 | case ck_lvalue: |
89fcabaf | 7276 | return decay_conversion (expr, complain); |
7f85441b | 7277 | |
51dc6603 | 7278 | case ck_fnptr: |
b8fd7909 | 7279 | /* ??? Should the address of a transaction-safe pointer point to the TM |
51dc6603 | 7280 | clone, and this conversion look up the primary function? */ |
b8fd7909 JM |
7281 | return build_nop (totype, expr); |
7282 | ||
5bd61841 | 7283 | case ck_qual: |
d9cf7c82 | 7284 | /* Warn about deprecated conversion if appropriate. */ |
5e818b93 | 7285 | string_conv_p (totype, expr, 1); |
d9cf7c82 | 7286 | break; |
33c25e5c MM |
7287 | |
7288 | case ck_ptr: | |
7289 | if (convs->base_p) | |
08e17d9d | 7290 | expr = convert_to_base (expr, totype, !c_cast_p, |
798ec807 | 7291 | /*nonnull=*/false, complain); |
33c25e5c MM |
7292 | return build_nop (totype, expr); |
7293 | ||
08e17d9d MM |
7294 | case ck_pmem: |
7295 | return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false, | |
135d47df | 7296 | c_cast_p, complain); |
08e17d9d | 7297 | |
7f85441b KG |
7298 | default: |
7299 | break; | |
c73964b2 | 7300 | } |
3c955a04 | 7301 | |
6a6bdc3d | 7302 | if (convs->check_narrowing |
ed4f2c00 MP |
7303 | && !check_narrowing (totype, expr, complain, |
7304 | convs->check_narrowing_const_only)) | |
6a6bdc3d | 7305 | return error_mark_node; |
09357846 | 7306 | |
752e7593 | 7307 | warning_sentinel w (warn_zero_as_null_pointer_constant); |
da834cfc JM |
7308 | if (issue_conversion_warnings) |
7309 | expr = cp_convert_and_check (totype, expr, complain); | |
3c955a04 | 7310 | else |
da834cfc | 7311 | expr = cp_convert (totype, expr, complain); |
3c955a04 MM |
7312 | |
7313 | return expr; | |
c73964b2 MS |
7314 | } |
7315 | ||
41efda8f | 7316 | /* ARG is being passed to a varargs function. Perform any conversions |
0a72704b | 7317 | required. Return the converted value. */ |
41efda8f MM |
7318 | |
7319 | tree | |
b40e334f | 7320 | convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain) |
41efda8f | 7321 | { |
c5ee1358 | 7322 | tree arg_type; |
6bdfada4 | 7323 | location_t loc = cp_expr_loc_or_loc (arg, input_location); |
c5ee1358 | 7324 | |
0a72704b MM |
7325 | /* [expr.call] |
7326 | ||
7327 | The lvalue-to-rvalue, array-to-pointer, and function-to-pointer | |
7328 | standard conversions are performed. */ | |
b40e334f | 7329 | arg = decay_conversion (arg, complain); |
c5ee1358 | 7330 | arg_type = TREE_TYPE (arg); |
0a72704b MM |
7331 | /* [expr.call] |
7332 | ||
7333 | If the argument has integral or enumeration type that is subject | |
7334 | to the integral promotions (_conv.prom_), or a floating point | |
7335 | type that is subject to the floating point promotion | |
7336 | (_conv.fpprom_), the value of the argument is converted to the | |
7337 | promoted type before the call. */ | |
c5ee1358 MM |
7338 | if (TREE_CODE (arg_type) == REAL_TYPE |
7339 | && (TYPE_PRECISION (arg_type) | |
776d0022 | 7340 | < TYPE_PRECISION (double_type_node)) |
c5ee1358 MM |
7341 | && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type))) |
7342 | { | |
b40e334f PC |
7343 | if ((complain & tf_warning) |
7344 | && warn_double_promotion && !c_inhibit_evaluation_warnings) | |
5a3c9cf2 | 7345 | warning_at (loc, OPT_Wdouble_promotion, |
f012c8ef | 7346 | "implicit conversion from %qH to %qI when passing " |
5a3c9cf2 PC |
7347 | "argument to function", |
7348 | arg_type, double_type_node); | |
cda0a029 | 7349 | arg = convert_to_real_nofold (double_type_node, arg); |
c5ee1358 MM |
7350 | } |
7351 | else if (NULLPTR_TYPE_P (arg_type)) | |
14c2101d | 7352 | arg = null_pointer_node; |
c5ee1358 | 7353 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type)) |
3c395ecf | 7354 | { |
62984918 | 7355 | if (SCOPED_ENUM_P (arg_type)) |
3c395ecf | 7356 | { |
62984918 JM |
7357 | tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg, |
7358 | complain); | |
7359 | prom = cp_perform_integral_promotions (prom, complain); | |
7360 | if (abi_version_crosses (6) | |
7361 | && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type) | |
7362 | && (complain & tf_warning)) | |
7363 | warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as " | |
7364 | "%qT before -fabi-version=6, %qT after", arg_type, | |
7365 | TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type)); | |
7366 | if (!abi_version_at_least (6)) | |
7367 | arg = prom; | |
3c395ecf | 7368 | } |
62984918 JM |
7369 | else |
7370 | arg = cp_perform_integral_promotions (arg, complain); | |
3c395ecf | 7371 | } |
41efda8f | 7372 | |
e2e03032 | 7373 | arg = require_complete_type_sfinae (arg, complain); |
c5ee1358 | 7374 | arg_type = TREE_TYPE (arg); |
c8094d83 | 7375 | |
5840af0f | 7376 | if (arg != error_mark_node |
85a273ba | 7377 | /* In a template (or ill-formed code), we can have an incomplete type |
e2e03032 | 7378 | even after require_complete_type_sfinae, in which case we don't know |
85a273ba | 7379 | whether it has trivial copy or not. */ |
b9760b03 JM |
7380 | && COMPLETE_TYPE_P (arg_type) |
7381 | && !cp_unevaluated_operand) | |
1b4d752a | 7382 | { |
c32097d8 JM |
7383 | /* [expr.call] 5.2.2/7: |
7384 | Passing a potentially-evaluated argument of class type (Clause 9) | |
7385 | with a non-trivial copy constructor or a non-trivial destructor | |
7386 | with no corresponding parameter is conditionally-supported, with | |
7387 | implementation-defined semantics. | |
7388 | ||
b9760b03 JM |
7389 | We support it as pass-by-invisible-reference, just like a normal |
7390 | value parameter. | |
c32097d8 | 7391 | |
c8094d83 | 7392 | If the call appears in the context of a sizeof expression, |
c32097d8 | 7393 | it is not potentially-evaluated. */ |
b9760b03 JM |
7394 | if (type_has_nontrivial_copy_init (arg_type) |
7395 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)) | |
b40e334f | 7396 | { |
b9760b03 | 7397 | arg = force_rvalue (arg, complain); |
d2f2e467 JM |
7398 | if (complain & tf_warning) |
7399 | warning (OPT_Wconditionally_supported, | |
7400 | "passing objects of non-trivially-copyable " | |
7401 | "type %q#T through %<...%> is conditionally supported", | |
7402 | arg_type); | |
5f2440b0 | 7403 | return build1 (ADDR_EXPR, build_reference_type (arg_type), arg); |
b40e334f | 7404 | } |
b9760b03 JM |
7405 | /* Build up a real lvalue-to-rvalue conversion in case the |
7406 | copy constructor is trivial but not callable. */ | |
7407 | else if (CLASS_TYPE_P (arg_type)) | |
7408 | force_rvalue (arg, complain); | |
7409 | ||
1b4d752a NS |
7410 | } |
7411 | ||
41efda8f MM |
7412 | return arg; |
7413 | } | |
7414 | ||
356955cf NS |
7415 | /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */ |
7416 | ||
7417 | tree | |
620e594b | 7418 | build_x_va_arg (location_t loc, tree expr, tree type) |
356955cf | 7419 | { |
ea333e1c | 7420 | if (processing_template_decl) |
d2f2e467 JM |
7421 | { |
7422 | tree r = build_min (VA_ARG_EXPR, type, expr); | |
7423 | SET_EXPR_LOCATION (r, loc); | |
7424 | return r; | |
7425 | } | |
c8094d83 | 7426 | |
356955cf NS |
7427 | type = complete_type_or_else (type, NULL_TREE); |
7428 | ||
7429 | if (expr == error_mark_node || !type) | |
7430 | return error_mark_node; | |
c8094d83 | 7431 | |
03a904b5 JJ |
7432 | expr = mark_lvalue_use (expr); |
7433 | ||
9f613f06 | 7434 | if (TYPE_REF_P (type)) |
d2f2e467 JM |
7435 | { |
7436 | error ("cannot receive reference type %qT through %<...%>", type); | |
7437 | return error_mark_node; | |
7438 | } | |
7439 | ||
c32097d8 | 7440 | if (type_has_nontrivial_copy_init (type) |
d2f2e467 JM |
7441 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
7442 | { | |
7443 | /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat | |
7444 | it as pass by invisible reference. */ | |
7445 | warning_at (loc, OPT_Wconditionally_supported, | |
7446 | "receiving objects of non-trivially-copyable type %q#T " | |
7447 | "through %<...%> is conditionally-supported", type); | |
7448 | ||
7449 | tree ref = cp_build_reference_type (type, false); | |
7450 | expr = build_va_arg (loc, expr, ref); | |
7451 | return convert_from_reference (expr); | |
356955cf | 7452 | } |
c8094d83 | 7453 | |
b7558a2c JM |
7454 | tree ret = build_va_arg (loc, expr, type); |
7455 | if (CLASS_TYPE_P (type)) | |
7456 | /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to | |
7457 | know how to handle it. */ | |
7458 | ret = get_target_expr (ret); | |
7459 | return ret; | |
356955cf NS |
7460 | } |
7461 | ||
ab393bf1 NB |
7462 | /* TYPE has been given to va_arg. Apply the default conversions which |
7463 | would have happened when passed via ellipsis. Return the promoted | |
7464 | type, or the passed type if there is no change. */ | |
356955cf NS |
7465 | |
7466 | tree | |
94be8403 | 7467 | cxx_type_promotes_to (tree type) |
356955cf NS |
7468 | { |
7469 | tree promote; | |
ab393bf1 | 7470 | |
a7e8c268 MM |
7471 | /* Perform the array-to-pointer and function-to-pointer |
7472 | conversions. */ | |
7473 | type = type_decays_to (type); | |
ab393bf1 NB |
7474 | |
7475 | promote = type_promotes_to (type); | |
7476 | if (same_type_p (type, promote)) | |
7477 | promote = type; | |
c8094d83 | 7478 | |
ab393bf1 | 7479 | return promote; |
356955cf NS |
7480 | } |
7481 | ||
41efda8f | 7482 | /* ARG is a default argument expression being passed to a parameter of |
4c66d85a JM |
7483 | the indicated TYPE, which is a parameter to FN. PARMNUM is the |
7484 | zero-based argument number. Do any required conversions. Return | |
7485 | the converted value. */ | |
41efda8f | 7486 | |
9771b263 | 7487 | static GTY(()) vec<tree, va_gc> *default_arg_context; |
4c66d85a JM |
7488 | void |
7489 | push_defarg_context (tree fn) | |
9771b263 DN |
7490 | { vec_safe_push (default_arg_context, fn); } |
7491 | ||
4c66d85a JM |
7492 | void |
7493 | pop_defarg_context (void) | |
9771b263 | 7494 | { default_arg_context->pop (); } |
d02dbde6 | 7495 | |
41efda8f | 7496 | tree |
b40e334f PC |
7497 | convert_default_arg (tree type, tree arg, tree fn, int parmnum, |
7498 | tsubst_flags_t complain) | |
c73964b2 | 7499 | { |
d02dbde6 JM |
7500 | int i; |
7501 | tree t; | |
7502 | ||
4c66d85a JM |
7503 | /* See through clones. */ |
7504 | fn = DECL_ORIGIN (fn); | |
866115cd JM |
7505 | /* And inheriting ctors. */ |
7506 | if (flag_new_inheriting_ctors) | |
7507 | fn = strip_inheriting_ctors (fn); | |
96a1e32d | 7508 | |
d02dbde6 | 7509 | /* Detect recursion. */ |
9771b263 | 7510 | FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t) |
d02dbde6 JM |
7511 | if (t == fn) |
7512 | { | |
b40e334f PC |
7513 | if (complain & tf_error) |
7514 | error ("recursive evaluation of default argument for %q#D", fn); | |
d02dbde6 JM |
7515 | return error_mark_node; |
7516 | } | |
4c66d85a JM |
7517 | |
7518 | /* If the ARG is an unparsed default argument expression, the | |
7519 | conversion cannot be performed. */ | |
7520 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
7521 | { | |
b40e334f PC |
7522 | if (complain & tf_error) |
7523 | error ("call to %qD uses the default argument for parameter %P, which " | |
7524 | "is not yet defined", fn, parmnum); | |
4c66d85a JM |
7525 | return error_mark_node; |
7526 | } | |
7527 | ||
7528 | push_defarg_context (fn); | |
d02dbde6 | 7529 | |
297e73d8 | 7530 | if (fn && DECL_TEMPLATE_INFO (fn)) |
12659e10 | 7531 | arg = tsubst_default_argument (fn, parmnum, type, arg, complain); |
297e73d8 | 7532 | |
248e1b22 MM |
7533 | /* Due to: |
7534 | ||
7535 | [dcl.fct.default] | |
c73964b2 | 7536 | |
248e1b22 MM |
7537 | The names in the expression are bound, and the semantic |
7538 | constraints are checked, at the point where the default | |
7539 | expressions appears. | |
7540 | ||
7541 | we must not perform access checks here. */ | |
7542 | push_deferring_access_checks (dk_no_check); | |
a4d25b44 JM |
7543 | /* We must make a copy of ARG, in case subsequent processing |
7544 | alters any part of it. */ | |
45d14461 | 7545 | arg = break_out_target_exprs (arg, /*clear location*/true); |
6e2446b6 | 7546 | |
4a4e80cb JM |
7547 | arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT, |
7548 | ICR_DEFAULT_ARGUMENT, fn, parmnum, | |
7549 | complain); | |
7550 | arg = convert_for_arg_passing (type, arg, complain); | |
248e1b22 | 7551 | pop_deferring_access_checks(); |
c73964b2 | 7552 | |
4c66d85a | 7553 | pop_defarg_context (); |
d02dbde6 | 7554 | |
c73964b2 MS |
7555 | return arg; |
7556 | } | |
7557 | ||
8e51619a JM |
7558 | /* Returns the type which will really be used for passing an argument of |
7559 | type TYPE. */ | |
7560 | ||
7561 | tree | |
94be8403 | 7562 | type_passed_as (tree type) |
8e51619a JM |
7563 | { |
7564 | /* Pass classes with copy ctors by invisible reference. */ | |
7565 | if (TREE_ADDRESSABLE (type)) | |
d8472c75 JM |
7566 | { |
7567 | type = build_reference_type (type); | |
7568 | /* There are no other pointers to this temporary. */ | |
a3360e77 | 7569 | type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT); |
d8472c75 | 7570 | } |
c25ac927 | 7571 | else if (targetm.calls.promote_prototypes (NULL_TREE) |
8e51619a | 7572 | && INTEGRAL_TYPE_P (type) |
3f50d3dd | 7573 | && COMPLETE_TYPE_P (type) |
807e902e | 7574 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
8e51619a JM |
7575 | type = integer_type_node; |
7576 | ||
7577 | return type; | |
7578 | } | |
7579 | ||
7580 | /* Actually perform the appropriate conversion. */ | |
7581 | ||
7582 | tree | |
b40e334f | 7583 | convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain) |
8e51619a | 7584 | { |
83144bd6 MM |
7585 | tree bitfield_type; |
7586 | ||
7587 | /* If VAL is a bitfield, then -- since it has already been converted | |
7588 | to TYPE -- it cannot have a precision greater than TYPE. | |
7589 | ||
7590 | If it has a smaller precision, we must widen it here. For | |
7591 | example, passing "int f:3;" to a function expecting an "int" will | |
7592 | not result in any conversion before this point. | |
7593 | ||
7594 | If the precision is the same we must not risk widening. For | |
7595 | example, the COMPONENT_REF for a 32-bit "long long" bitfield will | |
7596 | often have type "int", even though the C++ type for the field is | |
7597 | "long long". If the value is being passed to a function | |
7598 | expecting an "int", then no conversions will be required. But, | |
7599 | if we call convert_bitfield_to_declared_type, the bitfield will | |
7600 | be converted to "long long". */ | |
7601 | bitfield_type = is_bitfield_expr_with_lowered_type (val); | |
7602 | if (bitfield_type | |
7603 | && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)) | |
cda0a029 | 7604 | val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val); |
83144bd6 | 7605 | |
c246c65d JM |
7606 | if (val == error_mark_node) |
7607 | ; | |
8e51619a | 7608 | /* Pass classes with copy ctors by invisible reference. */ |
c246c65d JM |
7609 | else if (TREE_ADDRESSABLE (type)) |
7610 | val = build1 (ADDR_EXPR, build_reference_type (type), val); | |
c25ac927 | 7611 | else if (targetm.calls.promote_prototypes (NULL_TREE) |
8e51619a | 7612 | && INTEGRAL_TYPE_P (type) |
3f50d3dd | 7613 | && COMPLETE_TYPE_P (type) |
807e902e | 7614 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
4b978f96 | 7615 | val = cp_perform_integral_promotions (val, complain); |
f3ec182d JM |
7616 | if (complain & tf_warning) |
7617 | { | |
7618 | if (warn_suggest_attribute_format) | |
7619 | { | |
7620 | tree rhstype = TREE_TYPE (val); | |
7621 | const enum tree_code coder = TREE_CODE (rhstype); | |
7622 | const enum tree_code codel = TREE_CODE (type); | |
7623 | if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE) | |
7624 | && coder == codel | |
7625 | && check_missing_format_attribute (type, rhstype)) | |
7626 | warning (OPT_Wsuggest_attribute_format, | |
7627 | "argument of function call might be a candidate " | |
7628 | "for a format attribute"); | |
7629 | } | |
6bdfada4 | 7630 | maybe_warn_parm_abi (type, cp_expr_loc_or_loc (val, input_location)); |
104f8784 | 7631 | } |
da77eace L |
7632 | |
7633 | warn_for_address_or_pointer_of_packed_member (false, type, val); | |
7634 | ||
8e51619a JM |
7635 | return val; |
7636 | } | |
7637 | ||
17366700 JJ |
7638 | /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for |
7639 | which just decay_conversion or no conversions at all should be done. | |
7640 | This is true for some builtins which don't act like normal functions. | |
7641 | Return 2 if no conversions at all should be done, 1 if just | |
00085092 JJ |
7642 | decay_conversion. Return 3 for special treatment of the 3rd argument |
7643 | for __builtin_*_overflow_p. */ | |
a6f86b51 | 7644 | |
17366700 | 7645 | int |
a6f86b51 JM |
7646 | magic_varargs_p (tree fn) |
7647 | { | |
ce209777 | 7648 | if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL) |
a6f86b51 JM |
7649 | switch (DECL_FUNCTION_CODE (fn)) |
7650 | { | |
7651 | case BUILT_IN_CLASSIFY_TYPE: | |
7652 | case BUILT_IN_CONSTANT_P: | |
7653 | case BUILT_IN_NEXT_ARG: | |
a6f86b51 | 7654 | case BUILT_IN_VA_START: |
17366700 | 7655 | return 1; |
a6f86b51 | 7656 | |
00085092 JJ |
7657 | case BUILT_IN_ADD_OVERFLOW_P: |
7658 | case BUILT_IN_SUB_OVERFLOW_P: | |
7659 | case BUILT_IN_MUL_OVERFLOW_P: | |
7660 | return 3; | |
7661 | ||
a6f86b51 | 7662 | default:; |
59f89d34 KG |
7663 | return lookup_attribute ("type generic", |
7664 | TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0; | |
a6f86b51 JM |
7665 | } |
7666 | ||
17366700 | 7667 | return 0; |
a6f86b51 JM |
7668 | } |
7669 | ||
3649b9b7 ST |
7670 | /* Returns the decl of the dispatcher function if FN is a function version. */ |
7671 | ||
beb42d20 | 7672 | tree |
3649b9b7 ST |
7673 | get_function_version_dispatcher (tree fn) |
7674 | { | |
7675 | tree dispatcher_decl = NULL; | |
7676 | ||
7677 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL | |
7678 | && DECL_FUNCTION_VERSIONED (fn)); | |
7679 | ||
7680 | gcc_assert (targetm.get_function_versions_dispatcher); | |
7681 | dispatcher_decl = targetm.get_function_versions_dispatcher (fn); | |
7682 | ||
7683 | if (dispatcher_decl == NULL) | |
7684 | { | |
beb42d20 ST |
7685 | error_at (input_location, "use of multiversioned function " |
7686 | "without a default"); | |
3649b9b7 ST |
7687 | return NULL; |
7688 | } | |
7689 | ||
7690 | retrofit_lang_decl (dispatcher_decl); | |
7691 | gcc_assert (dispatcher_decl != NULL); | |
7692 | return dispatcher_decl; | |
7693 | } | |
7694 | ||
7695 | /* fn is a function version dispatcher that is marked used. Mark all the | |
7696 | semantically identical function versions it will dispatch as used. */ | |
7697 | ||
beb42d20 | 7698 | void |
3649b9b7 ST |
7699 | mark_versions_used (tree fn) |
7700 | { | |
7701 | struct cgraph_node *node; | |
7702 | struct cgraph_function_version_info *node_v; | |
7703 | struct cgraph_function_version_info *it_v; | |
7704 | ||
7705 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
7706 | ||
d52f5295 | 7707 | node = cgraph_node::get (fn); |
3649b9b7 ST |
7708 | if (node == NULL) |
7709 | return; | |
7710 | ||
7711 | gcc_assert (node->dispatcher_function); | |
7712 | ||
d52f5295 | 7713 | node_v = node->function_version (); |
3649b9b7 ST |
7714 | if (node_v == NULL) |
7715 | return; | |
7716 | ||
7717 | /* All semantically identical versions are chained. Traverse and mark each | |
7718 | one of them as used. */ | |
7719 | it_v = node_v->next; | |
7720 | while (it_v != NULL) | |
7721 | { | |
67348ccc | 7722 | mark_used (it_v->this_node->decl); |
3649b9b7 ST |
7723 | it_v = it_v->next; |
7724 | } | |
7725 | } | |
7726 | ||
9efe5fbd JM |
7727 | /* Build a call to "the copy constructor" for the type of A, even if it |
7728 | wouldn't be selected by normal overload resolution. Used for | |
7729 | diagnostics. */ | |
7730 | ||
7731 | static tree | |
7732 | call_copy_ctor (tree a, tsubst_flags_t complain) | |
7733 | { | |
7734 | tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a)); | |
7735 | tree binfo = TYPE_BINFO (ctype); | |
7736 | tree copy = get_copy_ctor (ctype, complain); | |
7737 | copy = build_baselink (binfo, binfo, copy, NULL_TREE); | |
7738 | tree ob = build_dummy_object (ctype); | |
7739 | vec<tree, va_gc>* args = make_tree_vector_single (a); | |
7740 | tree r = build_new_method_call (ob, copy, &args, NULL_TREE, | |
7741 | LOOKUP_NORMAL, NULL, complain); | |
7742 | release_tree_vector (args); | |
7743 | return r; | |
7744 | } | |
7745 | ||
3c769e5a JM |
7746 | /* Return true iff T refers to a base field. */ |
7747 | ||
7748 | static bool | |
7749 | is_base_field_ref (tree t) | |
7750 | { | |
7751 | STRIP_NOPS (t); | |
7752 | if (TREE_CODE (t) == ADDR_EXPR) | |
7753 | t = TREE_OPERAND (t, 0); | |
7754 | if (TREE_CODE (t) == COMPONENT_REF) | |
7755 | t = TREE_OPERAND (t, 1); | |
7756 | if (TREE_CODE (t) == FIELD_DECL) | |
7757 | return DECL_FIELD_IS_BASE (t); | |
7758 | return false; | |
7759 | } | |
7760 | ||
7761 | /* We can't elide a copy from a function returning by value to a base | |
7762 | subobject, as the callee might clobber tail padding. Return true iff this | |
7763 | could be that case. */ | |
7764 | ||
7765 | static bool | |
7766 | unsafe_copy_elision_p (tree target, tree exp) | |
7767 | { | |
d5ec842c JM |
7768 | /* Copy elision only happens with a TARGET_EXPR. */ |
7769 | if (TREE_CODE (exp) != TARGET_EXPR) | |
7770 | return false; | |
3c769e5a | 7771 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); |
a93f3513 JM |
7772 | /* It's safe to elide the copy for a class with no tail padding. */ |
7773 | if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type))) | |
3c769e5a | 7774 | return false; |
a93f3513 JM |
7775 | /* It's safe to elide the copy if we aren't initializing a base object. */ |
7776 | if (!is_base_field_ref (target)) | |
3c769e5a JM |
7777 | return false; |
7778 | tree init = TARGET_EXPR_INITIAL (exp); | |
0795b6f2 JM |
7779 | /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */ |
7780 | while (TREE_CODE (init) == COMPOUND_EXPR) | |
7781 | init = TREE_OPERAND (init, 1); | |
a2444ce9 JM |
7782 | if (TREE_CODE (init) == COND_EXPR) |
7783 | { | |
7784 | /* We'll end up copying from each of the arms of the COND_EXPR directly | |
7785 | into the target, so look at them. */ | |
7786 | if (tree op = TREE_OPERAND (init, 1)) | |
7787 | if (unsafe_copy_elision_p (target, op)) | |
7788 | return true; | |
7789 | return unsafe_copy_elision_p (target, TREE_OPERAND (init, 2)); | |
7790 | } | |
3c769e5a JM |
7791 | return (TREE_CODE (init) == AGGR_INIT_EXPR |
7792 | && !AGGR_INIT_VIA_CTOR_P (init)); | |
7793 | } | |
7794 | ||
2170d4b6 JM |
7795 | /* True iff C is a conversion that binds a reference to a prvalue. */ |
7796 | ||
7797 | static bool | |
7798 | conv_binds_ref_to_prvalue (conversion *c) | |
7799 | { | |
7800 | if (c->kind != ck_ref_bind) | |
7801 | return false; | |
7802 | if (c->need_temporary_p) | |
7803 | return true; | |
7804 | ||
7805 | c = next_conversion (c); | |
7806 | ||
7807 | if (c->kind == ck_rvalue) | |
7808 | return true; | |
9f613f06 | 7809 | if (c->kind == ck_user && !TYPE_REF_P (c->type)) |
2170d4b6 | 7810 | return true; |
8d0d49f8 JM |
7811 | if (c->kind == ck_identity && c->u.expr |
7812 | && TREE_CODE (c->u.expr) == TARGET_EXPR) | |
7813 | return true; | |
2170d4b6 JM |
7814 | |
7815 | return false; | |
7816 | } | |
7817 | ||
cdc18417 JM |
7818 | /* Call the trivial destructor for INSTANCE, which can be either an lvalue of |
7819 | class type or a pointer to class type. */ | |
7820 | ||
7821 | tree | |
7822 | build_trivial_dtor_call (tree instance) | |
7823 | { | |
7824 | gcc_assert (!is_dummy_object (instance)); | |
7825 | ||
7826 | if (!flag_lifetime_dse) | |
7827 | { | |
7828 | no_clobber: | |
7829 | return fold_convert (void_type_node, instance); | |
7830 | } | |
7831 | ||
71a93b08 | 7832 | if (INDIRECT_TYPE_P (TREE_TYPE (instance))) |
cdc18417 JM |
7833 | { |
7834 | if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) | |
7835 | goto no_clobber; | |
7836 | instance = cp_build_fold_indirect_ref (instance); | |
7837 | } | |
7838 | ||
7839 | /* A trivial destructor should still clobber the object. */ | |
7840 | tree clobber = build_clobber (TREE_TYPE (instance)); | |
7841 | return build2 (MODIFY_EXPR, void_type_node, | |
7842 | instance, clobber); | |
7843 | } | |
7844 | ||
c050ec51 JM |
7845 | /* Subroutine of the various build_*_call functions. Overload resolution |
7846 | has chosen a winning candidate CAND; build up a CALL_EXPR accordingly. | |
7847 | ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a | |
7848 | bitmask of various LOOKUP_* flags which apply to the call itself. */ | |
7849 | ||
c73964b2 | 7850 | static tree |
5ade1ed2 | 7851 | build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain) |
c73964b2 | 7852 | { |
5ffe581d | 7853 | tree fn = cand->fn; |
9771b263 | 7854 | const vec<tree, va_gc> *args = cand->args; |
c166b898 | 7855 | tree first_arg = cand->first_arg; |
5bd61841 MM |
7856 | conversion **convs = cand->convs; |
7857 | conversion *conv; | |
c73964b2 | 7858 | tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
94a0dd7b | 7859 | int parmlen; |
c166b898 | 7860 | tree val; |
c73964b2 | 7861 | int i = 0; |
94a0dd7b | 7862 | int j = 0; |
c166b898 | 7863 | unsigned int arg_index = 0; |
d11ad92e | 7864 | int is_method = 0; |
94a0dd7b SL |
7865 | int nargs; |
7866 | tree *argarray; | |
b87d79e6 | 7867 | bool already_used = false; |
c73964b2 | 7868 | |
b7c707d1 MM |
7869 | /* In a template, there is no need to perform all of the work that |
7870 | is normally done. We are only interested in the type of the call | |
7871 | expression, i.e., the return type of the function. Any semantic | |
7872 | errors will be deferred until the template is instantiated. */ | |
7873 | if (processing_template_decl) | |
7874 | { | |
89fcabaf | 7875 | tree expr, addr; |
b7c707d1 | 7876 | tree return_type; |
c166b898 ILT |
7877 | const tree *argarray; |
7878 | unsigned int nargs; | |
7879 | ||
ccb7042d JM |
7880 | if (undeduced_auto_decl (fn)) |
7881 | mark_used (fn, complain); | |
80bac2eb JM |
7882 | else |
7883 | /* Otherwise set TREE_USED for the benefit of -Wunused-function. | |
7884 | See PR80598. */ | |
7885 | TREE_USED (fn) = 1; | |
ccb7042d | 7886 | |
b7c707d1 | 7887 | return_type = TREE_TYPE (TREE_TYPE (fn)); |
9771b263 | 7888 | nargs = vec_safe_length (args); |
c166b898 | 7889 | if (first_arg == NULL_TREE) |
9771b263 | 7890 | argarray = args->address (); |
c166b898 ILT |
7891 | else |
7892 | { | |
7893 | tree *alcarray; | |
7894 | unsigned int ix; | |
7895 | tree arg; | |
7896 | ||
7897 | ++nargs; | |
7898 | alcarray = XALLOCAVEC (tree, nargs); | |
e2498d54 | 7899 | alcarray[0] = build_this (first_arg); |
9771b263 | 7900 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
c166b898 ILT |
7901 | alcarray[ix + 1] = arg; |
7902 | argarray = alcarray; | |
7903 | } | |
89fcabaf PC |
7904 | |
7905 | addr = build_addr_func (fn, complain); | |
7906 | if (addr == error_mark_node) | |
7907 | return error_mark_node; | |
7908 | expr = build_call_array_loc (input_location, return_type, | |
7909 | addr, nargs, argarray); | |
c8b2e872 MM |
7910 | if (TREE_THIS_VOLATILE (fn) && cfun) |
7911 | current_function_returns_abnormally = 1; | |
b7c707d1 MM |
7912 | return convert_from_reference (expr); |
7913 | } | |
7914 | ||
5ffe581d | 7915 | /* Give any warnings we noticed during overload resolution. */ |
46408846 | 7916 | if (cand->warnings && (complain & tf_warning)) |
5bd61841 MM |
7917 | { |
7918 | struct candidate_warning *w; | |
7919 | for (w = cand->warnings; w; w = w->next) | |
b40e334f | 7920 | joust (cand, w->loser, 1, complain); |
5bd61841 | 7921 | } |
5ffe581d | 7922 | |
2170d4b6 JM |
7923 | /* Core issue 2327: P0135 doesn't say how to handle the case where the |
7924 | argument to the copy constructor ends up being a prvalue after | |
7925 | conversion. Let's do the normal processing, but pretend we aren't | |
7926 | actually using the copy constructor. */ | |
7927 | bool force_elide = false; | |
7928 | if (cxx_dialect >= cxx17 | |
7929 | && cand->num_convs == 1 | |
7930 | && DECL_COMPLETE_CONSTRUCTOR_P (fn) | |
7931 | && (DECL_COPY_CONSTRUCTOR_P (fn) | |
7932 | || DECL_MOVE_CONSTRUCTOR_P (fn)) | |
7933 | && conv_binds_ref_to_prvalue (convs[0])) | |
7934 | { | |
7935 | force_elide = true; | |
7936 | goto not_really_used; | |
7937 | } | |
7938 | ||
20f058d0 JM |
7939 | /* OK, we're actually calling this inherited constructor; set its deletedness |
7940 | appropriately. We can get away with doing this here because calling is | |
7941 | the only way to refer to a constructor. */ | |
7942 | if (DECL_INHERITED_CTOR (fn)) | |
7943 | deduce_inheriting_ctor (fn); | |
7944 | ||
4ad610c9 | 7945 | /* Make =delete work with SFINAE. */ |
18101e73 JM |
7946 | if (DECL_DELETED_FN (fn)) |
7947 | { | |
7948 | if (complain & tf_error) | |
7949 | mark_used (fn); | |
7950 | return error_mark_node; | |
7951 | } | |
4ad610c9 | 7952 | |
5ffe581d | 7953 | if (DECL_FUNCTION_MEMBER_P (fn)) |
3dfa3500 | 7954 | { |
ac177431 | 7955 | tree access_fn; |
3dfa3500 KL |
7956 | /* If FN is a template function, two cases must be considered. |
7957 | For example: | |
7958 | ||
7959 | struct A { | |
7960 | protected: | |
7961 | template <class T> void f(); | |
7962 | }; | |
7963 | template <class T> struct B { | |
7964 | protected: | |
7965 | void g(); | |
7966 | }; | |
7967 | struct C : A, B<int> { | |
7968 | using A::f; // #1 | |
7969 | using B<int>::g; // #2 | |
7970 | }; | |
7971 | ||
7972 | In case #1 where `A::f' is a member template, DECL_ACCESS is | |
7973 | recorded in the primary template but not in its specialization. | |
7974 | We check access of FN using its primary template. | |
7975 | ||
7976 | In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply | |
7977 | because it is a member of class template B, DECL_ACCESS is | |
7978 | recorded in the specialization `B<int>::g'. We cannot use its | |
7979 | primary template because `B<T>::g' and `B<int>::g' may have | |
7980 | different access. */ | |
7981 | if (DECL_TEMPLATE_INFO (fn) | |
c7222c02 | 7982 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn))) |
ac177431 | 7983 | access_fn = DECL_TI_TEMPLATE (fn); |
3dfa3500 | 7984 | else |
ac177431 | 7985 | access_fn = fn; |
0e69fdf0 PC |
7986 | if (!perform_or_defer_access_check (cand->access_path, access_fn, |
7987 | fn, complain)) | |
7988 | return error_mark_node; | |
ac177431 JM |
7989 | } |
7990 | ||
7991 | /* If we're checking for implicit delete, don't bother with argument | |
7992 | conversions. */ | |
7993 | if (flags & LOOKUP_SPECULATIVE) | |
7994 | { | |
ac177431 JM |
7995 | if (cand->viable == 1) |
7996 | return fn; | |
4b978f96 | 7997 | else if (!(complain & tf_error)) |
ac177431 JM |
7998 | /* Reject bad conversions now. */ |
7999 | return error_mark_node; | |
8000 | /* else continue to get conversion error. */ | |
3dfa3500 | 8001 | } |
5ffe581d | 8002 | |
2170d4b6 JM |
8003 | not_really_used: |
8004 | ||
57fcd4f4 | 8005 | /* N3276 magic doesn't apply to nested calls. */ |
5a201862 | 8006 | tsubst_flags_t decltype_flag = (complain & tf_decltype); |
57fcd4f4 | 8007 | complain &= ~tf_decltype; |
5a201862 NS |
8008 | /* No-Cleanup doesn't apply to nested calls either. */ |
8009 | tsubst_flags_t no_cleanup_complain = complain; | |
8010 | complain &= ~tf_no_cleanup; | |
57fcd4f4 | 8011 | |
94a0dd7b SL |
8012 | /* Find maximum size of vector to hold converted arguments. */ |
8013 | parmlen = list_length (parm); | |
9771b263 | 8014 | nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0); |
94a0dd7b SL |
8015 | if (parmlen > nargs) |
8016 | nargs = parmlen; | |
86b8fed1 | 8017 | argarray = XALLOCAVEC (tree, nargs); |
94a0dd7b | 8018 | |
c73964b2 MS |
8019 | /* The implicit parameters to a constructor are not considered by overload |
8020 | resolution, and must be of the proper type. */ | |
8021 | if (DECL_CONSTRUCTOR_P (fn)) | |
8022 | { | |
a7175123 | 8023 | tree object_arg; |
c166b898 ILT |
8024 | if (first_arg != NULL_TREE) |
8025 | { | |
a7175123 | 8026 | object_arg = first_arg; |
c166b898 ILT |
8027 | first_arg = NULL_TREE; |
8028 | } | |
8029 | else | |
8030 | { | |
a7175123 | 8031 | object_arg = (*args)[arg_index]; |
c166b898 ILT |
8032 | ++arg_index; |
8033 | } | |
a7175123 | 8034 | argarray[j++] = build_this (object_arg); |
c73964b2 | 8035 | parm = TREE_CHAIN (parm); |
8dc2b103 NS |
8036 | /* We should never try to call the abstract constructor. */ |
8037 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn)); | |
c8094d83 | 8038 | |
e0fff4b3 | 8039 | if (DECL_HAS_VTT_PARM_P (fn)) |
c73964b2 | 8040 | { |
9771b263 | 8041 | argarray[j++] = (*args)[arg_index]; |
c166b898 | 8042 | ++arg_index; |
c73964b2 MS |
8043 | parm = TREE_CHAIN (parm); |
8044 | } | |
4ce8c5de JM |
8045 | |
8046 | if (flags & LOOKUP_PREFER_RVALUE) | |
8047 | { | |
8048 | /* The implicit move specified in 15.8.3/3 fails "...if the type of | |
8049 | the first parameter of the selected constructor is not an rvalue | |
37170829 | 8050 | reference to the object's type (possibly cv-qualified)...." */ |
4ce8c5de JM |
8051 | gcc_assert (!(complain & tf_error)); |
8052 | tree ptype = convs[0]->type; | |
9f613f06 | 8053 | if (!TYPE_REF_P (ptype) |
4ce8c5de JM |
8054 | || !TYPE_REF_IS_RVALUE (ptype) |
8055 | || CONVERSION_RANK (convs[0]) > cr_exact) | |
8056 | return error_mark_node; | |
8057 | } | |
c8094d83 | 8058 | } |
c73964b2 MS |
8059 | /* Bypass access control for 'this' parameter. */ |
8060 | else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
8061 | { | |
d11ad92e | 8062 | tree parmtype = TREE_VALUE (parm); |
a7175123 JM |
8063 | tree arg = build_this (first_arg != NULL_TREE |
8064 | ? first_arg | |
8065 | : (*args)[arg_index]); | |
c166b898 | 8066 | tree argtype = TREE_TYPE (arg); |
4ba126e4 | 8067 | tree converted_arg; |
3baab484 | 8068 | tree base_binfo; |
c8094d83 | 8069 | |
84dd815f JM |
8070 | if (arg == error_mark_node) |
8071 | return error_mark_node; | |
8072 | ||
5bd61841 | 8073 | if (convs[i]->bad_p) |
5ade1ed2 DG |
8074 | { |
8075 | if (complain & tf_error) | |
3f55e16a | 8076 | { |
097f82ec | 8077 | auto_diagnostic_group d; |
3f55e16a JM |
8078 | if (permerror (input_location, "passing %qT as %<this%> " |
8079 | "argument discards qualifiers", | |
8080 | TREE_TYPE (argtype))) | |
8081 | inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn); | |
8082 | } | |
5ade1ed2 DG |
8083 | else |
8084 | return error_mark_node; | |
8085 | } | |
91063b51 | 8086 | |
1fa2969f PC |
8087 | /* See if the function member or the whole class type is declared |
8088 | final and the call can be devirtualized. */ | |
8089 | if (DECL_FINAL_P (fn) | |
8090 | || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn)))) | |
8091 | flags |= LOOKUP_NONVIRTUAL; | |
8092 | ||
51ddb82e JM |
8093 | /* [class.mfct.nonstatic]: If a nonstatic member function of a class |
8094 | X is called for an object that is not of type X, or of a type | |
8095 | derived from X, the behavior is undefined. | |
8096 | ||
0cbd7506 | 8097 | So we can assume that anything passed as 'this' is non-null, and |
51ddb82e | 8098 | optimize accordingly. */ |
50e10fa8 | 8099 | gcc_assert (TYPE_PTR_P (parmtype)); |
4ba126e4 | 8100 | /* Convert to the base in which the function was declared. */ |
50bc768d | 8101 | gcc_assert (cand->conversion_path != NULL_TREE); |
4ba126e4 | 8102 | converted_arg = build_base_path (PLUS_EXPR, |
c166b898 | 8103 | arg, |
4ba126e4 | 8104 | cand->conversion_path, |
a271590a | 8105 | 1, complain); |
bd16cb25 | 8106 | /* Check that the base class is accessible. */ |
c8094d83 | 8107 | if (!accessible_base_p (TREE_TYPE (argtype), |
18e4be85 | 8108 | BINFO_TYPE (cand->conversion_path), true)) |
76545796 PC |
8109 | { |
8110 | if (complain & tf_error) | |
8111 | error ("%qT is not an accessible base of %qT", | |
8112 | BINFO_TYPE (cand->conversion_path), | |
8113 | TREE_TYPE (argtype)); | |
8114 | else | |
8115 | return error_mark_node; | |
8116 | } | |
3baab484 | 8117 | /* If fn was found by a using declaration, the conversion path |
0cbd7506 MS |
8118 | will be to the derived class, not the base declaring fn. We |
8119 | must convert from derived to base. */ | |
3baab484 | 8120 | base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)), |
22854930 PC |
8121 | TREE_TYPE (parmtype), ba_unique, |
8122 | NULL, complain); | |
3baab484 | 8123 | converted_arg = build_base_path (PLUS_EXPR, converted_arg, |
a271590a | 8124 | base_binfo, 1, complain); |
c8094d83 | 8125 | |
94a0dd7b | 8126 | argarray[j++] = converted_arg; |
c73964b2 | 8127 | parm = TREE_CHAIN (parm); |
c166b898 ILT |
8128 | if (first_arg != NULL_TREE) |
8129 | first_arg = NULL_TREE; | |
8130 | else | |
8131 | ++arg_index; | |
c73964b2 | 8132 | ++i; |
d11ad92e | 8133 | is_method = 1; |
c73964b2 MS |
8134 | } |
8135 | ||
c166b898 | 8136 | gcc_assert (first_arg == NULL_TREE); |
9771b263 | 8137 | for (; arg_index < vec_safe_length (args) && parm; |
c166b898 | 8138 | parm = TREE_CHAIN (parm), ++arg_index, ++i) |
c73964b2 MS |
8139 | { |
8140 | tree type = TREE_VALUE (parm); | |
9771b263 | 8141 | tree arg = (*args)[arg_index]; |
2e1df0f0 | 8142 | bool conversion_warning = true; |
d11ad92e | 8143 | |
5bd61841 | 8144 | conv = convs[i]; |
a5c42740 | 8145 | |
2e1df0f0 DN |
8146 | /* If the argument is NULL and used to (implicitly) instantiate a |
8147 | template function (and bind one of the template arguments to | |
8148 | the type of 'long int'), we don't want to warn about passing NULL | |
8149 | to non-pointer argument. | |
8150 | For example, if we have this template function: | |
8151 | ||
8152 | template<typename T> void func(T x) {} | |
8153 | ||
8154 | we want to warn (when -Wconversion is enabled) in this case: | |
8155 | ||
8156 | void foo() { | |
8157 | func<int>(NULL); | |
8158 | } | |
8159 | ||
8160 | but not in this case: | |
8161 | ||
8162 | void foo() { | |
8163 | func(NULL); | |
8164 | } | |
8165 | */ | |
9a004410 | 8166 | if (null_node_p (arg) |
2e1df0f0 DN |
8167 | && DECL_TEMPLATE_INFO (fn) |
8168 | && cand->template_decl | |
8169 | && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS)) | |
8170 | conversion_warning = false; | |
8171 | ||
5f5babf1 JM |
8172 | /* Warn about initializer_list deduction that isn't currently in the |
8173 | working draft. */ | |
8174 | if (cxx_dialect > cxx98 | |
8175 | && flag_deduce_init_list | |
8176 | && cand->template_decl | |
9d2b7551 JM |
8177 | && is_std_init_list (non_reference (type)) |
8178 | && BRACE_ENCLOSED_INITIALIZER_P (arg)) | |
5f5babf1 JM |
8179 | { |
8180 | tree tmpl = TI_TEMPLATE (cand->template_decl); | |
8181 | tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn)); | |
8182 | tree patparm = get_pattern_parm (realparm, tmpl); | |
d097567d JM |
8183 | tree pattype = TREE_TYPE (patparm); |
8184 | if (PACK_EXPANSION_P (pattype)) | |
8185 | pattype = PACK_EXPANSION_PATTERN (pattype); | |
8186 | pattype = non_reference (pattype); | |
5f5babf1 | 8187 | |
f18ea1bf JM |
8188 | if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM |
8189 | && (cand->explicit_targs == NULL_TREE | |
8190 | || (TREE_VEC_LENGTH (cand->explicit_targs) | |
8191 | <= TEMPLATE_TYPE_IDX (pattype)))) | |
5f5babf1 JM |
8192 | { |
8193 | pedwarn (input_location, 0, "deducing %qT as %qT", | |
8194 | non_reference (TREE_TYPE (patparm)), | |
8195 | non_reference (type)); | |
4b1cbcee PC |
8196 | pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0, |
8197 | " in call to %qD", cand->fn); | |
5f5babf1 JM |
8198 | pedwarn (input_location, 0, |
8199 | " (you can disable this with -fno-deduce-init-list)"); | |
8200 | } | |
8201 | } | |
36cbfdb0 JM |
8202 | |
8203 | /* Set user_conv_p on the argument conversions, so rvalue/base handling | |
8204 | knows not to allow any more UDCs. This needs to happen after we | |
8205 | process cand->warnings. */ | |
8206 | if (flags & LOOKUP_NO_CONVERSION) | |
8207 | conv->user_conv_p = true; | |
8208 | ||
5a201862 | 8209 | tsubst_flags_t arg_complain = complain; |
680ed106 JM |
8210 | if (!conversion_warning) |
8211 | arg_complain &= ~tf_warning; | |
5f5babf1 | 8212 | |
680ed106 JM |
8213 | val = convert_like_with_context (conv, arg, fn, i - is_method, |
8214 | arg_complain); | |
8215 | val = convert_for_arg_passing (type, val, arg_complain); | |
1141ed3f | 8216 | |
267e265c | 8217 | if (val == error_mark_node) |
5ade1ed2 DG |
8218 | return error_mark_node; |
8219 | else | |
8220 | argarray[j++] = val; | |
c73964b2 MS |
8221 | } |
8222 | ||
8223 | /* Default arguments */ | |
c3f08228 | 8224 | for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++) |
7cc35b68 PC |
8225 | { |
8226 | if (TREE_VALUE (parm) == error_mark_node) | |
8227 | return error_mark_node; | |
1aeafba2 JM |
8228 | val = convert_default_arg (TREE_VALUE (parm), |
8229 | TREE_PURPOSE (parm), | |
8230 | fn, i - is_method, | |
8231 | complain); | |
8232 | if (val == error_mark_node) | |
8233 | return error_mark_node; | |
8234 | argarray[j++] = val; | |
7cc35b68 PC |
8235 | } |
8236 | ||
c73964b2 | 8237 | /* Ellipsis */ |
4eb24e01 | 8238 | int magic = magic_varargs_p (fn); |
9771b263 | 8239 | for (; arg_index < vec_safe_length (args); ++arg_index) |
a6f86b51 | 8240 | { |
9771b263 | 8241 | tree a = (*args)[arg_index]; |
00085092 | 8242 | if ((magic == 3 && arg_index == 2) || magic == 2) |
17366700 JJ |
8243 | { |
8244 | /* Do no conversions for certain magic varargs. */ | |
8245 | a = mark_type_use (a); | |
8246 | if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a)) | |
8247 | return error_mark_node; | |
8248 | } | |
00085092 | 8249 | else if (magic != 0) |
17366700 JJ |
8250 | /* For other magic varargs only do decay_conversion. */ |
8251 | a = decay_conversion (a, complain); | |
9efe5fbd JM |
8252 | else if (DECL_CONSTRUCTOR_P (fn) |
8253 | && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn), | |
8254 | TREE_TYPE (a))) | |
8255 | { | |
8256 | /* Avoid infinite recursion trying to call A(...). */ | |
8257 | if (complain & tf_error) | |
8258 | /* Try to call the actual copy constructor for a good error. */ | |
8259 | call_copy_ctor (a, complain); | |
8260 | return error_mark_node; | |
8261 | } | |
a6f86b51 | 8262 | else |
b40e334f | 8263 | a = convert_arg_to_ellipsis (a, complain); |
17366700 JJ |
8264 | if (a == error_mark_node) |
8265 | return error_mark_node; | |
94a0dd7b | 8266 | argarray[j++] = a; |
a6f86b51 | 8267 | } |
c73964b2 | 8268 | |
94a0dd7b SL |
8269 | gcc_assert (j <= nargs); |
8270 | nargs = j; | |
c73964b2 | 8271 | |
cda0a029 JM |
8272 | /* Avoid to do argument-transformation, if warnings for format, and for |
8273 | nonnull are disabled. Just in case that at least one of them is active | |
8274 | the check_function_arguments function might warn about something. */ | |
8275 | ||
0dba7960 | 8276 | bool warned_p = false; |
4227c9ad JJ |
8277 | if (warn_nonnull |
8278 | || warn_format | |
8279 | || warn_suggest_attribute_format | |
8280 | || warn_restrict) | |
cda0a029 JM |
8281 | { |
8282 | tree *fargs = (!nargs ? argarray | |
8283 | : (tree *) alloca (nargs * sizeof (tree))); | |
8284 | for (j = 0; j < nargs; j++) | |
5f2440b0 JM |
8285 | { |
8286 | /* For -Wformat undo the implicit passing by hidden reference | |
8287 | done by convert_arg_to_ellipsis. */ | |
8288 | if (TREE_CODE (argarray[j]) == ADDR_EXPR | |
9f613f06 | 8289 | && TYPE_REF_P (TREE_TYPE (argarray[j]))) |
5f2440b0 JM |
8290 | fargs[j] = TREE_OPERAND (argarray[j], 0); |
8291 | else | |
b2bf438c | 8292 | fargs[j] = argarray[j]; |
5f2440b0 | 8293 | } |
cda0a029 | 8294 | |
4227c9ad | 8295 | warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn), |
b2bf438c | 8296 | nargs, fargs, NULL); |
cda0a029 | 8297 | } |
61cd552e | 8298 | |
31f7f784 JM |
8299 | if (DECL_INHERITED_CTOR (fn)) |
8300 | { | |
8301 | /* Check for passing ellipsis arguments to an inherited constructor. We | |
8302 | could handle this by open-coding the inherited constructor rather than | |
8303 | defining it, but let's not bother now. */ | |
8304 | if (!cp_unevaluated_operand | |
c484627c | 8305 | && cand->num_convs |
31f7f784 JM |
8306 | && cand->convs[cand->num_convs-1]->ellipsis_p) |
8307 | { | |
8308 | if (complain & tf_error) | |
8309 | { | |
8310 | sorry ("passing arguments to ellipsis of inherited constructor " | |
8311 | "%qD", cand->fn); | |
8312 | inform (DECL_SOURCE_LOCATION (cand->fn), "declared here"); | |
8313 | } | |
8314 | return error_mark_node; | |
8315 | } | |
8316 | ||
8317 | /* A base constructor inheriting from a virtual base doesn't get the | |
8318 | inherited arguments, just this and __vtt. */ | |
8319 | if (ctor_omit_inherited_parms (fn)) | |
8320 | nargs = 2; | |
8321 | } | |
8322 | ||
c11b6f21 MS |
8323 | /* Avoid actually calling copy constructors and copy assignment operators, |
8324 | if possible. */ | |
56ae6d77 | 8325 | |
2170d4b6 | 8326 | if (! flag_elide_constructors && !force_elide) |
56ae6d77 | 8327 | /* Do things the hard way. */; |
8af2fec4 RY |
8328 | else if (cand->num_convs == 1 |
8329 | && (DECL_COPY_CONSTRUCTOR_P (fn) | |
04bbdb1d PC |
8330 | || DECL_MOVE_CONSTRUCTOR_P (fn)) |
8331 | /* It's unsafe to elide the constructor when handling | |
8332 | a noexcept-expression, it may evaluate to the wrong | |
8333 | value (c++/53025). */ | |
2170d4b6 | 8334 | && (force_elide || cp_noexcept_operand == 0)) |
c11b6f21 | 8335 | { |
eb66be0e | 8336 | tree targ; |
c166b898 ILT |
8337 | tree arg = argarray[num_artificial_parms_for (fn)]; |
8338 | tree fa; | |
ac177431 | 8339 | bool trivial = trivial_fn_p (fn); |
c11b6f21 MS |
8340 | |
8341 | /* Pull out the real argument, disregarding const-correctness. */ | |
eb66be0e | 8342 | targ = arg; |
1ee26047 JM |
8343 | /* Strip the reference binding for the constructor parameter. */ |
8344 | if (CONVERT_EXPR_P (targ) | |
9f613f06 | 8345 | && TYPE_REF_P (TREE_TYPE (targ))) |
1ee26047 JM |
8346 | targ = TREE_OPERAND (targ, 0); |
8347 | /* But don't strip any other reference bindings; binding a temporary to a | |
8348 | reference prevents copy elision. */ | |
8349 | while ((CONVERT_EXPR_P (targ) | |
9f613f06 | 8350 | && !TYPE_REF_P (TREE_TYPE (targ))) |
63a906f0 | 8351 | || TREE_CODE (targ) == NON_LVALUE_EXPR) |
eb66be0e MS |
8352 | targ = TREE_OPERAND (targ, 0); |
8353 | if (TREE_CODE (targ) == ADDR_EXPR) | |
8354 | { | |
8355 | targ = TREE_OPERAND (targ, 0); | |
c8094d83 | 8356 | if (!same_type_ignoring_top_level_qualifiers_p |
9edc3913 | 8357 | (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ))) |
c11b6f21 MS |
8358 | targ = NULL_TREE; |
8359 | } | |
eb66be0e MS |
8360 | else |
8361 | targ = NULL_TREE; | |
c11b6f21 MS |
8362 | |
8363 | if (targ) | |
8364 | arg = targ; | |
8365 | else | |
04757a2a | 8366 | arg = cp_build_fold_indirect_ref (arg); |
c11b6f21 | 8367 | |
b7558a2c JM |
8368 | /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base |
8369 | subobject. */ | |
7b936140 | 8370 | if (CHECKING_P && cxx_dialect >= cxx17) |
b7558a2c | 8371 | gcc_assert (TREE_CODE (arg) != TARGET_EXPR |
2170d4b6 | 8372 | || force_elide |
d276da0c JM |
8373 | /* It's from binding the ref parm to a packed field. */ |
8374 | || convs[0]->need_temporary_p | |
36cbfdb0 | 8375 | || seen_error () |
b7558a2c JM |
8376 | /* See unsafe_copy_elision_p. */ |
8377 | || DECL_BASE_CONSTRUCTOR_P (fn)); | |
8378 | ||
b46b715d JM |
8379 | fa = argarray[0]; |
8380 | bool unsafe = unsafe_copy_elision_p (fa, arg); | |
8381 | bool eliding_temp = (TREE_CODE (arg) == TARGET_EXPR && !unsafe); | |
8382 | ||
8383 | /* [class.copy]: the copy constructor is implicitly defined even if the | |
8384 | implementation elided its use. But don't warn about deprecation when | |
8385 | eliding a temporary, as then no copy is actually performed. */ | |
8386 | warning_sentinel s (warn_deprecated_copy, eliding_temp); | |
8387 | if (force_elide) | |
8388 | /* The language says this isn't called. */; | |
8389 | else if (!trivial) | |
b87d79e6 | 8390 | { |
9f635aba PC |
8391 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
8392 | return error_mark_node; | |
b87d79e6 JM |
8393 | already_used = true; |
8394 | } | |
b46b715d JM |
8395 | else |
8396 | cp_warn_deprecated_use (fn, complain); | |
bd6dd845 | 8397 | |
c11b6f21 | 8398 | /* If we're creating a temp and we already have one, don't create a |
0cbd7506 MS |
8399 | new one. If we're not creating a temp but we get one, use |
8400 | INIT_EXPR to collapse the temp into our target. Otherwise, if the | |
8401 | ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a | |
8402 | temp or an INIT_EXPR otherwise. */ | |
1dbdb756 | 8403 | if (is_dummy_object (fa)) |
c11b6f21 | 8404 | { |
c246c65d | 8405 | if (TREE_CODE (arg) == TARGET_EXPR) |
c11b6f21 | 8406 | return arg; |
ac177431 | 8407 | else if (trivial) |
574cfaa4 | 8408 | return force_target_expr (DECL_CONTEXT (fn), arg, complain); |
c11b6f21 | 8409 | } |
d5ec842c | 8410 | else if ((trivial || TREE_CODE (arg) == TARGET_EXPR) |
b46b715d | 8411 | && !unsafe) |
c11b6f21 | 8412 | { |
04757a2a | 8413 | tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa)); |
a59ca936 | 8414 | |
6d729f28 | 8415 | val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg); |
6de9cd9a | 8416 | return val; |
c11b6f21 MS |
8417 | } |
8418 | } | |
137073d3 NS |
8419 | else if (DECL_ASSIGNMENT_OPERATOR_P (fn) |
8420 | && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR) | |
18101e73 | 8421 | && trivial_fn_p (fn)) |
c11b6f21 | 8422 | { |
5a0802ea | 8423 | tree to = cp_stabilize_reference |
04757a2a | 8424 | (cp_build_fold_indirect_ref (argarray[0])); |
a0c68737 NS |
8425 | tree type = TREE_TYPE (to); |
8426 | tree as_base = CLASSTYPE_AS_BASE (type); | |
c166b898 | 8427 | tree arg = argarray[1]; |
6bdfada4 | 8428 | location_t loc = cp_expr_loc_or_loc (arg, input_location); |
a59ca936 | 8429 | |
9ba59715 JM |
8430 | if (is_really_empty_class (type)) |
8431 | { | |
8432 | /* Avoid copying empty classes. */ | |
4eb24e01 | 8433 | val = build2 (COMPOUND_EXPR, type, arg, to); |
9ba59715 JM |
8434 | TREE_NO_WARNING (val) = 1; |
8435 | } | |
8436 | else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base))) | |
1d528e29 | 8437 | { |
04eb9c55 JM |
8438 | if (is_std_init_list (type) |
8439 | && conv_binds_ref_to_prvalue (convs[1])) | |
8440 | warning_at (loc, OPT_Winit_list_lifetime, | |
8441 | "assignment from temporary initializer_list does not " | |
8442 | "extend the lifetime of the underlying array"); | |
04757a2a | 8443 | arg = cp_build_fold_indirect_ref (arg); |
f293ce4b | 8444 | val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg); |
1d528e29 | 8445 | } |
a0c68737 NS |
8446 | else |
8447 | { | |
6aeb8c99 RG |
8448 | /* We must only copy the non-tail padding parts. */ |
8449 | tree arg0, arg2, t; | |
8450 | tree array_type, alias_set; | |
1d528e29 | 8451 | |
94a0dd7b | 8452 | arg2 = TYPE_SIZE_UNIT (as_base); |
93c0e0bb | 8453 | arg0 = cp_build_addr_expr (to, complain); |
15237f9a | 8454 | |
68d01920 | 8455 | array_type = build_array_type (unsigned_char_type_node, |
6aeb8c99 RG |
8456 | build_index_type |
8457 | (size_binop (MINUS_EXPR, | |
8458 | arg2, size_int (1)))); | |
8459 | alias_set = build_int_cst (build_pointer_type (type), 0); | |
8460 | t = build2 (MODIFY_EXPR, void_type_node, | |
8461 | build2 (MEM_REF, array_type, arg0, alias_set), | |
8462 | build2 (MEM_REF, array_type, arg, alias_set)); | |
8463 | val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to); | |
041d7a27 | 8464 | TREE_NO_WARNING (val) = 1; |
a0c68737 | 8465 | } |
c8094d83 | 8466 | |
b46b715d JM |
8467 | cp_warn_deprecated_use (fn, complain); |
8468 | ||
c11b6f21 MS |
8469 | return val; |
8470 | } | |
18101e73 | 8471 | else if (trivial_fn_p (fn)) |
d0b0fbd9 JM |
8472 | { |
8473 | if (DECL_DESTRUCTOR_P (fn)) | |
cdc18417 | 8474 | return build_trivial_dtor_call (argarray[0]); |
d0b0fbd9 JM |
8475 | else if (default_ctor_p (fn)) |
8476 | { | |
8477 | if (is_dummy_object (argarray[0])) | |
5a201862 NS |
8478 | return force_target_expr (DECL_CONTEXT (fn), void_node, |
8479 | no_cleanup_complain); | |
d0b0fbd9 | 8480 | else |
04757a2a | 8481 | return cp_build_fold_indirect_ref (argarray[0]); |
d0b0fbd9 JM |
8482 | } |
8483 | } | |
c11b6f21 | 8484 | |
2170d4b6 JM |
8485 | gcc_assert (!force_elide); |
8486 | ||
39344c99 | 8487 | if (!already_used |
41cee85a | 8488 | && !mark_used (fn, complain)) |
39344c99 | 8489 | return error_mark_node; |
bd6dd845 | 8490 | |
e99ef408 JJ |
8491 | /* Warn if the built-in writes to an object of a non-trivial type. */ |
8492 | if (warn_class_memaccess | |
8493 | && vec_safe_length (args) >= 2 | |
8494 | && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL) | |
8495 | maybe_warn_class_memaccess (input_location, fn, args); | |
8496 | ||
bf8d8309 | 8497 | if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0) |
c73964b2 | 8498 | { |
94a0dd7b SL |
8499 | tree t; |
8500 | tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])), | |
e93ee644 | 8501 | DECL_CONTEXT (fn), |
22854930 | 8502 | ba_any, NULL, complain); |
50bc768d | 8503 | gcc_assert (binfo && binfo != error_mark_node); |
c8094d83 | 8504 | |
a271590a PC |
8505 | argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1, |
8506 | complain); | |
94a0dd7b SL |
8507 | if (TREE_SIDE_EFFECTS (argarray[0])) |
8508 | argarray[0] = save_expr (argarray[0]); | |
c73964b2 | 8509 | t = build_pointer_type (TREE_TYPE (fn)); |
bfecd57c | 8510 | fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn)); |
c73964b2 MS |
8511 | TREE_TYPE (fn) = t; |
8512 | } | |
c73964b2 | 8513 | else |
89fcabaf PC |
8514 | { |
8515 | fn = build_addr_func (fn, complain); | |
8516 | if (fn == error_mark_node) | |
8517 | return error_mark_node; | |
8518 | } | |
c73964b2 | 8519 | |
4561285b | 8520 | tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag); |
31f7f784 JM |
8521 | if (call == error_mark_node) |
8522 | return call; | |
8523 | if (cand->flags & LOOKUP_LIST_INIT_CTOR) | |
4eb24e01 JM |
8524 | { |
8525 | tree c = extract_call_expr (call); | |
8526 | /* build_new_op_1 will clear this when appropriate. */ | |
8527 | CALL_EXPR_ORDERED_ARGS (c) = true; | |
8528 | } | |
0dba7960 JJ |
8529 | if (warned_p) |
8530 | { | |
8531 | tree c = extract_call_expr (call); | |
8532 | if (TREE_CODE (c) == CALL_EXPR) | |
8533 | TREE_NO_WARNING (c) = 1; | |
8534 | } | |
4561285b | 8535 | return call; |
b2dd096b MM |
8536 | } |
8537 | ||
e65fc7c5 MS |
8538 | namespace |
8539 | { | |
c3684b7b | 8540 | |
e65fc7c5 MS |
8541 | /* Return the DECL of the first non-static subobject of class TYPE |
8542 | that satisfies the predicate PRED or null if none can be found. */ | |
8543 | ||
8544 | template <class Predicate> | |
8545 | tree | |
8546 | first_non_static_field (tree type, Predicate pred) | |
c3684b7b | 8547 | { |
e65fc7c5 | 8548 | if (!type || !CLASS_TYPE_P (type)) |
c3684b7b MS |
8549 | return NULL_TREE; |
8550 | ||
8551 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
8552 | { | |
8553 | if (TREE_CODE (field) != FIELD_DECL) | |
8554 | continue; | |
8555 | if (TREE_STATIC (field)) | |
8556 | continue; | |
e65fc7c5 | 8557 | if (pred (field)) |
c3684b7b MS |
8558 | return field; |
8559 | } | |
8560 | ||
8561 | int i = 0; | |
8562 | ||
8563 | for (tree base_binfo, binfo = TYPE_BINFO (type); | |
8564 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8565 | { | |
8566 | tree base = TREE_TYPE (base_binfo); | |
e65fc7c5 MS |
8567 | if (pred (base)) |
8568 | return base; | |
8569 | if (tree field = first_non_static_field (base, pred)) | |
c3684b7b MS |
8570 | return field; |
8571 | } | |
8572 | ||
8573 | return NULL_TREE; | |
8574 | } | |
8575 | ||
e65fc7c5 MS |
8576 | struct NonPublicField |
8577 | { | |
8578 | bool operator() (const_tree t) | |
8579 | { | |
8580 | return DECL_P (t) && (TREE_PRIVATE (t) || TREE_PROTECTED (t)); | |
8581 | } | |
8582 | }; | |
8583 | ||
8584 | /* Return the DECL of the first non-public subobject of class TYPE | |
8585 | or null if none can be found. */ | |
8586 | ||
8587 | static inline tree | |
8588 | first_non_public_field (tree type) | |
8589 | { | |
8590 | return first_non_static_field (type, NonPublicField ()); | |
8591 | } | |
8592 | ||
8593 | struct NonTrivialField | |
8594 | { | |
8595 | bool operator() (const_tree t) | |
8596 | { | |
8597 | return !trivial_type_p (DECL_P (t) ? TREE_TYPE (t) : t); | |
8598 | } | |
8599 | }; | |
8600 | ||
8601 | /* Return the DECL of the first non-trivial subobject of class TYPE | |
8602 | or null if none can be found. */ | |
8603 | ||
8604 | static inline tree | |
8605 | first_non_trivial_field (tree type) | |
8606 | { | |
8607 | return first_non_static_field (type, NonTrivialField ()); | |
8608 | } | |
8609 | ||
8610 | } /* unnamed namespace */ | |
8611 | ||
c3684b7b MS |
8612 | /* Return true if all copy and move assignment operator overloads for |
8613 | class TYPE are trivial and at least one of them is not deleted and, | |
8614 | when ACCESS is set, accessible. Return false otherwise. Set | |
8615 | HASASSIGN to true when the TYPE has a (not necessarily trivial) | |
8616 | copy or move assignment. */ | |
8617 | ||
8618 | static bool | |
8619 | has_trivial_copy_assign_p (tree type, bool access, bool *hasassign) | |
8620 | { | |
137073d3 | 8621 | tree fns = get_class_binding (type, assign_op_identifier); |
c3684b7b MS |
8622 | bool all_trivial = true; |
8623 | ||
8624 | /* Iterate over overloads of the assignment operator, checking | |
8625 | accessible copy assignments for triviality. */ | |
8626 | ||
8627 | for (ovl_iterator oi (fns); oi; ++oi) | |
8628 | { | |
8629 | tree f = *oi; | |
8630 | ||
8631 | /* Skip operators that aren't copy assignments. */ | |
8632 | if (!copy_fn_p (f)) | |
8633 | continue; | |
8634 | ||
8635 | bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f)) | |
8636 | || accessible_p (TYPE_BINFO (type), f, true)); | |
8637 | ||
8638 | /* Skip template assignment operators and deleted functions. */ | |
8639 | if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f)) | |
8640 | continue; | |
8641 | ||
8642 | if (accessible) | |
8643 | *hasassign = true; | |
8644 | ||
8645 | if (!accessible || !trivial_fn_p (f)) | |
8646 | all_trivial = false; | |
8647 | ||
8648 | /* Break early when both properties have been determined. */ | |
8649 | if (*hasassign && !all_trivial) | |
8650 | break; | |
8651 | } | |
8652 | ||
8653 | /* Return true if they're all trivial and one of the expressions | |
8654 | TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */ | |
8655 | tree ref = cp_build_reference_type (type, false); | |
8656 | return (all_trivial | |
8657 | && (is_trivially_xible (MODIFY_EXPR, type, type) | |
8658 | || is_trivially_xible (MODIFY_EXPR, type, ref))); | |
8659 | } | |
8660 | ||
8661 | /* Return true if all copy and move ctor overloads for class TYPE are | |
8662 | trivial and at least one of them is not deleted and, when ACCESS is | |
8663 | set, accessible. Return false otherwise. Set each element of HASCTOR[] | |
8664 | to true when the TYPE has a (not necessarily trivial) default and copy | |
8665 | (or move) ctor, respectively. */ | |
8666 | ||
8667 | static bool | |
8668 | has_trivial_copy_p (tree type, bool access, bool hasctor[2]) | |
8669 | { | |
527b7b19 | 8670 | tree fns = get_class_binding (type, complete_ctor_identifier); |
c3684b7b MS |
8671 | bool all_trivial = true; |
8672 | ||
8673 | for (ovl_iterator oi (fns); oi; ++oi) | |
8674 | { | |
8675 | tree f = *oi; | |
8676 | ||
8677 | /* Skip template constructors. */ | |
8678 | if (TREE_CODE (f) != FUNCTION_DECL) | |
8679 | continue; | |
8680 | ||
8681 | bool cpy_or_move_ctor_p = copy_fn_p (f); | |
8682 | ||
8683 | /* Skip ctors other than default, copy, and move. */ | |
8684 | if (!cpy_or_move_ctor_p && !default_ctor_p (f)) | |
8685 | continue; | |
8686 | ||
8687 | if (DECL_DELETED_FN (f)) | |
8688 | continue; | |
8689 | ||
8690 | bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f)) | |
8691 | || accessible_p (TYPE_BINFO (type), f, true)); | |
8692 | ||
8693 | if (accessible) | |
8694 | hasctor[cpy_or_move_ctor_p] = true; | |
8695 | ||
8696 | if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f))) | |
8697 | all_trivial = false; | |
8698 | ||
8699 | /* Break early when both properties have been determined. */ | |
8700 | if (hasctor[0] && hasctor[1] && !all_trivial) | |
8701 | break; | |
8702 | } | |
8703 | ||
8704 | return all_trivial; | |
8705 | } | |
8706 | ||
8707 | /* Issue a warning on a call to the built-in function FNDECL if it is | |
8708 | a raw memory write whose destination is not an object of (something | |
8709 | like) trivial or standard layout type with a non-deleted assignment | |
8710 | and copy ctor. Detects const correctness violations, corrupting | |
8711 | references, virtual table pointers, and bypassing non-trivial | |
8712 | assignments. */ | |
8713 | ||
8714 | static void | |
e99ef408 JJ |
8715 | maybe_warn_class_memaccess (location_t loc, tree fndecl, |
8716 | const vec<tree, va_gc> *args) | |
c3684b7b MS |
8717 | { |
8718 | /* Except for bcopy where it's second, the destination pointer is | |
8719 | the first argument for all functions handled here. Compute | |
8720 | the index of the destination and source arguments. */ | |
8721 | unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY; | |
8722 | unsigned srcidx = !dstidx; | |
8723 | ||
e99ef408 | 8724 | tree dest = (*args)[dstidx]; |
71a93b08 | 8725 | if (!TREE_TYPE (dest) || !INDIRECT_TYPE_P (TREE_TYPE (dest))) |
c3684b7b MS |
8726 | return; |
8727 | ||
c3684b7b MS |
8728 | tree srctype = NULL_TREE; |
8729 | ||
8730 | /* Determine the type of the pointed-to object and whether it's | |
8731 | a complete class type. */ | |
8732 | tree desttype = TREE_TYPE (TREE_TYPE (dest)); | |
8733 | ||
8734 | if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype)) | |
8735 | return; | |
8736 | ||
e65fc7c5 MS |
8737 | /* Check to see if the raw memory call is made by a non-static member |
8738 | function with THIS as the destination argument for the destination | |
8739 | type. If so, and if the class has no non-trivial bases or members, | |
8740 | be more permissive. */ | |
c3684b7b | 8741 | if (current_function_decl |
e65fc7c5 | 8742 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl) |
4b377e01 | 8743 | && is_this_parameter (tree_strip_nop_conversions (dest))) |
c3684b7b MS |
8744 | { |
8745 | tree ctx = DECL_CONTEXT (current_function_decl); | |
8746 | bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype); | |
c3684b7b MS |
8747 | tree binfo = TYPE_BINFO (ctx); |
8748 | ||
e65fc7c5 MS |
8749 | if (special |
8750 | && !BINFO_VTABLE (binfo) | |
8751 | && !first_non_trivial_field (desttype)) | |
c3684b7b MS |
8752 | return; |
8753 | } | |
8754 | ||
8755 | /* True if the class is trivial. */ | |
8756 | bool trivial = trivial_type_p (desttype); | |
8757 | ||
8758 | /* Set to true if DESTYPE has an accessible copy assignment. */ | |
8759 | bool hasassign = false; | |
8760 | /* True if all of the class' overloaded copy assignment operators | |
8761 | are all trivial (and not deleted) and at least one of them is | |
8762 | accessible. */ | |
8763 | bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign); | |
8764 | ||
8765 | /* Set to true if DESTTYPE has an accessible default and copy ctor, | |
8766 | respectively. */ | |
8767 | bool hasctors[2] = { false, false }; | |
8768 | ||
8769 | /* True if all of the class' overloaded copy constructors are all | |
8770 | trivial (and not deleted) and at least one of them is accessible. */ | |
8771 | bool trivcopy = has_trivial_copy_p (desttype, true, hasctors); | |
8772 | ||
8773 | /* Set FLD to the first private/protected member of the class. */ | |
8774 | tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE; | |
8775 | ||
8776 | /* The warning format string. */ | |
8777 | const char *warnfmt = NULL; | |
8778 | /* A suggested alternative to offer instead of the raw memory call. | |
8779 | Empty string when none can be come up with. */ | |
8780 | const char *suggest = ""; | |
8781 | bool warned = false; | |
8782 | ||
8783 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8784 | { | |
8785 | case BUILT_IN_MEMSET: | |
e99ef408 | 8786 | if (!integer_zerop (maybe_constant_value ((*args)[1]))) |
c3684b7b MS |
8787 | { |
8788 | /* Diagnose setting non-copy-assignable or non-trivial types, | |
8789 | or types with a private member, to (potentially) non-zero | |
8790 | bytes. Since the value of the bytes being written is unknown, | |
8791 | suggest using assignment instead (if one exists). Also warn | |
8792 | for writes into objects for which zero-initialization doesn't | |
8793 | mean all bits clear (pointer-to-member data, where null is all | |
8794 | bits set). Since the value being written is (most likely) | |
8795 | non-zero, simply suggest assignment (but not copy assignment). */ | |
8796 | suggest = "; use assignment instead"; | |
8797 | if (!trivassign) | |
8798 | warnfmt = G_("%qD writing to an object of type %#qT with " | |
8799 | "no trivial copy-assignment"); | |
8800 | else if (!trivial) | |
8801 | warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s"); | |
8802 | else if (fld) | |
8803 | { | |
8804 | const char *access = TREE_PRIVATE (fld) ? "private" : "protected"; | |
8805 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8806 | "%qD writing to an object of type %#qT with " | |
8807 | "%qs member %qD", | |
8808 | fndecl, desttype, access, fld); | |
8809 | } | |
8810 | else if (!zero_init_p (desttype)) | |
8811 | warnfmt = G_("%qD writing to an object of type %#qT containing " | |
8812 | "a pointer to data member%s"); | |
8813 | ||
8814 | break; | |
8815 | } | |
8816 | /* Fall through. */ | |
8817 | ||
8818 | case BUILT_IN_BZERO: | |
8819 | /* Similarly to the above, diagnose clearing non-trivial or non- | |
8820 | standard layout objects, or objects of types with no assignmenmt. | |
8821 | Since the value being written is known to be zero, suggest either | |
8822 | copy assignment, copy ctor, or default ctor as an alternative, | |
8823 | depending on what's available. */ | |
8824 | ||
8825 | if (hasassign && hasctors[0]) | |
8826 | suggest = G_("; use assignment or value-initialization instead"); | |
8827 | else if (hasassign) | |
8828 | suggest = G_("; use assignment instead"); | |
8829 | else if (hasctors[0]) | |
8830 | suggest = G_("; use value-initialization instead"); | |
8831 | ||
8832 | if (!trivassign) | |
8833 | warnfmt = G_("%qD clearing an object of type %#qT with " | |
8834 | "no trivial copy-assignment%s"); | |
8835 | else if (!trivial) | |
8836 | warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s"); | |
8837 | else if (!zero_init_p (desttype)) | |
8838 | warnfmt = G_("%qD clearing an object of type %#qT containing " | |
8839 | "a pointer-to-member%s"); | |
8840 | break; | |
8841 | ||
8842 | case BUILT_IN_BCOPY: | |
8843 | case BUILT_IN_MEMCPY: | |
8844 | case BUILT_IN_MEMMOVE: | |
8845 | case BUILT_IN_MEMPCPY: | |
8846 | /* Determine the type of the source object. */ | |
e99ef408 | 8847 | srctype = TREE_TYPE ((*args)[srcidx]); |
71a93b08 | 8848 | if (!srctype || !INDIRECT_TYPE_P (srctype)) |
e99ef408 JJ |
8849 | srctype = void_type_node; |
8850 | else | |
8851 | srctype = TREE_TYPE (srctype); | |
c3684b7b MS |
8852 | |
8853 | /* Since it's impossible to determine wheter the byte copy is | |
8854 | being used in place of assignment to an existing object or | |
8855 | as a substitute for initialization, assume it's the former. | |
8856 | Determine the best alternative to use instead depending on | |
8857 | what's not deleted. */ | |
8858 | if (hasassign && hasctors[1]) | |
8859 | suggest = G_("; use copy-assignment or copy-initialization instead"); | |
8860 | else if (hasassign) | |
8861 | suggest = G_("; use copy-assignment instead"); | |
8862 | else if (hasctors[1]) | |
8863 | suggest = G_("; use copy-initialization instead"); | |
8864 | ||
8865 | if (!trivassign) | |
8866 | warnfmt = G_("%qD writing to an object of type %#qT with no trivial " | |
8867 | "copy-assignment%s"); | |
8868 | else if (!trivially_copyable_p (desttype)) | |
8869 | warnfmt = G_("%qD writing to an object of non-trivially copyable " | |
8870 | "type %#qT%s"); | |
8871 | else if (!trivcopy) | |
8872 | warnfmt = G_("%qD writing to an object with a deleted copy constructor"); | |
8873 | ||
8874 | else if (!trivial | |
8875 | && !VOID_TYPE_P (srctype) | |
8876 | && !char_type_p (TYPE_MAIN_VARIANT (srctype)) | |
8877 | && !same_type_ignoring_top_level_qualifiers_p (desttype, | |
8878 | srctype)) | |
8879 | { | |
8880 | /* Warn when copying into a non-trivial object from an object | |
8881 | of a different type other than void or char. */ | |
8882 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8883 | "%qD copying an object of non-trivial type " | |
8884 | "%#qT from an array of %#qT", | |
8885 | fndecl, desttype, srctype); | |
8886 | } | |
8887 | else if (fld | |
8888 | && !VOID_TYPE_P (srctype) | |
8889 | && !char_type_p (TYPE_MAIN_VARIANT (srctype)) | |
8890 | && !same_type_ignoring_top_level_qualifiers_p (desttype, | |
8891 | srctype)) | |
8892 | { | |
8893 | const char *access = TREE_PRIVATE (fld) ? "private" : "protected"; | |
8894 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8895 | "%qD copying an object of type %#qT with " | |
8896 | "%qs member %qD from an array of %#qT; use " | |
8897 | "assignment or copy-initialization instead", | |
8898 | fndecl, desttype, access, fld, srctype); | |
8899 | } | |
e99ef408 | 8900 | else if (!trivial && vec_safe_length (args) > 2) |
c3684b7b | 8901 | { |
e99ef408 JJ |
8902 | tree sz = maybe_constant_value ((*args)[2]); |
8903 | if (!tree_fits_uhwi_p (sz)) | |
8904 | break; | |
8905 | ||
c3684b7b MS |
8906 | /* Finally, warn on partial copies. */ |
8907 | unsigned HOST_WIDE_INT typesize | |
8908 | = tree_to_uhwi (TYPE_SIZE_UNIT (desttype)); | |
e99ef408 | 8909 | if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize) |
c3684b7b MS |
8910 | warned = warning_at (loc, OPT_Wclass_memaccess, |
8911 | (typesize - partial > 1 | |
8912 | ? G_("%qD writing to an object of " | |
8913 | "a non-trivial type %#qT leaves %wu " | |
8914 | "bytes unchanged") | |
8915 | : G_("%qD writing to an object of " | |
8916 | "a non-trivial type %#qT leaves %wu " | |
8917 | "byte unchanged")), | |
8918 | fndecl, desttype, typesize - partial); | |
8919 | } | |
8920 | break; | |
8921 | ||
8922 | case BUILT_IN_REALLOC: | |
8923 | ||
8924 | if (!trivially_copyable_p (desttype)) | |
8925 | warnfmt = G_("%qD moving an object of non-trivially copyable type " | |
8926 | "%#qT; use %<new%> and %<delete%> instead"); | |
8927 | else if (!trivcopy) | |
8928 | warnfmt = G_("%qD moving an object of type %#qT with deleted copy " | |
8929 | "constructor; use %<new%> and %<delete%> instead"); | |
8930 | else if (!get_dtor (desttype, tf_none)) | |
8931 | warnfmt = G_("%qD moving an object of type %#qT with deleted " | |
8932 | "destructor"); | |
e99ef408 | 8933 | else if (!trivial) |
c3684b7b | 8934 | { |
e99ef408 JJ |
8935 | tree sz = maybe_constant_value ((*args)[1]); |
8936 | if (TREE_CODE (sz) == INTEGER_CST | |
8937 | && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype))) | |
8938 | /* Finally, warn on reallocation into insufficient space. */ | |
8939 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8940 | "%qD moving an object of non-trivial type " | |
8941 | "%#qT and size %E into a region of size %E", | |
8942 | fndecl, desttype, TYPE_SIZE_UNIT (desttype), | |
8943 | sz); | |
c3684b7b MS |
8944 | } |
8945 | break; | |
8946 | ||
8947 | default: | |
8948 | return; | |
8949 | } | |
8950 | ||
c3684b7b MS |
8951 | if (warnfmt) |
8952 | { | |
8953 | if (suggest) | |
8954 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8955 | warnfmt, fndecl, desttype, suggest); | |
8956 | else | |
8957 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8958 | warnfmt, fndecl, desttype); | |
8959 | } | |
8960 | ||
8961 | if (warned) | |
8962 | inform (location_of (desttype), "%#qT declared here", desttype); | |
8963 | } | |
8964 | ||
94a0dd7b SL |
8965 | /* Build and return a call to FN, using NARGS arguments in ARGARRAY. |
8966 | This function performs no overload resolution, conversion, or other | |
8967 | high-level operations. */ | |
b2dd096b MM |
8968 | |
8969 | tree | |
e2e03032 PC |
8970 | build_cxx_call (tree fn, int nargs, tree *argarray, |
8971 | tsubst_flags_t complain) | |
b2dd096b MM |
8972 | { |
8973 | tree fndecl; | |
8974 | ||
f732fa7b | 8975 | /* Remember roughly where this call is. */ |
6bdfada4 | 8976 | location_t loc = cp_expr_loc_or_loc (fn, input_location); |
94a0dd7b | 8977 | fn = build_call_a (fn, nargs, argarray); |
f732fa7b | 8978 | SET_EXPR_LOCATION (fn, loc); |
b2dd096b | 8979 | |
b2dd096b | 8980 | fndecl = get_callee_fndecl (fn); |
b2dd096b | 8981 | |
1466cf1a RG |
8982 | /* Check that arguments to builtin functions match the expectations. */ |
8983 | if (fndecl | |
e56f6629 | 8984 | && !processing_template_decl |
3d78e008 | 8985 | && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL)) |
cda0a029 JM |
8986 | { |
8987 | int i; | |
8988 | ||
8989 | /* We need to take care that values to BUILT_IN_NORMAL | |
8990 | are reduced. */ | |
8991 | for (i = 0; i < nargs; i++) | |
e56f6629 | 8992 | argarray[i] = maybe_constant_value (argarray[i]); |
cda0a029 | 8993 | |
79ce98bc MP |
8994 | if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl, |
8995 | nargs, argarray)) | |
cda0a029 JM |
8996 | return error_mark_node; |
8997 | } | |
1466cf1a | 8998 | |
2c92b94d | 8999 | if (VOID_TYPE_P (TREE_TYPE (fn))) |
c73964b2 | 9000 | return fn; |
b2dd096b | 9001 | |
57fcd4f4 JM |
9002 | /* 5.2.2/11: If a function call is a prvalue of object type: if the |
9003 | function call is either the operand of a decltype-specifier or the | |
9004 | right operand of a comma operator that is the operand of a | |
9005 | decltype-specifier, a temporary object is not introduced for the | |
9006 | prvalue. The type of the prvalue may be incomplete. */ | |
9007 | if (!(complain & tf_decltype)) | |
9008 | { | |
9009 | fn = require_complete_type_sfinae (fn, complain); | |
9010 | if (fn == error_mark_node) | |
9011 | return error_mark_node; | |
b2dd096b | 9012 | |
57fcd4f4 | 9013 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn))) |
f3ec182d JM |
9014 | { |
9015 | fn = build_cplus_new (TREE_TYPE (fn), fn, complain); | |
9016 | maybe_warn_parm_abi (TREE_TYPE (fn), loc); | |
9017 | } | |
57fcd4f4 | 9018 | } |
b82b76c6 | 9019 | return convert_from_reference (fn); |
c73964b2 MS |
9020 | } |
9021 | ||
298d6f60 | 9022 | /* Returns the value to use for the in-charge parameter when making a |
8dc2b103 | 9023 | call to a function with the indicated NAME. |
c8094d83 | 9024 | |
8dc2b103 | 9025 | FIXME:Can't we find a neater way to do this mapping? */ |
298d6f60 MM |
9026 | |
9027 | tree | |
94be8403 | 9028 | in_charge_arg_for_name (tree name) |
298d6f60 | 9029 | { |
d6ef53f2 NS |
9030 | if (IDENTIFIER_CTOR_P (name)) |
9031 | { | |
9032 | if (name == complete_ctor_identifier) | |
9033 | return integer_one_node; | |
9034 | gcc_checking_assert (name == base_ctor_identifier); | |
9035 | } | |
9036 | else | |
9037 | { | |
9038 | if (name == complete_dtor_identifier) | |
9039 | return integer_two_node; | |
9040 | else if (name == deleting_dtor_identifier) | |
9041 | return integer_three_node; | |
9042 | gcc_checking_assert (name == base_dtor_identifier); | |
9043 | } | |
9044 | ||
9045 | return integer_zero_node; | |
298d6f60 MM |
9046 | } |
9047 | ||
36cbfdb0 JM |
9048 | /* We've built up a constructor call RET. Complain if it delegates to the |
9049 | constructor we're currently compiling. */ | |
9050 | ||
9051 | static void | |
9052 | check_self_delegation (tree ret) | |
9053 | { | |
9054 | if (TREE_CODE (ret) == TARGET_EXPR) | |
9055 | ret = TARGET_EXPR_INITIAL (ret); | |
f5f035a3 | 9056 | tree fn = cp_get_callee_fndecl_nofold (ret); |
36cbfdb0 JM |
9057 | if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl) |
9058 | error ("constructor delegates to itself"); | |
9059 | } | |
9060 | ||
4ba126e4 MM |
9061 | /* Build a call to a constructor, destructor, or an assignment |
9062 | operator for INSTANCE, an expression with class type. NAME | |
c166b898 ILT |
9063 | indicates the special member function to call; *ARGS are the |
9064 | arguments. ARGS may be NULL. This may change ARGS. BINFO | |
9065 | indicates the base of INSTANCE that is to be passed as the `this' | |
9066 | parameter to the member function called. | |
4ba126e4 MM |
9067 | |
9068 | FLAGS are the LOOKUP_* flags to use when processing the call. | |
9069 | ||
9070 | If NAME indicates a complete object constructor, INSTANCE may be | |
9071 | NULL_TREE. In this case, the caller will call build_cplus_new to | |
9072 | store the newly constructed object into a VAR_DECL. */ | |
9073 | ||
9074 | tree | |
9771b263 | 9075 | build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args, |
5ade1ed2 | 9076 | tree binfo, int flags, tsubst_flags_t complain) |
4ba126e4 MM |
9077 | { |
9078 | tree fns; | |
9079 | /* The type of the subobject to be constructed or destroyed. */ | |
9080 | tree class_type; | |
9771b263 | 9081 | vec<tree, va_gc> *allocated = NULL; |
c166b898 | 9082 | tree ret; |
4ba126e4 | 9083 | |
137073d3 | 9084 | gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier); |
cdc18417 JM |
9085 | |
9086 | if (error_operand_p (instance)) | |
9087 | return error_mark_node; | |
9088 | ||
9089 | if (IDENTIFIER_DTOR_P (name)) | |
9090 | { | |
9091 | gcc_assert (args == NULL || vec_safe_is_empty (*args)); | |
9092 | if (!type_build_dtor_call (TREE_TYPE (instance))) | |
9093 | /* Shortcut to avoid lazy destructor declaration. */ | |
9094 | return build_trivial_dtor_call (instance); | |
9095 | } | |
9096 | ||
cad7e87b NS |
9097 | if (TYPE_P (binfo)) |
9098 | { | |
9099 | /* Resolve the name. */ | |
309714d4 | 9100 | if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain)) |
cad7e87b NS |
9101 | return error_mark_node; |
9102 | ||
9103 | binfo = TYPE_BINFO (binfo); | |
9104 | } | |
c8094d83 | 9105 | |
50bc768d | 9106 | gcc_assert (binfo != NULL_TREE); |
4ba126e4 MM |
9107 | |
9108 | class_type = BINFO_TYPE (binfo); | |
9109 | ||
9110 | /* Handle the special case where INSTANCE is NULL_TREE. */ | |
9111 | if (name == complete_ctor_identifier && !instance) | |
1dbdb756 | 9112 | instance = build_dummy_object (class_type); |
22ed7e5f MM |
9113 | else |
9114 | { | |
4c2a4b90 | 9115 | /* Convert to the base class, if necessary. */ |
c8094d83 | 9116 | if (!same_type_ignoring_top_level_qualifiers_p |
22ed7e5f | 9117 | (TREE_TYPE (instance), BINFO_TYPE (binfo))) |
4c2a4b90 | 9118 | { |
137073d3 | 9119 | if (IDENTIFIER_CDTOR_P (name)) |
4c2a4b90 MM |
9120 | /* For constructors and destructors, either the base is |
9121 | non-virtual, or it is virtual but we are doing the | |
9122 | conversion from a constructor or destructor for the | |
9123 | complete object. In either case, we can convert | |
9124 | statically. */ | |
9125 | instance = convert_to_base_statically (instance, binfo); | |
9126 | else | |
137073d3 NS |
9127 | { |
9128 | /* However, for assignment operators, we must convert | |
9129 | dynamically if the base is virtual. */ | |
9130 | gcc_checking_assert (name == assign_op_identifier); | |
9131 | instance = build_base_path (PLUS_EXPR, instance, | |
9132 | binfo, /*nonnull=*/1, complain); | |
9133 | } | |
4c2a4b90 | 9134 | } |
22ed7e5f | 9135 | } |
c8094d83 | 9136 | |
50bc768d | 9137 | gcc_assert (instance != NULL_TREE); |
4ba126e4 | 9138 | |
36cbfdb0 JM |
9139 | /* In C++17, "If the initializer expression is a prvalue and the |
9140 | cv-unqualified version of the source type is the same class as the class | |
9141 | of the destination, the initializer expression is used to initialize the | |
9142 | destination object." Handle that here to avoid doing overload | |
9143 | resolution. */ | |
7b936140 | 9144 | if (cxx_dialect >= cxx17 |
36cbfdb0 JM |
9145 | && args && vec_safe_length (*args) == 1 |
9146 | && name == complete_ctor_identifier) | |
9147 | { | |
9148 | tree arg = (**args)[0]; | |
9149 | ||
a8149569 | 9150 | if (BRACE_ENCLOSED_INITIALIZER_P (arg) |
2170d4b6 JM |
9151 | && !TYPE_HAS_LIST_CTOR (class_type) |
9152 | && CONSTRUCTOR_NELTS (arg) == 1) | |
9153 | arg = CONSTRUCTOR_ELT (arg, 0)->value; | |
9154 | ||
07a67f7b JM |
9155 | if ((TREE_CODE (arg) == TARGET_EXPR |
9156 | || TREE_CODE (arg) == CONSTRUCTOR) | |
36cbfdb0 JM |
9157 | && (same_type_ignoring_top_level_qualifiers_p |
9158 | (class_type, TREE_TYPE (arg)))) | |
9159 | { | |
9160 | if (is_dummy_object (instance)) | |
9161 | return arg; | |
b76f3abc JM |
9162 | else if (TREE_CODE (arg) == TARGET_EXPR) |
9163 | TARGET_EXPR_DIRECT_INIT_P (arg) = true; | |
9164 | ||
36cbfdb0 JM |
9165 | if ((complain & tf_error) |
9166 | && (flags & LOOKUP_DELEGATING_CONS)) | |
9167 | check_self_delegation (arg); | |
9168 | /* Avoid change of behavior on Wunused-var-2.C. */ | |
697a7a57 | 9169 | instance = mark_lvalue_use (instance); |
36cbfdb0 JM |
9170 | return build2 (INIT_EXPR, class_type, instance, arg); |
9171 | } | |
9172 | } | |
9173 | ||
4ba126e4 | 9174 | fns = lookup_fnfields (binfo, name, 1); |
c8094d83 | 9175 | |
4ba126e4 MM |
9176 | /* When making a call to a constructor or destructor for a subobject |
9177 | that uses virtual base classes, pass down a pointer to a VTT for | |
9178 | the subobject. */ | |
9179 | if ((name == base_ctor_identifier | |
9180 | || name == base_dtor_identifier) | |
5775a06a | 9181 | && CLASSTYPE_VBASECLASSES (class_type)) |
4ba126e4 MM |
9182 | { |
9183 | tree vtt; | |
9184 | tree sub_vtt; | |
9185 | ||
9186 | /* If the current function is a complete object constructor | |
9187 | or destructor, then we fetch the VTT directly. | |
9188 | Otherwise, we look it up using the VTT we were given. */ | |
910ad8de | 9189 | vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type)); |
89fcabaf PC |
9190 | vtt = decay_conversion (vtt, complain); |
9191 | if (vtt == error_mark_node) | |
9192 | return error_mark_node; | |
eb0dbdc7 | 9193 | vtt = build_if_in_charge (vtt, current_vtt_parm); |
238e471c VV |
9194 | if (BINFO_SUBVTT_INDEX (binfo)) |
9195 | sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo)); | |
9196 | else | |
9197 | sub_vtt = vtt; | |
4ba126e4 | 9198 | |
c166b898 ILT |
9199 | if (args == NULL) |
9200 | { | |
9201 | allocated = make_tree_vector (); | |
9202 | args = &allocated; | |
9203 | } | |
9204 | ||
9771b263 | 9205 | vec_safe_insert (*args, 0, sub_vtt); |
4ba126e4 MM |
9206 | } |
9207 | ||
c166b898 ILT |
9208 | ret = build_new_method_call (instance, fns, args, |
9209 | TYPE_BINFO (BINFO_TYPE (binfo)), | |
9210 | flags, /*fn=*/NULL, | |
9211 | complain); | |
9212 | ||
9213 | if (allocated != NULL) | |
9214 | release_tree_vector (allocated); | |
9215 | ||
a624d5fe PC |
9216 | if ((complain & tf_error) |
9217 | && (flags & LOOKUP_DELEGATING_CONS) | |
36cbfdb0 JM |
9218 | && name == complete_ctor_identifier) |
9219 | check_self_delegation (ret); | |
a624d5fe | 9220 | |
c166b898 | 9221 | return ret; |
4ba126e4 MM |
9222 | } |
9223 | ||
a723baf1 MM |
9224 | /* Return the NAME, as a C string. The NAME indicates a function that |
9225 | is a member of TYPE. *FREE_P is set to true if the caller must | |
c8094d83 | 9226 | free the memory returned. |
a723baf1 MM |
9227 | |
9228 | Rather than go through all of this, we should simply set the names | |
9229 | of constructors and destructors appropriately, and dispense with | |
9230 | ctor_identifier, dtor_identifier, etc. */ | |
9231 | ||
9232 | static char * | |
9233 | name_as_c_string (tree name, tree type, bool *free_p) | |
9234 | { | |
e9888922 | 9235 | const char *pretty_name; |
a723baf1 MM |
9236 | |
9237 | /* Assume that we will not allocate memory. */ | |
9238 | *free_p = false; | |
9239 | /* Constructors and destructors are special. */ | |
84c0088f | 9240 | if (IDENTIFIER_CDTOR_P (name)) |
a723baf1 | 9241 | { |
c8094d83 | 9242 | pretty_name |
e9888922 | 9243 | = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))); |
a723baf1 | 9244 | /* For a destructor, add the '~'. */ |
84c0088f | 9245 | if (IDENTIFIER_DTOR_P (name)) |
a723baf1 MM |
9246 | { |
9247 | pretty_name = concat ("~", pretty_name, NULL); | |
9248 | /* Remember that we need to free the memory allocated. */ | |
9249 | *free_p = true; | |
9250 | } | |
9251 | } | |
84c0088f | 9252 | else if (IDENTIFIER_CONV_OP_P (name)) |
144e414d MM |
9253 | { |
9254 | pretty_name = concat ("operator ", | |
f41c4af3 JM |
9255 | type_as_string_translate (TREE_TYPE (name), |
9256 | TFF_PLAIN_IDENTIFIER), | |
144e414d MM |
9257 | NULL); |
9258 | /* Remember that we need to free the memory allocated. */ | |
9259 | *free_p = true; | |
9260 | } | |
a723baf1 | 9261 | else |
e9888922 | 9262 | pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name)); |
a723baf1 | 9263 | |
e9888922 | 9264 | return CONST_CAST (char *, pretty_name); |
a723baf1 MM |
9265 | } |
9266 | ||
4911b24d DM |
9267 | /* If CANDIDATES contains exactly one candidate, return it, otherwise |
9268 | return NULL. */ | |
9269 | ||
9270 | static z_candidate * | |
9271 | single_z_candidate (z_candidate *candidates) | |
9272 | { | |
9273 | if (candidates == NULL) | |
9274 | return NULL; | |
9275 | ||
9276 | if (candidates->next) | |
9277 | return NULL; | |
9278 | ||
9279 | return candidates; | |
9280 | } | |
9281 | ||
9282 | /* If CANDIDATE is invalid due to a bad argument type, return the | |
9283 | pertinent conversion_info. | |
9284 | ||
9285 | Otherwise, return NULL. */ | |
9286 | ||
9287 | static const conversion_info * | |
9288 | maybe_get_bad_conversion_for_unmatched_call (const z_candidate *candidate) | |
9289 | { | |
9290 | /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */ | |
9291 | rejection_reason *r = candidate->reason; | |
9292 | ||
9293 | if (r == NULL) | |
9294 | return NULL; | |
9295 | ||
9296 | switch (r->code) | |
9297 | { | |
9298 | default: | |
9299 | return NULL; | |
9300 | ||
9301 | case rr_arg_conversion: | |
9302 | return &r->u.conversion; | |
9303 | ||
9304 | case rr_bad_arg_conversion: | |
9305 | return &r->u.bad_conversion; | |
9306 | } | |
9307 | } | |
9308 | ||
9309 | /* Issue an error and note complaining about a bad argument type at a | |
9310 | callsite with a single candidate FNDECL. | |
9311 | ||
9312 | ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which | |
9313 | case input_location is used). | |
9314 | FROM_TYPE is the type of the actual argument; TO_TYPE is the type of | |
9315 | the formal parameter. */ | |
9316 | ||
9317 | void | |
9318 | complain_about_bad_argument (location_t arg_loc, | |
9319 | tree from_type, tree to_type, | |
9320 | tree fndecl, int parmnum) | |
9321 | { | |
9322 | auto_diagnostic_group d; | |
9323 | range_label_for_type_mismatch rhs_label (from_type, to_type); | |
9324 | range_label *label = &rhs_label; | |
9325 | if (arg_loc == UNKNOWN_LOCATION) | |
9326 | { | |
9327 | arg_loc = input_location; | |
9328 | label = NULL; | |
9329 | } | |
9330 | gcc_rich_location richloc (arg_loc, label); | |
9331 | error_at (&richloc, | |
9332 | "cannot convert %qH to %qI", | |
9333 | from_type, to_type); | |
f11854d4 DM |
9334 | maybe_inform_about_fndecl_for_bogus_argument_init (fndecl, |
9335 | parmnum); | |
4911b24d DM |
9336 | } |
9337 | ||
9338 | /* Subroutine of build_new_method_call_1, for where there are no viable | |
9339 | candidates for the call. */ | |
9340 | ||
9341 | static void | |
9342 | complain_about_no_candidates_for_method_call (tree instance, | |
9343 | z_candidate *candidates, | |
9344 | tree explicit_targs, | |
9345 | tree basetype, | |
9346 | tree optype, tree name, | |
9347 | bool skip_first_for_error, | |
9348 | vec<tree, va_gc> *user_args) | |
9349 | { | |
9350 | auto_diagnostic_group d; | |
9351 | if (!COMPLETE_OR_OPEN_TYPE_P (basetype)) | |
9352 | cxx_incomplete_type_error (instance, basetype); | |
9353 | else if (optype) | |
9354 | error ("no matching function for call to %<%T::operator %T(%A)%#V%>", | |
9355 | basetype, optype, build_tree_list_vec (user_args), | |
9356 | TREE_TYPE (instance)); | |
9357 | else | |
9358 | { | |
9359 | /* Special-case for when there's a single candidate that's failing | |
9360 | due to a bad argument type. */ | |
9361 | if (z_candidate *candidate = single_z_candidate (candidates)) | |
9362 | if (const conversion_info *conv | |
9363 | = maybe_get_bad_conversion_for_unmatched_call (candidate)) | |
9364 | { | |
9365 | complain_about_bad_argument (conv->loc, | |
9366 | conv->from, conv->to_type, | |
9367 | candidate->fn, conv->n_arg); | |
9368 | return; | |
9369 | } | |
9370 | ||
9371 | tree arglist = build_tree_list_vec (user_args); | |
9372 | tree errname = name; | |
9373 | bool twiddle = false; | |
9374 | if (IDENTIFIER_CDTOR_P (errname)) | |
9375 | { | |
9376 | twiddle = IDENTIFIER_DTOR_P (errname); | |
9377 | errname = constructor_name (basetype); | |
9378 | } | |
9379 | if (explicit_targs) | |
9380 | errname = lookup_template_function (errname, explicit_targs); | |
9381 | if (skip_first_for_error) | |
9382 | arglist = TREE_CHAIN (arglist); | |
9383 | error ("no matching function for call to %<%T::%s%E(%A)%#V%>", | |
9384 | basetype, &"~"[!twiddle], errname, arglist, | |
9385 | TREE_TYPE (instance)); | |
9386 | } | |
9387 | print_z_candidates (location_of (name), candidates); | |
9388 | } | |
9389 | ||
63c9a190 | 9390 | /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will |
c166b898 ILT |
9391 | be set, upon return, to the function called. ARGS may be NULL. |
9392 | This may change ARGS. */ | |
4ba126e4 | 9393 | |
575bfb00 | 9394 | static tree |
9771b263 | 9395 | build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args, |
575bfb00 LC |
9396 | tree conversion_path, int flags, |
9397 | tree *fn_p, tsubst_flags_t complain) | |
c73964b2 MS |
9398 | { |
9399 | struct z_candidate *candidates = 0, *cand; | |
386b8a85 | 9400 | tree explicit_targs = NULL_TREE; |
4ba126e4 | 9401 | tree basetype = NULL_TREE; |
f8b0f44f | 9402 | tree access_binfo, binfo; |
4ba126e4 | 9403 | tree optype; |
c166b898 | 9404 | tree first_mem_arg = NULL_TREE; |
a723baf1 | 9405 | tree name; |
c166b898 | 9406 | bool skip_first_for_error; |
9771b263 | 9407 | vec<tree, va_gc> *user_args; |
3c8c2a0a | 9408 | tree call; |
a723baf1 | 9409 | tree fn; |
c32381b1 | 9410 | int template_only = 0; |
436f8a4c | 9411 | bool any_viable_p; |
d17811fd MM |
9412 | tree orig_instance; |
9413 | tree orig_fns; | |
9771b263 | 9414 | vec<tree, va_gc> *orig_args = NULL; |
5bd61841 | 9415 | void *p; |
824b9a4c | 9416 | |
50bc768d | 9417 | gcc_assert (instance != NULL_TREE); |
8f032717 | 9418 | |
63c9a190 MM |
9419 | /* We don't know what function we're going to call, yet. */ |
9420 | if (fn_p) | |
9421 | *fn_p = NULL_TREE; | |
9422 | ||
c8094d83 | 9423 | if (error_operand_p (instance) |
4ac4b596 | 9424 | || !fns || error_operand_p (fns)) |
4ba126e4 | 9425 | return error_mark_node; |
386b8a85 | 9426 | |
4ba126e4 | 9427 | if (!BASELINK_P (fns)) |
c73964b2 | 9428 | { |
5ade1ed2 DG |
9429 | if (complain & tf_error) |
9430 | error ("call to non-function %qD", fns); | |
4ba126e4 MM |
9431 | return error_mark_node; |
9432 | } | |
c73964b2 | 9433 | |
51b099e5 MM |
9434 | orig_instance = instance; |
9435 | orig_fns = fns; | |
51b099e5 | 9436 | |
aa7349eb | 9437 | /* Dismantle the baselink to collect all the information we need. */ |
4ba126e4 MM |
9438 | if (!conversion_path) |
9439 | conversion_path = BASELINK_BINFO (fns); | |
9440 | access_binfo = BASELINK_ACCESS_BINFO (fns); | |
f8b0f44f | 9441 | binfo = BASELINK_BINFO (fns); |
4ba126e4 MM |
9442 | optype = BASELINK_OPTYPE (fns); |
9443 | fns = BASELINK_FUNCTIONS (fns); | |
4ba126e4 MM |
9444 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) |
9445 | { | |
9446 | explicit_targs = TREE_OPERAND (fns, 1); | |
9447 | fns = TREE_OPERAND (fns, 0); | |
9448 | template_only = 1; | |
c73964b2 | 9449 | } |
50bc768d NS |
9450 | gcc_assert (TREE_CODE (fns) == FUNCTION_DECL |
9451 | || TREE_CODE (fns) == TEMPLATE_DECL | |
9452 | || TREE_CODE (fns) == OVERLOAD); | |
6f2f4050 | 9453 | fn = OVL_FIRST (fns); |
51b099e5 | 9454 | name = DECL_NAME (fn); |
c73964b2 | 9455 | |
51b099e5 MM |
9456 | basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance)); |
9457 | gcc_assert (CLASS_TYPE_P (basetype)); | |
c73964b2 | 9458 | |
55388afd JM |
9459 | user_args = args == NULL ? NULL : *args; |
9460 | /* Under DR 147 A::A() is an invalid constructor call, | |
9461 | not a functional cast. */ | |
9462 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) | |
9463 | { | |
9464 | if (! (complain & tf_error)) | |
9465 | return error_mark_node; | |
9466 | ||
88b811bd | 9467 | basetype = DECL_CONTEXT (fn); |
3b5c768c | 9468 | name = constructor_name (basetype); |
097f82ec | 9469 | auto_diagnostic_group d; |
7abebba7 PC |
9470 | if (permerror (input_location, |
9471 | "cannot call constructor %<%T::%D%> directly", | |
6bab4c63 | 9472 | basetype, name)) |
7abebba7 PC |
9473 | inform (input_location, "for a function-style cast, remove the " |
9474 | "redundant %<::%D%>", name); | |
55388afd JM |
9475 | call = build_functional_cast (basetype, build_tree_list_vec (user_args), |
9476 | complain); | |
55388afd JM |
9477 | return call; |
9478 | } | |
9479 | ||
17434237 JM |
9480 | if (processing_template_decl) |
9481 | { | |
9482 | orig_args = args == NULL ? NULL : make_tree_vector_copy (*args); | |
9483 | instance = build_non_dependent_expr (instance); | |
9484 | if (args != NULL) | |
9485 | make_args_non_dependent (*args); | |
9486 | } | |
9487 | ||
3b5c768c NS |
9488 | /* Process the argument list. */ |
9489 | if (args != NULL && *args != NULL) | |
9490 | { | |
9491 | *args = resolve_args (*args, complain); | |
9492 | if (*args == NULL) | |
9493 | return error_mark_node; | |
17434237 | 9494 | user_args = *args; |
3b5c768c NS |
9495 | } |
9496 | ||
9497 | /* Consider the object argument to be used even if we end up selecting a | |
9498 | static member function. */ | |
9499 | instance = mark_type_use (instance); | |
9500 | ||
c166b898 ILT |
9501 | /* Figure out whether to skip the first argument for the error |
9502 | message we will display to users if an error occurs. We don't | |
9503 | want to display any compiler-generated arguments. The "this" | |
9504 | pointer hasn't been added yet. However, we must remove the VTT | |
9505 | pointer if this is a call to a base-class constructor or | |
9506 | destructor. */ | |
9507 | skip_first_for_error = false; | |
84c0088f | 9508 | if (IDENTIFIER_CDTOR_P (name)) |
9eb71d8c | 9509 | { |
3b5c768c | 9510 | /* Callers should explicitly indicate whether they want to ctor |
4ba126e4 | 9511 | the complete object or just the part without virtual bases. */ |
50bc768d | 9512 | gcc_assert (name != ctor_identifier); |
3b5c768c | 9513 | |
51b099e5 MM |
9514 | /* Remove the VTT pointer, if present. */ |
9515 | if ((name == base_ctor_identifier || name == base_dtor_identifier) | |
9516 | && CLASSTYPE_VBASECLASSES (basetype)) | |
c166b898 | 9517 | skip_first_for_error = true; |
c73964b2 | 9518 | |
3b5c768c NS |
9519 | /* It's OK to call destructors and constructors on cv-qualified |
9520 | objects. Therefore, convert the INSTANCE to the unqualified | |
9521 | type, if necessary. */ | |
a7175123 JM |
9522 | if (!same_type_p (basetype, TREE_TYPE (instance))) |
9523 | { | |
9524 | instance = build_this (instance); | |
9525 | instance = build_nop (build_pointer_type (basetype), instance); | |
9526 | instance = build_fold_indirect_ref (instance); | |
9527 | } | |
a723baf1 | 9528 | } |
3b5c768c NS |
9529 | else |
9530 | gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn)); | |
4ba126e4 | 9531 | |
0b360a07 MV |
9532 | /* For the overload resolution we need to find the actual `this` |
9533 | that would be captured if the call turns out to be to a | |
9534 | non-static member function. Do not actually capture it at this | |
9535 | point. */ | |
a2f259ef JM |
9536 | if (DECL_CONSTRUCTOR_P (fn)) |
9537 | /* Constructors don't use the enclosing 'this'. */ | |
9538 | first_mem_arg = instance; | |
9539 | else | |
9540 | first_mem_arg = maybe_resolve_dummy (instance, false); | |
4c9b3895 JM |
9541 | |
9542 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9543 | p = conversion_obstack_alloc (0); | |
9544 | ||
bd84e560 JM |
9545 | /* The number of arguments artificial parms in ARGS; we subtract one because |
9546 | there's no 'this' in ARGS. */ | |
9547 | unsigned skip = num_artificial_parms_for (fn) - 1; | |
9548 | ||
09357846 | 9549 | /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form |
4c9b3895 | 9550 | initializer, not T({ }). */ |
bd84e560 JM |
9551 | if (DECL_CONSTRUCTOR_P (fn) |
9552 | && vec_safe_length (user_args) > skip | |
9553 | && DIRECT_LIST_INIT_P ((*user_args)[skip])) | |
09357846 | 9554 | { |
bd84e560 | 9555 | tree init_list = (*user_args)[skip]; |
b1c83c23 | 9556 | tree init = NULL_TREE; |
2061820e | 9557 | |
bd84e560 | 9558 | gcc_assert (user_args->length () == skip + 1 |
611d6f76 | 9559 | && !(flags & LOOKUP_ONLYCONVERTING)); |
d451d5b2 | 9560 | |
2061820e JM |
9561 | /* If the initializer list has no elements and T is a class type with |
9562 | a default constructor, the object is value-initialized. Handle | |
9563 | this here so we don't need to handle it wherever we use | |
9564 | build_special_member_call. */ | |
9565 | if (CONSTRUCTOR_NELTS (init_list) == 0 | |
9566 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) | |
3a322efd JM |
9567 | /* For a user-provided default constructor, use the normal |
9568 | mechanisms so that protected access works. */ | |
a710f1f8 | 9569 | && type_has_non_user_provided_default_constructor (basetype) |
2061820e | 9570 | && !processing_template_decl) |
b1c83c23 JM |
9571 | init = build_value_init (basetype, complain); |
9572 | ||
9573 | /* If BASETYPE is an aggregate, we need to do aggregate | |
9574 | initialization. */ | |
9575 | else if (CP_AGGREGATE_TYPE_P (basetype)) | |
e056dfd0 JM |
9576 | { |
9577 | init = reshape_init (basetype, init_list, complain); | |
9578 | init = digest_init (basetype, init, complain); | |
9579 | } | |
b1c83c23 JM |
9580 | |
9581 | if (init) | |
2061820e | 9582 | { |
1dbdb756 | 9583 | if (is_dummy_object (instance)) |
2061820e | 9584 | return get_target_expr_sfinae (init, complain); |
a7175123 | 9585 | init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init); |
2061820e JM |
9586 | TREE_SIDE_EFFECTS (init) = true; |
9587 | return init; | |
9588 | } | |
9589 | ||
b1c83c23 | 9590 | /* Otherwise go ahead with overload resolution. */ |
bd84e560 | 9591 | add_list_candidates (fns, first_mem_arg, user_args, |
4c9b3895 | 9592 | basetype, explicit_targs, template_only, |
b40e334f PC |
9593 | conversion_path, access_binfo, flags, |
9594 | &candidates, complain); | |
09357846 | 9595 | } |
4c9b3895 | 9596 | else |
e9888922 NS |
9597 | add_candidates (fns, first_mem_arg, user_args, optype, |
9598 | explicit_targs, template_only, conversion_path, | |
9599 | access_binfo, flags, &candidates, complain); | |
9600 | ||
4c9b3895 | 9601 | any_viable_p = false; |
89606913 | 9602 | candidates = splice_viable (candidates, false, &any_viable_p); |
c73964b2 | 9603 | |
436f8a4c | 9604 | if (!any_viable_p) |
c73964b2 | 9605 | { |
5ade1ed2 | 9606 | if (complain & tf_error) |
4911b24d DM |
9607 | complain_about_no_candidates_for_method_call (instance, candidates, |
9608 | explicit_targs, basetype, | |
9609 | optype, name, | |
9610 | skip_first_for_error, | |
9611 | user_args); | |
5bd61841 | 9612 | call = error_mark_node; |
c73964b2 | 9613 | } |
5bd61841 | 9614 | else |
c73964b2 | 9615 | { |
b40e334f | 9616 | cand = tourney (candidates, complain); |
5bd61841 MM |
9617 | if (cand == 0) |
9618 | { | |
9619 | char *pretty_name; | |
9620 | bool free_p; | |
c166b898 | 9621 | tree arglist; |
a723baf1 | 9622 | |
5ade1ed2 DG |
9623 | if (complain & tf_error) |
9624 | { | |
9625 | pretty_name = name_as_c_string (name, basetype, &free_p); | |
c166b898 ILT |
9626 | arglist = build_tree_list_vec (user_args); |
9627 | if (skip_first_for_error) | |
9628 | arglist = TREE_CHAIN (arglist); | |
097f82ec | 9629 | auto_diagnostic_group d; |
c29f393f JM |
9630 | if (!any_strictly_viable (candidates)) |
9631 | error ("no matching function for call to %<%s(%A)%>", | |
9632 | pretty_name, arglist); | |
9633 | else | |
9634 | error ("call of overloaded %<%s(%A)%> is ambiguous", | |
9635 | pretty_name, arglist); | |
feb6efc1 | 9636 | print_z_candidates (location_of (name), candidates); |
5ade1ed2 DG |
9637 | if (free_p) |
9638 | free (pretty_name); | |
9639 | } | |
5bd61841 MM |
9640 | call = error_mark_node; |
9641 | } | |
9642 | else | |
9643 | { | |
63c9a190 | 9644 | fn = cand->fn; |
0ef811d7 | 9645 | call = NULL_TREE; |
63c9a190 | 9646 | |
585b44d3 | 9647 | if (!(flags & LOOKUP_NONVIRTUAL) |
63c9a190 | 9648 | && DECL_PURE_VIRTUAL_P (fn) |
5bd61841 | 9649 | && instance == current_class_ref |
5ade1ed2 | 9650 | && (complain & tf_warning)) |
7d092805 PC |
9651 | { |
9652 | /* This is not an error, it is runtime undefined | |
9653 | behavior. */ | |
9654 | if (!current_function_decl) | |
9655 | warning (0, "pure virtual %q#D called from " | |
9656 | "non-static data member initializer", fn); | |
9657 | else if (DECL_CONSTRUCTOR_P (current_function_decl) | |
9658 | || DECL_DESTRUCTOR_P (current_function_decl)) | |
9659 | warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) | |
324ff1a0 JJ |
9660 | ? G_("pure virtual %q#D called from constructor") |
9661 | : G_("pure virtual %q#D called from destructor")), | |
7d092805 PC |
9662 | fn); |
9663 | } | |
c8094d83 | 9664 | |
63c9a190 | 9665 | if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE |
1dbdb756 | 9666 | && !DECL_CONSTRUCTOR_P (fn) |
a7175123 | 9667 | && is_dummy_object (instance)) |
5bd61841 | 9668 | { |
0b360a07 | 9669 | instance = maybe_resolve_dummy (instance, true); |
0ef811d7 JM |
9670 | if (instance == error_mark_node) |
9671 | call = error_mark_node; | |
9672 | else if (!is_dummy_object (instance)) | |
9673 | { | |
9674 | /* We captured 'this' in the current lambda now that | |
9675 | we know we really need it. */ | |
a7175123 | 9676 | cand->first_arg = instance; |
0ef811d7 | 9677 | } |
23cb7266 JM |
9678 | else if (any_dependent_bases_p ()) |
9679 | /* We can't tell until instantiation time whether we can use | |
9680 | *this as the implicit object argument. */; | |
0ef811d7 JM |
9681 | else |
9682 | { | |
9683 | if (complain & tf_error) | |
9684 | error ("cannot call member function %qD without object", | |
9685 | fn); | |
9686 | call = error_mark_node; | |
9687 | } | |
5bd61841 | 9688 | } |
0ef811d7 JM |
9689 | |
9690 | if (call != error_mark_node) | |
5bd61841 | 9691 | { |
7628dc54 FC |
9692 | /* Optimize away vtable lookup if we know that this |
9693 | function can't be overridden. We need to check if | |
f8b0f44f | 9694 | the context and the type where we found fn are the same, |
7628dc54 FC |
9695 | actually FN might be defined in a different class |
9696 | type because of a using-declaration. In this case, we | |
9697 | do not want to perform a non-virtual call. */ | |
63c9a190 | 9698 | if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL) |
7628dc54 | 9699 | && same_type_ignoring_top_level_qualifiers_p |
f8b0f44f | 9700 | (DECL_CONTEXT (fn), BINFO_TYPE (binfo)) |
1fa2969f | 9701 | && resolves_to_fixed_type_p (instance, 0)) |
5bd61841 | 9702 | flags |= LOOKUP_NONVIRTUAL; |
2e1df0f0 DN |
9703 | if (explicit_targs) |
9704 | flags |= LOOKUP_EXPLICIT_TMPL_ARGS; | |
63c9a190 MM |
9705 | /* Now we know what function is being called. */ |
9706 | if (fn_p) | |
9707 | *fn_p = fn; | |
e69460b6 | 9708 | /* Build the actual CALL_EXPR. */ |
5ade1ed2 | 9709 | call = build_over_call (cand, flags, complain); |
5bd61841 MM |
9710 | /* In an expression of the form `a->f()' where `f' turns |
9711 | out to be a static member function, `a' is | |
9712 | none-the-less evaluated. */ | |
63c9a190 | 9713 | if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE |
a7175123 JM |
9714 | && !is_dummy_object (instance) |
9715 | && TREE_SIDE_EFFECTS (instance)) | |
18afe4c9 JM |
9716 | { |
9717 | /* But avoid the implicit lvalue-rvalue conversion when 'a' | |
9718 | is volatile. */ | |
9719 | tree a = instance; | |
9720 | if (TREE_THIS_VOLATILE (a)) | |
9721 | a = build_this (a); | |
9722 | call = build2 (COMPOUND_EXPR, TREE_TYPE (call), a, call); | |
9723 | } | |
c88b0c50 MM |
9724 | else if (call != error_mark_node |
9725 | && DECL_DESTRUCTOR_P (cand->fn) | |
9726 | && !VOID_TYPE_P (TREE_TYPE (call))) | |
9727 | /* An explicit call of the form "x->~X()" has type | |
9728 | "void". However, on platforms where destructors | |
9729 | return "this" (i.e., those where | |
9730 | targetm.cxx.cdtor_returns_this is true), such calls | |
9731 | will appear to have a return value of pointer type | |
9732 | to the low-level call machinery. We do not want to | |
9733 | change the low-level machinery, since we want to be | |
9734 | able to optimize "delete f()" on such platforms as | |
9735 | "operator delete(~X(f()))" (rather than generating | |
9736 | "t = f(), ~X(t), operator delete (t)"). */ | |
9737 | call = build_nop (void_type_node, call); | |
5bd61841 MM |
9738 | } |
9739 | } | |
c73964b2 MS |
9740 | } |
9741 | ||
5bd61841 | 9742 | if (processing_template_decl && call != error_mark_node) |
c7962e7d | 9743 | { |
6cea69fe JJ |
9744 | bool cast_to_void = false; |
9745 | ||
9746 | if (TREE_CODE (call) == COMPOUND_EXPR) | |
9747 | call = TREE_OPERAND (call, 1); | |
9748 | else if (TREE_CODE (call) == NOP_EXPR) | |
9749 | { | |
9750 | cast_to_void = true; | |
9751 | call = TREE_OPERAND (call, 0); | |
9752 | } | |
591cb3cf | 9753 | if (INDIRECT_REF_P (call)) |
c7962e7d | 9754 | call = TREE_OPERAND (call, 0); |
c166b898 | 9755 | call = (build_min_non_dep_call_vec |
c7962e7d JM |
9756 | (call, |
9757 | build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)), | |
9758 | orig_instance, orig_fns, NULL_TREE), | |
9759 | orig_args)); | |
03b8c9bf | 9760 | SET_EXPR_LOCATION (call, input_location); |
c7962e7d | 9761 | call = convert_from_reference (call); |
6cea69fe JJ |
9762 | if (cast_to_void) |
9763 | call = build_nop (void_type_node, call); | |
c7962e7d | 9764 | } |
c73964b2 | 9765 | |
5bd61841 MM |
9766 | /* Free all the conversions we allocated. */ |
9767 | obstack_free (&conversion_obstack, p); | |
c73964b2 | 9768 | |
c166b898 ILT |
9769 | if (orig_args != NULL) |
9770 | release_tree_vector (orig_args); | |
9771 | ||
3c8c2a0a | 9772 | return call; |
c73964b2 MS |
9773 | } |
9774 | ||
575bfb00 LC |
9775 | /* Wrapper for above. */ |
9776 | ||
9777 | tree | |
9771b263 | 9778 | build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args, |
575bfb00 LC |
9779 | tree conversion_path, int flags, |
9780 | tree *fn_p, tsubst_flags_t complain) | |
9781 | { | |
9782 | tree ret; | |
9783 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
9784 | ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags, | |
9785 | fn_p, complain); | |
9786 | timevar_cond_stop (TV_OVERLOAD, subtime); | |
9787 | return ret; | |
9788 | } | |
9789 | ||
94be8403 | 9790 | /* Returns true iff standard conversion sequence ICS1 is a proper |
ceab47eb | 9791 | subsequence of ICS2. */ |
c73964b2 | 9792 | |
94be8403 | 9793 | static bool |
5bd61841 | 9794 | is_subseq (conversion *ics1, conversion *ics2) |
c73964b2 | 9795 | { |
ceab47eb MM |
9796 | /* We can assume that a conversion of the same code |
9797 | between the same types indicates a subsequence since we only get | |
9798 | here if the types we are converting from are the same. */ | |
549121cd | 9799 | |
5bd61841 MM |
9800 | while (ics1->kind == ck_rvalue |
9801 | || ics1->kind == ck_lvalue) | |
40703fdf | 9802 | ics1 = next_conversion (ics1); |
c73964b2 | 9803 | |
ceab47eb | 9804 | while (1) |
c73964b2 | 9805 | { |
5bd61841 MM |
9806 | while (ics2->kind == ck_rvalue |
9807 | || ics2->kind == ck_lvalue) | |
40703fdf | 9808 | ics2 = next_conversion (ics2); |
c73964b2 | 9809 | |
5bd61841 MM |
9810 | if (ics2->kind == ck_user |
9811 | || ics2->kind == ck_ambig | |
756bcf03 JM |
9812 | || ics2->kind == ck_aggr |
9813 | || ics2->kind == ck_list | |
5bd61841 | 9814 | || ics2->kind == ck_identity) |
ceab47eb MM |
9815 | /* At this point, ICS1 cannot be a proper subsequence of |
9816 | ICS2. We can get a USER_CONV when we are comparing the | |
9817 | second standard conversion sequence of two user conversion | |
9818 | sequences. */ | |
94be8403 | 9819 | return false; |
f62dbf03 | 9820 | |
40703fdf | 9821 | ics2 = next_conversion (ics2); |
653cc74a | 9822 | |
51dc6603 JM |
9823 | while (ics2->kind == ck_rvalue |
9824 | || ics2->kind == ck_lvalue) | |
9825 | ics2 = next_conversion (ics2); | |
9826 | ||
5bd61841 MM |
9827 | if (ics2->kind == ics1->kind |
9828 | && same_type_p (ics2->type, ics1->type) | |
51dc6603 JM |
9829 | && (ics1->kind == ck_identity |
9830 | || same_type_p (next_conversion (ics2)->type, | |
9831 | next_conversion (ics1)->type))) | |
94be8403 | 9832 | return true; |
f62dbf03 JM |
9833 | } |
9834 | } | |
9835 | ||
838dfd8a | 9836 | /* Returns nonzero iff DERIVED is derived from BASE. The inputs may |
ceab47eb | 9837 | be any _TYPE nodes. */ |
c73964b2 | 9838 | |
94be8403 GDR |
9839 | bool |
9840 | is_properly_derived_from (tree derived, tree base) | |
c73964b2 | 9841 | { |
9e1e64ec | 9842 | if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base)) |
94be8403 | 9843 | return false; |
c73964b2 | 9844 | |
ceab47eb MM |
9845 | /* We only allow proper derivation here. The DERIVED_FROM_P macro |
9846 | considers every class derived from itself. */ | |
9edc3913 | 9847 | return (!same_type_ignoring_top_level_qualifiers_p (derived, base) |
ceab47eb MM |
9848 | && DERIVED_FROM_P (base, derived)); |
9849 | } | |
d11ad92e | 9850 | |
ceab47eb MM |
9851 | /* We build the ICS for an implicit object parameter as a pointer |
9852 | conversion sequence. However, such a sequence should be compared | |
9853 | as if it were a reference conversion sequence. If ICS is the | |
9854 | implicit conversion sequence for an implicit object parameter, | |
9855 | modify it accordingly. */ | |
d11ad92e | 9856 | |
ceab47eb | 9857 | static void |
5bd61841 | 9858 | maybe_handle_implicit_object (conversion **ics) |
ceab47eb | 9859 | { |
5bd61841 | 9860 | if ((*ics)->this_p) |
d11ad92e | 9861 | { |
ceab47eb | 9862 | /* [over.match.funcs] |
c8094d83 | 9863 | |
ceab47eb MM |
9864 | For non-static member functions, the type of the |
9865 | implicit object parameter is "reference to cv X" | |
9866 | where X is the class of which the function is a | |
9867 | member and cv is the cv-qualification on the member | |
9868 | function declaration. */ | |
5bd61841 | 9869 | conversion *t = *ics; |
b0385db8 MM |
9870 | tree reference_type; |
9871 | ||
9872 | /* The `this' parameter is a pointer to a class type. Make the | |
34cd5ae7 | 9873 | implicit conversion talk about a reference to that same class |
b0385db8 | 9874 | type. */ |
5bd61841 | 9875 | reference_type = TREE_TYPE (t->type); |
b0385db8 MM |
9876 | reference_type = build_reference_type (reference_type); |
9877 | ||
5bd61841 | 9878 | if (t->kind == ck_qual) |
40703fdf | 9879 | t = next_conversion (t); |
5bd61841 | 9880 | if (t->kind == ck_ptr) |
40703fdf | 9881 | t = next_conversion (t); |
5bd61841 | 9882 | t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE); |
c8094d83 | 9883 | t = direct_reference_binding (reference_type, t); |
0ee3f0a8 NS |
9884 | t->this_p = 1; |
9885 | t->rvaluedness_matches_p = 0; | |
ceab47eb | 9886 | *ics = t; |
d11ad92e | 9887 | } |
ceab47eb MM |
9888 | } |
9889 | ||
2d2e8123 | 9890 | /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion, |
8af2fec4 RY |
9891 | and return the initial reference binding conversion. Otherwise, |
9892 | leave *ICS unchanged and return NULL. */ | |
ceab47eb | 9893 | |
8af2fec4 | 9894 | static conversion * |
5bd61841 | 9895 | maybe_handle_ref_bind (conversion **ics) |
ceab47eb | 9896 | { |
5bd61841 | 9897 | if ((*ics)->kind == ck_ref_bind) |
d11ad92e | 9898 | { |
5bd61841 | 9899 | conversion *old_ics = *ics; |
40703fdf | 9900 | *ics = next_conversion (old_ics); |
5bd61841 | 9901 | (*ics)->user_conv_p = old_ics->user_conv_p; |
8af2fec4 | 9902 | return old_ics; |
d11ad92e | 9903 | } |
351a0f00 | 9904 | |
8af2fec4 | 9905 | return NULL; |
ceab47eb MM |
9906 | } |
9907 | ||
9908 | /* Compare two implicit conversion sequences according to the rules set out in | |
9909 | [over.ics.rank]. Return values: | |
d11ad92e | 9910 | |
ceab47eb MM |
9911 | 1: ics1 is better than ics2 |
9912 | -1: ics2 is better than ics1 | |
9913 | 0: ics1 and ics2 are indistinguishable */ | |
9914 | ||
9915 | static int | |
5bd61841 | 9916 | compare_ics (conversion *ics1, conversion *ics2) |
ceab47eb MM |
9917 | { |
9918 | tree from_type1; | |
9919 | tree from_type2; | |
9920 | tree to_type1; | |
9921 | tree to_type2; | |
9922 | tree deref_from_type1 = NULL_TREE; | |
87603ed0 KG |
9923 | tree deref_from_type2 = NULL_TREE; |
9924 | tree deref_to_type1 = NULL_TREE; | |
9925 | tree deref_to_type2 = NULL_TREE; | |
5bd61841 | 9926 | conversion_rank rank1, rank2; |
ceab47eb | 9927 | |
838dfd8a | 9928 | /* REF_BINDING is nonzero if the result of the conversion sequence |
8af2fec4 RY |
9929 | is a reference type. In that case REF_CONV is the reference |
9930 | binding conversion. */ | |
9931 | conversion *ref_conv1; | |
9932 | conversion *ref_conv2; | |
ceab47eb | 9933 | |
d02f620d JM |
9934 | /* Compare badness before stripping the reference conversion. */ |
9935 | if (ics1->bad_p > ics2->bad_p) | |
9936 | return -1; | |
9937 | else if (ics1->bad_p < ics2->bad_p) | |
9938 | return 1; | |
9939 | ||
ceab47eb MM |
9940 | /* Handle implicit object parameters. */ |
9941 | maybe_handle_implicit_object (&ics1); | |
9942 | maybe_handle_implicit_object (&ics2); | |
9943 | ||
9944 | /* Handle reference parameters. */ | |
8af2fec4 RY |
9945 | ref_conv1 = maybe_handle_ref_bind (&ics1); |
9946 | ref_conv2 = maybe_handle_ref_bind (&ics2); | |
ceab47eb | 9947 | |
50ea39ff JM |
9948 | /* List-initialization sequence L1 is a better conversion sequence than |
9949 | list-initialization sequence L2 if L1 converts to | |
9950 | std::initializer_list<X> for some X and L2 does not. */ | |
9951 | if (ics1->kind == ck_list && ics2->kind != ck_list) | |
9952 | return 1; | |
9953 | if (ics2->kind == ck_list && ics1->kind != ck_list) | |
9954 | return -1; | |
9955 | ||
ceab47eb MM |
9956 | /* [over.ics.rank] |
9957 | ||
9958 | When comparing the basic forms of implicit conversion sequences (as | |
9959 | defined in _over.best.ics_) | |
9960 | ||
9961 | --a standard conversion sequence (_over.ics.scs_) is a better | |
9962 | conversion sequence than a user-defined conversion sequence | |
9963 | or an ellipsis conversion sequence, and | |
c8094d83 | 9964 | |
ceab47eb MM |
9965 | --a user-defined conversion sequence (_over.ics.user_) is a |
9966 | better conversion sequence than an ellipsis conversion sequence | |
9967 | (_over.ics.ellipsis_). */ | |
d02f620d JM |
9968 | /* Use BAD_CONVERSION_RANK because we already checked for a badness |
9969 | mismatch. If both ICS are bad, we try to make a decision based on | |
9970 | what would have happened if they'd been good. This is not an | |
9971 | extension, we'll still give an error when we build up the call; this | |
9972 | just helps us give a more helpful error message. */ | |
9973 | rank1 = BAD_CONVERSION_RANK (ics1); | |
9974 | rank2 = BAD_CONVERSION_RANK (ics2); | |
c8094d83 | 9975 | |
bea09693 | 9976 | if (rank1 > rank2) |
c73964b2 | 9977 | return -1; |
bea09693 | 9978 | else if (rank1 < rank2) |
c73964b2 MS |
9979 | return 1; |
9980 | ||
6eb208a6 JM |
9981 | if (ics1->ellipsis_p) |
9982 | /* Both conversions are ellipsis conversions. */ | |
ceab47eb MM |
9983 | return 0; |
9984 | ||
c73964b2 MS |
9985 | /* User-defined conversion sequence U1 is a better conversion sequence |
9986 | than another user-defined conversion sequence U2 if they contain the | |
9987 | same user-defined conversion operator or constructor and if the sec- | |
9988 | ond standard conversion sequence of U1 is better than the second | |
9989 | standard conversion sequence of U2. */ | |
9990 | ||
6eb208a6 JM |
9991 | /* Handle list-conversion with the same code even though it isn't always |
9992 | ranked as a user-defined conversion and it doesn't have a second | |
9993 | standard conversion sequence; it will still have the desired effect. | |
9994 | Specifically, we need to do the reference binding comparison at the | |
9995 | end of this function. */ | |
9996 | ||
37b9a3bd | 9997 | if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr) |
c73964b2 | 9998 | { |
5bd61841 MM |
9999 | conversion *t1; |
10000 | conversion *t2; | |
c73964b2 | 10001 | |
40703fdf | 10002 | for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1)) |
6eb208a6 JM |
10003 | if (t1->kind == ck_ambig || t1->kind == ck_aggr |
10004 | || t1->kind == ck_list) | |
756bcf03 | 10005 | break; |
40703fdf | 10006 | for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2)) |
6eb208a6 JM |
10007 | if (t2->kind == ck_ambig || t2->kind == ck_aggr |
10008 | || t2->kind == ck_list) | |
756bcf03 | 10009 | break; |
c73964b2 | 10010 | |
756bcf03 | 10011 | if (t1->kind != t2->kind) |
c73964b2 | 10012 | return 0; |
756bcf03 JM |
10013 | else if (t1->kind == ck_user) |
10014 | { | |
3f0973e5 JM |
10015 | tree f1 = t1->cand ? t1->cand->fn : t1->type; |
10016 | tree f2 = t2->cand ? t2->cand->fn : t2->type; | |
10017 | if (f1 != f2) | |
756bcf03 JM |
10018 | return 0; |
10019 | } | |
10020 | else | |
10021 | { | |
10022 | /* For ambiguous or aggregate conversions, use the target type as | |
10023 | a proxy for the conversion function. */ | |
10024 | if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type)) | |
10025 | return 0; | |
10026 | } | |
c73964b2 | 10027 | |
ceab47eb MM |
10028 | /* We can just fall through here, after setting up |
10029 | FROM_TYPE1 and FROM_TYPE2. */ | |
5bd61841 MM |
10030 | from_type1 = t1->type; |
10031 | from_type2 = t2->type; | |
c73964b2 | 10032 | } |
ceab47eb MM |
10033 | else |
10034 | { | |
5bd61841 MM |
10035 | conversion *t1; |
10036 | conversion *t2; | |
10037 | ||
c8094d83 | 10038 | /* We're dealing with two standard conversion sequences. |
c73964b2 | 10039 | |
ceab47eb | 10040 | [over.ics.rank] |
c8094d83 | 10041 | |
ceab47eb MM |
10042 | Standard conversion sequence S1 is a better conversion |
10043 | sequence than standard conversion sequence S2 if | |
c8094d83 | 10044 | |
ceab47eb MM |
10045 | --S1 is a proper subsequence of S2 (comparing the conversion |
10046 | sequences in the canonical form defined by _over.ics.scs_, | |
10047 | excluding any Lvalue Transformation; the identity | |
10048 | conversion sequence is considered to be a subsequence of | |
10049 | any non-identity conversion sequence */ | |
c8094d83 | 10050 | |
5bd61841 MM |
10051 | t1 = ics1; |
10052 | while (t1->kind != ck_identity) | |
40703fdf | 10053 | t1 = next_conversion (t1); |
5bd61841 | 10054 | from_type1 = t1->type; |
c8094d83 | 10055 | |
5bd61841 MM |
10056 | t2 = ics2; |
10057 | while (t2->kind != ck_identity) | |
40703fdf | 10058 | t2 = next_conversion (t2); |
5bd61841 | 10059 | from_type2 = t2->type; |
ceab47eb | 10060 | } |
c73964b2 | 10061 | |
b6219f42 JM |
10062 | /* One sequence can only be a subsequence of the other if they start with |
10063 | the same type. They can start with different types when comparing the | |
10064 | second standard conversion sequence in two user-defined conversion | |
10065 | sequences. */ | |
3bfdc719 | 10066 | if (same_type_p (from_type1, from_type2)) |
f62dbf03 | 10067 | { |
ceab47eb | 10068 | if (is_subseq (ics1, ics2)) |
f62dbf03 | 10069 | return 1; |
ceab47eb | 10070 | if (is_subseq (ics2, ics1)) |
f62dbf03 | 10071 | return -1; |
f62dbf03 | 10072 | } |
c73964b2 | 10073 | |
ceab47eb | 10074 | /* [over.ics.rank] |
c73964b2 | 10075 | |
ceab47eb | 10076 | Or, if not that, |
c73964b2 | 10077 | |
ceab47eb MM |
10078 | --the rank of S1 is better than the rank of S2 (by the rules |
10079 | defined below): | |
c73964b2 | 10080 | |
ceab47eb MM |
10081 | Standard conversion sequences are ordered by their ranks: an Exact |
10082 | Match is a better conversion than a Promotion, which is a better | |
10083 | conversion than a Conversion. | |
c73964b2 | 10084 | |
ceab47eb MM |
10085 | Two conversion sequences with the same rank are indistinguishable |
10086 | unless one of the following rules applies: | |
c73964b2 | 10087 | |
14c2101d JM |
10088 | --A conversion that does not a convert a pointer, pointer to member, |
10089 | or std::nullptr_t to bool is better than one that does. | |
c73964b2 | 10090 | |
ceab47eb MM |
10091 | The ICS_STD_RANK automatically handles the pointer-to-bool rule, |
10092 | so that we do not have to check it explicitly. */ | |
5bd61841 | 10093 | if (ics1->rank < ics2->rank) |
ceab47eb | 10094 | return 1; |
5bd61841 | 10095 | else if (ics2->rank < ics1->rank) |
ceab47eb | 10096 | return -1; |
c73964b2 | 10097 | |
5bd61841 MM |
10098 | to_type1 = ics1->type; |
10099 | to_type2 = ics2->type; | |
c73964b2 | 10100 | |
b6219f42 JM |
10101 | /* A conversion from scalar arithmetic type to complex is worse than a |
10102 | conversion between scalar arithmetic types. */ | |
10103 | if (same_type_p (from_type1, from_type2) | |
10104 | && ARITHMETIC_TYPE_P (from_type1) | |
10105 | && ARITHMETIC_TYPE_P (to_type1) | |
10106 | && ARITHMETIC_TYPE_P (to_type2) | |
10107 | && ((TREE_CODE (to_type1) == COMPLEX_TYPE) | |
10108 | != (TREE_CODE (to_type2) == COMPLEX_TYPE))) | |
10109 | { | |
10110 | if (TREE_CODE (to_type1) == COMPLEX_TYPE) | |
10111 | return -1; | |
10112 | else | |
10113 | return 1; | |
10114 | } | |
10115 | ||
ceab47eb MM |
10116 | if (TYPE_PTR_P (from_type1) |
10117 | && TYPE_PTR_P (from_type2) | |
10118 | && TYPE_PTR_P (to_type1) | |
10119 | && TYPE_PTR_P (to_type2)) | |
10120 | { | |
10121 | deref_from_type1 = TREE_TYPE (from_type1); | |
10122 | deref_from_type2 = TREE_TYPE (from_type2); | |
10123 | deref_to_type1 = TREE_TYPE (to_type1); | |
10124 | deref_to_type2 = TREE_TYPE (to_type2); | |
10125 | } | |
10126 | /* The rules for pointers to members A::* are just like the rules | |
10127 | for pointers A*, except opposite: if B is derived from A then | |
10128 | A::* converts to B::*, not vice versa. For that reason, we | |
10129 | switch the from_ and to_ variables here. */ | |
66b1156a PC |
10130 | else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2) |
10131 | && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2)) | |
a5ac359a MM |
10132 | || (TYPE_PTRMEMFUNC_P (from_type1) |
10133 | && TYPE_PTRMEMFUNC_P (from_type2) | |
10134 | && TYPE_PTRMEMFUNC_P (to_type1) | |
10135 | && TYPE_PTRMEMFUNC_P (to_type2))) | |
10136 | { | |
10137 | deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1); | |
10138 | deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2); | |
10139 | deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1); | |
10140 | deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2); | |
ceab47eb | 10141 | } |
c73964b2 | 10142 | |
ceab47eb | 10143 | if (deref_from_type1 != NULL_TREE |
9e1e64ec PC |
10144 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1)) |
10145 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2))) | |
ceab47eb | 10146 | { |
c8094d83 | 10147 | /* This was one of the pointer or pointer-like conversions. |
ceab47eb MM |
10148 | |
10149 | [over.ics.rank] | |
c8094d83 | 10150 | |
ceab47eb MM |
10151 | --If class B is derived directly or indirectly from class A, |
10152 | conversion of B* to A* is better than conversion of B* to | |
10153 | void*, and conversion of A* to void* is better than | |
10154 | conversion of B* to void*. */ | |
50e10fa8 PC |
10155 | if (VOID_TYPE_P (deref_to_type1) |
10156 | && VOID_TYPE_P (deref_to_type2)) | |
c73964b2 | 10157 | { |
ceab47eb MM |
10158 | if (is_properly_derived_from (deref_from_type1, |
10159 | deref_from_type2)) | |
c73964b2 | 10160 | return -1; |
ceab47eb MM |
10161 | else if (is_properly_derived_from (deref_from_type2, |
10162 | deref_from_type1)) | |
10163 | return 1; | |
c73964b2 | 10164 | } |
50e10fa8 PC |
10165 | else if (VOID_TYPE_P (deref_to_type1) |
10166 | || VOID_TYPE_P (deref_to_type2)) | |
c73964b2 | 10167 | { |
3bfdc719 | 10168 | if (same_type_p (deref_from_type1, deref_from_type2)) |
ceab47eb | 10169 | { |
50e10fa8 | 10170 | if (VOID_TYPE_P (deref_to_type2)) |
ceab47eb MM |
10171 | { |
10172 | if (is_properly_derived_from (deref_from_type1, | |
10173 | deref_to_type1)) | |
10174 | return 1; | |
10175 | } | |
10176 | /* We know that DEREF_TO_TYPE1 is `void' here. */ | |
10177 | else if (is_properly_derived_from (deref_from_type1, | |
10178 | deref_to_type2)) | |
10179 | return -1; | |
10180 | } | |
c73964b2 | 10181 | } |
9e1e64ec PC |
10182 | else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1)) |
10183 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2))) | |
c73964b2 | 10184 | { |
ceab47eb MM |
10185 | /* [over.ics.rank] |
10186 | ||
10187 | --If class B is derived directly or indirectly from class A | |
10188 | and class C is derived directly or indirectly from B, | |
c8094d83 | 10189 | |
ceab47eb | 10190 | --conversion of C* to B* is better than conversion of C* to |
c8094d83 MS |
10191 | A*, |
10192 | ||
ceab47eb MM |
10193 | --conversion of B* to A* is better than conversion of C* to |
10194 | A* */ | |
3bfdc719 | 10195 | if (same_type_p (deref_from_type1, deref_from_type2)) |
ceab47eb MM |
10196 | { |
10197 | if (is_properly_derived_from (deref_to_type1, | |
10198 | deref_to_type2)) | |
10199 | return 1; | |
10200 | else if (is_properly_derived_from (deref_to_type2, | |
10201 | deref_to_type1)) | |
10202 | return -1; | |
10203 | } | |
3bfdc719 | 10204 | else if (same_type_p (deref_to_type1, deref_to_type2)) |
ceab47eb MM |
10205 | { |
10206 | if (is_properly_derived_from (deref_from_type2, | |
10207 | deref_from_type1)) | |
10208 | return 1; | |
10209 | else if (is_properly_derived_from (deref_from_type1, | |
10210 | deref_from_type2)) | |
10211 | return -1; | |
10212 | } | |
c73964b2 | 10213 | } |
ceab47eb | 10214 | } |
2d2e8123 | 10215 | else if (CLASS_TYPE_P (non_reference (from_type1)) |
3bfdc719 | 10216 | && same_type_p (from_type1, from_type2)) |
ceab47eb | 10217 | { |
2d2e8123 MM |
10218 | tree from = non_reference (from_type1); |
10219 | ||
ceab47eb | 10220 | /* [over.ics.rank] |
c8094d83 | 10221 | |
ceab47eb MM |
10222 | --binding of an expression of type C to a reference of type |
10223 | B& is better than binding an expression of type C to a | |
10224 | reference of type A& | |
10225 | ||
10226 | --conversion of C to B is better than conversion of C to A, */ | |
2d2e8123 MM |
10227 | if (is_properly_derived_from (from, to_type1) |
10228 | && is_properly_derived_from (from, to_type2)) | |
c73964b2 | 10229 | { |
ceab47eb | 10230 | if (is_properly_derived_from (to_type1, to_type2)) |
c73964b2 | 10231 | return 1; |
ceab47eb | 10232 | else if (is_properly_derived_from (to_type2, to_type1)) |
c73964b2 MS |
10233 | return -1; |
10234 | } | |
10235 | } | |
2d2e8123 | 10236 | else if (CLASS_TYPE_P (non_reference (to_type1)) |
3bfdc719 | 10237 | && same_type_p (to_type1, to_type2)) |
c73964b2 | 10238 | { |
2d2e8123 MM |
10239 | tree to = non_reference (to_type1); |
10240 | ||
ceab47eb | 10241 | /* [over.ics.rank] |
c73964b2 | 10242 | |
ceab47eb MM |
10243 | --binding of an expression of type B to a reference of type |
10244 | A& is better than binding an expression of type C to a | |
c8094d83 | 10245 | reference of type A&, |
ceab47eb | 10246 | |
77077b39 | 10247 | --conversion of B to A is better than conversion of C to A */ |
2d2e8123 MM |
10248 | if (is_properly_derived_from (from_type1, to) |
10249 | && is_properly_derived_from (from_type2, to)) | |
ceab47eb MM |
10250 | { |
10251 | if (is_properly_derived_from (from_type2, from_type1)) | |
10252 | return 1; | |
10253 | else if (is_properly_derived_from (from_type1, from_type2)) | |
10254 | return -1; | |
10255 | } | |
c73964b2 MS |
10256 | } |
10257 | ||
ceab47eb MM |
10258 | /* [over.ics.rank] |
10259 | ||
10260 | --S1 and S2 differ only in their qualification conversion and yield | |
10261 | similar types T1 and T2 (_conv.qual_), respectively, and the cv- | |
10262 | qualification signature of type T1 is a proper subset of the cv- | |
10263 | qualification signature of type T2 */ | |
5bd61841 MM |
10264 | if (ics1->kind == ck_qual |
10265 | && ics2->kind == ck_qual | |
3bfdc719 | 10266 | && same_type_p (from_type1, from_type2)) |
86089be5 DG |
10267 | { |
10268 | int result = comp_cv_qual_signature (to_type1, to_type2); | |
10269 | if (result != 0) | |
10270 | return result; | |
10271 | } | |
ceab47eb MM |
10272 | |
10273 | /* [over.ics.rank] | |
c8094d83 | 10274 | |
8af2fec4 | 10275 | --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers |
caa40bc0 JM |
10276 | to an implicit object parameter of a non-static member function |
10277 | declared without a ref-qualifier, and either S1 binds an lvalue | |
10278 | reference to an lvalue and S2 binds an rvalue reference or S1 binds an | |
10279 | rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x | |
10280 | draft standard, 13.3.3.2) | |
8af2fec4 | 10281 | |
ceab47eb MM |
10282 | --S1 and S2 are reference bindings (_dcl.init.ref_), and the |
10283 | types to which the references refer are the same type except for | |
10284 | top-level cv-qualifiers, and the type to which the reference | |
10285 | initialized by S2 refers is more cv-qualified than the type to | |
6cb1ef51 JM |
10286 | which the reference initialized by S1 refers. |
10287 | ||
10288 | DR 1328 [over.match.best]: the context is an initialization by | |
10289 | conversion function for direct reference binding (13.3.1.6) of a | |
10290 | reference to function type, the return type of F1 is the same kind of | |
10291 | reference (i.e. lvalue or rvalue) as the reference being initialized, | |
10292 | and the return type of F2 is not. */ | |
c8094d83 | 10293 | |
0ee3f0a8 | 10294 | if (ref_conv1 && ref_conv2) |
8af2fec4 | 10295 | { |
6cb1ef51 JM |
10296 | if (!ref_conv1->this_p && !ref_conv2->this_p |
10297 | && (ref_conv1->rvaluedness_matches_p | |
10298 | != ref_conv2->rvaluedness_matches_p) | |
10299 | && (same_type_p (ref_conv1->type, ref_conv2->type) | |
10300 | || (TYPE_REF_IS_RVALUE (ref_conv1->type) | |
10301 | != TYPE_REF_IS_RVALUE (ref_conv2->type)))) | |
0ee3f0a8 | 10302 | { |
d02f620d JM |
10303 | if (ref_conv1->bad_p |
10304 | && !same_type_p (TREE_TYPE (ref_conv1->type), | |
10305 | TREE_TYPE (ref_conv2->type))) | |
10306 | /* Don't prefer a bad conversion that drops cv-quals to a bad | |
10307 | conversion with the wrong rvalueness. */ | |
10308 | return 0; | |
6cb1ef51 JM |
10309 | return (ref_conv1->rvaluedness_matches_p |
10310 | - ref_conv2->rvaluedness_matches_p); | |
0ee3f0a8 | 10311 | } |
8af2fec4 | 10312 | |
0ee3f0a8 | 10313 | if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2)) |
d02f620d JM |
10314 | { |
10315 | int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type)); | |
10316 | int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type)); | |
10317 | if (ref_conv1->bad_p) | |
10318 | { | |
10319 | /* Prefer the one that drops fewer cv-quals. */ | |
10320 | tree ftype = next_conversion (ref_conv1)->type; | |
10321 | int fquals = cp_type_quals (ftype); | |
10322 | q1 ^= fquals; | |
10323 | q2 ^= fquals; | |
10324 | } | |
10325 | return comp_cv_qualification (q2, q1); | |
10326 | } | |
8af2fec4 | 10327 | } |
ceab47eb MM |
10328 | |
10329 | /* Neither conversion sequence is better than the other. */ | |
c73964b2 MS |
10330 | return 0; |
10331 | } | |
10332 | ||
03e70705 JM |
10333 | /* The source type for this standard conversion sequence. */ |
10334 | ||
8e69329a | 10335 | static tree |
5bd61841 | 10336 | source_type (conversion *t) |
8e69329a | 10337 | { |
40703fdf | 10338 | for (;; t = next_conversion (t)) |
8e69329a | 10339 | { |
5bd61841 MM |
10340 | if (t->kind == ck_user |
10341 | || t->kind == ck_ambig | |
10342 | || t->kind == ck_identity) | |
10343 | return t->type; | |
8e69329a | 10344 | } |
8dc2b103 | 10345 | gcc_unreachable (); |
8e69329a | 10346 | } |
5ffe581d JM |
10347 | |
10348 | /* Note a warning about preferring WINNER to LOSER. We do this by storing | |
10349 | a pointer to LOSER and re-running joust to produce the warning if WINNER | |
10350 | is actually used. */ | |
10351 | ||
10352 | static void | |
94be8403 | 10353 | add_warning (struct z_candidate *winner, struct z_candidate *loser) |
5ffe581d | 10354 | { |
67f5655f GDR |
10355 | candidate_warning *cw = (candidate_warning *) |
10356 | conversion_obstack_alloc (sizeof (candidate_warning)); | |
5bd61841 MM |
10357 | cw->loser = loser; |
10358 | cw->next = winner->warnings; | |
10359 | winner->warnings = cw; | |
5ffe581d | 10360 | } |
8e69329a | 10361 | |
c73964b2 MS |
10362 | /* Compare two candidates for overloading as described in |
10363 | [over.match.best]. Return values: | |
10364 | ||
10365 | 1: cand1 is better than cand2 | |
10366 | -1: cand2 is better than cand1 | |
10367 | 0: cand1 and cand2 are indistinguishable */ | |
10368 | ||
10369 | static int | |
b40e334f PC |
10370 | joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn, |
10371 | tsubst_flags_t complain) | |
c73964b2 MS |
10372 | { |
10373 | int winner = 0; | |
5bd61841 MM |
10374 | int off1 = 0, off2 = 0; |
10375 | size_t i; | |
10376 | size_t len; | |
c73964b2 | 10377 | |
d11ad92e MS |
10378 | /* Candidates that involve bad conversions are always worse than those |
10379 | that don't. */ | |
10380 | if (cand1->viable > cand2->viable) | |
10381 | return 1; | |
10382 | if (cand1->viable < cand2->viable) | |
10383 | return -1; | |
10384 | ||
37b6eb34 | 10385 | /* If we have two pseudo-candidates for conversions to the same type, |
6e9dcc25 JM |
10386 | or two candidates for the same function, arbitrarily pick one. */ |
10387 | if (cand1->fn == cand2->fn | |
6615c446 | 10388 | && (IS_TYPE_OR_DECL_P (cand1->fn))) |
37b6eb34 JM |
10389 | return 1; |
10390 | ||
f14edc1a JM |
10391 | /* Prefer a non-deleted function over an implicitly deleted move |
10392 | constructor or assignment operator. This differs slightly from the | |
10393 | wording for issue 1402 (which says the move op is ignored by overload | |
10394 | resolution), but this way produces better error messages. */ | |
10395 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
10396 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
10397 | && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn)) | |
10398 | { | |
10399 | if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn) | |
10400 | && move_fn_p (cand1->fn)) | |
10401 | return -1; | |
10402 | if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn) | |
10403 | && move_fn_p (cand2->fn)) | |
10404 | return 1; | |
10405 | } | |
10406 | ||
c73964b2 MS |
10407 | /* a viable function F1 |
10408 | is defined to be a better function than another viable function F2 if | |
10409 | for all arguments i, ICSi(F1) is not a worse conversion sequence than | |
10410 | ICSi(F2), and then */ | |
10411 | ||
10412 | /* for some argument j, ICSj(F1) is a better conversion sequence than | |
10413 | ICSj(F2) */ | |
10414 | ||
cab1f180 ML |
10415 | /* For comparing static and non-static member functions, we ignore |
10416 | the implicit object parameter of the non-static function. The | |
10417 | standard says to pretend that the static function has an object | |
10418 | parm, but that won't work with operator overloading. */ | |
5bd61841 MM |
10419 | len = cand1->num_convs; |
10420 | if (len != cand2->num_convs) | |
c73964b2 | 10421 | { |
8dc2b103 NS |
10422 | int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn); |
10423 | int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn); | |
10424 | ||
7aca561c JM |
10425 | if (DECL_CONSTRUCTOR_P (cand1->fn) |
10426 | && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn)) | |
10427 | /* We're comparing a near-match list constructor and a near-match | |
10428 | non-list constructor. Just treat them as unordered. */ | |
10429 | return 0; | |
10430 | ||
8dc2b103 | 10431 | gcc_assert (static_1 != static_2); |
c8094d83 | 10432 | |
8dc2b103 | 10433 | if (static_1) |
c73964b2 | 10434 | off2 = 1; |
8dc2b103 | 10435 | else |
c73964b2 MS |
10436 | { |
10437 | off1 = 1; | |
10438 | --len; | |
10439 | } | |
c73964b2 MS |
10440 | } |
10441 | ||
10442 | for (i = 0; i < len; ++i) | |
10443 | { | |
5bd61841 MM |
10444 | conversion *t1 = cand1->convs[i + off1]; |
10445 | conversion *t2 = cand2->convs[i + off2]; | |
da20811c | 10446 | int comp = compare_ics (t1, t2); |
c73964b2 MS |
10447 | |
10448 | if (comp != 0) | |
10449 | { | |
b40e334f PC |
10450 | if ((complain & tf_warning) |
10451 | && warn_sign_promo | |
5bd61841 MM |
10452 | && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2) |
10453 | == cr_std + cr_promotion) | |
10454 | && t1->kind == ck_std | |
10455 | && t2->kind == ck_std | |
10456 | && TREE_CODE (t1->type) == INTEGER_TYPE | |
10457 | && TREE_CODE (t2->type) == INTEGER_TYPE | |
10458 | && (TYPE_PRECISION (t1->type) | |
10459 | == TYPE_PRECISION (t2->type)) | |
40703fdf DS |
10460 | && (TYPE_UNSIGNED (next_conversion (t1)->type) |
10461 | || (TREE_CODE (next_conversion (t1)->type) | |
da20811c JM |
10462 | == ENUMERAL_TYPE))) |
10463 | { | |
40703fdf | 10464 | tree type = next_conversion (t1)->type; |
da20811c | 10465 | tree type1, type2; |
5ffe581d | 10466 | struct z_candidate *w, *l; |
da20811c | 10467 | if (comp > 0) |
5bd61841 | 10468 | type1 = t1->type, type2 = t2->type, |
5ffe581d | 10469 | w = cand1, l = cand2; |
da20811c | 10470 | else |
5bd61841 | 10471 | type1 = t2->type, type2 = t1->type, |
5ffe581d | 10472 | w = cand2, l = cand1; |
da20811c | 10473 | |
5ffe581d JM |
10474 | if (warn) |
10475 | { | |
74fa0285 | 10476 | warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT", |
3db45ab5 | 10477 | type, type1, type2); |
74fa0285 | 10478 | warning (OPT_Wsign_promo, " in call to %qD", w->fn); |
5ffe581d JM |
10479 | } |
10480 | else | |
10481 | add_warning (w, l); | |
da20811c JM |
10482 | } |
10483 | ||
c73964b2 | 10484 | if (winner && comp != winner) |
c11b6f21 MS |
10485 | { |
10486 | winner = 0; | |
10487 | goto tweak; | |
10488 | } | |
c73964b2 MS |
10489 | winner = comp; |
10490 | } | |
10491 | } | |
10492 | ||
9a68c51f JM |
10493 | /* warn about confusing overload resolution for user-defined conversions, |
10494 | either between a constructor and a conversion op, or between two | |
10495 | conversion ops. */ | |
b40e334f PC |
10496 | if ((complain & tf_warning) |
10497 | && winner && warn_conversion && cand1->second_conv | |
f8986275 NS |
10498 | && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn)) |
10499 | && winner != compare_ics (cand1->second_conv, cand2->second_conv)) | |
10500 | { | |
10501 | struct z_candidate *w, *l; | |
10502 | bool give_warning = false; | |
c8094d83 | 10503 | |
f8986275 NS |
10504 | if (winner == 1) |
10505 | w = cand1, l = cand2; | |
10506 | else | |
10507 | w = cand2, l = cand1; | |
c8094d83 | 10508 | |
f8986275 NS |
10509 | /* We don't want to complain about `X::operator T1 ()' |
10510 | beating `X::operator T2 () const', when T2 is a no less | |
9bcb9aae | 10511 | cv-qualified version of T1. */ |
f8986275 NS |
10512 | if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn) |
10513 | && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn)) | |
8e69329a | 10514 | { |
f8986275 NS |
10515 | tree t = TREE_TYPE (TREE_TYPE (l->fn)); |
10516 | tree f = TREE_TYPE (TREE_TYPE (w->fn)); | |
c8094d83 | 10517 | |
71a93b08 | 10518 | if (TREE_CODE (t) == TREE_CODE (f) && INDIRECT_TYPE_P (t)) |
5ffe581d | 10519 | { |
f8986275 NS |
10520 | t = TREE_TYPE (t); |
10521 | f = TREE_TYPE (f); | |
5ffe581d | 10522 | } |
f8986275 NS |
10523 | if (!comp_ptr_ttypes (t, f)) |
10524 | give_warning = true; | |
10525 | } | |
10526 | else | |
10527 | give_warning = true; | |
c8094d83 | 10528 | |
f8986275 NS |
10529 | if (!give_warning) |
10530 | /*NOP*/; | |
2e2d4075 | 10531 | else if (warn) |
f8986275 | 10532 | { |
5bd61841 | 10533 | tree source = source_type (w->convs[0]); |
71a93b08 | 10534 | if (INDIRECT_TYPE_P (source)) |
f8986275 | 10535 | source = TREE_TYPE (source); |
097f82ec | 10536 | auto_diagnostic_group d; |
71205d17 | 10537 | if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn) |
f012c8ef | 10538 | && warning (OPT_Wconversion, " for conversion from %qH to %qI", |
71205d17 MLI |
10539 | source, w->second_conv->type)) |
10540 | { | |
1f5b3869 | 10541 | inform (input_location, " because conversion sequence for the argument is better"); |
71205d17 | 10542 | } |
8e69329a | 10543 | } |
f8986275 NS |
10544 | else |
10545 | add_warning (w, l); | |
8e69329a JM |
10546 | } |
10547 | ||
c73964b2 MS |
10548 | if (winner) |
10549 | return winner; | |
10550 | ||
49fe93f4 JM |
10551 | /* DR 495 moved this tiebreaker above the template ones. */ |
10552 | /* or, if not that, | |
10553 | the context is an initialization by user-defined conversion (see | |
10554 | _dcl.init_ and _over.match.user_) and the standard conversion | |
10555 | sequence from the return type of F1 to the destination type (i.e., | |
10556 | the type of the entity being initialized) is a better conversion | |
10557 | sequence than the standard conversion sequence from the return type | |
10558 | of F2 to the destination type. */ | |
10559 | ||
10560 | if (cand1->second_conv) | |
10561 | { | |
10562 | winner = compare_ics (cand1->second_conv, cand2->second_conv); | |
10563 | if (winner) | |
10564 | return winner; | |
10565 | } | |
10566 | ||
e5596aef NS |
10567 | /* or, if not that, |
10568 | F1 is a non-template function and F2 is a template function | |
10569 | specialization. */ | |
c8094d83 | 10570 | |
ea0ad329 | 10571 | if (!cand1->template_decl && cand2->template_decl) |
c73964b2 | 10572 | return 1; |
ea0ad329 | 10573 | else if (cand1->template_decl && !cand2->template_decl) |
c73964b2 | 10574 | return -1; |
c8094d83 | 10575 | |
e5596aef NS |
10576 | /* or, if not that, |
10577 | F1 and F2 are template functions and the function template for F1 is | |
10578 | more specialized than the template for F2 according to the partial | |
10579 | ordering rules. */ | |
c8094d83 | 10580 | |
ea0ad329 | 10581 | if (cand1->template_decl && cand2->template_decl) |
4cff6abe | 10582 | { |
dda04398 | 10583 | winner = more_specialized_fn |
0cbd7506 MS |
10584 | (TI_TEMPLATE (cand1->template_decl), |
10585 | TI_TEMPLATE (cand2->template_decl), | |
48884537 | 10586 | /* [temp.func.order]: The presence of unused ellipsis and default |
d9579a59 | 10587 | arguments has no effect on the partial ordering of function |
48884537 NS |
10588 | templates. add_function_candidate() will not have |
10589 | counted the "this" argument for constructors. */ | |
10590 | cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn)); | |
4cff6abe | 10591 | if (winner) |
0cbd7506 | 10592 | return winner; |
4cff6abe | 10593 | } |
c73964b2 | 10594 | |
a2dfb563 JM |
10595 | // C++ Concepts |
10596 | // or, if not that, F1 is more constrained than F2. | |
10597 | if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn)) | |
10598 | { | |
10599 | winner = more_constrained (cand1->fn, cand2->fn); | |
10600 | if (winner) | |
10601 | return winner; | |
10602 | } | |
971e17ff | 10603 | |
853ef4e5 JM |
10604 | /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */ |
10605 | if (deduction_guide_p (cand1->fn)) | |
10606 | { | |
10607 | gcc_assert (deduction_guide_p (cand2->fn)); | |
10608 | /* We distinguish between candidates from an explicit deduction guide and | |
10609 | candidates built from a constructor based on DECL_ARTIFICIAL. */ | |
10610 | int art1 = DECL_ARTIFICIAL (cand1->fn); | |
10611 | int art2 = DECL_ARTIFICIAL (cand2->fn); | |
10612 | if (art1 != art2) | |
10613 | return art2 - art1; | |
fb5ce608 JM |
10614 | |
10615 | if (art1) | |
10616 | { | |
10617 | /* Prefer the special copy guide over a declared copy/move | |
10618 | constructor. */ | |
10619 | if (copy_guide_p (cand1->fn)) | |
10620 | return 1; | |
10621 | if (copy_guide_p (cand2->fn)) | |
10622 | return -1; | |
10623 | ||
10624 | /* Prefer a candidate generated from a non-template constructor. */ | |
10625 | int tg1 = template_guide_p (cand1->fn); | |
10626 | int tg2 = template_guide_p (cand2->fn); | |
10627 | if (tg1 != tg2) | |
10628 | return tg2 - tg1; | |
10629 | } | |
853ef4e5 JM |
10630 | } |
10631 | ||
4cdeb234 JM |
10632 | /* F1 is a member of a class D, F2 is a member of a base class B of D, and |
10633 | for all arguments the corresponding parameters of F1 and F2 have the same | |
10634 | type (CWG 2273/2277). */ | |
31f7f784 JM |
10635 | if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn) |
10636 | && !DECL_CONV_FN_P (cand1->fn) | |
10637 | && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn) | |
10638 | && !DECL_CONV_FN_P (cand2->fn)) | |
10639 | { | |
4cdeb234 JM |
10640 | tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn)); |
10641 | tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn)); | |
10642 | ||
10643 | bool used1 = false; | |
10644 | bool used2 = false; | |
10645 | if (base1 == base2) | |
10646 | /* No difference. */; | |
10647 | else if (DERIVED_FROM_P (base1, base2)) | |
10648 | used1 = true; | |
10649 | else if (DERIVED_FROM_P (base2, base1)) | |
10650 | used2 = true; | |
10651 | ||
31f7f784 JM |
10652 | if (int diff = used2 - used1) |
10653 | { | |
10654 | for (i = 0; i < len; ++i) | |
10655 | { | |
10656 | conversion *t1 = cand1->convs[i + off1]; | |
10657 | conversion *t2 = cand2->convs[i + off2]; | |
10658 | if (!same_type_p (t1->type, t2->type)) | |
10659 | break; | |
10660 | } | |
10661 | if (i == len) | |
10662 | return diff; | |
10663 | } | |
10664 | } | |
10665 | ||
08ac397c JM |
10666 | /* Check whether we can discard a builtin candidate, either because we |
10667 | have two identical ones or matching builtin and non-builtin candidates. | |
10668 | ||
10669 | (Pedantically in the latter case the builtin which matched the user | |
10670 | function should not be added to the overload set, but we spot it here. | |
c8094d83 | 10671 | |
08ac397c JM |
10672 | [over.match.oper] |
10673 | ... the builtin candidates include ... | |
10674 | - do not have the same parameter type list as any non-template | |
10675 | non-member candidate. */ | |
c8094d83 | 10676 | |
9dc6f476 | 10677 | if (identifier_p (cand1->fn) || identifier_p (cand2->fn)) |
c73964b2 | 10678 | { |
c11b6f21 | 10679 | for (i = 0; i < len; ++i) |
5bd61841 MM |
10680 | if (!same_type_p (cand1->convs[i]->type, |
10681 | cand2->convs[i]->type)) | |
c73964b2 | 10682 | break; |
5bd61841 | 10683 | if (i == cand1->num_convs) |
08ac397c JM |
10684 | { |
10685 | if (cand1->fn == cand2->fn) | |
10686 | /* Two built-in candidates; arbitrarily pick one. */ | |
10687 | return 1; | |
9dc6f476 | 10688 | else if (identifier_p (cand1->fn)) |
08ac397c JM |
10689 | /* cand1 is built-in; prefer cand2. */ |
10690 | return -1; | |
10691 | else | |
10692 | /* cand2 is built-in; prefer cand1. */ | |
10693 | return 1; | |
10694 | } | |
c73964b2 MS |
10695 | } |
10696 | ||
3649b9b7 ST |
10697 | /* For candidates of a multi-versioned function, make the version with |
10698 | the highest priority win. This version will be checked for dispatching | |
10699 | first. If this version can be inlined into the caller, the front-end | |
10700 | will simply make a direct call to this function. */ | |
10701 | ||
10702 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
10703 | && DECL_FUNCTION_VERSIONED (cand1->fn) | |
10704 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
10705 | && DECL_FUNCTION_VERSIONED (cand2->fn)) | |
10706 | { | |
10707 | tree f1 = TREE_TYPE (cand1->fn); | |
10708 | tree f2 = TREE_TYPE (cand2->fn); | |
10709 | tree p1 = TYPE_ARG_TYPES (f1); | |
10710 | tree p2 = TYPE_ARG_TYPES (f2); | |
10711 | ||
10712 | /* Check if cand1->fn and cand2->fn are versions of the same function. It | |
10713 | is possible that cand1->fn and cand2->fn are function versions but of | |
10714 | different functions. Check types to see if they are versions of the same | |
10715 | function. */ | |
10716 | if (compparms (p1, p2) | |
10717 | && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) | |
10718 | { | |
10719 | /* Always make the version with the higher priority, more | |
10720 | specialized, win. */ | |
10721 | gcc_assert (targetm.compare_version_priority); | |
10722 | if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0) | |
10723 | return 1; | |
10724 | else | |
10725 | return -1; | |
10726 | } | |
10727 | } | |
10728 | ||
e04c614e JM |
10729 | /* If the two function declarations represent the same function (this can |
10730 | happen with declarations in multiple scopes and arg-dependent lookup), | |
10731 | arbitrarily choose one. But first make sure the default args we're | |
10732 | using match. */ | |
2c169bab JM |
10733 | if (DECL_P (cand1->fn) && DECL_P (cand2->fn) |
10734 | && equal_functions (cand1->fn, cand2->fn)) | |
e04c614e JM |
10735 | { |
10736 | tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn)); | |
10737 | tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn)); | |
10738 | ||
10739 | gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn)); | |
10740 | ||
10741 | for (i = 0; i < len; ++i) | |
10742 | { | |
0f8a7706 JM |
10743 | /* Don't crash if the fn is variadic. */ |
10744 | if (!parms1) | |
10745 | break; | |
e04c614e JM |
10746 | parms1 = TREE_CHAIN (parms1); |
10747 | parms2 = TREE_CHAIN (parms2); | |
10748 | } | |
10749 | ||
10750 | if (off1) | |
10751 | parms1 = TREE_CHAIN (parms1); | |
10752 | else if (off2) | |
10753 | parms2 = TREE_CHAIN (parms2); | |
10754 | ||
10755 | for (; parms1; ++i) | |
10756 | { | |
10757 | if (!cp_tree_equal (TREE_PURPOSE (parms1), | |
10758 | TREE_PURPOSE (parms2))) | |
10759 | { | |
10760 | if (warn) | |
10761 | { | |
b40e334f PC |
10762 | if (complain & tf_error) |
10763 | { | |
097f82ec | 10764 | auto_diagnostic_group d; |
129677c1 PC |
10765 | if (permerror (input_location, |
10766 | "default argument mismatch in " | |
10767 | "overload resolution")) | |
10768 | { | |
c5f914a3 PC |
10769 | inform (DECL_SOURCE_LOCATION (cand1->fn), |
10770 | " candidate 1: %q#F", cand1->fn); | |
10771 | inform (DECL_SOURCE_LOCATION (cand2->fn), | |
10772 | " candidate 2: %q#F", cand2->fn); | |
129677c1 | 10773 | } |
b40e334f PC |
10774 | } |
10775 | else | |
10776 | return 0; | |
e04c614e JM |
10777 | } |
10778 | else | |
10779 | add_warning (cand1, cand2); | |
10780 | break; | |
10781 | } | |
10782 | parms1 = TREE_CHAIN (parms1); | |
10783 | parms2 = TREE_CHAIN (parms2); | |
10784 | } | |
10785 | ||
10786 | return 1; | |
10787 | } | |
c8094d83 | 10788 | |
c11b6f21 MS |
10789 | tweak: |
10790 | ||
10791 | /* Extension: If the worst conversion for one candidate is worse than the | |
10792 | worst conversion for the other, take the first. */ | |
b40e334f | 10793 | if (!pedantic && (complain & tf_warning_or_error)) |
c11b6f21 | 10794 | { |
5bd61841 | 10795 | conversion_rank rank1 = cr_identity, rank2 = cr_identity; |
ae0ed63a | 10796 | struct z_candidate *w = 0, *l = 0; |
c11b6f21 MS |
10797 | |
10798 | for (i = 0; i < len; ++i) | |
10799 | { | |
5bd61841 MM |
10800 | if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1) |
10801 | rank1 = CONVERSION_RANK (cand1->convs[i+off1]); | |
10802 | if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2) | |
10803 | rank2 = CONVERSION_RANK (cand2->convs[i + off2]); | |
c11b6f21 | 10804 | } |
c11b6f21 | 10805 | if (rank1 < rank2) |
f86fdf68 | 10806 | winner = 1, w = cand1, l = cand2; |
c11b6f21 | 10807 | if (rank1 > rank2) |
f86fdf68 NS |
10808 | winner = -1, w = cand2, l = cand1; |
10809 | if (winner) | |
0cbd7506 | 10810 | { |
e14eaea4 JM |
10811 | /* Don't choose a deleted function over ambiguity. */ |
10812 | if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn)) | |
10813 | return 0; | |
f86fdf68 NS |
10814 | if (warn) |
10815 | { | |
097f82ec | 10816 | auto_diagnostic_group d; |
509c9d60 | 10817 | pedwarn (input_location, 0, |
37ec60ed JW |
10818 | "ISO C++ says that these are ambiguous, even " |
10819 | "though the worst conversion for the first is better than " | |
10820 | "the worst conversion for the second:"); | |
498ad15e PC |
10821 | print_z_candidate (input_location, _("candidate 1:"), w); |
10822 | print_z_candidate (input_location, _("candidate 2:"), l); | |
f86fdf68 NS |
10823 | } |
10824 | else | |
10825 | add_warning (w, l); | |
0cbd7506 MS |
10826 | return winner; |
10827 | } | |
c11b6f21 MS |
10828 | } |
10829 | ||
50bc768d | 10830 | gcc_assert (!winner); |
4cff6abe | 10831 | return 0; |
c73964b2 MS |
10832 | } |
10833 | ||
10834 | /* Given a list of candidates for overloading, find the best one, if any. | |
10835 | This algorithm has a worst case of O(2n) (winner is last), and a best | |
10836 | case of O(n/2) (totally ambiguous); much better than a sorting | |
10837 | algorithm. */ | |
10838 | ||
10839 | static struct z_candidate * | |
b40e334f | 10840 | tourney (struct z_candidate *candidates, tsubst_flags_t complain) |
c73964b2 MS |
10841 | { |
10842 | struct z_candidate *champ = candidates, *challenger; | |
10843 | int fate; | |
b265c11a | 10844 | int champ_compared_to_predecessor = 0; |
c73964b2 MS |
10845 | |
10846 | /* Walk through the list once, comparing each current champ to the next | |
10847 | candidate, knocking out a candidate or two with each comparison. */ | |
10848 | ||
10849 | for (challenger = champ->next; challenger; ) | |
10850 | { | |
b40e334f | 10851 | fate = joust (champ, challenger, 0, complain); |
c73964b2 MS |
10852 | if (fate == 1) |
10853 | challenger = challenger->next; | |
10854 | else | |
10855 | { | |
10856 | if (fate == 0) | |
10857 | { | |
10858 | champ = challenger->next; | |
10859 | if (champ == 0) | |
6aed477a | 10860 | return NULL; |
b265c11a | 10861 | champ_compared_to_predecessor = 0; |
c73964b2 MS |
10862 | } |
10863 | else | |
b265c11a MM |
10864 | { |
10865 | champ = challenger; | |
10866 | champ_compared_to_predecessor = 1; | |
10867 | } | |
c73964b2 MS |
10868 | |
10869 | challenger = champ->next; | |
10870 | } | |
10871 | } | |
10872 | ||
10873 | /* Make sure the champ is better than all the candidates it hasn't yet | |
b265c11a | 10874 | been compared to. */ |
c73964b2 | 10875 | |
c8094d83 MS |
10876 | for (challenger = candidates; |
10877 | challenger != champ | |
b265c11a | 10878 | && !(champ_compared_to_predecessor && challenger->next == champ); |
c73964b2 MS |
10879 | challenger = challenger->next) |
10880 | { | |
b40e334f | 10881 | fate = joust (champ, challenger, 0, complain); |
c73964b2 | 10882 | if (fate != 1) |
6aed477a | 10883 | return NULL; |
c73964b2 MS |
10884 | } |
10885 | ||
10886 | return champ; | |
10887 | } | |
c11b6f21 | 10888 | |
838dfd8a | 10889 | /* Returns nonzero if things of type FROM can be converted to TO. */ |
4143af33 | 10890 | |
94be8403 | 10891 | bool |
b40e334f | 10892 | can_convert (tree to, tree from, tsubst_flags_t complain) |
53db1bc0 JM |
10893 | { |
10894 | tree arg = NULL_TREE; | |
10895 | /* implicit_conversion only considers user-defined conversions | |
10896 | if it has an expression for the call argument list. */ | |
10897 | if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to)) | |
10898 | arg = build1 (CAST_EXPR, from, NULL_TREE); | |
10899 | return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain); | |
10900 | } | |
10901 | ||
10902 | /* Returns nonzero if things of type FROM can be converted to TO with a | |
10903 | standard conversion. */ | |
10904 | ||
10905 | bool | |
10906 | can_convert_standard (tree to, tree from, tsubst_flags_t complain) | |
c11b6f21 | 10907 | { |
b40e334f | 10908 | return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain); |
c11b6f21 MS |
10909 | } |
10910 | ||
838dfd8a | 10911 | /* Returns nonzero if ARG (of type FROM) can be converted to TO. */ |
4143af33 | 10912 | |
94be8403 | 10913 | bool |
b40e334f PC |
10914 | can_convert_arg (tree to, tree from, tree arg, int flags, |
10915 | tsubst_flags_t complain) | |
c11b6f21 | 10916 | { |
5bd61841 MM |
10917 | conversion *t; |
10918 | void *p; | |
10919 | bool ok_p; | |
10920 | ||
10921 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10922 | p = conversion_obstack_alloc (0); | |
3ced2284 JM |
10923 | /* We want to discard any access checks done for this test, |
10924 | as we might not be in the appropriate access context and | |
10925 | we'll do the check again when we actually perform the | |
10926 | conversion. */ | |
10927 | push_deferring_access_checks (dk_deferred); | |
5bd61841 | 10928 | |
aa7349eb | 10929 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
b40e334f | 10930 | flags, complain); |
5bd61841 MM |
10931 | ok_p = (t && !t->bad_p); |
10932 | ||
3ced2284 JM |
10933 | /* Discard the access checks now. */ |
10934 | pop_deferring_access_checks (); | |
5bd61841 MM |
10935 | /* Free all the conversions we allocated. */ |
10936 | obstack_free (&conversion_obstack, p); | |
10937 | ||
10938 | return ok_p; | |
c11b6f21 | 10939 | } |
27b8d0cd | 10940 | |
72a08131 JM |
10941 | /* Like can_convert_arg, but allows dubious conversions as well. */ |
10942 | ||
94be8403 | 10943 | bool |
b40e334f PC |
10944 | can_convert_arg_bad (tree to, tree from, tree arg, int flags, |
10945 | tsubst_flags_t complain) | |
72a08131 | 10946 | { |
5bd61841 MM |
10947 | conversion *t; |
10948 | void *p; | |
10949 | ||
10950 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10951 | p = conversion_obstack_alloc (0); | |
10952 | /* Try to perform the conversion. */ | |
34b5375f | 10953 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
b40e334f | 10954 | flags, complain); |
5bd61841 MM |
10955 | /* Free all the conversions we allocated. */ |
10956 | obstack_free (&conversion_obstack, p); | |
10957 | ||
10958 | return t != NULL; | |
72a08131 JM |
10959 | } |
10960 | ||
10961 | /* Convert EXPR to TYPE. Return the converted expression. | |
10962 | ||
10963 | Note that we allow bad conversions here because by the time we get to | |
10964 | this point we are committed to doing the conversion. If we end up | |
10965 | doing a bad conversion, convert_like will complain. */ | |
4143af33 | 10966 | |
a7a64a77 | 10967 | tree |
b40e334f PC |
10968 | perform_implicit_conversion_flags (tree type, tree expr, |
10969 | tsubst_flags_t complain, int flags) | |
a7a64a77 | 10970 | { |
5bd61841 MM |
10971 | conversion *conv; |
10972 | void *p; | |
6bdfada4 | 10973 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
5bd61841 | 10974 | |
9f613f06 | 10975 | if (TYPE_REF_P (type)) |
03943bbd JM |
10976 | expr = mark_lvalue_use (expr); |
10977 | else | |
10978 | expr = mark_rvalue_use (expr); | |
10979 | ||
a723baf1 | 10980 | if (error_operand_p (expr)) |
b5534c65 | 10981 | return error_mark_node; |
5bd61841 MM |
10982 | |
10983 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10984 | p = conversion_obstack_alloc (0); | |
10985 | ||
b5534c65 | 10986 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
34b5375f | 10987 | /*c_cast_p=*/false, |
b40e334f | 10988 | flags, complain); |
e57d93c6 | 10989 | |
72a08131 | 10990 | if (!conv) |
a7a64a77 | 10991 | { |
5ade1ed2 | 10992 | if (complain & tf_error) |
e57d93c6 JM |
10993 | { |
10994 | /* If expr has unknown type, then it is an overloaded function. | |
10995 | Call instantiate_type to get good error messages. */ | |
10996 | if (TREE_TYPE (expr) == unknown_type_node) | |
10997 | instantiate_type (type, expr, complain); | |
d3ea4c06 | 10998 | else if (invalid_nonstatic_memfn_p (loc, expr, complain)) |
e57d93c6 JM |
10999 | /* We gave an error. */; |
11000 | else | |
96e6ae57 DM |
11001 | { |
11002 | range_label_for_type_mismatch label (TREE_TYPE (expr), type); | |
11003 | gcc_rich_location rich_loc (loc, &label); | |
11004 | error_at (&rich_loc, "could not convert %qE from %qH to %qI", | |
11005 | expr, TREE_TYPE (expr), type); | |
11006 | } | |
e57d93c6 | 11007 | } |
5bd61841 | 11008 | expr = error_mark_node; |
a7a64a77 | 11009 | } |
d179d179 | 11010 | else if (processing_template_decl && conv->kind != ck_identity) |
07471dfb MM |
11011 | { |
11012 | /* In a template, we are only concerned about determining the | |
11013 | type of non-dependent expressions, so we do not have to | |
a4474a38 JM |
11014 | perform the actual conversion. But for initializers, we |
11015 | need to be able to perform it at instantiation | |
234bef96 | 11016 | (or instantiate_non_dependent_expr) time. */ |
a4474a38 JM |
11017 | expr = build1 (IMPLICIT_CONV_EXPR, type, expr); |
11018 | if (!(flags & LOOKUP_ONLYCONVERTING)) | |
11019 | IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true; | |
07471dfb | 11020 | } |
5bd61841 | 11021 | else |
5ade1ed2 | 11022 | expr = convert_like (conv, expr, complain); |
5bd61841 MM |
11023 | |
11024 | /* Free all the conversions we allocated. */ | |
11025 | obstack_free (&conversion_obstack, p); | |
a7a64a77 | 11026 | |
5bd61841 | 11027 | return expr; |
a7a64a77 MM |
11028 | } |
11029 | ||
e57d93c6 JM |
11030 | tree |
11031 | perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain) | |
11032 | { | |
b40e334f PC |
11033 | return perform_implicit_conversion_flags (type, expr, complain, |
11034 | LOOKUP_IMPLICIT); | |
e57d93c6 JM |
11035 | } |
11036 | ||
3fe18f1d MM |
11037 | /* Convert EXPR to TYPE (as a direct-initialization) if that is |
11038 | permitted. If the conversion is valid, the converted expression is | |
ceeae2d1 | 11039 | returned. Otherwise, NULL_TREE is returned, except in the case |
33c25e5c | 11040 | that TYPE is a class type; in that case, an error is issued. If |
2061820e | 11041 | C_CAST_P is true, then this direct-initialization is taking |
33c25e5c MM |
11042 | place as part of a static_cast being attempted as part of a C-style |
11043 | cast. */ | |
3fe18f1d MM |
11044 | |
11045 | tree | |
c8094d83 | 11046 | perform_direct_initialization_if_possible (tree type, |
33c25e5c | 11047 | tree expr, |
5ade1ed2 DG |
11048 | bool c_cast_p, |
11049 | tsubst_flags_t complain) | |
3fe18f1d | 11050 | { |
5bd61841 MM |
11051 | conversion *conv; |
11052 | void *p; | |
11053 | ||
3fe18f1d MM |
11054 | if (type == error_mark_node || error_operand_p (expr)) |
11055 | return error_mark_node; | |
ceeae2d1 MM |
11056 | /* [dcl.init] |
11057 | ||
11058 | If the destination type is a (possibly cv-qualified) class type: | |
11059 | ||
11060 | -- If the initialization is direct-initialization ..., | |
11061 | constructors are considered. ... If no constructor applies, or | |
11062 | the overload resolution is ambiguous, the initialization is | |
11063 | ill-formed. */ | |
11064 | if (CLASS_TYPE_P (type)) | |
385bce06 | 11065 | { |
9771b263 | 11066 | vec<tree, va_gc> *args = make_tree_vector_single (expr); |
385bce06 | 11067 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, |
c166b898 ILT |
11068 | &args, type, LOOKUP_NORMAL, complain); |
11069 | release_tree_vector (args); | |
362115a9 | 11070 | return build_cplus_new (type, expr, complain); |
385bce06 | 11071 | } |
5bd61841 MM |
11072 | |
11073 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
11074 | p = conversion_obstack_alloc (0); | |
11075 | ||
3fe18f1d | 11076 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
34b5375f | 11077 | c_cast_p, |
b40e334f | 11078 | LOOKUP_NORMAL, complain); |
5bd61841 MM |
11079 | if (!conv || conv->bad_p) |
11080 | expr = NULL_TREE; | |
c360a668 JM |
11081 | else if (processing_template_decl && conv->kind != ck_identity) |
11082 | { | |
11083 | /* In a template, we are only concerned about determining the | |
11084 | type of non-dependent expressions, so we do not have to | |
11085 | perform the actual conversion. But for initializers, we | |
11086 | need to be able to perform it at instantiation | |
11087 | (or instantiate_non_dependent_expr) time. */ | |
11088 | expr = build1 (IMPLICIT_CONV_EXPR, type, expr); | |
11089 | IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true; | |
11090 | } | |
5bd61841 | 11091 | else |
bf31620c | 11092 | expr = convert_like_real (conv, expr, NULL_TREE, 0, |
33c25e5c | 11093 | /*issue_conversion_warnings=*/false, |
5ade1ed2 | 11094 | c_cast_p, |
798ec807 | 11095 | complain); |
5bd61841 MM |
11096 | |
11097 | /* Free all the conversions we allocated. */ | |
11098 | obstack_free (&conversion_obstack, p); | |
11099 | ||
11100 | return expr; | |
3fe18f1d MM |
11101 | } |
11102 | ||
b25dd954 JM |
11103 | /* When initializing a reference that lasts longer than a full-expression, |
11104 | this special rule applies: | |
11105 | ||
11106 | [class.temporary] | |
11107 | ||
11108 | The temporary to which the reference is bound or the temporary | |
11109 | that is the complete object to which the reference is bound | |
11110 | persists for the lifetime of the reference. | |
11111 | ||
11112 | The temporaries created during the evaluation of the expression | |
11113 | initializing the reference, except the temporary to which the | |
11114 | reference is bound, are destroyed at the end of the | |
11115 | full-expression in which they are created. | |
11116 | ||
11117 | In that case, we store the converted expression into a new | |
11118 | VAR_DECL in a new scope. | |
11119 | ||
11120 | However, we want to be careful not to create temporaries when | |
11121 | they are not required. For example, given: | |
11122 | ||
11123 | struct B {}; | |
11124 | struct D : public B {}; | |
11125 | D f(); | |
11126 | const B& b = f(); | |
11127 | ||
11128 | there is no need to copy the return value from "f"; we can just | |
11129 | extend its lifetime. Similarly, given: | |
11130 | ||
11131 | struct S {}; | |
11132 | struct T { operator S(); }; | |
11133 | T t; | |
11134 | const S& s = t; | |
11135 | ||
11136 | we can extend the lifetime of the return value of the conversion | |
11137 | operator. | |
11138 | ||
11139 | The next several functions are involved in this lifetime extension. */ | |
11140 | ||
b1db7f91 JM |
11141 | /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The |
11142 | reference is being bound to a temporary. Create and return a new | |
11143 | VAR_DECL with the indicated TYPE; this variable will store the value to | |
aa6e8ed3 | 11144 | which the reference is bound. */ |
7993382e | 11145 | |
c8094d83 | 11146 | tree |
aa6e8ed3 | 11147 | make_temporary_var_for_ref_to_temp (tree decl, tree type) |
7993382e | 11148 | { |
77fa3ec1 | 11149 | tree var = create_temporary_var (type); |
7993382e MM |
11150 | |
11151 | /* Register the variable. */ | |
5a6ccc94 | 11152 | if (VAR_P (decl) |
3048c0c7 | 11153 | && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl))) |
7993382e MM |
11154 | { |
11155 | /* Namespace-scope or local static; give it a mangled name. */ | |
b25dd954 | 11156 | /* FIXME share comdat with decl? */ |
7993382e | 11157 | |
b1db7f91 | 11158 | TREE_STATIC (var) = TREE_STATIC (decl); |
3048c0c7 | 11159 | CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl); |
56363ffd | 11160 | set_decl_tls_model (var, DECL_TLS_MODEL (decl)); |
77fa3ec1 NS |
11161 | |
11162 | tree name = mangle_ref_init_variable (decl); | |
7993382e MM |
11163 | DECL_NAME (var) = name; |
11164 | SET_DECL_ASSEMBLER_NAME (var, name); | |
7993382e MM |
11165 | } |
11166 | else | |
3b2db49f MM |
11167 | /* Create a new cleanup level if necessary. */ |
11168 | maybe_push_cleanup_level (type); | |
7993382e | 11169 | |
29f0d7d4 | 11170 | return pushdecl (var); |
7993382e MM |
11171 | } |
11172 | ||
09357846 JM |
11173 | /* EXPR is the initializer for a variable DECL of reference or |
11174 | std::initializer_list type. Create, push and return a new VAR_DECL | |
11175 | for the initializer so that it will live as long as DECL. Any | |
11176 | cleanup for the new variable is returned through CLEANUP, and the | |
11177 | code to initialize the new variable is returned through INITP. */ | |
11178 | ||
b25dd954 | 11179 | static tree |
9771b263 | 11180 | set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups, |
b25dd954 | 11181 | tree *initp) |
09357846 JM |
11182 | { |
11183 | tree init; | |
11184 | tree type; | |
11185 | tree var; | |
11186 | ||
11187 | /* Create the temporary variable. */ | |
11188 | type = TREE_TYPE (expr); | |
11189 | var = make_temporary_var_for_ref_to_temp (decl, type); | |
11190 | layout_decl (var, 0); | |
11191 | /* If the rvalue is the result of a function call it will be | |
11192 | a TARGET_EXPR. If it is some other construct (such as a | |
11193 | member access expression where the underlying object is | |
11194 | itself the result of a function call), turn it into a | |
11195 | TARGET_EXPR here. It is important that EXPR be a | |
11196 | TARGET_EXPR below since otherwise the INIT_EXPR will | |
11197 | attempt to make a bitwise copy of EXPR to initialize | |
11198 | VAR. */ | |
11199 | if (TREE_CODE (expr) != TARGET_EXPR) | |
11200 | expr = get_target_expr (expr); | |
fa2200cb | 11201 | |
2c6f7927 JM |
11202 | if (TREE_CODE (decl) == FIELD_DECL |
11203 | && extra_warnings && !TREE_NO_WARNING (decl)) | |
11204 | { | |
11205 | warning (OPT_Wextra, "a temporary bound to %qD only persists " | |
11206 | "until the constructor exits", decl); | |
11207 | TREE_NO_WARNING (decl) = true; | |
11208 | } | |
11209 | ||
b25dd954 JM |
11210 | /* Recursively extend temps in this initializer. */ |
11211 | TARGET_EXPR_INITIAL (expr) | |
11212 | = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups); | |
11213 | ||
7a7fc980 JM |
11214 | /* Any reference temp has a non-trivial initializer. */ |
11215 | DECL_NONTRIVIALLY_INITIALIZED_P (var) = true; | |
11216 | ||
fa2200cb JM |
11217 | /* If the initializer is constant, put it in DECL_INITIAL so we get |
11218 | static initialization and use in constant expressions. */ | |
11219 | init = maybe_constant_init (expr); | |
a7ec7182 JM |
11220 | /* As in store_init_value. */ |
11221 | init = cp_fully_fold (init); | |
fa2200cb JM |
11222 | if (TREE_CONSTANT (init)) |
11223 | { | |
11224 | if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type)) | |
11225 | { | |
11226 | /* 5.19 says that a constant expression can include an | |
11227 | lvalue-rvalue conversion applied to "a glvalue of literal type | |
11228 | that refers to a non-volatile temporary object initialized | |
11229 | with a constant expression". Rather than try to communicate | |
5603790d | 11230 | that this VAR_DECL is a temporary, just mark it constexpr. */ |
fa2200cb | 11231 | DECL_DECLARED_CONSTEXPR_P (var) = true; |
9931a2bf | 11232 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true; |
fa2200cb | 11233 | TREE_CONSTANT (var) = true; |
5603790d | 11234 | TREE_READONLY (var) = true; |
fa2200cb JM |
11235 | } |
11236 | DECL_INITIAL (var) = init; | |
11237 | init = NULL_TREE; | |
11238 | } | |
11239 | else | |
11240 | /* Create the INIT_EXPR that will initialize the temporary | |
11241 | variable. */ | |
89631a43 | 11242 | init = split_nonconstant_init (var, expr); |
09357846 JM |
11243 | if (at_function_scope_p ()) |
11244 | { | |
11245 | add_decl_expr (var); | |
11246 | ||
11247 | if (TREE_STATIC (var)) | |
11248 | init = add_stmt_to_compound (init, register_dtor_fn (var)); | |
11249 | else | |
b25dd954 JM |
11250 | { |
11251 | tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
11252 | if (cleanup) | |
9771b263 | 11253 | vec_safe_push (*cleanups, cleanup); |
b25dd954 | 11254 | } |
09357846 JM |
11255 | |
11256 | /* We must be careful to destroy the temporary only | |
11257 | after its initialization has taken place. If the | |
11258 | initialization throws an exception, then the | |
11259 | destructor should not be run. We cannot simply | |
11260 | transform INIT into something like: | |
11261 | ||
11262 | (INIT, ({ CLEANUP_STMT; })) | |
11263 | ||
11264 | because emit_local_var always treats the | |
11265 | initializer as a full-expression. Thus, the | |
11266 | destructor would run too early; it would run at the | |
11267 | end of initializing the reference variable, rather | |
11268 | than at the end of the block enclosing the | |
11269 | reference variable. | |
11270 | ||
11271 | The solution is to pass back a cleanup expression | |
11272 | which the caller is responsible for attaching to | |
11273 | the statement tree. */ | |
11274 | } | |
11275 | else | |
11276 | { | |
11277 | rest_of_decl_compilation (var, /*toplev=*/1, at_eof); | |
11278 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
7c424acd | 11279 | { |
3048c0c7 | 11280 | if (CP_DECL_THREAD_LOCAL_P (var)) |
7c424acd JM |
11281 | tls_aggregates = tree_cons (NULL_TREE, var, |
11282 | tls_aggregates); | |
11283 | else | |
11284 | static_aggregates = tree_cons (NULL_TREE, var, | |
11285 | static_aggregates); | |
11286 | } | |
eca7fc57 JM |
11287 | else |
11288 | /* Check whether the dtor is callable. */ | |
11289 | cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
09357846 | 11290 | } |
9127c38e JM |
11291 | /* Avoid -Wunused-variable warning (c++/38958). */ |
11292 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
56a6f1d3 | 11293 | && VAR_P (decl)) |
9127c38e | 11294 | TREE_USED (decl) = DECL_READ_P (decl) = true; |
09357846 JM |
11295 | |
11296 | *initp = init; | |
11297 | return var; | |
11298 | } | |
11299 | ||
27b8d0cd | 11300 | /* Convert EXPR to the indicated reference TYPE, in a way suitable for |
b25dd954 | 11301 | initializing a variable of that TYPE. */ |
27b8d0cd MM |
11302 | |
11303 | tree | |
b25dd954 | 11304 | initialize_reference (tree type, tree expr, |
e495f6b0 | 11305 | int flags, tsubst_flags_t complain) |
27b8d0cd | 11306 | { |
5bd61841 MM |
11307 | conversion *conv; |
11308 | void *p; | |
6bdfada4 | 11309 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
7993382e MM |
11310 | |
11311 | if (type == error_mark_node || error_operand_p (expr)) | |
11312 | return error_mark_node; | |
27b8d0cd | 11313 | |
5bd61841 MM |
11314 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
11315 | p = conversion_obstack_alloc (0); | |
11316 | ||
44ba4c4e | 11317 | conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false, |
b40e334f | 11318 | flags, complain); |
5bd61841 | 11319 | if (!conv || conv->bad_p) |
27b8d0cd | 11320 | { |
60d21717 JM |
11321 | if (complain & tf_error) |
11322 | { | |
940023f4 JM |
11323 | if (conv) |
11324 | convert_like (conv, expr, complain); | |
11325 | else if (!CP_TYPE_CONST_P (TREE_TYPE (type)) | |
11326 | && !TYPE_REF_IS_RVALUE (type) | |
72b3e203 | 11327 | && !lvalue_p (expr)) |
5a3c9cf2 | 11328 | error_at (loc, "invalid initialization of non-const reference of " |
f012c8ef | 11329 | "type %qH from an rvalue of type %qI", |
5a3c9cf2 | 11330 | type, TREE_TYPE (expr)); |
60d21717 | 11331 | else |
5a3c9cf2 | 11332 | error_at (loc, "invalid initialization of reference of type " |
f012c8ef | 11333 | "%qH from expression of type %qI", type, |
5a3c9cf2 | 11334 | TREE_TYPE (expr)); |
60d21717 | 11335 | } |
27b8d0cd MM |
11336 | return error_mark_node; |
11337 | } | |
11338 | ||
3ea1e328 PC |
11339 | if (conv->kind == ck_ref_bind) |
11340 | /* Perform the conversion. */ | |
11341 | expr = convert_like (conv, expr, complain); | |
11342 | else if (conv->kind == ck_ambig) | |
11343 | /* We gave an error in build_user_type_conversion_1. */ | |
11344 | expr = error_mark_node; | |
11345 | else | |
11346 | gcc_unreachable (); | |
7993382e | 11347 | |
b25dd954 JM |
11348 | /* Free all the conversions we allocated. */ |
11349 | obstack_free (&conversion_obstack, p); | |
aa6e8ed3 | 11350 | |
b25dd954 JM |
11351 | return expr; |
11352 | } | |
aa6e8ed3 | 11353 | |
b25dd954 JM |
11354 | /* Subroutine of extend_ref_init_temps. Possibly extend one initializer, |
11355 | which is bound either to a reference or a std::initializer_list. */ | |
aa6e8ed3 | 11356 | |
b25dd954 | 11357 | static tree |
9771b263 | 11358 | extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups) |
b25dd954 JM |
11359 | { |
11360 | tree sub = init; | |
11361 | tree *p; | |
11362 | STRIP_NOPS (sub); | |
5efef981 OW |
11363 | if (TREE_CODE (sub) == COMPOUND_EXPR) |
11364 | { | |
11365 | TREE_OPERAND (sub, 1) | |
11366 | = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups); | |
11367 | return init; | |
11368 | } | |
b25dd954 JM |
11369 | if (TREE_CODE (sub) != ADDR_EXPR) |
11370 | return init; | |
11371 | /* Deal with binding to a subobject. */ | |
3423a64d JM |
11372 | for (p = &TREE_OPERAND (sub, 0); |
11373 | (TREE_CODE (*p) == COMPONENT_REF | |
11374 | || TREE_CODE (*p) == ARRAY_REF); ) | |
b25dd954 JM |
11375 | p = &TREE_OPERAND (*p, 0); |
11376 | if (TREE_CODE (*p) == TARGET_EXPR) | |
11377 | { | |
11378 | tree subinit = NULL_TREE; | |
11379 | *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit); | |
51d72abe JM |
11380 | recompute_tree_invariant_for_addr_expr (sub); |
11381 | if (init != sub) | |
11382 | init = fold_convert (TREE_TYPE (init), sub); | |
b25dd954 JM |
11383 | if (subinit) |
11384 | init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init); | |
11385 | } | |
11386 | return init; | |
11387 | } | |
aa6e8ed3 | 11388 | |
b25dd954 JM |
11389 | /* INIT is part of the initializer for DECL. If there are any |
11390 | reference or initializer lists being initialized, extend their | |
11391 | lifetime to match that of DECL. */ | |
aa6e8ed3 | 11392 | |
b25dd954 | 11393 | tree |
9771b263 | 11394 | extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups) |
b25dd954 JM |
11395 | { |
11396 | tree type = TREE_TYPE (init); | |
11397 | if (processing_template_decl) | |
11398 | return init; | |
9f613f06 | 11399 | if (TYPE_REF_P (type)) |
b25dd954 | 11400 | init = extend_ref_init_temps_1 (decl, init, cleanups); |
27afd940 | 11401 | else |
7993382e | 11402 | { |
b25dd954 JM |
11403 | tree ctor = init; |
11404 | if (TREE_CODE (ctor) == TARGET_EXPR) | |
11405 | ctor = TARGET_EXPR_INITIAL (ctor); | |
11406 | if (TREE_CODE (ctor) == CONSTRUCTOR) | |
aa6e8ed3 | 11407 | { |
27afd940 JM |
11408 | if (is_std_init_list (type)) |
11409 | { | |
11410 | /* The temporary array underlying a std::initializer_list | |
11411 | is handled like a reference temporary. */ | |
11412 | tree array = CONSTRUCTOR_ELT (ctor, 0)->value; | |
11413 | array = extend_ref_init_temps_1 (decl, array, cleanups); | |
11414 | CONSTRUCTOR_ELT (ctor, 0)->value = array; | |
11415 | } | |
11416 | else | |
11417 | { | |
11418 | unsigned i; | |
11419 | constructor_elt *p; | |
11420 | vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor); | |
11421 | FOR_EACH_VEC_SAFE_ELT (elts, i, p) | |
11422 | p->value = extend_ref_init_temps (decl, p->value, cleanups); | |
11423 | } | |
60648580 JM |
11424 | recompute_constructor_flags (ctor); |
11425 | if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor)) | |
11426 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true; | |
aa6e8ed3 | 11427 | } |
7993382e MM |
11428 | } |
11429 | ||
b25dd954 | 11430 | return init; |
27b8d0cd | 11431 | } |
e2500fed | 11432 | |
99c4346a JM |
11433 | /* Returns true iff an initializer for TYPE could contain temporaries that |
11434 | need to be extended because they are bound to references or | |
11435 | std::initializer_list. */ | |
11436 | ||
11437 | bool | |
11438 | type_has_extended_temps (tree type) | |
11439 | { | |
11440 | type = strip_array_types (type); | |
9f613f06 | 11441 | if (TYPE_REF_P (type)) |
99c4346a JM |
11442 | return true; |
11443 | if (CLASS_TYPE_P (type)) | |
11444 | { | |
11445 | if (is_std_init_list (type)) | |
11446 | return true; | |
11447 | for (tree f = next_initializable_field (TYPE_FIELDS (type)); | |
11448 | f; f = next_initializable_field (DECL_CHAIN (f))) | |
11449 | if (type_has_extended_temps (TREE_TYPE (f))) | |
11450 | return true; | |
11451 | } | |
11452 | return false; | |
11453 | } | |
11454 | ||
09357846 JM |
11455 | /* Returns true iff TYPE is some variant of std::initializer_list. */ |
11456 | ||
11457 | bool | |
11458 | is_std_init_list (tree type) | |
11459 | { | |
0060a10a JM |
11460 | if (!TYPE_P (type)) |
11461 | return false; | |
bd459a61 PC |
11462 | if (cxx_dialect == cxx98) |
11463 | return false; | |
ad9870f2 | 11464 | /* Look through typedefs. */ |
0060a10a | 11465 | type = TYPE_MAIN_VARIANT (type); |
09357846 JM |
11466 | return (CLASS_TYPE_P (type) |
11467 | && CP_TYPE_CONTEXT (type) == std_node | |
ad9870f2 | 11468 | && init_list_identifier == DECL_NAME (TYPE_NAME (type))); |
09357846 JM |
11469 | } |
11470 | ||
11471 | /* Returns true iff DECL is a list constructor: i.e. a constructor which | |
11472 | will accept an argument list of a single std::initializer_list<T>. */ | |
11473 | ||
11474 | bool | |
11475 | is_list_ctor (tree decl) | |
11476 | { | |
11477 | tree args = FUNCTION_FIRST_USER_PARMTYPE (decl); | |
11478 | tree arg; | |
11479 | ||
11480 | if (!args || args == void_list_node) | |
11481 | return false; | |
11482 | ||
11483 | arg = non_reference (TREE_VALUE (args)); | |
11484 | if (!is_std_init_list (arg)) | |
11485 | return false; | |
11486 | ||
11487 | args = TREE_CHAIN (args); | |
11488 | ||
11489 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
11490 | /* There are more non-defaulted parms. */ | |
11491 | return false; | |
11492 | ||
11493 | return true; | |
11494 | } | |
11495 | ||
e2500fed | 11496 | #include "gt-cp-call.h" |