]>
Commit | Line | Data |
---|---|---|
abdd6f8f | 1 | /* Functions related to invoking -*- C++ -*- methods and overloaded functions. |
8e8f6434 | 2 | Copyright (C) 1987-2018 Free Software Foundation, Inc. |
471086d6 | 3 | Contributed by Michael Tiemann (tiemann@cygnus.com) and |
997d68fe | 4 | modified by Brendan Kehoe (brendan@cygnus.com). |
471086d6 | 5 | |
6f0d25a6 | 6 | This file is part of GCC. |
471086d6 | 7 | |
6f0d25a6 | 8 | GCC is free software; you can redistribute it and/or modify |
471086d6 | 9 | it under the terms of the GNU General Public License as published by |
aa139c3f | 10 | the Free Software Foundation; either version 3, or (at your option) |
471086d6 | 11 | any later version. |
12 | ||
6f0d25a6 | 13 | GCC is distributed in the hope that it will be useful, |
471086d6 | 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 | |
aa139c3f | 19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
471086d6 | 21 | |
22 | ||
96624a9e | 23 | /* High-level class interface. */ |
471086d6 | 24 | |
25 | #include "config.h" | |
b3ef7553 | 26 | #include "system.h" |
805e22b2 | 27 | #include "coretypes.h" |
4cba6f60 | 28 | #include "target.h" |
4cba6f60 | 29 | #include "cp-tree.h" |
30 | #include "timevar.h" | |
31 | #include "stringpool.h" | |
32 | #include "cgraph.h" | |
9ed99284 | 33 | #include "stor-layout.h" |
34 | #include "trans-mem.h" | |
471086d6 | 35 | #include "flags.h" |
2a4e40b0 | 36 | #include "toplev.h" |
44ab85e8 | 37 | #include "intl.h" |
ee1ab431 | 38 | #include "convert.h" |
54be5d7e | 39 | #include "langhooks.h" |
6c536c4f | 40 | #include "c-family/c-objc.h" |
32cf7025 | 41 | #include "internal-fn.h" |
30a86690 | 42 | #include "stringpool.h" |
43 | #include "attribs.h" | |
b7bb5264 | 44 | #include "gcc-rich-location.h" |
471086d6 | 45 | |
1611df57 | 46 | /* The various kinds of conversion. */ |
47 | ||
6dc50383 | 48 | enum conversion_kind { |
1611df57 | 49 | ck_identity, |
50 | ck_lvalue, | |
2e9e9363 | 51 | ck_fnptr, |
1611df57 | 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, | |
f82f1250 | 60 | ck_list, |
61 | ck_aggr, | |
1611df57 | 62 | ck_rvalue |
6dc50383 | 63 | }; |
1611df57 | 64 | |
65 | /* The rank of the conversion. Order of the enumerals matters; better | |
66 | conversions should come earlier in the list. */ | |
67 | ||
6dc50383 | 68 | enum conversion_rank { |
1611df57 | 69 | cr_identity, |
70 | cr_exact, | |
71 | cr_promotion, | |
72 | cr_std, | |
73 | cr_pbool, | |
74 | cr_user, | |
75 | cr_ellipsis, | |
76 | cr_bad | |
6dc50383 | 77 | }; |
1611df57 | 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. | |
e4bc96e2 | 81 | That conversion is always a cr_identity conversion. */ |
1611df57 | 82 | |
1611df57 | 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; | |
b596aa1a | 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. */ | |
1611df57 | 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 | |
612d07ac | 97 | conversion. If KIND is ck_ambig, true if the context is |
98 | copy-initialization. */ | |
1611df57 | 99 | BOOL_BITFIELD need_temporary_p : 1; |
cb02169c | 100 | /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion |
9031d10b | 101 | from a pointer-to-derived to pointer-to-base is being performed. */ |
6ab399e8 | 102 | BOOL_BITFIELD base_p : 1; |
63949b38 | 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 | |
3a50b9db | 105 | being bound to an rvalue expression. If KIND is ck_rvalue or ck_base, |
ff00c674 | 106 | true when we are treating an lvalue as an rvalue (12.8p33). If |
3a50b9db | 107 | ck_identity, we will be binding a reference directly or decaying to |
108 | a pointer. */ | |
63949b38 | 109 | BOOL_BITFIELD rvaluedness_matches_p: 1; |
f82f1250 | 110 | BOOL_BITFIELD check_narrowing: 1; |
ee6d34bb | 111 | /* Whether check_narrowing should only check TREE_CONSTANTs; used |
112 | in build_converted_constant_expr. */ | |
113 | BOOL_BITFIELD check_narrowing_const_only: 1; | |
1611df57 | 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 | |
3a8d62bb | 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. */ | |
1611df57 | 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; | |
3a8d62bb | 127 | /* The array of conversions for an initializer_list, so this |
128 | variant is used only when KIN D is ck_list. */ | |
f82f1250 | 129 | conversion **list; |
1611df57 | 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 | ||
970e1881 | 142 | #define BAD_CONVERSION_RANK(NODE) \ |
143 | ((NODE)->ellipsis_p ? cr_ellipsis \ | |
144 | : (NODE)->user_conv_p ? cr_user \ | |
145 | : (NODE)->rank) | |
146 | ||
1611df57 | 147 | static struct obstack conversion_obstack; |
148 | static bool conversion_obstack_initialized; | |
b596aa1a | 149 | struct rejection_reason; |
1611df57 | 150 | |
66bbeb85 | 151 | static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t); |
eda6e89c | 152 | static int equal_functions (tree, tree); |
66bbeb85 | 153 | static int joust (struct z_candidate *, struct z_candidate *, bool, |
154 | tsubst_flags_t); | |
1611df57 | 155 | static int compare_ics (conversion *, conversion *); |
4b97404d | 156 | static void maybe_warn_class_memaccess (location_t, tree, |
157 | const vec<tree, va_gc> *); | |
ebd21de4 | 158 | static tree build_over_call (struct z_candidate *, int, tsubst_flags_t); |
ebd21de4 | 159 | #define convert_like(CONV, EXPR, COMPLAIN) \ |
d93ee6f8 | 160 | convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \ |
6ab399e8 | 161 | /*issue_conversion_warnings=*/true, \ |
ebd21de4 | 162 | /*c_cast_p=*/false, (COMPLAIN)) |
163 | #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \ | |
d93ee6f8 | 164 | convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \ |
ebd21de4 | 165 | /*issue_conversion_warnings=*/true, \ |
166 | /*c_cast_p=*/false, (COMPLAIN)) | |
d93ee6f8 | 167 | static tree convert_like_real (conversion *, tree, tree, int, bool, |
ebd21de4 | 168 | bool, tsubst_flags_t); |
ef0b0c72 | 169 | static void op_error (location_t, enum tree_code, enum tree_code, tree, |
170 | tree, tree, bool); | |
66bbeb85 | 171 | static struct z_candidate *build_user_type_conversion_1 (tree, tree, int, |
172 | tsubst_flags_t); | |
1e6d0c16 | 173 | static void print_z_candidate (location_t, const char *, struct z_candidate *); |
b596aa1a | 174 | static void print_z_candidates (location_t, struct z_candidate *); |
eda6e89c | 175 | static tree build_this (tree); |
f4da5882 | 176 | static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *); |
eda6e89c | 177 | static bool any_strictly_viable (struct z_candidate *); |
178 | static struct z_candidate *add_template_candidate | |
f1f41a6c | 179 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
66bbeb85 | 180 | tree, tree, tree, int, unification_kind_t, tsubst_flags_t); |
eda6e89c | 181 | static struct z_candidate *add_template_candidate_real |
f1f41a6c | 182 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
66bbeb85 | 183 | tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t); |
8999978b | 184 | static void add_builtin_candidates |
185 | (struct z_candidate **, enum tree_code, enum tree_code, | |
66bbeb85 | 186 | tree, tree *, int, tsubst_flags_t); |
8999978b | 187 | static void add_builtin_candidate |
188 | (struct z_candidate **, enum tree_code, enum tree_code, | |
66bbeb85 | 189 | tree, tree, tree, tree *, tree *, int, tsubst_flags_t); |
eda6e89c | 190 | static bool is_complete (tree); |
9031d10b | 191 | static void build_builtin_candidate |
8999978b | 192 | (struct z_candidate **, tree, tree, tree, tree *, tree *, |
66bbeb85 | 193 | int, tsubst_flags_t); |
9031d10b | 194 | static struct z_candidate *add_conv_candidate |
71910a11 | 195 | (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree, |
66bbeb85 | 196 | tree, tsubst_flags_t); |
9031d10b | 197 | static struct z_candidate *add_function_candidate |
f1f41a6c | 198 | (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree, |
070c395b | 199 | tree, int, conversion**, tsubst_flags_t); |
66bbeb85 | 200 | static conversion *implicit_conversion (tree, tree, tree, bool, int, |
201 | tsubst_flags_t); | |
66bbeb85 | 202 | static conversion *reference_binding (tree, tree, tree, bool, int, |
203 | tsubst_flags_t); | |
1611df57 | 204 | static conversion *build_conv (conversion_kind, tree, conversion *); |
66bbeb85 | 205 | static conversion *build_list_conv (tree, tree, int, tsubst_flags_t); |
3a8d62bb | 206 | static conversion *next_conversion (conversion *); |
1611df57 | 207 | static bool is_subseq (conversion *, conversion *); |
63949b38 | 208 | static conversion *maybe_handle_ref_bind (conversion **); |
1611df57 | 209 | static void maybe_handle_implicit_object (conversion **); |
9031d10b | 210 | static struct z_candidate *add_candidate |
f1f41a6c | 211 | (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t, |
91d81115 | 212 | conversion **, tree, tree, int, struct rejection_reason *, int); |
1611df57 | 213 | static tree source_type (conversion *); |
eda6e89c | 214 | static void add_warning (struct z_candidate *, struct z_candidate *); |
eda6e89c | 215 | static bool reference_compatible_p (tree, tree); |
1611df57 | 216 | static conversion *direct_reference_binding (tree, conversion *); |
eda6e89c | 217 | static bool promoted_arithmetic_type_p (tree); |
66bbeb85 | 218 | static conversion *conditional_conversion (tree, tree, tsubst_flags_t); |
0a3b29ad | 219 | static char *name_as_c_string (tree, tree, bool *); |
5f6526e1 | 220 | static tree prep_operand (tree); |
f1f41a6c | 221 | static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree, |
222 | bool, tree, tree, int, struct z_candidate **, | |
66bbeb85 | 223 | tsubst_flags_t); |
1611df57 | 224 | static conversion *merge_conversion_sequences (conversion *, conversion *); |
1b410098 | 225 | static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t); |
71ccdfff | 226 | |
a32f68f5 | 227 | /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE. |
228 | NAME can take many forms... */ | |
dc56db3b | 229 | |
eda6e89c | 230 | bool |
231 | check_dtor_name (tree basetype, tree name) | |
dc56db3b | 232 | { |
25c6850a | 233 | /* Just accept something we've already complained about. */ |
c24cced6 | 234 | if (name == error_mark_node) |
eda6e89c | 235 | return true; |
c24cced6 | 236 | |
dc56db3b | 237 | if (TREE_CODE (name) == TYPE_DECL) |
238 | name = TREE_TYPE (name); | |
9308e976 | 239 | else if (TYPE_P (name)) |
dc56db3b | 240 | /* OK */; |
694683bb | 241 | else if (identifier_p (name)) |
dc56db3b | 242 | { |
95397ff9 | 243 | if ((MAYBE_CLASS_TYPE_P (basetype) |
6c26e5e5 | 244 | || TREE_CODE (basetype) == ENUMERAL_TYPE) |
245 | && name == constructor_name (basetype)) | |
a32f68f5 | 246 | return true; |
dc56db3b | 247 | else |
248 | name = get_type_value (name); | |
249 | } | |
250 | else | |
092b1d6f | 251 | { |
252 | /* In the case of: | |
9031d10b | 253 | |
653e5405 | 254 | template <class T> struct S { ~S(); }; |
255 | int i; | |
256 | i.~S(); | |
9031d10b | 257 | |
653e5405 | 258 | NAME will be a class template. */ |
092b1d6f | 259 | gcc_assert (DECL_CLASS_TEMPLATE_P (name)); |
260 | return false; | |
261 | } | |
dc56db3b | 262 | |
6466e7a9 | 263 | if (!name || name == error_mark_node) |
a32f68f5 | 264 | return false; |
265 | return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name)); | |
dc56db3b | 266 | } |
267 | ||
0a4be248 | 268 | /* We want the address of a function or method. We avoid creating a |
269 | pointer-to-member function. */ | |
270 | ||
271 | tree | |
4405c1ad | 272 | build_addr_func (tree function, tsubst_flags_t complain) |
0a4be248 | 273 | { |
274 | tree type = TREE_TYPE (function); | |
b248d3f7 | 275 | |
0a4be248 | 276 | /* We have to do these by hand to avoid real pointer to member |
277 | functions. */ | |
278 | if (TREE_CODE (type) == METHOD_TYPE) | |
471086d6 | 279 | { |
a63bc44c | 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, | |
4405c1ad | 284 | TREE_OPERAND (function, 1), |
285 | complain); | |
a63bc44c | 286 | } |
287 | function = build_address (function); | |
0a4be248 | 288 | } |
289 | else | |
547c6b1f | 290 | function = decay_conversion (function, complain, /*reject_builtin=*/false); |
471086d6 | 291 | |
0a4be248 | 292 | return function; |
293 | } | |
471086d6 | 294 | |
0a4be248 | 295 | /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or |
296 | POINTER_TYPE to those. Note, pointer to member function types | |
d01f58f9 | 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. */ | |
471086d6 | 300 | |
301 | tree | |
d01f58f9 | 302 | build_call_n (tree function, int n, ...) |
303 | { | |
304 | if (n == 0) | |
305 | return build_call_a (function, 0, NULL); | |
306 | else | |
307 | { | |
fd70b918 | 308 | tree *argarray = XALLOCAVEC (tree, n); |
d01f58f9 | 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 | ||
197aaeb8 | 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 | { | |
1b0bbafa | 326 | /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */ |
327 | tree decl = cp_get_callee_fndecl_nofold (call); | |
197aaeb8 | 328 | |
329 | /* We check both the decl and the type; a function may be known not to | |
330 | throw without being declared throw(). */ | |
1b0bbafa | 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) | |
32cf7025 | 337 | nothrow = true; |
197aaeb8 | 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 | ||
d01f58f9 | 348 | tree |
349 | build_call_a (tree function, int n, tree *argarray) | |
471086d6 | 350 | { |
d50cce1f | 351 | tree decl; |
d267eaf5 | 352 | tree result_type; |
6fee0737 | 353 | tree fntype; |
d01f58f9 | 354 | int i; |
471086d6 | 355 | |
4405c1ad | 356 | function = build_addr_func (function, tf_warning_or_error); |
471086d6 | 357 | |
528638c9 | 358 | gcc_assert (TYPE_PTR_P (TREE_TYPE (function))); |
6fee0737 | 359 | fntype = TREE_TYPE (TREE_TYPE (function)); |
528638c9 | 360 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE |
361 | || TREE_CODE (fntype) == METHOD_TYPE); | |
6fee0737 | 362 | result_type = TREE_TYPE (fntype); |
4bbaf9cf | 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); | |
d267eaf5 | 366 | |
197aaeb8 | 367 | function = build_call_array_loc (input_location, |
368 | result_type, function, n, argarray); | |
369 | set_flags_from_callee (function); | |
88da234d | 370 | |
197aaeb8 | 371 | decl = get_callee_fndecl (function); |
94a8f2c3 | 372 | |
197aaeb8 | 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 | } | |
69f4b398 | 384 | |
6fee0737 | 385 | require_complete_eh_spec_types (fntype, decl); |
88da234d | 386 | |
197aaeb8 | 387 | TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl)); |
471086d6 | 388 | |
d50cce1f | 389 | /* Don't pass empty class objects by value. This is useful |
3fd9acd7 | 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. */ | |
a0e9bfbb | 392 | if (!decl || !fndecl_built_in_p (decl)) |
d01f58f9 | 393 | for (i = 0; i < n; i++) |
197aaeb8 | 394 | { |
395 | tree arg = CALL_EXPR_ARG (function, i); | |
b72904f5 | 396 | if (is_empty_class (TREE_TYPE (arg)) |
397 | && ! TREE_ADDRESSABLE (TREE_TYPE (arg))) | |
197aaeb8 | 398 | { |
b72904f5 | 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; | |
25c036a7 | 402 | } |
197aaeb8 | 403 | } |
9031d10b | 404 | |
0a4be248 | 405 | return function; |
406 | } | |
471086d6 | 407 | |
ec10e4ad | 408 | /* New overloading code. */ |
409 | ||
6dc50383 | 410 | struct z_candidate; |
1611df57 | 411 | |
1611df57 | 412 | struct candidate_warning { |
413 | z_candidate *loser; | |
414 | candidate_warning *next; | |
415 | }; | |
416 | ||
b596aa1a | 417 | /* Information for providing diagnostics about why overloading failed. */ |
418 | ||
419 | enum rejection_reason_code { | |
420 | rr_none, | |
421 | rr_arity, | |
139a4129 | 422 | rr_explicit_conversion, |
b4c50d78 | 423 | rr_template_conversion, |
b596aa1a | 424 | rr_arg_conversion, |
d5afa928 | 425 | rr_bad_arg_conversion, |
426 | rr_template_unification, | |
56c12fd4 | 427 | rr_invalid_copy, |
7896267d | 428 | rr_inherited_ctor, |
56c12fd4 | 429 | rr_constraint_failure |
b596aa1a | 430 | }; |
431 | ||
432 | struct conversion_info { | |
433 | /* The index of the argument, 0-based. */ | |
434 | int n_arg; | |
aa8d51e4 | 435 | /* The actual argument or its type. */ |
436 | tree from; | |
437 | /* The type of the parameter. */ | |
b596aa1a | 438 | tree to_type; |
b78e49d1 | 439 | /* The location of the argument. */ |
440 | location_t loc; | |
b596aa1a | 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; | |
d5afa928 | 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; | |
c85d5a00 | 464 | int num_targs; |
d5afa928 | 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; | |
b596aa1a | 477 | } u; |
478 | }; | |
479 | ||
1611df57 | 480 | struct z_candidate { |
f70cb9e6 | 481 | /* The FUNCTION_DECL that will be called if this candidate is |
482 | selected by overload resolution. */ | |
ec10e4ad | 483 | tree fn; |
f352a3fb | 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. */ | |
f1f41a6c | 490 | const vec<tree, va_gc> *args; |
00ba6bd5 | 491 | /* The implicit conversion sequences for each of the arguments to |
492 | FN. */ | |
1611df57 | 493 | conversion **convs; |
494 | /* The number of implicit conversion sequences. */ | |
495 | size_t num_convs; | |
00ba6bd5 | 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. */ | |
1611df57 | 499 | conversion *second_conv; |
b596aa1a | 500 | struct rejection_reason *reason; |
f70cb9e6 | 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 | |
c31f8a37 | 509 | is selected by overload resolution. The type pointed to by |
f70cb9e6 | 510 | the `this' pointer must correspond to the most derived class |
511 | indicated by the CONVERSION_PATH. */ | |
512 | tree conversion_path; | |
12e22044 | 513 | tree template_decl; |
3fbd1228 | 514 | tree explicit_targs; |
1611df57 | 515 | candidate_warning *warnings; |
516 | z_candidate *next; | |
91d81115 | 517 | int viable; |
518 | ||
519 | /* The flags active in add_candidate. */ | |
520 | int flags; | |
ec10e4ad | 521 | }; |
522 | ||
5575ae2d | 523 | /* Returns true iff T is a null pointer constant in the sense of |
524 | [conv.ptr]. */ | |
525 | ||
eda6e89c | 526 | bool |
527 | null_ptr_cst_p (tree t) | |
ec10e4ad | 528 | { |
61fba55c | 529 | tree type = TREE_TYPE (t); |
530 | ||
8c18e707 | 531 | /* [conv.ptr] |
532 | ||
533 | A null pointer constant is an integral constant expression | |
6fe11077 | 534 | (_expr.const_) rvalue of integer type that evaluates to zero or |
535 | an rvalue of type std::nullptr_t. */ | |
61fba55c | 536 | if (NULLPTR_TYPE_P (type)) |
eda6e89c | 537 | return true; |
61fba55c | 538 | |
539 | if (cxx_dialect >= cxx11) | |
a4a591f9 | 540 | { |
d76863c8 | 541 | STRIP_ANY_LOCATION_WRAPPER (t); |
542 | ||
28e84036 | 543 | /* Core issue 903 says only literal 0 is a null pointer constant. */ |
61fba55c | 544 | if (TREE_CODE (type) == INTEGER_TYPE |
d19317f0 | 545 | && !char_type_p (type) |
61fba55c | 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 | { | |
006b503a | 553 | t = fold_non_dependent_expr (t, tf_none); |
25475fa0 | 554 | STRIP_NOPS (t); |
28e84036 | 555 | if (integer_zerop (t) && !TREE_OVERFLOW (t)) |
556 | return true; | |
a4a591f9 | 557 | } |
61fba55c | 558 | |
eda6e89c | 559 | return false; |
ec10e4ad | 560 | } |
561 | ||
b5cdaa0b | 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)); | |
05765a91 | 573 | else if (TYPE_PTRDATAMEM_P (type)) |
b5cdaa0b | 574 | return integer_all_onesp (t); |
575 | else | |
576 | return false; | |
577 | } | |
578 | ||
60c22aed | 579 | /* Returns nonzero if PARMLIST consists of only default parms, |
580 | ellipsis, and/or undeduced parameter packs. */ | |
1950676f | 581 | |
eda6e89c | 582 | bool |
9f627b1a | 583 | sufficient_parms_p (const_tree parmlist) |
1950676f | 584 | { |
585 | for (; parmlist && parmlist != void_list_node; | |
586 | parmlist = TREE_CHAIN (parmlist)) | |
60c22aed | 587 | if (!TREE_PURPOSE (parmlist) |
588 | && !PACK_EXPANSION_P (TREE_VALUE (parmlist))) | |
eda6e89c | 589 | return false; |
590 | return true; | |
1950676f | 591 | } |
592 | ||
1611df57 | 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) | |
ec10e4ad | 598 | { |
1611df57 | 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 | ||
b596aa1a | 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 * | |
b78e49d1 | 632 | arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to, |
633 | location_t loc) | |
b596aa1a | 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; | |
aa8d51e4 | 638 | r->u.conversion.from = from; |
b596aa1a | 639 | r->u.conversion.to_type = to; |
b78e49d1 | 640 | r->u.conversion.loc = loc; |
b596aa1a | 641 | return r; |
642 | } | |
643 | ||
644 | static struct rejection_reason * | |
b78e49d1 | 645 | bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to, |
646 | location_t loc) | |
b596aa1a | 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; | |
aa8d51e4 | 651 | r->u.bad_conversion.from = from; |
b596aa1a | 652 | r->u.bad_conversion.to_type = to; |
b78e49d1 | 653 | r->u.bad_conversion.loc = loc; |
b596aa1a | 654 | return r; |
655 | } | |
656 | ||
139a4129 | 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; | |
aa8d51e4 | 662 | r->u.conversion.from = from; |
139a4129 | 663 | r->u.conversion.to_type = to; |
b78e49d1 | 664 | r->u.conversion.loc = UNKNOWN_LOCATION; |
139a4129 | 665 | return r; |
666 | } | |
667 | ||
b4c50d78 | 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; | |
aa8d51e4 | 673 | r->u.conversion.from = from; |
b4c50d78 | 674 | r->u.conversion.to_type = to; |
b78e49d1 | 675 | r->u.conversion.loc = UNKNOWN_LOCATION; |
b4c50d78 | 676 | return r; |
677 | } | |
678 | ||
d5afa928 | 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; | |
c85d5a00 | 690 | r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs); |
d5afa928 | 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 | ||
d5afa928 | 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 | ||
7896267d | 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 | ||
56c12fd4 | 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 | ||
1611df57 | 742 | /* Dynamically allocate a conversion. */ |
743 | ||
744 | static conversion * | |
745 | alloc_conversion (conversion_kind kind) | |
746 | { | |
747 | conversion *c; | |
cc52f165 | 748 | c = (conversion *) conversion_obstack_alloc (sizeof (conversion)); |
1611df57 | 749 | c->kind = kind; |
750 | return c; | |
751 | } | |
752 | ||
1611df57 | 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) | |
9031d10b | 760 | gcc_assert ((obstack_next_free (&conversion_obstack) |
b4df430b | 761 | == obstack_base (&conversion_obstack))); |
1611df57 | 762 | } |
763 | ||
1611df57 | 764 | /* Dynamically allocate an array of N conversions. */ |
765 | ||
766 | static conversion ** | |
767 | alloc_conversions (size_t n) | |
768 | { | |
cc52f165 | 769 | return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *)); |
1611df57 | 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); | |
abca5032 | 777 | |
f82f1250 | 778 | /* Note that the caller is responsible for filling in t->cand for |
779 | user-defined conversions. */ | |
1611df57 | 780 | t = alloc_conversion (code); |
781 | t->type = type; | |
782 | t->u.next = from; | |
abca5032 | 783 | |
ec10e4ad | 784 | switch (code) |
785 | { | |
1611df57 | 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; | |
ec10e4ad | 792 | break; |
793 | ||
1611df57 | 794 | case ck_qual: |
2e9e9363 | 795 | case ck_fnptr: |
1611df57 | 796 | if (rank < cr_exact) |
797 | rank = cr_exact; | |
798 | break; | |
ec10e4ad | 799 | |
800 | default: | |
801 | break; | |
802 | } | |
1611df57 | 803 | t->rank = rank; |
804 | t->user_conv_p = (code == ck_user || from->user_conv_p); | |
805 | t->bad_p = from->bad_p; | |
6ab399e8 | 806 | t->base_p = false; |
ec10e4ad | 807 | return t; |
808 | } | |
809 | ||
f82f1250 | 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 * | |
66bbeb85 | 815 | build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
f82f1250 | 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 | ||
7f24d2b0 | 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 | ||
3e24efbc | 830 | /* Can't make an array of these types. */ |
90ad495b | 831 | if (TYPE_REF_P (elttype) |
3e24efbc | 832 | || TREE_CODE (elttype) == FUNCTION_TYPE |
833 | || VOID_TYPE_P (elttype)) | |
834 | return NULL; | |
835 | ||
f82f1250 | 836 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
837 | { | |
838 | conversion *sub | |
839 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
66bbeb85 | 840 | false, flags, complain); |
f82f1250 | 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 | ||
3a8d62bb | 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 | ||
66020645 | 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 | |
66bbeb85 | 885 | can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain) |
66020645 | 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) | |
66bbeb85 | 895 | ok = can_convert_array (elttype, val, flags, complain); |
66020645 | 896 | else |
66bbeb85 | 897 | ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags, |
898 | complain); | |
66020645 | 899 | if (!ok) |
900 | return false; | |
901 | } | |
902 | return true; | |
903 | } | |
904 | ||
f82f1250 | 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 * | |
66bbeb85 | 909 | build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
f82f1250 | 910 | { |
911 | unsigned HOST_WIDE_INT i = 0; | |
912 | conversion *c; | |
10aa67fa | 913 | tree field = next_initializable_field (TYPE_FIELDS (type)); |
dbfcf378 | 914 | tree empty_ctor = NULL_TREE; |
f82f1250 | 915 | |
81dbec5b | 916 | /* We already called reshape_init in implicit_conversion. */ |
0138a8ea | 917 | |
8b433e5e | 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; | |
3fc9e843 | 921 | |
1767a056 | 922 | for (; field; field = next_initializable_field (DECL_CHAIN (field))) |
f82f1250 | 923 | { |
66020645 | 924 | tree ftype = TREE_TYPE (field); |
925 | tree val; | |
926 | bool ok; | |
927 | ||
f82f1250 | 928 | if (i < CONSTRUCTOR_NELTS (ctor)) |
66020645 | 929 | val = CONSTRUCTOR_ELT (ctor, i)->value; |
f3d9faad | 930 | else if (DECL_INITIAL (field)) |
b9e17a4a | 931 | val = get_nsdmi (field, /*ctor*/false, complain); |
90ad495b | 932 | else if (TYPE_REF_P (ftype)) |
956043e3 | 933 | /* Value-initialization of reference is ill-formed. */ |
934 | return NULL; | |
dbfcf378 | 935 | else |
936 | { | |
937 | if (empty_ctor == NULL_TREE) | |
938 | empty_ctor = build_constructor (init_list_type_node, NULL); | |
66020645 | 939 | val = empty_ctor; |
dbfcf378 | 940 | } |
66020645 | 941 | ++i; |
942 | ||
943 | if (TREE_CODE (ftype) == ARRAY_TYPE | |
944 | && TREE_CODE (val) == CONSTRUCTOR) | |
66bbeb85 | 945 | ok = can_convert_array (ftype, val, flags, complain); |
66020645 | 946 | else |
66bbeb85 | 947 | ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags, |
948 | complain); | |
66020645 | 949 | |
950 | if (!ok) | |
951 | return NULL; | |
952 | ||
953 | if (TREE_CODE (type) == UNION_TYPE) | |
954 | break; | |
f82f1250 | 955 | } |
956 | ||
10aa67fa | 957 | if (i < CONSTRUCTOR_NELTS (ctor)) |
958 | return NULL; | |
959 | ||
f82f1250 | 960 | c = alloc_conversion (ck_aggr); |
961 | c->type = type; | |
962 | c->rank = cr_exact; | |
963 | c->user_conv_p = true; | |
3fc9e843 | 964 | c->check_narrowing = true; |
f82f1250 | 965 | c->u.next = NULL; |
966 | return c; | |
967 | } | |
968 | ||
59818863 | 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 * | |
66bbeb85 | 973 | build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
59818863 | 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 | ||
c138daa7 | 984 | /* We might need to propagate the size from the element to the array. */ |
985 | complete_type (type); | |
986 | ||
7b92f819 | 987 | if (TYPE_DOMAIN (type) |
988 | && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE)) | |
59818863 | 989 | { |
e913b5cd | 990 | unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type)); |
59818863 | 991 | if (alen < len) |
992 | return NULL; | |
993 | } | |
994 | ||
8b433e5e | 995 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
996 | ||
59818863 | 997 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
998 | { | |
999 | conversion *sub | |
1000 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
66bbeb85 | 1001 | false, flags, complain); |
59818863 | 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 | ||
581edfc4 | 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 * | |
66bbeb85 | 1026 | build_complex_conv (tree type, tree ctor, int flags, |
1027 | tsubst_flags_t complain) | |
581edfc4 | 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 | ||
8b433e5e | 1041 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
1042 | ||
581edfc4 | 1043 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
1044 | { | |
1045 | conversion *sub | |
1046 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
66bbeb85 | 1047 | false, flags, complain); |
581edfc4 | 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 | ||
1611df57 | 1068 | /* Build a representation of the identity conversion from EXPR to |
dfea972c | 1069 | itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */ |
1611df57 | 1070 | |
1071 | static conversion * | |
1072 | build_identity_conv (tree type, tree expr) | |
1073 | { | |
1074 | conversion *c; | |
9031d10b | 1075 | |
1611df57 | 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 | ||
8c18e707 | 1099 | tree |
eda6e89c | 1100 | strip_top_quals (tree t) |
1adc02a5 | 1101 | { |
1102 | if (TREE_CODE (t) == ARRAY_TYPE) | |
1103 | return t; | |
fdb4703c | 1104 | return cp_build_qualified_type (t, 0); |
1adc02a5 | 1105 | } |
1106 | ||
ec10e4ad | 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 | |
8de1f703 | 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. */ | |
ec10e4ad | 1111 | |
1611df57 | 1112 | static conversion * |
8de1f703 | 1113 | standard_conversion (tree to, tree from, tree expr, bool c_cast_p, |
703eb775 | 1114 | int flags, tsubst_flags_t complain) |
ec10e4ad | 1115 | { |
1116 | enum tree_code fcode, tcode; | |
1611df57 | 1117 | conversion *conv; |
eda6e89c | 1118 | bool fromref = false; |
96c42edf | 1119 | tree qualified_to; |
1adc02a5 | 1120 | |
ef4534a3 | 1121 | to = non_reference (to); |
90ad495b | 1122 | if (TYPE_REF_P (from)) |
1adc02a5 | 1123 | { |
eda6e89c | 1124 | fromref = true; |
1adc02a5 | 1125 | from = TREE_TYPE (from); |
1126 | } | |
96c42edf | 1127 | qualified_to = to; |
1adc02a5 | 1128 | to = strip_top_quals (to); |
1129 | from = strip_top_quals (from); | |
ec10e4ad | 1130 | |
6fb57d29 | 1131 | if (expr && type_unknown_p (expr)) |
cc4d0855 | 1132 | { |
6fb57d29 | 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). */ | |
703eb775 | 1144 | expr = resolve_nondeduced_context (expr, complain); |
6fb57d29 | 1145 | from = TREE_TYPE (expr); |
1146 | } | |
cc4d0855 | 1147 | } |
1148 | ||
ec10e4ad | 1149 | fcode = TREE_CODE (from); |
1150 | tcode = TREE_CODE (to); | |
1151 | ||
1611df57 | 1152 | conv = build_identity_conv (from, expr); |
dacbeac0 | 1153 | if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE) |
ec10e4ad | 1154 | { |
dacbeac0 | 1155 | from = type_decays_to (from); |
ec10e4ad | 1156 | fcode = TREE_CODE (from); |
3ef7ff1b | 1157 | /* Tell convert_like_real that we're using the address. */ |
1158 | conv->rvaluedness_matches_p = true; | |
1611df57 | 1159 | conv = build_conv (ck_lvalue, from, conv); |
ec10e4ad | 1160 | } |
049132bc | 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))) | |
c0e47fd4 | 1165 | { |
1166 | if (expr) | |
1167 | { | |
1168 | tree bitfield_type; | |
1169 | bitfield_type = is_bitfield_expr_with_lowered_type (expr); | |
1170 | if (bitfield_type) | |
dacbeac0 | 1171 | { |
1172 | from = strip_top_quals (bitfield_type); | |
1173 | fcode = TREE_CODE (from); | |
1174 | } | |
c0e47fd4 | 1175 | } |
1176 | conv = build_conv (ck_rvalue, from, conv); | |
13f56139 | 1177 | if (flags & LOOKUP_PREFER_RVALUE) |
ff00c674 | 1178 | /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */ |
13f56139 | 1179 | conv->rvaluedness_matches_p = true; |
c0e47fd4 | 1180 | } |
1adc02a5 | 1181 | |
bd8962d5 | 1182 | /* Allow conversion between `__complex__' data types. */ |
372e0e29 | 1183 | if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE) |
1184 | { | |
1185 | /* The standard conversion sequence to convert FROM to TO is | |
653e5405 | 1186 | the standard conversion sequence to perform componentwise |
1187 | conversion. */ | |
1611df57 | 1188 | conversion *part_conv = standard_conversion |
703eb775 | 1189 | (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags, |
1190 | complain); | |
9031d10b | 1191 | |
372e0e29 | 1192 | if (part_conv) |
653e5405 | 1193 | { |
1611df57 | 1194 | conv = build_conv (part_conv->kind, to, conv); |
1195 | conv->rank = part_conv->rank; | |
653e5405 | 1196 | } |
372e0e29 | 1197 | else |
653e5405 | 1198 | conv = NULL; |
372e0e29 | 1199 | |
1200 | return conv; | |
1201 | } | |
1202 | ||
8c18e707 | 1203 | if (same_type_p (from, to)) |
96c42edf | 1204 | { |
1205 | if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue) | |
1206 | conv->type = qualified_to; | |
1207 | return conv; | |
1208 | } | |
ec10e4ad | 1209 | |
6fe11077 | 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. */ | |
05765a91 | 1214 | if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to) |
c7ca48ea | 1215 | || NULLPTR_TYPE_P (to)) |
9306e6af | 1216 | && ((expr && null_ptr_cst_p (expr)) |
1217 | || NULLPTR_TYPE_P (from))) | |
1611df57 | 1218 | conv = build_conv (ck_std, to, conv); |
1fab1557 | 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. */ | |
1611df57 | 1224 | conv = build_conv (ck_std, to, conv); |
1225 | conv->bad_p = true; | |
1fab1557 | 1226 | } |
3f00a6c0 | 1227 | else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE) |
69773da0 | 1228 | { |
1229 | /* For backwards brain damage compatibility, allow interconversion of | |
1230 | enums and integers with a pedwarn. */ | |
1611df57 | 1231 | conv = build_conv (ck_std, to, conv); |
1232 | conv->bad_p = true; | |
69773da0 | 1233 | } |
1bc16cab | 1234 | else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE) |
05765a91 | 1235 | || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from))) |
ec10e4ad | 1236 | { |
1bc16cab | 1237 | tree to_pointee; |
1238 | tree from_pointee; | |
ec10e4ad | 1239 | |
547c8796 | 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 | ||
1bc16cab | 1261 | if (tcode == POINTER_TYPE |
547c8796 | 1262 | && same_type_ignoring_top_level_qualifiers_p (from_pointee, |
1263 | to_pointee)) | |
a8352d21 | 1264 | ; |
547c8796 | 1265 | else if (VOID_TYPE_P (to_pointee) |
05765a91 | 1266 | && !TYPE_PTRDATAMEM_P (from) |
547c8796 | 1267 | && TREE_CODE (from_pointee) != FUNCTION_TYPE) |
ec10e4ad | 1268 | { |
69b07042 | 1269 | tree nfrom = TREE_TYPE (from); |
e0417caa | 1270 | /* Don't try to apply restrict to void. */ |
1271 | int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT; | |
547c8796 | 1272 | from_pointee = cp_build_qualified_type (void_type_node, quals); |
1273 | from = build_pointer_type (from_pointee); | |
1611df57 | 1274 | conv = build_conv (ck_ptr, from, conv); |
ec10e4ad | 1275 | } |
05765a91 | 1276 | else if (TYPE_PTRDATAMEM_P (from)) |
ec10e4ad | 1277 | { |
1bc16cab | 1278 | tree fbase = TYPE_PTRMEM_CLASS_TYPE (from); |
1279 | tree tbase = TYPE_PTRMEM_CLASS_TYPE (to); | |
ec10e4ad | 1280 | |
0a8a2108 | 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))) | |
ec10e4ad | 1286 | { |
547c8796 | 1287 | from = build_ptrmem_type (tbase, from_pointee); |
1611df57 | 1288 | conv = build_conv (ck_pmem, from, conv); |
ec10e4ad | 1289 | } |
0a8a2108 | 1290 | else |
af59b531 | 1291 | return NULL; |
ec10e4ad | 1292 | } |
547c8796 | 1293 | else if (CLASS_TYPE_P (from_pointee) |
1294 | && CLASS_TYPE_P (to_pointee) | |
f46d4a11 | 1295 | /* [conv.ptr] |
9031d10b | 1296 | |
653e5405 | 1297 | An rvalue of type "pointer to cv D," where D is a |
f46d4a11 | 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 | |
ada40935 | 1303 | that necessitates this conversion is ill-formed. |
653e5405 | 1304 | Therefore, we use DERIVED_FROM_P, and do not check |
1305 | access or uniqueness. */ | |
547c8796 | 1306 | && DERIVED_FROM_P (to_pointee, from_pointee)) |
ec10e4ad | 1307 | { |
547c8796 | 1308 | from_pointee |
1309 | = cp_build_qualified_type (to_pointee, | |
1310 | cp_type_quals (from_pointee)); | |
1311 | from = build_pointer_type (from_pointee); | |
1611df57 | 1312 | conv = build_conv (ck_ptr, from, conv); |
6ab399e8 | 1313 | conv->base_p = true; |
ec10e4ad | 1314 | } |
ec10e4ad | 1315 | |
daf9ff67 | 1316 | if (same_type_p (from, to)) |
33439fbe | 1317 | /* OK */; |
8de1f703 | 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)) | |
1611df57 | 1324 | conv = build_conv (ck_qual, to, conv); |
3a10ba35 | 1325 | else if (expr && string_conv_p (to, expr, 0)) |
1326 | /* converting from string constant to char *. */ | |
1611df57 | 1327 | conv = build_conv (ck_qual, to, conv); |
2e9e9363 | 1328 | else if (fnptr_conv_p (to, from)) |
1329 | conv = build_conv (ck_fnptr, to, conv); | |
4abfc532 | 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); | |
1bc16cab | 1335 | else if (ptr_reasonably_similar (to_pointee, from_pointee)) |
ec10e4ad | 1336 | { |
1611df57 | 1337 | conv = build_conv (ck_ptr, to, conv); |
1338 | conv->bad_p = true; | |
ec10e4ad | 1339 | } |
2739960c | 1340 | else |
1611df57 | 1341 | return NULL; |
2739960c | 1342 | |
1343 | from = to; | |
ec10e4ad | 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)); | |
a8d966c1 | 1349 | tree fbase = class_of_this_parm (fromfn); |
1350 | tree tbase = class_of_this_parm (tofn); | |
ec10e4ad | 1351 | |
2e9e9363 | 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 | |
d26312d0 | 1361 | return NULL; |
ec10e4ad | 1362 | |
2e9e9363 | 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); | |
ec10e4ad | 1375 | } |
1376 | else if (tcode == BOOLEAN_TYPE) | |
1377 | { | |
1bc16cab | 1378 | /* [conv.bool] |
ec10e4ad | 1379 | |
d7f56aae | 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; */ | |
1bc16cab | 1384 | if (ARITHMETIC_TYPE_P (from) |
3f00a6c0 | 1385 | || UNSCOPED_ENUM_P (from) |
1bc16cab | 1386 | || fcode == POINTER_TYPE |
05765a91 | 1387 | || TYPE_PTRMEM_P (from) |
c7ca48ea | 1388 | || NULLPTR_TYPE_P (from)) |
1bc16cab | 1389 | { |
1611df57 | 1390 | conv = build_conv (ck_std, to, conv); |
1bc16cab | 1391 | if (fcode == POINTER_TYPE |
05765a91 | 1392 | || TYPE_PTRDATAMEM_P (from) |
9031d10b | 1393 | || (TYPE_PTRMEMFUNC_P (from) |
6fe11077 | 1394 | && conv->rank < cr_pbool) |
c7ca48ea | 1395 | || NULLPTR_TYPE_P (from)) |
1611df57 | 1396 | conv->rank = cr_pbool; |
d7f56aae | 1397 | if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING)) |
1398 | conv->bad_p = true; | |
df6bc621 | 1399 | if (flags & LOOKUP_NO_NARROWING) |
1400 | conv->check_narrowing = true; | |
1bc16cab | 1401 | return conv; |
1402 | } | |
9031d10b | 1403 | |
1611df57 | 1404 | return NULL; |
ec10e4ad | 1405 | } |
1406 | /* We don't check for ENUMERAL_TYPE here because there are no standard | |
1407 | conversions to enum type. */ | |
f2f890a4 | 1408 | /* As an extension, allow conversion to complex type. */ |
1409 | else if (ARITHMETIC_TYPE_P (to)) | |
ec10e4ad | 1410 | { |
8a089c41 | 1411 | if (! (INTEGRAL_CODE_P (fcode) |
1412 | || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL))) | |
3f00a6c0 | 1413 | || SCOPED_ENUM_P (from)) |
d26312d0 | 1414 | return NULL; |
1611df57 | 1415 | conv = build_conv (ck_std, to, conv); |
ec10e4ad | 1416 | |
1417 | /* Give this a better rank if it's a promotion. */ | |
899cc6e8 | 1418 | if (same_type_p (to, type_promotes_to (from)) |
5ac302b4 | 1419 | && next_conversion (conv)->rank <= cr_promotion) |
1611df57 | 1420 | conv->rank = cr_promotion; |
ec10e4ad | 1421 | } |
fdb4703c | 1422 | else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE |
546c4794 | 1423 | && vector_types_convertible_p (from, to, false)) |
1611df57 | 1424 | return build_conv (ck_std, to, conv); |
95397ff9 | 1425 | else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from) |
8c18e707 | 1426 | && is_properly_derived_from (from, to)) |
6b030a03 | 1427 | { |
1611df57 | 1428 | if (conv->kind == ck_rvalue) |
5ac302b4 | 1429 | conv = next_conversion (conv); |
1611df57 | 1430 | conv = build_conv (ck_base, to, conv); |
a3786328 | 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 | |
57dc7a82 | 1434 | the conversion unless we're binding directly to a reference. */ |
1435 | conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND); | |
3a50b9db | 1436 | if (flags & LOOKUP_PREFER_RVALUE) |
1437 | /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */ | |
1438 | conv->rvaluedness_matches_p = true; | |
6b030a03 | 1439 | } |
ec10e4ad | 1440 | else |
1611df57 | 1441 | return NULL; |
ec10e4ad | 1442 | |
f82f1250 | 1443 | if (flags & LOOKUP_NO_NARROWING) |
1444 | conv->check_narrowing = true; | |
1445 | ||
ec10e4ad | 1446 | return conv; |
1447 | } | |
1448 | ||
3160db1d | 1449 | /* Returns nonzero if T1 is reference-related to T2. */ |
a3786328 | 1450 | |
aaa6e1c2 | 1451 | bool |
eda6e89c | 1452 | reference_related_p (tree t1, tree t2) |
a3786328 | 1453 | { |
4a41f2a1 | 1454 | if (t1 == error_mark_node || t2 == error_mark_node) |
1455 | return false; | |
1456 | ||
a3786328 | 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 | ||
3160db1d | 1470 | /* Returns nonzero if T1 is reference-compatible with T2. */ |
a3786328 | 1471 | |
eda6e89c | 1472 | static bool |
1473 | reference_compatible_p (tree t1, tree t2) | |
a3786328 | 1474 | { |
1475 | /* [dcl.init.ref] | |
1476 | ||
2e9e9363 | 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)) | |
a3786328 | 1485 | && at_least_as_qualified_p (t1, t2)); |
1486 | } | |
1487 | ||
a3786328 | 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 | ||
1611df57 | 1492 | static conversion * |
1493 | direct_reference_binding (tree type, conversion *conv) | |
a3786328 | 1494 | { |
00ba6bd5 | 1495 | tree t; |
1496 | ||
90ad495b | 1497 | gcc_assert (TYPE_REF_P (type)); |
1498 | gcc_assert (!TYPE_REF_P (conv->type)); | |
00ba6bd5 | 1499 | |
1500 | t = TREE_TYPE (type); | |
a3786328 | 1501 | |
bc97e231 | 1502 | if (conv->kind == ck_identity) |
1503 | /* Mark the identity conv as to not decay to rvalue. */ | |
1504 | conv->rvaluedness_matches_p = true; | |
1505 | ||
9031d10b | 1506 | /* [over.ics.rank] |
1507 | ||
a3786328 | 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. | |
9031d10b | 1514 | |
a3786328 | 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. */ | |
2e9e9363 | 1522 | if (is_properly_derived_from (conv->type, t)) |
a3786328 | 1523 | { |
1524 | /* Represent the derived-to-base conversion. */ | |
1611df57 | 1525 | conv = build_conv (ck_base, t, conv); |
a3786328 | 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. */ | |
1611df57 | 1529 | conv->need_temporary_p = false; |
a3786328 | 1530 | } |
bc97e231 | 1531 | |
1611df57 | 1532 | return build_conv (ck_ref_bind, type, conv); |
a3786328 | 1533 | } |
1534 | ||
ec10e4ad | 1535 | /* Returns the conversion path from type FROM to reference type TO for |
1536 | purposes of reference binding. For lvalue binding, either pass a | |
940469e6 | 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 | |
0664b425 | 1539 | the conversion returned. If C_CAST_P is true, this |
1540 | conversion is coming from a C-style cast. */ | |
ec10e4ad | 1541 | |
1611df57 | 1542 | static conversion * |
66bbeb85 | 1543 | reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags, |
1544 | tsubst_flags_t complain) | |
ec10e4ad | 1545 | { |
1611df57 | 1546 | conversion *conv = NULL; |
ec10e4ad | 1547 | tree to = TREE_TYPE (rto); |
1adc02a5 | 1548 | tree from = rfrom; |
4281aa50 | 1549 | tree tfrom; |
eda6e89c | 1550 | bool related_p; |
1551 | bool compatible_p; | |
46af4cac | 1552 | cp_lvalue_kind gl_kind; |
1553 | bool is_lvalue; | |
ec10e4ad | 1554 | |
cc4d0855 | 1555 | if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr)) |
1556 | { | |
4b471722 | 1557 | expr = instantiate_type (to, expr, tf_none); |
cc4d0855 | 1558 | if (expr == error_mark_node) |
1611df57 | 1559 | return NULL; |
cc4d0855 | 1560 | from = TREE_TYPE (expr); |
1561 | } | |
1562 | ||
7c964950 | 1563 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1564 | { | |
bf8d19fe | 1565 | maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS); |
7e28650c | 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) | |
7c964950 | 1570 | { |
7e28650c | 1571 | tree elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1572 | if (error_operand_p (elt)) | |
a86816e5 | 1573 | return NULL; |
7e28650c | 1574 | tree etype = TREE_TYPE (elt); |
1575 | if (reference_related_p (to, etype)) | |
1576 | { | |
1577 | expr = elt; | |
1578 | from = etype; | |
1579 | goto skip; | |
1580 | } | |
7c964950 | 1581 | } |
8ea3a5b4 | 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; | |
7e28650c | 1586 | skip:; |
7c964950 | 1587 | } |
1588 | ||
90ad495b | 1589 | if (TYPE_REF_P (from)) |
46af4cac | 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) | |
f3406a4b | 1599 | gl_kind = lvalue_kind (expr); |
1600 | else if (CLASS_TYPE_P (from) | |
1601 | || TREE_CODE (from) == ARRAY_TYPE) | |
1602 | gl_kind = clk_class; | |
46af4cac | 1603 | else |
1604 | gl_kind = clk_none; | |
f3406a4b | 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)); | |
c76251c1 | 1613 | |
4281aa50 | 1614 | tfrom = from; |
46af4cac | 1615 | if ((gl_kind & clk_bitfield) != 0) |
4281aa50 | 1616 | tfrom = unlowered_expr_type (expr); |
1617 | ||
3dbb2386 | 1618 | /* Figure out whether or not the types are reference-related and |
47ae02b7 | 1619 | reference compatible. We have to do this after stripping |
3dbb2386 | 1620 | references from FROM. */ |
4281aa50 | 1621 | related_p = reference_related_p (to, tfrom); |
0664b425 | 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 | |
4281aa50 | 1625 | && !at_least_as_qualified_p (to, tfrom)) |
ce494fcf | 1626 | to = cp_build_qualified_type (to, cp_type_quals (tfrom)); |
4281aa50 | 1627 | compatible_p = reference_compatible_p (to, tfrom); |
3dbb2386 | 1628 | |
63949b38 | 1629 | /* Directly bind reference when target expression's type is compatible with |
57dc7a82 | 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 | |
f5220369 | 1632 | const and rvalue references to rvalues of compatible class type. |
46af4cac | 1633 | We should also do direct bindings for non-class xvalues. */ |
2e9e9363 | 1634 | if ((related_p || compatible_p) && gl_kind) |
ec10e4ad | 1635 | { |
a3786328 | 1636 | /* [dcl.init.ref] |
ec10e4ad | 1637 | |
9031d10b | 1638 | If the initializer expression |
1639 | ||
a3786328 | 1640 | -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1" |
1641 | is reference-compatible with "cv2 T2," | |
9031d10b | 1642 | |
755edffd | 1643 | the reference is bound directly to the initializer expression |
57dc7a82 | 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 | ||
4281aa50 | 1652 | conv = build_identity_conv (tfrom, expr); |
a3786328 | 1653 | conv = direct_reference_binding (rto, conv); |
63949b38 | 1654 | |
90ad495b | 1655 | if (TYPE_REF_P (rfrom)) |
9c11318d | 1656 | /* Handle rvalue reference to function properly. */ |
1657 | conv->rvaluedness_matches_p | |
1658 | = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom)); | |
63949b38 | 1659 | else |
1660 | conv->rvaluedness_matches_p | |
f5220369 | 1661 | = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue); |
63949b38 | 1662 | |
46af4cac | 1663 | if ((gl_kind & clk_bitfield) != 0 |
1664 | || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to))) | |
a3786328 | 1665 | /* For the purposes of overload resolution, we ignore the fact |
8e68bf5f | 1666 | this expression is a bitfield or packed field. (In particular, |
a3786328 | 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. */ | |
1611df57 | 1676 | conv->need_temporary_p = true; |
9031d10b | 1677 | |
9fc563c9 | 1678 | /* Don't allow binding of lvalues (other than function lvalues) to |
1679 | rvalue references. */ | |
aaa6e1c2 | 1680 | if (is_lvalue && TYPE_REF_IS_RVALUE (rto) |
ff00c674 | 1681 | && TREE_CODE (to) != FUNCTION_TYPE) |
aaa6e1c2 | 1682 | conv->bad_p = true; |
1683 | ||
fdbd4827 | 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 | ||
a3786328 | 1694 | return conv; |
ec10e4ad | 1695 | } |
611ca89a | 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)) | |
ec10e4ad | 1702 | { |
a3786328 | 1703 | /* [dcl.init.ref] |
1704 | ||
755edffd | 1705 | If the initializer expression |
a3786328 | 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 | |
9031d10b | 1712 | best one through overload resolution. (_over.match_). |
a3786328 | 1713 | |
653e5405 | 1714 | the reference is bound to the lvalue result of the conversion |
a3786328 | 1715 | in the second case. */ |
66bbeb85 | 1716 | z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, |
1717 | complain); | |
98d1b25f | 1718 | if (cand) |
1719 | return cand->second_conv; | |
a3786328 | 1720 | } |
ec10e4ad | 1721 | |
8c18e707 | 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) | |
1611df57 | 1725 | return NULL; |
8c18e707 | 1726 | |
a3786328 | 1727 | /* [over.ics.rank] |
9031d10b | 1728 | |
a3786328 | 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 | ||
f0006dc2 | 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 | ||
57dc7a82 | 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 | ||
970e1881 | 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. */ | |
cf7aa2e5 | 1762 | if (!(flags & LOOKUP_COPY_PARM)) |
1763 | flags |= LOOKUP_ONLYCONVERTING; | |
1764 | ||
7c964950 | 1765 | if (!conv) |
1766 | conv = implicit_conversion (to, from, expr, c_cast_p, | |
66bbeb85 | 1767 | flags, complain); |
a3786328 | 1768 | if (!conv) |
1611df57 | 1769 | return NULL; |
a3786328 | 1770 | |
5811f638 | 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 | ||
1611df57 | 1790 | conv = build_conv (ck_ref_bind, rto, conv); |
a3786328 | 1791 | /* This reference binding, unlike those above, requires the |
1792 | creation of a temporary. */ | |
1611df57 | 1793 | conv->need_temporary_p = true; |
5811f638 | 1794 | conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto); |
a3786328 | 1795 | |
fdbd4827 | 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 | ||
ec10e4ad | 1814 | return conv; |
1815 | } | |
1816 | ||
8de1f703 | 1817 | /* Returns the implicit conversion sequence (see [over.ics]) from type |
1818 | FROM to type TO. The optional expression EXPR may affect the | |
4fdb071c | 1819 | conversion. FLAGS are the usual overloading flags. If C_CAST_P is |
1820 | true, this conversion is coming from a C-style cast. */ | |
ec10e4ad | 1821 | |
1611df57 | 1822 | static conversion * |
8de1f703 | 1823 | implicit_conversion (tree to, tree from, tree expr, bool c_cast_p, |
66bbeb85 | 1824 | int flags, tsubst_flags_t complain) |
ec10e4ad | 1825 | { |
1611df57 | 1826 | conversion *conv; |
ec10e4ad | 1827 | |
5b592939 | 1828 | if (from == error_mark_node || to == error_mark_node |
1829 | || expr == error_mark_node) | |
1611df57 | 1830 | return NULL; |
5b592939 | 1831 | |
31e9d6be | 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 | |
8a089c41 | 1836 | |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL); |
31e9d6be | 1837 | |
c4698a21 | 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 | ||
81dbec5b | 1845 | /* Call reshape_init early to remove redundant braces. */ |
1846 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr) | |
38457529 | 1847 | && CLASS_TYPE_P (to) |
81dbec5b | 1848 | && COMPLETE_TYPE_P (complete_type (to)) |
38457529 | 1849 | && !CLASSTYPE_NON_AGGREGATE (to)) |
81dbec5b | 1850 | { |
1851 | expr = reshape_init (to, expr, complain); | |
1852 | if (expr == error_mark_node) | |
1853 | return NULL; | |
1854 | from = TREE_TYPE (expr); | |
1855 | } | |
1856 | ||
90ad495b | 1857 | if (TYPE_REF_P (to)) |
66bbeb85 | 1858 | conv = reference_binding (to, from, expr, c_cast_p, flags, complain); |
ec10e4ad | 1859 | else |
703eb775 | 1860 | conv = standard_conversion (to, from, expr, c_cast_p, flags, complain); |
ec10e4ad | 1861 | |
1862 | if (conv) | |
84303c41 | 1863 | return conv; |
1864 | ||
757f2b35 | 1865 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1866 | { | |
1867 | if (is_std_init_list (to)) | |
66bbeb85 | 1868 | return build_list_conv (to, expr, flags, complain); |
757f2b35 | 1869 | |
581edfc4 | 1870 | /* As an extension, allow list-initialization of _Complex. */ |
1871 | if (TREE_CODE (to) == COMPLEX_TYPE) | |
1872 | { | |
66bbeb85 | 1873 | conv = build_complex_conv (to, expr, flags, complain); |
581edfc4 | 1874 | if (conv) |
1875 | return conv; | |
1876 | } | |
1877 | ||
757f2b35 | 1878 | /* Allow conversion from an initializer-list with one element to a |
ce734c95 | 1879 | scalar type. */ |
1880 | if (SCALAR_TYPE_P (to)) | |
757f2b35 | 1881 | { |
ce734c95 | 1882 | int nelts = CONSTRUCTOR_NELTS (expr); |
757f2b35 | 1883 | tree elt; |
ce734c95 | 1884 | |
1885 | if (nelts == 0) | |
948e1ebc | 1886 | elt = build_value_init (to, tf_none); |
ce734c95 | 1887 | else if (nelts == 1) |
757f2b35 | 1888 | elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1889 | else | |
ce734c95 | 1890 | elt = error_mark_node; |
1891 | ||
757f2b35 | 1892 | conv = implicit_conversion (to, TREE_TYPE (elt), elt, |
66bbeb85 | 1893 | c_cast_p, flags, complain); |
757f2b35 | 1894 | if (conv) |
1895 | { | |
1896 | conv->check_narrowing = true; | |
ce734c95 | 1897 | if (BRACE_ENCLOSED_INITIALIZER_P (elt)) |
1898 | /* Too many levels of braces, i.e. '{{1}}'. */ | |
1899 | conv->bad_p = true; | |
757f2b35 | 1900 | return conv; |
1901 | } | |
1902 | } | |
59818863 | 1903 | else if (TREE_CODE (to) == ARRAY_TYPE) |
66bbeb85 | 1904 | return build_array_conv (to, expr, flags, complain); |
757f2b35 | 1905 | } |
f82f1250 | 1906 | |
84303c41 | 1907 | if (expr != NULL_TREE |
95397ff9 | 1908 | && (MAYBE_CLASS_TYPE_P (from) |
1909 | || MAYBE_CLASS_TYPE_P (to)) | |
84303c41 | 1910 | && (flags & LOOKUP_NO_CONVERSION) == 0) |
ec10e4ad | 1911 | { |
8999978b | 1912 | struct z_candidate *cand; |
1913 | ||
f82f1250 | 1914 | if (CLASS_TYPE_P (to) |
c94000a4 | 1915 | && BRACE_ENCLOSED_INITIALIZER_P (expr) |
1916 | && !CLASSTYPE_NON_AGGREGATE (complete_type (to))) | |
66bbeb85 | 1917 | return build_aggr_conv (to, expr, flags, complain); |
f82f1250 | 1918 | |
66bbeb85 | 1919 | cand = build_user_type_conversion_1 (to, expr, flags, complain); |
c76251c1 | 1920 | if (cand) |
f60f68fd | 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 | } | |
3eb89cd8 | 1939 | |
1940 | /* We used to try to bind a reference to a temporary here, but that | |
63949b38 | 1941 | is now handled after the recursive call to this function at the end |
3eb89cd8 | 1942 | of reference_binding. */ |
84303c41 | 1943 | return conv; |
ec10e4ad | 1944 | } |
1945 | ||
1611df57 | 1946 | return NULL; |
ec10e4ad | 1947 | } |
1948 | ||
070c395b | 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 | ||
94c2a480 | 1966 | /* Add a new entry to the list of candidates. Used by the add_*_candidate |
f352a3fb | 1967 | functions. ARGS will not be changed until a single candidate is |
1968 | selected. */ | |
94c2a480 | 1969 | |
1970 | static struct z_candidate * | |
9031d10b | 1971 | add_candidate (struct z_candidate **candidates, |
f1f41a6c | 1972 | tree fn, tree first_arg, const vec<tree, va_gc> *args, |
9031d10b | 1973 | size_t num_convs, conversion **convs, |
1974 | tree access_path, tree conversion_path, | |
91d81115 | 1975 | int viable, struct rejection_reason *reason, |
1976 | int flags) | |
94c2a480 | 1977 | { |
cc52f165 | 1978 | struct z_candidate *cand = (struct z_candidate *) |
1979 | conversion_obstack_alloc (sizeof (struct z_candidate)); | |
94c2a480 | 1980 | |
1981 | cand->fn = fn; | |
f352a3fb | 1982 | cand->first_arg = first_arg; |
84303c41 | 1983 | cand->args = args; |
94c2a480 | 1984 | cand->convs = convs; |
1611df57 | 1985 | cand->num_convs = num_convs; |
f70cb9e6 | 1986 | cand->access_path = access_path; |
1987 | cand->conversion_path = conversion_path; | |
94c2a480 | 1988 | cand->viable = viable; |
b596aa1a | 1989 | cand->reason = reason; |
8999978b | 1990 | cand->next = *candidates; |
91d81115 | 1991 | cand->flags = flags; |
8999978b | 1992 | *candidates = cand; |
94c2a480 | 1993 | |
1994 | return cand; | |
1995 | } | |
1996 | ||
b596aa1a | 1997 | /* Return the number of remaining arguments in the parameter list |
1998 | beginning with ARG. */ | |
1999 | ||
bd5bb665 | 2000 | int |
b596aa1a | 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 | ||
070c395b | 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 | ||
f352a3fb | 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. | |
c161288a | 2048 | |
2049 | CTYPE, if non-NULL, is the type we want to pretend this function | |
2050 | comes from for purposes of overload resolution. */ | |
ec10e4ad | 2051 | |
2052 | static struct z_candidate * | |
9031d10b | 2053 | add_function_candidate (struct z_candidate **candidates, |
f352a3fb | 2054 | tree fn, tree ctype, tree first_arg, |
f1f41a6c | 2055 | const vec<tree, va_gc> *args, tree access_path, |
66bbeb85 | 2056 | tree conversion_path, int flags, |
070c395b | 2057 | conversion **convs, |
66bbeb85 | 2058 | tsubst_flags_t complain) |
ec10e4ad | 2059 | { |
2060 | tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
2061 | int i, len; | |
f352a3fb | 2062 | tree parmnode; |
2063 | tree orig_first_arg = first_arg; | |
2064 | int skip; | |
ec10e4ad | 2065 | int viable = 1; |
b596aa1a | 2066 | struct rejection_reason *reason = NULL; |
ec10e4ad | 2067 | |
c1d4295f | 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)); | |
98060e63 | 2072 | |
dcbeb3ef | 2073 | /* The `this', `in_chrg' and VTT arguments to constructors are not |
2074 | considered in overload resolution. */ | |
ec10e4ad | 2075 | if (DECL_CONSTRUCTOR_P (fn)) |
2076 | { | |
b4c5b883 | 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); | |
f352a3fb | 2082 | skip = num_artificial_parms_for (fn); |
2083 | if (skip > 0 && first_arg != NULL_TREE) | |
2084 | { | |
2085 | --skip; | |
2086 | first_arg = NULL_TREE; | |
2087 | } | |
ec10e4ad | 2088 | } |
9031d10b | 2089 | else |
f352a3fb | 2090 | skip = 0; |
ec10e4ad | 2091 | |
f1f41a6c | 2092 | len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0); |
070c395b | 2093 | if (!convs) |
2094 | convs = alloc_conversions (len); | |
24d8bf61 | 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 | ||
b596aa1a | 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 | } | |
56c12fd4 | 2118 | |
ccabf725 | 2119 | /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first |
5f6b4206 | 2120 | parameter of type "reference to cv C" (including such a constructor |
2121 | instantiated from a template) is excluded from the set of candidate | |
ccabf725 | 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. */ | |
5f6b4206 | 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)); | |
ccabf725 | 2129 | tree dtype = DECL_CONTEXT (fn); |
67378ae5 | 2130 | tree btype = DECL_INHERITED_CTOR_BASE (fn); |
2131 | if (reference_related_p (ptype, dtype) | |
2132 | && reference_related_p (btype, ptype)) | |
5f6b4206 | 2133 | { |
2134 | viable = false; | |
2135 | reason = inherited_ctor_rejection (); | |
2136 | } | |
2137 | } | |
2138 | ||
56c12fd4 | 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 | ||
ed2deec6 | 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. */ | |
56c12fd4 | 2151 | if (viable && parmlist && (flags & LOOKUP_DEFAULTED)) |
c1e4c34a | 2152 | { |
2153 | if (DECL_CONSTRUCTOR_P (fn)) | |
2154 | i = 1; | |
2155 | else if (DECL_ASSIGNMENT_OPERATOR_P (fn) | |
ef8f6502 | 2156 | && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)) |
c1e4c34a | 2157 | i = 2; |
2158 | else | |
2159 | i = 0; | |
2160 | if (i && len == i) | |
2161 | { | |
2162 | parmnode = chain_index (i-1, parmlist); | |
4a41f2a1 | 2163 | if (!reference_related_p (non_reference (TREE_VALUE (parmnode)), |
2164 | ctype)) | |
c1e4c34a | 2165 | viable = 0; |
2166 | } | |
ed2deec6 | 2167 | |
2168 | /* This only applies at the top level. */ | |
2169 | flags &= ~LOOKUP_DEFAULTED; | |
c1e4c34a | 2170 | } |
2171 | ||
24d8bf61 | 2172 | if (! viable) |
2173 | goto out; | |
2174 | ||
56c12fd4 | 2175 | /* Third, for F to be a viable function, there shall exist for each |
24d8bf61 | 2176 | argument an implicit conversion sequence that converts that argument |
2177 | to the corresponding parameter of F. */ | |
2178 | ||
2179 | parmnode = parmlist; | |
ec10e4ad | 2180 | |
2181 | for (i = 0; i < len; ++i) | |
2182 | { | |
2b15d2ba | 2183 | tree argtype, to_type; |
2184 | tree arg; | |
1611df57 | 2185 | conversion *t; |
c161288a | 2186 | int is_this; |
ec10e4ad | 2187 | |
ec10e4ad | 2188 | if (parmnode == void_list_node) |
2189 | break; | |
ff0e1638 | 2190 | |
070c395b | 2191 | if (convs[i]) |
2192 | { | |
2193 | /* Already set during deduction. */ | |
2194 | parmnode = TREE_CHAIN (parmnode); | |
2195 | continue; | |
2196 | } | |
2197 | ||
f352a3fb | 2198 | if (i == 0 && first_arg != NULL_TREE) |
2199 | arg = first_arg; | |
2200 | else | |
2b15d2ba | 2201 | arg = CONST_CAST_TREE ( |
f1f41a6c | 2202 | (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]); |
f352a3fb | 2203 | argtype = lvalue_type (arg); |
2204 | ||
c161288a | 2205 | is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
2206 | && ! DECL_CONSTRUCTOR_P (fn)); | |
2207 | ||
ff0e1638 | 2208 | if (parmnode) |
2209 | { | |
2210 | tree parmtype = TREE_VALUE (parmnode); | |
2211 | ||
970e1881 | 2212 | parmnode = TREE_CHAIN (parmnode); |
2213 | ||
c161288a | 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. | |
ff0e1638 | 2220 | |
c161288a | 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) | |
ff0e1638 | 2224 | { |
ce494fcf | 2225 | parmtype = cp_build_qualified_type |
2226 | (ctype, cp_type_quals (TREE_TYPE (parmtype))); | |
e116411c | 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); | |
fdb268b3 | 2233 | /* The special handling of 'this' conversions in compare_ics |
2234 | does not apply if there is a ref-qualifier. */ | |
2235 | is_this = false; | |
e116411c | 2236 | } |
2237 | else | |
18619da5 | 2238 | { |
2239 | parmtype = build_pointer_type (parmtype); | |
c017458d | 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); | |
18619da5 | 2244 | argtype = lvalue_type (arg); |
2245 | } | |
ff0e1638 | 2246 | } |
2247 | ||
070c395b | 2248 | int lflags = conv_flags (i, len-skip, fn, arg, flags); |
f82f1250 | 2249 | |
308d6af4 | 2250 | t = implicit_conversion (parmtype, argtype, arg, |
66bbeb85 | 2251 | /*c_cast_p=*/false, lflags, complain); |
b596aa1a | 2252 | to_type = parmtype; |
ff0e1638 | 2253 | } |
ec10e4ad | 2254 | else |
2255 | { | |
1611df57 | 2256 | t = build_identity_conv (argtype, arg); |
2257 | t->ellipsis_p = true; | |
b596aa1a | 2258 | to_type = argtype; |
ec10e4ad | 2259 | } |
2260 | ||
c161288a | 2261 | if (t && is_this) |
1611df57 | 2262 | t->this_p = true; |
2739960c | 2263 | |
1611df57 | 2264 | convs[i] = t; |
ec10e4ad | 2265 | if (! t) |
24d8bf61 | 2266 | { |
2267 | viable = 0; | |
b78e49d1 | 2268 | reason = arg_conversion_rejection (first_arg, i, argtype, to_type, |
2269 | EXPR_LOCATION (arg)); | |
24d8bf61 | 2270 | break; |
2271 | } | |
ec10e4ad | 2272 | |
1611df57 | 2273 | if (t->bad_p) |
b596aa1a | 2274 | { |
2275 | viable = -1; | |
b78e49d1 | 2276 | reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type, |
2277 | EXPR_LOCATION (arg)); | |
2278 | ||
b596aa1a | 2279 | } |
ec10e4ad | 2280 | } |
2281 | ||
24d8bf61 | 2282 | out: |
f352a3fb | 2283 | return add_candidate (candidates, fn, orig_first_arg, args, len, convs, |
91d81115 | 2284 | access_path, conversion_path, viable, reason, flags); |
ec10e4ad | 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 | |
f352a3fb | 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. | |
e80c1dc9 | 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. */ | |
ec10e4ad | 2298 | |
2299 | static struct z_candidate * | |
8999978b | 2300 | add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj, |
71910a11 | 2301 | const vec<tree, va_gc> *arglist, |
66bbeb85 | 2302 | tree access_path, tree conversion_path, |
2303 | tsubst_flags_t complain) | |
ec10e4ad | 2304 | { |
2305 | tree totype = TREE_TYPE (TREE_TYPE (fn)); | |
2a88c9e6 | 2306 | int i, len, viable, flags; |
f352a3fb | 2307 | tree parmlist, parmnode; |
1611df57 | 2308 | conversion **convs; |
b596aa1a | 2309 | struct rejection_reason *reason; |
2a88c9e6 | 2310 | |
2311 | for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; ) | |
2312 | parmlist = TREE_TYPE (parmlist); | |
2313 | parmlist = TYPE_ARG_TYPES (parmlist); | |
2314 | ||
71910a11 | 2315 | len = vec_safe_length (arglist) + 1; |
1611df57 | 2316 | convs = alloc_conversions (len); |
2a88c9e6 | 2317 | parmnode = parmlist; |
2a88c9e6 | 2318 | viable = 1; |
cf7aa2e5 | 2319 | flags = LOOKUP_IMPLICIT; |
b596aa1a | 2320 | reason = NULL; |
ec10e4ad | 2321 | |
e80c1dc9 | 2322 | /* Don't bother looking up the same type twice. */ |
8999978b | 2323 | if (*candidates && (*candidates)->fn == totype) |
2324 | return NULL; | |
e80c1dc9 | 2325 | |
ec10e4ad | 2326 | for (i = 0; i < len; ++i) |
2327 | { | |
b596aa1a | 2328 | tree arg, argtype, convert_type = NULL_TREE; |
1611df57 | 2329 | conversion *t; |
ec10e4ad | 2330 | |
f352a3fb | 2331 | if (i == 0) |
2332 | arg = obj; | |
f352a3fb | 2333 | else |
71910a11 | 2334 | arg = (*arglist)[i - 1]; |
f352a3fb | 2335 | argtype = lvalue_type (arg); |
2336 | ||
ec10e4ad | 2337 | if (i == 0) |
b596aa1a | 2338 | { |
b38367d9 | 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. */ | |
b596aa1a | 2343 | convert_type = totype; |
2344 | } | |
ec10e4ad | 2345 | else if (parmnode == void_list_node) |
2346 | break; | |
2347 | else if (parmnode) | |
b596aa1a | 2348 | { |
2349 | t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg, | |
66bbeb85 | 2350 | /*c_cast_p=*/false, flags, complain); |
b596aa1a | 2351 | convert_type = TREE_VALUE (parmnode); |
2352 | } | |
ec10e4ad | 2353 | else |
2354 | { | |
1611df57 | 2355 | t = build_identity_conv (argtype, arg); |
2356 | t->ellipsis_p = true; | |
b596aa1a | 2357 | convert_type = argtype; |
ec10e4ad | 2358 | } |
2359 | ||
1611df57 | 2360 | convs[i] = t; |
ec10e4ad | 2361 | if (! t) |
2362 | break; | |
2363 | ||
1611df57 | 2364 | if (t->bad_p) |
b596aa1a | 2365 | { |
2366 | viable = -1; | |
b78e49d1 | 2367 | reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type, |
2368 | EXPR_LOCATION (arg)); | |
b596aa1a | 2369 | } |
2739960c | 2370 | |
ec10e4ad | 2371 | if (i == 0) |
2372 | continue; | |
2373 | ||
2374 | if (parmnode) | |
2375 | parmnode = TREE_CHAIN (parmnode); | |
ec10e4ad | 2376 | } |
2377 | ||
b596aa1a | 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 | } | |
ec10e4ad | 2385 | |
71910a11 | 2386 | return add_candidate (candidates, totype, obj, arglist, len, convs, |
91d81115 | 2387 | access_path, conversion_path, viable, reason, flags); |
ec10e4ad | 2388 | } |
2389 | ||
8999978b | 2390 | static void |
2391 | build_builtin_candidate (struct z_candidate **candidates, tree fnname, | |
653e5405 | 2392 | tree type1, tree type2, tree *args, tree *argtypes, |
66bbeb85 | 2393 | int flags, tsubst_flags_t complain) |
ec10e4ad | 2394 | { |
1611df57 | 2395 | conversion *t; |
2396 | conversion **convs; | |
2397 | size_t num_convs; | |
ec10e4ad | 2398 | int viable = 1, i; |
ec10e4ad | 2399 | tree types[2]; |
b596aa1a | 2400 | struct rejection_reason *reason = NULL; |
ec10e4ad | 2401 | |
2402 | types[0] = type1; | |
2403 | types[1] = type2; | |
2404 | ||
1611df57 | 2405 | num_convs = args[2] ? 3 : (args[1] ? 2 : 1); |
2406 | convs = alloc_conversions (num_convs); | |
97e2368b | 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; | |
ec10e4ad | 2415 | |
2416 | for (i = 0; i < 2; ++i) | |
2417 | { | |
2418 | if (! args[i]) | |
2419 | break; | |
2420 | ||
308d6af4 | 2421 | t = implicit_conversion (types[i], argtypes[i], args[i], |
66bbeb85 | 2422 | /*c_cast_p=*/false, flags, complain); |
ec10e4ad | 2423 | if (! t) |
2424 | { | |
2425 | viable = 0; | |
2426 | /* We need something for printing the candidate. */ | |
1611df57 | 2427 | t = build_identity_conv (types[i], NULL_TREE); |
66bbeb85 | 2428 | reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i], |
b78e49d1 | 2429 | types[i], EXPR_LOCATION (args[i])); |
ec10e4ad | 2430 | } |
1611df57 | 2431 | else if (t->bad_p) |
b596aa1a | 2432 | { |
2433 | viable = 0; | |
aa8d51e4 | 2434 | reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i], |
b78e49d1 | 2435 | types[i], |
2436 | EXPR_LOCATION (args[i])); | |
b596aa1a | 2437 | } |
1611df57 | 2438 | convs[i] = t; |
ec10e4ad | 2439 | } |
2440 | ||
2441 | /* For COND_EXPR we rearranged the arguments; undo that now. */ | |
2442 | if (args[2]) | |
2443 | { | |
1611df57 | 2444 | convs[2] = convs[1]; |
2445 | convs[1] = convs[0]; | |
308d6af4 | 2446 | t = implicit_conversion (boolean_type_node, argtypes[2], args[2], |
66bbeb85 | 2447 | /*c_cast_p=*/false, flags, |
2448 | complain); | |
ec10e4ad | 2449 | if (t) |
1611df57 | 2450 | convs[0] = t; |
ec10e4ad | 2451 | else |
b596aa1a | 2452 | { |
2453 | viable = 0; | |
2454 | reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2], | |
b78e49d1 | 2455 | boolean_type_node, |
2456 | EXPR_LOCATION (args[2])); | |
b596aa1a | 2457 | } |
9031d10b | 2458 | } |
ec10e4ad | 2459 | |
f352a3fb | 2460 | add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL, |
9031d10b | 2461 | num_convs, convs, |
8999978b | 2462 | /*access_path=*/NULL_TREE, |
2463 | /*conversion_path=*/NULL_TREE, | |
91d81115 | 2464 | viable, reason, flags); |
ec10e4ad | 2465 | } |
2466 | ||
eda6e89c | 2467 | static bool |
2468 | is_complete (tree t) | |
ec10e4ad | 2469 | { |
4b72716d | 2470 | return COMPLETE_TYPE_P (complete_type (t)); |
ec10e4ad | 2471 | } |
2472 | ||
3160db1d | 2473 | /* Returns nonzero if TYPE is a promoted arithmetic type. */ |
8c18e707 | 2474 | |
eda6e89c | 2475 | static bool |
2476 | promoted_arithmetic_type_p (tree type) | |
8c18e707 | 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. */ | |
b3353c23 | 2485 | return ((CP_INTEGRAL_TYPE_P (type) |
8c18e707 | 2486 | && same_type_p (type_promotes_to (type), type)) |
2487 | || TREE_CODE (type) == REAL_TYPE); | |
2488 | } | |
2489 | ||
ec10e4ad | 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 | |
9031d10b | 2493 | build_builtin_candidate. |
2494 | ||
2495 | TYPE1 and TYPE2 may not be permissible, and we must filter them. | |
4825205a | 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). */ | |
ec10e4ad | 2499 | |
8999978b | 2500 | static void |
2501 | add_builtin_candidate (struct z_candidate **candidates, enum tree_code code, | |
653e5405 | 2502 | enum tree_code code2, tree fnname, tree type1, |
66bbeb85 | 2503 | tree type2, tree *args, tree *argtypes, int flags, |
2504 | tsubst_flags_t complain) | |
ec10e4ad | 2505 | { |
2506 | switch (code) | |
2507 | { | |
2508 | case POSTINCREMENT_EXPR: | |
2509 | case POSTDECREMENT_EXPR: | |
2510 | args[1] = integer_zero_node; | |
2511 | type2 = integer_type_node; | |
d913511e | 2512 | break; |
2513 | default: | |
2514 | break; | |
ec10e4ad | 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) | |
8999978b | 2541 | return; |
e3533433 | 2542 | /* FALLTHRU */ |
ec10e4ad | 2543 | case POSTINCREMENT_EXPR: |
2544 | case PREINCREMENT_EXPR: | |
4825205a | 2545 | if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1)) |
ec10e4ad | 2546 | { |
2547 | type1 = build_reference_type (type1); | |
2548 | break; | |
2549 | } | |
8999978b | 2550 | return; |
ec10e4ad | 2551 | |
d738e512 | 2552 | /* 7 For every cv-qualified or cv-unqualified object type T, there |
ec10e4ad | 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: | |
c21c015b | 2562 | if (TYPE_PTR_P (type1) |
f9670f72 | 2563 | && (TYPE_PTROB_P (type1) |
ec10e4ad | 2564 | || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)) |
2565 | break; | |
9031d10b | 2566 | return; |
ec10e4ad | 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 | ||
97d541d5 | 2576 | case UNARY_PLUS_EXPR: /* unary + */ |
c21c015b | 2577 | if (TYPE_PTR_P (type1)) |
ec10e4ad | 2578 | break; |
e3533433 | 2579 | /* FALLTHRU */ |
ec10e4ad | 2580 | case NEGATE_EXPR: |
2581 | if (ARITHMETIC_TYPE_P (type1)) | |
2582 | break; | |
8999978b | 2583 | return; |
ec10e4ad | 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: | |
b3353c23 | 2590 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1)) |
ec10e4ad | 2591 | break; |
8999978b | 2592 | return; |
ec10e4ad | 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: | |
c21c015b | 2602 | if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2)) |
ec10e4ad | 2603 | { |
2604 | tree c1 = TREE_TYPE (type1); | |
1bc16cab | 2605 | tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2); |
ec10e4ad | 2606 | |
95397ff9 | 2607 | if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1) |
ec10e4ad | 2608 | && (TYPE_PTRMEMFUNC_P (type2) |
727d7618 | 2609 | || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2)))) |
ec10e4ad | 2610 | break; |
2611 | } | |
8999978b | 2612 | return; |
ec10e4ad | 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 | ||
29fbd84d | 2642 | 16For every pointer or enumeration type T, there exist candidate operator |
4825205a | 2643 | functions of the form |
ec10e4ad | 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: | |
f9670f72 | 2657 | if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2)) |
ec10e4ad | 2658 | break; |
b3353c23 | 2659 | if (TYPE_PTROB_P (type1) |
2660 | && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) | |
ec10e4ad | 2661 | { |
2662 | type2 = ptrdiff_type_node; | |
2663 | break; | |
2664 | } | |
fa5f704b | 2665 | /* FALLTHRU */ |
ec10e4ad | 2666 | case MULT_EXPR: |
2667 | case TRUNC_DIV_EXPR: | |
2668 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2669 | break; | |
8999978b | 2670 | return; |
ec10e4ad | 2671 | |
2672 | case EQ_EXPR: | |
2673 | case NE_EXPR: | |
034b484a | 2674 | if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2)) |
05765a91 | 2675 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))) |
ec10e4ad | 2676 | break; |
05765a91 | 2677 | if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1])) |
ec10e4ad | 2678 | { |
2679 | type2 = type1; | |
2680 | break; | |
2681 | } | |
05765a91 | 2682 | if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0])) |
ec10e4ad | 2683 | { |
2684 | type1 = type2; | |
2685 | break; | |
2686 | } | |
331bc0ad | 2687 | /* Fall through. */ |
ec10e4ad | 2688 | case LT_EXPR: |
2689 | case GT_EXPR: | |
2690 | case LE_EXPR: | |
2691 | case GE_EXPR: | |
2692 | case MAX_EXPR: | |
2693 | case MIN_EXPR: | |
4825205a | 2694 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) |
653e5405 | 2695 | break; |
4825205a | 2696 | if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
ec10e4ad | 2697 | break; |
d3d4beab | 2698 | if (TREE_CODE (type1) == ENUMERAL_TYPE |
2699 | && TREE_CODE (type2) == ENUMERAL_TYPE) | |
653e5405 | 2700 | break; |
d3d4beab | 2701 | if (TYPE_PTR_P (type1) |
2a41b9a0 | 2702 | && null_ptr_cst_p (args[1])) |
ec10e4ad | 2703 | { |
2704 | type2 = type1; | |
2705 | break; | |
2706 | } | |
d3d4beab | 2707 | if (null_ptr_cst_p (args[0]) |
2a41b9a0 | 2708 | && TYPE_PTR_P (type2)) |
ec10e4ad | 2709 | { |
2710 | type1 = type2; | |
2711 | break; | |
2712 | } | |
8999978b | 2713 | return; |
ec10e4ad | 2714 | |
2715 | case PLUS_EXPR: | |
2716 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2717 | break; | |
e3533433 | 2718 | /* FALLTHRU */ |
ec10e4ad | 2719 | case ARRAY_REF: |
b3353c23 | 2720 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2)) |
ec10e4ad | 2721 | { |
2722 | type1 = ptrdiff_type_node; | |
2723 | break; | |
2724 | } | |
b3353c23 | 2725 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
ec10e4ad | 2726 | { |
2727 | type2 = ptrdiff_type_node; | |
2728 | break; | |
2729 | } | |
8999978b | 2730 | return; |
ec10e4ad | 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: | |
b3353c23 | 2749 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
ec10e4ad | 2750 | break; |
8999978b | 2751 | return; |
ec10e4ad | 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: | |
b3353c23 | 2794 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
ec10e4ad | 2795 | { |
2796 | type2 = ptrdiff_type_node; | |
2797 | break; | |
2798 | } | |
e3533433 | 2799 | /* FALLTHRU */ |
ec10e4ad | 2800 | case MULT_EXPR: |
2801 | case TRUNC_DIV_EXPR: | |
2802 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2803 | break; | |
8999978b | 2804 | return; |
ec10e4ad | 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: | |
b3353c23 | 2812 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
ec10e4ad | 2813 | break; |
8999978b | 2814 | return; |
ec10e4ad | 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)) | |
05765a91 | 2821 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
ec10e4ad | 2822 | || ((TYPE_PTRMEMFUNC_P (type1) |
c21c015b | 2823 | || TYPE_PTR_P (type1)) |
ec10e4ad | 2824 | && null_ptr_cst_p (args[1]))) |
2825 | { | |
2826 | type2 = type1; | |
2827 | break; | |
2828 | } | |
8999978b | 2829 | return; |
ec10e4ad | 2830 | |
2831 | default: | |
092b1d6f | 2832 | gcc_unreachable (); |
ec10e4ad | 2833 | } |
2834 | type1 = build_reference_type (type1); | |
2835 | break; | |
2836 | ||
2837 | case COND_EXPR: | |
70ba1b36 | 2838 | /* [over.built] |
8c18e707 | 2839 | |
2840 | For every pair of promoted arithmetic types L and R, there | |
9031d10b | 2841 | exist candidate operator functions of the form |
1adc02a5 | 2842 | |
9031d10b | 2843 | LR operator?(bool, L, R); |
8c18e707 | 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. */ | |
ec10e4ad | 2855 | break; |
8c18e707 | 2856 | |
2857 | /* Otherwise, the types should be pointers. */ | |
05765a91 | 2858 | if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2)) |
8999978b | 2859 | return; |
9031d10b | 2860 | |
8c18e707 | 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. */ | |
8999978b | 2865 | break; |
ec10e4ad | 2866 | |
7ba2c0db | 2867 | case REALPART_EXPR: |
2868 | case IMAGPART_EXPR: | |
2869 | if (ARITHMETIC_TYPE_P (type1)) | |
2870 | break; | |
2871 | return; | |
2872 | ||
ec10e4ad | 2873 | default: |
092b1d6f | 2874 | gcc_unreachable (); |
ec10e4ad | 2875 | } |
2876 | ||
2a41b9a0 | 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 | ||
4825205a | 2899 | /* If we're dealing with two pointer types or two enumeral types, |
2900 | we need candidates for both of them. */ | |
8c18e707 | 2901 | if (type2 && !same_type_p (type1, type2) |
ec10e4ad | 2902 | && TREE_CODE (type1) == TREE_CODE (type2) |
90ad495b | 2903 | && (TYPE_REF_P (type1) |
1bc16cab | 2904 | || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
05765a91 | 2905 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
ec10e4ad | 2906 | || TYPE_PTRMEMFUNC_P (type1) |
95397ff9 | 2907 | || MAYBE_CLASS_TYPE_P (type1) |
4825205a | 2908 | || TREE_CODE (type1) == ENUMERAL_TYPE)) |
ec10e4ad | 2909 | { |
05765a91 | 2910 | if (TYPE_PTR_OR_PTRMEM_P (type1)) |
71c20982 | 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 | |
66bbeb85 | 2920 | (candidates, fnname, cptype, cptype, args, argtypes, |
2921 | flags, complain); | |
71c20982 | 2922 | return; |
2923 | } | |
2924 | } | |
2925 | ||
8999978b | 2926 | build_builtin_candidate |
66bbeb85 | 2927 | (candidates, fnname, type1, type1, args, argtypes, flags, complain); |
8999978b | 2928 | build_builtin_candidate |
66bbeb85 | 2929 | (candidates, fnname, type2, type2, args, argtypes, flags, complain); |
8999978b | 2930 | return; |
ec10e4ad | 2931 | } |
2932 | ||
8999978b | 2933 | build_builtin_candidate |
66bbeb85 | 2934 | (candidates, fnname, type1, type2, args, argtypes, flags, complain); |
ec10e4ad | 2935 | } |
2936 | ||
2937 | tree | |
eda6e89c | 2938 | type_decays_to (tree type) |
ec10e4ad | 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. | |
657c76e1 | 2952 | 3) arithmetic candidates. According to the standard, we should generate |
4825205a | 2953 | all of these, but I'm trying not to... |
9031d10b | 2954 | |
4825205a | 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 | |
6c0cc2cd | 2958 | filter out the invalid set. */ |
ec10e4ad | 2959 | |
8999978b | 2960 | static void |
2961 | add_builtin_candidates (struct z_candidate **candidates, enum tree_code code, | |
653e5405 | 2962 | enum tree_code code2, tree fnname, tree *args, |
66bbeb85 | 2963 | int flags, tsubst_flags_t complain) |
ec10e4ad | 2964 | { |
2965 | int ref1, i; | |
4825205a | 2966 | int enum_p = 0; |
2bdcc82e | 2967 | tree type, argtypes[3], t; |
8c18e707 | 2968 | /* TYPES[i] is the set of possible builtin-operator parameter types |
2bdcc82e | 2969 | we will consider for the Ith argument. */ |
f1f41a6c | 2970 | vec<tree, va_gc> *types[2]; |
2bdcc82e | 2971 | unsigned ix; |
ec10e4ad | 2972 | |
2973 | for (i = 0; i < 3; ++i) | |
2974 | { | |
2975 | if (args[i]) | |
4281aa50 | 2976 | argtypes[i] = unlowered_expr_type (args[i]); |
ec10e4ad | 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: | |
8999978b | 3002 | build_builtin_candidate |
ec10e4ad | 3003 | (candidates, fnname, boolean_type_node, |
66bbeb85 | 3004 | NULL_TREE, args, argtypes, flags, complain); |
8999978b | 3005 | return; |
ec10e4ad | 3006 | |
3007 | case TRUTH_ORIF_EXPR: | |
3008 | case TRUTH_ANDIF_EXPR: | |
8999978b | 3009 | build_builtin_candidate |
ec10e4ad | 3010 | (candidates, fnname, boolean_type_node, |
66bbeb85 | 3011 | boolean_type_node, args, argtypes, flags, complain); |
8999978b | 3012 | return; |
ec10e4ad | 3013 | |
3014 | case ADDR_EXPR: | |
3015 | case COMPOUND_EXPR: | |
3016 | case COMPONENT_REF: | |
8999978b | 3017 | return; |
ec10e4ad | 3018 | |
4825205a | 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; | |
331bc0ad | 3027 | /* Fall through. */ |
9031d10b | 3028 | |
ec10e4ad | 3029 | default: |
3030 | ref1 = 0; | |
3031 | } | |
3032 | ||
2bdcc82e | 3033 | types[0] = make_tree_vector (); |
3034 | types[1] = make_tree_vector (); | |
ec10e4ad | 3035 | |
3036 | for (i = 0; i < 2; ++i) | |
3037 | { | |
3038 | if (! args[i]) | |
3039 | ; | |
95397ff9 | 3040 | else if (MAYBE_CLASS_TYPE_P (argtypes[i])) |
ec10e4ad | 3041 | { |
92085b1b | 3042 | tree convs; |
ec10e4ad | 3043 | |
bdd152ce | 3044 | if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR) |
8999978b | 3045 | return; |
bdd152ce | 3046 | |
9960d752 | 3047 | convs = lookup_conversions (argtypes[i]); |
bdd152ce | 3048 | |
ec10e4ad | 3049 | if (code == COND_EXPR) |
3050 | { | |
18bede74 | 3051 | if (lvalue_p (args[i])) |
f1f41a6c | 3052 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
ec10e4ad | 3053 | |
f1f41a6c | 3054 | vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i])); |
ec10e4ad | 3055 | } |
bdd152ce | 3056 | |
3057 | else if (! convs) | |
8999978b | 3058 | return; |
ec10e4ad | 3059 | |
3060 | for (; convs; convs = TREE_CHAIN (convs)) | |
3061 | { | |
cf7aa2e5 | 3062 | type = TREE_TYPE (convs); |
ec10e4ad | 3063 | |
3064 | if (i == 0 && ref1 | |
90ad495b | 3065 | && (!TYPE_REF_P (type) |
3e04bd45 | 3066 | || CP_TYPE_CONST_P (TREE_TYPE (type)))) |
ec10e4ad | 3067 | continue; |
3068 | ||
90ad495b | 3069 | if (code == COND_EXPR && TYPE_REF_P (type)) |
f1f41a6c | 3070 | vec_safe_push (types[i], type); |
ec10e4ad | 3071 | |
3072 | type = non_reference (type); | |
3073 | if (i != 0 || ! ref1) | |
3074 | { | |
5c7fe8f5 | 3075 | type = cv_unqualified (type_decays_to (type)); |
653e5405 | 3076 | if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE) |
f1f41a6c | 3077 | vec_safe_push (types[i], type); |
b3353c23 | 3078 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
ec10e4ad | 3079 | type = type_promotes_to (type); |
3080 | } | |
3081 | ||
2bdcc82e | 3082 | if (! vec_member (type, types[i])) |
f1f41a6c | 3083 | vec_safe_push (types[i], type); |
ec10e4ad | 3084 | } |
3085 | } | |
3086 | else | |
3087 | { | |
18bede74 | 3088 | if (code == COND_EXPR && lvalue_p (args[i])) |
f1f41a6c | 3089 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
ec10e4ad | 3090 | type = non_reference (argtypes[i]); |
3091 | if (i != 0 || ! ref1) | |
3092 | { | |
5c7fe8f5 | 3093 | type = cv_unqualified (type_decays_to (type)); |
b3353c23 | 3094 | if (enum_p && UNSCOPED_ENUM_P (type)) |
f1f41a6c | 3095 | vec_safe_push (types[i], type); |
b3353c23 | 3096 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
ec10e4ad | 3097 | type = type_promotes_to (type); |
3098 | } | |
f1f41a6c | 3099 | vec_safe_push (types[i], type); |
ec10e4ad | 3100 | } |
3101 | } | |
3102 | ||
8c18e707 | 3103 | /* Run through the possible parameter types of both arguments, |
3104 | creating candidates with those parameter types. */ | |
f1f41a6c | 3105 | FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t) |
ec10e4ad | 3106 | { |
2bdcc82e | 3107 | unsigned jx; |
3108 | tree u; | |
3109 | ||
f1f41a6c | 3110 | if (!types[1]->is_empty ()) |
3111 | FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u) | |
8999978b | 3112 | add_builtin_candidate |
2bdcc82e | 3113 | (candidates, code, code2, fnname, t, |
66bbeb85 | 3114 | u, args, argtypes, flags, complain); |
ec10e4ad | 3115 | else |
8999978b | 3116 | add_builtin_candidate |
2bdcc82e | 3117 | (candidates, code, code2, fnname, t, |
66bbeb85 | 3118 | NULL_TREE, args, argtypes, flags, complain); |
ec10e4ad | 3119 | } |
2bdcc82e | 3120 | |
3121 | release_tree_vector (types[0]); | |
3122 | release_tree_vector (types[1]); | |
ec10e4ad | 3123 | } |
3124 | ||
1146f179 | 3125 | |
b1cfe2be | 3126 | /* If TMPL can be successfully instantiated as indicated by |
3127 | EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES. | |
3128 | ||
1146f179 | 3129 | TMPL is the template. EXPLICIT_TARGS are any explicit template |
3130 | arguments. ARGLIST is the arguments provided at the call-site. | |
f352a3fb | 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. */ | |
1146f179 | 3135 | |
3136 | static struct z_candidate* | |
8999978b | 3137 | add_template_candidate_real (struct z_candidate **candidates, tree tmpl, |
f352a3fb | 3138 | tree ctype, tree explicit_targs, tree first_arg, |
f1f41a6c | 3139 | const vec<tree, va_gc> *arglist, tree return_type, |
f352a3fb | 3140 | tree access_path, tree conversion_path, |
66bbeb85 | 3141 | int flags, tree obj, unification_kind_t strict, |
3142 | tsubst_flags_t complain) | |
ec10e4ad | 3143 | { |
64b4f183 | 3144 | int ntparms = DECL_NTPARMS (tmpl); |
19c3b3a6 | 3145 | tree targs = make_tree_vec (ntparms); |
f1f41a6c | 3146 | unsigned int len = vec_safe_length (arglist); |
25251d96 | 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; | |
f352a3fb | 3150 | tree *args_without_in_chrg; |
3151 | unsigned int nargs_without_in_chrg; | |
3152 | unsigned int ia, ix; | |
3153 | tree arg; | |
ec10e4ad | 3154 | struct z_candidate *cand; |
ec10e4ad | 3155 | tree fn; |
b596aa1a | 3156 | struct rejection_reason *reason = NULL; |
d5afa928 | 3157 | int errs; |
070c395b | 3158 | conversion **convs = NULL; |
ec10e4ad | 3159 | |
2db0e9b3 | 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)) | |
f352a3fb | 3163 | { |
3164 | if (first_arg_without_in_chrg != NULL_TREE) | |
3165 | first_arg_without_in_chrg = NULL_TREE; | |
dac59ee4 | 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. */; | |
f352a3fb | 3169 | else |
3170 | ++skip_without_in_chrg; | |
3171 | } | |
2db0e9b3 | 3172 | |
009e0522 | 3173 | if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl) |
3174 | || DECL_BASE_CONSTRUCTOR_P (tmpl)) | |
1f0b839e | 3175 | && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl))) |
f352a3fb | 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 | ||
25251d96 | 3183 | if (len < skip_without_in_chrg) |
3184 | return NULL; | |
3185 | ||
f21eb000 | 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 | ||
f352a3fb | 3214 | nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0) |
25251d96 | 3215 | + (len - skip_without_in_chrg)); |
f352a3fb | 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; | |
f1f41a6c | 3224 | vec_safe_iterate (arglist, ix, &arg); |
f352a3fb | 3225 | ++ix) |
3226 | { | |
3227 | args_without_in_chrg[ia] = arg; | |
3228 | ++ia; | |
3229 | } | |
3230 | gcc_assert (ia == nargs_without_in_chrg); | |
009e0522 | 3231 | |
d5afa928 | 3232 | errs = errorcount+sorrycount; |
070c395b | 3233 | if (!obj) |
3234 | convs = alloc_conversions (nargs); | |
c85d5a00 | 3235 | fn = fn_type_unification (tmpl, explicit_targs, targs, |
3236 | args_without_in_chrg, | |
3237 | nargs_without_in_chrg, | |
070c395b | 3238 | return_type, strict, flags, convs, |
3239 | false, complain & tf_decltype); | |
64b4f183 | 3240 | |
c85d5a00 | 3241 | if (fn == error_mark_node) |
d5afa928 | 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 | } | |
ec10e4ad | 3253 | |
529d9008 | 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 | ||
f352a3fb | 3260 | if (DECL_CONSTRUCTOR_P (fn) && nargs == 2) |
18fc45f0 | 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)) | |
d5afa928 | 3265 | { |
f21eb000 | 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>). */ | |
d5afa928 | 3269 | reason = invalid_copy_with_fn_template_rejection (); |
3270 | goto fail; | |
3271 | } | |
18fc45f0 | 3272 | } |
3273 | ||
1146f179 | 3274 | if (obj != NULL_TREE) |
3275 | /* Aha, this is a conversion function. */ | |
71910a11 | 3276 | cand = add_conv_candidate (candidates, fn, obj, arglist, |
66bbeb85 | 3277 | access_path, conversion_path, complain); |
1146f179 | 3278 | else |
c161288a | 3279 | cand = add_function_candidate (candidates, fn, ctype, |
f352a3fb | 3280 | first_arg, arglist, access_path, |
070c395b | 3281 | conversion_path, flags, convs, complain); |
1146f179 | 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. */ | |
b08c3803 | 3300 | cand->template_decl = build_template_info (tmpl, targs); |
1146f179 | 3301 | else |
12e22044 | 3302 | cand->template_decl = DECL_TEMPLATE_INFO (fn); |
3fbd1228 | 3303 | cand->explicit_targs = explicit_targs; |
1146f179 | 3304 | |
ec10e4ad | 3305 | return cand; |
db0e6c68 | 3306 | fail: |
3307 | return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL, | |
91d81115 | 3308 | access_path, conversion_path, 0, reason, flags); |
ec10e4ad | 3309 | } |
3310 | ||
f5308315 | 3311 | |
3312 | static struct z_candidate * | |
8999978b | 3313 | add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype, |
f352a3fb | 3314 | tree explicit_targs, tree first_arg, |
f1f41a6c | 3315 | const vec<tree, va_gc> *arglist, tree return_type, |
653e5405 | 3316 | tree access_path, tree conversion_path, int flags, |
66bbeb85 | 3317 | unification_kind_t strict, tsubst_flags_t complain) |
f5308315 | 3318 | { |
9031d10b | 3319 | return |
c161288a | 3320 | add_template_candidate_real (candidates, tmpl, ctype, |
f352a3fb | 3321 | explicit_targs, first_arg, arglist, |
3322 | return_type, access_path, conversion_path, | |
66bbeb85 | 3323 | flags, NULL_TREE, strict, complain); |
1146f179 | 3324 | } |
f5308315 | 3325 | |
dac59ee4 | 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. */ | |
f5308315 | 3331 | |
1146f179 | 3332 | static struct z_candidate * |
8999978b | 3333 | add_template_conv_candidate (struct z_candidate **candidates, tree tmpl, |
71910a11 | 3334 | tree obj, |
f1f41a6c | 3335 | const vec<tree, va_gc> *arglist, |
f352a3fb | 3336 | tree return_type, tree access_path, |
66bbeb85 | 3337 | tree conversion_path, tsubst_flags_t complain) |
1146f179 | 3338 | { |
2d50c841 | 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 | |
65b0e480 | 3341 | operators. */ |
2d50c841 | 3342 | if (*candidates) |
65b0e480 | 3343 | return NULL; |
3344 | ||
9031d10b | 3345 | return |
c161288a | 3346 | add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE, |
71910a11 | 3347 | NULL_TREE, arglist, return_type, access_path, |
dac59ee4 | 3348 | conversion_path, 0, obj, DEDUCE_CALL, |
66bbeb85 | 3349 | complain); |
f5308315 | 3350 | } |
3351 | ||
f4da5882 | 3352 | /* The CANDS are the set of candidates that were considered for |
db0e6c68 | 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. */ | |
f5308315 | 3357 | |
f4da5882 | 3358 | static struct z_candidate* |
3359 | splice_viable (struct z_candidate *cands, | |
3360 | bool strict_p, | |
3361 | bool *any_viable_p) | |
ec10e4ad | 3362 | { |
f4da5882 | 3363 | struct z_candidate *viable; |
3364 | struct z_candidate **last_viable; | |
3365 | struct z_candidate **cand; | |
aa8d51e4 | 3366 | bool found_strictly_viable = false; |
f4da5882 | 3367 | |
02617140 | 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 | ||
f4da5882 | 3373 | viable = NULL; |
3374 | last_viable = &viable; | |
3375 | *any_viable_p = false; | |
3376 | ||
9031d10b | 3377 | cand = &cands; |
3378 | while (*cand) | |
f4da5882 | 3379 | { |
3380 | struct z_candidate *c = *cand; | |
aa8d51e4 | 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 | ||
f4da5882 | 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; | |
aa8d51e4 | 3407 | if (c->viable == 1) |
3408 | found_strictly_viable = true; | |
f4da5882 | 3409 | } |
3410 | else | |
3411 | cand = &c->next; | |
3412 | } | |
3413 | ||
3414 | return viable ? viable : cands; | |
ec10e4ad | 3415 | } |
3416 | ||
eda6e89c | 3417 | static bool |
3418 | any_strictly_viable (struct z_candidate *cands) | |
f3c9db61 | 3419 | { |
3420 | for (; cands; cands = cands->next) | |
3421 | if (cands->viable == 1) | |
eda6e89c | 3422 | return true; |
3423 | return false; | |
f3c9db61 | 3424 | } |
3425 | ||
1fe46df1 | 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 | ||
02d7f858 | 3430 | static tree |
eda6e89c | 3431 | build_this (tree obj) |
ec10e4ad | 3432 | { |
1fe46df1 | 3433 | /* In a template, we are only concerned about the type of the |
3434 | expression, so we can take a shortcut. */ | |
297de7bc | 3435 | if (processing_template_decl) |
1fe46df1 | 3436 | return build_address (obj); |
3437 | ||
d6fbd579 | 3438 | return cp_build_addr_expr (obj, tf_warning_or_error); |
ec10e4ad | 3439 | } |
3440 | ||
f4da5882 | 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 | { | |
db0e6c68 | 3448 | if (TREE_CODE (fn1) != TREE_CODE (fn2)) |
3449 | return 0; | |
3450 | if (TREE_CODE (fn1) == TEMPLATE_DECL) | |
3451 | return fn1 == fn2; | |
f4da5882 | 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 | ||
d0bfd6be | 3458 | /* Print information about a candidate FN being rejected due to INFO. */ |
b596aa1a | 3459 | |
3460 | static void | |
d0bfd6be | 3461 | print_conversion_rejection (location_t loc, struct conversion_info *info, |
3462 | tree fn) | |
b596aa1a | 3463 | { |
aa8d51e4 | 3464 | tree from = info->from; |
3465 | if (!TYPE_P (from)) | |
3466 | from = lvalue_type (from); | |
b596aa1a | 3467 | if (info->n_arg == -1) |
aa8d51e4 | 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. */ | |
9e66c6e7 | 3472 | inform (loc, " passing %qT as %<this%> " |
aa8d51e4 | 3473 | "argument discards qualifiers", |
3474 | from); | |
3475 | else | |
3476 | inform (loc, " no known conversion for implicit " | |
4d1eda3a | 3477 | "%<this%> parameter from %qH to %qI", |
aa8d51e4 | 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:", | |
9e66c6e7 | 3484 | info->n_arg + 1); |
aa8d51e4 | 3485 | perform_implicit_conversion (info->to_type, info->from, |
3486 | tf_warning_or_error); | |
3487 | } | |
5ae35a01 | 3488 | else if (info->n_arg == -2) |
3489 | /* Conversion of conversion function return value failed. */ | |
4d1eda3a | 3490 | inform (loc, " no known conversion from %qH to %qI", |
aa8d51e4 | 3491 | from, info->to_type); |
b596aa1a | 3492 | else |
d0bfd6be | 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 | } | |
b596aa1a | 3499 | } |
3500 | ||
d5afa928 | 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 | ||
44ab85e8 | 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. */ | |
f341b42a | 3519 | |
3520 | static void | |
1e6d0c16 | 3521 | print_z_candidate (location_t loc, const char *msgstr, |
3522 | struct z_candidate *candidate) | |
f341b42a | 3523 | { |
b596aa1a | 3524 | const char *msg = (msgstr == NULL |
3525 | ? "" | |
3526 | : ACONCAT ((msgstr, " ", NULL))); | |
7896267d | 3527 | tree fn = candidate->fn; |
3528 | if (flag_new_inheriting_ctors) | |
3529 | fn = strip_inheriting_ctors (fn); | |
3530 | location_t cloc = location_of (fn); | |
b596aa1a | 3531 | |
7896267d | 3532 | if (identifier_p (fn)) |
f341b42a | 3533 | { |
1e6d0c16 | 3534 | cloc = loc; |
1611df57 | 3535 | if (candidate->num_convs == 3) |
903ed196 | 3536 | inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn, |
1611df57 | 3537 | candidate->convs[0]->type, |
3538 | candidate->convs[1]->type, | |
3539 | candidate->convs[2]->type); | |
3540 | else if (candidate->num_convs == 2) | |
903ed196 | 3541 | inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn, |
1611df57 | 3542 | candidate->convs[0]->type, |
3543 | candidate->convs[1]->type); | |
f341b42a | 3544 | else |
903ed196 | 3545 | inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn, |
1611df57 | 3546 | candidate->convs[0]->type); |
f341b42a | 3547 | } |
7896267d | 3548 | else if (TYPE_P (fn)) |
8c41abe8 | 3549 | inform (cloc, "%s%qT <conversion>", msg, fn); |
44ab85e8 | 3550 | else if (candidate->viable == -1) |
8c41abe8 | 3551 | inform (cloc, "%s%#qD <near match>", msg, fn); |
7896267d | 3552 | else if (DECL_DELETED_FN (fn)) |
8c41abe8 | 3553 | inform (cloc, "%s%#qD <deleted>", msg, fn); |
f341b42a | 3554 | else |
8c41abe8 | 3555 | inform (cloc, "%s%#qD", msg, fn); |
7896267d | 3556 | if (fn != candidate->fn) |
3557 | { | |
3558 | cloc = location_of (candidate->fn); | |
3559 | inform (cloc, " inherited here"); | |
3560 | } | |
b596aa1a | 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: | |
1e6d0c16 | 3569 | print_arity_information (cloc, r->u.arity.actual, |
d5afa928 | 3570 | r->u.arity.expected); |
b596aa1a | 3571 | break; |
3572 | case rr_arg_conversion: | |
d0bfd6be | 3573 | print_conversion_rejection (cloc, &r->u.conversion, fn); |
b596aa1a | 3574 | break; |
3575 | case rr_bad_arg_conversion: | |
d0bfd6be | 3576 | print_conversion_rejection (cloc, &r->u.bad_conversion, fn); |
b596aa1a | 3577 | break; |
139a4129 | 3578 | case rr_explicit_conversion: |
1e6d0c16 | 3579 | inform (cloc, " return type %qT of explicit conversion function " |
139a4129 | 3580 | "cannot be converted to %qT with a qualification " |
aa8d51e4 | 3581 | "conversion", r->u.conversion.from, |
139a4129 | 3582 | r->u.conversion.to_type); |
3583 | break; | |
b4c50d78 | 3584 | case rr_template_conversion: |
1e6d0c16 | 3585 | inform (cloc, " conversion from return type %qT of template " |
b4c50d78 | 3586 | "conversion function specialization to %qT is not an " |
aa8d51e4 | 3587 | "exact match", r->u.conversion.from, |
b4c50d78 | 3588 | r->u.conversion.to_type); |
3589 | break; | |
d5afa928 | 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 | { | |
1e6d0c16 | 3596 | inform (cloc, " substitution of deduced template arguments " |
d5afa928 | 3597 | "resulted in errors seen above"); |
3598 | break; | |
3599 | } | |
3600 | /* Re-run template unification with diagnostics. */ | |
1e6d0c16 | 3601 | inform (cloc, " template argument deduction/substitution failed:"); |
d5afa928 | 3602 | fn_type_unification (r->u.template_unification.tmpl, |
3603 | r->u.template_unification.explicit_targs, | |
c85d5a00 | 3604 | (make_tree_vec |
3605 | (r->u.template_unification.num_targs)), | |
d5afa928 | 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, | |
070c395b | 3611 | NULL, true, false); |
d5afa928 | 3612 | break; |
d5afa928 | 3613 | case rr_invalid_copy: |
1e6d0c16 | 3614 | inform (cloc, |
d5afa928 | 3615 | " a constructor taking a single argument of its own " |
3616 | "class type is invalid"); | |
3617 | break; | |
56c12fd4 | 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; | |
7896267d | 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; | |
b596aa1a | 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 | } | |
f341b42a | 3637 | } |
3638 | ||
ec10e4ad | 3639 | static void |
b596aa1a | 3640 | print_z_candidates (location_t loc, struct z_candidate *candidates) |
ec10e4ad | 3641 | { |
f4da5882 | 3642 | struct z_candidate *cand1; |
3643 | struct z_candidate **cand2; | |
3644 | ||
8c9b62e8 | 3645 | if (!candidates) |
3646 | return; | |
3647 | ||
eae457e0 | 3648 | /* Remove non-viable deleted candidates. */ |
8c9b62e8 | 3649 | cand1 = candidates; |
3650 | for (cand2 = &cand1; *cand2; ) | |
3651 | { | |
3652 | if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL | |
eae457e0 | 3653 | && !(*cand2)->viable |
8c9b62e8 | 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 | ||
f4da5882 | 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. */ | |
db0e6c68 | 3672 | if (!DECL_P (fn)) |
f4da5882 | 3673 | continue; |
3674 | cand2 = &cand1->next; | |
3675 | while (*cand2) | |
3676 | { | |
db0e6c68 | 3677 | if (DECL_P ((*cand2)->fn) |
f4da5882 | 3678 | && equal_functions (fn, (*cand2)->fn)) |
3679 | *cand2 = (*cand2)->next; | |
3680 | else | |
3681 | cand2 = &(*cand2)->next; | |
3682 | } | |
3683 | } | |
3684 | ||
7dde752d | 3685 | for (; candidates; candidates = candidates->next) |
aa8d51e4 | 3686 | print_z_candidate (loc, "candidate:", candidates); |
ec10e4ad | 3687 | } |
3688 | ||
00ba6bd5 | 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 | |
dfea972c | 3692 | desired type. Merge the two sequences into a single sequence, |
00ba6bd5 | 3693 | and return the merged sequence. */ |
3694 | ||
1611df57 | 3695 | static conversion * |
3696 | merge_conversion_sequences (conversion *user_seq, conversion *std_seq) | |
00ba6bd5 | 3697 | { |
1611df57 | 3698 | conversion **t; |
d6b20eb5 | 3699 | bool bad = user_seq->bad_p; |
00ba6bd5 | 3700 | |
b4df430b | 3701 | gcc_assert (user_seq->kind == ck_user); |
00ba6bd5 | 3702 | |
3703 | /* Find the end of the second conversion sequence. */ | |
d6b20eb5 | 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 | } | |
00ba6bd5 | 3711 | |
40c5a92b | 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 | ||
00ba6bd5 | 3718 | /* Replace the identity conversion with the user conversion |
3719 | sequence. */ | |
3720 | *t = user_seq; | |
3721 | ||
00ba6bd5 | 3722 | return std_seq; |
3723 | } | |
3724 | ||
dbfcf378 | 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 | |
f1f41a6c | 3731 | the form of a CONSTRUCTOR (the initializer list) rather than a vector, and |
dbfcf378 | 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, | |
fc0d5c8c | 3736 | const vec<tree, va_gc> *args, tree totype, |
dbfcf378 | 3737 | tree explicit_targs, bool template_only, |
3738 | tree conversion_path, tree access_path, | |
3739 | int flags, | |
66bbeb85 | 3740 | struct z_candidate **candidates, |
3741 | tsubst_flags_t complain) | |
dbfcf378 | 3742 | { |
dbfcf378 | 3743 | gcc_assert (*candidates == NULL); |
3744 | ||
a47f6321 | 3745 | /* We're looking for a ctor for list-initialization. */ |
3746 | flags |= LOOKUP_LIST_INIT_CTOR; | |
dbfcf378 | 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 | ||
d14ef710 | 3751 | unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1; |
fc0d5c8c | 3752 | tree init_list = (*args)[nart]; |
3753 | ||
dbfcf378 | 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; | |
dbfcf378 | 3763 | add_candidates (fns, first_arg, args, NULL_TREE, |
3764 | explicit_targs, template_only, conversion_path, | |
66bbeb85 | 3765 | access_path, flags, candidates, complain); |
dbfcf378 | 3766 | if (any_strictly_viable (*candidates)) |
3767 | return; | |
3768 | } | |
3769 | ||
fc0d5c8c | 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); | |
dbfcf378 | 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; | |
dbfcf378 | 3782 | |
fc0d5c8c | 3783 | add_candidates (fns, first_arg, new_args, NULL_TREE, |
dbfcf378 | 3784 | explicit_targs, template_only, conversion_path, |
66bbeb85 | 3785 | access_path, flags, candidates, complain); |
dbfcf378 | 3786 | } |
3787 | ||
ec10e4ad | 3788 | /* Returns the best overload candidate to perform the requested |
c76251c1 | 3789 | conversion. This function is used for three the overloading situations |
3790 | described in [over.match.copy], [over.match.conv], and [over.match.ref]. | |
98d1b25f | 3791 | If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as |
c76251c1 | 3792 | per [dcl.init.ref], so we ignore temporary bindings. */ |
ec10e4ad | 3793 | |
3794 | static struct z_candidate * | |
66bbeb85 | 3795 | build_user_type_conversion_1 (tree totype, tree expr, int flags, |
3796 | tsubst_flags_t complain) | |
ec10e4ad | 3797 | { |
3798 | struct z_candidate *candidates, *cand; | |
f5c1c27a | 3799 | tree fromtype; |
1611df57 | 3800 | tree ctors = NULL_TREE; |
3801 | tree conv_fns = NULL_TREE; | |
3802 | conversion *conv = NULL; | |
f352a3fb | 3803 | tree first_arg = NULL_TREE; |
f1f41a6c | 3804 | vec<tree, va_gc> *args = NULL; |
f4da5882 | 3805 | bool any_viable_p; |
57dc7a82 | 3806 | int convflags; |
ec10e4ad | 3807 | |
f5c1c27a | 3808 | if (!expr) |
3809 | return NULL; | |
3810 | ||
3811 | fromtype = TREE_TYPE (expr); | |
3812 | ||
3eb89cd8 | 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]. */ | |
95397ff9 | 3816 | gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype) |
b4df430b | 3817 | || !DERIVED_FROM_P (totype, fromtype)); |
3eb89cd8 | 3818 | |
10f48b3d | 3819 | if (CLASS_TYPE_P (totype)) |
f9c9f8e4 | 3820 | /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid |
3821 | creating a garbage BASELINK; constructors can't be inherited. */ | |
e12c5305 | 3822 | ctors = get_class_binding (totype, complete_ctor_identifier); |
e55cba4c | 3823 | |
95397ff9 | 3824 | if (MAYBE_CLASS_TYPE_P (fromtype)) |
649873d2 | 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 | |
9960d752 | 3838 | conv_fns = lookup_conversions (fromtype); |
649873d2 | 3839 | } |
ec10e4ad | 3840 | |
3841 | candidates = 0; | |
3842 | flags |= LOOKUP_NO_CONVERSION; | |
8bd47a90 | 3843 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
3844 | flags |= LOOKUP_NO_NARROWING; | |
ec10e4ad | 3845 | |
57dc7a82 | 3846 | /* It's OK to bind a temporary for converting constructor arguments, but |
3847 | not in converting the return value of a conversion operator. */ | |
c4991e3e | 3848 | convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION |
3849 | | (flags & LOOKUP_NO_NARROWING)); | |
57dc7a82 | 3850 | flags &= ~LOOKUP_NO_TEMP_BIND; |
3851 | ||
ec10e4ad | 3852 | if (ctors) |
3853 | { | |
8bd47a90 | 3854 | int ctorflags = flags; |
a23287c6 | 3855 | |
6da7682f | 3856 | first_arg = build_dummy_object (totype); |
f352a3fb | 3857 | |
8bc57e28 | 3858 | /* We should never try to call the abstract or base constructor |
3859 | from here. */ | |
05b229bf | 3860 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors)) |
3861 | && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors))); | |
ec10e4ad | 3862 | |
fc0d5c8c | 3863 | args = make_tree_vector_single (expr); |
dbfcf378 | 3864 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
0d836813 | 3865 | { |
dbfcf378 | 3866 | /* List-initialization. */ |
fc0d5c8c | 3867 | add_list_candidates (ctors, first_arg, args, totype, NULL_TREE, |
dbfcf378 | 3868 | false, TYPE_BINFO (totype), TYPE_BINFO (totype), |
66bbeb85 | 3869 | ctorflags, &candidates, complain); |
0d836813 | 3870 | } |
dbfcf378 | 3871 | else |
0d836813 | 3872 | { |
0d836813 | 3873 | add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false, |
3874 | TYPE_BINFO (totype), TYPE_BINFO (totype), | |
66bbeb85 | 3875 | ctorflags, &candidates, complain); |
0d836813 | 3876 | } |
64b4f183 | 3877 | |
8bd47a90 | 3878 | for (cand = candidates; cand; cand = cand->next) |
fd25a1d0 | 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. */ | |
90ad495b | 3890 | if (!TYPE_REF_P (totype) |
fd25a1d0 | 3891 | && !(convflags & LOOKUP_NO_TEMP_BIND)) |
3892 | cand->second_conv | |
3893 | = build_conv (ck_rvalue, totype, cand->second_conv); | |
3894 | } | |
ec10e4ad | 3895 | } |
3896 | ||
1611df57 | 3897 | if (conv_fns) |
c821ae1a | 3898 | { |
3899 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) | |
c821ae1a | 3900 | first_arg = CONSTRUCTOR_ELT (expr, 0)->value; |
3901 | else | |
3902 | first_arg = expr; | |
3903 | } | |
ec10e4ad | 3904 | |
1611df57 | 3905 | for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns)) |
ec10e4ad | 3906 | { |
1611df57 | 3907 | tree conversion_path = TREE_PURPOSE (conv_fns); |
8bd47a90 | 3908 | struct z_candidate *old_candidates; |
c76251c1 | 3909 | |
3910 | /* If we are called to convert to a reference type, we are trying to | |
46af4cac | 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 | |
c76251c1 | 3913 | look for a temporary binding. */ |
90ad495b | 3914 | if (TYPE_REF_P (totype)) |
c76251c1 | 3915 | convflags |= LOOKUP_NO_TEMP_BIND; |
9031d10b | 3916 | |
8bd47a90 | 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), | |
66bbeb85 | 3921 | flags, &candidates, complain); |
8bd47a90 | 3922 | |
3923 | for (cand = candidates; cand != old_candidates; cand = cand->next) | |
c0af458b | 3924 | { |
139a4129 | 3925 | tree rettype = TREE_TYPE (TREE_TYPE (cand->fn)); |
8bd47a90 | 3926 | conversion *ics |
3927 | = implicit_conversion (totype, | |
139a4129 | 3928 | rettype, |
8bd47a90 | 3929 | 0, |
66bbeb85 | 3930 | /*c_cast_p=*/false, convflags, |
3931 | complain); | |
c0af458b | 3932 | |
8bd47a90 | 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) | |
b596aa1a | 3950 | { |
b596aa1a | 3951 | cand->viable = 0; |
5ae35a01 | 3952 | cand->reason = arg_conversion_rejection (NULL_TREE, -2, |
b78e49d1 | 3953 | rettype, totype, |
3954 | EXPR_LOCATION (expr)); | |
b596aa1a | 3955 | } |
139a4129 | 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. */ | |
98d1b25f | 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 */ | |
139a4129 | 3966 | cand->viable = -1; |
3967 | cand->reason = explicit_conversion_rejection (rettype, totype); | |
3968 | } | |
8bd47a90 | 3969 | else if (cand->viable == 1 && ics->bad_p) |
b596aa1a | 3970 | { |
b596aa1a | 3971 | cand->viable = -1; |
3972 | cand->reason | |
5ae35a01 | 3973 | = bad_arg_conversion_rejection (NULL_TREE, -2, |
b78e49d1 | 3974 | rettype, totype, |
3975 | EXPR_LOCATION (expr)); | |
b596aa1a | 3976 | } |
681f91a5 | 3977 | else if (primary_template_specialization_p (cand->fn) |
b4c50d78 | 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 | } | |
c0af458b | 3987 | } |
ec10e4ad | 3988 | } |
3989 | ||
aa8d51e4 | 3990 | candidates = splice_viable (candidates, false, &any_viable_p); |
f4da5882 | 3991 | if (!any_viable_p) |
f9c9f8e4 | 3992 | { |
3993 | if (args) | |
3994 | release_tree_vector (args); | |
3995 | return NULL; | |
3996 | } | |
ec10e4ad | 3997 | |
66bbeb85 | 3998 | cand = tourney (candidates, complain); |
0d9d3654 | 3999 | if (cand == NULL) |
ec10e4ad | 4000 | { |
c4698a21 | 4001 | if (complain & tf_error) |
ec10e4ad | 4002 | { |
bc35ef65 | 4003 | auto_diagnostic_group d; |
4d1eda3a | 4004 | error ("conversion from %qH to %qI is ambiguous", |
66bbeb85 | 4005 | fromtype, totype); |
b596aa1a | 4006 | print_z_candidates (location_of (expr), candidates); |
ec10e4ad | 4007 | } |
4008 | ||
4009 | cand = candidates; /* any one will do */ | |
1611df57 | 4010 | cand->second_conv = build_ambiguous_conv (totype, expr); |
4011 | cand->second_conv->user_conv_p = true; | |
db0ec145 | 4012 | if (!any_strictly_viable (candidates)) |
1611df57 | 4013 | cand->second_conv->bad_p = true; |
612d07ac | 4014 | if (flags & LOOKUP_ONLYCONVERTING) |
4015 | cand->second_conv->need_temporary_p = true; | |
db0ec145 | 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. */ | |
ec10e4ad | 4019 | |
4020 | return cand; | |
4021 | } | |
4022 | ||
32390693 | 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; | |
00ba6bd5 | 4033 | /* Build the user conversion sequence. */ |
1611df57 | 4034 | conv = build_conv |
4035 | (ck_user, | |
32390693 | 4036 | convtype, |
1611df57 | 4037 | build_identity_conv (TREE_TYPE (expr), expr)); |
4038 | conv->cand = cand; | |
d6b20eb5 | 4039 | if (cand->viable == -1) |
4040 | conv->bad_p = true; | |
00ba6bd5 | 4041 | |
0d9d3654 | 4042 | /* We're performing the maybe-rvalue overload resolution and |
337dfeab | 4043 | a conversion function is in play. Reject converting the return |
4044 | value of the conversion function to a base class. */ | |
0d9d3654 | 4045 | if ((flags & LOOKUP_PREFER_RVALUE) && !DECL_CONSTRUCTOR_P (cand->fn)) |
337dfeab | 4046 | for (conversion *t = cand->second_conv; t; t = next_conversion (t)) |
4047 | if (t->kind == ck_base) | |
4048 | return NULL; | |
0d9d3654 | 4049 | |
5c9c5a4b | 4050 | /* Remember that this was a list-initialization. */ |
4051 | if (flags & LOOKUP_NO_NARROWING) | |
4052 | conv->check_narrowing = true; | |
4053 | ||
00ba6bd5 | 4054 | /* Combine it with the second conversion sequence. */ |
1611df57 | 4055 | cand->second_conv = merge_conversion_sequences (conv, |
00ba6bd5 | 4056 | cand->second_conv); |
4057 | ||
ec10e4ad | 4058 | return cand; |
4059 | } | |
4060 | ||
6198e8f6 | 4061 | /* Wrapper for above. */ |
4062 | ||
ec10e4ad | 4063 | tree |
66bbeb85 | 4064 | build_user_type_conversion (tree totype, tree expr, int flags, |
4065 | tsubst_flags_t complain) | |
ec10e4ad | 4066 | { |
6198e8f6 | 4067 | struct z_candidate *cand; |
4068 | tree ret; | |
4069 | ||
464458fc | 4070 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
66bbeb85 | 4071 | cand = build_user_type_conversion_1 (totype, expr, flags, complain); |
ec10e4ad | 4072 | |
4073 | if (cand) | |
4074 | { | |
1611df57 | 4075 | if (cand->second_conv->kind == ck_ambig) |
6198e8f6 | 4076 | ret = error_mark_node; |
4077 | else | |
4078 | { | |
66bbeb85 | 4079 | expr = convert_like (cand->second_conv, expr, complain); |
6198e8f6 | 4080 | ret = convert_from_reference (expr); |
4081 | } | |
ec10e4ad | 4082 | } |
6198e8f6 | 4083 | else |
4084 | ret = NULL_TREE; | |
4085 | ||
464458fc | 4086 | timevar_cond_stop (TV_OVERLOAD, subtime); |
6198e8f6 | 4087 | return ret; |
ec10e4ad | 4088 | } |
4089 | ||
e51ba9c0 | 4090 | /* Subroutine of convert_nontype_argument. |
4091 | ||
2104a0fd | 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. | |
e51ba9c0 | 4096 | |
4097 | If conversion is successful, returns the converted expression; | |
4098 | otherwise, returns error_mark_node. */ | |
4099 | ||
4100 | tree | |
2104a0fd | 4101 | build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain) |
e51ba9c0 | 4102 | { |
4103 | conversion *conv; | |
4104 | void *p; | |
4105 | tree t; | |
d3a3cfb8 | 4106 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
e51ba9c0 | 4107 | |
4108 | if (error_operand_p (expr)) | |
4109 | return error_mark_node; | |
4110 | ||
e51ba9c0 | 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, | |
66bbeb85 | 4116 | LOOKUP_IMPLICIT, complain); |
e51ba9c0 | 4117 | |
2104a0fd | 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; | |
e51ba9c0 | 4153 | |
2104a0fd | 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 | } | |
e51ba9c0 | 4163 | break; |
4164 | ||
2104a0fd | 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. */ | |
e51ba9c0 | 4182 | |
2104a0fd | 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 | } | |
e51ba9c0 | 4198 | |
4199 | if (conv) | |
ee6d34bb | 4200 | { |
4201 | conv->check_narrowing = true; | |
4202 | conv->check_narrowing_const_only = true; | |
4203 | expr = convert_like (conv, expr, complain); | |
4204 | } | |
e51ba9c0 | 4205 | else |
ee6d34bb | 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 | } | |
e51ba9c0 | 4212 | |
4213 | /* Free all the conversions we allocated. */ | |
4214 | obstack_free (&conversion_obstack, p); | |
4215 | ||
4216 | return expr; | |
4217 | } | |
4218 | ||
a792dfa4 | 4219 | /* Do any initial processing on the arguments to a function call. */ |
4220 | ||
f1f41a6c | 4221 | static vec<tree, va_gc> * |
4222 | resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain) | |
a792dfa4 | 4223 | { |
f352a3fb | 4224 | unsigned int ix; |
4225 | tree arg; | |
9031d10b | 4226 | |
f1f41a6c | 4227 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
f352a3fb | 4228 | { |
50bbb659 | 4229 | if (error_operand_p (arg)) |
f352a3fb | 4230 | return NULL; |
b3ddd970 | 4231 | else if (VOID_TYPE_P (TREE_TYPE (arg))) |
a792dfa4 | 4232 | { |
de129274 | 4233 | if (complain & tf_error) |
4234 | error ("invalid use of void expression"); | |
f352a3fb | 4235 | return NULL; |
a792dfa4 | 4236 | } |
42806913 | 4237 | else if (invalid_nonstatic_memfn_p (arg->exp.locus, arg, complain)) |
f352a3fb | 4238 | return NULL; |
a792dfa4 | 4239 | } |
4240 | return args; | |
4241 | } | |
f70cb9e6 | 4242 | |
c6a06e1f | 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 | |
9031d10b | 4250 | viable. |
c6a06e1f | 4251 | |
4252 | The ARGS should already have gone through RESOLVE_ARGS before this | |
4253 | function is called. */ | |
4254 | ||
4255 | static struct z_candidate * | |
9031d10b | 4256 | perform_overload_resolution (tree fn, |
f1f41a6c | 4257 | const vec<tree, va_gc> *args, |
c6a06e1f | 4258 | struct z_candidate **candidates, |
66bbeb85 | 4259 | bool *any_viable_p, tsubst_flags_t complain) |
ec10e4ad | 4260 | { |
c6a06e1f | 4261 | struct z_candidate *cand; |
6198e8f6 | 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; | |
b1cfe2be | 4269 | |
c6a06e1f | 4270 | *candidates = NULL; |
4271 | *any_viable_p = true; | |
4272 | ||
f352a3fb | 4273 | /* Check FN. */ |
9031d10b | 4274 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL |
b4df430b | 4275 | || TREE_CODE (fn) == TEMPLATE_DECL |
4276 | || TREE_CODE (fn) == OVERLOAD | |
4277 | || TREE_CODE (fn) == TEMPLATE_ID_EXPR); | |
f70cb9e6 | 4278 | |
b1cfe2be | 4279 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) |
4280 | { | |
4281 | explicit_targs = TREE_OPERAND (fn, 1); | |
4282 | fn = TREE_OPERAND (fn, 0); | |
a5a4ff77 | 4283 | template_only = 1; |
b1cfe2be | 4284 | } |
4285 | ||
c6a06e1f | 4286 | /* Add the various candidate functions. */ |
8bd47a90 | 4287 | add_candidates (fn, NULL_TREE, args, NULL_TREE, |
4288 | explicit_targs, template_only, | |
c6a06e1f | 4289 | /*conversion_path=*/NULL_TREE, |
4290 | /*access_path=*/NULL_TREE, | |
4291 | LOOKUP_NORMAL, | |
66bbeb85 | 4292 | candidates, complain); |
c6a06e1f | 4293 | |
aa8d51e4 | 4294 | *candidates = splice_viable (*candidates, false, any_viable_p); |
6198e8f6 | 4295 | if (*any_viable_p) |
66bbeb85 | 4296 | cand = tourney (*candidates, complain); |
6198e8f6 | 4297 | else |
4298 | cand = NULL; | |
ec10e4ad | 4299 | |
6198e8f6 | 4300 | timevar_cond_stop (TV_OVERLOAD, subtime); |
c6a06e1f | 4301 | return cand; |
4302 | } | |
a792dfa4 | 4303 | |
b596aa1a | 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 | |
f770db5d | 4310 | print_error_for_call_failure (tree fn, vec<tree, va_gc> *args, |
b596aa1a | 4311 | struct z_candidate *candidates) |
4312 | { | |
8847d9cf | 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 | } | |
05b229bf | 4319 | tree name = OVL_NAME (fn); |
b596aa1a | 4320 | location_t loc = location_of (name); |
8847d9cf | 4321 | if (targs) |
4322 | name = lookup_template_function (name, targs); | |
b596aa1a | 4323 | |
bc35ef65 | 4324 | auto_diagnostic_group d; |
f770db5d | 4325 | if (!any_strictly_viable (candidates)) |
b596aa1a | 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 | ||
c6a06e1f | 4335 | /* Return an expression for a call to FN (a namespace-scope function, |
f352a3fb | 4336 | or a static member function) with the ARGS. This may change |
4337 | ARGS. */ | |
9031d10b | 4338 | |
c6a06e1f | 4339 | tree |
47a5f618 | 4340 | build_new_function_call (tree fn, vec<tree, va_gc> **args, |
ebd21de4 | 4341 | tsubst_flags_t complain) |
c6a06e1f | 4342 | { |
4343 | struct z_candidate *candidates, *cand; | |
4344 | bool any_viable_p; | |
1611df57 | 4345 | void *p; |
4346 | tree result; | |
1eaf178d | 4347 | |
f352a3fb | 4348 | if (args != NULL && *args != NULL) |
4349 | { | |
de129274 | 4350 | *args = resolve_args (*args, complain); |
f352a3fb | 4351 | if (*args == NULL) |
4352 | return error_mark_node; | |
4353 | } | |
0a3b29ad | 4354 | |
4c0315d0 | 4355 | if (flag_tm) |
4356 | tm_malloc_replacement (fn); | |
4357 | ||
1611df57 | 4358 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4359 | p = conversion_obstack_alloc (0); | |
4360 | ||
66bbeb85 | 4361 | cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p, |
4362 | complain); | |
ec10e4ad | 4363 | |
c6a06e1f | 4364 | if (!cand) |
4365 | { | |
ebd21de4 | 4366 | if (complain & tf_error) |
4367 | { | |
56c12fd4 | 4368 | // If there is a single (non-viable) function candidate, |
4369 | // let the error be diagnosed by cp_build_function_call_vec. | |
db0e6c68 | 4370 | if (!any_viable_p && candidates && ! candidates->next |
4371 | && (TREE_CODE (candidates->fn) == FUNCTION_DECL)) | |
f352a3fb | 4372 | return cp_build_function_call_vec (candidates->fn, args, complain); |
56c12fd4 | 4373 | |
4374 | // Otherwise, emit notes for non-viable candidates. | |
f770db5d | 4375 | print_error_for_call_failure (fn, *args, candidates); |
ebd21de4 | 4376 | } |
1611df57 | 4377 | result = error_mark_node; |
c6a06e1f | 4378 | } |
1611df57 | 4379 | else |
822dd80c | 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) | |
56c12fd4 | 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 | ||
822dd80c | 4407 | result = build_over_call (cand, flags, complain); |
4408 | } | |
ec10e4ad | 4409 | |
1611df57 | 4410 | /* Free all the conversions we allocated. */ |
4411 | obstack_free (&conversion_obstack, p); | |
4412 | ||
4413 | return result; | |
c6a06e1f | 4414 | } |
ec10e4ad | 4415 | |
c6a06e1f | 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 | |
f352a3fb | 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 | |
77284979 | 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. */ | |
ec10e4ad | 4428 | |
c6a06e1f | 4429 | tree |
f1f41a6c | 4430 | build_operator_new_call (tree fnname, vec<tree, va_gc> **args, |
db8ffb40 | 4431 | tree *size, tree *cookie_size, |
4432 | tree align_arg, tree size_check, | |
66bbeb85 | 4433 | tree *fn, tsubst_flags_t complain) |
c6a06e1f | 4434 | { |
77284979 | 4435 | tree original_size = *size; |
c6a06e1f | 4436 | tree fns; |
4437 | struct z_candidate *candidates; | |
db8ffb40 | 4438 | struct z_candidate *cand = NULL; |
c6a06e1f | 4439 | bool any_viable_p; |
4440 | ||
393f878f | 4441 | if (fn) |
4442 | *fn = NULL_TREE; | |
77284979 | 4443 | /* Set to (size_t)-1 if the size check fails. */ |
4444 | if (size_check != NULL_TREE) | |
bcb3170c | 4445 | { |
4446 | tree errval = TYPE_MAX_VALUE (sizetype); | |
0c4def58 | 4447 | if (cxx_dialect >= cxx11 && flag_exceptions) |
bcb3170c | 4448 | errval = throw_bad_array_new_length (); |
4449 | *size = fold_build3 (COND_EXPR, sizetype, size_check, | |
4450 | original_size, errval); | |
4451 | } | |
f1f41a6c | 4452 | vec_safe_insert (*args, 0, *size); |
66bbeb85 | 4453 | *args = resolve_args (*args, complain); |
f352a3fb | 4454 | if (*args == NULL) |
4455 | return error_mark_node; | |
c6a06e1f | 4456 | |
614697c5 | 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". */ | |
a5aae789 | 4466 | fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0); |
4467 | fns = lookup_arg_dependent (fnname, fns, *args); | |
8417823c | 4468 | |
db8ffb40 | 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); | |
f8c7ac65 | 4475 | if (cand) |
4476 | *args = align_args; | |
db8ffb40 | 4477 | /* If no aligned allocation function matches, try again without the |
4478 | alignment. */ | |
4479 | } | |
4480 | ||
c6a06e1f | 4481 | /* Figure out what function is being called. */ |
db8ffb40 | 4482 | if (!cand) |
4483 | cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p, | |
4484 | complain); | |
9031d10b | 4485 | |
c6a06e1f | 4486 | /* If no suitable function could be found, issue an error message |
4487 | and give up. */ | |
4488 | if (!cand) | |
4489 | { | |
66bbeb85 | 4490 | if (complain & tf_error) |
f770db5d | 4491 | print_error_for_call_failure (fns, *args, candidates); |
c6a06e1f | 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; | |
f591db9a | 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; | |
c6a06e1f | 4512 | /* If we need a cookie, adjust the number of bytes allocated. */ |
4513 | if (use_cookie) | |
4514 | { | |
4515 | /* Update the total size. */ | |
77284979 | 4516 | *size = size_binop (PLUS_EXPR, original_size, *cookie_size); |
d5a9b16d | 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 | } | |
c6a06e1f | 4524 | /* Update the argument list to reflect the adjusted size. */ |
f1f41a6c | 4525 | (**args)[0] = *size; |
c6a06e1f | 4526 | } |
4527 | else | |
4528 | *cookie_size = NULL_TREE; | |
4529 | } | |
4530 | ||
393f878f | 4531 | /* Tell our caller which function we decided to call. */ |
4532 | if (fn) | |
4533 | *fn = cand->fn; | |
4534 | ||
c6a06e1f | 4535 | /* Build the CALL_EXPR. */ |
66bbeb85 | 4536 | return build_over_call (cand, LOOKUP_NORMAL, complain); |
ec10e4ad | 4537 | } |
4538 | ||
f352a3fb | 4539 | /* Build a new call to operator(). This may change ARGS. */ |
4540 | ||
6198e8f6 | 4541 | static tree |
f1f41a6c | 4542 | build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
ec10e4ad | 4543 | { |
4544 | struct z_candidate *candidates = 0, *cand; | |
f352a3fb | 4545 | tree fns, convs, first_mem_arg = NULL_TREE; |
f4da5882 | 4546 | bool any_viable_p; |
1611df57 | 4547 | tree result = NULL_TREE; |
4548 | void *p; | |
ec10e4ad | 4549 | |
c017458d | 4550 | obj = mark_lvalue_use (obj); |
4551 | ||
f352a3fb | 4552 | if (error_operand_p (obj)) |
4553 | return error_mark_node; | |
4554 | ||
c017458d | 4555 | tree type = TREE_TYPE (obj); |
4556 | ||
f352a3fb | 4557 | obj = prep_operand (obj); |
4558 | ||
02add86d | 4559 | if (TYPE_PTRMEMFUNC_P (type)) |
4560 | { | |
ebd21de4 | 4561 | if (complain & tf_error) |
4562 | /* It's no good looking for an overloaded operator() on a | |
4563 | pointer-to-member-function. */ | |
8c41abe8 | 4564 | error ("pointer-to-member function %qE cannot be called without " |
4565 | "an object; consider using %<.*%> or %<->*%>", obj); | |
02add86d | 4566 | return error_mark_node; |
4567 | } | |
4568 | ||
5f2e2c77 | 4569 | if (TYPE_BINFO (type)) |
4570 | { | |
ef8f6502 | 4571 | fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1); |
5f2e2c77 | 4572 | if (fns == error_mark_node) |
4573 | return error_mark_node; | |
4574 | } | |
4575 | else | |
4576 | fns = NULL_TREE; | |
ec10e4ad | 4577 | |
f352a3fb | 4578 | if (args != NULL && *args != NULL) |
4579 | { | |
de129274 | 4580 | *args = resolve_args (*args, complain); |
f352a3fb | 4581 | if (*args == NULL) |
4582 | return error_mark_node; | |
4583 | } | |
a792dfa4 | 4584 | |
1611df57 | 4585 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4586 | p = conversion_obstack_alloc (0); | |
4587 | ||
ec10e4ad | 4588 | if (fns) |
4589 | { | |
18619da5 | 4590 | first_mem_arg = obj; |
ec10e4ad | 4591 | |
8bd47a90 | 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), | |
66bbeb85 | 4596 | LOOKUP_NORMAL, &candidates, complain); |
ec10e4ad | 4597 | } |
4598 | ||
9960d752 | 4599 | convs = lookup_conversions (type); |
ec10e4ad | 4600 | |
4601 | for (; convs; convs = TREE_CHAIN (convs)) | |
4602 | { | |
cf7aa2e5 | 4603 | tree totype = TREE_TYPE (convs); |
ec10e4ad | 4604 | |
a0ccdf54 | 4605 | if (TYPE_PTRFN_P (totype) |
4606 | || TYPE_REFFN_P (totype) | |
90ad495b | 4607 | || (TYPE_REF_P (totype) |
a0ccdf54 | 4608 | && TYPE_PTRFN_P (TREE_TYPE (totype)))) |
05b229bf | 4609 | for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter) |
ec10e4ad | 4610 | { |
05b229bf | 4611 | tree fn = *iter; |
cf7aa2e5 | 4612 | |
4613 | if (DECL_NONCONVERTING_P (fn)) | |
4614 | continue; | |
4615 | ||
9031d10b | 4616 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
4617 | add_template_conv_candidate | |
71910a11 | 4618 | (&candidates, fn, obj, *args, totype, |
8999978b | 4619 | /*access_path=*/NULL_TREE, |
66bbeb85 | 4620 | /*conversion_path=*/NULL_TREE, complain); |
f5308315 | 4621 | else |
71910a11 | 4622 | add_conv_candidate (&candidates, fn, obj, |
f352a3fb | 4623 | *args, /*conversion_path=*/NULL_TREE, |
66bbeb85 | 4624 | /*access_path=*/NULL_TREE, complain); |
ec10e4ad | 4625 | } |
4626 | } | |
4627 | ||
aa8d51e4 | 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); | |
f4da5882 | 4631 | if (!any_viable_p) |
ec10e4ad | 4632 | { |
ebd21de4 | 4633 | if (complain & tf_error) |
4634 | { | |
bc35ef65 | 4635 | auto_diagnostic_group d; |
f352a3fb | 4636 | error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj), |
4637 | build_tree_list_vec (*args)); | |
b596aa1a | 4638 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
ebd21de4 | 4639 | } |
1611df57 | 4640 | result = error_mark_node; |
ec10e4ad | 4641 | } |
1611df57 | 4642 | else |
ec10e4ad | 4643 | { |
66bbeb85 | 4644 | cand = tourney (candidates, complain); |
1611df57 | 4645 | if (cand == 0) |
4646 | { | |
ebd21de4 | 4647 | if (complain & tf_error) |
4648 | { | |
bc35ef65 | 4649 | auto_diagnostic_group d; |
ebd21de4 | 4650 | error ("call of %<(%T) (%A)%> is ambiguous", |
f352a3fb | 4651 | TREE_TYPE (obj), build_tree_list_vec (*args)); |
b596aa1a | 4652 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
ebd21de4 | 4653 | } |
1611df57 | 4654 | result = error_mark_node; |
4655 | } | |
1611df57 | 4656 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL |
ef8f6502 | 4657 | && DECL_OVERLOADED_OPERATOR_P (cand->fn) |
4658 | && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR)) | |
ebd21de4 | 4659 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
1611df57 | 4660 | else |
4661 | { | |
e2665e8b | 4662 | if (TREE_CODE (cand->fn) == FUNCTION_DECL) |
d1e0c36e | 4663 | obj = convert_like_with_context (cand->convs[0], obj, cand->fn, |
4664 | -1, complain); | |
4665 | else | |
e2665e8b | 4666 | { |
4667 | gcc_checking_assert (TYPE_P (cand->fn)); | |
4668 | obj = convert_like (cand->convs[0], obj, complain); | |
4669 | } | |
729f89ff | 4670 | obj = convert_from_reference (obj); |
f352a3fb | 4671 | result = cp_build_function_call_vec (obj, args, complain); |
1611df57 | 4672 | } |
ec10e4ad | 4673 | } |
4674 | ||
1611df57 | 4675 | /* Free all the conversions we allocated. */ |
4676 | obstack_free (&conversion_obstack, p); | |
ec10e4ad | 4677 | |
1611df57 | 4678 | return result; |
ec10e4ad | 4679 | } |
4680 | ||
6198e8f6 | 4681 | /* Wrapper for above. */ |
4682 | ||
4683 | tree | |
f1f41a6c | 4684 | build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
6198e8f6 | 4685 | { |
4686 | tree ret; | |
464458fc | 4687 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
6198e8f6 | 4688 | ret = build_op_call_1 (obj, args, complain); |
464458fc | 4689 | timevar_cond_stop (TV_OVERLOAD, subtime); |
6198e8f6 | 4690 | return ret; |
4691 | } | |
4692 | ||
1c9c9381 | 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 | ||
ec10e4ad | 4715 | static void |
ef0b0c72 | 4716 | op_error (location_t loc, enum tree_code code, enum tree_code code2, |
5c892d4a | 4717 | tree arg1, tree arg2, tree arg3, bool match) |
ec10e4ad | 4718 | { |
ca16a224 | 4719 | bool assop = code == MODIFY_EXPR; |
4720 | const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name; | |
ec10e4ad | 4721 | |
4722 | switch (code) | |
4723 | { | |
4724 | case COND_EXPR: | |
1c9c9381 | 4725 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4726 | error_at (loc, op_error_string (G_("ternary %<operator?:%>"), |
4727 | 3, match), | |
4728 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
5c892d4a | 4729 | else |
ef0b0c72 | 4730 | error_at (loc, op_error_string (G_("ternary %<operator?:%> " |
4731 | "in %<%E ? %E : %E%>"), 3, match), | |
4732 | arg1, arg2, arg3, | |
4733 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
ec10e4ad | 4734 | break; |
9031d10b | 4735 | |
ec10e4ad | 4736 | case POSTINCREMENT_EXPR: |
4737 | case POSTDECREMENT_EXPR: | |
1c9c9381 | 4738 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4739 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4740 | opname, TREE_TYPE (arg1)); | |
5c892d4a | 4741 | else |
ef0b0c72 | 4742 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"), |
4743 | 1, match), | |
4744 | opname, arg1, opname, TREE_TYPE (arg1)); | |
ec10e4ad | 4745 | break; |
9031d10b | 4746 | |
ec10e4ad | 4747 | case ARRAY_REF: |
1c9c9381 | 4748 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4749 | error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match), |
4750 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
5c892d4a | 4751 | else |
ef0b0c72 | 4752 | error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"), |
4753 | 2, match), | |
4754 | arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
ec10e4ad | 4755 | break; |
8ae6c136 | 4756 | |
4757 | case REALPART_EXPR: | |
4758 | case IMAGPART_EXPR: | |
1c9c9381 | 4759 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4760 | error_at (loc, op_error_string (G_("%qs"), 1, match), |
4761 | opname, TREE_TYPE (arg1)); | |
5c892d4a | 4762 | else |
ef0b0c72 | 4763 | error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match), |
4764 | opname, opname, arg1, TREE_TYPE (arg1)); | |
8ae6c136 | 4765 | break; |
9031d10b | 4766 | |
ec10e4ad | 4767 | default: |
4768 | if (arg2) | |
1c9c9381 | 4769 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4770 | error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match), |
4771 | opname, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
1c9c9381 | 4772 | else |
ef0b0c72 | 4773 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"), |
4774 | 2, match), | |
4775 | opname, arg1, opname, arg2, | |
4776 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
ec10e4ad | 4777 | else |
1c9c9381 | 4778 | if (flag_diagnostics_show_caret) |
ef0b0c72 | 4779 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4780 | opname, TREE_TYPE (arg1)); | |
1c9c9381 | 4781 | else |
ef0b0c72 | 4782 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"), |
4783 | 1, match), | |
4784 | opname, opname, arg1, TREE_TYPE (arg1)); | |
efcc369a | 4785 | break; |
ec10e4ad | 4786 | } |
4787 | } | |
4788 | ||
8c18e707 | 4789 | /* Return the implicit conversion sequence that could be used to |
4790 | convert E1 to E2 in [expr.cond]. */ | |
4791 | ||
1611df57 | 4792 | static conversion * |
66bbeb85 | 4793 | conditional_conversion (tree e1, tree e2, tsubst_flags_t complain) |
8c18e707 | 4794 | { |
4795 | tree t1 = non_reference (TREE_TYPE (e1)); | |
4796 | tree t2 = non_reference (TREE_TYPE (e2)); | |
1611df57 | 4797 | conversion *conv; |
60a7ed1a | 4798 | bool good_base; |
8c18e707 | 4799 | |
4800 | /* [expr.cond] | |
4801 | ||
4802 | If E2 is an lvalue: E1 can be converted to match E2 if E1 can be | |
46af4cac | 4803 | implicitly converted (clause _conv_) to the type "lvalue reference to |
8c18e707 | 4804 | T2", subject to the constraint that in the conversion the |
d5e58b85 | 4805 | reference must bind directly (_dcl.init.ref_) to an lvalue. |
4806 | ||
4807 | If E2 is an xvalue: E1 can be converted to match E2 if E1 can be | |
4808 | implicitly converted to the type "rvalue reference to T2", subject to | |
4809 | the constraint that the reference must bind directly. */ | |
f3250f7c | 4810 | if (glvalue_p (e2)) |
8c18e707 | 4811 | { |
18bede74 | 4812 | tree rtype = cp_build_reference_type (t2, !lvalue_p (e2)); |
d5e58b85 | 4813 | conv = implicit_conversion (rtype, |
8c18e707 | 4814 | t1, |
4815 | e1, | |
8de1f703 | 4816 | /*c_cast_p=*/false, |
46af4cac | 4817 | LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND |
66bbeb85 | 4818 | |LOOKUP_ONLYCONVERTING, |
4819 | complain); | |
d5e58b85 | 4820 | if (conv && !conv->bad_p) |
8c18e707 | 4821 | return conv; |
4822 | } | |
4823 | ||
d5e58b85 | 4824 | /* If E2 is a prvalue or if neither of the conversions above can be done |
4825 | and at least one of the operands has (possibly cv-qualified) class | |
4826 | type: */ | |
4827 | if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2)) | |
4828 | return NULL; | |
4829 | ||
8c18e707 | 4830 | /* [expr.cond] |
4831 | ||
4832 | If E1 and E2 have class type, and the underlying class types are | |
4833 | the same or one is a base class of the other: E1 can be converted | |
4834 | to match E2 if the class of T2 is the same type as, or a base | |
4835 | class of, the class of T1, and the cv-qualification of T2 is the | |
4836 | same cv-qualification as, or a greater cv-qualification than, the | |
4837 | cv-qualification of T1. If the conversion is applied, E1 is | |
4838 | changed to an rvalue of type T2 that still refers to the original | |
d45cef9b | 4839 | source class object (or the appropriate subobject thereof). */ |
8c18e707 | 4840 | if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2) |
60a7ed1a | 4841 | && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2))) |
8c18e707 | 4842 | { |
60a7ed1a | 4843 | if (good_base && at_least_as_qualified_p (t2, t1)) |
8c18e707 | 4844 | { |
1611df57 | 4845 | conv = build_identity_conv (t1, e1); |
9031d10b | 4846 | if (!same_type_p (TYPE_MAIN_VARIANT (t1), |
db9d2b2e | 4847 | TYPE_MAIN_VARIANT (t2))) |
d45cef9b | 4848 | conv = build_conv (ck_base, t2, conv); |
09e3adf6 | 4849 | else |
1611df57 | 4850 | conv = build_conv (ck_rvalue, t2, conv); |
8c18e707 | 4851 | return conv; |
4852 | } | |
4853 | else | |
1611df57 | 4854 | return NULL; |
8c18e707 | 4855 | } |
60a7ed1a | 4856 | else |
4857 | /* [expr.cond] | |
8c18e707 | 4858 | |
60a7ed1a | 4859 | Otherwise: E1 can be converted to match E2 if E1 can be implicitly |
4860 | converted to the type that expression E2 would have if E2 were | |
4861 | converted to an rvalue (or the type it has, if E2 is an rvalue). */ | |
8de1f703 | 4862 | return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false, |
66bbeb85 | 4863 | LOOKUP_IMPLICIT, complain); |
8c18e707 | 4864 | } |
4865 | ||
4866 | /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three | |
f70cb9e6 | 4867 | arguments to the conditional expression. */ |
8c18e707 | 4868 | |
6198e8f6 | 4869 | static tree |
1273a0b4 | 4870 | build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3, |
6198e8f6 | 4871 | tsubst_flags_t complain) |
8c18e707 | 4872 | { |
4873 | tree arg2_type; | |
4874 | tree arg3_type; | |
1611df57 | 4875 | tree result = NULL_TREE; |
8c18e707 | 4876 | tree result_type = NULL_TREE; |
11a93d7a | 4877 | bool is_glvalue = true; |
8c18e707 | 4878 | struct z_candidate *candidates = 0; |
4879 | struct z_candidate *cand; | |
1611df57 | 4880 | void *p; |
c28ddc97 | 4881 | tree orig_arg2, orig_arg3; |
8c18e707 | 4882 | |
4883 | /* As a G++ extension, the second argument to the conditional can be | |
4884 | omitted. (So that `a ? : c' is roughly equivalent to `a ? a : | |
dbc6f863 | 4885 | c'.) If the second operand is omitted, make sure it is |
4886 | calculated only once. */ | |
8c18e707 | 4887 | if (!arg2) |
4888 | { | |
8864917d | 4889 | if (complain & tf_error) |
7a21b590 | 4890 | pedwarn (loc, OPT_Wpedantic, |
8864917d | 4891 | "ISO C++ forbids omitting the middle term of a ?: expression"); |
bdb2219e | 4892 | |
7a21b590 | 4893 | if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1))) |
4894 | warn_for_omitted_condop (loc, arg1); | |
4895 | ||
bdb2219e | 4896 | /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */ |
18bede74 | 4897 | if (lvalue_p (arg1)) |
514727a9 | 4898 | arg2 = arg1 = cp_stabilize_reference (arg1); |
bdb2219e | 4899 | else |
08de4af3 | 4900 | arg2 = arg1 = cp_save_expr (arg1); |
8c18e707 | 4901 | } |
4902 | ||
7b463b19 | 4903 | /* If something has already gone wrong, just pass that fact up the |
4904 | tree. */ | |
4905 | if (error_operand_p (arg1) | |
4906 | || error_operand_p (arg2) | |
4907 | || error_operand_p (arg3)) | |
4908 | return error_mark_node; | |
4909 | ||
4910 | orig_arg2 = arg2; | |
4911 | orig_arg3 = arg3; | |
4912 | ||
4913 | if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1))) | |
4914 | { | |
46ec4eb4 | 4915 | tree arg1_type = TREE_TYPE (arg1); |
4916 | ||
1f137e6d | 4917 | /* If arg1 is another cond_expr choosing between -1 and 0, |
4918 | then we can use its comparison. It may help to avoid | |
4919 | additional comparison, produce more accurate diagnostics | |
4920 | and enables folding. */ | |
4921 | if (TREE_CODE (arg1) == VEC_COND_EXPR | |
4922 | && integer_minus_onep (TREE_OPERAND (arg1, 1)) | |
4923 | && integer_zerop (TREE_OPERAND (arg1, 2))) | |
4924 | arg1 = TREE_OPERAND (arg1, 0); | |
4925 | ||
7b463b19 | 4926 | arg1 = force_rvalue (arg1, complain); |
4927 | arg2 = force_rvalue (arg2, complain); | |
4928 | arg3 = force_rvalue (arg3, complain); | |
4929 | ||
37c19cb6 | 4930 | /* force_rvalue can return error_mark on valid arguments. */ |
4931 | if (error_operand_p (arg1) | |
4932 | || error_operand_p (arg2) | |
4933 | || error_operand_p (arg3)) | |
4934 | return error_mark_node; | |
4935 | ||
7b463b19 | 4936 | arg2_type = TREE_TYPE (arg2); |
4937 | arg3_type = TREE_TYPE (arg3); | |
4938 | ||
76249021 | 4939 | if (!VECTOR_TYPE_P (arg2_type) |
4940 | && !VECTOR_TYPE_P (arg3_type)) | |
7b463b19 | 4941 | { |
3dbad1a0 | 4942 | /* Rely on the error messages of the scalar version. */ |
4943 | tree scal = build_conditional_expr_1 (loc, integer_one_node, | |
4944 | orig_arg2, orig_arg3, complain); | |
4945 | if (scal == error_mark_node) | |
4946 | return error_mark_node; | |
4947 | tree stype = TREE_TYPE (scal); | |
4948 | tree ctype = TREE_TYPE (arg1_type); | |
4949 | if (TYPE_SIZE (stype) != TYPE_SIZE (ctype) | |
4950 | || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype))) | |
4951 | { | |
4952 | if (complain & tf_error) | |
4953 | error_at (loc, "inferred scalar type %qT is not an integer or " | |
4954 | "floating point type of the same size as %qT", stype, | |
4955 | COMPARISON_CLASS_P (arg1) | |
4956 | ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0))) | |
4957 | : ctype); | |
4958 | return error_mark_node; | |
4959 | } | |
4960 | ||
4961 | tree vtype = build_opaque_vector_type (stype, | |
4962 | TYPE_VECTOR_SUBPARTS (arg1_type)); | |
4963 | /* We could pass complain & tf_warning to unsafe_conversion_p, | |
4964 | but the warnings (like Wsign-conversion) have already been | |
4965 | given by the scalar build_conditional_expr_1. We still check | |
4966 | unsafe_conversion_p to forbid truncating long long -> float. */ | |
645b0f8d | 4967 | if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false)) |
3dbad1a0 | 4968 | { |
4969 | if (complain & tf_error) | |
4d1eda3a | 4970 | error_at (loc, "conversion of scalar %qH to vector %qI " |
3dbad1a0 | 4971 | "involves truncation", arg2_type, vtype); |
4972 | return error_mark_node; | |
4973 | } | |
645b0f8d | 4974 | if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false)) |
3dbad1a0 | 4975 | { |
4976 | if (complain & tf_error) | |
4d1eda3a | 4977 | error_at (loc, "conversion of scalar %qH to vector %qI " |
3dbad1a0 | 4978 | "involves truncation", arg3_type, vtype); |
4979 | return error_mark_node; | |
4980 | } | |
4981 | ||
4982 | arg2 = cp_convert (stype, arg2, complain); | |
4983 | arg2 = save_expr (arg2); | |
4984 | arg2 = build_vector_from_val (vtype, arg2); | |
4985 | arg2_type = vtype; | |
4986 | arg3 = cp_convert (stype, arg3, complain); | |
4987 | arg3 = save_expr (arg3); | |
4988 | arg3 = build_vector_from_val (vtype, arg3); | |
4989 | arg3_type = vtype; | |
7b463b19 | 4990 | } |
4991 | ||
76249021 | 4992 | if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type)) |
7b463b19 | 4993 | { |
4994 | enum stv_conv convert_flag = | |
1273a0b4 | 4995 | scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3, |
7b463b19 | 4996 | complain & tf_error); |
4997 | ||
4998 | switch (convert_flag) | |
4999 | { | |
5000 | case stv_error: | |
5001 | return error_mark_node; | |
5002 | case stv_firstarg: | |
5003 | { | |
3dbad1a0 | 5004 | arg2 = save_expr (arg2); |
7b463b19 | 5005 | arg2 = convert (TREE_TYPE (arg3_type), arg2); |
5006 | arg2 = build_vector_from_val (arg3_type, arg2); | |
5007 | arg2_type = TREE_TYPE (arg2); | |
5008 | break; | |
5009 | } | |
5010 | case stv_secondarg: | |
5011 | { | |
3dbad1a0 | 5012 | arg3 = save_expr (arg3); |
7b463b19 | 5013 | arg3 = convert (TREE_TYPE (arg2_type), arg3); |
5014 | arg3 = build_vector_from_val (arg2_type, arg3); | |
5015 | arg3_type = TREE_TYPE (arg3); | |
5016 | break; | |
5017 | } | |
5018 | default: | |
5019 | break; | |
5020 | } | |
5021 | } | |
5022 | ||
5023 | if (!same_type_p (arg2_type, arg3_type) | |
f08ee65f | 5024 | || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type), |
5025 | TYPE_VECTOR_SUBPARTS (arg2_type)) | |
7b463b19 | 5026 | || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type)) |
5027 | { | |
5028 | if (complain & tf_error) | |
1273a0b4 | 5029 | error_at (loc, |
5030 | "incompatible vector types in conditional expression: " | |
5031 | "%qT, %qT and %qT", TREE_TYPE (arg1), | |
5032 | TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3)); | |
7b463b19 | 5033 | return error_mark_node; |
5034 | } | |
5035 | ||
5036 | if (!COMPARISON_CLASS_P (arg1)) | |
1f137e6d | 5037 | { |
5038 | tree cmp_type = build_same_sized_truth_vector_type (arg1_type); | |
5039 | arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type)); | |
5040 | } | |
d2c63826 | 5041 | return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3); |
7b463b19 | 5042 | } |
5043 | ||
3d411d73 | 5044 | /* [expr.cond] |
9031d10b | 5045 | |
08cc44e7 | 5046 | The first expression is implicitly converted to bool (clause |
3d411d73 | 5047 | _conv_). */ |
97e2368b | 5048 | arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain, |
5049 | LOOKUP_NORMAL); | |
7b463b19 | 5050 | if (error_operand_p (arg1)) |
8c18e707 | 5051 | return error_mark_node; |
5052 | ||
8c18e707 | 5053 | /* [expr.cond] |
5054 | ||
5055 | If either the second or the third operand has type (possibly | |
5056 | cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_), | |
5057 | array-to-pointer (_conv.array_), and function-to-pointer | |
5058 | (_conv.func_) standard conversions are performed on the second | |
5059 | and third operands. */ | |
154a4e70 | 5060 | arg2_type = unlowered_expr_type (arg2); |
5061 | arg3_type = unlowered_expr_type (arg3); | |
e3cfe3ce | 5062 | if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type)) |
8c18e707 | 5063 | { |
8c18e707 | 5064 | /* [expr.cond] |
5065 | ||
5066 | One of the following shall hold: | |
5067 | ||
5068 | --The second or the third operand (but not both) is a | |
fd03461e | 5069 | throw-expression (_except.throw_); the result is of the type |
5070 | and value category of the other. | |
8c18e707 | 5071 | |
5072 | --Both the second and the third operands have type void; the | |
fd03461e | 5073 | result is of type void and is a prvalue. */ |
9031d10b | 5074 | if (TREE_CODE (arg2) == THROW_EXPR |
5f6b377f | 5075 | && TREE_CODE (arg3) != THROW_EXPR) |
5076 | { | |
5f6b377f | 5077 | result_type = arg3_type; |
fd03461e | 5078 | is_glvalue = glvalue_p (arg3); |
5f6b377f | 5079 | } |
9031d10b | 5080 | else if (TREE_CODE (arg2) != THROW_EXPR |
5f6b377f | 5081 | && TREE_CODE (arg3) == THROW_EXPR) |
5082 | { | |
5f6b377f | 5083 | result_type = arg2_type; |
fd03461e | 5084 | is_glvalue = glvalue_p (arg2); |
5f6b377f | 5085 | } |
e3cfe3ce | 5086 | else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type)) |
fd03461e | 5087 | { |
5088 | result_type = void_type_node; | |
5089 | is_glvalue = false; | |
5090 | } | |
8c18e707 | 5091 | else |
5092 | { | |
ebd21de4 | 5093 | if (complain & tf_error) |
5094 | { | |
5095 | if (VOID_TYPE_P (arg2_type)) | |
d3a3cfb8 | 5096 | error_at (cp_expr_loc_or_loc (arg3, loc), |
1273a0b4 | 5097 | "second operand to the conditional operator " |
5098 | "is of type %<void%>, but the third operand is " | |
5099 | "neither a throw-expression nor of type %<void%>"); | |
ebd21de4 | 5100 | else |
d3a3cfb8 | 5101 | error_at (cp_expr_loc_or_loc (arg2, loc), |
1273a0b4 | 5102 | "third operand to the conditional operator " |
5103 | "is of type %<void%>, but the second operand is " | |
5104 | "neither a throw-expression nor of type %<void%>"); | |
ebd21de4 | 5105 | } |
8c18e707 | 5106 | return error_mark_node; |
5107 | } | |
5108 | ||
8c18e707 | 5109 | goto valid_operands; |
5110 | } | |
5111 | /* [expr.cond] | |
5112 | ||
5113 | Otherwise, if the second and third operand have different types, | |
d5e58b85 | 5114 | and either has (possibly cv-qualified) class type, or if both are |
5115 | glvalues of the same value category and the same type except for | |
5116 | cv-qualification, an attempt is made to convert each of those operands | |
5117 | to the type of the other. */ | |
8c18e707 | 5118 | else if (!same_type_p (arg2_type, arg3_type) |
d5e58b85 | 5119 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type) |
5120 | || (same_type_ignoring_top_level_qualifiers_p (arg2_type, | |
5121 | arg3_type) | |
f3250f7c | 5122 | && glvalue_p (arg2) && glvalue_p (arg3) |
18bede74 | 5123 | && lvalue_p (arg2) == lvalue_p (arg3)))) |
8c18e707 | 5124 | { |
1611df57 | 5125 | conversion *conv2; |
5126 | conversion *conv3; | |
d8fbb701 | 5127 | bool converted = false; |
9031d10b | 5128 | |
1611df57 | 5129 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
5130 | p = conversion_obstack_alloc (0); | |
5131 | ||
66bbeb85 | 5132 | conv2 = conditional_conversion (arg2, arg3, complain); |
5133 | conv3 = conditional_conversion (arg3, arg2, complain); | |
1611df57 | 5134 | |
8c18e707 | 5135 | /* [expr.cond] |
5136 | ||
5137 | If both can be converted, or one can be converted but the | |
5138 | conversion is ambiguous, the program is ill-formed. If | |
5139 | neither can be converted, the operands are left unchanged and | |
5140 | further checking is performed as described below. If exactly | |
5141 | one conversion is possible, that conversion is applied to the | |
5142 | chosen operand and the converted operand is used in place of | |
5143 | the original operand for the remainder of this section. */ | |
1611df57 | 5144 | if ((conv2 && !conv2->bad_p |
5145 | && conv3 && !conv3->bad_p) | |
5146 | || (conv2 && conv2->kind == ck_ambig) | |
5147 | || (conv3 && conv3->kind == ck_ambig)) | |
8c18e707 | 5148 | { |
19b271a9 | 5149 | if (complain & tf_error) |
15608833 | 5150 | { |
5151 | error_at (loc, "operands to ?: have different types %qT and %qT", | |
5152 | arg2_type, arg3_type); | |
5153 | if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p) | |
5154 | inform (loc, " and each type can be converted to the other"); | |
5155 | else if (conv2 && conv2->kind == ck_ambig) | |
5156 | convert_like (conv2, arg2, complain); | |
5157 | else | |
5158 | convert_like (conv3, arg3, complain); | |
5159 | } | |
1611df57 | 5160 | result = error_mark_node; |
8c18e707 | 5161 | } |
70d9340b | 5162 | else if (conv2 && !conv2->bad_p) |
8c18e707 | 5163 | { |
ebd21de4 | 5164 | arg2 = convert_like (conv2, arg2, complain); |
cda000d8 | 5165 | arg2 = convert_from_reference (arg2); |
8c18e707 | 5166 | arg2_type = TREE_TYPE (arg2); |
a82a45de | 5167 | /* Even if CONV2 is a valid conversion, the result of the |
5168 | conversion may be invalid. For example, if ARG3 has type | |
5169 | "volatile X", and X does not have a copy constructor | |
5170 | accepting a "volatile X&", then even if ARG2 can be | |
5171 | converted to X, the conversion will fail. */ | |
5172 | if (error_operand_p (arg2)) | |
5173 | result = error_mark_node; | |
d8fbb701 | 5174 | converted = true; |
8c18e707 | 5175 | } |
70d9340b | 5176 | else if (conv3 && !conv3->bad_p) |
8c18e707 | 5177 | { |
ebd21de4 | 5178 | arg3 = convert_like (conv3, arg3, complain); |
cda000d8 | 5179 | arg3 = convert_from_reference (arg3); |
8c18e707 | 5180 | arg3_type = TREE_TYPE (arg3); |
a82a45de | 5181 | if (error_operand_p (arg3)) |
5182 | result = error_mark_node; | |
d8fbb701 | 5183 | converted = true; |
8c18e707 | 5184 | } |
1611df57 | 5185 | |
5186 | /* Free all the conversions we allocated. */ | |
5187 | obstack_free (&conversion_obstack, p); | |
5188 | ||
5189 | if (result) | |
5190 | return result; | |
49babdb3 | 5191 | |
5192 | /* If, after the conversion, both operands have class type, | |
5193 | treat the cv-qualification of both operands as if it were the | |
9031d10b | 5194 | union of the cv-qualification of the operands. |
49babdb3 | 5195 | |
5196 | The standard is not clear about what to do in this | |
5197 | circumstance. For example, if the first operand has type | |
5198 | "const X" and the second operand has a user-defined | |
5199 | conversion to "volatile X", what is the type of the second | |
5200 | operand after this step? Making it be "const X" (matching | |
5201 | the first operand) seems wrong, as that discards the | |
0aee14a5 | 5202 | qualification without actually performing a copy. Leaving it |
49babdb3 | 5203 | as "volatile X" seems wrong as that will result in the |
5204 | conditional expression failing altogether, even though, | |
5205 | according to this step, the one operand could be converted to | |
5206 | the type of the other. */ | |
d8fbb701 | 5207 | if (converted |
49babdb3 | 5208 | && CLASS_TYPE_P (arg2_type) |
ce494fcf | 5209 | && cp_type_quals (arg2_type) != cp_type_quals (arg3_type)) |
9031d10b | 5210 | arg2_type = arg3_type = |
49babdb3 | 5211 | cp_build_qualified_type (arg2_type, |
ce494fcf | 5212 | cp_type_quals (arg2_type) |
5213 | | cp_type_quals (arg3_type)); | |
8c18e707 | 5214 | } |
5215 | ||
5216 | /* [expr.cond] | |
5217 | ||
72ba84e7 | 5218 | If the second and third operands are glvalues of the same value |
5219 | category and have the same type, the result is of that type and | |
5220 | value category. */ | |
18bede74 | 5221 | if (((lvalue_p (arg2) && lvalue_p (arg3)) |
72ba84e7 | 5222 | || (xvalue_p (arg2) && xvalue_p (arg3))) |
29c42daf | 5223 | && same_type_p (arg2_type, arg3_type)) |
8c18e707 | 5224 | { |
5225 | result_type = arg2_type; | |
6ac80fa2 | 5226 | arg2 = mark_lvalue_use (arg2); |
5227 | arg3 = mark_lvalue_use (arg3); | |
8c18e707 | 5228 | goto valid_operands; |
5229 | } | |
5230 | ||
5231 | /* [expr.cond] | |
5232 | ||
5233 | Otherwise, the result is an rvalue. If the second and third | |
5234 | operand do not have the same type, and either has (possibly | |
5235 | cv-qualified) class type, overload resolution is used to | |
5236 | determine the conversions (if any) to be applied to the operands | |
5237 | (_over.match.oper_, _over.built_). */ | |
11a93d7a | 5238 | is_glvalue = false; |
8c18e707 | 5239 | if (!same_type_p (arg2_type, arg3_type) |
5240 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type))) | |
5241 | { | |
5242 | tree args[3]; | |
1611df57 | 5243 | conversion *conv; |
f4da5882 | 5244 | bool any_viable_p; |
8c18e707 | 5245 | |
5246 | /* Rearrange the arguments so that add_builtin_candidate only has | |
57ea629b | 5247 | to know about two args. In build_builtin_candidate, the |
8c18e707 | 5248 | arguments are unscrambled. */ |
5249 | args[0] = arg2; | |
5250 | args[1] = arg3; | |
5251 | args[2] = arg1; | |
9031d10b | 5252 | add_builtin_candidates (&candidates, |
5253 | COND_EXPR, | |
8999978b | 5254 | NOP_EXPR, |
ca16a224 | 5255 | ovl_op_identifier (false, COND_EXPR), |
8999978b | 5256 | args, |
66bbeb85 | 5257 | LOOKUP_NORMAL, complain); |
8c18e707 | 5258 | |
5259 | /* [expr.cond] | |
5260 | ||
5261 | If the overload resolution fails, the program is | |
5262 | ill-formed. */ | |
aa8d51e4 | 5263 | candidates = splice_viable (candidates, false, &any_viable_p); |
f4da5882 | 5264 | if (!any_viable_p) |
8c18e707 | 5265 | { |
ebd21de4 | 5266 | if (complain & tf_error) |
15608833 | 5267 | error_at (loc, "operands to ?: have different types %qT and %qT", |
5268 | arg2_type, arg3_type); | |
8c18e707 | 5269 | return error_mark_node; |
5270 | } | |
66bbeb85 | 5271 | cand = tourney (candidates, complain); |
8c18e707 | 5272 | if (!cand) |
5273 | { | |
ebd21de4 | 5274 | if (complain & tf_error) |
5275 | { | |
bc35ef65 | 5276 | auto_diagnostic_group d; |
1273a0b4 | 5277 | op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE); |
5278 | print_z_candidates (loc, candidates); | |
ebd21de4 | 5279 | } |
8c18e707 | 5280 | return error_mark_node; |
5281 | } | |
5282 | ||
5283 | /* [expr.cond] | |
5284 | ||
5285 | Otherwise, the conversions thus determined are applied, and | |
5286 | the converted operands are used in place of the original | |
5287 | operands for the remainder of this section. */ | |
1611df57 | 5288 | conv = cand->convs[0]; |
ebd21de4 | 5289 | arg1 = convert_like (conv, arg1, complain); |
1611df57 | 5290 | conv = cand->convs[1]; |
ebd21de4 | 5291 | arg2 = convert_like (conv, arg2, complain); |
57ea629b | 5292 | arg2_type = TREE_TYPE (arg2); |
1611df57 | 5293 | conv = cand->convs[2]; |
ebd21de4 | 5294 | arg3 = convert_like (conv, arg3, complain); |
57ea629b | 5295 | arg3_type = TREE_TYPE (arg3); |
8c18e707 | 5296 | } |
5297 | ||
5298 | /* [expr.cond] | |
5299 | ||
5300 | Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_), | |
5301 | and function-to-pointer (_conv.func_) standard conversions are | |
8938fd74 | 5302 | performed on the second and third operands. |
5303 | ||
5304 | We need to force the lvalue-to-rvalue conversion here for class types, | |
5305 | so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues | |
5306 | that isn't wrapped with a TARGET_EXPR plays havoc with exception | |
49babdb3 | 5307 | regions. */ |
8938fd74 | 5308 | |
9e505437 | 5309 | arg2 = force_rvalue (arg2, complain); |
49babdb3 | 5310 | if (!CLASS_TYPE_P (arg2_type)) |
5311 | arg2_type = TREE_TYPE (arg2); | |
8938fd74 | 5312 | |
9e505437 | 5313 | arg3 = force_rvalue (arg3, complain); |
57ea629b | 5314 | if (!CLASS_TYPE_P (arg3_type)) |
49babdb3 | 5315 | arg3_type = TREE_TYPE (arg3); |
8c18e707 | 5316 | |
b93d9a53 | 5317 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5318 | return error_mark_node; | |
9031d10b | 5319 | |
8c18e707 | 5320 | /* [expr.cond] |
9031d10b | 5321 | |
8c18e707 | 5322 | After those conversions, one of the following shall hold: |
5323 | ||
5324 | --The second and third operands have the same type; the result is of | |
5325 | that type. */ | |
5326 | if (same_type_p (arg2_type, arg3_type)) | |
5327 | result_type = arg2_type; | |
5328 | /* [expr.cond] | |
5329 | ||
5330 | --The second and third operands have arithmetic or enumeration | |
5331 | type; the usual arithmetic conversions are performed to bring | |
5332 | them to a common type, and the result is of that type. */ | |
9031d10b | 5333 | else if ((ARITHMETIC_TYPE_P (arg2_type) |
3f00a6c0 | 5334 | || UNSCOPED_ENUM_P (arg2_type)) |
8c18e707 | 5335 | && (ARITHMETIC_TYPE_P (arg3_type) |
3f00a6c0 | 5336 | || UNSCOPED_ENUM_P (arg3_type))) |
8c18e707 | 5337 | { |
5338 | /* In this case, there is always a common type. */ | |
9031d10b | 5339 | result_type = type_after_usual_arithmetic_conversions (arg2_type, |
8c18e707 | 5340 | arg3_type); |
19b271a9 | 5341 | if (complain & tf_warning) |
5342 | do_warn_double_promotion (result_type, arg2_type, arg3_type, | |
4d1eda3a | 5343 | "implicit conversion from %qH to %qI to " |
19b271a9 | 5344 | "match other result of conditional", |
1273a0b4 | 5345 | loc); |
9031d10b | 5346 | |
ced2451b | 5347 | if (TREE_CODE (arg2_type) == ENUMERAL_TYPE |
653e5405 | 5348 | && TREE_CODE (arg3_type) == ENUMERAL_TYPE) |
ebd21de4 | 5349 | { |
d582d140 | 5350 | tree stripped_orig_arg2 = tree_strip_any_location_wrapper (orig_arg2); |
5351 | tree stripped_orig_arg3 = tree_strip_any_location_wrapper (orig_arg3); | |
5352 | if (TREE_CODE (stripped_orig_arg2) == CONST_DECL | |
5353 | && TREE_CODE (stripped_orig_arg3) == CONST_DECL | |
5354 | && (DECL_CONTEXT (stripped_orig_arg2) | |
5355 | == DECL_CONTEXT (stripped_orig_arg3))) | |
c28ddc97 | 5356 | /* Two enumerators from the same enumeration can have different |
5357 | types when the enumeration is still being defined. */; | |
5358 | else if (complain & tf_warning) | |
1273a0b4 | 5359 | warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in " |
5360 | "conditional expression: %qT vs %qT", | |
5361 | arg2_type, arg3_type); | |
ebd21de4 | 5362 | } |
ced2451b | 5363 | else if (extra_warnings |
653e5405 | 5364 | && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE |
5365 | && !same_type_p (arg3_type, type_promotes_to (arg2_type))) | |
5366 | || (TREE_CODE (arg3_type) == ENUMERAL_TYPE | |
1273a0b4 | 5367 | && !same_type_p (arg2_type, |
5368 | type_promotes_to (arg3_type))))) | |
ebd21de4 | 5369 | { |
5370 | if (complain & tf_warning) | |
b26afd90 | 5371 | warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in " |
1273a0b4 | 5372 | "conditional expression"); |
ebd21de4 | 5373 | } |
9031d10b | 5374 | |
ebd21de4 | 5375 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5376 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
8c18e707 | 5377 | } |
5378 | /* [expr.cond] | |
5379 | ||
5380 | --The second and third operands have pointer type, or one has | |
5381 | pointer type and the other is a null pointer constant; pointer | |
5382 | conversions (_conv.ptr_) and qualification conversions | |
5383 | (_conv.qual_) are performed to bring them to their composite | |
5384 | pointer type (_expr.rel_). The result is of the composite | |
5385 | pointer type. | |
5386 | ||
5387 | --The second and third operands have pointer to member type, or | |
5388 | one has pointer to member type and the other is a null pointer | |
5389 | constant; pointer to member conversions (_conv.mem_) and | |
5390 | qualification conversions (_conv.qual_) are performed to bring | |
5391 | them to a common type, whose cv-qualification shall match the | |
5392 | cv-qualification of either the second or the third operand. | |
c0af329c | 5393 | The result is of the common type. */ |
9031d10b | 5394 | else if ((null_ptr_cst_p (arg2) |
05765a91 | 5395 | && TYPE_PTR_OR_PTRMEM_P (arg3_type)) |
9031d10b | 5396 | || (null_ptr_cst_p (arg3) |
05765a91 | 5397 | && TYPE_PTR_OR_PTRMEM_P (arg2_type)) |
8c18e707 | 5398 | || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type)) |
05765a91 | 5399 | || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type)) |
1bc16cab | 5400 | || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type))) |
8c18e707 | 5401 | { |
5402 | result_type = composite_pointer_type (arg2_type, arg3_type, arg2, | |
2f182218 | 5403 | arg3, CPO_CONDITIONAL_EXPR, |
ebd21de4 | 5404 | complain); |
9eb75891 | 5405 | if (result_type == error_mark_node) |
5406 | return error_mark_node; | |
ebd21de4 | 5407 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5408 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
8c18e707 | 5409 | } |
5410 | ||
5411 | if (!result_type) | |
5412 | { | |
ebd21de4 | 5413 | if (complain & tf_error) |
1273a0b4 | 5414 | error_at (loc, "operands to ?: have different types %qT and %qT", |
5415 | arg2_type, arg3_type); | |
8c18e707 | 5416 | return error_mark_node; |
5417 | } | |
5418 | ||
ae260dcc | 5419 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5420 | return error_mark_node; | |
5421 | ||
8c18e707 | 5422 | valid_operands: |
fd03461e | 5423 | if (processing_template_decl && is_glvalue) |
5424 | { | |
5425 | /* Let lvalue_kind know this was a glvalue. */ | |
5426 | tree arg = (result_type == arg2_type ? arg2 : arg3); | |
5427 | result_type = cp_build_reference_type (result_type, xvalue_p (arg)); | |
5428 | } | |
5429 | ||
392f5cc1 | 5430 | result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3); |
70efee89 | 5431 | |
3ef7eab1 | 5432 | /* If the ARG2 and ARG3 are the same and don't have side-effects, |
5433 | warn here, because the COND_EXPR will be turned into ARG2. */ | |
5434 | if (warn_duplicated_branches | |
301c8f8f | 5435 | && (complain & tf_warning) |
3ef7eab1 | 5436 | && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0))) |
5437 | warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches, | |
5438 | "this condition has identical branches"); | |
5439 | ||
974c6fd7 | 5440 | /* We can't use result_type below, as fold might have returned a |
5441 | throw_expr. */ | |
5442 | ||
11a93d7a | 5443 | if (!is_glvalue) |
a4a591f9 | 5444 | { |
5445 | /* Expand both sides into the same slot, hopefully the target of | |
5446 | the ?: expression. We used to check for TARGET_EXPRs here, | |
5447 | but now we sometimes wrap them in NOP_EXPRs so the test would | |
5448 | fail. */ | |
5449 | if (CLASS_TYPE_P (TREE_TYPE (result))) | |
44189c16 | 5450 | result = get_target_expr_sfinae (result, complain); |
a4a591f9 | 5451 | /* If this expression is an rvalue, but might be mistaken for an |
5452 | lvalue, we must add a NON_LVALUE_EXPR. */ | |
5453 | result = rvalue (result); | |
5454 | } | |
07850d16 | 5455 | else |
5456 | result = force_paren_expr (result); | |
8c18e707 | 5457 | |
5458 | return result; | |
5459 | } | |
5460 | ||
6198e8f6 | 5461 | /* Wrapper for above. */ |
5462 | ||
5463 | tree | |
1273a0b4 | 5464 | build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3, |
6198e8f6 | 5465 | tsubst_flags_t complain) |
5466 | { | |
5467 | tree ret; | |
5468 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
1273a0b4 | 5469 | ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain); |
6198e8f6 | 5470 | timevar_cond_stop (TV_OVERLOAD, subtime); |
5471 | return ret; | |
5472 | } | |
5473 | ||
5f6526e1 | 5474 | /* OPERAND is an operand to an expression. Perform necessary steps |
5475 | required before using it. If OPERAND is NULL_TREE, NULL_TREE is | |
5476 | returned. */ | |
5477 | ||
5478 | static tree | |
5479 | prep_operand (tree operand) | |
5480 | { | |
5481 | if (operand) | |
5482 | { | |
5f6526e1 | 5483 | if (CLASS_TYPE_P (TREE_TYPE (operand)) |
5484 | && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand))) | |
5485 | /* Make sure the template type is instantiated now. */ | |
5486 | instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand))); | |
5487 | } | |
5488 | ||
5489 | return operand; | |
5490 | } | |
5491 | ||
84303c41 | 5492 | /* Add each of the viable functions in FNS (a FUNCTION_DECL or |
5493 | OVERLOAD) to the CANDIDATES, returning an updated list of | |
8bd47a90 | 5494 | CANDIDATES. The ARGS are the arguments provided to the call; |
5495 | if FIRST_ARG is non-null it is the implicit object argument, | |
5496 | otherwise the first element of ARGS is used if needed. The | |
f352a3fb | 5497 | EXPLICIT_TARGS are explicit template arguments provided. |
5498 | TEMPLATE_ONLY is true if only template functions should be | |
5499 | considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for | |
5500 | add_function_candidate. */ | |
84303c41 | 5501 | |
8999978b | 5502 | static void |
f1f41a6c | 5503 | add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args, |
8bd47a90 | 5504 | tree return_type, |
c6a06e1f | 5505 | tree explicit_targs, bool template_only, |
84303c41 | 5506 | tree conversion_path, tree access_path, |
5507 | int flags, | |
66bbeb85 | 5508 | struct z_candidate **candidates, |
5509 | tsubst_flags_t complain) | |
84303c41 | 5510 | { |
5511 | tree ctype; | |
f1f41a6c | 5512 | const vec<tree, va_gc> *non_static_args; |
045a1d9e | 5513 | bool check_list_ctor = false; |
5514 | bool check_converting = false; | |
8bd47a90 | 5515 | unification_kind_t strict; |
8bd47a90 | 5516 | |
5517 | if (!fns) | |
5518 | return; | |
5519 | ||
5520 | /* Precalculate special handling of constructors and conversion ops. */ | |
05b229bf | 5521 | tree fn = OVL_FIRST (fns); |
8bd47a90 | 5522 | if (DECL_CONV_FN_P (fn)) |
5523 | { | |
0d836813 | 5524 | check_list_ctor = false; |
045a1d9e | 5525 | check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0; |
6420cb4a | 5526 | if (flags & LOOKUP_NO_CONVERSION) |
5527 | /* We're doing return_type(x). */ | |
5528 | strict = DEDUCE_CONV; | |
5529 | else | |
5530 | /* We're doing x.operator return_type(). */ | |
5531 | strict = DEDUCE_EXACT; | |
8bd47a90 | 5532 | /* [over.match.funcs] For conversion functions, the function |
5533 | is considered to be a member of the class of the implicit | |
5534 | object argument for the purpose of defining the type of | |
5535 | the implicit object parameter. */ | |
18619da5 | 5536 | ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg)); |
8bd47a90 | 5537 | } |
5538 | else | |
5539 | { | |
5540 | if (DECL_CONSTRUCTOR_P (fn)) | |
0d836813 | 5541 | { |
045a1d9e | 5542 | check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0; |
a47f6321 | 5543 | /* For list-initialization we consider explicit constructors |
5544 | and complain if one is chosen. */ | |
5545 | check_converting | |
5546 | = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR)) | |
5547 | == LOOKUP_ONLYCONVERTING); | |
0d836813 | 5548 | } |
8bd47a90 | 5549 | strict = DEDUCE_CALL; |
5550 | ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE; | |
5551 | } | |
84303c41 | 5552 | |
8bd47a90 | 5553 | if (first_arg) |
5554 | non_static_args = args; | |
5555 | else | |
5556 | /* Delay creating the implicit this parameter until it is needed. */ | |
5557 | non_static_args = NULL; | |
84303c41 | 5558 | |
05b229bf | 5559 | for (lkp_iterator iter (fns); iter; ++iter) |
84303c41 | 5560 | { |
05b229bf | 5561 | fn = *iter; |
8bd47a90 | 5562 | |
5563 | if (check_converting && DECL_NONCONVERTING_P (fn)) | |
5564 | continue; | |
0d836813 | 5565 | if (check_list_ctor && !is_list_ctor (fn)) |
5566 | continue; | |
8bd47a90 | 5567 | |
045a1d9e | 5568 | tree fn_first_arg = NULL_TREE; |
5569 | const vec<tree, va_gc> *fn_args = args; | |
5570 | ||
c6a06e1f | 5571 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) |
84303c41 | 5572 | { |
045a1d9e | 5573 | /* Figure out where the object arg comes from. If this |
5574 | function is a non-static member and we didn't get an | |
8bd47a90 | 5575 | implicit object argument, move it out of args. */ |
5576 | if (first_arg == NULL_TREE) | |
f352a3fb | 5577 | { |
5578 | unsigned int ix; | |
5579 | tree arg; | |
f1f41a6c | 5580 | vec<tree, va_gc> *tempvec; |
5581 | vec_alloc (tempvec, args->length () - 1); | |
5582 | for (ix = 1; args->iterate (ix, &arg); ++ix) | |
5583 | tempvec->quick_push (arg); | |
8bd47a90 | 5584 | non_static_args = tempvec; |
18619da5 | 5585 | first_arg = (*args)[0]; |
f352a3fb | 5586 | } |
8bd47a90 | 5587 | |
f352a3fb | 5588 | fn_first_arg = first_arg; |
84303c41 | 5589 | fn_args = non_static_args; |
5590 | } | |
84303c41 | 5591 | |
5592 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
9031d10b | 5593 | add_template_candidate (candidates, |
5594 | fn, | |
8999978b | 5595 | ctype, |
c6a06e1f | 5596 | explicit_targs, |
f352a3fb | 5597 | fn_first_arg, |
8999978b | 5598 | fn_args, |
8bd47a90 | 5599 | return_type, |
8999978b | 5600 | access_path, |
5601 | conversion_path, | |
5602 | flags, | |
66bbeb85 | 5603 | strict, |
5604 | complain); | |
c6a06e1f | 5605 | else if (!template_only) |
8999978b | 5606 | add_function_candidate (candidates, |
5607 | fn, | |
5608 | ctype, | |
f352a3fb | 5609 | fn_first_arg, |
8999978b | 5610 | fn_args, |
5611 | access_path, | |
5612 | conversion_path, | |
66bbeb85 | 5613 | flags, |
070c395b | 5614 | NULL, |
66bbeb85 | 5615 | complain); |
84303c41 | 5616 | } |
84303c41 | 5617 | } |
5618 | ||
06c75b9a | 5619 | /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first, |
5620 | -1 if the RHS is evaluated first, or 0 if the order is unspecified. */ | |
5621 | ||
5622 | static int | |
5623 | op_is_ordered (tree_code code) | |
5624 | { | |
06c75b9a | 5625 | switch (code) |
5626 | { | |
5627 | // 5. b @= a | |
5628 | case MODIFY_EXPR: | |
e59cff35 | 5629 | return (flag_strong_eval_order > 1 ? -1 : 0); |
5630 | ||
5631 | // 6. a[b] | |
5632 | case ARRAY_REF: | |
5633 | return (flag_strong_eval_order > 1 ? 1 : 0); | |
06c75b9a | 5634 | |
5635 | // 1. a.b | |
5636 | // Not overloadable (yet). | |
5637 | // 2. a->b | |
5638 | // Only one argument. | |
5639 | // 3. a->*b | |
5640 | case MEMBER_REF: | |
06c75b9a | 5641 | // 7. a << b |
5642 | case LSHIFT_EXPR: | |
5643 | // 8. a >> b | |
5644 | case RSHIFT_EXPR: | |
e59cff35 | 5645 | return (flag_strong_eval_order ? 1 : 0); |
06c75b9a | 5646 | |
5647 | default: | |
5648 | return 0; | |
5649 | } | |
5650 | } | |
5651 | ||
6198e8f6 | 5652 | static tree |
ef0b0c72 | 5653 | build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1, |
5654 | tree arg2, tree arg3, tree *overload, tsubst_flags_t complain) | |
ec10e4ad | 5655 | { |
5656 | struct z_candidate *candidates = 0, *cand; | |
f1f41a6c | 5657 | vec<tree, va_gc> *arglist; |
84303c41 | 5658 | tree args[3]; |
1611df57 | 5659 | tree result = NULL_TREE; |
5660 | bool result_valid_p = false; | |
ec10e4ad | 5661 | enum tree_code code2 = NOP_EXPR; |
03033af4 | 5662 | enum tree_code code_orig_arg1 = ERROR_MARK; |
5663 | enum tree_code code_orig_arg2 = ERROR_MARK; | |
1611df57 | 5664 | conversion *conv; |
5665 | void *p; | |
f4da5882 | 5666 | bool strict_p; |
5667 | bool any_viable_p; | |
ec10e4ad | 5668 | |
9031d10b | 5669 | if (error_operand_p (arg1) |
5670 | || error_operand_p (arg2) | |
0a3b29ad | 5671 | || error_operand_p (arg3)) |
ec10e4ad | 5672 | return error_mark_node; |
5673 | ||
ca16a224 | 5674 | bool ismodop = code == MODIFY_EXPR; |
5675 | if (ismodop) | |
ec10e4ad | 5676 | { |
5677 | code2 = TREE_CODE (arg3); | |
5678 | arg3 = NULL_TREE; | |
ec10e4ad | 5679 | } |
ca16a224 | 5680 | tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code); |
ec10e4ad | 5681 | |
5f6526e1 | 5682 | arg1 = prep_operand (arg1); |
9031d10b | 5683 | |
ec97fa2d | 5684 | bool memonly = false; |
ec10e4ad | 5685 | switch (code) |
5686 | { | |
5687 | case NEW_EXPR: | |
5688 | case VEC_NEW_EXPR: | |
ec10e4ad | 5689 | case VEC_DELETE_EXPR: |
5690 | case DELETE_EXPR: | |
c0af329c | 5691 | /* Use build_op_new_call and build_op_delete_call instead. */ |
092b1d6f | 5692 | gcc_unreachable (); |
ec10e4ad | 5693 | |
5694 | case CALL_EXPR: | |
f352a3fb | 5695 | /* Use build_op_call instead. */ |
5696 | gcc_unreachable (); | |
d913511e | 5697 | |
b13d1547 | 5698 | case TRUTH_ORIF_EXPR: |
5699 | case TRUTH_ANDIF_EXPR: | |
5700 | case TRUTH_AND_EXPR: | |
5701 | case TRUTH_OR_EXPR: | |
03033af4 | 5702 | /* These are saved for the sake of warn_logical_operator. */ |
5703 | code_orig_arg1 = TREE_CODE (arg1); | |
5704 | code_orig_arg2 = TREE_CODE (arg2); | |
78bf4156 | 5705 | break; |
5706 | case GT_EXPR: | |
5707 | case LT_EXPR: | |
5708 | case GE_EXPR: | |
5709 | case LE_EXPR: | |
5710 | case EQ_EXPR: | |
5711 | case NE_EXPR: | |
5712 | /* These are saved for the sake of maybe_warn_bool_compare. */ | |
5713 | code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1)); | |
5714 | code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2)); | |
5715 | break; | |
ec97fa2d | 5716 | |
5717 | /* =, ->, [], () must be non-static member functions. */ | |
5718 | case MODIFY_EXPR: | |
5719 | if (code2 != NOP_EXPR) | |
5720 | break; | |
e3533433 | 5721 | /* FALLTHRU */ |
ec97fa2d | 5722 | case COMPONENT_REF: |
5723 | case ARRAY_REF: | |
5724 | memonly = true; | |
5725 | break; | |
5726 | ||
d913511e | 5727 | default: |
5728 | break; | |
ec10e4ad | 5729 | } |
5730 | ||
5f6526e1 | 5731 | arg2 = prep_operand (arg2); |
5732 | arg3 = prep_operand (arg3); | |
9031d10b | 5733 | |
3cc0b4b9 | 5734 | if (code == COND_EXPR) |
57ea629b | 5735 | /* Use build_conditional_expr instead. */ |
5736 | gcc_unreachable (); | |
5b97892c | 5737 | else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1)) |
5738 | && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2)))) | |
ec10e4ad | 5739 | goto builtin; |
5740 | ||
5741 | if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR) | |
5742 | arg2 = integer_zero_node; | |
5743 | ||
f1f41a6c | 5744 | vec_alloc (arglist, 3); |
5745 | arglist->quick_push (arg1); | |
f352a3fb | 5746 | if (arg2 != NULL_TREE) |
f1f41a6c | 5747 | arglist->quick_push (arg2); |
f352a3fb | 5748 | if (arg3 != NULL_TREE) |
f1f41a6c | 5749 | arglist->quick_push (arg3); |
ec10e4ad | 5750 | |
1611df57 | 5751 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
5752 | p = conversion_obstack_alloc (0); | |
5753 | ||
84303c41 | 5754 | /* Add namespace-scope operators to the list of functions to |
5755 | consider. */ | |
ec97fa2d | 5756 | if (!memonly) |
a5aae789 | 5757 | { |
5758 | tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0); | |
5759 | fns = lookup_arg_dependent (fnname, fns, arglist); | |
5760 | add_candidates (fns, NULL_TREE, arglist, NULL_TREE, | |
5761 | NULL_TREE, false, NULL_TREE, NULL_TREE, | |
5762 | flags, &candidates, complain); | |
5763 | } | |
4de31f7a | 5764 | |
5765 | args[0] = arg1; | |
5766 | args[1] = arg2; | |
5767 | args[2] = NULL_TREE; | |
5768 | ||
84303c41 | 5769 | /* Add class-member operators to the candidate set. */ |
5770 | if (CLASS_TYPE_P (TREE_TYPE (arg1))) | |
ec10e4ad | 5771 | { |
84303c41 | 5772 | tree fns; |
ec10e4ad | 5773 | |
a6460bf1 | 5774 | fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1); |
7e1381b1 | 5775 | if (fns == error_mark_node) |
1611df57 | 5776 | { |
5777 | result = error_mark_node; | |
5778 | goto user_defined_result_ready; | |
5779 | } | |
84303c41 | 5780 | if (fns) |
8bd47a90 | 5781 | add_candidates (BASELINK_FUNCTIONS (fns), |
5782 | NULL_TREE, arglist, NULL_TREE, | |
c6a06e1f | 5783 | NULL_TREE, false, |
8999978b | 5784 | BASELINK_BINFO (fns), |
8bd47a90 | 5785 | BASELINK_ACCESS_BINFO (fns), |
66bbeb85 | 5786 | flags, &candidates, complain); |
7e1381b1 | 5787 | } |
4de31f7a | 5788 | /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then |
5789 | only non-member functions that have type T1 or reference to | |
5790 | cv-qualified-opt T1 for the first argument, if the first argument | |
5791 | has an enumeration type, or T2 or reference to cv-qualified-opt | |
47ae02b7 | 5792 | T2 for the second argument, if the second argument has an |
4de31f7a | 5793 | enumeration type. Filter out those that don't match. */ |
5794 | else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2))) | |
5795 | { | |
5796 | struct z_candidate **candp, **next; | |
ec10e4ad | 5797 | |
4de31f7a | 5798 | for (candp = &candidates; *candp; candp = next) |
5799 | { | |
5800 | tree parmlist, parmtype; | |
5801 | int i, nargs = (arg2 ? 2 : 1); | |
5802 | ||
5803 | cand = *candp; | |
5804 | next = &cand->next; | |
5805 | ||
5806 | parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn)); | |
5807 | ||
5808 | for (i = 0; i < nargs; ++i) | |
5809 | { | |
5810 | parmtype = TREE_VALUE (parmlist); | |
5811 | ||
90ad495b | 5812 | if (TYPE_REF_P (parmtype)) |
4de31f7a | 5813 | parmtype = TREE_TYPE (parmtype); |
5814 | if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE | |
5815 | && (same_type_ignoring_top_level_qualifiers_p | |
5816 | (TREE_TYPE (args[i]), parmtype))) | |
5817 | break; | |
5818 | ||
5819 | parmlist = TREE_CHAIN (parmlist); | |
5820 | } | |
5821 | ||
5822 | /* No argument has an appropriate type, so remove this | |
5823 | candidate function from the list. */ | |
5824 | if (i == nargs) | |
5825 | { | |
5826 | *candp = cand->next; | |
5827 | next = candp; | |
5828 | } | |
5829 | } | |
5830 | } | |
ec10e4ad | 5831 | |
66bbeb85 | 5832 | add_builtin_candidates (&candidates, code, code2, fnname, args, |
5833 | flags, complain); | |
ec10e4ad | 5834 | |
f3c9db61 | 5835 | switch (code) |
5836 | { | |
5837 | case COMPOUND_EXPR: | |
5838 | case ADDR_EXPR: | |
5839 | /* For these, the built-in candidates set is empty | |
5840 | [over.match.oper]/3. We don't want non-strict matches | |
5841 | because exact matches are always possible with built-in | |
5842 | operators. The built-in candidate set for COMPONENT_REF | |
5843 | would be empty too, but since there are no such built-in | |
5844 | operators, we accept non-strict matches for them. */ | |
f4da5882 | 5845 | strict_p = true; |
f3c9db61 | 5846 | break; |
5847 | ||
5848 | default: | |
aa8d51e4 | 5849 | strict_p = false; |
f3c9db61 | 5850 | break; |
9031d10b | 5851 | } |
f3c9db61 | 5852 | |
f4da5882 | 5853 | candidates = splice_viable (candidates, strict_p, &any_viable_p); |
5854 | if (!any_viable_p) | |
ec10e4ad | 5855 | { |
5856 | switch (code) | |
5857 | { | |
5858 | case POSTINCREMENT_EXPR: | |
5859 | case POSTDECREMENT_EXPR: | |
ebd21de4 | 5860 | /* Don't try anything fancy if we're not allowed to produce |
5861 | errors. */ | |
5862 | if (!(complain & tf_error)) | |
5863 | return error_mark_node; | |
5864 | ||
c77db90c | 5865 | /* Look for an `operator++ (int)'. Pre-1985 C++ didn't |
5866 | distinguish between prefix and postfix ++ and | |
5867 | operator++() was used for both, so we allow this with | |
5868 | -fpermissive. */ | |
c4698a21 | 5869 | else |
c77db90c | 5870 | { |
5871 | const char *msg = (flag_permissive) | |
5872 | ? G_("no %<%D(int)%> declared for postfix %qs," | |
5873 | " trying prefix operator instead") | |
5874 | : G_("no %<%D(int)%> declared for postfix %qs"); | |
ca16a224 | 5875 | permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name); |
c77db90c | 5876 | } |
5877 | ||
5878 | if (!flag_permissive) | |
5879 | return error_mark_node; | |
5880 | ||
ec10e4ad | 5881 | if (code == POSTINCREMENT_EXPR) |
5882 | code = PREINCREMENT_EXPR; | |
5883 | else | |
9031d10b | 5884 | code = PREDECREMENT_EXPR; |
ef0b0c72 | 5885 | result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE, |
5886 | NULL_TREE, overload, complain); | |
1611df57 | 5887 | break; |
5888 | ||
ec10e4ad | 5889 | /* The caller will deal with these. */ |
5890 | case ADDR_EXPR: | |
5891 | case COMPOUND_EXPR: | |
5892 | case COMPONENT_REF: | |
1611df57 | 5893 | result = NULL_TREE; |
5894 | result_valid_p = true; | |
5895 | break; | |
d913511e | 5896 | |
5897 | default: | |
c4698a21 | 5898 | if (complain & tf_error) |
1611df57 | 5899 | { |
a7cc1549 | 5900 | /* If one of the arguments of the operator represents |
5901 | an invalid use of member function pointer, try to report | |
5902 | a meaningful error ... */ | |
5c874cd3 | 5903 | if (invalid_nonstatic_memfn_p (loc, arg1, tf_error) |
5904 | || invalid_nonstatic_memfn_p (loc, arg2, tf_error) | |
5905 | || invalid_nonstatic_memfn_p (loc, arg3, tf_error)) | |
a7cc1549 | 5906 | /* We displayed the error message. */; |
5907 | else | |
5908 | { | |
5909 | /* ... Otherwise, report the more generic | |
5910 | "no matching operator found" error */ | |
bc35ef65 | 5911 | auto_diagnostic_group d; |
ef0b0c72 | 5912 | op_error (loc, code, code2, arg1, arg2, arg3, FALSE); |
5913 | print_z_candidates (loc, candidates); | |
a7cc1549 | 5914 | } |
1611df57 | 5915 | } |
5916 | result = error_mark_node; | |
d913511e | 5917 | break; |
ec10e4ad | 5918 | } |
ec10e4ad | 5919 | } |
1611df57 | 5920 | else |
ec10e4ad | 5921 | { |
66bbeb85 | 5922 | cand = tourney (candidates, complain); |
1611df57 | 5923 | if (cand == 0) |
ec10e4ad | 5924 | { |
c4698a21 | 5925 | if (complain & tf_error) |
1611df57 | 5926 | { |
bc35ef65 | 5927 | auto_diagnostic_group d; |
ef0b0c72 | 5928 | op_error (loc, code, code2, arg1, arg2, arg3, TRUE); |
5929 | print_z_candidates (loc, candidates); | |
1611df57 | 5930 | } |
5931 | result = error_mark_node; | |
ec10e4ad | 5932 | } |
1611df57 | 5933 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL) |
ec10e4ad | 5934 | { |
9951fe5d | 5935 | if (overload) |
5936 | *overload = cand->fn; | |
6ee6550d | 5937 | |
de129274 | 5938 | if (resolve_args (arglist, complain) == NULL) |
98b3f419 | 5939 | result = error_mark_node; |
5940 | else | |
ebd21de4 | 5941 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
d175f019 | 5942 | |
06c75b9a | 5943 | if (trivial_fn_p (cand->fn)) |
5944 | /* There won't be a CALL_EXPR. */; | |
5945 | else if (result && result != error_mark_node) | |
d175f019 | 5946 | { |
06c75b9a | 5947 | tree call = extract_call_expr (result); |
5948 | CALL_EXPR_OPERATOR_SYNTAX (call) = true; | |
5949 | ||
5950 | if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn)) | |
5951 | /* This prevents build_new_function_call from discarding this | |
5952 | function during instantiation of the enclosing template. */ | |
5953 | KOENIG_LOOKUP_P (call) = 1; | |
5954 | ||
5955 | /* Specify evaluation order as per P0145R2. */ | |
5956 | CALL_EXPR_ORDERED_ARGS (call) = false; | |
5957 | switch (op_is_ordered (code)) | |
5958 | { | |
5959 | case -1: | |
5960 | CALL_EXPR_REVERSE_ARGS (call) = true; | |
5961 | break; | |
5962 | ||
5963 | case 1: | |
5964 | CALL_EXPR_ORDERED_ARGS (call) = true; | |
5965 | break; | |
5966 | ||
5967 | default: | |
5968 | break; | |
5969 | } | |
d175f019 | 5970 | } |
1611df57 | 5971 | } |
5972 | else | |
2739960c | 5973 | { |
6c3aae46 | 5974 | /* Give any warnings we noticed during overload resolution. */ |
ebd21de4 | 5975 | if (cand->warnings && (complain & tf_warning)) |
6c3aae46 | 5976 | { |
5977 | struct candidate_warning *w; | |
5978 | for (w = cand->warnings; w; w = w->next) | |
66bbeb85 | 5979 | joust (cand, w->loser, 1, complain); |
6c3aae46 | 5980 | } |
5981 | ||
1611df57 | 5982 | /* Check for comparison of different enum types. */ |
5983 | switch (code) | |
5984 | { | |
5985 | case GT_EXPR: | |
5986 | case LT_EXPR: | |
5987 | case GE_EXPR: | |
5988 | case LE_EXPR: | |
5989 | case EQ_EXPR: | |
5990 | case NE_EXPR: | |
9031d10b | 5991 | if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE |
5992 | && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE | |
1611df57 | 5993 | && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) |
ebd21de4 | 5994 | != TYPE_MAIN_VARIANT (TREE_TYPE (arg2))) |
5995 | && (complain & tf_warning)) | |
1611df57 | 5996 | { |
7c13dce4 | 5997 | warning (OPT_Wenum_compare, |
5998 | "comparison between %q#T and %q#T", | |
653e5405 | 5999 | TREE_TYPE (arg1), TREE_TYPE (arg2)); |
1611df57 | 6000 | } |
6001 | break; | |
6002 | default: | |
6003 | break; | |
6004 | } | |
6005 | ||
6006 | /* We need to strip any leading REF_BIND so that bitfields | |
6007 | don't cause errors. This should not remove any important | |
6008 | conversions, because builtins don't apply to class | |
6009 | objects directly. */ | |
6010 | conv = cand->convs[0]; | |
6011 | if (conv->kind == ck_ref_bind) | |
5ac302b4 | 6012 | conv = next_conversion (conv); |
ebd21de4 | 6013 | arg1 = convert_like (conv, arg1, complain); |
03033af4 | 6014 | |
1611df57 | 6015 | if (arg2) |
6016 | { | |
c28ddc97 | 6017 | conv = cand->convs[1]; |
6018 | if (conv->kind == ck_ref_bind) | |
6019 | conv = next_conversion (conv); | |
6020 | else | |
6021 | arg2 = decay_conversion (arg2, complain); | |
6022 | ||
03033af4 | 6023 | /* We need to call warn_logical_operator before |
c28ddc97 | 6024 | converting arg2 to a boolean_type, but after |
6025 | decaying an enumerator to its value. */ | |
03033af4 | 6026 | if (complain & tf_warning) |
ef0b0c72 | 6027 | warn_logical_operator (loc, code, boolean_type_node, |
9c691dbd | 6028 | code_orig_arg1, arg1, |
6029 | code_orig_arg2, arg2); | |
03033af4 | 6030 | |
ebd21de4 | 6031 | arg2 = convert_like (conv, arg2, complain); |
1611df57 | 6032 | } |
6033 | if (arg3) | |
6034 | { | |
6035 | conv = cand->convs[2]; | |
6036 | if (conv->kind == ck_ref_bind) | |
5ac302b4 | 6037 | conv = next_conversion (conv); |
ebd21de4 | 6038 | arg3 = convert_like (conv, arg3, complain); |
1611df57 | 6039 | } |
b13d1547 | 6040 | |
2739960c | 6041 | } |
6042 | } | |
6043 | ||
1611df57 | 6044 | user_defined_result_ready: |
6045 | ||
6046 | /* Free all the conversions we allocated. */ | |
6047 | obstack_free (&conversion_obstack, p); | |
6048 | ||
6049 | if (result || result_valid_p) | |
6050 | return result; | |
ec10e4ad | 6051 | |
092b1d6f | 6052 | builtin: |
ec10e4ad | 6053 | switch (code) |
6054 | { | |
6055 | case MODIFY_EXPR: | |
22a3f7bd | 6056 | return cp_build_modify_expr (loc, arg1, code2, arg2, complain); |
ec10e4ad | 6057 | |
6058 | case INDIRECT_REF: | |
f08923b3 | 6059 | return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain); |
ec10e4ad | 6060 | |
b13d1547 | 6061 | case TRUTH_ANDIF_EXPR: |
6062 | case TRUTH_ORIF_EXPR: | |
6063 | case TRUTH_AND_EXPR: | |
6064 | case TRUTH_OR_EXPR: | |
1774df35 | 6065 | if (complain & tf_warning) |
6066 | warn_logical_operator (loc, code, boolean_type_node, | |
9c691dbd | 6067 | code_orig_arg1, arg1, |
6068 | code_orig_arg2, arg2); | |
03033af4 | 6069 | /* Fall through. */ |
ec10e4ad | 6070 | case GT_EXPR: |
6071 | case LT_EXPR: | |
6072 | case GE_EXPR: | |
6073 | case LE_EXPR: | |
6074 | case EQ_EXPR: | |
6075 | case NE_EXPR: | |
1774df35 | 6076 | if ((complain & tf_warning) |
6077 | && ((code_orig_arg1 == BOOLEAN_TYPE) | |
6078 | ^ (code_orig_arg2 == BOOLEAN_TYPE))) | |
9c691dbd | 6079 | maybe_warn_bool_compare (loc, code, arg1, arg2); |
6784a472 | 6080 | if (complain & tf_warning && warn_tautological_compare) |
941058d1 | 6081 | warn_tautological_cmp (loc, code, arg1, arg2); |
78bf4156 | 6082 | /* Fall through. */ |
6083 | case PLUS_EXPR: | |
6084 | case MINUS_EXPR: | |
6085 | case MULT_EXPR: | |
6086 | case TRUNC_DIV_EXPR: | |
ec10e4ad | 6087 | case MAX_EXPR: |
6088 | case MIN_EXPR: | |
6089 | case LSHIFT_EXPR: | |
6090 | case RSHIFT_EXPR: | |
6091 | case TRUNC_MOD_EXPR: | |
6092 | case BIT_AND_EXPR: | |
6093 | case BIT_IOR_EXPR: | |
6094 | case BIT_XOR_EXPR: | |
6029659c | 6095 | return cp_build_binary_op (loc, code, arg1, arg2, complain); |
ec10e4ad | 6096 | |
97d541d5 | 6097 | case UNARY_PLUS_EXPR: |
ec10e4ad | 6098 | case NEGATE_EXPR: |
6099 | case BIT_NOT_EXPR: | |
6100 | case TRUTH_NOT_EXPR: | |
6101 | case PREINCREMENT_EXPR: | |
6102 | case POSTINCREMENT_EXPR: | |
6103 | case PREDECREMENT_EXPR: | |
6104 | case POSTDECREMENT_EXPR: | |
c4a8ac95 | 6105 | case REALPART_EXPR: |
6106 | case IMAGPART_EXPR: | |
8099ed26 | 6107 | case ABS_EXPR: |
ebd21de4 | 6108 | return cp_build_unary_op (code, arg1, candidates != 0, complain); |
ec10e4ad | 6109 | |
6110 | case ARRAY_REF: | |
1d291991 | 6111 | return cp_build_array_ref (input_location, arg1, arg2, complain); |
ec10e4ad | 6112 | |
ec10e4ad | 6113 | case MEMBER_REF: |
7354ad2e | 6114 | return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR, |
ebd21de4 | 6115 | complain), |
4405c1ad | 6116 | arg2, complain); |
ec10e4ad | 6117 | |
6118 | /* The caller will deal with these. */ | |
6119 | case ADDR_EXPR: | |
6120 | case COMPONENT_REF: | |
6121 | case COMPOUND_EXPR: | |
6122 | return NULL_TREE; | |
6123 | ||
6124 | default: | |
092b1d6f | 6125 | gcc_unreachable (); |
ec10e4ad | 6126 | } |
092b1d6f | 6127 | return NULL_TREE; |
ec10e4ad | 6128 | } |
6129 | ||
6198e8f6 | 6130 | /* Wrapper for above. */ |
6131 | ||
6132 | tree | |
ef0b0c72 | 6133 | build_new_op (location_t loc, enum tree_code code, int flags, |
6134 | tree arg1, tree arg2, tree arg3, | |
9951fe5d | 6135 | tree *overload, tsubst_flags_t complain) |
6198e8f6 | 6136 | { |
6137 | tree ret; | |
6138 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
ef0b0c72 | 6139 | ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3, |
6140 | overload, complain); | |
6198e8f6 | 6141 | timevar_cond_stop (TV_OVERLOAD, subtime); |
6142 | return ret; | |
6143 | } | |
6144 | ||
06c75b9a | 6145 | /* CALL was returned by some call-building function; extract the actual |
6146 | CALL_EXPR from any bits that have been tacked on, e.g. by | |
6147 | convert_from_reference. */ | |
6148 | ||
6149 | tree | |
6150 | extract_call_expr (tree call) | |
6151 | { | |
6152 | while (TREE_CODE (call) == COMPOUND_EXPR) | |
6153 | call = TREE_OPERAND (call, 1); | |
6154 | if (REFERENCE_REF_P (call)) | |
6155 | call = TREE_OPERAND (call, 0); | |
6156 | if (TREE_CODE (call) == TARGET_EXPR) | |
6157 | call = TARGET_EXPR_INITIAL (call); | |
6158 | gcc_assert (TREE_CODE (call) == CALL_EXPR | |
6159 | || TREE_CODE (call) == AGGR_INIT_EXPR | |
6160 | || call == error_mark_node); | |
6161 | return call; | |
6162 | } | |
6163 | ||
710f2626 | 6164 | /* Returns true if FN has two parameters, of which the second has type |
6165 | size_t. */ | |
6166 | ||
6167 | static bool | |
6168 | second_parm_is_size_t (tree fn) | |
6169 | { | |
6170 | tree t = FUNCTION_ARG_CHAIN (fn); | |
db8ffb40 | 6171 | if (!t || !same_type_p (TREE_VALUE (t), size_type_node)) |
6172 | return false; | |
6173 | t = TREE_CHAIN (t); | |
6174 | if (t == void_list_node) | |
6175 | return true; | |
98aa0f57 | 6176 | if (aligned_new_threshold && t |
db8ffb40 | 6177 | && same_type_p (TREE_VALUE (t), align_type_node) |
6178 | && TREE_CHAIN (t) == void_list_node) | |
6179 | return true; | |
6180 | return false; | |
6181 | } | |
6182 | ||
6183 | /* True if T, an allocation function, has std::align_val_t as its second | |
6184 | argument. */ | |
6185 | ||
6186 | bool | |
6187 | aligned_allocation_fn_p (tree t) | |
6188 | { | |
98aa0f57 | 6189 | if (!aligned_new_threshold) |
db8ffb40 | 6190 | return false; |
6191 | ||
6192 | tree a = FUNCTION_ARG_CHAIN (t); | |
6193 | return (a && same_type_p (TREE_VALUE (a), align_type_node)); | |
6194 | } | |
6195 | ||
76b94d4b | 6196 | /* True if T is std::destroying_delete_t. */ |
6197 | ||
6198 | static bool | |
6199 | std_destroying_delete_t_p (tree t) | |
6200 | { | |
6201 | return (TYPE_CONTEXT (t) == std_node | |
6202 | && id_equal (TYPE_IDENTIFIER (t), "destroying_delete_t")); | |
6203 | } | |
6204 | ||
6205 | /* A deallocation function with at least two parameters whose second parameter | |
6206 | type is of type std::destroying_delete_t is a destroying operator delete. A | |
6207 | destroying operator delete shall be a class member function named operator | |
6208 | delete. [ Note: Array deletion cannot use a destroying operator | |
6209 | delete. --end note ] */ | |
6210 | ||
6211 | tree | |
6212 | destroying_delete_p (tree t) | |
6213 | { | |
6214 | tree a = TYPE_ARG_TYPES (TREE_TYPE (t)); | |
6215 | if (!a || !TREE_CHAIN (a)) | |
6216 | return NULL_TREE; | |
6217 | tree type = TREE_VALUE (TREE_CHAIN (a)); | |
6218 | return std_destroying_delete_t_p (type) ? type : NULL_TREE; | |
6219 | } | |
6220 | ||
db8ffb40 | 6221 | /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation |
6222 | function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of | |
6223 | std::align_val_t. */ | |
6224 | ||
6225 | static bool | |
6226 | aligned_deallocation_fn_p (tree t) | |
6227 | { | |
98aa0f57 | 6228 | if (!aligned_new_threshold) |
db8ffb40 | 6229 | return false; |
6230 | ||
6231 | /* A template instance is never a usual deallocation function, | |
6232 | regardless of its signature. */ | |
6233 | if (TREE_CODE (t) == TEMPLATE_DECL | |
681f91a5 | 6234 | || primary_template_specialization_p (t)) |
db8ffb40 | 6235 | return false; |
6236 | ||
6237 | tree a = FUNCTION_ARG_CHAIN (t); | |
76b94d4b | 6238 | if (destroying_delete_p (t)) |
6239 | a = TREE_CHAIN (a); | |
db8ffb40 | 6240 | if (same_type_p (TREE_VALUE (a), align_type_node) |
6241 | && TREE_CHAIN (a) == void_list_node) | |
6242 | return true; | |
6243 | if (!same_type_p (TREE_VALUE (a), size_type_node)) | |
6244 | return false; | |
6245 | a = TREE_CHAIN (a); | |
6246 | if (a && same_type_p (TREE_VALUE (a), align_type_node) | |
6247 | && TREE_CHAIN (a) == void_list_node) | |
6248 | return true; | |
6249 | return false; | |
710f2626 | 6250 | } |
6251 | ||
2c45a868 | 6252 | /* Returns true iff T, an element of an OVERLOAD chain, is a usual |
6253 | deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */ | |
6254 | ||
d1856d2c | 6255 | bool |
db8ffb40 | 6256 | usual_deallocation_fn_p (tree t) |
2c45a868 | 6257 | { |
6258 | /* A template instance is never a usual deallocation function, | |
6259 | regardless of its signature. */ | |
6260 | if (TREE_CODE (t) == TEMPLATE_DECL | |
681f91a5 | 6261 | || primary_template_specialization_p (t)) |
2c45a868 | 6262 | return false; |
6263 | ||
6264 | /* If a class T has a member deallocation function named operator delete | |
6265 | with exactly one parameter, then that function is a usual | |
6266 | (non-placement) deallocation function. If class T does not declare | |
6267 | such an operator delete but does declare a member deallocation | |
6268 | function named operator delete with exactly two parameters, the second | |
6269 | of which has type std::size_t (18.2), then this function is a usual | |
6270 | deallocation function. */ | |
d1856d2c | 6271 | bool global = DECL_NAMESPACE_SCOPE_P (t); |
db8ffb40 | 6272 | tree chain = FUNCTION_ARG_CHAIN (t); |
6273 | if (!chain) | |
6274 | return false; | |
76b94d4b | 6275 | if (destroying_delete_p (t)) |
6276 | chain = TREE_CHAIN (chain); | |
db8ffb40 | 6277 | if (chain == void_list_node |
710f2626 | 6278 | || ((!global || flag_sized_deallocation) |
6279 | && second_parm_is_size_t (t))) | |
2c45a868 | 6280 | return true; |
db8ffb40 | 6281 | if (aligned_deallocation_fn_p (t)) |
6282 | return true; | |
2c45a868 | 6283 | return false; |
6284 | } | |
6285 | ||
fa000d3a | 6286 | /* Build a call to operator delete. This has to be handled very specially, |
6287 | because the restrictions on what signatures match are different from all | |
6288 | other call instances. For a normal delete, only a delete taking (void *) | |
6289 | or (void *, size_t) is accepted. For a placement delete, only an exact | |
6290 | match with the placement new is accepted. | |
6291 | ||
6292 | CODE is either DELETE_EXPR or VEC_DELETE_EXPR. | |
46261ada | 6293 | ADDR is the pointer to be deleted. |
fa000d3a | 6294 | SIZE is the size of the memory block to be deleted. |
1611df57 | 6295 | GLOBAL_P is true if the delete-expression should not consider |
6296 | class-specific delete operators. | |
393f878f | 6297 | PLACEMENT is the corresponding placement new call, or NULL_TREE. |
62116ec3 | 6298 | |
6299 | If this call to "operator delete" is being generated as part to | |
6300 | deallocate memory allocated via a new-expression (as per [expr.new] | |
6301 | which requires that if the initialization throws an exception then | |
6302 | we call a deallocation function), then ALLOC_FN is the allocation | |
6303 | function. */ | |
fa000d3a | 6304 | |
6305 | tree | |
eda6e89c | 6306 | build_op_delete_call (enum tree_code code, tree addr, tree size, |
393f878f | 6307 | bool global_p, tree placement, |
c4698a21 | 6308 | tree alloc_fn, tsubst_flags_t complain) |
fa000d3a | 6309 | { |
97b330ca | 6310 | tree fn = NULL_TREE; |
2c45a868 | 6311 | tree fns, fnname, type, t; |
fa000d3a | 6312 | |
6313 | if (addr == error_mark_node) | |
6314 | return error_mark_node; | |
6315 | ||
22c5b048 | 6316 | type = strip_array_types (TREE_TYPE (TREE_TYPE (addr))); |
24f9a660 | 6317 | |
ca16a224 | 6318 | fnname = ovl_op_identifier (false, code); |
fa000d3a | 6319 | |
9031d10b | 6320 | if (CLASS_TYPE_P (type) |
53e6e9ec | 6321 | && COMPLETE_TYPE_P (complete_type (type)) |
6322 | && !global_p) | |
7e1381b1 | 6323 | /* In [class.free] |
6324 | ||
6325 | If the result of the lookup is ambiguous or inaccessible, or if | |
6326 | the lookup selects a placement deallocation function, the | |
6327 | program is ill-formed. | |
9031d10b | 6328 | |
63eff20d | 6329 | Therefore, we ask lookup_fnfields to complain about ambiguity. */ |
7e1381b1 | 6330 | { |
6331 | fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1); | |
6332 | if (fns == error_mark_node) | |
6333 | return error_mark_node; | |
6334 | } | |
fa000d3a | 6335 | else |
6336 | fns = NULL_TREE; | |
6337 | ||
dedc700f | 6338 | if (fns == NULL_TREE) |
fa000d3a | 6339 | fns = lookup_name_nonclass (fnname); |
6340 | ||
d01f58f9 | 6341 | /* Strip const and volatile from addr. */ |
76b94d4b | 6342 | tree oaddr = addr; |
c4698a21 | 6343 | addr = cp_convert (ptr_type_node, addr, complain); |
d01f58f9 | 6344 | |
fa000d3a | 6345 | if (placement) |
6346 | { | |
2c45a868 | 6347 | /* "A declaration of a placement deallocation function matches the |
6348 | declaration of a placement allocation function if it has the same | |
6349 | number of parameters and, after parameter transformations (8.3.5), | |
6350 | all parameter types except the first are identical." | |
6351 | ||
6352 | So we build up the function type we want and ask instantiate_type | |
6353 | to get it for us. */ | |
6354 | t = FUNCTION_ARG_CHAIN (alloc_fn); | |
6355 | t = tree_cons (NULL_TREE, ptr_type_node, t); | |
6356 | t = build_function_type (void_type_node, t); | |
6357 | ||
6358 | fn = instantiate_type (t, fns, tf_none); | |
6359 | if (fn == error_mark_node) | |
6360 | return NULL_TREE; | |
49603c0f | 6361 | |
05b229bf | 6362 | fn = MAYBE_BASELINK_FUNCTIONS (fn); |
49603c0f | 6363 | |
2c45a868 | 6364 | /* "If the lookup finds the two-parameter form of a usual deallocation |
6365 | function (3.7.4.2) and that function, considered as a placement | |
6366 | deallocation function, would have been selected as a match for the | |
6367 | allocation function, the program is ill-formed." */ | |
710f2626 | 6368 | if (second_parm_is_size_t (fn)) |
0b2fe6d2 | 6369 | { |
7385b605 | 6370 | const char *const msg1 |
710f2626 | 6371 | = G_("exception cleanup for this placement new selects " |
6372 | "non-placement operator delete"); | |
7385b605 | 6373 | const char *const msg2 |
66ed189d | 6374 | = G_("%qD is a usual (non-placement) deallocation " |
710f2626 | 6375 | "function in C++14 (or with -fsized-deallocation)"); |
6376 | ||
ab5826e6 | 6377 | /* But if the class has an operator delete (void *), then that is |
6378 | the usual deallocation function, so we shouldn't complain | |
6379 | about using the operator delete (void *, size_t). */ | |
710f2626 | 6380 | if (DECL_CLASS_SCOPE_P (fn)) |
05b229bf | 6381 | for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); |
6382 | iter; ++iter) | |
710f2626 | 6383 | { |
05b229bf | 6384 | tree elt = *iter; |
db8ffb40 | 6385 | if (usual_deallocation_fn_p (elt) |
710f2626 | 6386 | && FUNCTION_ARG_CHAIN (elt) == void_list_node) |
6387 | goto ok; | |
6388 | } | |
6389 | /* Before C++14 a two-parameter global deallocation function is | |
6390 | always a placement deallocation function, but warn if | |
6391 | -Wc++14-compat. */ | |
6392 | else if (!flag_sized_deallocation) | |
ab5826e6 | 6393 | { |
bc35ef65 | 6394 | if (complain & tf_warning) |
6395 | { | |
6396 | auto_diagnostic_group d; | |
6397 | if (warning (OPT_Wc__14_compat, msg1)) | |
6398 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); | |
6399 | } | |
710f2626 | 6400 | goto ok; |
ab5826e6 | 6401 | } |
710f2626 | 6402 | |
6403 | if (complain & tf_warning_or_error) | |
c4698a21 | 6404 | { |
bc35ef65 | 6405 | auto_diagnostic_group d; |
710f2626 | 6406 | if (permerror (input_location, msg1)) |
6407 | { | |
6408 | /* Only mention C++14 for namespace-scope delete. */ | |
6409 | if (DECL_NAMESPACE_SCOPE_P (fn)) | |
66ed189d | 6410 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); |
710f2626 | 6411 | else |
66ed189d | 6412 | inform (DECL_SOURCE_LOCATION (fn), |
6413 | "%qD is a usual (non-placement) deallocation " | |
710f2626 | 6414 | "function", fn); |
6415 | } | |
c4698a21 | 6416 | } |
6417 | else | |
6418 | return error_mark_node; | |
ab5826e6 | 6419 | ok:; |
0b2fe6d2 | 6420 | } |
49603c0f | 6421 | } |
2c45a868 | 6422 | else |
6423 | /* "Any non-placement deallocation function matches a non-placement | |
6424 | allocation function. If the lookup finds a single matching | |
6425 | deallocation function, that function will be called; otherwise, no | |
6426 | deallocation function will be called." */ | |
05b229bf | 6427 | for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter) |
2c45a868 | 6428 | { |
05b229bf | 6429 | tree elt = *iter; |
db8ffb40 | 6430 | if (usual_deallocation_fn_p (elt)) |
2c45a868 | 6431 | { |
db8ffb40 | 6432 | if (!fn) |
d1856d2c | 6433 | { |
db8ffb40 | 6434 | fn = elt; |
6435 | continue; | |
d1856d2c | 6436 | } |
db8ffb40 | 6437 | |
6438 | /* -- If the type has new-extended alignment, a function with a | |
6439 | parameter of type std::align_val_t is preferred; otherwise a | |
6440 | function without such a parameter is preferred. If exactly one | |
6441 | preferred function is found, that function is selected and the | |
6442 | selection process terminates. If more than one preferred | |
6443 | function is found, all non-preferred functions are eliminated | |
6444 | from further consideration. */ | |
98aa0f57 | 6445 | if (aligned_new_threshold) |
db8ffb40 | 6446 | { |
6447 | bool want_align = type_has_new_extended_alignment (type); | |
6448 | bool fn_align = aligned_deallocation_fn_p (fn); | |
6449 | bool elt_align = aligned_deallocation_fn_p (elt); | |
6450 | ||
6451 | if (elt_align != fn_align) | |
6452 | { | |
6453 | if (want_align == elt_align) | |
6454 | fn = elt; | |
6455 | continue; | |
6456 | } | |
6457 | } | |
6458 | ||
6459 | /* -- If the deallocation functions have class scope, the one | |
6460 | without a parameter of type std::size_t is selected. */ | |
6461 | bool want_size; | |
6462 | if (DECL_CLASS_SCOPE_P (fn)) | |
6463 | want_size = false; | |
6464 | ||
6465 | /* -- If the type is complete and if, for the second alternative | |
6466 | (delete array) only, the operand is a pointer to a class type | |
6467 | with a non-trivial destructor or a (possibly multi-dimensional) | |
6468 | array thereof, the function with a parameter of type std::size_t | |
6469 | is selected. | |
6470 | ||
6471 | -- Otherwise, it is unspecified whether a deallocation function | |
6472 | with a parameter of type std::size_t is selected. */ | |
d1856d2c | 6473 | else |
6474 | { | |
db8ffb40 | 6475 | want_size = COMPLETE_TYPE_P (type); |
d1856d2c | 6476 | if (code == VEC_DELETE_EXPR |
6477 | && !TYPE_VEC_NEW_USES_COOKIE (type)) | |
6478 | /* We need a cookie to determine the array size. */ | |
6479 | want_size = false; | |
d1856d2c | 6480 | } |
db8ffb40 | 6481 | bool fn_size = second_parm_is_size_t (fn); |
6482 | bool elt_size = second_parm_is_size_t (elt); | |
6483 | gcc_assert (fn_size != elt_size); | |
6484 | if (want_size == elt_size) | |
6485 | fn = elt; | |
2c45a868 | 6486 | } |
6487 | } | |
49603c0f | 6488 | |
6489 | /* If we have a matching function, call it. */ | |
6490 | if (fn) | |
6491 | { | |
2c45a868 | 6492 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); |
49603c0f | 6493 | |
6494 | /* If the FN is a member function, make sure that it is | |
6495 | accessible. */ | |
2c45a868 | 6496 | if (BASELINK_P (fns)) |
eb833cbe | 6497 | perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn, |
6498 | complain); | |
49603c0f | 6499 | |
57811700 | 6500 | /* Core issue 901: It's ok to new a type with deleted delete. */ |
6501 | if (DECL_DELETED_FN (fn) && alloc_fn) | |
6502 | return NULL_TREE; | |
6503 | ||
9aa757df | 6504 | if (placement) |
6505 | { | |
6506 | /* The placement args might not be suitable for overload | |
6507 | resolution at this point, so build the call directly. */ | |
d01f58f9 | 6508 | int nargs = call_expr_nargs (placement); |
fd70b918 | 6509 | tree *argarray = XALLOCAVEC (tree, nargs); |
d01f58f9 | 6510 | int i; |
6511 | argarray[0] = addr; | |
6512 | for (i = 1; i < nargs; i++) | |
6513 | argarray[i] = CALL_EXPR_ARG (placement, i); | |
4430f688 | 6514 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
6515 | return error_mark_node; | |
14376b10 | 6516 | return build_cxx_call (fn, nargs, argarray, complain); |
9aa757df | 6517 | } |
6518 | else | |
d01f58f9 | 6519 | { |
76b94d4b | 6520 | tree destroying = destroying_delete_p (fn); |
6521 | if (destroying) | |
6522 | { | |
6523 | /* Strip const and volatile from addr but retain the type of the | |
6524 | object. */ | |
6525 | tree rtype = TREE_TYPE (TREE_TYPE (oaddr)); | |
6526 | rtype = cv_unqualified (rtype); | |
6527 | rtype = TYPE_POINTER_TO (rtype); | |
6528 | addr = cp_convert (rtype, oaddr, complain); | |
6529 | destroying = build_functional_cast (destroying, NULL_TREE, | |
6530 | complain); | |
6531 | } | |
6532 | ||
f352a3fb | 6533 | tree ret; |
ba1dc756 | 6534 | vec<tree, va_gc> *args = make_tree_vector (); |
f1f41a6c | 6535 | args->quick_push (addr); |
76b94d4b | 6536 | if (destroying) |
6537 | args->quick_push (destroying); | |
db8ffb40 | 6538 | if (second_parm_is_size_t (fn)) |
f1f41a6c | 6539 | args->quick_push (size); |
db8ffb40 | 6540 | if (aligned_deallocation_fn_p (fn)) |
6541 | { | |
6542 | tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type)); | |
6543 | args->quick_push (al); | |
6544 | } | |
c4698a21 | 6545 | ret = cp_build_function_call_vec (fn, &args, complain); |
ba1dc756 | 6546 | release_tree_vector (args); |
f352a3fb | 6547 | return ret; |
d01f58f9 | 6548 | } |
dedc700f | 6549 | } |
6550 | ||
62116ec3 | 6551 | /* [expr.new] |
6552 | ||
6553 | If no unambiguous matching deallocation function can be found, | |
6554 | propagating the exception does not cause the object's memory to | |
6555 | be freed. */ | |
6556 | if (alloc_fn) | |
6557 | { | |
c4698a21 | 6558 | if ((complain & tf_warning) |
6559 | && !placement) | |
140beb32 | 6560 | warning (0, "no corresponding deallocation function for %qD", |
62116ec3 | 6561 | alloc_fn); |
6562 | return NULL_TREE; | |
6563 | } | |
fa000d3a | 6564 | |
c4698a21 | 6565 | if (complain & tf_error) |
6566 | error ("no suitable %<operator %s%> for %qT", | |
ca16a224 | 6567 | OVL_OP_INFO (false, code)->name, type); |
fa000d3a | 6568 | return error_mark_node; |
6569 | } | |
6570 | ||
2570bfd8 | 6571 | /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL |
6572 | in the diagnostics. | |
6573 | ||
6574 | If ISSUE_ERROR is true, then issue an error about the | |
6575 | access, followed by a note showing the declaration. | |
6576 | Otherwise, just show the note. */ | |
6577 | ||
6578 | void | |
6579 | complain_about_access (tree decl, tree diag_decl, bool issue_error) | |
6580 | { | |
6581 | if (TREE_PRIVATE (decl)) | |
6582 | { | |
6583 | if (issue_error) | |
6584 | error ("%q#D is private within this context", diag_decl); | |
6585 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6586 | "declared private here"); | |
6587 | } | |
6588 | else if (TREE_PROTECTED (decl)) | |
6589 | { | |
6590 | if (issue_error) | |
6591 | error ("%q#D is protected within this context", diag_decl); | |
6592 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6593 | "declared protected here"); | |
6594 | } | |
6595 | else | |
6596 | { | |
6597 | if (issue_error) | |
6598 | error ("%q#D is inaccessible within this context", diag_decl); | |
6599 | inform (DECL_SOURCE_LOCATION (diag_decl), "declared here"); | |
6600 | } | |
6601 | } | |
6602 | ||
c7818485 | 6603 | /* If the current scope isn't allowed to access DECL along |
b90e9c68 | 6604 | BASETYPE_PATH, give an error. The most derived class in |
579bb663 | 6605 | BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is |
6606 | the declaration to use in the error diagnostic. */ | |
fa000d3a | 6607 | |
eda6e89c | 6608 | bool |
eb833cbe | 6609 | enforce_access (tree basetype_path, tree decl, tree diag_decl, |
8134a948 | 6610 | tsubst_flags_t complain, access_failure_info *afi) |
ec10e4ad | 6611 | { |
b4df430b | 6612 | gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO); |
9031d10b | 6613 | |
7896267d | 6614 | if (flag_new_inheriting_ctors |
6615 | && DECL_INHERITED_CTOR (decl)) | |
6616 | { | |
6617 | /* 7.3.3/18: The additional constructors are accessible if they would be | |
6618 | accessible when used to construct an object of the corresponding base | |
6619 | class. */ | |
6620 | decl = strip_inheriting_ctors (decl); | |
d0ff7ded | 6621 | basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl), |
6622 | ba_any, NULL, complain); | |
7896267d | 6623 | } |
6624 | ||
ada40935 | 6625 | if (!accessible_p (basetype_path, decl, true)) |
ec10e4ad | 6626 | { |
2570bfd8 | 6627 | if (flag_new_inheriting_ctors) |
6628 | diag_decl = strip_inheriting_ctors (diag_decl); | |
eb833cbe | 6629 | if (complain & tf_error) |
2570bfd8 | 6630 | complain_about_access (decl, diag_decl, true); |
6631 | if (afi) | |
6632 | afi->record_access_failure (basetype_path, decl, diag_decl); | |
eda6e89c | 6633 | return false; |
ec10e4ad | 6634 | } |
b90e9c68 | 6635 | |
eda6e89c | 6636 | return true; |
ec10e4ad | 6637 | } |
6638 | ||
41f2d08e | 6639 | /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a |
6640 | bitwise or of LOOKUP_* values. If any errors are warnings are | |
6641 | generated, set *DIAGNOSTIC_FN to "error" or "warning", | |
6642 | respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN | |
6643 | to NULL. */ | |
6644 | ||
6645 | static tree | |
9031d10b | 6646 | build_temp (tree expr, tree type, int flags, |
1b410098 | 6647 | diagnostic_t *diagnostic_kind, tsubst_flags_t complain) |
41f2d08e | 6648 | { |
6649 | int savew, savee; | |
f1f41a6c | 6650 | vec<tree, va_gc> *args; |
9031d10b | 6651 | |
ceab25e5 | 6652 | *diagnostic_kind = DK_UNSPECIFIED; |
6653 | ||
ceab25e5 | 6654 | /* If the source is a packed field, calling the copy constructor will require |
6655 | binding the field to the reference parameter to the copy constructor, and | |
6656 | we'll end up with an infinite loop. If we can use a bitwise copy, then | |
6657 | do that now. */ | |
6658 | if ((lvalue_kind (expr) & clk_packed) | |
6659 | && CLASS_TYPE_P (TREE_TYPE (expr)) | |
6660 | && !type_has_nontrivial_copy_init (TREE_TYPE (expr))) | |
6661 | return get_target_expr_sfinae (expr, complain); | |
6662 | ||
d9d1b0a4 | 6663 | savew = warningcount + werrorcount, savee = errorcount; |
f352a3fb | 6664 | args = make_tree_vector_single (expr); |
6665 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
1b410098 | 6666 | &args, type, flags, complain); |
f352a3fb | 6667 | release_tree_vector (args); |
d9d1b0a4 | 6668 | if (warningcount + werrorcount > savew) |
a52d5726 | 6669 | *diagnostic_kind = DK_WARNING; |
41f2d08e | 6670 | else if (errorcount > savee) |
a52d5726 | 6671 | *diagnostic_kind = DK_ERROR; |
41f2d08e | 6672 | return expr; |
6673 | } | |
9031d10b | 6674 | |
59dd8856 | 6675 | /* Perform warnings about peculiar, but valid, conversions from/to NULL. |
4c0f6781 | 6676 | Also handle a subset of zero as null warnings. |
59dd8856 | 6677 | EXPR is implicitly converted to type TOTYPE. |
d44eb2e3 | 6678 | FN and ARGNUM are used for diagnostics. */ |
6679 | ||
6680 | static void | |
59dd8856 | 6681 | conversion_null_warnings (tree totype, tree expr, tree fn, int argnum) |
d44eb2e3 | 6682 | { |
d44eb2e3 | 6683 | /* Issue warnings about peculiar, but valid, uses of NULL. */ |
d76863c8 | 6684 | if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE |
2b8cebd8 | 6685 | && ARITHMETIC_TYPE_P (totype)) |
d44eb2e3 | 6686 | { |
9683081b | 6687 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
6688 | loc = expansion_point_location_if_in_system_header (loc); | |
d44eb2e3 | 6689 | if (fn) |
9683081b | 6690 | { |
6691 | auto_diagnostic_group d; | |
6692 | if (warning_at (loc, OPT_Wconversion_null, | |
6693 | "passing NULL to non-pointer argument %P of %qD", | |
6694 | argnum, fn)) | |
6695 | inform (get_fndecl_argument_location (fn, argnum), | |
6696 | " declared here"); | |
6697 | } | |
d44eb2e3 | 6698 | else |
db30b351 | 6699 | warning_at (loc, OPT_Wconversion_null, |
2b8cebd8 | 6700 | "converting to non-pointer type %qT from NULL", totype); |
d44eb2e3 | 6701 | } |
6702 | ||
d44eb2e3 | 6703 | /* Issue warnings if "false" is converted to a NULL pointer */ |
ff84b8d6 | 6704 | else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE |
6705 | && TYPE_PTR_P (totype)) | |
822dd80c | 6706 | { |
9683081b | 6707 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
822dd80c | 6708 | if (fn) |
9683081b | 6709 | { |
6710 | auto_diagnostic_group d; | |
6711 | if (warning_at (loc, OPT_Wconversion_null, | |
6712 | "converting %<false%> to pointer type for argument " | |
6713 | "%P of %qD", argnum, fn)) | |
6714 | inform (get_fndecl_argument_location (fn, argnum), | |
6715 | " declared here"); | |
6716 | } | |
822dd80c | 6717 | else |
9683081b | 6718 | warning_at (loc, OPT_Wconversion_null, |
2b8cebd8 | 6719 | "converting %<false%> to pointer type %qT", totype); |
822dd80c | 6720 | } |
4c0f6781 | 6721 | /* Handle zero as null pointer warnings for cases other |
6722 | than EQ_EXPR and NE_EXPR */ | |
6723 | else if (null_ptr_cst_p (expr) && | |
6724 | (TYPE_PTR_OR_PTRMEM_P (totype) || NULLPTR_TYPE_P (totype))) | |
6725 | { | |
be1e7283 | 6726 | location_t loc = |
4c0f6781 | 6727 | expansion_point_location_if_in_system_header (input_location); |
6728 | maybe_warn_zero_as_null_pointer_constant (expr, loc); | |
6729 | } | |
d44eb2e3 | 6730 | } |
41f2d08e | 6731 | |
2371bf7c | 6732 | /* We gave a diagnostic during a conversion. If this was in the second |
6733 | standard conversion sequence of a user-defined conversion sequence, say | |
6734 | which user-defined conversion. */ | |
6735 | ||
6736 | static void | |
6737 | maybe_print_user_conv_context (conversion *convs) | |
6738 | { | |
6739 | if (convs->user_conv_p) | |
6740 | for (conversion *t = convs; t; t = next_conversion (t)) | |
6741 | if (t->kind == ck_user) | |
6742 | { | |
6743 | print_z_candidate (0, " after user-defined conversion:", | |
6744 | t->cand); | |
6745 | break; | |
6746 | } | |
6747 | } | |
6748 | ||
5d78d423 | 6749 | /* Locate the parameter with the given index within FNDECL. |
6750 | ARGNUM is zero based, -1 indicates the `this' argument of a method. | |
6751 | Return the location of the FNDECL itself if there are problems. */ | |
6752 | ||
105ef6cf | 6753 | location_t |
5d78d423 | 6754 | get_fndecl_argument_location (tree fndecl, int argnum) |
6755 | { | |
9683081b | 6756 | /* The locations of implicitly-declared functions are likely to be |
6757 | more meaningful than those of their parameters. */ | |
6758 | if (DECL_ARTIFICIAL (fndecl)) | |
6759 | return DECL_SOURCE_LOCATION (fndecl); | |
6760 | ||
5d78d423 | 6761 | int i; |
6762 | tree param; | |
6763 | ||
6764 | /* Locate param by index within DECL_ARGUMENTS (fndecl). */ | |
6765 | for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl); | |
6766 | i < argnum && param; | |
6767 | i++, param = TREE_CHAIN (param)) | |
6768 | ; | |
6769 | ||
6770 | /* If something went wrong (e.g. if we have a builtin and thus no arguments), | |
6771 | return the location of FNDECL. */ | |
6772 | if (param == NULL) | |
6773 | return DECL_SOURCE_LOCATION (fndecl); | |
6774 | ||
6775 | return DECL_SOURCE_LOCATION (param); | |
6776 | } | |
6777 | ||
9683081b | 6778 | /* If FNDECL is non-NULL, issue a note highlighting ARGNUM |
6779 | within its declaration (or the fndecl itself if something went | |
6780 | wrong). */ | |
6781 | ||
6782 | void | |
6783 | maybe_inform_about_fndecl_for_bogus_argument_init (tree fn, int argnum) | |
6784 | { | |
6785 | if (fn) | |
6786 | inform (get_fndecl_argument_location (fn, argnum), | |
6787 | " initializing argument %P of %qD", argnum, fn); | |
6788 | } | |
6789 | ||
ec965e9b | 6790 | /* Perform the conversions in CONVS on the expression EXPR. FN and |
6791 | ARGNUM are used for diagnostics. ARGNUM is zero based, -1 | |
3160db1d | 6792 | indicates the `this' argument of a method. INNER is nonzero when |
0b8c2151 | 6793 | being called to continue a conversion chain. It is negative when a |
ec965e9b | 6794 | reference binding will be applied, positive otherwise. If |
6795 | ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious | |
6ab399e8 | 6796 | conversions will be emitted if appropriate. If C_CAST_P is true, |
6797 | this conversion is coming from a C-style cast; in that case, | |
6798 | conversions to inaccessible bases are permitted. */ | |
ec10e4ad | 6799 | |
6800 | static tree | |
9031d10b | 6801 | convert_like_real (conversion *convs, tree expr, tree fn, int argnum, |
d93ee6f8 | 6802 | bool issue_conversion_warnings, |
ebd21de4 | 6803 | bool c_cast_p, tsubst_flags_t complain) |
ec10e4ad | 6804 | { |
1611df57 | 6805 | tree totype = convs->type; |
a52d5726 | 6806 | diagnostic_t diag_kind; |
c0c26c69 | 6807 | int flags; |
d3a3cfb8 | 6808 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
3eb89cd8 | 6809 | |
29fe78ae | 6810 | if (convs->bad_p && !(complain & tf_error)) |
6811 | return error_mark_node; | |
6812 | ||
1611df57 | 6813 | if (convs->bad_p |
6814 | && convs->kind != ck_user | |
757f2b35 | 6815 | && convs->kind != ck_list |
1611df57 | 6816 | && convs->kind != ck_ambig |
d6b20eb5 | 6817 | && (convs->kind != ck_ref_bind |
237dc314 | 6818 | || (convs->user_conv_p && next_conversion (convs)->bad_p)) |
ee825f23 | 6819 | && (convs->kind != ck_rvalue |
6820 | || SCALAR_TYPE_P (totype)) | |
1ac0d401 | 6821 | && convs->kind != ck_base) |
2739960c | 6822 | { |
ee825f23 | 6823 | bool complained = false; |
1611df57 | 6824 | conversion *t = convs; |
ce734c95 | 6825 | |
6826 | /* Give a helpful error if this is bad because of excess braces. */ | |
6827 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6828 | && SCALAR_TYPE_P (totype) | |
6829 | && CONSTRUCTOR_NELTS (expr) > 0 | |
6830 | && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value)) | |
ee825f23 | 6831 | { |
6832 | complained = permerror (loc, "too many braces around initializer " | |
6833 | "for %qT", totype); | |
6834 | while (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6835 | && CONSTRUCTOR_NELTS (expr) == 1) | |
6836 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6837 | } | |
ce734c95 | 6838 | |
d7f56aae | 6839 | /* Give a helpful error if this is bad because a conversion to bool |
6840 | from std::nullptr_t requires direct-initialization. */ | |
6841 | if (NULLPTR_TYPE_P (TREE_TYPE (expr)) | |
6842 | && TREE_CODE (totype) == BOOLEAN_TYPE) | |
4d1eda3a | 6843 | complained = permerror (loc, "converting to %qH from %qI requires " |
d7f56aae | 6844 | "direct-initialization", |
6845 | totype, TREE_TYPE (expr)); | |
6846 | ||
3a8d62bb | 6847 | for (; t ; t = next_conversion (t)) |
2739960c | 6848 | { |
139a4129 | 6849 | if (t->kind == ck_user && t->cand->reason) |
6850 | { | |
bc35ef65 | 6851 | auto_diagnostic_group d; |
211cc89c | 6852 | complained = permerror (loc, "invalid user-defined conversion " |
4d1eda3a | 6853 | "from %qH to %qI", TREE_TYPE (expr), |
211cc89c | 6854 | totype); |
6855 | if (complained) | |
6856 | print_z_candidate (loc, "candidate is:", t->cand); | |
d93ee6f8 | 6857 | expr = convert_like_real (t, expr, fn, argnum, |
139a4129 | 6858 | /*issue_conversion_warnings=*/false, |
6859 | /*c_cast_p=*/false, | |
6860 | complain); | |
d6b20eb5 | 6861 | if (convs->kind == ck_ref_bind) |
2371bf7c | 6862 | expr = convert_to_reference (totype, expr, CONV_IMPLICIT, |
c4698a21 | 6863 | LOOKUP_NORMAL, NULL_TREE, |
6864 | complain); | |
d6b20eb5 | 6865 | else |
2371bf7c | 6866 | expr = cp_convert (totype, expr, complain); |
9683081b | 6867 | if (complained) |
6868 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); | |
2371bf7c | 6869 | return expr; |
139a4129 | 6870 | } |
6871 | else if (t->kind == ck_user || !t->bad_p) | |
2739960c | 6872 | { |
d93ee6f8 | 6873 | expr = convert_like_real (t, expr, fn, argnum, |
6ab399e8 | 6874 | /*issue_conversion_warnings=*/false, |
ebd21de4 | 6875 | /*c_cast_p=*/false, |
6876 | complain); | |
2739960c | 6877 | break; |
6878 | } | |
1611df57 | 6879 | else if (t->kind == ck_ambig) |
d93ee6f8 | 6880 | return convert_like_real (t, expr, fn, argnum, |
6ab399e8 | 6881 | /*issue_conversion_warnings=*/false, |
ebd21de4 | 6882 | /*c_cast_p=*/false, |
6883 | complain); | |
1611df57 | 6884 | else if (t->kind == ck_identity) |
2739960c | 6885 | break; |
6886 | } | |
ee825f23 | 6887 | if (!complained) |
b7bb5264 | 6888 | { |
6889 | range_label_for_type_mismatch label (TREE_TYPE (expr), totype); | |
6890 | gcc_rich_location richloc (loc, &label); | |
6891 | complained = permerror (&richloc, | |
6892 | "invalid conversion from %qH to %qI", | |
6893 | TREE_TYPE (expr), totype); | |
6894 | } | |
9683081b | 6895 | if (complained) |
6896 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); | |
ebd21de4 | 6897 | |
c4698a21 | 6898 | return cp_convert (totype, expr, complain); |
2739960c | 6899 | } |
9031d10b | 6900 | |
ebd21de4 | 6901 | if (issue_conversion_warnings && (complain & tf_warning)) |
59dd8856 | 6902 | conversion_null_warnings (totype, expr, fn, argnum); |
0a3a8a09 | 6903 | |
1611df57 | 6904 | switch (convs->kind) |
ec10e4ad | 6905 | { |
1611df57 | 6906 | case ck_user: |
ec10e4ad | 6907 | { |
1611df57 | 6908 | struct z_candidate *cand = convs->cand; |
b38367d9 | 6909 | |
6910 | if (cand == NULL) | |
6911 | /* We chose the surrogate function from add_conv_candidate, now we | |
6912 | actually need to build the conversion. */ | |
6913 | cand = build_user_type_conversion_1 (totype, expr, | |
6914 | LOOKUP_NO_CONVERSION, complain); | |
6915 | ||
3eb89cd8 | 6916 | tree convfn = cand->fn; |
c0c26c69 | 6917 | |
eaaf539e | 6918 | /* When converting from an init list we consider explicit |
6919 | constructors, but actually trying to call one is an error. */ | |
6920 | if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn) | |
b251d5f5 | 6921 | && BRACE_ENCLOSED_INITIALIZER_P (expr) |
eaaf539e | 6922 | /* Unless this is for direct-list-initialization. */ |
b251d5f5 | 6923 | && !CONSTRUCTOR_IS_DIRECT_INIT (expr) |
eaaf539e | 6924 | /* And in C++98 a default constructor can't be explicit. */ |
6925 | && cxx_dialect >= cxx11) | |
6926 | { | |
6927 | if (!(complain & tf_error)) | |
6928 | return error_mark_node; | |
6929 | location_t loc = location_of (expr); | |
6930 | if (CONSTRUCTOR_NELTS (expr) == 0 | |
6931 | && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node) | |
6932 | { | |
bc35ef65 | 6933 | auto_diagnostic_group d; |
eaaf539e | 6934 | if (pedwarn (loc, 0, "converting to %qT from initializer list " |
6935 | "would use explicit constructor %qD", | |
6936 | totype, convfn)) | |
6937 | inform (loc, "in C++11 and above a default constructor " | |
6938 | "can be explicit"); | |
6939 | } | |
6940 | else | |
6941 | error ("converting to %qT from initializer list would use " | |
6942 | "explicit constructor %qD", totype, convfn); | |
6943 | } | |
6944 | ||
6945 | /* If we're initializing from {}, it's value-initialization. */ | |
90ca6a25 | 6946 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) |
6947 | && CONSTRUCTOR_NELTS (expr) == 0 | |
6948 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)) | |
6949 | { | |
d57ad610 | 6950 | bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr); |
22db75d7 | 6951 | if (abstract_virtuals_error_sfinae (NULL_TREE, totype, complain)) |
6952 | return error_mark_node; | |
90ca6a25 | 6953 | expr = build_value_init (totype, complain); |
6954 | expr = get_target_expr_sfinae (expr, complain); | |
6955 | if (expr != error_mark_node) | |
d57ad610 | 6956 | { |
6957 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
6958 | TARGET_EXPR_DIRECT_INIT_P (expr) = direct; | |
6959 | } | |
90ca6a25 | 6960 | return expr; |
6961 | } | |
6962 | ||
fbb73d9b | 6963 | expr = mark_rvalue_use (expr); |
6964 | ||
c821ae1a | 6965 | /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow |
6966 | any more UDCs. */ | |
6967 | expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION, | |
6968 | complain); | |
ec10e4ad | 6969 | |
6970 | /* If this is a constructor or a function returning an aggr type, | |
6971 | we need to build up a TARGET_EXPR. */ | |
3eb89cd8 | 6972 | if (DECL_CONSTRUCTOR_P (convfn)) |
5c9c5a4b | 6973 | { |
3d4bed93 | 6974 | expr = build_cplus_new (totype, expr, complain); |
5c9c5a4b | 6975 | |
6976 | /* Remember that this was list-initialization. */ | |
9705da72 | 6977 | if (convs->check_narrowing && expr != error_mark_node) |
5c9c5a4b | 6978 | TARGET_EXPR_LIST_INIT_P (expr) = true; |
6979 | } | |
3eb89cd8 | 6980 | |
ec10e4ad | 6981 | return expr; |
6982 | } | |
1611df57 | 6983 | case ck_identity: |
757f2b35 | 6984 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
6985 | { | |
6986 | int nelts = CONSTRUCTOR_NELTS (expr); | |
6987 | if (nelts == 0) | |
90ca6a25 | 6988 | expr = build_value_init (totype, complain); |
757f2b35 | 6989 | else if (nelts == 1) |
6990 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6991 | else | |
6992 | gcc_unreachable (); | |
6993 | } | |
bc97e231 | 6994 | expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p, |
6995 | /*read_p=*/true, UNKNOWN_LOCATION, | |
6996 | /*reject_builtin=*/true); | |
757f2b35 | 6997 | |
ec10e4ad | 6998 | if (type_unknown_p (expr)) |
ebd21de4 | 6999 | expr = instantiate_type (totype, expr, complain); |
988a1f54 | 7000 | if (expr == null_node |
7001 | && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype)) | |
7002 | /* If __null has been converted to an integer type, we do not want to | |
7003 | continue to warn about uses of EXPR as an integer, rather than as a | |
7004 | pointer. */ | |
7005 | expr = build_int_cst (totype, 0); | |
9bfe0f4a | 7006 | return expr; |
1611df57 | 7007 | case ck_ambig: |
8e1e2c20 | 7008 | /* We leave bad_p off ck_ambig because overload resolution considers |
7009 | it valid, it just fails when we try to perform it. So we need to | |
7010 | check complain here, too. */ | |
c2c19f68 | 7011 | if (complain & tf_error) |
7012 | { | |
7013 | /* Call build_user_type_conversion again for the error. */ | |
612d07ac | 7014 | int flags = (convs->need_temporary_p |
7015 | ? LOOKUP_IMPLICIT : LOOKUP_NORMAL); | |
7016 | build_user_type_conversion (totype, convs->u.expr, flags, complain); | |
7017 | gcc_assert (seen_error ()); | |
9683081b | 7018 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
c2c19f68 | 7019 | } |
7020 | return error_mark_node; | |
d913511e | 7021 | |
f82f1250 | 7022 | case ck_list: |
7023 | { | |
7024 | /* Conversion to std::initializer_list<T>. */ | |
7025 | tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0); | |
7026 | tree new_ctor = build_constructor (init_list_type_node, NULL); | |
7027 | unsigned len = CONSTRUCTOR_NELTS (expr); | |
cb43d570 | 7028 | tree array, val, field; |
f1f41a6c | 7029 | vec<constructor_elt, va_gc> *vec = NULL; |
f82f1250 | 7030 | unsigned ix; |
7031 | ||
7032 | /* Convert all the elements. */ | |
7033 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val) | |
7034 | { | |
7035 | tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum, | |
d93ee6f8 | 7036 | false, false, complain); |
f82f1250 | 7037 | if (sub == error_mark_node) |
7038 | return sub; | |
718affe2 | 7039 | if (!BRACE_ENCLOSED_INITIALIZER_P (val) |
7040 | && !check_narrowing (TREE_TYPE (sub), val, complain)) | |
7041 | return error_mark_node; | |
f82f1250 | 7042 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub); |
33f4d7af | 7043 | if (!TREE_CONSTANT (sub)) |
7044 | TREE_CONSTANT (new_ctor) = false; | |
f82f1250 | 7045 | } |
7046 | /* Build up the array. */ | |
7047 | elttype = cp_build_qualified_type | |
ce494fcf | 7048 | (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST); |
f82f1250 | 7049 | array = build_array_of_n_type (elttype, len); |
95034afb | 7050 | array = finish_compound_literal (array, new_ctor, complain); |
eb5d9b7b | 7051 | /* Take the address explicitly rather than via decay_conversion |
7052 | to avoid the error about taking the address of a temporary. */ | |
7053 | array = cp_build_addr_expr (array, complain); | |
c4698a21 | 7054 | array = cp_convert (build_pointer_type (elttype), array, complain); |
3fc9e843 | 7055 | if (array == error_mark_node) |
7056 | return error_mark_node; | |
f82f1250 | 7057 | |
c7120adc | 7058 | /* Build up the initializer_list object. Note: fail gracefully |
7059 | if the object cannot be completed because, for example, no | |
7060 | definition is provided (c++/80956). */ | |
7061 | totype = complete_type_or_maybe_complain (totype, NULL_TREE, complain); | |
7062 | if (!totype) | |
7063 | return error_mark_node; | |
cb43d570 | 7064 | field = next_initializable_field (TYPE_FIELDS (totype)); |
eb5d9b7b | 7065 | CONSTRUCTOR_APPEND_ELT (vec, field, array); |
cb43d570 | 7066 | field = next_initializable_field (DECL_CHAIN (field)); |
7067 | CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len)); | |
7068 | new_ctor = build_constructor (totype, vec); | |
44189c16 | 7069 | return get_target_expr_sfinae (new_ctor, complain); |
f82f1250 | 7070 | } |
7071 | ||
7072 | case ck_aggr: | |
581edfc4 | 7073 | if (TREE_CODE (totype) == COMPLEX_TYPE) |
7074 | { | |
7075 | tree real = CONSTRUCTOR_ELT (expr, 0)->value; | |
7076 | tree imag = CONSTRUCTOR_ELT (expr, 1)->value; | |
7077 | real = perform_implicit_conversion (TREE_TYPE (totype), | |
7078 | real, complain); | |
7079 | imag = perform_implicit_conversion (TREE_TYPE (totype), | |
7080 | imag, complain); | |
7081 | expr = build2 (COMPLEX_EXPR, totype, real, imag); | |
d2c63826 | 7082 | return expr; |
581edfc4 | 7083 | } |
0138a8ea | 7084 | expr = reshape_init (totype, expr, complain); |
3fc9e843 | 7085 | expr = get_target_expr_sfinae (digest_init (totype, expr, complain), |
44189c16 | 7086 | complain); |
3fc9e843 | 7087 | if (expr != error_mark_node) |
7088 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
7089 | return expr; | |
f82f1250 | 7090 | |
d913511e | 7091 | default: |
7092 | break; | |
ec10e4ad | 7093 | }; |
7094 | ||
5ac302b4 | 7095 | expr = convert_like_real (next_conversion (convs), expr, fn, argnum, |
d3e9b3e9 | 7096 | convs->kind == ck_ref_bind |
7097 | ? issue_conversion_warnings : false, | |
7098 | c_cast_p, complain); | |
ec10e4ad | 7099 | if (expr == error_mark_node) |
7100 | return error_mark_node; | |
7101 | ||
1611df57 | 7102 | switch (convs->kind) |
ec10e4ad | 7103 | { |
1611df57 | 7104 | case ck_rvalue: |
4405c1ad | 7105 | expr = decay_conversion (expr, complain); |
7106 | if (expr == error_mark_node) | |
3af524f9 | 7107 | { |
2aaed7b3 | 7108 | if (complain & tf_error) |
3af524f9 | 7109 | { |
bc35ef65 | 7110 | auto_diagnostic_group d; |
3af524f9 | 7111 | maybe_print_user_conv_context (convs); |
9683081b | 7112 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
3af524f9 | 7113 | } |
7114 | return error_mark_node; | |
7115 | } | |
4405c1ad | 7116 | |
95397ff9 | 7117 | if (! MAYBE_CLASS_TYPE_P (totype)) |
1adc02a5 | 7118 | return expr; |
7896267d | 7119 | |
7120 | /* Don't introduce copies when passing arguments along to the inherited | |
7121 | constructor. */ | |
7122 | if (current_function_decl | |
7123 | && flag_new_inheriting_ctors | |
c2c85fc5 | 7124 | && DECL_INHERITED_CTOR (current_function_decl)) |
7896267d | 7125 | return expr; |
7126 | ||
7238ae96 | 7127 | if (TREE_CODE (expr) == TARGET_EXPR |
7128 | && TARGET_EXPR_LIST_INIT_P (expr)) | |
7129 | /* Copy-list-initialization doesn't actually involve a copy. */ | |
7130 | return expr; | |
7131 | ||
e3533433 | 7132 | /* Fall through. */ |
1611df57 | 7133 | case ck_base: |
7134 | if (convs->kind == ck_base && !convs->need_temporary_p) | |
db9d2b2e | 7135 | { |
7136 | /* We are going to bind a reference directly to a base-class | |
7137 | subobject of EXPR. */ | |
db9d2b2e | 7138 | /* Build an expression for `*((base*) &expr)'. */ |
9bf79212 | 7139 | expr = convert_to_base (expr, totype, |
640a46a5 | 7140 | !c_cast_p, /*nonnull=*/true, complain); |
db9d2b2e | 7141 | return expr; |
7142 | } | |
7143 | ||
3eb89cd8 | 7144 | /* Copy-initialization where the cv-unqualified version of the source |
7145 | type is the same class as, or a derived class of, the class of the | |
7146 | destination [is treated as direct-initialization]. [dcl.init] */ | |
1b6b9f80 | 7147 | flags = LOOKUP_NORMAL; |
c0c26c69 | 7148 | if (convs->user_conv_p) |
7149 | /* This conversion is being done in the context of a user-defined | |
fd25a1d0 | 7150 | conversion (i.e. the second step of copy-initialization), so |
7151 | don't allow any more. */ | |
c0c26c69 | 7152 | flags |= LOOKUP_NO_CONVERSION; |
1b6b9f80 | 7153 | else |
7154 | flags |= LOOKUP_ONLYCONVERTING; | |
13f56139 | 7155 | if (convs->rvaluedness_matches_p) |
ff00c674 | 7156 | /* standard_conversion got LOOKUP_PREFER_RVALUE. */ |
13f56139 | 7157 | flags |= LOOKUP_PREFER_RVALUE; |
1b410098 | 7158 | expr = build_temp (expr, totype, flags, &diag_kind, complain); |
2371bf7c | 7159 | if (diag_kind && complain) |
7160 | { | |
bc35ef65 | 7161 | auto_diagnostic_group d; |
2371bf7c | 7162 | maybe_print_user_conv_context (convs); |
9683081b | 7163 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
2371bf7c | 7164 | } |
7165 | ||
3d4bed93 | 7166 | return build_cplus_new (totype, expr, complain); |
bf356568 | 7167 | |
1611df57 | 7168 | case ck_ref_bind: |
a3786328 | 7169 | { |
3eb89cd8 | 7170 | tree ref_type = totype; |
a3786328 | 7171 | |
5ac302b4 | 7172 | if (convs->bad_p && !next_conversion (convs)->bad_p) |
aaa6e1c2 | 7173 | { |
fdbd4827 | 7174 | tree extype = TREE_TYPE (expr); |
bc35ef65 | 7175 | auto_diagnostic_group d; |
fdbd4827 | 7176 | if (TYPE_REF_IS_RVALUE (ref_type) |
18bede74 | 7177 | && lvalue_p (expr)) |
4d1eda3a | 7178 | error_at (loc, "cannot bind rvalue reference of type %qH to " |
7179 | "lvalue of type %qI", totype, extype); | |
18bede74 | 7180 | else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr) |
fdbd4827 | 7181 | && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type))) |
30c60892 | 7182 | error_at (loc, "cannot bind non-const lvalue reference of " |
4d1eda3a | 7183 | "type %qH to an rvalue of type %qI", totype, extype); |
fdbd4827 | 7184 | else if (!reference_compatible_p (TREE_TYPE (totype), extype)) |
4d1eda3a | 7185 | error_at (loc, "binding reference of type %qH to %qI " |
30c60892 | 7186 | "discards qualifiers", totype, extype); |
fdbd4827 | 7187 | else |
7188 | gcc_unreachable (); | |
2371bf7c | 7189 | maybe_print_user_conv_context (convs); |
9683081b | 7190 | maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum); |
7191 | ||
aaa6e1c2 | 7192 | return error_mark_node; |
7193 | } | |
7194 | ||
63949b38 | 7195 | /* If necessary, create a temporary. |
7196 | ||
7197 | VA_ARG_EXPR and CONSTRUCTOR expressions are special cases | |
7198 | that need temporaries, even when their types are reference | |
7199 | compatible with the type of reference being bound, so the | |
d6fbd579 | 7200 | upcoming call to cp_build_addr_expr doesn't fail. */ |
63949b38 | 7201 | if (convs->need_temporary_p |
7202 | || TREE_CODE (expr) == CONSTRUCTOR | |
7203 | || TREE_CODE (expr) == VA_ARG_EXPR) | |
a3786328 | 7204 | { |
f5b0f501 | 7205 | /* Otherwise, a temporary of type "cv1 T1" is created and |
7206 | initialized from the initializer expression using the rules | |
7207 | for a non-reference copy-initialization (8.5). */ | |
7208 | ||
7209 | tree type = TREE_TYPE (ref_type); | |
4618a2af | 7210 | cp_lvalue_kind lvalue = lvalue_kind (expr); |
8e68bf5f | 7211 | |
f5b0f501 | 7212 | gcc_assert (same_type_ignoring_top_level_qualifiers_p |
5ac302b4 | 7213 | (type, next_conversion (convs)->type)); |
f5b0f501 | 7214 | if (!CP_TYPE_CONST_NON_VOLATILE_P (type) |
63949b38 | 7215 | && !TYPE_REF_IS_RVALUE (ref_type)) |
8e68bf5f | 7216 | { |
8e1e2c20 | 7217 | /* If the reference is volatile or non-const, we |
7218 | cannot create a temporary. */ | |
7219 | if (lvalue & clk_bitfield) | |
61f69bc9 | 7220 | error_at (loc, "cannot bind bitfield %qE to %qT", |
7221 | expr, ref_type); | |
8e1e2c20 | 7222 | else if (lvalue & clk_packed) |
61f69bc9 | 7223 | error_at (loc, "cannot bind packed field %qE to %qT", |
7224 | expr, ref_type); | |
8e1e2c20 | 7225 | else |
61f69bc9 | 7226 | error_at (loc, "cannot bind rvalue %qE to %qT", |
7227 | expr, ref_type); | |
8e68bf5f | 7228 | return error_mark_node; |
7229 | } | |
8f776a97 | 7230 | /* If the source is a packed field, and we must use a copy |
7231 | constructor, then building the target expr will require | |
7232 | binding the field to the reference parameter to the | |
7233 | copy constructor, and we'll end up with an infinite | |
7234 | loop. If we can use a bitwise copy, then we'll be | |
7235 | OK. */ | |
9031d10b | 7236 | if ((lvalue & clk_packed) |
7237 | && CLASS_TYPE_P (type) | |
bde2eab6 | 7238 | && type_has_nontrivial_copy_init (type)) |
8f776a97 | 7239 | { |
61f69bc9 | 7240 | error_at (loc, "cannot bind packed field %qE to %qT", |
7241 | expr, ref_type); | |
8f776a97 | 7242 | return error_mark_node; |
7243 | } | |
a9dec759 | 7244 | if (lvalue & clk_bitfield) |
8e4fb8d2 | 7245 | { |
7246 | expr = convert_bitfield_to_declared_type (expr); | |
7247 | expr = fold_convert (type, expr); | |
7248 | } | |
9e505437 | 7249 | expr = build_target_expr_with_type (expr, type, complain); |
a3786328 | 7250 | } |
7251 | ||
7252 | /* Take the address of the thing to which we will bind the | |
7253 | reference. */ | |
d6fbd579 | 7254 | expr = cp_build_addr_expr (expr, complain); |
a3786328 | 7255 | if (expr == error_mark_node) |
7256 | return error_mark_node; | |
7257 | ||
7258 | /* Convert it to a pointer to the type referred to by the | |
7259 | reference. This will adjust the pointer if a derived to | |
7260 | base conversion is being performed. */ | |
9031d10b | 7261 | expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)), |
c4698a21 | 7262 | expr, complain); |
a3786328 | 7263 | /* Convert the pointer to the desired reference type. */ |
8999978b | 7264 | return build_nop (ref_type, expr); |
a3786328 | 7265 | } |
7266 | ||
1611df57 | 7267 | case ck_lvalue: |
4405c1ad | 7268 | return decay_conversion (expr, complain); |
d913511e | 7269 | |
2e9e9363 | 7270 | case ck_fnptr: |
6d02e6b2 | 7271 | /* ??? Should the address of a transaction-safe pointer point to the TM |
2e9e9363 | 7272 | clone, and this conversion look up the primary function? */ |
6d02e6b2 | 7273 | return build_nop (totype, expr); |
7274 | ||
1611df57 | 7275 | case ck_qual: |
3a10ba35 | 7276 | /* Warn about deprecated conversion if appropriate. */ |
3eb89cd8 | 7277 | string_conv_p (totype, expr, 1); |
3a10ba35 | 7278 | break; |
6ab399e8 | 7279 | |
7280 | case ck_ptr: | |
7281 | if (convs->base_p) | |
cb02169c | 7282 | expr = convert_to_base (expr, totype, !c_cast_p, |
640a46a5 | 7283 | /*nonnull=*/false, complain); |
6ab399e8 | 7284 | return build_nop (totype, expr); |
7285 | ||
cb02169c | 7286 | case ck_pmem: |
7287 | return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false, | |
85132186 | 7288 | c_cast_p, complain); |
cb02169c | 7289 | |
d913511e | 7290 | default: |
7291 | break; | |
ec10e4ad | 7292 | } |
2d42b7d7 | 7293 | |
718affe2 | 7294 | if (convs->check_narrowing |
ee6d34bb | 7295 | && !check_narrowing (totype, expr, complain, |
7296 | convs->check_narrowing_const_only)) | |
718affe2 | 7297 | return error_mark_node; |
f82f1250 | 7298 | |
4c0f6781 | 7299 | warning_sentinel w (warn_zero_as_null_pointer_constant); |
65615944 | 7300 | if (issue_conversion_warnings) |
7301 | expr = cp_convert_and_check (totype, expr, complain); | |
2d42b7d7 | 7302 | else |
65615944 | 7303 | expr = cp_convert (totype, expr, complain); |
2d42b7d7 | 7304 | |
7305 | return expr; | |
ec10e4ad | 7306 | } |
7307 | ||
bf356568 | 7308 | /* ARG is being passed to a varargs function. Perform any conversions |
a681799d | 7309 | required. Return the converted value. */ |
bf356568 | 7310 | |
7311 | tree | |
66bbeb85 | 7312 | convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain) |
bf356568 | 7313 | { |
5ba33bf4 | 7314 | tree arg_type; |
d3a3cfb8 | 7315 | location_t loc = cp_expr_loc_or_loc (arg, input_location); |
5ba33bf4 | 7316 | |
a681799d | 7317 | /* [expr.call] |
7318 | ||
7319 | The lvalue-to-rvalue, array-to-pointer, and function-to-pointer | |
7320 | standard conversions are performed. */ | |
66bbeb85 | 7321 | arg = decay_conversion (arg, complain); |
5ba33bf4 | 7322 | arg_type = TREE_TYPE (arg); |
a681799d | 7323 | /* [expr.call] |
7324 | ||
7325 | If the argument has integral or enumeration type that is subject | |
7326 | to the integral promotions (_conv.prom_), or a floating point | |
7327 | type that is subject to the floating point promotion | |
7328 | (_conv.fpprom_), the value of the argument is converted to the | |
7329 | promoted type before the call. */ | |
5ba33bf4 | 7330 | if (TREE_CODE (arg_type) == REAL_TYPE |
7331 | && (TYPE_PRECISION (arg_type) | |
9dc2b60a | 7332 | < TYPE_PRECISION (double_type_node)) |
5ba33bf4 | 7333 | && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type))) |
7334 | { | |
66bbeb85 | 7335 | if ((complain & tf_warning) |
7336 | && warn_double_promotion && !c_inhibit_evaluation_warnings) | |
61f69bc9 | 7337 | warning_at (loc, OPT_Wdouble_promotion, |
4d1eda3a | 7338 | "implicit conversion from %qH to %qI when passing " |
61f69bc9 | 7339 | "argument to function", |
7340 | arg_type, double_type_node); | |
d2c63826 | 7341 | arg = convert_to_real_nofold (double_type_node, arg); |
5ba33bf4 | 7342 | } |
7343 | else if (NULLPTR_TYPE_P (arg_type)) | |
6fe11077 | 7344 | arg = null_pointer_node; |
5ba33bf4 | 7345 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type)) |
9fd75d52 | 7346 | { |
74b777e5 | 7347 | if (SCOPED_ENUM_P (arg_type)) |
9fd75d52 | 7348 | { |
74b777e5 | 7349 | tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg, |
7350 | complain); | |
7351 | prom = cp_perform_integral_promotions (prom, complain); | |
7352 | if (abi_version_crosses (6) | |
7353 | && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type) | |
7354 | && (complain & tf_warning)) | |
7355 | warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as " | |
7356 | "%qT before -fabi-version=6, %qT after", arg_type, | |
7357 | TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type)); | |
7358 | if (!abi_version_at_least (6)) | |
7359 | arg = prom; | |
9fd75d52 | 7360 | } |
74b777e5 | 7361 | else |
7362 | arg = cp_perform_integral_promotions (arg, complain); | |
9fd75d52 | 7363 | } |
bf356568 | 7364 | |
14376b10 | 7365 | arg = require_complete_type_sfinae (arg, complain); |
5ba33bf4 | 7366 | arg_type = TREE_TYPE (arg); |
9031d10b | 7367 | |
5eab6dd3 | 7368 | if (arg != error_mark_node |
d823627d | 7369 | /* In a template (or ill-formed code), we can have an incomplete type |
14376b10 | 7370 | even after require_complete_type_sfinae, in which case we don't know |
d823627d | 7371 | whether it has trivial copy or not. */ |
4cd565ae | 7372 | && COMPLETE_TYPE_P (arg_type) |
7373 | && !cp_unevaluated_operand) | |
ced2451b | 7374 | { |
c1c67b4f | 7375 | /* [expr.call] 5.2.2/7: |
7376 | Passing a potentially-evaluated argument of class type (Clause 9) | |
7377 | with a non-trivial copy constructor or a non-trivial destructor | |
7378 | with no corresponding parameter is conditionally-supported, with | |
7379 | implementation-defined semantics. | |
7380 | ||
4cd565ae | 7381 | We support it as pass-by-invisible-reference, just like a normal |
7382 | value parameter. | |
c1c67b4f | 7383 | |
9031d10b | 7384 | If the call appears in the context of a sizeof expression, |
c1c67b4f | 7385 | it is not potentially-evaluated. */ |
4cd565ae | 7386 | if (type_has_nontrivial_copy_init (arg_type) |
7387 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)) | |
66bbeb85 | 7388 | { |
4cd565ae | 7389 | arg = force_rvalue (arg, complain); |
7dab9307 | 7390 | if (complain & tf_warning) |
7391 | warning (OPT_Wconditionally_supported, | |
7392 | "passing objects of non-trivially-copyable " | |
7393 | "type %q#T through %<...%> is conditionally supported", | |
7394 | arg_type); | |
533f67f1 | 7395 | return build1 (ADDR_EXPR, build_reference_type (arg_type), arg); |
66bbeb85 | 7396 | } |
4cd565ae | 7397 | /* Build up a real lvalue-to-rvalue conversion in case the |
7398 | copy constructor is trivial but not callable. */ | |
7399 | else if (CLASS_TYPE_P (arg_type)) | |
7400 | force_rvalue (arg, complain); | |
7401 | ||
ced2451b | 7402 | } |
7403 | ||
bf356568 | 7404 | return arg; |
7405 | } | |
7406 | ||
0452bb36 | 7407 | /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */ |
7408 | ||
7409 | tree | |
be1e7283 | 7410 | build_x_va_arg (location_t loc, tree expr, tree type) |
0452bb36 | 7411 | { |
f64ede8c | 7412 | if (processing_template_decl) |
7dab9307 | 7413 | { |
7414 | tree r = build_min (VA_ARG_EXPR, type, expr); | |
7415 | SET_EXPR_LOCATION (r, loc); | |
7416 | return r; | |
7417 | } | |
9031d10b | 7418 | |
0452bb36 | 7419 | type = complete_type_or_else (type, NULL_TREE); |
7420 | ||
7421 | if (expr == error_mark_node || !type) | |
7422 | return error_mark_node; | |
9031d10b | 7423 | |
fbb73d9b | 7424 | expr = mark_lvalue_use (expr); |
7425 | ||
90ad495b | 7426 | if (TYPE_REF_P (type)) |
7dab9307 | 7427 | { |
7428 | error ("cannot receive reference type %qT through %<...%>", type); | |
7429 | return error_mark_node; | |
7430 | } | |
7431 | ||
c1c67b4f | 7432 | if (type_has_nontrivial_copy_init (type) |
7dab9307 | 7433 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
7434 | { | |
7435 | /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat | |
7436 | it as pass by invisible reference. */ | |
7437 | warning_at (loc, OPT_Wconditionally_supported, | |
7438 | "receiving objects of non-trivially-copyable type %q#T " | |
7439 | "through %<...%> is conditionally-supported", type); | |
7440 | ||
7441 | tree ref = cp_build_reference_type (type, false); | |
7442 | expr = build_va_arg (loc, expr, ref); | |
7443 | return convert_from_reference (expr); | |
0452bb36 | 7444 | } |
9031d10b | 7445 | |
ceab25e5 | 7446 | tree ret = build_va_arg (loc, expr, type); |
7447 | if (CLASS_TYPE_P (type)) | |
7448 | /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to | |
7449 | know how to handle it. */ | |
7450 | ret = get_target_expr (ret); | |
7451 | return ret; | |
0452bb36 | 7452 | } |
7453 | ||
63c62881 | 7454 | /* TYPE has been given to va_arg. Apply the default conversions which |
7455 | would have happened when passed via ellipsis. Return the promoted | |
7456 | type, or the passed type if there is no change. */ | |
0452bb36 | 7457 | |
7458 | tree | |
eda6e89c | 7459 | cxx_type_promotes_to (tree type) |
0452bb36 | 7460 | { |
7461 | tree promote; | |
63c62881 | 7462 | |
37b9a732 | 7463 | /* Perform the array-to-pointer and function-to-pointer |
7464 | conversions. */ | |
7465 | type = type_decays_to (type); | |
63c62881 | 7466 | |
7467 | promote = type_promotes_to (type); | |
7468 | if (same_type_p (type, promote)) | |
7469 | promote = type; | |
9031d10b | 7470 | |
63c62881 | 7471 | return promote; |
0452bb36 | 7472 | } |
7473 | ||
bf356568 | 7474 | /* ARG is a default argument expression being passed to a parameter of |
4439eed9 | 7475 | the indicated TYPE, which is a parameter to FN. PARMNUM is the |
7476 | zero-based argument number. Do any required conversions. Return | |
7477 | the converted value. */ | |
bf356568 | 7478 | |
f1f41a6c | 7479 | static GTY(()) vec<tree, va_gc> *default_arg_context; |
4439eed9 | 7480 | void |
7481 | push_defarg_context (tree fn) | |
f1f41a6c | 7482 | { vec_safe_push (default_arg_context, fn); } |
7483 | ||
4439eed9 | 7484 | void |
7485 | pop_defarg_context (void) | |
f1f41a6c | 7486 | { default_arg_context->pop (); } |
2b341802 | 7487 | |
bf356568 | 7488 | tree |
66bbeb85 | 7489 | convert_default_arg (tree type, tree arg, tree fn, int parmnum, |
7490 | tsubst_flags_t complain) | |
ec10e4ad | 7491 | { |
2b341802 | 7492 | int i; |
7493 | tree t; | |
7494 | ||
4439eed9 | 7495 | /* See through clones. */ |
7496 | fn = DECL_ORIGIN (fn); | |
6e1e09d4 | 7497 | /* And inheriting ctors. */ |
7498 | if (flag_new_inheriting_ctors) | |
7499 | fn = strip_inheriting_ctors (fn); | |
8cd392a8 | 7500 | |
2b341802 | 7501 | /* Detect recursion. */ |
f1f41a6c | 7502 | FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t) |
2b341802 | 7503 | if (t == fn) |
7504 | { | |
66bbeb85 | 7505 | if (complain & tf_error) |
7506 | error ("recursive evaluation of default argument for %q#D", fn); | |
2b341802 | 7507 | return error_mark_node; |
7508 | } | |
4439eed9 | 7509 | |
7510 | /* If the ARG is an unparsed default argument expression, the | |
7511 | conversion cannot be performed. */ | |
7512 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
7513 | { | |
66bbeb85 | 7514 | if (complain & tf_error) |
7515 | error ("call to %qD uses the default argument for parameter %P, which " | |
7516 | "is not yet defined", fn, parmnum); | |
4439eed9 | 7517 | return error_mark_node; |
7518 | } | |
7519 | ||
7520 | push_defarg_context (fn); | |
2b341802 | 7521 | |
74410faa | 7522 | if (fn && DECL_TEMPLATE_INFO (fn)) |
ea3e8c99 | 7523 | arg = tsubst_default_argument (fn, parmnum, type, arg, complain); |
74410faa | 7524 | |
4fdb071c | 7525 | /* Due to: |
7526 | ||
7527 | [dcl.fct.default] | |
ec10e4ad | 7528 | |
4fdb071c | 7529 | The names in the expression are bound, and the semantic |
7530 | constraints are checked, at the point where the default | |
7531 | expressions appears. | |
7532 | ||
7533 | we must not perform access checks here. */ | |
7534 | push_deferring_access_checks (dk_no_check); | |
c071db3e | 7535 | /* We must make a copy of ARG, in case subsequent processing |
7536 | alters any part of it. */ | |
f81e481d | 7537 | arg = break_out_target_exprs (arg, /*clear location*/true); |
22659199 | 7538 | |
c39c96ef | 7539 | arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT, |
7540 | ICR_DEFAULT_ARGUMENT, fn, parmnum, | |
7541 | complain); | |
7542 | arg = convert_for_arg_passing (type, arg, complain); | |
4fdb071c | 7543 | pop_deferring_access_checks(); |
ec10e4ad | 7544 | |
4439eed9 | 7545 | pop_defarg_context (); |
2b341802 | 7546 | |
ec10e4ad | 7547 | return arg; |
7548 | } | |
7549 | ||
d145d8d5 | 7550 | /* Returns the type which will really be used for passing an argument of |
7551 | type TYPE. */ | |
7552 | ||
7553 | tree | |
eda6e89c | 7554 | type_passed_as (tree type) |
d145d8d5 | 7555 | { |
7556 | /* Pass classes with copy ctors by invisible reference. */ | |
7557 | if (TREE_ADDRESSABLE (type)) | |
dddcebdc | 7558 | { |
7559 | type = build_reference_type (type); | |
7560 | /* There are no other pointers to this temporary. */ | |
ce494fcf | 7561 | type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT); |
dddcebdc | 7562 | } |
d279e49d | 7563 | else if (targetm.calls.promote_prototypes (NULL_TREE) |
d145d8d5 | 7564 | && INTEGRAL_TYPE_P (type) |
255ce7f8 | 7565 | && COMPLETE_TYPE_P (type) |
d99d10ca | 7566 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
d145d8d5 | 7567 | type = integer_type_node; |
7568 | ||
7569 | return type; | |
7570 | } | |
7571 | ||
7572 | /* Actually perform the appropriate conversion. */ | |
7573 | ||
7574 | tree | |
66bbeb85 | 7575 | convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain) |
d145d8d5 | 7576 | { |
321316cc | 7577 | tree bitfield_type; |
7578 | ||
7579 | /* If VAL is a bitfield, then -- since it has already been converted | |
7580 | to TYPE -- it cannot have a precision greater than TYPE. | |
7581 | ||
7582 | If it has a smaller precision, we must widen it here. For | |
7583 | example, passing "int f:3;" to a function expecting an "int" will | |
7584 | not result in any conversion before this point. | |
7585 | ||
7586 | If the precision is the same we must not risk widening. For | |
7587 | example, the COMPONENT_REF for a 32-bit "long long" bitfield will | |
7588 | often have type "int", even though the C++ type for the field is | |
7589 | "long long". If the value is being passed to a function | |
7590 | expecting an "int", then no conversions will be required. But, | |
7591 | if we call convert_bitfield_to_declared_type, the bitfield will | |
7592 | be converted to "long long". */ | |
7593 | bitfield_type = is_bitfield_expr_with_lowered_type (val); | |
7594 | if (bitfield_type | |
7595 | && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)) | |
d2c63826 | 7596 | val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val); |
321316cc | 7597 | |
a6543b83 | 7598 | if (val == error_mark_node) |
7599 | ; | |
d145d8d5 | 7600 | /* Pass classes with copy ctors by invisible reference. */ |
a6543b83 | 7601 | else if (TREE_ADDRESSABLE (type)) |
7602 | val = build1 (ADDR_EXPR, build_reference_type (type), val); | |
d279e49d | 7603 | else if (targetm.calls.promote_prototypes (NULL_TREE) |
d145d8d5 | 7604 | && INTEGRAL_TYPE_P (type) |
255ce7f8 | 7605 | && COMPLETE_TYPE_P (type) |
d99d10ca | 7606 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
c4698a21 | 7607 | val = cp_perform_integral_promotions (val, complain); |
5d11282b | 7608 | if (complain & tf_warning) |
7609 | { | |
7610 | if (warn_suggest_attribute_format) | |
7611 | { | |
7612 | tree rhstype = TREE_TYPE (val); | |
7613 | const enum tree_code coder = TREE_CODE (rhstype); | |
7614 | const enum tree_code codel = TREE_CODE (type); | |
7615 | if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE) | |
7616 | && coder == codel | |
7617 | && check_missing_format_attribute (type, rhstype)) | |
7618 | warning (OPT_Wsuggest_attribute_format, | |
7619 | "argument of function call might be a candidate " | |
7620 | "for a format attribute"); | |
7621 | } | |
d3a3cfb8 | 7622 | maybe_warn_parm_abi (type, cp_expr_loc_or_loc (val, input_location)); |
be7350e7 | 7623 | } |
d145d8d5 | 7624 | return val; |
7625 | } | |
7626 | ||
e2895b76 | 7627 | /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for |
7628 | which just decay_conversion or no conversions at all should be done. | |
7629 | This is true for some builtins which don't act like normal functions. | |
7630 | Return 2 if no conversions at all should be done, 1 if just | |
7318e591 | 7631 | decay_conversion. Return 3 for special treatment of the 3rd argument |
7632 | for __builtin_*_overflow_p. */ | |
cf91a12d | 7633 | |
e2895b76 | 7634 | int |
cf91a12d | 7635 | magic_varargs_p (tree fn) |
7636 | { | |
0e6099f1 | 7637 | if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL) |
cf91a12d | 7638 | switch (DECL_FUNCTION_CODE (fn)) |
7639 | { | |
7640 | case BUILT_IN_CLASSIFY_TYPE: | |
7641 | case BUILT_IN_CONSTANT_P: | |
7642 | case BUILT_IN_NEXT_ARG: | |
cf91a12d | 7643 | case BUILT_IN_VA_START: |
e2895b76 | 7644 | return 1; |
cf91a12d | 7645 | |
7318e591 | 7646 | case BUILT_IN_ADD_OVERFLOW_P: |
7647 | case BUILT_IN_SUB_OVERFLOW_P: | |
7648 | case BUILT_IN_MUL_OVERFLOW_P: | |
7649 | return 3; | |
7650 | ||
cf91a12d | 7651 | default:; |
be19d1b1 | 7652 | return lookup_attribute ("type generic", |
7653 | TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0; | |
cf91a12d | 7654 | } |
7655 | ||
e2895b76 | 7656 | return 0; |
cf91a12d | 7657 | } |
7658 | ||
cc8ef84f | 7659 | /* Returns the decl of the dispatcher function if FN is a function version. */ |
7660 | ||
2d96fdef | 7661 | tree |
cc8ef84f | 7662 | get_function_version_dispatcher (tree fn) |
7663 | { | |
7664 | tree dispatcher_decl = NULL; | |
7665 | ||
7666 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL | |
7667 | && DECL_FUNCTION_VERSIONED (fn)); | |
7668 | ||
7669 | gcc_assert (targetm.get_function_versions_dispatcher); | |
7670 | dispatcher_decl = targetm.get_function_versions_dispatcher (fn); | |
7671 | ||
7672 | if (dispatcher_decl == NULL) | |
7673 | { | |
2d96fdef | 7674 | error_at (input_location, "use of multiversioned function " |
7675 | "without a default"); | |
cc8ef84f | 7676 | return NULL; |
7677 | } | |
7678 | ||
7679 | retrofit_lang_decl (dispatcher_decl); | |
7680 | gcc_assert (dispatcher_decl != NULL); | |
7681 | return dispatcher_decl; | |
7682 | } | |
7683 | ||
7684 | /* fn is a function version dispatcher that is marked used. Mark all the | |
7685 | semantically identical function versions it will dispatch as used. */ | |
7686 | ||
2d96fdef | 7687 | void |
cc8ef84f | 7688 | mark_versions_used (tree fn) |
7689 | { | |
7690 | struct cgraph_node *node; | |
7691 | struct cgraph_function_version_info *node_v; | |
7692 | struct cgraph_function_version_info *it_v; | |
7693 | ||
7694 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
7695 | ||
415d1b9a | 7696 | node = cgraph_node::get (fn); |
cc8ef84f | 7697 | if (node == NULL) |
7698 | return; | |
7699 | ||
7700 | gcc_assert (node->dispatcher_function); | |
7701 | ||
415d1b9a | 7702 | node_v = node->function_version (); |
cc8ef84f | 7703 | if (node_v == NULL) |
7704 | return; | |
7705 | ||
7706 | /* All semantically identical versions are chained. Traverse and mark each | |
7707 | one of them as used. */ | |
7708 | it_v = node_v->next; | |
7709 | while (it_v != NULL) | |
7710 | { | |
02774f2d | 7711 | mark_used (it_v->this_node->decl); |
cc8ef84f | 7712 | it_v = it_v->next; |
7713 | } | |
7714 | } | |
7715 | ||
bcc7f9c9 | 7716 | /* Build a call to "the copy constructor" for the type of A, even if it |
7717 | wouldn't be selected by normal overload resolution. Used for | |
7718 | diagnostics. */ | |
7719 | ||
7720 | static tree | |
7721 | call_copy_ctor (tree a, tsubst_flags_t complain) | |
7722 | { | |
7723 | tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a)); | |
7724 | tree binfo = TYPE_BINFO (ctype); | |
7725 | tree copy = get_copy_ctor (ctype, complain); | |
7726 | copy = build_baselink (binfo, binfo, copy, NULL_TREE); | |
7727 | tree ob = build_dummy_object (ctype); | |
7728 | vec<tree, va_gc>* args = make_tree_vector_single (a); | |
7729 | tree r = build_new_method_call (ob, copy, &args, NULL_TREE, | |
7730 | LOOKUP_NORMAL, NULL, complain); | |
7731 | release_tree_vector (args); | |
7732 | return r; | |
7733 | } | |
7734 | ||
feec154d | 7735 | /* Return true iff T refers to a base field. */ |
7736 | ||
7737 | static bool | |
7738 | is_base_field_ref (tree t) | |
7739 | { | |
7740 | STRIP_NOPS (t); | |
7741 | if (TREE_CODE (t) == ADDR_EXPR) | |
7742 | t = TREE_OPERAND (t, 0); | |
7743 | if (TREE_CODE (t) == COMPONENT_REF) | |
7744 | t = TREE_OPERAND (t, 1); | |
7745 | if (TREE_CODE (t) == FIELD_DECL) | |
7746 | return DECL_FIELD_IS_BASE (t); | |
7747 | return false; | |
7748 | } | |
7749 | ||
7750 | /* We can't elide a copy from a function returning by value to a base | |
7751 | subobject, as the callee might clobber tail padding. Return true iff this | |
7752 | could be that case. */ | |
7753 | ||
7754 | static bool | |
7755 | unsafe_copy_elision_p (tree target, tree exp) | |
7756 | { | |
390a9c9c | 7757 | /* Copy elision only happens with a TARGET_EXPR. */ |
7758 | if (TREE_CODE (exp) != TARGET_EXPR) | |
7759 | return false; | |
feec154d | 7760 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); |
1fb5285b | 7761 | /* It's safe to elide the copy for a class with no tail padding. */ |
7762 | if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type))) | |
feec154d | 7763 | return false; |
1fb5285b | 7764 | /* It's safe to elide the copy if we aren't initializing a base object. */ |
7765 | if (!is_base_field_ref (target)) | |
feec154d | 7766 | return false; |
7767 | tree init = TARGET_EXPR_INITIAL (exp); | |
74a96ca9 | 7768 | /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */ |
7769 | while (TREE_CODE (init) == COMPOUND_EXPR) | |
7770 | init = TREE_OPERAND (init, 1); | |
f52b11fe | 7771 | if (TREE_CODE (init) == COND_EXPR) |
7772 | { | |
7773 | /* We'll end up copying from each of the arms of the COND_EXPR directly | |
7774 | into the target, so look at them. */ | |
7775 | if (tree op = TREE_OPERAND (init, 1)) | |
7776 | if (unsafe_copy_elision_p (target, op)) | |
7777 | return true; | |
7778 | return unsafe_copy_elision_p (target, TREE_OPERAND (init, 2)); | |
7779 | } | |
feec154d | 7780 | return (TREE_CODE (init) == AGGR_INIT_EXPR |
7781 | && !AGGR_INIT_VIA_CTOR_P (init)); | |
7782 | } | |
7783 | ||
b248e783 | 7784 | /* True iff C is a conversion that binds a reference to a prvalue. */ |
7785 | ||
7786 | static bool | |
7787 | conv_binds_ref_to_prvalue (conversion *c) | |
7788 | { | |
7789 | if (c->kind != ck_ref_bind) | |
7790 | return false; | |
7791 | if (c->need_temporary_p) | |
7792 | return true; | |
7793 | ||
7794 | c = next_conversion (c); | |
7795 | ||
7796 | if (c->kind == ck_rvalue) | |
7797 | return true; | |
90ad495b | 7798 | if (c->kind == ck_user && !TYPE_REF_P (c->type)) |
b248e783 | 7799 | return true; |
df234ea9 | 7800 | if (c->kind == ck_identity && c->u.expr |
7801 | && TREE_CODE (c->u.expr) == TARGET_EXPR) | |
7802 | return true; | |
b248e783 | 7803 | |
7804 | return false; | |
7805 | } | |
7806 | ||
6ae0d78c | 7807 | /* Call the trivial destructor for INSTANCE, which can be either an lvalue of |
7808 | class type or a pointer to class type. */ | |
7809 | ||
7810 | tree | |
7811 | build_trivial_dtor_call (tree instance) | |
7812 | { | |
7813 | gcc_assert (!is_dummy_object (instance)); | |
7814 | ||
7815 | if (!flag_lifetime_dse) | |
7816 | { | |
7817 | no_clobber: | |
7818 | return fold_convert (void_type_node, instance); | |
7819 | } | |
7820 | ||
d03fa520 | 7821 | if (INDIRECT_TYPE_P (TREE_TYPE (instance))) |
6ae0d78c | 7822 | { |
7823 | if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) | |
7824 | goto no_clobber; | |
7825 | instance = cp_build_fold_indirect_ref (instance); | |
7826 | } | |
7827 | ||
7828 | /* A trivial destructor should still clobber the object. */ | |
7829 | tree clobber = build_clobber (TREE_TYPE (instance)); | |
7830 | return build2 (MODIFY_EXPR, void_type_node, | |
7831 | instance, clobber); | |
7832 | } | |
7833 | ||
cf4ef810 | 7834 | /* Subroutine of the various build_*_call functions. Overload resolution |
7835 | has chosen a winning candidate CAND; build up a CALL_EXPR accordingly. | |
7836 | ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a | |
7837 | bitmask of various LOOKUP_* flags which apply to the call itself. */ | |
7838 | ||
ec10e4ad | 7839 | static tree |
ebd21de4 | 7840 | build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain) |
ec10e4ad | 7841 | { |
94c2a480 | 7842 | tree fn = cand->fn; |
f1f41a6c | 7843 | const vec<tree, va_gc> *args = cand->args; |
f352a3fb | 7844 | tree first_arg = cand->first_arg; |
1611df57 | 7845 | conversion **convs = cand->convs; |
7846 | conversion *conv; | |
ec10e4ad | 7847 | tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
d01f58f9 | 7848 | int parmlen; |
f352a3fb | 7849 | tree val; |
ec10e4ad | 7850 | int i = 0; |
d01f58f9 | 7851 | int j = 0; |
f352a3fb | 7852 | unsigned int arg_index = 0; |
2739960c | 7853 | int is_method = 0; |
d01f58f9 | 7854 | int nargs; |
7855 | tree *argarray; | |
2336da2a | 7856 | bool already_used = false; |
ec10e4ad | 7857 | |
cdbcf942 | 7858 | /* In a template, there is no need to perform all of the work that |
7859 | is normally done. We are only interested in the type of the call | |
7860 | expression, i.e., the return type of the function. Any semantic | |
7861 | errors will be deferred until the template is instantiated. */ | |
7862 | if (processing_template_decl) | |
7863 | { | |
4405c1ad | 7864 | tree expr, addr; |
cdbcf942 | 7865 | tree return_type; |
f352a3fb | 7866 | const tree *argarray; |
7867 | unsigned int nargs; | |
7868 | ||
058e778f | 7869 | if (undeduced_auto_decl (fn)) |
7870 | mark_used (fn, complain); | |
ffd99ef2 | 7871 | else |
7872 | /* Otherwise set TREE_USED for the benefit of -Wunused-function. | |
7873 | See PR80598. */ | |
7874 | TREE_USED (fn) = 1; | |
058e778f | 7875 | |
cdbcf942 | 7876 | return_type = TREE_TYPE (TREE_TYPE (fn)); |
f1f41a6c | 7877 | nargs = vec_safe_length (args); |
f352a3fb | 7878 | if (first_arg == NULL_TREE) |
f1f41a6c | 7879 | argarray = args->address (); |
f352a3fb | 7880 | else |
7881 | { | |
7882 | tree *alcarray; | |
7883 | unsigned int ix; | |
7884 | tree arg; | |
7885 | ||
7886 | ++nargs; | |
7887 | alcarray = XALLOCAVEC (tree, nargs); | |
2a08bfb6 | 7888 | alcarray[0] = build_this (first_arg); |
f1f41a6c | 7889 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
f352a3fb | 7890 | alcarray[ix + 1] = arg; |
7891 | argarray = alcarray; | |
7892 | } | |
4405c1ad | 7893 | |
7894 | addr = build_addr_func (fn, complain); | |
7895 | if (addr == error_mark_node) | |
7896 | return error_mark_node; | |
7897 | expr = build_call_array_loc (input_location, return_type, | |
7898 | addr, nargs, argarray); | |
334f6ce1 | 7899 | if (TREE_THIS_VOLATILE (fn) && cfun) |
7900 | current_function_returns_abnormally = 1; | |
cdbcf942 | 7901 | return convert_from_reference (expr); |
7902 | } | |
7903 | ||
94c2a480 | 7904 | /* Give any warnings we noticed during overload resolution. */ |
0f16033e | 7905 | if (cand->warnings && (complain & tf_warning)) |
1611df57 | 7906 | { |
7907 | struct candidate_warning *w; | |
7908 | for (w = cand->warnings; w; w = w->next) | |
66bbeb85 | 7909 | joust (cand, w->loser, 1, complain); |
1611df57 | 7910 | } |
94c2a480 | 7911 | |
b248e783 | 7912 | /* Core issue 2327: P0135 doesn't say how to handle the case where the |
7913 | argument to the copy constructor ends up being a prvalue after | |
7914 | conversion. Let's do the normal processing, but pretend we aren't | |
7915 | actually using the copy constructor. */ | |
7916 | bool force_elide = false; | |
7917 | if (cxx_dialect >= cxx17 | |
7918 | && cand->num_convs == 1 | |
7919 | && DECL_COMPLETE_CONSTRUCTOR_P (fn) | |
7920 | && (DECL_COPY_CONSTRUCTOR_P (fn) | |
7921 | || DECL_MOVE_CONSTRUCTOR_P (fn)) | |
7922 | && conv_binds_ref_to_prvalue (convs[0])) | |
7923 | { | |
7924 | force_elide = true; | |
7925 | goto not_really_used; | |
7926 | } | |
7927 | ||
a294cb9e | 7928 | /* OK, we're actually calling this inherited constructor; set its deletedness |
7929 | appropriately. We can get away with doing this here because calling is | |
7930 | the only way to refer to a constructor. */ | |
7931 | if (DECL_INHERITED_CTOR (fn)) | |
7932 | deduce_inheriting_ctor (fn); | |
7933 | ||
16f0449a | 7934 | /* Make =delete work with SFINAE. */ |
417a5ba0 | 7935 | if (DECL_DELETED_FN (fn)) |
7936 | { | |
7937 | if (complain & tf_error) | |
7938 | mark_used (fn); | |
7939 | return error_mark_node; | |
7940 | } | |
16f0449a | 7941 | |
94c2a480 | 7942 | if (DECL_FUNCTION_MEMBER_P (fn)) |
034a6e26 | 7943 | { |
2ee92e27 | 7944 | tree access_fn; |
034a6e26 | 7945 | /* If FN is a template function, two cases must be considered. |
7946 | For example: | |
7947 | ||
7948 | struct A { | |
7949 | protected: | |
7950 | template <class T> void f(); | |
7951 | }; | |
7952 | template <class T> struct B { | |
7953 | protected: | |
7954 | void g(); | |
7955 | }; | |
7956 | struct C : A, B<int> { | |
7957 | using A::f; // #1 | |
7958 | using B<int>::g; // #2 | |
7959 | }; | |
7960 | ||
7961 | In case #1 where `A::f' is a member template, DECL_ACCESS is | |
7962 | recorded in the primary template but not in its specialization. | |
7963 | We check access of FN using its primary template. | |
7964 | ||
7965 | In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply | |
7966 | because it is a member of class template B, DECL_ACCESS is | |
7967 | recorded in the specialization `B<int>::g'. We cannot use its | |
7968 | primary template because `B<T>::g' and `B<int>::g' may have | |
7969 | different access. */ | |
7970 | if (DECL_TEMPLATE_INFO (fn) | |
38d89ee9 | 7971 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn))) |
2ee92e27 | 7972 | access_fn = DECL_TI_TEMPLATE (fn); |
034a6e26 | 7973 | else |
2ee92e27 | 7974 | access_fn = fn; |
eb833cbe | 7975 | if (!perform_or_defer_access_check (cand->access_path, access_fn, |
7976 | fn, complain)) | |
7977 | return error_mark_node; | |
2ee92e27 | 7978 | } |
7979 | ||
7980 | /* If we're checking for implicit delete, don't bother with argument | |
7981 | conversions. */ | |
7982 | if (flags & LOOKUP_SPECULATIVE) | |
7983 | { | |
2ee92e27 | 7984 | if (cand->viable == 1) |
7985 | return fn; | |
c4698a21 | 7986 | else if (!(complain & tf_error)) |
2ee92e27 | 7987 | /* Reject bad conversions now. */ |
7988 | return error_mark_node; | |
7989 | /* else continue to get conversion error. */ | |
034a6e26 | 7990 | } |
94c2a480 | 7991 | |
b248e783 | 7992 | not_really_used: |
7993 | ||
f87b283e | 7994 | /* N3276 magic doesn't apply to nested calls. */ |
8d47c1c5 | 7995 | tsubst_flags_t decltype_flag = (complain & tf_decltype); |
f87b283e | 7996 | complain &= ~tf_decltype; |
8d47c1c5 | 7997 | /* No-Cleanup doesn't apply to nested calls either. */ |
7998 | tsubst_flags_t no_cleanup_complain = complain; | |
7999 | complain &= ~tf_no_cleanup; | |
f87b283e | 8000 | |
d01f58f9 | 8001 | /* Find maximum size of vector to hold converted arguments. */ |
8002 | parmlen = list_length (parm); | |
f1f41a6c | 8003 | nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0); |
d01f58f9 | 8004 | if (parmlen > nargs) |
8005 | nargs = parmlen; | |
fd70b918 | 8006 | argarray = XALLOCAVEC (tree, nargs); |
d01f58f9 | 8007 | |
ec10e4ad | 8008 | /* The implicit parameters to a constructor are not considered by overload |
8009 | resolution, and must be of the proper type. */ | |
8010 | if (DECL_CONSTRUCTOR_P (fn)) | |
8011 | { | |
18619da5 | 8012 | tree object_arg; |
f352a3fb | 8013 | if (first_arg != NULL_TREE) |
8014 | { | |
18619da5 | 8015 | object_arg = first_arg; |
f352a3fb | 8016 | first_arg = NULL_TREE; |
8017 | } | |
8018 | else | |
8019 | { | |
18619da5 | 8020 | object_arg = (*args)[arg_index]; |
f352a3fb | 8021 | ++arg_index; |
8022 | } | |
18619da5 | 8023 | argarray[j++] = build_this (object_arg); |
ec10e4ad | 8024 | parm = TREE_CHAIN (parm); |
092b1d6f | 8025 | /* We should never try to call the abstract constructor. */ |
8026 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn)); | |
9031d10b | 8027 | |
dcbeb3ef | 8028 | if (DECL_HAS_VTT_PARM_P (fn)) |
ec10e4ad | 8029 | { |
f1f41a6c | 8030 | argarray[j++] = (*args)[arg_index]; |
f352a3fb | 8031 | ++arg_index; |
ec10e4ad | 8032 | parm = TREE_CHAIN (parm); |
8033 | } | |
ff00c674 | 8034 | |
8035 | if (flags & LOOKUP_PREFER_RVALUE) | |
8036 | { | |
8037 | /* The implicit move specified in 15.8.3/3 fails "...if the type of | |
8038 | the first parameter of the selected constructor is not an rvalue | |
a6e3a818 | 8039 | reference to the object's type (possibly cv-qualified)...." */ |
ff00c674 | 8040 | gcc_assert (!(complain & tf_error)); |
8041 | tree ptype = convs[0]->type; | |
90ad495b | 8042 | if (!TYPE_REF_P (ptype) |
ff00c674 | 8043 | || !TYPE_REF_IS_RVALUE (ptype) |
8044 | || CONVERSION_RANK (convs[0]) > cr_exact) | |
8045 | return error_mark_node; | |
8046 | } | |
9031d10b | 8047 | } |
ec10e4ad | 8048 | /* Bypass access control for 'this' parameter. */ |
8049 | else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
8050 | { | |
2739960c | 8051 | tree parmtype = TREE_VALUE (parm); |
18619da5 | 8052 | tree arg = build_this (first_arg != NULL_TREE |
8053 | ? first_arg | |
8054 | : (*args)[arg_index]); | |
f352a3fb | 8055 | tree argtype = TREE_TYPE (arg); |
f70cb9e6 | 8056 | tree converted_arg; |
cc50c77e | 8057 | tree base_binfo; |
9031d10b | 8058 | |
c017458d | 8059 | if (arg == error_mark_node) |
8060 | return error_mark_node; | |
8061 | ||
1611df57 | 8062 | if (convs[i]->bad_p) |
ebd21de4 | 8063 | { |
8064 | if (complain & tf_error) | |
2371bf7c | 8065 | { |
bc35ef65 | 8066 | auto_diagnostic_group d; |
2371bf7c | 8067 | if (permerror (input_location, "passing %qT as %<this%> " |
8068 | "argument discards qualifiers", | |
8069 | TREE_TYPE (argtype))) | |
8070 | inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn); | |
8071 | } | |
ebd21de4 | 8072 | else |
8073 | return error_mark_node; | |
8074 | } | |
3e04bd45 | 8075 | |
6b45067f | 8076 | /* See if the function member or the whole class type is declared |
8077 | final and the call can be devirtualized. */ | |
8078 | if (DECL_FINAL_P (fn) | |
8079 | || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn)))) | |
8080 | flags |= LOOKUP_NONVIRTUAL; | |
8081 | ||
3428ae0a | 8082 | /* [class.mfct.nonstatic]: If a nonstatic member function of a class |
8083 | X is called for an object that is not of type X, or of a type | |
8084 | derived from X, the behavior is undefined. | |
8085 | ||
653e5405 | 8086 | So we can assume that anything passed as 'this' is non-null, and |
3428ae0a | 8087 | optimize accordingly. */ |
c21c015b | 8088 | gcc_assert (TYPE_PTR_P (parmtype)); |
f70cb9e6 | 8089 | /* Convert to the base in which the function was declared. */ |
b4df430b | 8090 | gcc_assert (cand->conversion_path != NULL_TREE); |
f70cb9e6 | 8091 | converted_arg = build_base_path (PLUS_EXPR, |
f352a3fb | 8092 | arg, |
f70cb9e6 | 8093 | cand->conversion_path, |
1e74225a | 8094 | 1, complain); |
3a47db1e | 8095 | /* Check that the base class is accessible. */ |
9031d10b | 8096 | if (!accessible_base_p (TREE_TYPE (argtype), |
ada40935 | 8097 | BINFO_TYPE (cand->conversion_path), true)) |
19b271a9 | 8098 | { |
8099 | if (complain & tf_error) | |
8100 | error ("%qT is not an accessible base of %qT", | |
8101 | BINFO_TYPE (cand->conversion_path), | |
8102 | TREE_TYPE (argtype)); | |
8103 | else | |
8104 | return error_mark_node; | |
8105 | } | |
cc50c77e | 8106 | /* If fn was found by a using declaration, the conversion path |
653e5405 | 8107 | will be to the derived class, not the base declaring fn. We |
8108 | must convert from derived to base. */ | |
cc50c77e | 8109 | base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)), |
ae260dcc | 8110 | TREE_TYPE (parmtype), ba_unique, |
8111 | NULL, complain); | |
cc50c77e | 8112 | converted_arg = build_base_path (PLUS_EXPR, converted_arg, |
1e74225a | 8113 | base_binfo, 1, complain); |
9031d10b | 8114 | |
d01f58f9 | 8115 | argarray[j++] = converted_arg; |
ec10e4ad | 8116 | parm = TREE_CHAIN (parm); |
f352a3fb | 8117 | if (first_arg != NULL_TREE) |
8118 | first_arg = NULL_TREE; | |
8119 | else | |
8120 | ++arg_index; | |
ec10e4ad | 8121 | ++i; |
2739960c | 8122 | is_method = 1; |
ec10e4ad | 8123 | } |
8124 | ||
f352a3fb | 8125 | gcc_assert (first_arg == NULL_TREE); |
f1f41a6c | 8126 | for (; arg_index < vec_safe_length (args) && parm; |
f352a3fb | 8127 | parm = TREE_CHAIN (parm), ++arg_index, ++i) |
ec10e4ad | 8128 | { |
8129 | tree type = TREE_VALUE (parm); | |
f1f41a6c | 8130 | tree arg = (*args)[arg_index]; |
822dd80c | 8131 | bool conversion_warning = true; |
2739960c | 8132 | |
1611df57 | 8133 | conv = convs[i]; |
144b133c | 8134 | |
822dd80c | 8135 | /* If the argument is NULL and used to (implicitly) instantiate a |
8136 | template function (and bind one of the template arguments to | |
8137 | the type of 'long int'), we don't want to warn about passing NULL | |
8138 | to non-pointer argument. | |
8139 | For example, if we have this template function: | |
8140 | ||
8141 | template<typename T> void func(T x) {} | |
8142 | ||
8143 | we want to warn (when -Wconversion is enabled) in this case: | |
8144 | ||
8145 | void foo() { | |
8146 | func<int>(NULL); | |
8147 | } | |
8148 | ||
8149 | but not in this case: | |
8150 | ||
8151 | void foo() { | |
8152 | func(NULL); | |
8153 | } | |
8154 | */ | |
d76863c8 | 8155 | if (null_node_p (arg) |
822dd80c | 8156 | && DECL_TEMPLATE_INFO (fn) |
8157 | && cand->template_decl | |
8158 | && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS)) | |
8159 | conversion_warning = false; | |
8160 | ||
a9e738c1 | 8161 | /* Warn about initializer_list deduction that isn't currently in the |
8162 | working draft. */ | |
8163 | if (cxx_dialect > cxx98 | |
8164 | && flag_deduce_init_list | |
8165 | && cand->template_decl | |
36a01cad | 8166 | && is_std_init_list (non_reference (type)) |
8167 | && BRACE_ENCLOSED_INITIALIZER_P (arg)) | |
a9e738c1 | 8168 | { |
8169 | tree tmpl = TI_TEMPLATE (cand->template_decl); | |
8170 | tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn)); | |
8171 | tree patparm = get_pattern_parm (realparm, tmpl); | |
1dafbced | 8172 | tree pattype = TREE_TYPE (patparm); |
8173 | if (PACK_EXPANSION_P (pattype)) | |
8174 | pattype = PACK_EXPANSION_PATTERN (pattype); | |
8175 | pattype = non_reference (pattype); | |
a9e738c1 | 8176 | |
3fbd1228 | 8177 | if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM |
8178 | && (cand->explicit_targs == NULL_TREE | |
8179 | || (TREE_VEC_LENGTH (cand->explicit_targs) | |
8180 | <= TEMPLATE_TYPE_IDX (pattype)))) | |
a9e738c1 | 8181 | { |
8182 | pedwarn (input_location, 0, "deducing %qT as %qT", | |
8183 | non_reference (TREE_TYPE (patparm)), | |
8184 | non_reference (type)); | |
66ed189d | 8185 | pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0, |
8186 | " in call to %qD", cand->fn); | |
a9e738c1 | 8187 | pedwarn (input_location, 0, |
8188 | " (you can disable this with -fno-deduce-init-list)"); | |
8189 | } | |
8190 | } | |
c821ae1a | 8191 | |
8192 | /* Set user_conv_p on the argument conversions, so rvalue/base handling | |
8193 | knows not to allow any more UDCs. This needs to happen after we | |
8194 | process cand->warnings. */ | |
8195 | if (flags & LOOKUP_NO_CONVERSION) | |
8196 | conv->user_conv_p = true; | |
8197 | ||
8d47c1c5 | 8198 | tsubst_flags_t arg_complain = complain; |
1555b8a1 | 8199 | if (!conversion_warning) |
8200 | arg_complain &= ~tf_warning; | |
a9e738c1 | 8201 | |
1555b8a1 | 8202 | val = convert_like_with_context (conv, arg, fn, i - is_method, |
8203 | arg_complain); | |
8204 | val = convert_for_arg_passing (type, val, arg_complain); | |
936c3081 | 8205 | |
659a8f7b | 8206 | if (val == error_mark_node) |
ebd21de4 | 8207 | return error_mark_node; |
8208 | else | |
8209 | argarray[j++] = val; | |
ec10e4ad | 8210 | } |
8211 | ||
8212 | /* Default arguments */ | |
5db59a08 | 8213 | for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++) |
57fba9a7 | 8214 | { |
8215 | if (TREE_VALUE (parm) == error_mark_node) | |
8216 | return error_mark_node; | |
0386bbee | 8217 | val = convert_default_arg (TREE_VALUE (parm), |
8218 | TREE_PURPOSE (parm), | |
8219 | fn, i - is_method, | |
8220 | complain); | |
8221 | if (val == error_mark_node) | |
8222 | return error_mark_node; | |
8223 | argarray[j++] = val; | |
57fba9a7 | 8224 | } |
8225 | ||
ec10e4ad | 8226 | /* Ellipsis */ |
06c75b9a | 8227 | int magic = magic_varargs_p (fn); |
f1f41a6c | 8228 | for (; arg_index < vec_safe_length (args); ++arg_index) |
cf91a12d | 8229 | { |
f1f41a6c | 8230 | tree a = (*args)[arg_index]; |
7318e591 | 8231 | if ((magic == 3 && arg_index == 2) || magic == 2) |
e2895b76 | 8232 | { |
8233 | /* Do no conversions for certain magic varargs. */ | |
8234 | a = mark_type_use (a); | |
8235 | if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a)) | |
8236 | return error_mark_node; | |
8237 | } | |
7318e591 | 8238 | else if (magic != 0) |
e2895b76 | 8239 | /* For other magic varargs only do decay_conversion. */ |
8240 | a = decay_conversion (a, complain); | |
bcc7f9c9 | 8241 | else if (DECL_CONSTRUCTOR_P (fn) |
8242 | && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn), | |
8243 | TREE_TYPE (a))) | |
8244 | { | |
8245 | /* Avoid infinite recursion trying to call A(...). */ | |
8246 | if (complain & tf_error) | |
8247 | /* Try to call the actual copy constructor for a good error. */ | |
8248 | call_copy_ctor (a, complain); | |
8249 | return error_mark_node; | |
8250 | } | |
cf91a12d | 8251 | else |
66bbeb85 | 8252 | a = convert_arg_to_ellipsis (a, complain); |
e2895b76 | 8253 | if (a == error_mark_node) |
8254 | return error_mark_node; | |
d01f58f9 | 8255 | argarray[j++] = a; |
cf91a12d | 8256 | } |
ec10e4ad | 8257 | |
d01f58f9 | 8258 | gcc_assert (j <= nargs); |
8259 | nargs = j; | |
ec10e4ad | 8260 | |
d2c63826 | 8261 | /* Avoid to do argument-transformation, if warnings for format, and for |
8262 | nonnull are disabled. Just in case that at least one of them is active | |
8263 | the check_function_arguments function might warn about something. */ | |
8264 | ||
184fac50 | 8265 | bool warned_p = false; |
bbd5521e | 8266 | if (warn_nonnull |
8267 | || warn_format | |
8268 | || warn_suggest_attribute_format | |
8269 | || warn_restrict) | |
d2c63826 | 8270 | { |
8271 | tree *fargs = (!nargs ? argarray | |
8272 | : (tree *) alloca (nargs * sizeof (tree))); | |
8273 | for (j = 0; j < nargs; j++) | |
533f67f1 | 8274 | { |
8275 | /* For -Wformat undo the implicit passing by hidden reference | |
8276 | done by convert_arg_to_ellipsis. */ | |
8277 | if (TREE_CODE (argarray[j]) == ADDR_EXPR | |
90ad495b | 8278 | && TYPE_REF_P (TREE_TYPE (argarray[j]))) |
533f67f1 | 8279 | fargs[j] = TREE_OPERAND (argarray[j], 0); |
8280 | else | |
8e415b30 | 8281 | fargs[j] = argarray[j]; |
533f67f1 | 8282 | } |
d2c63826 | 8283 | |
bbd5521e | 8284 | warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn), |
8e415b30 | 8285 | nargs, fargs, NULL); |
d2c63826 | 8286 | } |
477f2174 | 8287 | |
7896267d | 8288 | if (DECL_INHERITED_CTOR (fn)) |
8289 | { | |
8290 | /* Check for passing ellipsis arguments to an inherited constructor. We | |
8291 | could handle this by open-coding the inherited constructor rather than | |
8292 | defining it, but let's not bother now. */ | |
8293 | if (!cp_unevaluated_operand | |
5dd8ae13 | 8294 | && cand->num_convs |
7896267d | 8295 | && cand->convs[cand->num_convs-1]->ellipsis_p) |
8296 | { | |
8297 | if (complain & tf_error) | |
8298 | { | |
8299 | sorry ("passing arguments to ellipsis of inherited constructor " | |
8300 | "%qD", cand->fn); | |
8301 | inform (DECL_SOURCE_LOCATION (cand->fn), "declared here"); | |
8302 | } | |
8303 | return error_mark_node; | |
8304 | } | |
8305 | ||
8306 | /* A base constructor inheriting from a virtual base doesn't get the | |
8307 | inherited arguments, just this and __vtt. */ | |
8308 | if (ctor_omit_inherited_parms (fn)) | |
8309 | nargs = 2; | |
8310 | } | |
8311 | ||
f9670f72 | 8312 | /* Avoid actually calling copy constructors and copy assignment operators, |
8313 | if possible. */ | |
5eaed30b | 8314 | |
b248e783 | 8315 | if (! flag_elide_constructors && !force_elide) |
5eaed30b | 8316 | /* Do things the hard way. */; |
63949b38 | 8317 | else if (cand->num_convs == 1 |
8318 | && (DECL_COPY_CONSTRUCTOR_P (fn) | |
2d2e5b37 | 8319 | || DECL_MOVE_CONSTRUCTOR_P (fn)) |
8320 | /* It's unsafe to elide the constructor when handling | |
8321 | a noexcept-expression, it may evaluate to the wrong | |
8322 | value (c++/53025). */ | |
b248e783 | 8323 | && (force_elide || cp_noexcept_operand == 0)) |
f9670f72 | 8324 | { |
c76251c1 | 8325 | tree targ; |
f352a3fb | 8326 | tree arg = argarray[num_artificial_parms_for (fn)]; |
8327 | tree fa; | |
2ee92e27 | 8328 | bool trivial = trivial_fn_p (fn); |
f9670f72 | 8329 | |
8330 | /* Pull out the real argument, disregarding const-correctness. */ | |
c76251c1 | 8331 | targ = arg; |
a4d6d852 | 8332 | /* Strip the reference binding for the constructor parameter. */ |
8333 | if (CONVERT_EXPR_P (targ) | |
90ad495b | 8334 | && TYPE_REF_P (TREE_TYPE (targ))) |
a4d6d852 | 8335 | targ = TREE_OPERAND (targ, 0); |
8336 | /* But don't strip any other reference bindings; binding a temporary to a | |
8337 | reference prevents copy elision. */ | |
8338 | while ((CONVERT_EXPR_P (targ) | |
90ad495b | 8339 | && !TYPE_REF_P (TREE_TYPE (targ))) |
e226f39b | 8340 | || TREE_CODE (targ) == NON_LVALUE_EXPR) |
c76251c1 | 8341 | targ = TREE_OPERAND (targ, 0); |
8342 | if (TREE_CODE (targ) == ADDR_EXPR) | |
8343 | { | |
8344 | targ = TREE_OPERAND (targ, 0); | |
9031d10b | 8345 | if (!same_type_ignoring_top_level_qualifiers_p |
1361fb16 | 8346 | (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ))) |
f9670f72 | 8347 | targ = NULL_TREE; |
8348 | } | |
c76251c1 | 8349 | else |
8350 | targ = NULL_TREE; | |
f9670f72 | 8351 | |
8352 | if (targ) | |
8353 | arg = targ; | |
8354 | else | |
0744a0c1 | 8355 | arg = cp_build_fold_indirect_ref (arg); |
f9670f72 | 8356 | |
ceab25e5 | 8357 | /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base |
8358 | subobject. */ | |
40e2decb | 8359 | if (CHECKING_P && cxx_dialect >= cxx17) |
ceab25e5 | 8360 | gcc_assert (TREE_CODE (arg) != TARGET_EXPR |
b248e783 | 8361 | || force_elide |
e67b8ee3 | 8362 | /* It's from binding the ref parm to a packed field. */ |
8363 | || convs[0]->need_temporary_p | |
c821ae1a | 8364 | || seen_error () |
ceab25e5 | 8365 | /* See unsafe_copy_elision_p. */ |
8366 | || DECL_BASE_CONSTRUCTOR_P (fn)); | |
8367 | ||
17847cff | 8368 | fa = argarray[0]; |
8369 | bool unsafe = unsafe_copy_elision_p (fa, arg); | |
8370 | bool eliding_temp = (TREE_CODE (arg) == TARGET_EXPR && !unsafe); | |
8371 | ||
8372 | /* [class.copy]: the copy constructor is implicitly defined even if the | |
8373 | implementation elided its use. But don't warn about deprecation when | |
8374 | eliding a temporary, as then no copy is actually performed. */ | |
8375 | warning_sentinel s (warn_deprecated_copy, eliding_temp); | |
8376 | if (force_elide) | |
8377 | /* The language says this isn't called. */; | |
8378 | else if (!trivial) | |
2336da2a | 8379 | { |
4430f688 | 8380 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
8381 | return error_mark_node; | |
2336da2a | 8382 | already_used = true; |
8383 | } | |
17847cff | 8384 | else |
8385 | cp_warn_deprecated_use (fn, complain); | |
b465397d | 8386 | |
f9670f72 | 8387 | /* If we're creating a temp and we already have one, don't create a |
653e5405 | 8388 | new one. If we're not creating a temp but we get one, use |
8389 | INIT_EXPR to collapse the temp into our target. Otherwise, if the | |
8390 | ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a | |
8391 | temp or an INIT_EXPR otherwise. */ | |
6da7682f | 8392 | if (is_dummy_object (fa)) |
f9670f72 | 8393 | { |
a6543b83 | 8394 | if (TREE_CODE (arg) == TARGET_EXPR) |
f9670f72 | 8395 | return arg; |
2ee92e27 | 8396 | else if (trivial) |
9e505437 | 8397 | return force_target_expr (DECL_CONTEXT (fn), arg, complain); |
f9670f72 | 8398 | } |
390a9c9c | 8399 | else if ((trivial || TREE_CODE (arg) == TARGET_EXPR) |
17847cff | 8400 | && !unsafe) |
f9670f72 | 8401 | { |
0744a0c1 | 8402 | tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa)); |
2af98c0d | 8403 | |
eda37335 | 8404 | val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg); |
4ee9c684 | 8405 | return val; |
f9670f72 | 8406 | } |
8407 | } | |
ef8f6502 | 8408 | else if (DECL_ASSIGNMENT_OPERATOR_P (fn) |
8409 | && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR) | |
417a5ba0 | 8410 | && trivial_fn_p (fn)) |
f9670f72 | 8411 | { |
514727a9 | 8412 | tree to = cp_stabilize_reference |
0744a0c1 | 8413 | (cp_build_fold_indirect_ref (argarray[0])); |
37ea1c3f | 8414 | tree type = TREE_TYPE (to); |
8415 | tree as_base = CLASSTYPE_AS_BASE (type); | |
f352a3fb | 8416 | tree arg = argarray[1]; |
d3a3cfb8 | 8417 | location_t loc = cp_expr_loc_or_loc (arg, input_location); |
2af98c0d | 8418 | |
3922bea3 | 8419 | if (is_really_empty_class (type)) |
8420 | { | |
8421 | /* Avoid copying empty classes. */ | |
06c75b9a | 8422 | val = build2 (COMPOUND_EXPR, type, arg, to); |
3922bea3 | 8423 | TREE_NO_WARNING (val) = 1; |
8424 | } | |
8425 | else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base))) | |
30284d7a | 8426 | { |
06a58535 | 8427 | if (is_std_init_list (type) |
8428 | && conv_binds_ref_to_prvalue (convs[1])) | |
8429 | warning_at (loc, OPT_Winit_list_lifetime, | |
8430 | "assignment from temporary initializer_list does not " | |
8431 | "extend the lifetime of the underlying array"); | |
0744a0c1 | 8432 | arg = cp_build_fold_indirect_ref (arg); |
831d52a2 | 8433 | val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg); |
30284d7a | 8434 | } |
37ea1c3f | 8435 | else |
8436 | { | |
70a588b3 | 8437 | /* We must only copy the non-tail padding parts. */ |
8438 | tree arg0, arg2, t; | |
8439 | tree array_type, alias_set; | |
30284d7a | 8440 | |
d01f58f9 | 8441 | arg2 = TYPE_SIZE_UNIT (as_base); |
d6fbd579 | 8442 | arg0 = cp_build_addr_expr (to, complain); |
0873e517 | 8443 | |
93312944 | 8444 | array_type = build_array_type (unsigned_char_type_node, |
70a588b3 | 8445 | build_index_type |
8446 | (size_binop (MINUS_EXPR, | |
8447 | arg2, size_int (1)))); | |
8448 | alias_set = build_int_cst (build_pointer_type (type), 0); | |
8449 | t = build2 (MODIFY_EXPR, void_type_node, | |
8450 | build2 (MEM_REF, array_type, arg0, alias_set), | |
8451 | build2 (MEM_REF, array_type, arg, alias_set)); | |
8452 | val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to); | |
a4d4030b | 8453 | TREE_NO_WARNING (val) = 1; |
37ea1c3f | 8454 | } |
9031d10b | 8455 | |
17847cff | 8456 | cp_warn_deprecated_use (fn, complain); |
8457 | ||
f9670f72 | 8458 | return val; |
8459 | } | |
417a5ba0 | 8460 | else if (trivial_fn_p (fn)) |
030c09aa | 8461 | { |
8462 | if (DECL_DESTRUCTOR_P (fn)) | |
6ae0d78c | 8463 | return build_trivial_dtor_call (argarray[0]); |
030c09aa | 8464 | else if (default_ctor_p (fn)) |
8465 | { | |
8466 | if (is_dummy_object (argarray[0])) | |
8d47c1c5 | 8467 | return force_target_expr (DECL_CONTEXT (fn), void_node, |
8468 | no_cleanup_complain); | |
030c09aa | 8469 | else |
0744a0c1 | 8470 | return cp_build_fold_indirect_ref (argarray[0]); |
030c09aa | 8471 | } |
8472 | } | |
f9670f72 | 8473 | |
b248e783 | 8474 | gcc_assert (!force_elide); |
8475 | ||
a9388250 | 8476 | if (!already_used |
9550983d | 8477 | && !mark_used (fn, complain)) |
a9388250 | 8478 | return error_mark_node; |
b465397d | 8479 | |
4b97404d | 8480 | /* Warn if the built-in writes to an object of a non-trivial type. */ |
8481 | if (warn_class_memaccess | |
8482 | && vec_safe_length (args) >= 2 | |
8483 | && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL) | |
8484 | maybe_warn_class_memaccess (input_location, fn, args); | |
8485 | ||
bb6e576c | 8486 | if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0) |
ec10e4ad | 8487 | { |
d01f58f9 | 8488 | tree t; |
8489 | tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])), | |
c83788c9 | 8490 | DECL_CONTEXT (fn), |
ae260dcc | 8491 | ba_any, NULL, complain); |
b4df430b | 8492 | gcc_assert (binfo && binfo != error_mark_node); |
9031d10b | 8493 | |
1e74225a | 8494 | argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1, |
8495 | complain); | |
d01f58f9 | 8496 | if (TREE_SIDE_EFFECTS (argarray[0])) |
8497 | argarray[0] = save_expr (argarray[0]); | |
ec10e4ad | 8498 | t = build_pointer_type (TREE_TYPE (fn)); |
c93d719b | 8499 | fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn)); |
ec10e4ad | 8500 | TREE_TYPE (fn) = t; |
8501 | } | |
ec10e4ad | 8502 | else |
4405c1ad | 8503 | { |
8504 | fn = build_addr_func (fn, complain); | |
8505 | if (fn == error_mark_node) | |
8506 | return error_mark_node; | |
8507 | } | |
ec10e4ad | 8508 | |
91d81115 | 8509 | tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag); |
7896267d | 8510 | if (call == error_mark_node) |
8511 | return call; | |
8512 | if (cand->flags & LOOKUP_LIST_INIT_CTOR) | |
06c75b9a | 8513 | { |
8514 | tree c = extract_call_expr (call); | |
8515 | /* build_new_op_1 will clear this when appropriate. */ | |
8516 | CALL_EXPR_ORDERED_ARGS (c) = true; | |
8517 | } | |
184fac50 | 8518 | if (warned_p) |
8519 | { | |
8520 | tree c = extract_call_expr (call); | |
8521 | if (TREE_CODE (c) == CALL_EXPR) | |
8522 | TREE_NO_WARNING (c) = 1; | |
8523 | } | |
91d81115 | 8524 | return call; |
95cedffb | 8525 | } |
8526 | ||
55beab02 | 8527 | namespace |
8528 | { | |
a324786b | 8529 | |
55beab02 | 8530 | /* Return the DECL of the first non-static subobject of class TYPE |
8531 | that satisfies the predicate PRED or null if none can be found. */ | |
8532 | ||
8533 | template <class Predicate> | |
8534 | tree | |
8535 | first_non_static_field (tree type, Predicate pred) | |
a324786b | 8536 | { |
55beab02 | 8537 | if (!type || !CLASS_TYPE_P (type)) |
a324786b | 8538 | return NULL_TREE; |
8539 | ||
8540 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
8541 | { | |
8542 | if (TREE_CODE (field) != FIELD_DECL) | |
8543 | continue; | |
8544 | if (TREE_STATIC (field)) | |
8545 | continue; | |
55beab02 | 8546 | if (pred (field)) |
a324786b | 8547 | return field; |
8548 | } | |
8549 | ||
8550 | int i = 0; | |
8551 | ||
8552 | for (tree base_binfo, binfo = TYPE_BINFO (type); | |
8553 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8554 | { | |
8555 | tree base = TREE_TYPE (base_binfo); | |
55beab02 | 8556 | if (pred (base)) |
8557 | return base; | |
8558 | if (tree field = first_non_static_field (base, pred)) | |
a324786b | 8559 | return field; |
8560 | } | |
8561 | ||
8562 | return NULL_TREE; | |
8563 | } | |
8564 | ||
55beab02 | 8565 | struct NonPublicField |
8566 | { | |
8567 | bool operator() (const_tree t) | |
8568 | { | |
8569 | return DECL_P (t) && (TREE_PRIVATE (t) || TREE_PROTECTED (t)); | |
8570 | } | |
8571 | }; | |
8572 | ||
8573 | /* Return the DECL of the first non-public subobject of class TYPE | |
8574 | or null if none can be found. */ | |
8575 | ||
8576 | static inline tree | |
8577 | first_non_public_field (tree type) | |
8578 | { | |
8579 | return first_non_static_field (type, NonPublicField ()); | |
8580 | } | |
8581 | ||
8582 | struct NonTrivialField | |
8583 | { | |
8584 | bool operator() (const_tree t) | |
8585 | { | |
8586 | return !trivial_type_p (DECL_P (t) ? TREE_TYPE (t) : t); | |
8587 | } | |
8588 | }; | |
8589 | ||
8590 | /* Return the DECL of the first non-trivial subobject of class TYPE | |
8591 | or null if none can be found. */ | |
8592 | ||
8593 | static inline tree | |
8594 | first_non_trivial_field (tree type) | |
8595 | { | |
8596 | return first_non_static_field (type, NonTrivialField ()); | |
8597 | } | |
8598 | ||
8599 | } /* unnamed namespace */ | |
8600 | ||
a324786b | 8601 | /* Return true if all copy and move assignment operator overloads for |
8602 | class TYPE are trivial and at least one of them is not deleted and, | |
8603 | when ACCESS is set, accessible. Return false otherwise. Set | |
8604 | HASASSIGN to true when the TYPE has a (not necessarily trivial) | |
8605 | copy or move assignment. */ | |
8606 | ||
8607 | static bool | |
8608 | has_trivial_copy_assign_p (tree type, bool access, bool *hasassign) | |
8609 | { | |
ef8f6502 | 8610 | tree fns = get_class_binding (type, assign_op_identifier); |
a324786b | 8611 | bool all_trivial = true; |
8612 | ||
8613 | /* Iterate over overloads of the assignment operator, checking | |
8614 | accessible copy assignments for triviality. */ | |
8615 | ||
8616 | for (ovl_iterator oi (fns); oi; ++oi) | |
8617 | { | |
8618 | tree f = *oi; | |
8619 | ||
8620 | /* Skip operators that aren't copy assignments. */ | |
8621 | if (!copy_fn_p (f)) | |
8622 | continue; | |
8623 | ||
8624 | bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f)) | |
8625 | || accessible_p (TYPE_BINFO (type), f, true)); | |
8626 | ||
8627 | /* Skip template assignment operators and deleted functions. */ | |
8628 | if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f)) | |
8629 | continue; | |
8630 | ||
8631 | if (accessible) | |
8632 | *hasassign = true; | |
8633 | ||
8634 | if (!accessible || !trivial_fn_p (f)) | |
8635 | all_trivial = false; | |
8636 | ||
8637 | /* Break early when both properties have been determined. */ | |
8638 | if (*hasassign && !all_trivial) | |
8639 | break; | |
8640 | } | |
8641 | ||
8642 | /* Return true if they're all trivial and one of the expressions | |
8643 | TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */ | |
8644 | tree ref = cp_build_reference_type (type, false); | |
8645 | return (all_trivial | |
8646 | && (is_trivially_xible (MODIFY_EXPR, type, type) | |
8647 | || is_trivially_xible (MODIFY_EXPR, type, ref))); | |
8648 | } | |
8649 | ||
8650 | /* Return true if all copy and move ctor overloads for class TYPE are | |
8651 | trivial and at least one of them is not deleted and, when ACCESS is | |
8652 | set, accessible. Return false otherwise. Set each element of HASCTOR[] | |
8653 | to true when the TYPE has a (not necessarily trivial) default and copy | |
8654 | (or move) ctor, respectively. */ | |
8655 | ||
8656 | static bool | |
8657 | has_trivial_copy_p (tree type, bool access, bool hasctor[2]) | |
8658 | { | |
e12c5305 | 8659 | tree fns = get_class_binding (type, complete_ctor_identifier); |
a324786b | 8660 | bool all_trivial = true; |
8661 | ||
8662 | for (ovl_iterator oi (fns); oi; ++oi) | |
8663 | { | |
8664 | tree f = *oi; | |
8665 | ||
8666 | /* Skip template constructors. */ | |
8667 | if (TREE_CODE (f) != FUNCTION_DECL) | |
8668 | continue; | |
8669 | ||
8670 | bool cpy_or_move_ctor_p = copy_fn_p (f); | |
8671 | ||
8672 | /* Skip ctors other than default, copy, and move. */ | |
8673 | if (!cpy_or_move_ctor_p && !default_ctor_p (f)) | |
8674 | continue; | |
8675 | ||
8676 | if (DECL_DELETED_FN (f)) | |
8677 | continue; | |
8678 | ||
8679 | bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f)) | |
8680 | || accessible_p (TYPE_BINFO (type), f, true)); | |
8681 | ||
8682 | if (accessible) | |
8683 | hasctor[cpy_or_move_ctor_p] = true; | |
8684 | ||
8685 | if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f))) | |
8686 | all_trivial = false; | |
8687 | ||
8688 | /* Break early when both properties have been determined. */ | |
8689 | if (hasctor[0] && hasctor[1] && !all_trivial) | |
8690 | break; | |
8691 | } | |
8692 | ||
8693 | return all_trivial; | |
8694 | } | |
8695 | ||
8696 | /* Issue a warning on a call to the built-in function FNDECL if it is | |
8697 | a raw memory write whose destination is not an object of (something | |
8698 | like) trivial or standard layout type with a non-deleted assignment | |
8699 | and copy ctor. Detects const correctness violations, corrupting | |
8700 | references, virtual table pointers, and bypassing non-trivial | |
8701 | assignments. */ | |
8702 | ||
8703 | static void | |
4b97404d | 8704 | maybe_warn_class_memaccess (location_t loc, tree fndecl, |
8705 | const vec<tree, va_gc> *args) | |
a324786b | 8706 | { |
8707 | /* Except for bcopy where it's second, the destination pointer is | |
8708 | the first argument for all functions handled here. Compute | |
8709 | the index of the destination and source arguments. */ | |
8710 | unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY; | |
8711 | unsigned srcidx = !dstidx; | |
8712 | ||
4b97404d | 8713 | tree dest = (*args)[dstidx]; |
d03fa520 | 8714 | if (!TREE_TYPE (dest) || !INDIRECT_TYPE_P (TREE_TYPE (dest))) |
a324786b | 8715 | return; |
8716 | ||
a324786b | 8717 | tree srctype = NULL_TREE; |
8718 | ||
8719 | /* Determine the type of the pointed-to object and whether it's | |
8720 | a complete class type. */ | |
8721 | tree desttype = TREE_TYPE (TREE_TYPE (dest)); | |
8722 | ||
8723 | if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype)) | |
8724 | return; | |
8725 | ||
55beab02 | 8726 | /* Check to see if the raw memory call is made by a non-static member |
8727 | function with THIS as the destination argument for the destination | |
8728 | type. If so, and if the class has no non-trivial bases or members, | |
8729 | be more permissive. */ | |
a324786b | 8730 | if (current_function_decl |
55beab02 | 8731 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl) |
c7042331 | 8732 | && is_this_parameter (tree_strip_nop_conversions (dest))) |
a324786b | 8733 | { |
8734 | tree ctx = DECL_CONTEXT (current_function_decl); | |
8735 | bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype); | |
a324786b | 8736 | tree binfo = TYPE_BINFO (ctx); |
8737 | ||
55beab02 | 8738 | if (special |
8739 | && !BINFO_VTABLE (binfo) | |
8740 | && !first_non_trivial_field (desttype)) | |
a324786b | 8741 | return; |
8742 | } | |
8743 | ||
8744 | /* True if the class is trivial. */ | |
8745 | bool trivial = trivial_type_p (desttype); | |
8746 | ||
8747 | /* Set to true if DESTYPE has an accessible copy assignment. */ | |
8748 | bool hasassign = false; | |
8749 | /* True if all of the class' overloaded copy assignment operators | |
8750 | are all trivial (and not deleted) and at least one of them is | |
8751 | accessible. */ | |
8752 | bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign); | |
8753 | ||
8754 | /* Set to true if DESTTYPE has an accessible default and copy ctor, | |
8755 | respectively. */ | |
8756 | bool hasctors[2] = { false, false }; | |
8757 | ||
8758 | /* True if all of the class' overloaded copy constructors are all | |
8759 | trivial (and not deleted) and at least one of them is accessible. */ | |
8760 | bool trivcopy = has_trivial_copy_p (desttype, true, hasctors); | |
8761 | ||
8762 | /* Set FLD to the first private/protected member of the class. */ | |
8763 | tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE; | |
8764 | ||
8765 | /* The warning format string. */ | |
8766 | const char *warnfmt = NULL; | |
8767 | /* A suggested alternative to offer instead of the raw memory call. | |
8768 | Empty string when none can be come up with. */ | |
8769 | const char *suggest = ""; | |
8770 | bool warned = false; | |
8771 | ||
8772 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8773 | { | |
8774 | case BUILT_IN_MEMSET: | |
4b97404d | 8775 | if (!integer_zerop (maybe_constant_value ((*args)[1]))) |
a324786b | 8776 | { |
8777 | /* Diagnose setting non-copy-assignable or non-trivial types, | |
8778 | or types with a private member, to (potentially) non-zero | |
8779 | bytes. Since the value of the bytes being written is unknown, | |
8780 | suggest using assignment instead (if one exists). Also warn | |
8781 | for writes into objects for which zero-initialization doesn't | |
8782 | mean all bits clear (pointer-to-member data, where null is all | |
8783 | bits set). Since the value being written is (most likely) | |
8784 | non-zero, simply suggest assignment (but not copy assignment). */ | |
8785 | suggest = "; use assignment instead"; | |
8786 | if (!trivassign) | |
8787 | warnfmt = G_("%qD writing to an object of type %#qT with " | |
8788 | "no trivial copy-assignment"); | |
8789 | else if (!trivial) | |
8790 | warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s"); | |
8791 | else if (fld) | |
8792 | { | |
8793 | const char *access = TREE_PRIVATE (fld) ? "private" : "protected"; | |
8794 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8795 | "%qD writing to an object of type %#qT with " | |
8796 | "%qs member %qD", | |
8797 | fndecl, desttype, access, fld); | |
8798 | } | |
8799 | else if (!zero_init_p (desttype)) | |
8800 | warnfmt = G_("%qD writing to an object of type %#qT containing " | |
8801 | "a pointer to data member%s"); | |
8802 | ||
8803 | break; | |
8804 | } | |
8805 | /* Fall through. */ | |
8806 | ||
8807 | case BUILT_IN_BZERO: | |
8808 | /* Similarly to the above, diagnose clearing non-trivial or non- | |
8809 | standard layout objects, or objects of types with no assignmenmt. | |
8810 | Since the value being written is known to be zero, suggest either | |
8811 | copy assignment, copy ctor, or default ctor as an alternative, | |
8812 | depending on what's available. */ | |
8813 | ||
8814 | if (hasassign && hasctors[0]) | |
8815 | suggest = G_("; use assignment or value-initialization instead"); | |
8816 | else if (hasassign) | |
8817 | suggest = G_("; use assignment instead"); | |
8818 | else if (hasctors[0]) | |
8819 | suggest = G_("; use value-initialization instead"); | |
8820 | ||
8821 | if (!trivassign) | |
8822 | warnfmt = G_("%qD clearing an object of type %#qT with " | |
8823 | "no trivial copy-assignment%s"); | |
8824 | else if (!trivial) | |
8825 | warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s"); | |
8826 | else if (!zero_init_p (desttype)) | |
8827 | warnfmt = G_("%qD clearing an object of type %#qT containing " | |
8828 | "a pointer-to-member%s"); | |
8829 | break; | |
8830 | ||
8831 | case BUILT_IN_BCOPY: | |
8832 | case BUILT_IN_MEMCPY: | |
8833 | case BUILT_IN_MEMMOVE: | |
8834 | case BUILT_IN_MEMPCPY: | |
8835 | /* Determine the type of the source object. */ | |
4b97404d | 8836 | srctype = TREE_TYPE ((*args)[srcidx]); |
d03fa520 | 8837 | if (!srctype || !INDIRECT_TYPE_P (srctype)) |
4b97404d | 8838 | srctype = void_type_node; |
8839 | else | |
8840 | srctype = TREE_TYPE (srctype); | |
a324786b | 8841 | |
8842 | /* Since it's impossible to determine wheter the byte copy is | |
8843 | being used in place of assignment to an existing object or | |
8844 | as a substitute for initialization, assume it's the former. | |
8845 | Determine the best alternative to use instead depending on | |
8846 | what's not deleted. */ | |
8847 | if (hasassign && hasctors[1]) | |
8848 | suggest = G_("; use copy-assignment or copy-initialization instead"); | |
8849 | else if (hasassign) | |
8850 | suggest = G_("; use copy-assignment instead"); | |
8851 | else if (hasctors[1]) | |
8852 | suggest = G_("; use copy-initialization instead"); | |
8853 | ||
8854 | if (!trivassign) | |
8855 | warnfmt = G_("%qD writing to an object of type %#qT with no trivial " | |
8856 | "copy-assignment%s"); | |
8857 | else if (!trivially_copyable_p (desttype)) | |
8858 | warnfmt = G_("%qD writing to an object of non-trivially copyable " | |
8859 | "type %#qT%s"); | |
8860 | else if (!trivcopy) | |
8861 | warnfmt = G_("%qD writing to an object with a deleted copy constructor"); | |
8862 | ||
8863 | else if (!trivial | |
8864 | && !VOID_TYPE_P (srctype) | |
8865 | && !char_type_p (TYPE_MAIN_VARIANT (srctype)) | |
8866 | && !same_type_ignoring_top_level_qualifiers_p (desttype, | |
8867 | srctype)) | |
8868 | { | |
8869 | /* Warn when copying into a non-trivial object from an object | |
8870 | of a different type other than void or char. */ | |
8871 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8872 | "%qD copying an object of non-trivial type " | |
8873 | "%#qT from an array of %#qT", | |
8874 | fndecl, desttype, srctype); | |
8875 | } | |
8876 | else if (fld | |
8877 | && !VOID_TYPE_P (srctype) | |
8878 | && !char_type_p (TYPE_MAIN_VARIANT (srctype)) | |
8879 | && !same_type_ignoring_top_level_qualifiers_p (desttype, | |
8880 | srctype)) | |
8881 | { | |
8882 | const char *access = TREE_PRIVATE (fld) ? "private" : "protected"; | |
8883 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8884 | "%qD copying an object of type %#qT with " | |
8885 | "%qs member %qD from an array of %#qT; use " | |
8886 | "assignment or copy-initialization instead", | |
8887 | fndecl, desttype, access, fld, srctype); | |
8888 | } | |
4b97404d | 8889 | else if (!trivial && vec_safe_length (args) > 2) |
a324786b | 8890 | { |
4b97404d | 8891 | tree sz = maybe_constant_value ((*args)[2]); |
8892 | if (!tree_fits_uhwi_p (sz)) | |
8893 | break; | |
8894 | ||
a324786b | 8895 | /* Finally, warn on partial copies. */ |
8896 | unsigned HOST_WIDE_INT typesize | |
8897 | = tree_to_uhwi (TYPE_SIZE_UNIT (desttype)); | |
4b97404d | 8898 | if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize) |
a324786b | 8899 | warned = warning_at (loc, OPT_Wclass_memaccess, |
8900 | (typesize - partial > 1 | |
8901 | ? G_("%qD writing to an object of " | |
8902 | "a non-trivial type %#qT leaves %wu " | |
8903 | "bytes unchanged") | |
8904 | : G_("%qD writing to an object of " | |
8905 | "a non-trivial type %#qT leaves %wu " | |
8906 | "byte unchanged")), | |
8907 | fndecl, desttype, typesize - partial); | |
8908 | } | |
8909 | break; | |
8910 | ||
8911 | case BUILT_IN_REALLOC: | |
8912 | ||
8913 | if (!trivially_copyable_p (desttype)) | |
8914 | warnfmt = G_("%qD moving an object of non-trivially copyable type " | |
8915 | "%#qT; use %<new%> and %<delete%> instead"); | |
8916 | else if (!trivcopy) | |
8917 | warnfmt = G_("%qD moving an object of type %#qT with deleted copy " | |
8918 | "constructor; use %<new%> and %<delete%> instead"); | |
8919 | else if (!get_dtor (desttype, tf_none)) | |
8920 | warnfmt = G_("%qD moving an object of type %#qT with deleted " | |
8921 | "destructor"); | |
4b97404d | 8922 | else if (!trivial) |
a324786b | 8923 | { |
4b97404d | 8924 | tree sz = maybe_constant_value ((*args)[1]); |
8925 | if (TREE_CODE (sz) == INTEGER_CST | |
8926 | && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype))) | |
8927 | /* Finally, warn on reallocation into insufficient space. */ | |
8928 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8929 | "%qD moving an object of non-trivial type " | |
8930 | "%#qT and size %E into a region of size %E", | |
8931 | fndecl, desttype, TYPE_SIZE_UNIT (desttype), | |
8932 | sz); | |
a324786b | 8933 | } |
8934 | break; | |
8935 | ||
8936 | default: | |
8937 | return; | |
8938 | } | |
8939 | ||
a324786b | 8940 | if (warnfmt) |
8941 | { | |
8942 | if (suggest) | |
8943 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8944 | warnfmt, fndecl, desttype, suggest); | |
8945 | else | |
8946 | warned = warning_at (loc, OPT_Wclass_memaccess, | |
8947 | warnfmt, fndecl, desttype); | |
8948 | } | |
8949 | ||
8950 | if (warned) | |
8951 | inform (location_of (desttype), "%#qT declared here", desttype); | |
8952 | } | |
8953 | ||
d01f58f9 | 8954 | /* Build and return a call to FN, using NARGS arguments in ARGARRAY. |
8955 | This function performs no overload resolution, conversion, or other | |
8956 | high-level operations. */ | |
95cedffb | 8957 | |
8958 | tree | |
14376b10 | 8959 | build_cxx_call (tree fn, int nargs, tree *argarray, |
8960 | tsubst_flags_t complain) | |
95cedffb | 8961 | { |
8962 | tree fndecl; | |
8963 | ||
262c8920 | 8964 | /* Remember roughly where this call is. */ |
d3a3cfb8 | 8965 | location_t loc = cp_expr_loc_or_loc (fn, input_location); |
d01f58f9 | 8966 | fn = build_call_a (fn, nargs, argarray); |
262c8920 | 8967 | SET_EXPR_LOCATION (fn, loc); |
95cedffb | 8968 | |
95cedffb | 8969 | fndecl = get_callee_fndecl (fn); |
95cedffb | 8970 | |
23a03571 | 8971 | /* Check that arguments to builtin functions match the expectations. */ |
8972 | if (fndecl | |
006b503a | 8973 | && !processing_template_decl |
a0e9bfbb | 8974 | && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL)) |
d2c63826 | 8975 | { |
8976 | int i; | |
8977 | ||
8978 | /* We need to take care that values to BUILT_IN_NORMAL | |
8979 | are reduced. */ | |
8980 | for (i = 0; i < nargs; i++) | |
006b503a | 8981 | argarray[i] = maybe_constant_value (argarray[i]); |
d2c63826 | 8982 | |
5d4db8ef | 8983 | if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl, |
8984 | nargs, argarray)) | |
d2c63826 | 8985 | return error_mark_node; |
8986 | } | |
23a03571 | 8987 | |
a91e34df | 8988 | if (VOID_TYPE_P (TREE_TYPE (fn))) |
ec10e4ad | 8989 | return fn; |
95cedffb | 8990 | |
f87b283e | 8991 | /* 5.2.2/11: If a function call is a prvalue of object type: if the |
8992 | function call is either the operand of a decltype-specifier or the | |
8993 | right operand of a comma operator that is the operand of a | |
8994 | decltype-specifier, a temporary object is not introduced for the | |
8995 | prvalue. The type of the prvalue may be incomplete. */ | |
8996 | if (!(complain & tf_decltype)) | |
8997 | { | |
8998 | fn = require_complete_type_sfinae (fn, complain); | |
8999 | if (fn == error_mark_node) | |
9000 | return error_mark_node; | |
95cedffb | 9001 | |
f87b283e | 9002 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn))) |
5d11282b | 9003 | { |
9004 | fn = build_cplus_new (TREE_TYPE (fn), fn, complain); | |
9005 | maybe_warn_parm_abi (TREE_TYPE (fn), loc); | |
9006 | } | |
f87b283e | 9007 | } |
db6568a3 | 9008 | return convert_from_reference (fn); |
ec10e4ad | 9009 | } |
9010 | ||
f04596da | 9011 | /* Returns the value to use for the in-charge parameter when making a |
092b1d6f | 9012 | call to a function with the indicated NAME. |
9031d10b | 9013 | |
092b1d6f | 9014 | FIXME:Can't we find a neater way to do this mapping? */ |
f04596da | 9015 | |
9016 | tree | |
eda6e89c | 9017 | in_charge_arg_for_name (tree name) |
f04596da | 9018 | { |
9fb36780 | 9019 | if (IDENTIFIER_CTOR_P (name)) |
9020 | { | |
9021 | if (name == complete_ctor_identifier) | |
9022 | return integer_one_node; | |
9023 | gcc_checking_assert (name == base_ctor_identifier); | |
9024 | } | |
9025 | else | |
9026 | { | |
9027 | if (name == complete_dtor_identifier) | |
9028 | return integer_two_node; | |
9029 | else if (name == deleting_dtor_identifier) | |
9030 | return integer_three_node; | |
9031 | gcc_checking_assert (name == base_dtor_identifier); | |
9032 | } | |
9033 | ||
9034 | return integer_zero_node; | |
f04596da | 9035 | } |
9036 | ||
c821ae1a | 9037 | /* We've built up a constructor call RET. Complain if it delegates to the |
9038 | constructor we're currently compiling. */ | |
9039 | ||
9040 | static void | |
9041 | check_self_delegation (tree ret) | |
9042 | { | |
9043 | if (TREE_CODE (ret) == TARGET_EXPR) | |
9044 | ret = TARGET_EXPR_INITIAL (ret); | |
ced7e116 | 9045 | tree fn = cp_get_callee_fndecl_nofold (ret); |
c821ae1a | 9046 | if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl) |
9047 | error ("constructor delegates to itself"); | |
9048 | } | |
9049 | ||
f70cb9e6 | 9050 | /* Build a call to a constructor, destructor, or an assignment |
9051 | operator for INSTANCE, an expression with class type. NAME | |
f352a3fb | 9052 | indicates the special member function to call; *ARGS are the |
9053 | arguments. ARGS may be NULL. This may change ARGS. BINFO | |
9054 | indicates the base of INSTANCE that is to be passed as the `this' | |
9055 | parameter to the member function called. | |
f70cb9e6 | 9056 | |
9057 | FLAGS are the LOOKUP_* flags to use when processing the call. | |
9058 | ||
9059 | If NAME indicates a complete object constructor, INSTANCE may be | |
9060 | NULL_TREE. In this case, the caller will call build_cplus_new to | |
9061 | store the newly constructed object into a VAR_DECL. */ | |
9062 | ||
9063 | tree | |
f1f41a6c | 9064 | build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args, |
ebd21de4 | 9065 | tree binfo, int flags, tsubst_flags_t complain) |
f70cb9e6 | 9066 | { |
9067 | tree fns; | |
9068 | /* The type of the subobject to be constructed or destroyed. */ | |
9069 | tree class_type; | |
f1f41a6c | 9070 | vec<tree, va_gc> *allocated = NULL; |
f352a3fb | 9071 | tree ret; |
f70cb9e6 | 9072 | |
ef8f6502 | 9073 | gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier); |
6ae0d78c | 9074 | |
9075 | if (error_operand_p (instance)) | |
9076 | return error_mark_node; | |
9077 | ||
9078 | if (IDENTIFIER_DTOR_P (name)) | |
9079 | { | |
9080 | gcc_assert (args == NULL || vec_safe_is_empty (*args)); | |
9081 | if (!type_build_dtor_call (TREE_TYPE (instance))) | |
9082 | /* Shortcut to avoid lazy destructor declaration. */ | |
9083 | return build_trivial_dtor_call (instance); | |
9084 | } | |
9085 | ||
a6460bf1 | 9086 | if (TYPE_P (binfo)) |
9087 | { | |
9088 | /* Resolve the name. */ | |
a5f2d620 | 9089 | if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain)) |
a6460bf1 | 9090 | return error_mark_node; |
9091 | ||
9092 | binfo = TYPE_BINFO (binfo); | |
9093 | } | |
9031d10b | 9094 | |
b4df430b | 9095 | gcc_assert (binfo != NULL_TREE); |
f70cb9e6 | 9096 | |
9097 | class_type = BINFO_TYPE (binfo); | |
9098 | ||
9099 | /* Handle the special case where INSTANCE is NULL_TREE. */ | |
9100 | if (name == complete_ctor_identifier && !instance) | |
6da7682f | 9101 | instance = build_dummy_object (class_type); |
c1c5bfe2 | 9102 | else |
9103 | { | |
eb3f3f5c | 9104 | /* Convert to the base class, if necessary. */ |
9031d10b | 9105 | if (!same_type_ignoring_top_level_qualifiers_p |
c1c5bfe2 | 9106 | (TREE_TYPE (instance), BINFO_TYPE (binfo))) |
eb3f3f5c | 9107 | { |
ef8f6502 | 9108 | if (IDENTIFIER_CDTOR_P (name)) |
eb3f3f5c | 9109 | /* For constructors and destructors, either the base is |
9110 | non-virtual, or it is virtual but we are doing the | |
9111 | conversion from a constructor or destructor for the | |
9112 | complete object. In either case, we can convert | |
9113 | statically. */ | |
9114 | instance = convert_to_base_statically (instance, binfo); | |
9115 | else | |
ef8f6502 | 9116 | { |
9117 | /* However, for assignment operators, we must convert | |
9118 | dynamically if the base is virtual. */ | |
9119 | gcc_checking_assert (name == assign_op_identifier); | |
9120 | instance = build_base_path (PLUS_EXPR, instance, | |
9121 | binfo, /*nonnull=*/1, complain); | |
9122 | } | |
eb3f3f5c | 9123 | } |
c1c5bfe2 | 9124 | } |
9031d10b | 9125 | |
b4df430b | 9126 | gcc_assert (instance != NULL_TREE); |
f70cb9e6 | 9127 | |
c821ae1a | 9128 | /* In C++17, "If the initializer expression is a prvalue and the |
9129 | cv-unqualified version of the source type is the same class as the class | |
9130 | of the destination, the initializer expression is used to initialize the | |
9131 | destination object." Handle that here to avoid doing overload | |
9132 | resolution. */ | |
40e2decb | 9133 | if (cxx_dialect >= cxx17 |
c821ae1a | 9134 | && args && vec_safe_length (*args) == 1 |
9135 | && name == complete_ctor_identifier) | |
9136 | { | |
9137 | tree arg = (**args)[0]; | |
9138 | ||
9582b9d8 | 9139 | if (BRACE_ENCLOSED_INITIALIZER_P (arg) |
b248e783 | 9140 | && !TYPE_HAS_LIST_CTOR (class_type) |
9141 | && CONSTRUCTOR_NELTS (arg) == 1) | |
9142 | arg = CONSTRUCTOR_ELT (arg, 0)->value; | |
9143 | ||
4546a008 | 9144 | if ((TREE_CODE (arg) == TARGET_EXPR |
9145 | || TREE_CODE (arg) == CONSTRUCTOR) | |
c821ae1a | 9146 | && (same_type_ignoring_top_level_qualifiers_p |
9147 | (class_type, TREE_TYPE (arg)))) | |
9148 | { | |
9149 | if (is_dummy_object (instance)) | |
9150 | return arg; | |
525ca7cc | 9151 | else if (TREE_CODE (arg) == TARGET_EXPR) |
9152 | TARGET_EXPR_DIRECT_INIT_P (arg) = true; | |
9153 | ||
c821ae1a | 9154 | if ((complain & tf_error) |
9155 | && (flags & LOOKUP_DELEGATING_CONS)) | |
9156 | check_self_delegation (arg); | |
9157 | /* Avoid change of behavior on Wunused-var-2.C. */ | |
153f22fa | 9158 | instance = mark_lvalue_use (instance); |
c821ae1a | 9159 | return build2 (INIT_EXPR, class_type, instance, arg); |
9160 | } | |
9161 | } | |
9162 | ||
f70cb9e6 | 9163 | fns = lookup_fnfields (binfo, name, 1); |
9031d10b | 9164 | |
f70cb9e6 | 9165 | /* When making a call to a constructor or destructor for a subobject |
9166 | that uses virtual base classes, pass down a pointer to a VTT for | |
9167 | the subobject. */ | |
9168 | if ((name == base_ctor_identifier | |
9169 | || name == base_dtor_identifier) | |
1f0b839e | 9170 | && CLASSTYPE_VBASECLASSES (class_type)) |
f70cb9e6 | 9171 | { |
9172 | tree vtt; | |
9173 | tree sub_vtt; | |
9174 | ||
9175 | /* If the current function is a complete object constructor | |
9176 | or destructor, then we fetch the VTT directly. | |
9177 | Otherwise, we look it up using the VTT we were given. */ | |
1767a056 | 9178 | vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type)); |
4405c1ad | 9179 | vtt = decay_conversion (vtt, complain); |
9180 | if (vtt == error_mark_node) | |
9181 | return error_mark_node; | |
fdb094f0 | 9182 | vtt = build_if_in_charge (vtt, current_vtt_parm); |
90510c63 | 9183 | if (BINFO_SUBVTT_INDEX (binfo)) |
9184 | sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo)); | |
9185 | else | |
9186 | sub_vtt = vtt; | |
f70cb9e6 | 9187 | |
f352a3fb | 9188 | if (args == NULL) |
9189 | { | |
9190 | allocated = make_tree_vector (); | |
9191 | args = &allocated; | |
9192 | } | |
9193 | ||
f1f41a6c | 9194 | vec_safe_insert (*args, 0, sub_vtt); |
f70cb9e6 | 9195 | } |
9196 | ||
f352a3fb | 9197 | ret = build_new_method_call (instance, fns, args, |
9198 | TYPE_BINFO (BINFO_TYPE (binfo)), | |
9199 | flags, /*fn=*/NULL, | |
9200 | complain); | |
9201 | ||
9202 | if (allocated != NULL) | |
9203 | release_tree_vector (allocated); | |
9204 | ||
afc1cf36 | 9205 | if ((complain & tf_error) |
9206 | && (flags & LOOKUP_DELEGATING_CONS) | |
c821ae1a | 9207 | && name == complete_ctor_identifier) |
9208 | check_self_delegation (ret); | |
afc1cf36 | 9209 | |
f352a3fb | 9210 | return ret; |
f70cb9e6 | 9211 | } |
9212 | ||
0a3b29ad | 9213 | /* Return the NAME, as a C string. The NAME indicates a function that |
9214 | is a member of TYPE. *FREE_P is set to true if the caller must | |
9031d10b | 9215 | free the memory returned. |
0a3b29ad | 9216 | |
9217 | Rather than go through all of this, we should simply set the names | |
9218 | of constructors and destructors appropriately, and dispense with | |
9219 | ctor_identifier, dtor_identifier, etc. */ | |
9220 | ||
9221 | static char * | |
9222 | name_as_c_string (tree name, tree type, bool *free_p) | |
9223 | { | |
67d5f2c7 | 9224 | const char *pretty_name; |
0a3b29ad | 9225 | |
9226 | /* Assume that we will not allocate memory. */ | |
9227 | *free_p = false; | |
9228 | /* Constructors and destructors are special. */ | |
991449b2 | 9229 | if (IDENTIFIER_CDTOR_P (name)) |
0a3b29ad | 9230 | { |
9031d10b | 9231 | pretty_name |
67d5f2c7 | 9232 | = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))); |
0a3b29ad | 9233 | /* For a destructor, add the '~'. */ |
991449b2 | 9234 | if (IDENTIFIER_DTOR_P (name)) |
0a3b29ad | 9235 | { |
9236 | pretty_name = concat ("~", pretty_name, NULL); | |
9237 | /* Remember that we need to free the memory allocated. */ | |
9238 | *free_p = true; | |
9239 | } | |
9240 | } | |
991449b2 | 9241 | else if (IDENTIFIER_CONV_OP_P (name)) |
2c979f61 | 9242 | { |
9243 | pretty_name = concat ("operator ", | |
a608187f | 9244 | type_as_string_translate (TREE_TYPE (name), |
9245 | TFF_PLAIN_IDENTIFIER), | |
2c979f61 | 9246 | NULL); |
9247 | /* Remember that we need to free the memory allocated. */ | |
9248 | *free_p = true; | |
9249 | } | |
0a3b29ad | 9250 | else |
67d5f2c7 | 9251 | pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name)); |
0a3b29ad | 9252 | |
67d5f2c7 | 9253 | return CONST_CAST (char *, pretty_name); |
0a3b29ad | 9254 | } |
9255 | ||
b78e49d1 | 9256 | /* If CANDIDATES contains exactly one candidate, return it, otherwise |
9257 | return NULL. */ | |
9258 | ||
9259 | static z_candidate * | |
9260 | single_z_candidate (z_candidate *candidates) | |
9261 | { | |
9262 | if (candidates == NULL) | |
9263 | return NULL; | |
9264 | ||
9265 | if (candidates->next) | |
9266 | return NULL; | |
9267 | ||
9268 | return candidates; | |
9269 | } | |
9270 | ||
9271 | /* If CANDIDATE is invalid due to a bad argument type, return the | |
9272 | pertinent conversion_info. | |
9273 | ||
9274 | Otherwise, return NULL. */ | |
9275 | ||
9276 | static const conversion_info * | |
9277 | maybe_get_bad_conversion_for_unmatched_call (const z_candidate *candidate) | |
9278 | { | |
9279 | /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */ | |
9280 | rejection_reason *r = candidate->reason; | |
9281 | ||
9282 | if (r == NULL) | |
9283 | return NULL; | |
9284 | ||
9285 | switch (r->code) | |
9286 | { | |
9287 | default: | |
9288 | return NULL; | |
9289 | ||
9290 | case rr_arg_conversion: | |
9291 | return &r->u.conversion; | |
9292 | ||
9293 | case rr_bad_arg_conversion: | |
9294 | return &r->u.bad_conversion; | |
9295 | } | |
9296 | } | |
9297 | ||
9298 | /* Issue an error and note complaining about a bad argument type at a | |
9299 | callsite with a single candidate FNDECL. | |
9300 | ||
9301 | ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which | |
9302 | case input_location is used). | |
9303 | FROM_TYPE is the type of the actual argument; TO_TYPE is the type of | |
9304 | the formal parameter. */ | |
9305 | ||
9306 | void | |
9307 | complain_about_bad_argument (location_t arg_loc, | |
9308 | tree from_type, tree to_type, | |
9309 | tree fndecl, int parmnum) | |
9310 | { | |
9311 | auto_diagnostic_group d; | |
9312 | range_label_for_type_mismatch rhs_label (from_type, to_type); | |
9313 | range_label *label = &rhs_label; | |
9314 | if (arg_loc == UNKNOWN_LOCATION) | |
9315 | { | |
9316 | arg_loc = input_location; | |
9317 | label = NULL; | |
9318 | } | |
9319 | gcc_rich_location richloc (arg_loc, label); | |
9320 | error_at (&richloc, | |
9321 | "cannot convert %qH to %qI", | |
9322 | from_type, to_type); | |
9683081b | 9323 | maybe_inform_about_fndecl_for_bogus_argument_init (fndecl, |
9324 | parmnum); | |
b78e49d1 | 9325 | } |
9326 | ||
9327 | /* Subroutine of build_new_method_call_1, for where there are no viable | |
9328 | candidates for the call. */ | |
9329 | ||
9330 | static void | |
9331 | complain_about_no_candidates_for_method_call (tree instance, | |
9332 | z_candidate *candidates, | |
9333 | tree explicit_targs, | |
9334 | tree basetype, | |
9335 | tree optype, tree name, | |
9336 | bool skip_first_for_error, | |
9337 | vec<tree, va_gc> *user_args) | |
9338 | { | |
9339 | auto_diagnostic_group d; | |
9340 | if (!COMPLETE_OR_OPEN_TYPE_P (basetype)) | |
9341 | cxx_incomplete_type_error (instance, basetype); | |
9342 | else if (optype) | |
9343 | error ("no matching function for call to %<%T::operator %T(%A)%#V%>", | |
9344 | basetype, optype, build_tree_list_vec (user_args), | |
9345 | TREE_TYPE (instance)); | |
9346 | else | |
9347 | { | |
9348 | /* Special-case for when there's a single candidate that's failing | |
9349 | due to a bad argument type. */ | |
9350 | if (z_candidate *candidate = single_z_candidate (candidates)) | |
9351 | if (const conversion_info *conv | |
9352 | = maybe_get_bad_conversion_for_unmatched_call (candidate)) | |
9353 | { | |
9354 | complain_about_bad_argument (conv->loc, | |
9355 | conv->from, conv->to_type, | |
9356 | candidate->fn, conv->n_arg); | |
9357 | return; | |
9358 | } | |
9359 | ||
9360 | tree arglist = build_tree_list_vec (user_args); | |
9361 | tree errname = name; | |
9362 | bool twiddle = false; | |
9363 | if (IDENTIFIER_CDTOR_P (errname)) | |
9364 | { | |
9365 | twiddle = IDENTIFIER_DTOR_P (errname); | |
9366 | errname = constructor_name (basetype); | |
9367 | } | |
9368 | if (explicit_targs) | |
9369 | errname = lookup_template_function (errname, explicit_targs); | |
9370 | if (skip_first_for_error) | |
9371 | arglist = TREE_CHAIN (arglist); | |
9372 | error ("no matching function for call to %<%T::%s%E(%A)%#V%>", | |
9373 | basetype, &"~"[!twiddle], errname, arglist, | |
9374 | TREE_TYPE (instance)); | |
9375 | } | |
9376 | print_z_candidates (location_of (name), candidates); | |
9377 | } | |
9378 | ||
393f878f | 9379 | /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will |
f352a3fb | 9380 | be set, upon return, to the function called. ARGS may be NULL. |
9381 | This may change ARGS. */ | |
f70cb9e6 | 9382 | |
6198e8f6 | 9383 | static tree |
f1f41a6c | 9384 | build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args, |
6198e8f6 | 9385 | tree conversion_path, int flags, |
9386 | tree *fn_p, tsubst_flags_t complain) | |
ec10e4ad | 9387 | { |
9388 | struct z_candidate *candidates = 0, *cand; | |
b1cfe2be | 9389 | tree explicit_targs = NULL_TREE; |
f70cb9e6 | 9390 | tree basetype = NULL_TREE; |
b941b4ce | 9391 | tree access_binfo, binfo; |
f70cb9e6 | 9392 | tree optype; |
f352a3fb | 9393 | tree first_mem_arg = NULL_TREE; |
0a3b29ad | 9394 | tree name; |
f352a3fb | 9395 | bool skip_first_for_error; |
f1f41a6c | 9396 | vec<tree, va_gc> *user_args; |
5516f3c3 | 9397 | tree call; |
0a3b29ad | 9398 | tree fn; |
a5a4ff77 | 9399 | int template_only = 0; |
f4da5882 | 9400 | bool any_viable_p; |
13795292 | 9401 | tree orig_instance; |
9402 | tree orig_fns; | |
f1f41a6c | 9403 | vec<tree, va_gc> *orig_args = NULL; |
1611df57 | 9404 | void *p; |
02d7f858 | 9405 | |
b4df430b | 9406 | gcc_assert (instance != NULL_TREE); |
1eaf178d | 9407 | |
393f878f | 9408 | /* We don't know what function we're going to call, yet. */ |
9409 | if (fn_p) | |
9410 | *fn_p = NULL_TREE; | |
9411 | ||
9031d10b | 9412 | if (error_operand_p (instance) |
da91c24b | 9413 | || !fns || error_operand_p (fns)) |
f70cb9e6 | 9414 | return error_mark_node; |
b1cfe2be | 9415 | |
f70cb9e6 | 9416 | if (!BASELINK_P (fns)) |
ec10e4ad | 9417 | { |
ebd21de4 | 9418 | if (complain & tf_error) |
9419 | error ("call to non-function %qD", fns); | |
f70cb9e6 | 9420 | return error_mark_node; |
9421 | } | |
ec10e4ad | 9422 | |
314275e1 | 9423 | orig_instance = instance; |
9424 | orig_fns = fns; | |
314275e1 | 9425 | |
308d6af4 | 9426 | /* Dismantle the baselink to collect all the information we need. */ |
f70cb9e6 | 9427 | if (!conversion_path) |
9428 | conversion_path = BASELINK_BINFO (fns); | |
9429 | access_binfo = BASELINK_ACCESS_BINFO (fns); | |
b941b4ce | 9430 | binfo = BASELINK_BINFO (fns); |
f70cb9e6 | 9431 | optype = BASELINK_OPTYPE (fns); |
9432 | fns = BASELINK_FUNCTIONS (fns); | |
f70cb9e6 | 9433 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) |
9434 | { | |
9435 | explicit_targs = TREE_OPERAND (fns, 1); | |
9436 | fns = TREE_OPERAND (fns, 0); | |
9437 | template_only = 1; | |
ec10e4ad | 9438 | } |
b4df430b | 9439 | gcc_assert (TREE_CODE (fns) == FUNCTION_DECL |
9440 | || TREE_CODE (fns) == TEMPLATE_DECL | |
9441 | || TREE_CODE (fns) == OVERLOAD); | |
d14ef710 | 9442 | fn = OVL_FIRST (fns); |
314275e1 | 9443 | name = DECL_NAME (fn); |
ec10e4ad | 9444 | |
314275e1 | 9445 | basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance)); |
9446 | gcc_assert (CLASS_TYPE_P (basetype)); | |
ec10e4ad | 9447 | |
c2ce72e8 | 9448 | user_args = args == NULL ? NULL : *args; |
9449 | /* Under DR 147 A::A() is an invalid constructor call, | |
9450 | not a functional cast. */ | |
9451 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) | |
9452 | { | |
9453 | if (! (complain & tf_error)) | |
9454 | return error_mark_node; | |
9455 | ||
9e6bae05 | 9456 | basetype = DECL_CONTEXT (fn); |
1c7ba3eb | 9457 | name = constructor_name (basetype); |
bc35ef65 | 9458 | auto_diagnostic_group d; |
405d08f9 | 9459 | if (permerror (input_location, |
9460 | "cannot call constructor %<%T::%D%> directly", | |
c15bac17 | 9461 | basetype, name)) |
405d08f9 | 9462 | inform (input_location, "for a function-style cast, remove the " |
9463 | "redundant %<::%D%>", name); | |
c2ce72e8 | 9464 | call = build_functional_cast (basetype, build_tree_list_vec (user_args), |
9465 | complain); | |
c2ce72e8 | 9466 | return call; |
9467 | } | |
9468 | ||
d69db759 | 9469 | if (processing_template_decl) |
9470 | { | |
9471 | orig_args = args == NULL ? NULL : make_tree_vector_copy (*args); | |
9472 | instance = build_non_dependent_expr (instance); | |
9473 | if (args != NULL) | |
9474 | make_args_non_dependent (*args); | |
9475 | } | |
9476 | ||
1c7ba3eb | 9477 | /* Process the argument list. */ |
9478 | if (args != NULL && *args != NULL) | |
9479 | { | |
9480 | *args = resolve_args (*args, complain); | |
9481 | if (*args == NULL) | |
9482 | return error_mark_node; | |
d69db759 | 9483 | user_args = *args; |
1c7ba3eb | 9484 | } |
9485 | ||
9486 | /* Consider the object argument to be used even if we end up selecting a | |
9487 | static member function. */ | |
9488 | instance = mark_type_use (instance); | |
9489 | ||
f352a3fb | 9490 | /* Figure out whether to skip the first argument for the error |
9491 | message we will display to users if an error occurs. We don't | |
9492 | want to display any compiler-generated arguments. The "this" | |
9493 | pointer hasn't been added yet. However, we must remove the VTT | |
9494 | pointer if this is a call to a base-class constructor or | |
9495 | destructor. */ | |
9496 | skip_first_for_error = false; | |
991449b2 | 9497 | if (IDENTIFIER_CDTOR_P (name)) |
cfb46e1f | 9498 | { |
1c7ba3eb | 9499 | /* Callers should explicitly indicate whether they want to ctor |
f70cb9e6 | 9500 | the complete object or just the part without virtual bases. */ |
b4df430b | 9501 | gcc_assert (name != ctor_identifier); |
1c7ba3eb | 9502 | |
314275e1 | 9503 | /* Remove the VTT pointer, if present. */ |
9504 | if ((name == base_ctor_identifier || name == base_dtor_identifier) | |
9505 | && CLASSTYPE_VBASECLASSES (basetype)) | |
f352a3fb | 9506 | skip_first_for_error = true; |
ec10e4ad | 9507 | |
1c7ba3eb | 9508 | /* It's OK to call destructors and constructors on cv-qualified |
9509 | objects. Therefore, convert the INSTANCE to the unqualified | |
9510 | type, if necessary. */ | |
18619da5 | 9511 | if (!same_type_p (basetype, TREE_TYPE (instance))) |
9512 | { | |
9513 | instance = build_this (instance); | |
9514 | instance = build_nop (build_pointer_type (basetype), instance); | |
9515 | instance = build_fold_indirect_ref (instance); | |
9516 | } | |
0a3b29ad | 9517 | } |
1c7ba3eb | 9518 | else |
9519 | gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn)); | |
f70cb9e6 | 9520 | |
f1ec53b6 | 9521 | /* For the overload resolution we need to find the actual `this` |
9522 | that would be captured if the call turns out to be to a | |
9523 | non-static member function. Do not actually capture it at this | |
9524 | point. */ | |
f03a27dc | 9525 | if (DECL_CONSTRUCTOR_P (fn)) |
9526 | /* Constructors don't use the enclosing 'this'. */ | |
9527 | first_mem_arg = instance; | |
9528 | else | |
9529 | first_mem_arg = maybe_resolve_dummy (instance, false); | |
dbfcf378 | 9530 | |
9531 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9532 | p = conversion_obstack_alloc (0); | |
9533 | ||
fc0d5c8c | 9534 | /* The number of arguments artificial parms in ARGS; we subtract one because |
9535 | there's no 'this' in ARGS. */ | |
9536 | unsigned skip = num_artificial_parms_for (fn) - 1; | |
9537 | ||
f82f1250 | 9538 | /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form |
dbfcf378 | 9539 | initializer, not T({ }). */ |
fc0d5c8c | 9540 | if (DECL_CONSTRUCTOR_P (fn) |
9541 | && vec_safe_length (user_args) > skip | |
9542 | && DIRECT_LIST_INIT_P ((*user_args)[skip])) | |
f82f1250 | 9543 | { |
fc0d5c8c | 9544 | tree init_list = (*user_args)[skip]; |
31cdebfa | 9545 | tree init = NULL_TREE; |
90ca6a25 | 9546 | |
fc0d5c8c | 9547 | gcc_assert (user_args->length () == skip + 1 |
f955934c | 9548 | && !(flags & LOOKUP_ONLYCONVERTING)); |
0d836813 | 9549 | |
90ca6a25 | 9550 | /* If the initializer list has no elements and T is a class type with |
9551 | a default constructor, the object is value-initialized. Handle | |
9552 | this here so we don't need to handle it wherever we use | |
9553 | build_special_member_call. */ | |
9554 | if (CONSTRUCTOR_NELTS (init_list) == 0 | |
9555 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) | |
08e5b6d1 | 9556 | /* For a user-provided default constructor, use the normal |
9557 | mechanisms so that protected access works. */ | |
db1285df | 9558 | && type_has_non_user_provided_default_constructor (basetype) |
90ca6a25 | 9559 | && !processing_template_decl) |
31cdebfa | 9560 | init = build_value_init (basetype, complain); |
9561 | ||
9562 | /* If BASETYPE is an aggregate, we need to do aggregate | |
9563 | initialization. */ | |
9564 | else if (CP_AGGREGATE_TYPE_P (basetype)) | |
8f1030d5 | 9565 | { |
9566 | init = reshape_init (basetype, init_list, complain); | |
9567 | init = digest_init (basetype, init, complain); | |
9568 | } | |
31cdebfa | 9569 | |
9570 | if (init) | |
90ca6a25 | 9571 | { |
6da7682f | 9572 | if (is_dummy_object (instance)) |
90ca6a25 | 9573 | return get_target_expr_sfinae (init, complain); |
18619da5 | 9574 | init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init); |
90ca6a25 | 9575 | TREE_SIDE_EFFECTS (init) = true; |
9576 | return init; | |
9577 | } | |
9578 | ||
31cdebfa | 9579 | /* Otherwise go ahead with overload resolution. */ |
fc0d5c8c | 9580 | add_list_candidates (fns, first_mem_arg, user_args, |
dbfcf378 | 9581 | basetype, explicit_targs, template_only, |
66bbeb85 | 9582 | conversion_path, access_binfo, flags, |
9583 | &candidates, complain); | |
f82f1250 | 9584 | } |
dbfcf378 | 9585 | else |
67d5f2c7 | 9586 | add_candidates (fns, first_mem_arg, user_args, optype, |
9587 | explicit_targs, template_only, conversion_path, | |
9588 | access_binfo, flags, &candidates, complain); | |
9589 | ||
dbfcf378 | 9590 | any_viable_p = false; |
aa8d51e4 | 9591 | candidates = splice_viable (candidates, false, &any_viable_p); |
ec10e4ad | 9592 | |
f4da5882 | 9593 | if (!any_viable_p) |
ec10e4ad | 9594 | { |
ebd21de4 | 9595 | if (complain & tf_error) |
b78e49d1 | 9596 | complain_about_no_candidates_for_method_call (instance, candidates, |
9597 | explicit_targs, basetype, | |
9598 | optype, name, | |
9599 | skip_first_for_error, | |
9600 | user_args); | |
1611df57 | 9601 | call = error_mark_node; |
ec10e4ad | 9602 | } |
1611df57 | 9603 | else |
ec10e4ad | 9604 | { |
66bbeb85 | 9605 | cand = tourney (candidates, complain); |
1611df57 | 9606 | if (cand == 0) |
9607 | { | |
9608 | char *pretty_name; | |
9609 | bool free_p; | |
f352a3fb | 9610 | tree arglist; |
0a3b29ad | 9611 | |
ebd21de4 | 9612 | if (complain & tf_error) |
9613 | { | |
9614 | pretty_name = name_as_c_string (name, basetype, &free_p); | |
f352a3fb | 9615 | arglist = build_tree_list_vec (user_args); |
9616 | if (skip_first_for_error) | |
9617 | arglist = TREE_CHAIN (arglist); | |
bc35ef65 | 9618 | auto_diagnostic_group d; |
f770db5d | 9619 | if (!any_strictly_viable (candidates)) |
9620 | error ("no matching function for call to %<%s(%A)%>", | |
9621 | pretty_name, arglist); | |
9622 | else | |
9623 | error ("call of overloaded %<%s(%A)%> is ambiguous", | |
9624 | pretty_name, arglist); | |
b596aa1a | 9625 | print_z_candidates (location_of (name), candidates); |
ebd21de4 | 9626 | if (free_p) |
9627 | free (pretty_name); | |
9628 | } | |
1611df57 | 9629 | call = error_mark_node; |
9630 | } | |
9631 | else | |
9632 | { | |
393f878f | 9633 | fn = cand->fn; |
d9cca713 | 9634 | call = NULL_TREE; |
393f878f | 9635 | |
03106e7d | 9636 | if (!(flags & LOOKUP_NONVIRTUAL) |
393f878f | 9637 | && DECL_PURE_VIRTUAL_P (fn) |
1611df57 | 9638 | && instance == current_class_ref |
ebd21de4 | 9639 | && (complain & tf_warning)) |
c97fb132 | 9640 | { |
9641 | /* This is not an error, it is runtime undefined | |
9642 | behavior. */ | |
9643 | if (!current_function_decl) | |
9644 | warning (0, "pure virtual %q#D called from " | |
9645 | "non-static data member initializer", fn); | |
9646 | else if (DECL_CONSTRUCTOR_P (current_function_decl) | |
9647 | || DECL_DESTRUCTOR_P (current_function_decl)) | |
9648 | warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) | |
1caf9cb4 | 9649 | ? G_("pure virtual %q#D called from constructor") |
9650 | : G_("pure virtual %q#D called from destructor")), | |
c97fb132 | 9651 | fn); |
9652 | } | |
9031d10b | 9653 | |
393f878f | 9654 | if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE |
6da7682f | 9655 | && !DECL_CONSTRUCTOR_P (fn) |
18619da5 | 9656 | && is_dummy_object (instance)) |
1611df57 | 9657 | { |
f1ec53b6 | 9658 | instance = maybe_resolve_dummy (instance, true); |
d9cca713 | 9659 | if (instance == error_mark_node) |
9660 | call = error_mark_node; | |
9661 | else if (!is_dummy_object (instance)) | |
9662 | { | |
9663 | /* We captured 'this' in the current lambda now that | |
9664 | we know we really need it. */ | |
18619da5 | 9665 | cand->first_arg = instance; |
d9cca713 | 9666 | } |
eee80116 | 9667 | else if (any_dependent_bases_p ()) |
9668 | /* We can't tell until instantiation time whether we can use | |
9669 | *this as the implicit object argument. */; | |
d9cca713 | 9670 | else |
9671 | { | |
9672 | if (complain & tf_error) | |
9673 | error ("cannot call member function %qD without object", | |
9674 | fn); | |
9675 | call = error_mark_node; | |
9676 | } | |
1611df57 | 9677 | } |
d9cca713 | 9678 | |
9679 | if (call != error_mark_node) | |
1611df57 | 9680 | { |
95954949 | 9681 | /* Optimize away vtable lookup if we know that this |
9682 | function can't be overridden. We need to check if | |
b941b4ce | 9683 | the context and the type where we found fn are the same, |
95954949 | 9684 | actually FN might be defined in a different class |
9685 | type because of a using-declaration. In this case, we | |
9686 | do not want to perform a non-virtual call. */ | |
393f878f | 9687 | if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL) |
95954949 | 9688 | && same_type_ignoring_top_level_qualifiers_p |
b941b4ce | 9689 | (DECL_CONTEXT (fn), BINFO_TYPE (binfo)) |
6b45067f | 9690 | && resolves_to_fixed_type_p (instance, 0)) |
1611df57 | 9691 | flags |= LOOKUP_NONVIRTUAL; |
822dd80c | 9692 | if (explicit_targs) |
9693 | flags |= LOOKUP_EXPLICIT_TMPL_ARGS; | |
393f878f | 9694 | /* Now we know what function is being called. */ |
9695 | if (fn_p) | |
9696 | *fn_p = fn; | |
4fb96d62 | 9697 | /* Build the actual CALL_EXPR. */ |
ebd21de4 | 9698 | call = build_over_call (cand, flags, complain); |
1611df57 | 9699 | /* In an expression of the form `a->f()' where `f' turns |
9700 | out to be a static member function, `a' is | |
9701 | none-the-less evaluated. */ | |
393f878f | 9702 | if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE |
18619da5 | 9703 | && !is_dummy_object (instance) |
9704 | && TREE_SIDE_EFFECTS (instance)) | |
63cb1fa2 | 9705 | { |
9706 | /* But avoid the implicit lvalue-rvalue conversion when 'a' | |
9707 | is volatile. */ | |
9708 | tree a = instance; | |
9709 | if (TREE_THIS_VOLATILE (a)) | |
9710 | a = build_this (a); | |
9711 | call = build2 (COMPOUND_EXPR, TREE_TYPE (call), a, call); | |
9712 | } | |
38d0fc0c | 9713 | else if (call != error_mark_node |
9714 | && DECL_DESTRUCTOR_P (cand->fn) | |
9715 | && !VOID_TYPE_P (TREE_TYPE (call))) | |
9716 | /* An explicit call of the form "x->~X()" has type | |
9717 | "void". However, on platforms where destructors | |
9718 | return "this" (i.e., those where | |
9719 | targetm.cxx.cdtor_returns_this is true), such calls | |
9720 | will appear to have a return value of pointer type | |
9721 | to the low-level call machinery. We do not want to | |
9722 | change the low-level machinery, since we want to be | |
9723 | able to optimize "delete f()" on such platforms as | |
9724 | "operator delete(~X(f()))" (rather than generating | |
9725 | "t = f(), ~X(t), operator delete (t)"). */ | |
9726 | call = build_nop (void_type_node, call); | |
1611df57 | 9727 | } |
9728 | } | |
ec10e4ad | 9729 | } |
9730 | ||
1611df57 | 9731 | if (processing_template_decl && call != error_mark_node) |
7f0c5c8e | 9732 | { |
dfd6f921 | 9733 | bool cast_to_void = false; |
9734 | ||
9735 | if (TREE_CODE (call) == COMPOUND_EXPR) | |
9736 | call = TREE_OPERAND (call, 1); | |
9737 | else if (TREE_CODE (call) == NOP_EXPR) | |
9738 | { | |
9739 | cast_to_void = true; | |
9740 | call = TREE_OPERAND (call, 0); | |
9741 | } | |
86ccc124 | 9742 | if (INDIRECT_REF_P (call)) |
7f0c5c8e | 9743 | call = TREE_OPERAND (call, 0); |
f352a3fb | 9744 | call = (build_min_non_dep_call_vec |
7f0c5c8e | 9745 | (call, |
9746 | build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)), | |
9747 | orig_instance, orig_fns, NULL_TREE), | |
9748 | orig_args)); | |
8d631348 | 9749 | SET_EXPR_LOCATION (call, input_location); |
7f0c5c8e | 9750 | call = convert_from_reference (call); |
dfd6f921 | 9751 | if (cast_to_void) |
9752 | call = build_nop (void_type_node, call); | |
7f0c5c8e | 9753 | } |
ec10e4ad | 9754 | |
1611df57 | 9755 | /* Free all the conversions we allocated. */ |
9756 | obstack_free (&conversion_obstack, p); | |
ec10e4ad | 9757 | |
f352a3fb | 9758 | if (orig_args != NULL) |
9759 | release_tree_vector (orig_args); | |
9760 | ||
5516f3c3 | 9761 | return call; |
ec10e4ad | 9762 | } |
9763 | ||
6198e8f6 | 9764 | /* Wrapper for above. */ |
9765 | ||
9766 | tree | |
f1f41a6c | 9767 | build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args, |
6198e8f6 | 9768 | tree conversion_path, int flags, |
9769 | tree *fn_p, tsubst_flags_t complain) | |
9770 | { | |
9771 | tree ret; | |
9772 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
9773 | ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags, | |
9774 | fn_p, complain); | |
9775 | timevar_cond_stop (TV_OVERLOAD, subtime); | |
9776 | return ret; | |
9777 | } | |
9778 | ||
eda6e89c | 9779 | /* Returns true iff standard conversion sequence ICS1 is a proper |
772e70a1 | 9780 | subsequence of ICS2. */ |
ec10e4ad | 9781 | |
eda6e89c | 9782 | static bool |
1611df57 | 9783 | is_subseq (conversion *ics1, conversion *ics2) |
ec10e4ad | 9784 | { |
772e70a1 | 9785 | /* We can assume that a conversion of the same code |
9786 | between the same types indicates a subsequence since we only get | |
9787 | here if the types we are converting from are the same. */ | |
2ab60fff | 9788 | |
1611df57 | 9789 | while (ics1->kind == ck_rvalue |
9790 | || ics1->kind == ck_lvalue) | |
5ac302b4 | 9791 | ics1 = next_conversion (ics1); |
ec10e4ad | 9792 | |
772e70a1 | 9793 | while (1) |
ec10e4ad | 9794 | { |
1611df57 | 9795 | while (ics2->kind == ck_rvalue |
9796 | || ics2->kind == ck_lvalue) | |
5ac302b4 | 9797 | ics2 = next_conversion (ics2); |
ec10e4ad | 9798 | |
1611df57 | 9799 | if (ics2->kind == ck_user |
9800 | || ics2->kind == ck_ambig | |
afb14026 | 9801 | || ics2->kind == ck_aggr |
9802 | || ics2->kind == ck_list | |
1611df57 | 9803 | || ics2->kind == ck_identity) |
772e70a1 | 9804 | /* At this point, ICS1 cannot be a proper subsequence of |
9805 | ICS2. We can get a USER_CONV when we are comparing the | |
9806 | second standard conversion sequence of two user conversion | |
9807 | sequences. */ | |
eda6e89c | 9808 | return false; |
c90e0199 | 9809 | |
5ac302b4 | 9810 | ics2 = next_conversion (ics2); |
9dc9e65f | 9811 | |
2e9e9363 | 9812 | while (ics2->kind == ck_rvalue |
9813 | || ics2->kind == ck_lvalue) | |
9814 | ics2 = next_conversion (ics2); | |
9815 | ||
1611df57 | 9816 | if (ics2->kind == ics1->kind |
9817 | && same_type_p (ics2->type, ics1->type) | |
2e9e9363 | 9818 | && (ics1->kind == ck_identity |
9819 | || same_type_p (next_conversion (ics2)->type, | |
9820 | next_conversion (ics1)->type))) | |
eda6e89c | 9821 | return true; |
c90e0199 | 9822 | } |
9823 | } | |
9824 | ||
3160db1d | 9825 | /* Returns nonzero iff DERIVED is derived from BASE. The inputs may |
772e70a1 | 9826 | be any _TYPE nodes. */ |
ec10e4ad | 9827 | |
eda6e89c | 9828 | bool |
9829 | is_properly_derived_from (tree derived, tree base) | |
ec10e4ad | 9830 | { |
95397ff9 | 9831 | if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base)) |
eda6e89c | 9832 | return false; |
ec10e4ad | 9833 | |
772e70a1 | 9834 | /* We only allow proper derivation here. The DERIVED_FROM_P macro |
9835 | considers every class derived from itself. */ | |
1361fb16 | 9836 | return (!same_type_ignoring_top_level_qualifiers_p (derived, base) |
772e70a1 | 9837 | && DERIVED_FROM_P (base, derived)); |
9838 | } | |
2739960c | 9839 | |
772e70a1 | 9840 | /* We build the ICS for an implicit object parameter as a pointer |
9841 | conversion sequence. However, such a sequence should be compared | |
9842 | as if it were a reference conversion sequence. If ICS is the | |
9843 | implicit conversion sequence for an implicit object parameter, | |
9844 | modify it accordingly. */ | |
2739960c | 9845 | |
772e70a1 | 9846 | static void |
1611df57 | 9847 | maybe_handle_implicit_object (conversion **ics) |
772e70a1 | 9848 | { |
1611df57 | 9849 | if ((*ics)->this_p) |
2739960c | 9850 | { |
772e70a1 | 9851 | /* [over.match.funcs] |
9031d10b | 9852 | |
772e70a1 | 9853 | For non-static member functions, the type of the |
9854 | implicit object parameter is "reference to cv X" | |
9855 | where X is the class of which the function is a | |
9856 | member and cv is the cv-qualification on the member | |
9857 | function declaration. */ | |
1611df57 | 9858 | conversion *t = *ics; |
3dbb2386 | 9859 | tree reference_type; |
9860 | ||
9861 | /* The `this' parameter is a pointer to a class type. Make the | |
755edffd | 9862 | implicit conversion talk about a reference to that same class |
3dbb2386 | 9863 | type. */ |
1611df57 | 9864 | reference_type = TREE_TYPE (t->type); |
3dbb2386 | 9865 | reference_type = build_reference_type (reference_type); |
9866 | ||
1611df57 | 9867 | if (t->kind == ck_qual) |
5ac302b4 | 9868 | t = next_conversion (t); |
1611df57 | 9869 | if (t->kind == ck_ptr) |
5ac302b4 | 9870 | t = next_conversion (t); |
1611df57 | 9871 | t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE); |
9031d10b | 9872 | t = direct_reference_binding (reference_type, t); |
92392afe | 9873 | t->this_p = 1; |
9874 | t->rvaluedness_matches_p = 0; | |
772e70a1 | 9875 | *ics = t; |
2739960c | 9876 | } |
772e70a1 | 9877 | } |
9878 | ||
d157a48e | 9879 | /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion, |
63949b38 | 9880 | and return the initial reference binding conversion. Otherwise, |
9881 | leave *ICS unchanged and return NULL. */ | |
772e70a1 | 9882 | |
63949b38 | 9883 | static conversion * |
1611df57 | 9884 | maybe_handle_ref_bind (conversion **ics) |
772e70a1 | 9885 | { |
1611df57 | 9886 | if ((*ics)->kind == ck_ref_bind) |
2739960c | 9887 | { |
1611df57 | 9888 | conversion *old_ics = *ics; |
5ac302b4 | 9889 | *ics = next_conversion (old_ics); |
1611df57 | 9890 | (*ics)->user_conv_p = old_ics->user_conv_p; |
63949b38 | 9891 | return old_ics; |
2739960c | 9892 | } |
23d29b52 | 9893 | |
63949b38 | 9894 | return NULL; |
772e70a1 | 9895 | } |
9896 | ||
9897 | /* Compare two implicit conversion sequences according to the rules set out in | |
9898 | [over.ics.rank]. Return values: | |
2739960c | 9899 | |
772e70a1 | 9900 | 1: ics1 is better than ics2 |
9901 | -1: ics2 is better than ics1 | |
9902 | 0: ics1 and ics2 are indistinguishable */ | |
9903 | ||
9904 | static int | |
1611df57 | 9905 | compare_ics (conversion *ics1, conversion *ics2) |
772e70a1 | 9906 | { |
9907 | tree from_type1; | |
9908 | tree from_type2; | |
9909 | tree to_type1; | |
9910 | tree to_type2; | |
9911 | tree deref_from_type1 = NULL_TREE; | |
8f8b0e45 | 9912 | tree deref_from_type2 = NULL_TREE; |
9913 | tree deref_to_type1 = NULL_TREE; | |
9914 | tree deref_to_type2 = NULL_TREE; | |
1611df57 | 9915 | conversion_rank rank1, rank2; |
772e70a1 | 9916 | |
3160db1d | 9917 | /* REF_BINDING is nonzero if the result of the conversion sequence |
63949b38 | 9918 | is a reference type. In that case REF_CONV is the reference |
9919 | binding conversion. */ | |
9920 | conversion *ref_conv1; | |
9921 | conversion *ref_conv2; | |
772e70a1 | 9922 | |
fdbd4827 | 9923 | /* Compare badness before stripping the reference conversion. */ |
9924 | if (ics1->bad_p > ics2->bad_p) | |
9925 | return -1; | |
9926 | else if (ics1->bad_p < ics2->bad_p) | |
9927 | return 1; | |
9928 | ||
772e70a1 | 9929 | /* Handle implicit object parameters. */ |
9930 | maybe_handle_implicit_object (&ics1); | |
9931 | maybe_handle_implicit_object (&ics2); | |
9932 | ||
9933 | /* Handle reference parameters. */ | |
63949b38 | 9934 | ref_conv1 = maybe_handle_ref_bind (&ics1); |
9935 | ref_conv2 = maybe_handle_ref_bind (&ics2); | |
772e70a1 | 9936 | |
e69d2d6b | 9937 | /* List-initialization sequence L1 is a better conversion sequence than |
9938 | list-initialization sequence L2 if L1 converts to | |
9939 | std::initializer_list<X> for some X and L2 does not. */ | |
9940 | if (ics1->kind == ck_list && ics2->kind != ck_list) | |
9941 | return 1; | |
9942 | if (ics2->kind == ck_list && ics1->kind != ck_list) | |
9943 | return -1; | |
9944 | ||
772e70a1 | 9945 | /* [over.ics.rank] |
9946 | ||
9947 | When comparing the basic forms of implicit conversion sequences (as | |
9948 | defined in _over.best.ics_) | |
9949 | ||
9950 | --a standard conversion sequence (_over.ics.scs_) is a better | |
9951 | conversion sequence than a user-defined conversion sequence | |
9952 | or an ellipsis conversion sequence, and | |
9031d10b | 9953 | |
772e70a1 | 9954 | --a user-defined conversion sequence (_over.ics.user_) is a |
9955 | better conversion sequence than an ellipsis conversion sequence | |
9956 | (_over.ics.ellipsis_). */ | |
fdbd4827 | 9957 | /* Use BAD_CONVERSION_RANK because we already checked for a badness |
9958 | mismatch. If both ICS are bad, we try to make a decision based on | |
9959 | what would have happened if they'd been good. This is not an | |
9960 | extension, we'll still give an error when we build up the call; this | |
9961 | just helps us give a more helpful error message. */ | |
9962 | rank1 = BAD_CONVERSION_RANK (ics1); | |
9963 | rank2 = BAD_CONVERSION_RANK (ics2); | |
9031d10b | 9964 | |
c682aadf | 9965 | if (rank1 > rank2) |
ec10e4ad | 9966 | return -1; |
c682aadf | 9967 | else if (rank1 < rank2) |
ec10e4ad | 9968 | return 1; |
9969 | ||
62ac6d95 | 9970 | if (ics1->ellipsis_p) |
9971 | /* Both conversions are ellipsis conversions. */ | |
772e70a1 | 9972 | return 0; |
9973 | ||
ec10e4ad | 9974 | /* User-defined conversion sequence U1 is a better conversion sequence |
9975 | than another user-defined conversion sequence U2 if they contain the | |
9976 | same user-defined conversion operator or constructor and if the sec- | |
9977 | ond standard conversion sequence of U1 is better than the second | |
9978 | standard conversion sequence of U2. */ | |
9979 | ||
62ac6d95 | 9980 | /* Handle list-conversion with the same code even though it isn't always |
9981 | ranked as a user-defined conversion and it doesn't have a second | |
9982 | standard conversion sequence; it will still have the desired effect. | |
9983 | Specifically, we need to do the reference binding comparison at the | |
9984 | end of this function. */ | |
9985 | ||
31708e0a | 9986 | if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr) |
ec10e4ad | 9987 | { |
1611df57 | 9988 | conversion *t1; |
9989 | conversion *t2; | |
ec10e4ad | 9990 | |
5ac302b4 | 9991 | for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1)) |
62ac6d95 | 9992 | if (t1->kind == ck_ambig || t1->kind == ck_aggr |
9993 | || t1->kind == ck_list) | |
afb14026 | 9994 | break; |
5ac302b4 | 9995 | for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2)) |
62ac6d95 | 9996 | if (t2->kind == ck_ambig || t2->kind == ck_aggr |
9997 | || t2->kind == ck_list) | |
afb14026 | 9998 | break; |
ec10e4ad | 9999 | |
afb14026 | 10000 | if (t1->kind != t2->kind) |
ec10e4ad | 10001 | return 0; |
afb14026 | 10002 | else if (t1->kind == ck_user) |
10003 | { | |
54ebe9c2 | 10004 | tree f1 = t1->cand ? t1->cand->fn : t1->type; |
10005 | tree f2 = t2->cand ? t2->cand->fn : t2->type; | |
10006 | if (f1 != f2) | |
afb14026 | 10007 | return 0; |
10008 | } | |
10009 | else | |
10010 | { | |
10011 | /* For ambiguous or aggregate conversions, use the target type as | |
10012 | a proxy for the conversion function. */ | |
10013 | if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type)) | |
10014 | return 0; | |
10015 | } | |
ec10e4ad | 10016 | |
772e70a1 | 10017 | /* We can just fall through here, after setting up |
10018 | FROM_TYPE1 and FROM_TYPE2. */ | |
1611df57 | 10019 | from_type1 = t1->type; |
10020 | from_type2 = t2->type; | |
ec10e4ad | 10021 | } |
772e70a1 | 10022 | else |
10023 | { | |
1611df57 | 10024 | conversion *t1; |
10025 | conversion *t2; | |
10026 | ||
9031d10b | 10027 | /* We're dealing with two standard conversion sequences. |
ec10e4ad | 10028 | |
772e70a1 | 10029 | [over.ics.rank] |
9031d10b | 10030 | |
772e70a1 | 10031 | Standard conversion sequence S1 is a better conversion |
10032 | sequence than standard conversion sequence S2 if | |
9031d10b | 10033 | |
772e70a1 | 10034 | --S1 is a proper subsequence of S2 (comparing the conversion |
10035 | sequences in the canonical form defined by _over.ics.scs_, | |
10036 | excluding any Lvalue Transformation; the identity | |
10037 | conversion sequence is considered to be a subsequence of | |
10038 | any non-identity conversion sequence */ | |
9031d10b | 10039 | |
1611df57 | 10040 | t1 = ics1; |
10041 | while (t1->kind != ck_identity) | |
5ac302b4 | 10042 | t1 = next_conversion (t1); |
1611df57 | 10043 | from_type1 = t1->type; |
9031d10b | 10044 | |
1611df57 | 10045 | t2 = ics2; |
10046 | while (t2->kind != ck_identity) | |
5ac302b4 | 10047 | t2 = next_conversion (t2); |
1611df57 | 10048 | from_type2 = t2->type; |
772e70a1 | 10049 | } |
ec10e4ad | 10050 | |
f2f890a4 | 10051 | /* One sequence can only be a subsequence of the other if they start with |
10052 | the same type. They can start with different types when comparing the | |
10053 | second standard conversion sequence in two user-defined conversion | |
10054 | sequences. */ | |
daf9ff67 | 10055 | if (same_type_p (from_type1, from_type2)) |
c90e0199 | 10056 | { |
772e70a1 | 10057 | if (is_subseq (ics1, ics2)) |
c90e0199 | 10058 | return 1; |
772e70a1 | 10059 | if (is_subseq (ics2, ics1)) |
c90e0199 | 10060 | return -1; |
c90e0199 | 10061 | } |
ec10e4ad | 10062 | |
772e70a1 | 10063 | /* [over.ics.rank] |
ec10e4ad | 10064 | |
772e70a1 | 10065 | Or, if not that, |
ec10e4ad | 10066 | |
772e70a1 | 10067 | --the rank of S1 is better than the rank of S2 (by the rules |
10068 | defined below): | |
ec10e4ad | 10069 | |
772e70a1 | 10070 | Standard conversion sequences are ordered by their ranks: an Exact |
10071 | Match is a better conversion than a Promotion, which is a better | |
10072 | conversion than a Conversion. | |
ec10e4ad | 10073 | |
772e70a1 | 10074 | Two conversion sequences with the same rank are indistinguishable |
10075 | unless one of the following rules applies: | |
ec10e4ad | 10076 | |
6fe11077 | 10077 | --A conversion that does not a convert a pointer, pointer to member, |
10078 | or std::nullptr_t to bool is better than one that does. | |
ec10e4ad | 10079 | |
772e70a1 | 10080 | The ICS_STD_RANK automatically handles the pointer-to-bool rule, |
10081 | so that we do not have to check it explicitly. */ | |
1611df57 | 10082 | if (ics1->rank < ics2->rank) |
772e70a1 | 10083 | return 1; |
1611df57 | 10084 | else if (ics2->rank < ics1->rank) |
772e70a1 | 10085 | return -1; |
ec10e4ad | 10086 | |
1611df57 | 10087 | to_type1 = ics1->type; |
10088 | to_type2 = ics2->type; | |
ec10e4ad | 10089 | |
f2f890a4 | 10090 | /* A conversion from scalar arithmetic type to complex is worse than a |
10091 | conversion between scalar arithmetic types. */ | |
10092 | if (same_type_p (from_type1, from_type2) | |
10093 | && ARITHMETIC_TYPE_P (from_type1) | |
10094 | && ARITHMETIC_TYPE_P (to_type1) | |
10095 | && ARITHMETIC_TYPE_P (to_type2) | |
10096 | && ((TREE_CODE (to_type1) == COMPLEX_TYPE) | |
10097 | != (TREE_CODE (to_type2) == COMPLEX_TYPE))) | |
10098 | { | |
10099 | if (TREE_CODE (to_type1) == COMPLEX_TYPE) | |
10100 | return -1; | |
10101 | else | |
10102 | return 1; | |
10103 | } | |
10104 | ||
772e70a1 | 10105 | if (TYPE_PTR_P (from_type1) |
10106 | && TYPE_PTR_P (from_type2) | |
10107 | && TYPE_PTR_P (to_type1) | |
10108 | && TYPE_PTR_P (to_type2)) | |
10109 | { | |
10110 | deref_from_type1 = TREE_TYPE (from_type1); | |
10111 | deref_from_type2 = TREE_TYPE (from_type2); | |
10112 | deref_to_type1 = TREE_TYPE (to_type1); | |
10113 | deref_to_type2 = TREE_TYPE (to_type2); | |
10114 | } | |
10115 | /* The rules for pointers to members A::* are just like the rules | |
10116 | for pointers A*, except opposite: if B is derived from A then | |
10117 | A::* converts to B::*, not vice versa. For that reason, we | |
10118 | switch the from_ and to_ variables here. */ | |
05765a91 | 10119 | else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2) |
10120 | && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2)) | |
1bc16cab | 10121 | || (TYPE_PTRMEMFUNC_P (from_type1) |
10122 | && TYPE_PTRMEMFUNC_P (from_type2) | |
10123 | && TYPE_PTRMEMFUNC_P (to_type1) | |
10124 | && TYPE_PTRMEMFUNC_P (to_type2))) | |
10125 | { | |
10126 | deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1); | |
10127 | deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2); | |
10128 | deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1); | |
10129 | deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2); | |
772e70a1 | 10130 | } |
ec10e4ad | 10131 | |
772e70a1 | 10132 | if (deref_from_type1 != NULL_TREE |
95397ff9 | 10133 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1)) |
10134 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2))) | |
772e70a1 | 10135 | { |
9031d10b | 10136 | /* This was one of the pointer or pointer-like conversions. |
772e70a1 | 10137 | |
10138 | [over.ics.rank] | |
9031d10b | 10139 | |
772e70a1 | 10140 | --If class B is derived directly or indirectly from class A, |
10141 | conversion of B* to A* is better than conversion of B* to | |
10142 | void*, and conversion of A* to void* is better than | |
10143 | conversion of B* to void*. */ | |
c21c015b | 10144 | if (VOID_TYPE_P (deref_to_type1) |
10145 | && VOID_TYPE_P (deref_to_type2)) | |
ec10e4ad | 10146 | { |
772e70a1 | 10147 | if (is_properly_derived_from (deref_from_type1, |
10148 | deref_from_type2)) | |
ec10e4ad | 10149 | return -1; |
772e70a1 | 10150 | else if (is_properly_derived_from (deref_from_type2, |
10151 | deref_from_type1)) | |
10152 | return 1; | |
ec10e4ad | 10153 | } |
c21c015b | 10154 | else if (VOID_TYPE_P (deref_to_type1) |
10155 | || VOID_TYPE_P (deref_to_type2)) | |
ec10e4ad | 10156 | { |
daf9ff67 | 10157 | if (same_type_p (deref_from_type1, deref_from_type2)) |
772e70a1 | 10158 | { |
c21c015b | 10159 | if (VOID_TYPE_P (deref_to_type2)) |
772e70a1 | 10160 | { |
10161 | if (is_properly_derived_from (deref_from_type1, | |
10162 | deref_to_type1)) | |
10163 | return 1; | |
10164 | } | |
10165 | /* We know that DEREF_TO_TYPE1 is `void' here. */ | |
10166 | else if (is_properly_derived_from (deref_from_type1, | |
10167 | deref_to_type2)) | |
10168 | return -1; | |
10169 | } | |
ec10e4ad | 10170 | } |
95397ff9 | 10171 | else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1)) |
10172 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2))) | |
ec10e4ad | 10173 | { |
772e70a1 | 10174 | /* [over.ics.rank] |
10175 | ||
10176 | --If class B is derived directly or indirectly from class A | |
10177 | and class C is derived directly or indirectly from B, | |
9031d10b | 10178 | |
772e70a1 | 10179 | --conversion of C* to B* is better than conversion of C* to |
9031d10b | 10180 | A*, |
10181 | ||
772e70a1 | 10182 | --conversion of B* to A* is better than conversion of C* to |
10183 | A* */ | |
daf9ff67 | 10184 | if (same_type_p (deref_from_type1, deref_from_type2)) |
772e70a1 | 10185 | { |
10186 | if (is_properly_derived_from (deref_to_type1, | |
10187 | deref_to_type2)) | |
10188 | return 1; | |
10189 | else if (is_properly_derived_from (deref_to_type2, | |
10190 | deref_to_type1)) | |
10191 | return -1; | |
10192 | } | |
daf9ff67 | 10193 | else if (same_type_p (deref_to_type1, deref_to_type2)) |
772e70a1 | 10194 | { |
10195 | if (is_properly_derived_from (deref_from_type2, | |
10196 | deref_from_type1)) | |
10197 | return 1; | |
10198 | else if (is_properly_derived_from (deref_from_type1, | |
10199 | deref_from_type2)) | |
10200 | return -1; | |
10201 | } | |
ec10e4ad | 10202 | } |
772e70a1 | 10203 | } |
d157a48e | 10204 | else if (CLASS_TYPE_P (non_reference (from_type1)) |
daf9ff67 | 10205 | && same_type_p (from_type1, from_type2)) |
772e70a1 | 10206 | { |
d157a48e | 10207 | tree from = non_reference (from_type1); |
10208 | ||
772e70a1 | 10209 | /* [over.ics.rank] |
9031d10b | 10210 | |
772e70a1 | 10211 | --binding of an expression of type C to a reference of type |
10212 | B& is better than binding an expression of type C to a | |
10213 | reference of type A& | |
10214 | ||
10215 | --conversion of C to B is better than conversion of C to A, */ | |
d157a48e | 10216 | if (is_properly_derived_from (from, to_type1) |
10217 | && is_properly_derived_from (from, to_type2)) | |
ec10e4ad | 10218 | { |
772e70a1 | 10219 | if (is_properly_derived_from (to_type1, to_type2)) |
ec10e4ad | 10220 | return 1; |
772e70a1 | 10221 | else if (is_properly_derived_from (to_type2, to_type1)) |
ec10e4ad | 10222 | return -1; |
10223 | } | |
10224 | } | |
d157a48e | 10225 | else if (CLASS_TYPE_P (non_reference (to_type1)) |
daf9ff67 | 10226 | && same_type_p (to_type1, to_type2)) |
ec10e4ad | 10227 | { |
d157a48e | 10228 | tree to = non_reference (to_type1); |
10229 | ||
772e70a1 | 10230 | /* [over.ics.rank] |
ec10e4ad | 10231 | |
772e70a1 | 10232 | --binding of an expression of type B to a reference of type |
10233 | A& is better than binding an expression of type C to a | |
9031d10b | 10234 | reference of type A&, |
772e70a1 | 10235 | |
e24657db | 10236 | --conversion of B to A is better than conversion of C to A */ |
d157a48e | 10237 | if (is_properly_derived_from (from_type1, to) |
10238 | && is_properly_derived_from (from_type2, to)) | |
772e70a1 | 10239 | { |
10240 | if (is_properly_derived_from (from_type2, from_type1)) | |
10241 | return 1; | |
10242 | else if (is_properly_derived_from (from_type1, from_type2)) | |
10243 | return -1; | |
10244 | } | |
ec10e4ad | 10245 | } |
10246 | ||
772e70a1 | 10247 | /* [over.ics.rank] |
10248 | ||
10249 | --S1 and S2 differ only in their qualification conversion and yield | |
10250 | similar types T1 and T2 (_conv.qual_), respectively, and the cv- | |
10251 | qualification signature of type T1 is a proper subset of the cv- | |
10252 | qualification signature of type T2 */ | |
1611df57 | 10253 | if (ics1->kind == ck_qual |
10254 | && ics2->kind == ck_qual | |
daf9ff67 | 10255 | && same_type_p (from_type1, from_type2)) |
3d3d76c9 | 10256 | { |
10257 | int result = comp_cv_qual_signature (to_type1, to_type2); | |
10258 | if (result != 0) | |
10259 | return result; | |
10260 | } | |
772e70a1 | 10261 | |
10262 | /* [over.ics.rank] | |
9031d10b | 10263 | |
63949b38 | 10264 | --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers |
fdb268b3 | 10265 | to an implicit object parameter of a non-static member function |
10266 | declared without a ref-qualifier, and either S1 binds an lvalue | |
10267 | reference to an lvalue and S2 binds an rvalue reference or S1 binds an | |
10268 | rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x | |
10269 | draft standard, 13.3.3.2) | |
63949b38 | 10270 | |
772e70a1 | 10271 | --S1 and S2 are reference bindings (_dcl.init.ref_), and the |
10272 | types to which the references refer are the same type except for | |
10273 | top-level cv-qualifiers, and the type to which the reference | |
10274 | initialized by S2 refers is more cv-qualified than the type to | |
d900d05c | 10275 | which the reference initialized by S1 refers. |
10276 | ||
10277 | DR 1328 [over.match.best]: the context is an initialization by | |
10278 | conversion function for direct reference binding (13.3.1.6) of a | |
10279 | reference to function type, the return type of F1 is the same kind of | |
10280 | reference (i.e. lvalue or rvalue) as the reference being initialized, | |
10281 | and the return type of F2 is not. */ | |
9031d10b | 10282 | |
92392afe | 10283 | if (ref_conv1 && ref_conv2) |
63949b38 | 10284 | { |
d900d05c | 10285 | if (!ref_conv1->this_p && !ref_conv2->this_p |
10286 | && (ref_conv1->rvaluedness_matches_p | |
10287 | != ref_conv2->rvaluedness_matches_p) | |
10288 | && (same_type_p (ref_conv1->type, ref_conv2->type) | |
10289 | || (TYPE_REF_IS_RVALUE (ref_conv1->type) | |
10290 | != TYPE_REF_IS_RVALUE (ref_conv2->type)))) | |
92392afe | 10291 | { |
fdbd4827 | 10292 | if (ref_conv1->bad_p |
10293 | && !same_type_p (TREE_TYPE (ref_conv1->type), | |
10294 | TREE_TYPE (ref_conv2->type))) | |
10295 | /* Don't prefer a bad conversion that drops cv-quals to a bad | |
10296 | conversion with the wrong rvalueness. */ | |
10297 | return 0; | |
d900d05c | 10298 | return (ref_conv1->rvaluedness_matches_p |
10299 | - ref_conv2->rvaluedness_matches_p); | |
92392afe | 10300 | } |
63949b38 | 10301 | |
92392afe | 10302 | if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2)) |
fdbd4827 | 10303 | { |
10304 | int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type)); | |
10305 | int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type)); | |
10306 | if (ref_conv1->bad_p) | |
10307 | { | |
10308 | /* Prefer the one that drops fewer cv-quals. */ | |
10309 | tree ftype = next_conversion (ref_conv1)->type; | |
10310 | int fquals = cp_type_quals (ftype); | |
10311 | q1 ^= fquals; | |
10312 | q2 ^= fquals; | |
10313 | } | |
10314 | return comp_cv_qualification (q2, q1); | |
10315 | } | |
63949b38 | 10316 | } |
772e70a1 | 10317 | |
10318 | /* Neither conversion sequence is better than the other. */ | |
ec10e4ad | 10319 | return 0; |
10320 | } | |
10321 | ||
d04cff64 | 10322 | /* The source type for this standard conversion sequence. */ |
10323 | ||
747ffee6 | 10324 | static tree |
1611df57 | 10325 | source_type (conversion *t) |
747ffee6 | 10326 | { |
5ac302b4 | 10327 | for (;; t = next_conversion (t)) |
747ffee6 | 10328 | { |
1611df57 | 10329 | if (t->kind == ck_user |
10330 | || t->kind == ck_ambig | |
10331 | || t->kind == ck_identity) | |
10332 | return t->type; | |
747ffee6 | 10333 | } |
092b1d6f | 10334 | gcc_unreachable (); |
747ffee6 | 10335 | } |
94c2a480 | 10336 | |
10337 | /* Note a warning about preferring WINNER to LOSER. We do this by storing | |
10338 | a pointer to LOSER and re-running joust to produce the warning if WINNER | |
10339 | is actually used. */ | |
10340 | ||
10341 | static void | |
eda6e89c | 10342 | add_warning (struct z_candidate *winner, struct z_candidate *loser) |
94c2a480 | 10343 | { |
cc52f165 | 10344 | candidate_warning *cw = (candidate_warning *) |
10345 | conversion_obstack_alloc (sizeof (candidate_warning)); | |
1611df57 | 10346 | cw->loser = loser; |
10347 | cw->next = winner->warnings; | |
10348 | winner->warnings = cw; | |
94c2a480 | 10349 | } |
747ffee6 | 10350 | |
ec10e4ad | 10351 | /* Compare two candidates for overloading as described in |
10352 | [over.match.best]. Return values: | |
10353 | ||
10354 | 1: cand1 is better than cand2 | |
10355 | -1: cand2 is better than cand1 | |
10356 | 0: cand1 and cand2 are indistinguishable */ | |
10357 | ||
10358 | static int | |
66bbeb85 | 10359 | joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn, |
10360 | tsubst_flags_t complain) | |
ec10e4ad | 10361 | { |
10362 | int winner = 0; | |
1611df57 | 10363 | int off1 = 0, off2 = 0; |
10364 | size_t i; | |
10365 | size_t len; | |
ec10e4ad | 10366 | |
2739960c | 10367 | /* Candidates that involve bad conversions are always worse than those |
10368 | that don't. */ | |
10369 | if (cand1->viable > cand2->viable) | |
10370 | return 1; | |
10371 | if (cand1->viable < cand2->viable) | |
10372 | return -1; | |
10373 | ||
e80c1dc9 | 10374 | /* If we have two pseudo-candidates for conversions to the same type, |
c086e048 | 10375 | or two candidates for the same function, arbitrarily pick one. */ |
10376 | if (cand1->fn == cand2->fn | |
ce45a448 | 10377 | && (IS_TYPE_OR_DECL_P (cand1->fn))) |
e80c1dc9 | 10378 | return 1; |
10379 | ||
ecb10e6a | 10380 | /* Prefer a non-deleted function over an implicitly deleted move |
10381 | constructor or assignment operator. This differs slightly from the | |
10382 | wording for issue 1402 (which says the move op is ignored by overload | |
10383 | resolution), but this way produces better error messages. */ | |
10384 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
10385 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
10386 | && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn)) | |
10387 | { | |
10388 | if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn) | |
10389 | && move_fn_p (cand1->fn)) | |
10390 | return -1; | |
10391 | if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn) | |
10392 | && move_fn_p (cand2->fn)) | |
10393 | return 1; | |
10394 | } | |
10395 | ||
ec10e4ad | 10396 | /* a viable function F1 |
10397 | is defined to be a better function than another viable function F2 if | |
10398 | for all arguments i, ICSi(F1) is not a worse conversion sequence than | |
10399 | ICSi(F2), and then */ | |
10400 | ||
10401 | /* for some argument j, ICSj(F1) is a better conversion sequence than | |
10402 | ICSj(F2) */ | |
10403 | ||
657c76e1 | 10404 | /* For comparing static and non-static member functions, we ignore |
10405 | the implicit object parameter of the non-static function. The | |
10406 | standard says to pretend that the static function has an object | |
10407 | parm, but that won't work with operator overloading. */ | |
1611df57 | 10408 | len = cand1->num_convs; |
10409 | if (len != cand2->num_convs) | |
ec10e4ad | 10410 | { |
092b1d6f | 10411 | int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn); |
10412 | int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn); | |
10413 | ||
1497da26 | 10414 | if (DECL_CONSTRUCTOR_P (cand1->fn) |
10415 | && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn)) | |
10416 | /* We're comparing a near-match list constructor and a near-match | |
10417 | non-list constructor. Just treat them as unordered. */ | |
10418 | return 0; | |
10419 | ||
092b1d6f | 10420 | gcc_assert (static_1 != static_2); |
9031d10b | 10421 | |
092b1d6f | 10422 | if (static_1) |
ec10e4ad | 10423 | off2 = 1; |
092b1d6f | 10424 | else |
ec10e4ad | 10425 | { |
10426 | off1 = 1; | |
10427 | --len; | |
10428 | } | |
ec10e4ad | 10429 | } |
10430 | ||
10431 | for (i = 0; i < len; ++i) | |
10432 | { | |
1611df57 | 10433 | conversion *t1 = cand1->convs[i + off1]; |
10434 | conversion *t2 = cand2->convs[i + off2]; | |
39c8ac16 | 10435 | int comp = compare_ics (t1, t2); |
ec10e4ad | 10436 | |
10437 | if (comp != 0) | |
10438 | { | |
66bbeb85 | 10439 | if ((complain & tf_warning) |
10440 | && warn_sign_promo | |
1611df57 | 10441 | && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2) |
10442 | == cr_std + cr_promotion) | |
10443 | && t1->kind == ck_std | |
10444 | && t2->kind == ck_std | |
10445 | && TREE_CODE (t1->type) == INTEGER_TYPE | |
10446 | && TREE_CODE (t2->type) == INTEGER_TYPE | |
10447 | && (TYPE_PRECISION (t1->type) | |
10448 | == TYPE_PRECISION (t2->type)) | |
5ac302b4 | 10449 | && (TYPE_UNSIGNED (next_conversion (t1)->type) |
10450 | || (TREE_CODE (next_conversion (t1)->type) | |
39c8ac16 | 10451 | == ENUMERAL_TYPE))) |
10452 | { | |
5ac302b4 | 10453 | tree type = next_conversion (t1)->type; |
39c8ac16 | 10454 | tree type1, type2; |
94c2a480 | 10455 | struct z_candidate *w, *l; |
39c8ac16 | 10456 | if (comp > 0) |
1611df57 | 10457 | type1 = t1->type, type2 = t2->type, |
94c2a480 | 10458 | w = cand1, l = cand2; |
39c8ac16 | 10459 | else |
1611df57 | 10460 | type1 = t2->type, type2 = t1->type, |
94c2a480 | 10461 | w = cand2, l = cand1; |
39c8ac16 | 10462 | |
94c2a480 | 10463 | if (warn) |
10464 | { | |
c0d4a023 | 10465 | warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT", |
074ab442 | 10466 | type, type1, type2); |
c0d4a023 | 10467 | warning (OPT_Wsign_promo, " in call to %qD", w->fn); |
94c2a480 | 10468 | } |
10469 | else | |
10470 | add_warning (w, l); | |
39c8ac16 | 10471 | } |
10472 | ||
ec10e4ad | 10473 | if (winner && comp != winner) |
f9670f72 | 10474 | { |
10475 | winner = 0; | |
10476 | goto tweak; | |
10477 | } | |
ec10e4ad | 10478 | winner = comp; |
10479 | } | |
10480 | } | |
10481 | ||
6f186963 | 10482 | /* warn about confusing overload resolution for user-defined conversions, |
10483 | either between a constructor and a conversion op, or between two | |
10484 | conversion ops. */ | |
66bbeb85 | 10485 | if ((complain & tf_warning) |
10486 | && winner && warn_conversion && cand1->second_conv | |
72ea5dfc | 10487 | && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn)) |
10488 | && winner != compare_ics (cand1->second_conv, cand2->second_conv)) | |
10489 | { | |
10490 | struct z_candidate *w, *l; | |
10491 | bool give_warning = false; | |
9031d10b | 10492 | |
72ea5dfc | 10493 | if (winner == 1) |
10494 | w = cand1, l = cand2; | |
10495 | else | |
10496 | w = cand2, l = cand1; | |
9031d10b | 10497 | |
72ea5dfc | 10498 | /* We don't want to complain about `X::operator T1 ()' |
10499 | beating `X::operator T2 () const', when T2 is a no less | |
6beb3f76 | 10500 | cv-qualified version of T1. */ |
72ea5dfc | 10501 | if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn) |
10502 | && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn)) | |
747ffee6 | 10503 | { |
72ea5dfc | 10504 | tree t = TREE_TYPE (TREE_TYPE (l->fn)); |
10505 | tree f = TREE_TYPE (TREE_TYPE (w->fn)); | |
9031d10b | 10506 | |
d03fa520 | 10507 | if (TREE_CODE (t) == TREE_CODE (f) && INDIRECT_TYPE_P (t)) |
94c2a480 | 10508 | { |
72ea5dfc | 10509 | t = TREE_TYPE (t); |
10510 | f = TREE_TYPE (f); | |
94c2a480 | 10511 | } |
72ea5dfc | 10512 | if (!comp_ptr_ttypes (t, f)) |
10513 | give_warning = true; | |
10514 | } | |
10515 | else | |
10516 | give_warning = true; | |
9031d10b | 10517 | |
72ea5dfc | 10518 | if (!give_warning) |
10519 | /*NOP*/; | |
1ea31b92 | 10520 | else if (warn) |
72ea5dfc | 10521 | { |
1611df57 | 10522 | tree source = source_type (w->convs[0]); |
d03fa520 | 10523 | if (INDIRECT_TYPE_P (source)) |
72ea5dfc | 10524 | source = TREE_TYPE (source); |
bc35ef65 | 10525 | auto_diagnostic_group d; |
a52d5726 | 10526 | if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn) |
4d1eda3a | 10527 | && warning (OPT_Wconversion, " for conversion from %qH to %qI", |
a52d5726 | 10528 | source, w->second_conv->type)) |
10529 | { | |
5bcc316e | 10530 | inform (input_location, " because conversion sequence for the argument is better"); |
a52d5726 | 10531 | } |
747ffee6 | 10532 | } |
72ea5dfc | 10533 | else |
10534 | add_warning (w, l); | |
747ffee6 | 10535 | } |
10536 | ||
ec10e4ad | 10537 | if (winner) |
10538 | return winner; | |
10539 | ||
5335e796 | 10540 | /* DR 495 moved this tiebreaker above the template ones. */ |
10541 | /* or, if not that, | |
10542 | the context is an initialization by user-defined conversion (see | |
10543 | _dcl.init_ and _over.match.user_) and the standard conversion | |
10544 | sequence from the return type of F1 to the destination type (i.e., | |
10545 | the type of the entity being initialized) is a better conversion | |
10546 | sequence than the standard conversion sequence from the return type | |
10547 | of F2 to the destination type. */ | |
10548 | ||
10549 | if (cand1->second_conv) | |
10550 | { | |
10551 | winner = compare_ics (cand1->second_conv, cand2->second_conv); | |
10552 | if (winner) | |
10553 | return winner; | |
10554 | } | |
10555 | ||
29fbd84d | 10556 | /* or, if not that, |
10557 | F1 is a non-template function and F2 is a template function | |
10558 | specialization. */ | |
9031d10b | 10559 | |
12e22044 | 10560 | if (!cand1->template_decl && cand2->template_decl) |
ec10e4ad | 10561 | return 1; |
12e22044 | 10562 | else if (cand1->template_decl && !cand2->template_decl) |
ec10e4ad | 10563 | return -1; |
9031d10b | 10564 | |
29fbd84d | 10565 | /* or, if not that, |
10566 | F1 and F2 are template functions and the function template for F1 is | |
10567 | more specialized than the template for F2 according to the partial | |
10568 | ordering rules. */ | |
9031d10b | 10569 | |
12e22044 | 10570 | if (cand1->template_decl && cand2->template_decl) |
4825205a | 10571 | { |
517ee39a | 10572 | winner = more_specialized_fn |
653e5405 | 10573 | (TI_TEMPLATE (cand1->template_decl), |
10574 | TI_TEMPLATE (cand2->template_decl), | |
3d32803d | 10575 | /* [temp.func.order]: The presence of unused ellipsis and default |
9cb2fd58 | 10576 | arguments has no effect on the partial ordering of function |
3d32803d | 10577 | templates. add_function_candidate() will not have |
10578 | counted the "this" argument for constructors. */ | |
10579 | cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn)); | |
4825205a | 10580 | if (winner) |
653e5405 | 10581 | return winner; |
4825205a | 10582 | } |
ec10e4ad | 10583 | |
7b8c3a13 | 10584 | // C++ Concepts |
10585 | // or, if not that, F1 is more constrained than F2. | |
10586 | if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn)) | |
10587 | { | |
10588 | winner = more_constrained (cand1->fn, cand2->fn); | |
10589 | if (winner) | |
10590 | return winner; | |
10591 | } | |
56c12fd4 | 10592 | |
42decc18 | 10593 | /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */ |
10594 | if (deduction_guide_p (cand1->fn)) | |
10595 | { | |
10596 | gcc_assert (deduction_guide_p (cand2->fn)); | |
10597 | /* We distinguish between candidates from an explicit deduction guide and | |
10598 | candidates built from a constructor based on DECL_ARTIFICIAL. */ | |
10599 | int art1 = DECL_ARTIFICIAL (cand1->fn); | |
10600 | int art2 = DECL_ARTIFICIAL (cand2->fn); | |
10601 | if (art1 != art2) | |
10602 | return art2 - art1; | |
387e18c9 | 10603 | |
10604 | if (art1) | |
10605 | { | |
10606 | /* Prefer the special copy guide over a declared copy/move | |
10607 | constructor. */ | |
10608 | if (copy_guide_p (cand1->fn)) | |
10609 | return 1; | |
10610 | if (copy_guide_p (cand2->fn)) | |
10611 | return -1; | |
10612 | ||
10613 | /* Prefer a candidate generated from a non-template constructor. */ | |
10614 | int tg1 = template_guide_p (cand1->fn); | |
10615 | int tg2 = template_guide_p (cand2->fn); | |
10616 | if (tg1 != tg2) | |
10617 | return tg2 - tg1; | |
10618 | } | |
42decc18 | 10619 | } |
10620 | ||
15c1cd60 | 10621 | /* F1 is a member of a class D, F2 is a member of a base class B of D, and |
10622 | for all arguments the corresponding parameters of F1 and F2 have the same | |
10623 | type (CWG 2273/2277). */ | |
7896267d | 10624 | if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn) |
10625 | && !DECL_CONV_FN_P (cand1->fn) | |
10626 | && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn) | |
10627 | && !DECL_CONV_FN_P (cand2->fn)) | |
10628 | { | |
15c1cd60 | 10629 | tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn)); |
10630 | tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn)); | |
10631 | ||
10632 | bool used1 = false; | |
10633 | bool used2 = false; | |
10634 | if (base1 == base2) | |
10635 | /* No difference. */; | |
10636 | else if (DERIVED_FROM_P (base1, base2)) | |
10637 | used1 = true; | |
10638 | else if (DERIVED_FROM_P (base2, base1)) | |
10639 | used2 = true; | |
10640 | ||
7896267d | 10641 | if (int diff = used2 - used1) |
10642 | { | |
10643 | for (i = 0; i < len; ++i) | |
10644 | { | |
10645 | conversion *t1 = cand1->convs[i + off1]; | |
10646 | conversion *t2 = cand2->convs[i + off2]; | |
10647 | if (!same_type_p (t1->type, t2->type)) | |
10648 | break; | |
10649 | } | |
10650 | if (i == len) | |
10651 | return diff; | |
10652 | } | |
10653 | } | |
10654 | ||
ca106ab1 | 10655 | /* Check whether we can discard a builtin candidate, either because we |
10656 | have two identical ones or matching builtin and non-builtin candidates. | |
10657 | ||
10658 | (Pedantically in the latter case the builtin which matched the user | |
10659 | function should not be added to the overload set, but we spot it here. | |
9031d10b | 10660 | |
ca106ab1 | 10661 | [over.match.oper] |
10662 | ... the builtin candidates include ... | |
10663 | - do not have the same parameter type list as any non-template | |
10664 | non-member candidate. */ | |
9031d10b | 10665 | |
694683bb | 10666 | if (identifier_p (cand1->fn) || identifier_p (cand2->fn)) |
ec10e4ad | 10667 | { |
f9670f72 | 10668 | for (i = 0; i < len; ++i) |
1611df57 | 10669 | if (!same_type_p (cand1->convs[i]->type, |
10670 | cand2->convs[i]->type)) | |
ec10e4ad | 10671 | break; |
1611df57 | 10672 | if (i == cand1->num_convs) |
ca106ab1 | 10673 | { |
10674 | if (cand1->fn == cand2->fn) | |
10675 | /* Two built-in candidates; arbitrarily pick one. */ | |
10676 | return 1; | |
694683bb | 10677 | else if (identifier_p (cand1->fn)) |
ca106ab1 | 10678 | /* cand1 is built-in; prefer cand2. */ |
10679 | return -1; | |
10680 | else | |
10681 | /* cand2 is built-in; prefer cand1. */ | |
10682 | return 1; | |
10683 | } | |
ec10e4ad | 10684 | } |
10685 | ||
cc8ef84f | 10686 | /* For candidates of a multi-versioned function, make the version with |
10687 | the highest priority win. This version will be checked for dispatching | |
10688 | first. If this version can be inlined into the caller, the front-end | |
10689 | will simply make a direct call to this function. */ | |
10690 | ||
10691 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
10692 | && DECL_FUNCTION_VERSIONED (cand1->fn) | |
10693 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
10694 | && DECL_FUNCTION_VERSIONED (cand2->fn)) | |
10695 | { | |
10696 | tree f1 = TREE_TYPE (cand1->fn); | |
10697 | tree f2 = TREE_TYPE (cand2->fn); | |
10698 | tree p1 = TYPE_ARG_TYPES (f1); | |
10699 | tree p2 = TYPE_ARG_TYPES (f2); | |
10700 | ||
10701 | /* Check if cand1->fn and cand2->fn are versions of the same function. It | |
10702 | is possible that cand1->fn and cand2->fn are function versions but of | |
10703 | different functions. Check types to see if they are versions of the same | |
10704 | function. */ | |
10705 | if (compparms (p1, p2) | |
10706 | && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) | |
10707 | { | |
10708 | /* Always make the version with the higher priority, more | |
10709 | specialized, win. */ | |
10710 | gcc_assert (targetm.compare_version_priority); | |
10711 | if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0) | |
10712 | return 1; | |
10713 | else | |
10714 | return -1; | |
10715 | } | |
10716 | } | |
10717 | ||
5412fedb | 10718 | /* If the two function declarations represent the same function (this can |
10719 | happen with declarations in multiple scopes and arg-dependent lookup), | |
10720 | arbitrarily choose one. But first make sure the default args we're | |
10721 | using match. */ | |
2f72d0c8 | 10722 | if (DECL_P (cand1->fn) && DECL_P (cand2->fn) |
10723 | && equal_functions (cand1->fn, cand2->fn)) | |
5412fedb | 10724 | { |
10725 | tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn)); | |
10726 | tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn)); | |
10727 | ||
10728 | gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn)); | |
10729 | ||
10730 | for (i = 0; i < len; ++i) | |
10731 | { | |
1783eb11 | 10732 | /* Don't crash if the fn is variadic. */ |
10733 | if (!parms1) | |
10734 | break; | |
5412fedb | 10735 | parms1 = TREE_CHAIN (parms1); |
10736 | parms2 = TREE_CHAIN (parms2); | |
10737 | } | |
10738 | ||
10739 | if (off1) | |
10740 | parms1 = TREE_CHAIN (parms1); | |
10741 | else if (off2) | |
10742 | parms2 = TREE_CHAIN (parms2); | |
10743 | ||
10744 | for (; parms1; ++i) | |
10745 | { | |
10746 | if (!cp_tree_equal (TREE_PURPOSE (parms1), | |
10747 | TREE_PURPOSE (parms2))) | |
10748 | { | |
10749 | if (warn) | |
10750 | { | |
66bbeb85 | 10751 | if (complain & tf_error) |
10752 | { | |
bc35ef65 | 10753 | auto_diagnostic_group d; |
302589f0 | 10754 | if (permerror (input_location, |
10755 | "default argument mismatch in " | |
10756 | "overload resolution")) | |
10757 | { | |
36df1910 | 10758 | inform (DECL_SOURCE_LOCATION (cand1->fn), |
10759 | " candidate 1: %q#F", cand1->fn); | |
10760 | inform (DECL_SOURCE_LOCATION (cand2->fn), | |
10761 | " candidate 2: %q#F", cand2->fn); | |
302589f0 | 10762 | } |
66bbeb85 | 10763 | } |
10764 | else | |
10765 | return 0; | |
5412fedb | 10766 | } |
10767 | else | |
10768 | add_warning (cand1, cand2); | |
10769 | break; | |
10770 | } | |
10771 | parms1 = TREE_CHAIN (parms1); | |
10772 | parms2 = TREE_CHAIN (parms2); | |
10773 | } | |
10774 | ||
10775 | return 1; | |
10776 | } | |
9031d10b | 10777 | |
f9670f72 | 10778 | tweak: |
10779 | ||
10780 | /* Extension: If the worst conversion for one candidate is worse than the | |
10781 | worst conversion for the other, take the first. */ | |
66bbeb85 | 10782 | if (!pedantic && (complain & tf_warning_or_error)) |
f9670f72 | 10783 | { |
1611df57 | 10784 | conversion_rank rank1 = cr_identity, rank2 = cr_identity; |
97b330ca | 10785 | struct z_candidate *w = 0, *l = 0; |
f9670f72 | 10786 | |
10787 | for (i = 0; i < len; ++i) | |
10788 | { | |
1611df57 | 10789 | if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1) |
10790 | rank1 = CONVERSION_RANK (cand1->convs[i+off1]); | |
10791 | if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2) | |
10792 | rank2 = CONVERSION_RANK (cand2->convs[i + off2]); | |
f9670f72 | 10793 | } |
f9670f72 | 10794 | if (rank1 < rank2) |
b15da6db | 10795 | winner = 1, w = cand1, l = cand2; |
f9670f72 | 10796 | if (rank1 > rank2) |
b15da6db | 10797 | winner = -1, w = cand2, l = cand1; |
10798 | if (winner) | |
653e5405 | 10799 | { |
eae457e0 | 10800 | /* Don't choose a deleted function over ambiguity. */ |
10801 | if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn)) | |
10802 | return 0; | |
b15da6db | 10803 | if (warn) |
10804 | { | |
bc35ef65 | 10805 | auto_diagnostic_group d; |
21ca8540 | 10806 | pedwarn (input_location, 0, |
561fec9d | 10807 | "ISO C++ says that these are ambiguous, even " |
10808 | "though the worst conversion for the first is better than " | |
10809 | "the worst conversion for the second:"); | |
1e6d0c16 | 10810 | print_z_candidate (input_location, _("candidate 1:"), w); |
10811 | print_z_candidate (input_location, _("candidate 2:"), l); | |
b15da6db | 10812 | } |
10813 | else | |
10814 | add_warning (w, l); | |
653e5405 | 10815 | return winner; |
10816 | } | |
f9670f72 | 10817 | } |
10818 | ||
b4df430b | 10819 | gcc_assert (!winner); |
4825205a | 10820 | return 0; |
ec10e4ad | 10821 | } |
10822 | ||
10823 | /* Given a list of candidates for overloading, find the best one, if any. | |
10824 | This algorithm has a worst case of O(2n) (winner is last), and a best | |
10825 | case of O(n/2) (totally ambiguous); much better than a sorting | |
10826 | algorithm. */ | |
10827 | ||
10828 | static struct z_candidate * | |
66bbeb85 | 10829 | tourney (struct z_candidate *candidates, tsubst_flags_t complain) |
ec10e4ad | 10830 | { |
10831 | struct z_candidate *champ = candidates, *challenger; | |
10832 | int fate; | |
b40e0b37 | 10833 | int champ_compared_to_predecessor = 0; |
ec10e4ad | 10834 | |
10835 | /* Walk through the list once, comparing each current champ to the next | |
10836 | candidate, knocking out a candidate or two with each comparison. */ | |
10837 | ||
10838 | for (challenger = champ->next; challenger; ) | |
10839 | { | |
66bbeb85 | 10840 | fate = joust (champ, challenger, 0, complain); |
ec10e4ad | 10841 | if (fate == 1) |
10842 | challenger = challenger->next; | |
10843 | else | |
10844 | { | |
10845 | if (fate == 0) | |
10846 | { | |
10847 | champ = challenger->next; | |
10848 | if (champ == 0) | |
d26312d0 | 10849 | return NULL; |
b40e0b37 | 10850 | champ_compared_to_predecessor = 0; |
ec10e4ad | 10851 | } |
10852 | else | |
b40e0b37 | 10853 | { |
10854 | champ = challenger; | |
10855 | champ_compared_to_predecessor = 1; | |
10856 | } | |
ec10e4ad | 10857 | |
10858 | challenger = champ->next; | |
10859 | } | |
10860 | } | |
10861 | ||
10862 | /* Make sure the champ is better than all the candidates it hasn't yet | |
b40e0b37 | 10863 | been compared to. */ |
ec10e4ad | 10864 | |
9031d10b | 10865 | for (challenger = candidates; |
10866 | challenger != champ | |
b40e0b37 | 10867 | && !(champ_compared_to_predecessor && challenger->next == champ); |
ec10e4ad | 10868 | challenger = challenger->next) |
10869 | { | |
66bbeb85 | 10870 | fate = joust (champ, challenger, 0, complain); |
ec10e4ad | 10871 | if (fate != 1) |
d26312d0 | 10872 | return NULL; |
ec10e4ad | 10873 | } |
10874 | ||
10875 | return champ; | |
10876 | } | |
f9670f72 | 10877 | |
3160db1d | 10878 | /* Returns nonzero if things of type FROM can be converted to TO. */ |
03a4182f | 10879 | |
eda6e89c | 10880 | bool |
66bbeb85 | 10881 | can_convert (tree to, tree from, tsubst_flags_t complain) |
b657f346 | 10882 | { |
10883 | tree arg = NULL_TREE; | |
10884 | /* implicit_conversion only considers user-defined conversions | |
10885 | if it has an expression for the call argument list. */ | |
10886 | if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to)) | |
10887 | arg = build1 (CAST_EXPR, from, NULL_TREE); | |
10888 | return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain); | |
10889 | } | |
10890 | ||
10891 | /* Returns nonzero if things of type FROM can be converted to TO with a | |
10892 | standard conversion. */ | |
10893 | ||
10894 | bool | |
10895 | can_convert_standard (tree to, tree from, tsubst_flags_t complain) | |
f9670f72 | 10896 | { |
66bbeb85 | 10897 | return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain); |
f9670f72 | 10898 | } |
10899 | ||
3160db1d | 10900 | /* Returns nonzero if ARG (of type FROM) can be converted to TO. */ |
03a4182f | 10901 | |
eda6e89c | 10902 | bool |
66bbeb85 | 10903 | can_convert_arg (tree to, tree from, tree arg, int flags, |
10904 | tsubst_flags_t complain) | |
f9670f72 | 10905 | { |
1611df57 | 10906 | conversion *t; |
10907 | void *p; | |
10908 | bool ok_p; | |
10909 | ||
10910 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10911 | p = conversion_obstack_alloc (0); | |
310a8f0e | 10912 | /* We want to discard any access checks done for this test, |
10913 | as we might not be in the appropriate access context and | |
10914 | we'll do the check again when we actually perform the | |
10915 | conversion. */ | |
10916 | push_deferring_access_checks (dk_deferred); | |
1611df57 | 10917 | |
308d6af4 | 10918 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
66bbeb85 | 10919 | flags, complain); |
1611df57 | 10920 | ok_p = (t && !t->bad_p); |
10921 | ||
310a8f0e | 10922 | /* Discard the access checks now. */ |
10923 | pop_deferring_access_checks (); | |
1611df57 | 10924 | /* Free all the conversions we allocated. */ |
10925 | obstack_free (&conversion_obstack, p); | |
10926 | ||
10927 | return ok_p; | |
f9670f72 | 10928 | } |
a3786328 | 10929 | |
1fab1557 | 10930 | /* Like can_convert_arg, but allows dubious conversions as well. */ |
10931 | ||
eda6e89c | 10932 | bool |
66bbeb85 | 10933 | can_convert_arg_bad (tree to, tree from, tree arg, int flags, |
10934 | tsubst_flags_t complain) | |
1fab1557 | 10935 | { |
1611df57 | 10936 | conversion *t; |
10937 | void *p; | |
10938 | ||
10939 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10940 | p = conversion_obstack_alloc (0); | |
10941 | /* Try to perform the conversion. */ | |
8de1f703 | 10942 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
66bbeb85 | 10943 | flags, complain); |
1611df57 | 10944 | /* Free all the conversions we allocated. */ |
10945 | obstack_free (&conversion_obstack, p); | |
10946 | ||
10947 | return t != NULL; | |
1fab1557 | 10948 | } |
10949 | ||
10950 | /* Convert EXPR to TYPE. Return the converted expression. | |
10951 | ||
10952 | Note that we allow bad conversions here because by the time we get to | |
10953 | this point we are committed to doing the conversion. If we end up | |
10954 | doing a bad conversion, convert_like will complain. */ | |
03a4182f | 10955 | |
8c18e707 | 10956 | tree |
66bbeb85 | 10957 | perform_implicit_conversion_flags (tree type, tree expr, |
10958 | tsubst_flags_t complain, int flags) | |
8c18e707 | 10959 | { |
1611df57 | 10960 | conversion *conv; |
10961 | void *p; | |
d3a3cfb8 | 10962 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
1611df57 | 10963 | |
90ad495b | 10964 | if (TYPE_REF_P (type)) |
e00197cb | 10965 | expr = mark_lvalue_use (expr); |
10966 | else | |
10967 | expr = mark_rvalue_use (expr); | |
10968 | ||
0a3b29ad | 10969 | if (error_operand_p (expr)) |
1206f166 | 10970 | return error_mark_node; |
1611df57 | 10971 | |
10972 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
10973 | p = conversion_obstack_alloc (0); | |
10974 | ||
1206f166 | 10975 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
8de1f703 | 10976 | /*c_cast_p=*/false, |
66bbeb85 | 10977 | flags, complain); |
cf7aa2e5 | 10978 | |
1fab1557 | 10979 | if (!conv) |
8c18e707 | 10980 | { |
ebd21de4 | 10981 | if (complain & tf_error) |
cf7aa2e5 | 10982 | { |
10983 | /* If expr has unknown type, then it is an overloaded function. | |
10984 | Call instantiate_type to get good error messages. */ | |
10985 | if (TREE_TYPE (expr) == unknown_type_node) | |
10986 | instantiate_type (type, expr, complain); | |
5c874cd3 | 10987 | else if (invalid_nonstatic_memfn_p (loc, expr, complain)) |
cf7aa2e5 | 10988 | /* We gave an error. */; |
10989 | else | |
b7bb5264 | 10990 | { |
10991 | range_label_for_type_mismatch label (TREE_TYPE (expr), type); | |
10992 | gcc_rich_location rich_loc (loc, &label); | |
10993 | error_at (&rich_loc, "could not convert %qE from %qH to %qI", | |
10994 | expr, TREE_TYPE (expr), type); | |
10995 | } | |
cf7aa2e5 | 10996 | } |
1611df57 | 10997 | expr = error_mark_node; |
8c18e707 | 10998 | } |
995fad40 | 10999 | else if (processing_template_decl && conv->kind != ck_identity) |
c9e1b8d8 | 11000 | { |
11001 | /* In a template, we are only concerned about determining the | |
11002 | type of non-dependent expressions, so we do not have to | |
91c3ace5 | 11003 | perform the actual conversion. But for initializers, we |
11004 | need to be able to perform it at instantiation | |
21131a05 | 11005 | (or instantiate_non_dependent_expr) time. */ |
91c3ace5 | 11006 | expr = build1 (IMPLICIT_CONV_EXPR, type, expr); |
11007 | if (!(flags & LOOKUP_ONLYCONVERTING)) | |
11008 | IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true; | |
c9e1b8d8 | 11009 | } |
1611df57 | 11010 | else |
ebd21de4 | 11011 | expr = convert_like (conv, expr, complain); |
1611df57 | 11012 | |
11013 | /* Free all the conversions we allocated. */ | |
11014 | obstack_free (&conversion_obstack, p); | |
8c18e707 | 11015 | |
1611df57 | 11016 | return expr; |
8c18e707 | 11017 | } |
11018 | ||
cf7aa2e5 | 11019 | tree |
11020 | perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain) | |
11021 | { | |
66bbeb85 | 11022 | return perform_implicit_conversion_flags (type, expr, complain, |
11023 | LOOKUP_IMPLICIT); | |
cf7aa2e5 | 11024 | } |
11025 | ||
ec965e9b | 11026 | /* Convert EXPR to TYPE (as a direct-initialization) if that is |
11027 | permitted. If the conversion is valid, the converted expression is | |
a610fc5e | 11028 | returned. Otherwise, NULL_TREE is returned, except in the case |
6ab399e8 | 11029 | that TYPE is a class type; in that case, an error is issued. If |
90ca6a25 | 11030 | C_CAST_P is true, then this direct-initialization is taking |
6ab399e8 | 11031 | place as part of a static_cast being attempted as part of a C-style |
11032 | cast. */ | |
ec965e9b | 11033 | |
11034 | tree | |
9031d10b | 11035 | perform_direct_initialization_if_possible (tree type, |
6ab399e8 | 11036 | tree expr, |
ebd21de4 | 11037 | bool c_cast_p, |
11038 | tsubst_flags_t complain) | |
ec965e9b | 11039 | { |
1611df57 | 11040 | conversion *conv; |
11041 | void *p; | |
11042 | ||
ec965e9b | 11043 | if (type == error_mark_node || error_operand_p (expr)) |
11044 | return error_mark_node; | |
a610fc5e | 11045 | /* [dcl.init] |
11046 | ||
11047 | If the destination type is a (possibly cv-qualified) class type: | |
11048 | ||
11049 | -- If the initialization is direct-initialization ..., | |
11050 | constructors are considered. ... If no constructor applies, or | |
11051 | the overload resolution is ambiguous, the initialization is | |
11052 | ill-formed. */ | |
11053 | if (CLASS_TYPE_P (type)) | |
f46d4a11 | 11054 | { |
f1f41a6c | 11055 | vec<tree, va_gc> *args = make_tree_vector_single (expr); |
f46d4a11 | 11056 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, |
f352a3fb | 11057 | &args, type, LOOKUP_NORMAL, complain); |
11058 | release_tree_vector (args); | |
3d4bed93 | 11059 | return build_cplus_new (type, expr, complain); |
f46d4a11 | 11060 | } |
1611df57 | 11061 | |
11062 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
11063 | p = conversion_obstack_alloc (0); | |
11064 | ||
ec965e9b | 11065 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
8de1f703 | 11066 | c_cast_p, |
66bbeb85 | 11067 | LOOKUP_NORMAL, complain); |
1611df57 | 11068 | if (!conv || conv->bad_p) |
11069 | expr = NULL_TREE; | |
c36e63fe | 11070 | else if (processing_template_decl && conv->kind != ck_identity) |
11071 | { | |
11072 | /* In a template, we are only concerned about determining the | |
11073 | type of non-dependent expressions, so we do not have to | |
11074 | perform the actual conversion. But for initializers, we | |
11075 | need to be able to perform it at instantiation | |
11076 | (or instantiate_non_dependent_expr) time. */ | |
11077 | expr = build1 (IMPLICIT_CONV_EXPR, type, expr); | |
11078 | IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true; | |
11079 | } | |
1611df57 | 11080 | else |
d93ee6f8 | 11081 | expr = convert_like_real (conv, expr, NULL_TREE, 0, |
6ab399e8 | 11082 | /*issue_conversion_warnings=*/false, |
ebd21de4 | 11083 | c_cast_p, |
640a46a5 | 11084 | complain); |
1611df57 | 11085 | |
11086 | /* Free all the conversions we allocated. */ | |
11087 | obstack_free (&conversion_obstack, p); | |
11088 | ||
11089 | return expr; | |
ec965e9b | 11090 | } |
11091 | ||
c7b89256 | 11092 | /* When initializing a reference that lasts longer than a full-expression, |
11093 | this special rule applies: | |
11094 | ||
11095 | [class.temporary] | |
11096 | ||
11097 | The temporary to which the reference is bound or the temporary | |
11098 | that is the complete object to which the reference is bound | |
11099 | persists for the lifetime of the reference. | |
11100 | ||
11101 | The temporaries created during the evaluation of the expression | |
11102 | initializing the reference, except the temporary to which the | |
11103 | reference is bound, are destroyed at the end of the | |
11104 | full-expression in which they are created. | |
11105 | ||
11106 | In that case, we store the converted expression into a new | |
11107 | VAR_DECL in a new scope. | |
11108 | ||
11109 | However, we want to be careful not to create temporaries when | |
11110 | they are not required. For example, given: | |
11111 | ||
11112 | struct B {}; | |
11113 | struct D : public B {}; | |
11114 | D f(); | |
11115 | const B& b = f(); | |
11116 | ||
11117 | there is no need to copy the return value from "f"; we can just | |
11118 | extend its lifetime. Similarly, given: | |
11119 | ||
11120 | struct S {}; | |
11121 | struct T { operator S(); }; | |
11122 | T t; | |
11123 | const S& s = t; | |
11124 | ||
11125 | we can extend the lifetime of the return value of the conversion | |
11126 | operator. | |
11127 | ||
11128 | The next several functions are involved in this lifetime extension. */ | |
11129 | ||
3740094c | 11130 | /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The |
11131 | reference is being bound to a temporary. Create and return a new | |
11132 | VAR_DECL with the indicated TYPE; this variable will store the value to | |
7c09476d | 11133 | which the reference is bound. */ |
8999978b | 11134 | |
9031d10b | 11135 | tree |
7c09476d | 11136 | make_temporary_var_for_ref_to_temp (tree decl, tree type) |
8999978b | 11137 | { |
3e584e1f | 11138 | tree var = create_temporary_var (type); |
8999978b | 11139 | |
11140 | /* Register the variable. */ | |
80a58eb0 | 11141 | if (VAR_P (decl) |
800478e6 | 11142 | && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl))) |
8999978b | 11143 | { |
11144 | /* Namespace-scope or local static; give it a mangled name. */ | |
c7b89256 | 11145 | /* FIXME share comdat with decl? */ |
8999978b | 11146 | |
3740094c | 11147 | TREE_STATIC (var) = TREE_STATIC (decl); |
800478e6 | 11148 | CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl); |
5e68df57 | 11149 | set_decl_tls_model (var, DECL_TLS_MODEL (decl)); |
3e584e1f | 11150 | |
11151 | tree name = mangle_ref_init_variable (decl); | |
8999978b | 11152 | DECL_NAME (var) = name; |
11153 | SET_DECL_ASSEMBLER_NAME (var, name); | |
8999978b | 11154 | } |
11155 | else | |
79b01846 | 11156 | /* Create a new cleanup level if necessary. */ |
11157 | maybe_push_cleanup_level (type); | |
8999978b | 11158 | |
8670be88 | 11159 | return pushdecl (var); |
8999978b | 11160 | } |
11161 | ||
f82f1250 | 11162 | /* EXPR is the initializer for a variable DECL of reference or |
11163 | std::initializer_list type. Create, push and return a new VAR_DECL | |
11164 | for the initializer so that it will live as long as DECL. Any | |
11165 | cleanup for the new variable is returned through CLEANUP, and the | |
11166 | code to initialize the new variable is returned through INITP. */ | |
11167 | ||
c7b89256 | 11168 | static tree |
f1f41a6c | 11169 | set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups, |
c7b89256 | 11170 | tree *initp) |
f82f1250 | 11171 | { |
11172 | tree init; | |
11173 | tree type; | |
11174 | tree var; | |
11175 | ||
11176 | /* Create the temporary variable. */ | |
11177 | type = TREE_TYPE (expr); | |
11178 | var = make_temporary_var_for_ref_to_temp (decl, type); | |
11179 | layout_decl (var, 0); | |
11180 | /* If the rvalue is the result of a function call it will be | |
11181 | a TARGET_EXPR. If it is some other construct (such as a | |
11182 | member access expression where the underlying object is | |
11183 | itself the result of a function call), turn it into a | |
11184 | TARGET_EXPR here. It is important that EXPR be a | |
11185 | TARGET_EXPR below since otherwise the INIT_EXPR will | |
11186 | attempt to make a bitwise copy of EXPR to initialize | |
11187 | VAR. */ | |
11188 | if (TREE_CODE (expr) != TARGET_EXPR) | |
11189 | expr = get_target_expr (expr); | |
ce984e5e | 11190 | |
87e008d2 | 11191 | if (TREE_CODE (decl) == FIELD_DECL |
11192 | && extra_warnings && !TREE_NO_WARNING (decl)) | |
11193 | { | |
11194 | warning (OPT_Wextra, "a temporary bound to %qD only persists " | |
11195 | "until the constructor exits", decl); | |
11196 | TREE_NO_WARNING (decl) = true; | |
11197 | } | |
11198 | ||
c7b89256 | 11199 | /* Recursively extend temps in this initializer. */ |
11200 | TARGET_EXPR_INITIAL (expr) | |
11201 | = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups); | |
11202 | ||
74e797a9 | 11203 | /* Any reference temp has a non-trivial initializer. */ |
11204 | DECL_NONTRIVIALLY_INITIALIZED_P (var) = true; | |
11205 | ||
ce984e5e | 11206 | /* If the initializer is constant, put it in DECL_INITIAL so we get |
11207 | static initialization and use in constant expressions. */ | |
11208 | init = maybe_constant_init (expr); | |
ea781c13 | 11209 | /* As in store_init_value. */ |
11210 | init = cp_fully_fold (init); | |
ce984e5e | 11211 | if (TREE_CONSTANT (init)) |
11212 | { | |
11213 | if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type)) | |
11214 | { | |
11215 | /* 5.19 says that a constant expression can include an | |
11216 | lvalue-rvalue conversion applied to "a glvalue of literal type | |
11217 | that refers to a non-volatile temporary object initialized | |
11218 | with a constant expression". Rather than try to communicate | |
e7cc975a | 11219 | that this VAR_DECL is a temporary, just mark it constexpr. */ |
ce984e5e | 11220 | DECL_DECLARED_CONSTEXPR_P (var) = true; |
43b367c6 | 11221 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true; |
ce984e5e | 11222 | TREE_CONSTANT (var) = true; |
e7cc975a | 11223 | TREE_READONLY (var) = true; |
ce984e5e | 11224 | } |
11225 | DECL_INITIAL (var) = init; | |
11226 | init = NULL_TREE; | |
11227 | } | |
11228 | else | |
11229 | /* Create the INIT_EXPR that will initialize the temporary | |
11230 | variable. */ | |
39786c80 | 11231 | init = split_nonconstant_init (var, expr); |
f82f1250 | 11232 | if (at_function_scope_p ()) |
11233 | { | |
11234 | add_decl_expr (var); | |
11235 | ||
11236 | if (TREE_STATIC (var)) | |
11237 | init = add_stmt_to_compound (init, register_dtor_fn (var)); | |
11238 | else | |
c7b89256 | 11239 | { |
11240 | tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
11241 | if (cleanup) | |
f1f41a6c | 11242 | vec_safe_push (*cleanups, cleanup); |
c7b89256 | 11243 | } |
f82f1250 | 11244 | |
11245 | /* We must be careful to destroy the temporary only | |
11246 | after its initialization has taken place. If the | |
11247 | initialization throws an exception, then the | |
11248 | destructor should not be run. We cannot simply | |
11249 | transform INIT into something like: | |
11250 | ||
11251 | (INIT, ({ CLEANUP_STMT; })) | |
11252 | ||
11253 | because emit_local_var always treats the | |
11254 | initializer as a full-expression. Thus, the | |
11255 | destructor would run too early; it would run at the | |
11256 | end of initializing the reference variable, rather | |
11257 | than at the end of the block enclosing the | |
11258 | reference variable. | |
11259 | ||
11260 | The solution is to pass back a cleanup expression | |
11261 | which the caller is responsible for attaching to | |
11262 | the statement tree. */ | |
11263 | } | |
11264 | else | |
11265 | { | |
11266 | rest_of_decl_compilation (var, /*toplev=*/1, at_eof); | |
11267 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
462819c8 | 11268 | { |
800478e6 | 11269 | if (CP_DECL_THREAD_LOCAL_P (var)) |
462819c8 | 11270 | tls_aggregates = tree_cons (NULL_TREE, var, |
11271 | tls_aggregates); | |
11272 | else | |
11273 | static_aggregates = tree_cons (NULL_TREE, var, | |
11274 | static_aggregates); | |
11275 | } | |
575852de | 11276 | else |
11277 | /* Check whether the dtor is callable. */ | |
11278 | cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
f82f1250 | 11279 | } |
50a502ff | 11280 | /* Avoid -Wunused-variable warning (c++/38958). */ |
11281 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
f4ae4202 | 11282 | && VAR_P (decl)) |
50a502ff | 11283 | TREE_USED (decl) = DECL_READ_P (decl) = true; |
f82f1250 | 11284 | |
11285 | *initp = init; | |
11286 | return var; | |
11287 | } | |
11288 | ||
a3786328 | 11289 | /* Convert EXPR to the indicated reference TYPE, in a way suitable for |
c7b89256 | 11290 | initializing a variable of that TYPE. */ |
a3786328 | 11291 | |
11292 | tree | |
c7b89256 | 11293 | initialize_reference (tree type, tree expr, |
8f5dd910 | 11294 | int flags, tsubst_flags_t complain) |
a3786328 | 11295 | { |
1611df57 | 11296 | conversion *conv; |
11297 | void *p; | |
d3a3cfb8 | 11298 | location_t loc = cp_expr_loc_or_loc (expr, input_location); |
8999978b | 11299 | |
11300 | if (type == error_mark_node || error_operand_p (expr)) | |
11301 | return error_mark_node; | |
a3786328 | 11302 | |
1611df57 | 11303 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
11304 | p = conversion_obstack_alloc (0); | |
11305 | ||
0664b425 | 11306 | conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false, |
66bbeb85 | 11307 | flags, complain); |
1611df57 | 11308 | if (!conv || conv->bad_p) |
a3786328 | 11309 | { |
77c5b040 | 11310 | if (complain & tf_error) |
11311 | { | |
d6b20eb5 | 11312 | if (conv) |
11313 | convert_like (conv, expr, complain); | |
11314 | else if (!CP_TYPE_CONST_P (TREE_TYPE (type)) | |
11315 | && !TYPE_REF_IS_RVALUE (type) | |
18bede74 | 11316 | && !lvalue_p (expr)) |
61f69bc9 | 11317 | error_at (loc, "invalid initialization of non-const reference of " |
4d1eda3a | 11318 | "type %qH from an rvalue of type %qI", |
61f69bc9 | 11319 | type, TREE_TYPE (expr)); |
77c5b040 | 11320 | else |
61f69bc9 | 11321 | error_at (loc, "invalid initialization of reference of type " |
4d1eda3a | 11322 | "%qH from expression of type %qI", type, |
61f69bc9 | 11323 | TREE_TYPE (expr)); |
77c5b040 | 11324 | } |
a3786328 | 11325 | return error_mark_node; |
11326 | } | |
11327 | ||
090e6222 | 11328 | if (conv->kind == ck_ref_bind) |
11329 | /* Perform the conversion. */ | |
11330 | expr = convert_like (conv, expr, complain); | |
11331 | else if (conv->kind == ck_ambig) | |
11332 | /* We gave an error in build_user_type_conversion_1. */ | |
11333 | expr = error_mark_node; | |
11334 | else | |
11335 | gcc_unreachable (); | |
8999978b | 11336 | |
c7b89256 | 11337 | /* Free all the conversions we allocated. */ |
11338 | obstack_free (&conversion_obstack, p); | |
7c09476d | 11339 | |
c7b89256 | 11340 | return expr; |
11341 | } | |
7c09476d | 11342 | |
c7b89256 | 11343 | /* Subroutine of extend_ref_init_temps. Possibly extend one initializer, |
11344 | which is bound either to a reference or a std::initializer_list. */ | |
7c09476d | 11345 | |
c7b89256 | 11346 | static tree |
f1f41a6c | 11347 | extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups) |
c7b89256 | 11348 | { |
11349 | tree sub = init; | |
11350 | tree *p; | |
11351 | STRIP_NOPS (sub); | |
63ade1d8 | 11352 | if (TREE_CODE (sub) == COMPOUND_EXPR) |
11353 | { | |
11354 | TREE_OPERAND (sub, 1) | |
11355 | = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups); | |
11356 | return init; | |
11357 | } | |
c7b89256 | 11358 | if (TREE_CODE (sub) != ADDR_EXPR) |
11359 | return init; | |
11360 | /* Deal with binding to a subobject. */ | |
a20434cd | 11361 | for (p = &TREE_OPERAND (sub, 0); |
11362 | (TREE_CODE (*p) == COMPONENT_REF | |
11363 | || TREE_CODE (*p) == ARRAY_REF); ) | |
c7b89256 | 11364 | p = &TREE_OPERAND (*p, 0); |
11365 | if (TREE_CODE (*p) == TARGET_EXPR) | |
11366 | { | |
11367 | tree subinit = NULL_TREE; | |
11368 | *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit); | |
ba5b9ab3 | 11369 | recompute_tree_invariant_for_addr_expr (sub); |
11370 | if (init != sub) | |
11371 | init = fold_convert (TREE_TYPE (init), sub); | |
c7b89256 | 11372 | if (subinit) |
11373 | init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init); | |
11374 | } | |
11375 | return init; | |
11376 | } | |
7c09476d | 11377 | |
c7b89256 | 11378 | /* INIT is part of the initializer for DECL. If there are any |
11379 | reference or initializer lists being initialized, extend their | |
11380 | lifetime to match that of DECL. */ | |
7c09476d | 11381 | |
c7b89256 | 11382 | tree |
f1f41a6c | 11383 | extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups) |
c7b89256 | 11384 | { |
11385 | tree type = TREE_TYPE (init); | |
11386 | if (processing_template_decl) | |
11387 | return init; | |
90ad495b | 11388 | if (TYPE_REF_P (type)) |
c7b89256 | 11389 | init = extend_ref_init_temps_1 (decl, init, cleanups); |
18c3eaed | 11390 | else |
8999978b | 11391 | { |
c7b89256 | 11392 | tree ctor = init; |
11393 | if (TREE_CODE (ctor) == TARGET_EXPR) | |
11394 | ctor = TARGET_EXPR_INITIAL (ctor); | |
11395 | if (TREE_CODE (ctor) == CONSTRUCTOR) | |
7c09476d | 11396 | { |
18c3eaed | 11397 | if (is_std_init_list (type)) |
11398 | { | |
11399 | /* The temporary array underlying a std::initializer_list | |
11400 | is handled like a reference temporary. */ | |
11401 | tree array = CONSTRUCTOR_ELT (ctor, 0)->value; | |
11402 | array = extend_ref_init_temps_1 (decl, array, cleanups); | |
11403 | CONSTRUCTOR_ELT (ctor, 0)->value = array; | |
11404 | } | |
11405 | else | |
11406 | { | |
11407 | unsigned i; | |
11408 | constructor_elt *p; | |
11409 | vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor); | |
11410 | FOR_EACH_VEC_SAFE_ELT (elts, i, p) | |
11411 | p->value = extend_ref_init_temps (decl, p->value, cleanups); | |
11412 | } | |
27fa8466 | 11413 | recompute_constructor_flags (ctor); |
11414 | if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor)) | |
11415 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true; | |
7c09476d | 11416 | } |
8999978b | 11417 | } |
11418 | ||
c7b89256 | 11419 | return init; |
a3786328 | 11420 | } |
1f3233d1 | 11421 | |
68fca41d | 11422 | /* Returns true iff an initializer for TYPE could contain temporaries that |
11423 | need to be extended because they are bound to references or | |
11424 | std::initializer_list. */ | |
11425 | ||
11426 | bool | |
11427 | type_has_extended_temps (tree type) | |
11428 | { | |
11429 | type = strip_array_types (type); | |
90ad495b | 11430 | if (TYPE_REF_P (type)) |
68fca41d | 11431 | return true; |
11432 | if (CLASS_TYPE_P (type)) | |
11433 | { | |
11434 | if (is_std_init_list (type)) | |
11435 | return true; | |
11436 | for (tree f = next_initializable_field (TYPE_FIELDS (type)); | |
11437 | f; f = next_initializable_field (DECL_CHAIN (f))) | |
11438 | if (type_has_extended_temps (TREE_TYPE (f))) | |
11439 | return true; | |
11440 | } | |
11441 | return false; | |
11442 | } | |
11443 | ||
f82f1250 | 11444 | /* Returns true iff TYPE is some variant of std::initializer_list. */ |
11445 | ||
11446 | bool | |
11447 | is_std_init_list (tree type) | |
11448 | { | |
f85224af | 11449 | if (!TYPE_P (type)) |
11450 | return false; | |
900467dc | 11451 | if (cxx_dialect == cxx98) |
11452 | return false; | |
c99e91fe | 11453 | /* Look through typedefs. */ |
f85224af | 11454 | type = TYPE_MAIN_VARIANT (type); |
f82f1250 | 11455 | return (CLASS_TYPE_P (type) |
11456 | && CP_TYPE_CONTEXT (type) == std_node | |
c99e91fe | 11457 | && init_list_identifier == DECL_NAME (TYPE_NAME (type))); |
f82f1250 | 11458 | } |
11459 | ||
11460 | /* Returns true iff DECL is a list constructor: i.e. a constructor which | |
11461 | will accept an argument list of a single std::initializer_list<T>. */ | |
11462 | ||
11463 | bool | |
11464 | is_list_ctor (tree decl) | |
11465 | { | |
11466 | tree args = FUNCTION_FIRST_USER_PARMTYPE (decl); | |
11467 | tree arg; | |
11468 | ||
11469 | if (!args || args == void_list_node) | |
11470 | return false; | |
11471 | ||
11472 | arg = non_reference (TREE_VALUE (args)); | |
11473 | if (!is_std_init_list (arg)) | |
11474 | return false; | |
11475 | ||
11476 | args = TREE_CHAIN (args); | |
11477 | ||
11478 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
11479 | /* There are more non-defaulted parms. */ | |
11480 | return false; | |
11481 | ||
11482 | return true; | |
11483 | } | |
11484 | ||
1f3233d1 | 11485 | #include "gt-cp-call.h" |