]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Functions related to invoking methods and overloaded functions. |
5624e564 | 2 | Copyright (C) 1987-2015 Free Software Foundation, Inc. |
8d08fdba | 3 | Contributed by Michael Tiemann (tiemann@cygnus.com) and |
e5e809f4 | 4 | modified by Brendan Kehoe (brendan@cygnus.com). |
8d08fdba | 5 | |
f5adbb8d | 6 | This file is part of GCC. |
8d08fdba | 7 | |
f5adbb8d | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 9 | it under the terms of the GNU General Public License as published by |
e77f031d | 10 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
11 | any later version. |
12 | ||
f5adbb8d | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
21 | |
22 | ||
e92cc029 | 23 | /* High-level class interface. */ |
8d08fdba MS |
24 | |
25 | #include "config.h" | |
8d052bc7 | 26 | #include "system.h" |
4977bab6 ZW |
27 | #include "coretypes.h" |
28 | #include "tm.h" | |
40e23961 | 29 | #include "alias.h" |
570221c2 | 30 | #include "tree.h" |
d8a2d370 DN |
31 | #include "stor-layout.h" |
32 | #include "trans-mem.h" | |
33 | #include "stringpool.h" | |
8d08fdba | 34 | #include "cp-tree.h" |
8d08fdba | 35 | #include "flags.h" |
54f92bfb | 36 | #include "toplev.h" |
1da2ed5f | 37 | #include "diagnostic-core.h" |
d2a6f3c0 | 38 | #include "intl.h" |
7d149679 | 39 | #include "target.h" |
7b6d72fc | 40 | #include "convert.h" |
c79efc4d | 41 | #include "langhooks.h" |
61d3ce20 | 42 | #include "c-family/c-objc.h" |
575bfb00 | 43 | #include "timevar.h" |
c582198b | 44 | #include "hard-reg-set.h" |
c582198b | 45 | #include "function.h" |
3649b9b7 | 46 | #include "cgraph.h" |
35228ac7 | 47 | #include "internal-fn.h" |
8d08fdba | 48 | |
5bd61841 MM |
49 | /* The various kinds of conversion. */ |
50 | ||
a79683d5 | 51 | enum conversion_kind { |
5bd61841 MM |
52 | ck_identity, |
53 | ck_lvalue, | |
b8fd7909 | 54 | ck_tsafe, |
5bd61841 MM |
55 | ck_qual, |
56 | ck_std, | |
57 | ck_ptr, | |
58 | ck_pmem, | |
59 | ck_base, | |
60 | ck_ref_bind, | |
61 | ck_user, | |
62 | ck_ambig, | |
09357846 JM |
63 | ck_list, |
64 | ck_aggr, | |
5bd61841 | 65 | ck_rvalue |
a79683d5 | 66 | }; |
5bd61841 MM |
67 | |
68 | /* The rank of the conversion. Order of the enumerals matters; better | |
69 | conversions should come earlier in the list. */ | |
70 | ||
a79683d5 | 71 | enum conversion_rank { |
5bd61841 MM |
72 | cr_identity, |
73 | cr_exact, | |
74 | cr_promotion, | |
75 | cr_std, | |
76 | cr_pbool, | |
77 | cr_user, | |
78 | cr_ellipsis, | |
79 | cr_bad | |
a79683d5 | 80 | }; |
5bd61841 MM |
81 | |
82 | /* An implicit conversion sequence, in the sense of [over.best.ics]. | |
83 | The first conversion to be performed is at the end of the chain. | |
c72a1a86 | 84 | That conversion is always a cr_identity conversion. */ |
5bd61841 | 85 | |
5bd61841 MM |
86 | struct conversion { |
87 | /* The kind of conversion represented by this step. */ | |
88 | conversion_kind kind; | |
89 | /* The rank of this conversion. */ | |
90 | conversion_rank rank; | |
91 | BOOL_BITFIELD user_conv_p : 1; | |
92 | BOOL_BITFIELD ellipsis_p : 1; | |
93 | BOOL_BITFIELD this_p : 1; | |
feb6efc1 NF |
94 | /* True if this conversion would be permitted with a bending of |
95 | language standards, e.g. disregarding pointer qualifiers or | |
96 | converting integers to pointers. */ | |
5bd61841 MM |
97 | BOOL_BITFIELD bad_p : 1; |
98 | /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a | |
99 | temporary should be created to hold the result of the | |
100 | conversion. */ | |
101 | BOOL_BITFIELD need_temporary_p : 1; | |
08e17d9d | 102 | /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion |
c8094d83 | 103 | from a pointer-to-derived to pointer-to-base is being performed. */ |
33c25e5c | 104 | BOOL_BITFIELD base_p : 1; |
8af2fec4 RY |
105 | /* If KIND is ck_ref_bind, true when either an lvalue reference is |
106 | being bound to an lvalue expression or an rvalue reference is | |
f8f12278 JM |
107 | being bound to an rvalue expression. If KIND is ck_rvalue, |
108 | true when we should treat an lvalue as an rvalue (12.8p33). If | |
109 | KIND is ck_base, always false. */ | |
8af2fec4 | 110 | BOOL_BITFIELD rvaluedness_matches_p: 1; |
09357846 | 111 | BOOL_BITFIELD check_narrowing: 1; |
5bd61841 MM |
112 | /* The type of the expression resulting from the conversion. */ |
113 | tree type; | |
114 | union { | |
115 | /* The next conversion in the chain. Since the conversions are | |
116 | arranged from outermost to innermost, the NEXT conversion will | |
117 | actually be performed before this conversion. This variant is | |
3c72114c DS |
118 | used only when KIND is neither ck_identity, ck_ambig nor |
119 | ck_list. Please use the next_conversion function instead | |
120 | of using this field directly. */ | |
5bd61841 MM |
121 | conversion *next; |
122 | /* The expression at the beginning of the conversion chain. This | |
123 | variant is used only if KIND is ck_identity or ck_ambig. */ | |
124 | tree expr; | |
3c72114c DS |
125 | /* The array of conversions for an initializer_list, so this |
126 | variant is used only when KIN D is ck_list. */ | |
09357846 | 127 | conversion **list; |
5bd61841 MM |
128 | } u; |
129 | /* The function candidate corresponding to this conversion | |
130 | sequence. This field is only used if KIND is ck_user. */ | |
131 | struct z_candidate *cand; | |
132 | }; | |
133 | ||
134 | #define CONVERSION_RANK(NODE) \ | |
135 | ((NODE)->bad_p ? cr_bad \ | |
136 | : (NODE)->ellipsis_p ? cr_ellipsis \ | |
137 | : (NODE)->user_conv_p ? cr_user \ | |
138 | : (NODE)->rank) | |
139 | ||
cef62ad4 JM |
140 | #define BAD_CONVERSION_RANK(NODE) \ |
141 | ((NODE)->ellipsis_p ? cr_ellipsis \ | |
142 | : (NODE)->user_conv_p ? cr_user \ | |
143 | : (NODE)->rank) | |
144 | ||
5bd61841 MM |
145 | static struct obstack conversion_obstack; |
146 | static bool conversion_obstack_initialized; | |
feb6efc1 | 147 | struct rejection_reason; |
5bd61841 | 148 | |
b40e334f | 149 | static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t); |
94be8403 | 150 | static int equal_functions (tree, tree); |
b40e334f PC |
151 | static int joust (struct z_candidate *, struct z_candidate *, bool, |
152 | tsubst_flags_t); | |
5bd61841 | 153 | static int compare_ics (conversion *, conversion *); |
5ade1ed2 | 154 | static tree build_over_call (struct z_candidate *, int, tsubst_flags_t); |
94be8403 | 155 | static tree build_java_interface_fn_ref (tree, tree); |
5ade1ed2 | 156 | #define convert_like(CONV, EXPR, COMPLAIN) \ |
33c25e5c MM |
157 | convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \ |
158 | /*issue_conversion_warnings=*/true, \ | |
5ade1ed2 DG |
159 | /*c_cast_p=*/false, (COMPLAIN)) |
160 | #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \ | |
161 | convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \ | |
162 | /*issue_conversion_warnings=*/true, \ | |
163 | /*c_cast_p=*/false, (COMPLAIN)) | |
33c25e5c | 164 | static tree convert_like_real (conversion *, tree, tree, int, int, bool, |
5ade1ed2 | 165 | bool, tsubst_flags_t); |
4fe977f2 PC |
166 | static void op_error (location_t, enum tree_code, enum tree_code, tree, |
167 | tree, tree, bool); | |
b40e334f PC |
168 | static struct z_candidate *build_user_type_conversion_1 (tree, tree, int, |
169 | tsubst_flags_t); | |
498ad15e | 170 | static void print_z_candidate (location_t, const char *, struct z_candidate *); |
feb6efc1 | 171 | static void print_z_candidates (location_t, struct z_candidate *); |
94be8403 | 172 | static tree build_this (tree); |
436f8a4c | 173 | static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *); |
94be8403 GDR |
174 | static bool any_strictly_viable (struct z_candidate *); |
175 | static struct z_candidate *add_template_candidate | |
9771b263 | 176 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
b40e334f | 177 | tree, tree, tree, int, unification_kind_t, tsubst_flags_t); |
94be8403 | 178 | static struct z_candidate *add_template_candidate_real |
9771b263 | 179 | (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *, |
b40e334f | 180 | tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t); |
c8094d83 | 181 | static struct z_candidate *add_template_conv_candidate |
9771b263 DN |
182 | (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, |
183 | tree, tree, tree, tsubst_flags_t); | |
7993382e MM |
184 | static void add_builtin_candidates |
185 | (struct z_candidate **, enum tree_code, enum tree_code, | |
b40e334f | 186 | tree, tree *, int, tsubst_flags_t); |
7993382e MM |
187 | static void add_builtin_candidate |
188 | (struct z_candidate **, enum tree_code, enum tree_code, | |
b40e334f | 189 | tree, tree, tree, tree *, tree *, int, tsubst_flags_t); |
94be8403 | 190 | static bool is_complete (tree); |
c8094d83 | 191 | static void build_builtin_candidate |
7993382e | 192 | (struct z_candidate **, tree, tree, tree, tree *, tree *, |
b40e334f | 193 | int, tsubst_flags_t); |
c8094d83 | 194 | static struct z_candidate *add_conv_candidate |
9771b263 | 195 | (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree, |
b40e334f | 196 | tree, tsubst_flags_t); |
c8094d83 | 197 | static struct z_candidate *add_function_candidate |
9771b263 | 198 | (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree, |
b40e334f PC |
199 | tree, int, tsubst_flags_t); |
200 | static conversion *implicit_conversion (tree, tree, tree, bool, int, | |
201 | tsubst_flags_t); | |
34b5375f | 202 | static conversion *standard_conversion (tree, tree, tree, bool, int); |
b40e334f PC |
203 | static conversion *reference_binding (tree, tree, tree, bool, int, |
204 | tsubst_flags_t); | |
5bd61841 | 205 | static conversion *build_conv (conversion_kind, tree, conversion *); |
b40e334f | 206 | static conversion *build_list_conv (tree, tree, int, tsubst_flags_t); |
3c72114c | 207 | static conversion *next_conversion (conversion *); |
5bd61841 | 208 | static bool is_subseq (conversion *, conversion *); |
8af2fec4 | 209 | static conversion *maybe_handle_ref_bind (conversion **); |
5bd61841 | 210 | static void maybe_handle_implicit_object (conversion **); |
c8094d83 | 211 | static struct z_candidate *add_candidate |
9771b263 | 212 | (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t, |
4561285b | 213 | conversion **, tree, tree, int, struct rejection_reason *, int); |
5bd61841 | 214 | static tree source_type (conversion *); |
94be8403 | 215 | static void add_warning (struct z_candidate *, struct z_candidate *); |
94be8403 | 216 | static bool reference_compatible_p (tree, tree); |
5bd61841 | 217 | static conversion *direct_reference_binding (tree, conversion *); |
94be8403 | 218 | static bool promoted_arithmetic_type_p (tree); |
b40e334f | 219 | static conversion *conditional_conversion (tree, tree, tsubst_flags_t); |
a723baf1 | 220 | static char *name_as_c_string (tree, tree, bool *); |
14d22dd6 | 221 | static tree prep_operand (tree); |
9771b263 DN |
222 | static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree, |
223 | bool, tree, tree, int, struct z_candidate **, | |
b40e334f | 224 | tsubst_flags_t); |
5bd61841 | 225 | static conversion *merge_conversion_sequences (conversion *, conversion *); |
248ce2f8 | 226 | static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t); |
49c249e1 | 227 | |
1b3d28a8 VR |
228 | /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE. |
229 | NAME can take many forms... */ | |
1c2c08a5 | 230 | |
94be8403 GDR |
231 | bool |
232 | check_dtor_name (tree basetype, tree name) | |
1c2c08a5 | 233 | { |
ee996e9e | 234 | /* Just accept something we've already complained about. */ |
f3400fe2 | 235 | if (name == error_mark_node) |
94be8403 | 236 | return true; |
f3400fe2 | 237 | |
1c2c08a5 JM |
238 | if (TREE_CODE (name) == TYPE_DECL) |
239 | name = TREE_TYPE (name); | |
2f939d94 | 240 | else if (TYPE_P (name)) |
1c2c08a5 | 241 | /* OK */; |
9dc6f476 | 242 | else if (identifier_p (name)) |
1c2c08a5 | 243 | { |
9e1e64ec PC |
244 | if ((MAYBE_CLASS_TYPE_P (basetype) |
245 | && name == constructor_name (basetype)) | |
26877584 JM |
246 | || (TREE_CODE (basetype) == ENUMERAL_TYPE |
247 | && name == TYPE_IDENTIFIER (basetype))) | |
1b3d28a8 | 248 | return true; |
1c2c08a5 JM |
249 | else |
250 | name = get_type_value (name); | |
251 | } | |
252 | else | |
8dc2b103 NS |
253 | { |
254 | /* In the case of: | |
c8094d83 | 255 | |
0cbd7506 MS |
256 | template <class T> struct S { ~S(); }; |
257 | int i; | |
258 | i.~S(); | |
c8094d83 | 259 | |
0cbd7506 | 260 | NAME will be a class template. */ |
8dc2b103 NS |
261 | gcc_assert (DECL_CLASS_TEMPLATE_P (name)); |
262 | return false; | |
263 | } | |
1c2c08a5 | 264 | |
b792a33c | 265 | if (!name || name == error_mark_node) |
1b3d28a8 VR |
266 | return false; |
267 | return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name)); | |
1c2c08a5 JM |
268 | } |
269 | ||
277294d7 JM |
270 | /* We want the address of a function or method. We avoid creating a |
271 | pointer-to-member function. */ | |
272 | ||
273 | tree | |
89fcabaf | 274 | build_addr_func (tree function, tsubst_flags_t complain) |
277294d7 JM |
275 | { |
276 | tree type = TREE_TYPE (function); | |
878cd289 | 277 | |
277294d7 JM |
278 | /* We have to do these by hand to avoid real pointer to member |
279 | functions. */ | |
280 | if (TREE_CODE (type) == METHOD_TYPE) | |
8d08fdba | 281 | { |
d6b4ea85 MM |
282 | if (TREE_CODE (function) == OFFSET_REF) |
283 | { | |
284 | tree object = build_address (TREE_OPERAND (function, 0)); | |
285 | return get_member_function_from_ptrfunc (&object, | |
89fcabaf PC |
286 | TREE_OPERAND (function, 1), |
287 | complain); | |
d6b4ea85 MM |
288 | } |
289 | function = build_address (function); | |
277294d7 JM |
290 | } |
291 | else | |
1807ffc1 | 292 | function = decay_conversion (function, complain, /*reject_builtin=*/false); |
8d08fdba | 293 | |
277294d7 JM |
294 | return function; |
295 | } | |
8d08fdba | 296 | |
277294d7 JM |
297 | /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or |
298 | POINTER_TYPE to those. Note, pointer to member function types | |
94a0dd7b SL |
299 | (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are |
300 | two variants. build_call_a is the primitive taking an array of | |
301 | arguments, while build_call_n is a wrapper that handles varargs. */ | |
8d08fdba MS |
302 | |
303 | tree | |
94a0dd7b SL |
304 | build_call_n (tree function, int n, ...) |
305 | { | |
306 | if (n == 0) | |
307 | return build_call_a (function, 0, NULL); | |
308 | else | |
309 | { | |
86b8fed1 | 310 | tree *argarray = XALLOCAVEC (tree, n); |
94a0dd7b SL |
311 | va_list ap; |
312 | int i; | |
313 | ||
314 | va_start (ap, n); | |
315 | for (i = 0; i < n; i++) | |
316 | argarray[i] = va_arg (ap, tree); | |
317 | va_end (ap); | |
318 | return build_call_a (function, n, argarray); | |
319 | } | |
320 | } | |
321 | ||
5507a6c3 JM |
322 | /* Update various flags in cfun and the call itself based on what is being |
323 | called. Split out of build_call_a so that bot_manip can use it too. */ | |
324 | ||
325 | void | |
326 | set_flags_from_callee (tree call) | |
327 | { | |
35228ac7 | 328 | bool nothrow; |
5507a6c3 JM |
329 | tree decl = get_callee_fndecl (call); |
330 | ||
331 | /* We check both the decl and the type; a function may be known not to | |
332 | throw without being declared throw(). */ | |
35228ac7 JJ |
333 | nothrow = decl && TREE_NOTHROW (decl); |
334 | if (CALL_EXPR_FN (call)) | |
335 | nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call)))); | |
336 | else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW) | |
337 | nothrow = true; | |
5507a6c3 JM |
338 | |
339 | if (!nothrow && at_function_scope_p () && cfun && cp_function_chain) | |
340 | cp_function_chain->can_throw = 1; | |
341 | ||
342 | if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain) | |
343 | current_function_returns_abnormally = 1; | |
344 | ||
345 | TREE_NOTHROW (call) = nothrow; | |
346 | } | |
347 | ||
94a0dd7b SL |
348 | tree |
349 | build_call_a (tree function, int n, tree *argarray) | |
8d08fdba | 350 | { |
7c76b292 | 351 | tree decl; |
0c11ada6 | 352 | tree result_type; |
5aa3396c | 353 | tree fntype; |
94a0dd7b | 354 | int i; |
8d08fdba | 355 | |
89fcabaf | 356 | function = build_addr_func (function, tf_warning_or_error); |
8d08fdba | 357 | |
d4f0f205 | 358 | gcc_assert (TYPE_PTR_P (TREE_TYPE (function))); |
5aa3396c | 359 | fntype = TREE_TYPE (TREE_TYPE (function)); |
d4f0f205 MM |
360 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE |
361 | || TREE_CODE (fntype) == METHOD_TYPE); | |
5aa3396c | 362 | result_type = TREE_TYPE (fntype); |
a638b034 JM |
363 | /* An rvalue has no cv-qualifiers. */ |
364 | if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type)) | |
365 | result_type = cv_unqualified (result_type); | |
0c11ada6 | 366 | |
5507a6c3 JM |
367 | function = build_call_array_loc (input_location, |
368 | result_type, function, n, argarray); | |
369 | set_flags_from_callee (function); | |
e23bd218 | 370 | |
5507a6c3 | 371 | decl = get_callee_fndecl (function); |
8288cc73 | 372 | |
5507a6c3 JM |
373 | if (decl && !TREE_USED (decl)) |
374 | { | |
375 | /* We invoke build_call directly for several library | |
376 | functions. These may have been declared normally if | |
377 | we're building libgcc, so we can't just check | |
378 | DECL_ARTIFICIAL. */ | |
379 | gcc_assert (DECL_ARTIFICIAL (decl) | |
380 | || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)), | |
381 | "__", 2)); | |
382 | mark_used (decl); | |
383 | } | |
efe49da0 | 384 | |
5aa3396c | 385 | require_complete_eh_spec_types (fntype, decl); |
e23bd218 | 386 | |
5507a6c3 | 387 | TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl)); |
8d08fdba | 388 | |
7c76b292 | 389 | /* Don't pass empty class objects by value. This is useful |
570221c2 JM |
390 | for tags in STL, which are used to control overload resolution. |
391 | We don't need to handle other cases of copying empty classes. */ | |
7c76b292 | 392 | if (! decl || ! DECL_BUILT_IN (decl)) |
94a0dd7b | 393 | for (i = 0; i < n; i++) |
5507a6c3 JM |
394 | { |
395 | tree arg = CALL_EXPR_ARG (function, i); | |
396 | if (is_empty_class (TREE_TYPE (arg)) | |
397 | && ! TREE_ADDRESSABLE (TREE_TYPE (arg))) | |
398 | { | |
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; | |
402 | } | |
403 | } | |
c8094d83 | 404 | |
277294d7 JM |
405 | return function; |
406 | } | |
8d08fdba | 407 | |
c73964b2 MS |
408 | /* New overloading code. */ |
409 | ||
a79683d5 | 410 | struct z_candidate; |
5bd61841 | 411 | |
5bd61841 MM |
412 | struct candidate_warning { |
413 | z_candidate *loser; | |
414 | candidate_warning *next; | |
415 | }; | |
416 | ||
feb6efc1 NF |
417 | /* Information for providing diagnostics about why overloading failed. */ |
418 | ||
419 | enum rejection_reason_code { | |
420 | rr_none, | |
421 | rr_arity, | |
b028af11 | 422 | rr_explicit_conversion, |
c8580138 | 423 | rr_template_conversion, |
feb6efc1 | 424 | rr_arg_conversion, |
3d2f6864 NF |
425 | rr_bad_arg_conversion, |
426 | rr_template_unification, | |
971e17ff AS |
427 | rr_invalid_copy, |
428 | rr_constraint_failure | |
feb6efc1 NF |
429 | }; |
430 | ||
431 | struct conversion_info { | |
432 | /* The index of the argument, 0-based. */ | |
433 | int n_arg; | |
89606913 JM |
434 | /* The actual argument or its type. */ |
435 | tree from; | |
436 | /* The type of the parameter. */ | |
feb6efc1 NF |
437 | tree to_type; |
438 | }; | |
439 | ||
440 | struct rejection_reason { | |
441 | enum rejection_reason_code code; | |
442 | union { | |
443 | /* Information about an arity mismatch. */ | |
444 | struct { | |
445 | /* The expected number of arguments. */ | |
446 | int expected; | |
447 | /* The actual number of arguments in the call. */ | |
448 | int actual; | |
449 | /* Whether the call was a varargs call. */ | |
450 | bool call_varargs_p; | |
451 | } arity; | |
452 | /* Information about an argument conversion mismatch. */ | |
453 | struct conversion_info conversion; | |
454 | /* Same, but for bad argument conversions. */ | |
455 | struct conversion_info bad_conversion; | |
3d2f6864 NF |
456 | /* Information about template unification failures. These are the |
457 | parameters passed to fn_type_unification. */ | |
458 | struct { | |
459 | tree tmpl; | |
460 | tree explicit_targs; | |
cd057e3a | 461 | int num_targs; |
3d2f6864 NF |
462 | const tree *args; |
463 | unsigned int nargs; | |
464 | tree return_type; | |
465 | unification_kind_t strict; | |
466 | int flags; | |
467 | } template_unification; | |
468 | /* Information about template instantiation failures. These are the | |
469 | parameters passed to instantiate_template. */ | |
470 | struct { | |
471 | tree tmpl; | |
472 | tree targs; | |
473 | } template_instantiation; | |
feb6efc1 NF |
474 | } u; |
475 | }; | |
476 | ||
5bd61841 | 477 | struct z_candidate { |
4ba126e4 MM |
478 | /* The FUNCTION_DECL that will be called if this candidate is |
479 | selected by overload resolution. */ | |
c73964b2 | 480 | tree fn; |
c166b898 ILT |
481 | /* If not NULL_TREE, the first argument to use when calling this |
482 | function. */ | |
483 | tree first_arg; | |
484 | /* The rest of the arguments to use when calling this function. If | |
485 | there are no further arguments this may be NULL or it may be an | |
486 | empty vector. */ | |
9771b263 | 487 | const vec<tree, va_gc> *args; |
3d938426 MM |
488 | /* The implicit conversion sequences for each of the arguments to |
489 | FN. */ | |
5bd61841 MM |
490 | conversion **convs; |
491 | /* The number of implicit conversion sequences. */ | |
492 | size_t num_convs; | |
3d938426 MM |
493 | /* If FN is a user-defined conversion, the standard conversion |
494 | sequence from the type returned by FN to the desired destination | |
495 | type. */ | |
5bd61841 | 496 | conversion *second_conv; |
feb6efc1 | 497 | struct rejection_reason *reason; |
4ba126e4 MM |
498 | /* If FN is a member function, the binfo indicating the path used to |
499 | qualify the name of FN at the call site. This path is used to | |
500 | determine whether or not FN is accessible if it is selected by | |
501 | overload resolution. The DECL_CONTEXT of FN will always be a | |
502 | (possibly improper) base of this binfo. */ | |
503 | tree access_path; | |
504 | /* If FN is a non-static member function, the binfo indicating the | |
505 | subobject to which the `this' pointer should be converted if FN | |
4bedcb19 | 506 | is selected by overload resolution. The type pointed to by |
4ba126e4 MM |
507 | the `this' pointer must correspond to the most derived class |
508 | indicated by the CONVERSION_PATH. */ | |
509 | tree conversion_path; | |
ea0ad329 | 510 | tree template_decl; |
f18ea1bf | 511 | tree explicit_targs; |
5bd61841 MM |
512 | candidate_warning *warnings; |
513 | z_candidate *next; | |
4561285b JM |
514 | int viable; |
515 | ||
516 | /* The flags active in add_candidate. */ | |
517 | int flags; | |
c73964b2 MS |
518 | }; |
519 | ||
c30b4add MM |
520 | /* Returns true iff T is a null pointer constant in the sense of |
521 | [conv.ptr]. */ | |
522 | ||
94be8403 GDR |
523 | bool |
524 | null_ptr_cst_p (tree t) | |
c73964b2 | 525 | { |
5916cfd0 PC |
526 | tree type = TREE_TYPE (t); |
527 | ||
a7a64a77 MM |
528 | /* [conv.ptr] |
529 | ||
530 | A null pointer constant is an integral constant expression | |
14c2101d JM |
531 | (_expr.const_) rvalue of integer type that evaluates to zero or |
532 | an rvalue of type std::nullptr_t. */ | |
5916cfd0 | 533 | if (NULLPTR_TYPE_P (type)) |
94be8403 | 534 | return true; |
5916cfd0 PC |
535 | |
536 | if (cxx_dialect >= cxx11) | |
41990f96 | 537 | { |
27bec7bf | 538 | /* Core issue 903 says only literal 0 is a null pointer constant. */ |
5916cfd0 PC |
539 | if (TREE_CODE (type) == INTEGER_TYPE |
540 | && TREE_CODE (t) == INTEGER_CST | |
541 | && integer_zerop (t) | |
542 | && !TREE_OVERFLOW (t)) | |
543 | return true; | |
544 | } | |
545 | else if (CP_INTEGRAL_TYPE_P (type)) | |
546 | { | |
547 | t = fold_non_dependent_expr (t); | |
5a6bdb0d | 548 | STRIP_NOPS (t); |
27bec7bf JM |
549 | if (integer_zerop (t) && !TREE_OVERFLOW (t)) |
550 | return true; | |
41990f96 | 551 | } |
5916cfd0 | 552 | |
94be8403 | 553 | return false; |
c73964b2 MS |
554 | } |
555 | ||
e90abaa0 JM |
556 | /* Returns true iff T is a null member pointer value (4.11). */ |
557 | ||
558 | bool | |
559 | null_member_pointer_value_p (tree t) | |
560 | { | |
561 | tree type = TREE_TYPE (t); | |
562 | if (!type) | |
563 | return false; | |
564 | else if (TYPE_PTRMEMFUNC_P (type)) | |
565 | return (TREE_CODE (t) == CONSTRUCTOR | |
566 | && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value)); | |
66b1156a | 567 | else if (TYPE_PTRDATAMEM_P (type)) |
e90abaa0 JM |
568 | return integer_all_onesp (t); |
569 | else | |
570 | return false; | |
571 | } | |
572 | ||
2602f8fe JM |
573 | /* Returns nonzero if PARMLIST consists of only default parms, |
574 | ellipsis, and/or undeduced parameter packs. */ | |
a11d04b5 | 575 | |
94be8403 | 576 | bool |
58f9752a | 577 | sufficient_parms_p (const_tree parmlist) |
a11d04b5 NS |
578 | { |
579 | for (; parmlist && parmlist != void_list_node; | |
580 | parmlist = TREE_CHAIN (parmlist)) | |
2602f8fe JM |
581 | if (!TREE_PURPOSE (parmlist) |
582 | && !PACK_EXPANSION_P (TREE_VALUE (parmlist))) | |
94be8403 GDR |
583 | return false; |
584 | return true; | |
a11d04b5 NS |
585 | } |
586 | ||
5bd61841 MM |
587 | /* Allocate N bytes of memory from the conversion obstack. The memory |
588 | is zeroed before being returned. */ | |
589 | ||
590 | static void * | |
591 | conversion_obstack_alloc (size_t n) | |
c73964b2 | 592 | { |
5bd61841 MM |
593 | void *p; |
594 | if (!conversion_obstack_initialized) | |
595 | { | |
596 | gcc_obstack_init (&conversion_obstack); | |
597 | conversion_obstack_initialized = true; | |
598 | } | |
599 | p = obstack_alloc (&conversion_obstack, n); | |
600 | memset (p, 0, n); | |
601 | return p; | |
602 | } | |
603 | ||
feb6efc1 NF |
604 | /* Allocate rejection reasons. */ |
605 | ||
606 | static struct rejection_reason * | |
607 | alloc_rejection (enum rejection_reason_code code) | |
608 | { | |
609 | struct rejection_reason *p; | |
610 | p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p); | |
611 | p->code = code; | |
612 | return p; | |
613 | } | |
614 | ||
615 | static struct rejection_reason * | |
616 | arity_rejection (tree first_arg, int expected, int actual) | |
617 | { | |
618 | struct rejection_reason *r = alloc_rejection (rr_arity); | |
619 | int adjust = first_arg != NULL_TREE; | |
620 | r->u.arity.expected = expected - adjust; | |
621 | r->u.arity.actual = actual - adjust; | |
622 | return r; | |
623 | } | |
624 | ||
625 | static struct rejection_reason * | |
626 | arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to) | |
627 | { | |
628 | struct rejection_reason *r = alloc_rejection (rr_arg_conversion); | |
629 | int adjust = first_arg != NULL_TREE; | |
630 | r->u.conversion.n_arg = n_arg - adjust; | |
89606913 | 631 | r->u.conversion.from = from; |
feb6efc1 NF |
632 | r->u.conversion.to_type = to; |
633 | return r; | |
634 | } | |
635 | ||
636 | static struct rejection_reason * | |
637 | bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to) | |
638 | { | |
639 | struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion); | |
640 | int adjust = first_arg != NULL_TREE; | |
641 | r->u.bad_conversion.n_arg = n_arg - adjust; | |
89606913 | 642 | r->u.bad_conversion.from = from; |
feb6efc1 NF |
643 | r->u.bad_conversion.to_type = to; |
644 | return r; | |
645 | } | |
646 | ||
b028af11 JM |
647 | static struct rejection_reason * |
648 | explicit_conversion_rejection (tree from, tree to) | |
649 | { | |
650 | struct rejection_reason *r = alloc_rejection (rr_explicit_conversion); | |
651 | r->u.conversion.n_arg = 0; | |
89606913 | 652 | r->u.conversion.from = from; |
b028af11 JM |
653 | r->u.conversion.to_type = to; |
654 | return r; | |
655 | } | |
656 | ||
c8580138 JM |
657 | static struct rejection_reason * |
658 | template_conversion_rejection (tree from, tree to) | |
659 | { | |
660 | struct rejection_reason *r = alloc_rejection (rr_template_conversion); | |
661 | r->u.conversion.n_arg = 0; | |
89606913 | 662 | r->u.conversion.from = from; |
c8580138 JM |
663 | r->u.conversion.to_type = to; |
664 | return r; | |
665 | } | |
666 | ||
3d2f6864 NF |
667 | static struct rejection_reason * |
668 | template_unification_rejection (tree tmpl, tree explicit_targs, tree targs, | |
669 | const tree *args, unsigned int nargs, | |
670 | tree return_type, unification_kind_t strict, | |
671 | int flags) | |
672 | { | |
673 | size_t args_n_bytes = sizeof (*args) * nargs; | |
674 | tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes); | |
675 | struct rejection_reason *r = alloc_rejection (rr_template_unification); | |
676 | r->u.template_unification.tmpl = tmpl; | |
677 | r->u.template_unification.explicit_targs = explicit_targs; | |
cd057e3a | 678 | r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs); |
3d2f6864 NF |
679 | /* Copy args to our own storage. */ |
680 | memcpy (args1, args, args_n_bytes); | |
681 | r->u.template_unification.args = args1; | |
682 | r->u.template_unification.nargs = nargs; | |
683 | r->u.template_unification.return_type = return_type; | |
684 | r->u.template_unification.strict = strict; | |
685 | r->u.template_unification.flags = flags; | |
686 | return r; | |
687 | } | |
688 | ||
689 | static struct rejection_reason * | |
690 | template_unification_error_rejection (void) | |
691 | { | |
692 | return alloc_rejection (rr_template_unification); | |
693 | } | |
694 | ||
3d2f6864 NF |
695 | static struct rejection_reason * |
696 | invalid_copy_with_fn_template_rejection (void) | |
697 | { | |
698 | struct rejection_reason *r = alloc_rejection (rr_invalid_copy); | |
699 | return r; | |
700 | } | |
701 | ||
971e17ff AS |
702 | // Build a constraint failure record, saving information into the |
703 | // template_instantiation field of the rejection. If FN is not a template | |
704 | // declaration, the TMPL member is the FN declaration and TARGS is empty. | |
705 | ||
706 | static struct rejection_reason * | |
707 | constraint_failure (tree fn) | |
708 | { | |
709 | struct rejection_reason *r = alloc_rejection (rr_constraint_failure); | |
710 | if (tree ti = DECL_TEMPLATE_INFO (fn)) | |
711 | { | |
712 | r->u.template_instantiation.tmpl = TI_TEMPLATE (ti); | |
713 | r->u.template_instantiation.targs = TI_ARGS (ti); | |
714 | } | |
715 | else | |
716 | { | |
717 | r->u.template_instantiation.tmpl = fn; | |
718 | r->u.template_instantiation.targs = NULL_TREE; | |
719 | } | |
720 | return r; | |
721 | } | |
722 | ||
5bd61841 MM |
723 | /* Dynamically allocate a conversion. */ |
724 | ||
725 | static conversion * | |
726 | alloc_conversion (conversion_kind kind) | |
727 | { | |
728 | conversion *c; | |
67f5655f | 729 | c = (conversion *) conversion_obstack_alloc (sizeof (conversion)); |
5bd61841 MM |
730 | c->kind = kind; |
731 | return c; | |
732 | } | |
733 | ||
734 | #ifdef ENABLE_CHECKING | |
735 | ||
736 | /* Make sure that all memory on the conversion obstack has been | |
737 | freed. */ | |
738 | ||
739 | void | |
740 | validate_conversion_obstack (void) | |
741 | { | |
742 | if (conversion_obstack_initialized) | |
c8094d83 | 743 | gcc_assert ((obstack_next_free (&conversion_obstack) |
50bc768d | 744 | == obstack_base (&conversion_obstack))); |
5bd61841 MM |
745 | } |
746 | ||
747 | #endif /* ENABLE_CHECKING */ | |
748 | ||
749 | /* Dynamically allocate an array of N conversions. */ | |
750 | ||
751 | static conversion ** | |
752 | alloc_conversions (size_t n) | |
753 | { | |
67f5655f | 754 | return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *)); |
5bd61841 MM |
755 | } |
756 | ||
757 | static conversion * | |
758 | build_conv (conversion_kind code, tree type, conversion *from) | |
759 | { | |
760 | conversion *t; | |
761 | conversion_rank rank = CONVERSION_RANK (from); | |
519c9806 | 762 | |
09357846 JM |
763 | /* Note that the caller is responsible for filling in t->cand for |
764 | user-defined conversions. */ | |
5bd61841 MM |
765 | t = alloc_conversion (code); |
766 | t->type = type; | |
767 | t->u.next = from; | |
519c9806 | 768 | |
c73964b2 MS |
769 | switch (code) |
770 | { | |
5bd61841 MM |
771 | case ck_ptr: |
772 | case ck_pmem: | |
773 | case ck_base: | |
774 | case ck_std: | |
775 | if (rank < cr_std) | |
776 | rank = cr_std; | |
c73964b2 MS |
777 | break; |
778 | ||
5bd61841 MM |
779 | case ck_qual: |
780 | if (rank < cr_exact) | |
781 | rank = cr_exact; | |
782 | break; | |
c73964b2 MS |
783 | |
784 | default: | |
785 | break; | |
786 | } | |
5bd61841 MM |
787 | t->rank = rank; |
788 | t->user_conv_p = (code == ck_user || from->user_conv_p); | |
789 | t->bad_p = from->bad_p; | |
33c25e5c | 790 | t->base_p = false; |
c73964b2 MS |
791 | return t; |
792 | } | |
793 | ||
09357846 JM |
794 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a |
795 | specialization of std::initializer_list<T>, if such a conversion is | |
796 | possible. */ | |
797 | ||
798 | static conversion * | |
b40e334f | 799 | build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
09357846 JM |
800 | { |
801 | tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0); | |
802 | unsigned len = CONSTRUCTOR_NELTS (ctor); | |
803 | conversion **subconvs = alloc_conversions (len); | |
804 | conversion *t; | |
805 | unsigned i; | |
806 | tree val; | |
807 | ||
e5901560 JM |
808 | /* Within a list-initialization we can have more user-defined |
809 | conversions. */ | |
810 | flags &= ~LOOKUP_NO_CONVERSION; | |
811 | /* But no narrowing conversions. */ | |
812 | flags |= LOOKUP_NO_NARROWING; | |
813 | ||
5806f771 JM |
814 | /* Can't make an array of these types. */ |
815 | if (TREE_CODE (elttype) == REFERENCE_TYPE | |
816 | || TREE_CODE (elttype) == FUNCTION_TYPE | |
817 | || VOID_TYPE_P (elttype)) | |
818 | return NULL; | |
819 | ||
09357846 JM |
820 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
821 | { | |
822 | conversion *sub | |
823 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 824 | false, flags, complain); |
09357846 JM |
825 | if (sub == NULL) |
826 | return NULL; | |
827 | ||
828 | subconvs[i] = sub; | |
829 | } | |
830 | ||
831 | t = alloc_conversion (ck_list); | |
832 | t->type = type; | |
833 | t->u.list = subconvs; | |
834 | t->rank = cr_exact; | |
835 | ||
836 | for (i = 0; i < len; ++i) | |
837 | { | |
838 | conversion *sub = subconvs[i]; | |
839 | if (sub->rank > t->rank) | |
840 | t->rank = sub->rank; | |
841 | if (sub->user_conv_p) | |
842 | t->user_conv_p = true; | |
843 | if (sub->bad_p) | |
844 | t->bad_p = true; | |
845 | } | |
846 | ||
847 | return t; | |
848 | } | |
849 | ||
3c72114c DS |
850 | /* Return the next conversion of the conversion chain (if applicable), |
851 | or NULL otherwise. Please use this function instead of directly | |
852 | accessing fields of struct conversion. */ | |
853 | ||
854 | static conversion * | |
855 | next_conversion (conversion *conv) | |
856 | { | |
857 | if (conv == NULL | |
858 | || conv->kind == ck_identity | |
859 | || conv->kind == ck_ambig | |
860 | || conv->kind == ck_list) | |
861 | return NULL; | |
862 | return conv->u.next; | |
863 | } | |
864 | ||
bc99421e JM |
865 | /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list, |
866 | is a valid aggregate initializer for array type ATYPE. */ | |
867 | ||
868 | static bool | |
b40e334f | 869 | can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain) |
bc99421e JM |
870 | { |
871 | unsigned i; | |
872 | tree elttype = TREE_TYPE (atype); | |
873 | for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i) | |
874 | { | |
875 | tree val = CONSTRUCTOR_ELT (ctor, i)->value; | |
876 | bool ok; | |
877 | if (TREE_CODE (elttype) == ARRAY_TYPE | |
878 | && TREE_CODE (val) == CONSTRUCTOR) | |
b40e334f | 879 | ok = can_convert_array (elttype, val, flags, complain); |
bc99421e | 880 | else |
b40e334f PC |
881 | ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags, |
882 | complain); | |
bc99421e JM |
883 | if (!ok) |
884 | return false; | |
885 | } | |
886 | return true; | |
887 | } | |
888 | ||
09357846 JM |
889 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an |
890 | aggregate class, if such a conversion is possible. */ | |
891 | ||
892 | static conversion * | |
b40e334f | 893 | build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
09357846 JM |
894 | { |
895 | unsigned HOST_WIDE_INT i = 0; | |
896 | conversion *c; | |
d4b5fb22 | 897 | tree field = next_initializable_field (TYPE_FIELDS (type)); |
4c9b3895 | 898 | tree empty_ctor = NULL_TREE; |
09357846 | 899 | |
9fa6ffe1 | 900 | /* We already called reshape_init in implicit_conversion. */ |
743af85b | 901 | |
a33ad58b JM |
902 | /* The conversions within the init-list aren't affected by the enclosing |
903 | context; they're always simple copy-initialization. */ | |
904 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; | |
408249b2 | 905 | |
910ad8de | 906 | for (; field; field = next_initializable_field (DECL_CHAIN (field))) |
09357846 | 907 | { |
bc99421e JM |
908 | tree ftype = TREE_TYPE (field); |
909 | tree val; | |
910 | bool ok; | |
911 | ||
09357846 | 912 | if (i < CONSTRUCTOR_NELTS (ctor)) |
bc99421e | 913 | val = CONSTRUCTOR_ELT (ctor, i)->value; |
1b87c991 JM |
914 | else if (TREE_CODE (ftype) == REFERENCE_TYPE) |
915 | /* Value-initialization of reference is ill-formed. */ | |
916 | return NULL; | |
4c9b3895 JM |
917 | else |
918 | { | |
919 | if (empty_ctor == NULL_TREE) | |
920 | empty_ctor = build_constructor (init_list_type_node, NULL); | |
bc99421e | 921 | val = empty_ctor; |
4c9b3895 | 922 | } |
bc99421e JM |
923 | ++i; |
924 | ||
925 | if (TREE_CODE (ftype) == ARRAY_TYPE | |
926 | && TREE_CODE (val) == CONSTRUCTOR) | |
b40e334f | 927 | ok = can_convert_array (ftype, val, flags, complain); |
bc99421e | 928 | else |
b40e334f PC |
929 | ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags, |
930 | complain); | |
bc99421e JM |
931 | |
932 | if (!ok) | |
933 | return NULL; | |
934 | ||
935 | if (TREE_CODE (type) == UNION_TYPE) | |
936 | break; | |
09357846 JM |
937 | } |
938 | ||
d4b5fb22 JM |
939 | if (i < CONSTRUCTOR_NELTS (ctor)) |
940 | return NULL; | |
941 | ||
09357846 JM |
942 | c = alloc_conversion (ck_aggr); |
943 | c->type = type; | |
944 | c->rank = cr_exact; | |
945 | c->user_conv_p = true; | |
408249b2 | 946 | c->check_narrowing = true; |
09357846 JM |
947 | c->u.next = NULL; |
948 | return c; | |
949 | } | |
950 | ||
dd35aac7 JM |
951 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an |
952 | array type, if such a conversion is possible. */ | |
953 | ||
954 | static conversion * | |
b40e334f | 955 | build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain) |
dd35aac7 JM |
956 | { |
957 | conversion *c; | |
958 | unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor); | |
959 | tree elttype = TREE_TYPE (type); | |
960 | unsigned i; | |
961 | tree val; | |
962 | bool bad = false; | |
963 | bool user = false; | |
964 | enum conversion_rank rank = cr_exact; | |
965 | ||
24991604 JM |
966 | /* We might need to propagate the size from the element to the array. */ |
967 | complete_type (type); | |
968 | ||
cd3ef6f7 JM |
969 | if (TYPE_DOMAIN (type) |
970 | && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE)) | |
dd35aac7 | 971 | { |
ae7e9ddd | 972 | unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type)); |
dd35aac7 JM |
973 | if (alen < len) |
974 | return NULL; | |
975 | } | |
976 | ||
a33ad58b JM |
977 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
978 | ||
dd35aac7 JM |
979 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
980 | { | |
981 | conversion *sub | |
982 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 983 | false, flags, complain); |
dd35aac7 JM |
984 | if (sub == NULL) |
985 | return NULL; | |
986 | ||
987 | if (sub->rank > rank) | |
988 | rank = sub->rank; | |
989 | if (sub->user_conv_p) | |
990 | user = true; | |
991 | if (sub->bad_p) | |
992 | bad = true; | |
993 | } | |
994 | ||
995 | c = alloc_conversion (ck_aggr); | |
996 | c->type = type; | |
997 | c->rank = rank; | |
998 | c->user_conv_p = user; | |
999 | c->bad_p = bad; | |
1000 | c->u.next = NULL; | |
1001 | return c; | |
1002 | } | |
1003 | ||
77a30e9a JM |
1004 | /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a |
1005 | complex type, if such a conversion is possible. */ | |
1006 | ||
1007 | static conversion * | |
b40e334f PC |
1008 | build_complex_conv (tree type, tree ctor, int flags, |
1009 | tsubst_flags_t complain) | |
77a30e9a JM |
1010 | { |
1011 | conversion *c; | |
1012 | unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor); | |
1013 | tree elttype = TREE_TYPE (type); | |
1014 | unsigned i; | |
1015 | tree val; | |
1016 | bool bad = false; | |
1017 | bool user = false; | |
1018 | enum conversion_rank rank = cr_exact; | |
1019 | ||
1020 | if (len != 2) | |
1021 | return NULL; | |
1022 | ||
a33ad58b JM |
1023 | flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING; |
1024 | ||
77a30e9a JM |
1025 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val) |
1026 | { | |
1027 | conversion *sub | |
1028 | = implicit_conversion (elttype, TREE_TYPE (val), val, | |
b40e334f | 1029 | false, flags, complain); |
77a30e9a JM |
1030 | if (sub == NULL) |
1031 | return NULL; | |
1032 | ||
1033 | if (sub->rank > rank) | |
1034 | rank = sub->rank; | |
1035 | if (sub->user_conv_p) | |
1036 | user = true; | |
1037 | if (sub->bad_p) | |
1038 | bad = true; | |
1039 | } | |
1040 | ||
1041 | c = alloc_conversion (ck_aggr); | |
1042 | c->type = type; | |
1043 | c->rank = rank; | |
1044 | c->user_conv_p = user; | |
1045 | c->bad_p = bad; | |
1046 | c->u.next = NULL; | |
1047 | return c; | |
1048 | } | |
1049 | ||
5bd61841 | 1050 | /* Build a representation of the identity conversion from EXPR to |
78dcd41a | 1051 | itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */ |
5bd61841 MM |
1052 | |
1053 | static conversion * | |
1054 | build_identity_conv (tree type, tree expr) | |
1055 | { | |
1056 | conversion *c; | |
c8094d83 | 1057 | |
5bd61841 MM |
1058 | c = alloc_conversion (ck_identity); |
1059 | c->type = type; | |
1060 | c->u.expr = expr; | |
1061 | ||
1062 | return c; | |
1063 | } | |
1064 | ||
1065 | /* Converting from EXPR to TYPE was ambiguous in the sense that there | |
1066 | were multiple user-defined conversions to accomplish the job. | |
1067 | Build a conversion that indicates that ambiguity. */ | |
1068 | ||
1069 | static conversion * | |
1070 | build_ambiguous_conv (tree type, tree expr) | |
1071 | { | |
1072 | conversion *c; | |
1073 | ||
1074 | c = alloc_conversion (ck_ambig); | |
1075 | c->type = type; | |
1076 | c->u.expr = expr; | |
1077 | ||
1078 | return c; | |
1079 | } | |
1080 | ||
a7a64a77 | 1081 | tree |
94be8403 | 1082 | strip_top_quals (tree t) |
de22184b MS |
1083 | { |
1084 | if (TREE_CODE (t) == ARRAY_TYPE) | |
1085 | return t; | |
7d149679 | 1086 | return cp_build_qualified_type (t, 0); |
de22184b MS |
1087 | } |
1088 | ||
c73964b2 MS |
1089 | /* Returns the standard conversion path (see [conv]) from type FROM to type |
1090 | TO, if any. For proper handling of null pointer constants, you must | |
34b5375f MM |
1091 | also pass the expression EXPR to convert from. If C_CAST_P is true, |
1092 | this conversion is coming from a C-style cast. */ | |
c73964b2 | 1093 | |
5bd61841 | 1094 | static conversion * |
34b5375f MM |
1095 | standard_conversion (tree to, tree from, tree expr, bool c_cast_p, |
1096 | int flags) | |
c73964b2 MS |
1097 | { |
1098 | enum tree_code fcode, tcode; | |
5bd61841 | 1099 | conversion *conv; |
94be8403 | 1100 | bool fromref = false; |
8d4bcc35 | 1101 | tree qualified_to; |
de22184b | 1102 | |
ee76b931 | 1103 | to = non_reference (to); |
de22184b MS |
1104 | if (TREE_CODE (from) == REFERENCE_TYPE) |
1105 | { | |
94be8403 | 1106 | fromref = true; |
de22184b MS |
1107 | from = TREE_TYPE (from); |
1108 | } | |
8d4bcc35 | 1109 | qualified_to = to; |
de22184b MS |
1110 | to = strip_top_quals (to); |
1111 | from = strip_top_quals (from); | |
c73964b2 | 1112 | |
835dee55 | 1113 | if (expr && type_unknown_p (expr)) |
e6e174e5 | 1114 | { |
835dee55 PC |
1115 | if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to)) |
1116 | { | |
1117 | tsubst_flags_t tflags = tf_conv; | |
1118 | expr = instantiate_type (to, expr, tflags); | |
1119 | if (expr == error_mark_node) | |
1120 | return NULL; | |
1121 | from = TREE_TYPE (expr); | |
1122 | } | |
1123 | else if (TREE_CODE (to) == BOOLEAN_TYPE) | |
1124 | { | |
1125 | /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */ | |
1126 | expr = resolve_nondeduced_context (expr); | |
1127 | from = TREE_TYPE (expr); | |
1128 | } | |
e6e174e5 JM |
1129 | } |
1130 | ||
c73964b2 MS |
1131 | fcode = TREE_CODE (from); |
1132 | tcode = TREE_CODE (to); | |
1133 | ||
5bd61841 | 1134 | conv = build_identity_conv (from, expr); |
725d6b87 | 1135 | if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE) |
c73964b2 | 1136 | { |
725d6b87 | 1137 | from = type_decays_to (from); |
c73964b2 | 1138 | fcode = TREE_CODE (from); |
5bd61841 | 1139 | conv = build_conv (ck_lvalue, from, conv); |
c73964b2 | 1140 | } |
583ca5a0 | 1141 | else if (fromref || (expr && lvalue_p (expr))) |
38a4afee MM |
1142 | { |
1143 | if (expr) | |
1144 | { | |
1145 | tree bitfield_type; | |
1146 | bitfield_type = is_bitfield_expr_with_lowered_type (expr); | |
1147 | if (bitfield_type) | |
725d6b87 MM |
1148 | { |
1149 | from = strip_top_quals (bitfield_type); | |
1150 | fcode = TREE_CODE (from); | |
1151 | } | |
38a4afee MM |
1152 | } |
1153 | conv = build_conv (ck_rvalue, from, conv); | |
f8f12278 JM |
1154 | if (flags & LOOKUP_PREFER_RVALUE) |
1155 | conv->rvaluedness_matches_p = true; | |
38a4afee | 1156 | } |
de22184b | 1157 | |
04c06002 | 1158 | /* Allow conversion between `__complex__' data types. */ |
a04678ca GDR |
1159 | if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE) |
1160 | { | |
1161 | /* The standard conversion sequence to convert FROM to TO is | |
0cbd7506 MS |
1162 | the standard conversion sequence to perform componentwise |
1163 | conversion. */ | |
5bd61841 | 1164 | conversion *part_conv = standard_conversion |
34b5375f | 1165 | (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags); |
c8094d83 | 1166 | |
a04678ca | 1167 | if (part_conv) |
0cbd7506 | 1168 | { |
5bd61841 MM |
1169 | conv = build_conv (part_conv->kind, to, conv); |
1170 | conv->rank = part_conv->rank; | |
0cbd7506 | 1171 | } |
a04678ca | 1172 | else |
0cbd7506 | 1173 | conv = NULL; |
a04678ca GDR |
1174 | |
1175 | return conv; | |
1176 | } | |
1177 | ||
a7a64a77 | 1178 | if (same_type_p (from, to)) |
8d4bcc35 JM |
1179 | { |
1180 | if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue) | |
1181 | conv->type = qualified_to; | |
1182 | return conv; | |
1183 | } | |
c73964b2 | 1184 | |
14c2101d JM |
1185 | /* [conv.ptr] |
1186 | A null pointer constant can be converted to a pointer type; ... A | |
1187 | null pointer constant of integral type can be converted to an | |
1188 | rvalue of type std::nullptr_t. */ | |
66b1156a | 1189 | if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to) |
5116acc6 | 1190 | || NULLPTR_TYPE_P (to)) |
2ad2e0af PC |
1191 | && ((expr && null_ptr_cst_p (expr)) |
1192 | || NULLPTR_TYPE_P (from))) | |
5bd61841 | 1193 | conv = build_conv (ck_std, to, conv); |
72a08131 JM |
1194 | else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE) |
1195 | || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE)) | |
1196 | { | |
1197 | /* For backwards brain damage compatibility, allow interconversion of | |
1198 | pointers and integers with a pedwarn. */ | |
5bd61841 MM |
1199 | conv = build_conv (ck_std, to, conv); |
1200 | conv->bad_p = true; | |
72a08131 | 1201 | } |
adf2edec | 1202 | else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE) |
8a2b77e7 JM |
1203 | { |
1204 | /* For backwards brain damage compatibility, allow interconversion of | |
1205 | enums and integers with a pedwarn. */ | |
5bd61841 MM |
1206 | conv = build_conv (ck_std, to, conv); |
1207 | conv->bad_p = true; | |
8a2b77e7 | 1208 | } |
a5ac359a | 1209 | else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE) |
66b1156a | 1210 | || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from))) |
c73964b2 | 1211 | { |
a5ac359a MM |
1212 | tree to_pointee; |
1213 | tree from_pointee; | |
c73964b2 | 1214 | |
a5ac359a MM |
1215 | if (tcode == POINTER_TYPE |
1216 | && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from), | |
1217 | TREE_TYPE (to))) | |
4d50dd69 | 1218 | ; |
a5ac359a | 1219 | else if (VOID_TYPE_P (TREE_TYPE (to)) |
66b1156a | 1220 | && !TYPE_PTRDATAMEM_P (from) |
a5ac359a | 1221 | && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE) |
c73964b2 | 1222 | { |
e426b47b | 1223 | tree nfrom = TREE_TYPE (from); |
c663bc6a JM |
1224 | /* Don't try to apply restrict to void. */ |
1225 | int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT; | |
c73964b2 | 1226 | from = build_pointer_type |
c663bc6a | 1227 | (cp_build_qualified_type (void_type_node, quals)); |
5bd61841 | 1228 | conv = build_conv (ck_ptr, from, conv); |
c73964b2 | 1229 | } |
66b1156a | 1230 | else if (TYPE_PTRDATAMEM_P (from)) |
c73964b2 | 1231 | { |
a5ac359a MM |
1232 | tree fbase = TYPE_PTRMEM_CLASS_TYPE (from); |
1233 | tree tbase = TYPE_PTRMEM_CLASS_TYPE (to); | |
c73964b2 | 1234 | |
999cc24c | 1235 | if (DERIVED_FROM_P (fbase, tbase) |
9edc3913 | 1236 | && (same_type_ignoring_top_level_qualifiers_p |
a5ac359a MM |
1237 | (TYPE_PTRMEM_POINTED_TO_TYPE (from), |
1238 | TYPE_PTRMEM_POINTED_TO_TYPE (to)))) | |
c73964b2 | 1239 | { |
c8094d83 | 1240 | from = build_ptrmem_type (tbase, |
a5ac359a | 1241 | TYPE_PTRMEM_POINTED_TO_TYPE (from)); |
5bd61841 | 1242 | conv = build_conv (ck_pmem, from, conv); |
c73964b2 | 1243 | } |
539599c1 MM |
1244 | else if (!same_type_p (fbase, tbase)) |
1245 | return NULL; | |
c73964b2 | 1246 | } |
3f50c846 JM |
1247 | else if (CLASS_TYPE_P (TREE_TYPE (from)) |
1248 | && CLASS_TYPE_P (TREE_TYPE (to)) | |
385bce06 | 1249 | /* [conv.ptr] |
c8094d83 | 1250 | |
0cbd7506 | 1251 | An rvalue of type "pointer to cv D," where D is a |
385bce06 MM |
1252 | class type, can be converted to an rvalue of type |
1253 | "pointer to cv B," where B is a base class (clause | |
1254 | _class.derived_) of D. If B is an inaccessible | |
1255 | (clause _class.access_) or ambiguous | |
1256 | (_class.member.lookup_) base class of D, a program | |
18e4be85 | 1257 | that necessitates this conversion is ill-formed. |
0cbd7506 MS |
1258 | Therefore, we use DERIVED_FROM_P, and do not check |
1259 | access or uniqueness. */ | |
d79ca207 | 1260 | && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from))) |
c73964b2 | 1261 | { |
c8094d83 | 1262 | from = |
385bce06 MM |
1263 | cp_build_qualified_type (TREE_TYPE (to), |
1264 | cp_type_quals (TREE_TYPE (from))); | |
1265 | from = build_pointer_type (from); | |
5bd61841 | 1266 | conv = build_conv (ck_ptr, from, conv); |
33c25e5c | 1267 | conv->base_p = true; |
c73964b2 | 1268 | } |
b8fd7909 JM |
1269 | else if (tx_safe_fn_type_p (TREE_TYPE (from))) |
1270 | { | |
1271 | /* A prvalue of type "pointer to transaction_safe function" can be | |
1272 | converted to a prvalue of type "pointer to function". */ | |
1273 | tree unsafe = tx_unsafe_fn_variant (TREE_TYPE (from)); | |
1274 | if (same_type_p (unsafe, TREE_TYPE (to))) | |
1275 | { | |
1276 | from = build_pointer_type (unsafe); | |
1277 | conv = build_conv (ck_tsafe, from, conv); | |
1278 | } | |
1279 | } | |
c73964b2 | 1280 | |
a5ac359a MM |
1281 | if (tcode == POINTER_TYPE) |
1282 | { | |
1283 | to_pointee = TREE_TYPE (to); | |
1284 | from_pointee = TREE_TYPE (from); | |
1285 | } | |
1286 | else | |
1287 | { | |
b7a78333 MM |
1288 | to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to); |
1289 | from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from); | |
a5ac359a MM |
1290 | } |
1291 | ||
3bfdc719 | 1292 | if (same_type_p (from, to)) |
798eed5e | 1293 | /* OK */; |
34b5375f MM |
1294 | else if (c_cast_p && comp_ptr_ttypes_const (to, from)) |
1295 | /* In a C-style cast, we ignore CV-qualification because we | |
1296 | are allowed to perform a static_cast followed by a | |
1297 | const_cast. */ | |
1298 | conv = build_conv (ck_qual, to, conv); | |
1299 | else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee)) | |
5bd61841 | 1300 | conv = build_conv (ck_qual, to, conv); |
d9cf7c82 JM |
1301 | else if (expr && string_conv_p (to, expr, 0)) |
1302 | /* converting from string constant to char *. */ | |
5bd61841 | 1303 | conv = build_conv (ck_qual, to, conv); |
b581b85b NP |
1304 | /* Allow conversions among compatible ObjC pointer types (base |
1305 | conversions have been already handled above). */ | |
1306 | else if (c_dialect_objc () | |
1307 | && objc_compare_types (to, from, -4, NULL_TREE)) | |
1308 | conv = build_conv (ck_ptr, to, conv); | |
a5ac359a | 1309 | else if (ptr_reasonably_similar (to_pointee, from_pointee)) |
c73964b2 | 1310 | { |
5bd61841 MM |
1311 | conv = build_conv (ck_ptr, to, conv); |
1312 | conv->bad_p = true; | |
c73964b2 | 1313 | } |
d11ad92e | 1314 | else |
5bd61841 | 1315 | return NULL; |
d11ad92e MS |
1316 | |
1317 | from = to; | |
c73964b2 MS |
1318 | } |
1319 | else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from)) | |
1320 | { | |
1321 | tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from)); | |
1322 | tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to)); | |
7e1352fe NF |
1323 | tree fbase = class_of_this_parm (fromfn); |
1324 | tree tbase = class_of_this_parm (tofn); | |
c73964b2 | 1325 | |
999cc24c | 1326 | if (!DERIVED_FROM_P (fbase, tbase) |
efcc9293 JM |
1327 | || !same_type_p (static_fn_type (fromfn), |
1328 | static_fn_type (tofn))) | |
6aed477a | 1329 | return NULL; |
c73964b2 | 1330 | |
2eed8e37 BK |
1331 | from = build_memfn_type (fromfn, |
1332 | tbase, | |
1333 | cp_type_quals (tbase), | |
1334 | type_memfn_rqual (tofn)); | |
c73964b2 | 1335 | from = build_ptrmemfunc_type (build_pointer_type (from)); |
5bd61841 | 1336 | conv = build_conv (ck_pmem, from, conv); |
08e17d9d | 1337 | conv->base_p = true; |
c73964b2 MS |
1338 | } |
1339 | else if (tcode == BOOLEAN_TYPE) | |
1340 | { | |
a5ac359a | 1341 | /* [conv.bool] |
c73964b2 | 1342 | |
3c61a5ba PC |
1343 | A prvalue of arithmetic, unscoped enumeration, pointer, or pointer |
1344 | to member type can be converted to a prvalue of type bool. ... | |
1345 | For direct-initialization (8.5 [dcl.init]), a prvalue of type | |
1346 | std::nullptr_t can be converted to a prvalue of type bool; */ | |
a5ac359a | 1347 | if (ARITHMETIC_TYPE_P (from) |
adf2edec | 1348 | || UNSCOPED_ENUM_P (from) |
a5ac359a | 1349 | || fcode == POINTER_TYPE |
66b1156a | 1350 | || TYPE_PTRMEM_P (from) |
5116acc6 | 1351 | || NULLPTR_TYPE_P (from)) |
a5ac359a | 1352 | { |
5bd61841 | 1353 | conv = build_conv (ck_std, to, conv); |
a5ac359a | 1354 | if (fcode == POINTER_TYPE |
66b1156a | 1355 | || TYPE_PTRDATAMEM_P (from) |
c8094d83 | 1356 | || (TYPE_PTRMEMFUNC_P (from) |
14c2101d | 1357 | && conv->rank < cr_pbool) |
5116acc6 | 1358 | || NULLPTR_TYPE_P (from)) |
5bd61841 | 1359 | conv->rank = cr_pbool; |
3c61a5ba PC |
1360 | if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING)) |
1361 | conv->bad_p = true; | |
a5ac359a MM |
1362 | return conv; |
1363 | } | |
c8094d83 | 1364 | |
5bd61841 | 1365 | return NULL; |
c73964b2 MS |
1366 | } |
1367 | /* We don't check for ENUMERAL_TYPE here because there are no standard | |
1368 | conversions to enum type. */ | |
b6219f42 JM |
1369 | /* As an extension, allow conversion to complex type. */ |
1370 | else if (ARITHMETIC_TYPE_P (to)) | |
c73964b2 | 1371 | { |
715a572a PC |
1372 | if (! (INTEGRAL_CODE_P (fcode) |
1373 | || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL))) | |
adf2edec | 1374 | || SCOPED_ENUM_P (from)) |
6aed477a | 1375 | return NULL; |
5bd61841 | 1376 | conv = build_conv (ck_std, to, conv); |
c73964b2 MS |
1377 | |
1378 | /* Give this a better rank if it's a promotion. */ | |
f3c2dfc6 | 1379 | if (same_type_p (to, type_promotes_to (from)) |
40703fdf | 1380 | && next_conversion (conv)->rank <= cr_promotion) |
5bd61841 | 1381 | conv->rank = cr_promotion; |
c73964b2 | 1382 | } |
7d149679 | 1383 | else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE |
00c8e9f6 | 1384 | && vector_types_convertible_p (from, to, false)) |
5bd61841 | 1385 | return build_conv (ck_std, to, conv); |
9e1e64ec | 1386 | else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from) |
a7a64a77 | 1387 | && is_properly_derived_from (from, to)) |
2dbfb418 | 1388 | { |
5bd61841 | 1389 | if (conv->kind == ck_rvalue) |
40703fdf | 1390 | conv = next_conversion (conv); |
5bd61841 | 1391 | conv = build_conv (ck_base, to, conv); |
27b8d0cd MM |
1392 | /* The derived-to-base conversion indicates the initialization |
1393 | of a parameter with base type from an object of a derived | |
1394 | type. A temporary object is created to hold the result of | |
6f4fd536 JM |
1395 | the conversion unless we're binding directly to a reference. */ |
1396 | conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND); | |
2dbfb418 | 1397 | } |
c73964b2 | 1398 | else |
5bd61841 | 1399 | return NULL; |
c73964b2 | 1400 | |
09357846 JM |
1401 | if (flags & LOOKUP_NO_NARROWING) |
1402 | conv->check_narrowing = true; | |
1403 | ||
c73964b2 MS |
1404 | return conv; |
1405 | } | |
1406 | ||
838dfd8a | 1407 | /* Returns nonzero if T1 is reference-related to T2. */ |
27b8d0cd | 1408 | |
e7f1930f | 1409 | bool |
94be8403 | 1410 | reference_related_p (tree t1, tree t2) |
27b8d0cd | 1411 | { |
f0d9b836 JM |
1412 | if (t1 == error_mark_node || t2 == error_mark_node) |
1413 | return false; | |
1414 | ||
27b8d0cd MM |
1415 | t1 = TYPE_MAIN_VARIANT (t1); |
1416 | t2 = TYPE_MAIN_VARIANT (t2); | |
1417 | ||
1418 | /* [dcl.init.ref] | |
1419 | ||
1420 | Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related | |
1421 | to "cv2 T2" if T1 is the same type as T2, or T1 is a base class | |
1422 | of T2. */ | |
1423 | return (same_type_p (t1, t2) | |
1424 | || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2) | |
1425 | && DERIVED_FROM_P (t1, t2))); | |
1426 | } | |
1427 | ||
838dfd8a | 1428 | /* Returns nonzero if T1 is reference-compatible with T2. */ |
27b8d0cd | 1429 | |
94be8403 GDR |
1430 | static bool |
1431 | reference_compatible_p (tree t1, tree t2) | |
27b8d0cd MM |
1432 | { |
1433 | /* [dcl.init.ref] | |
1434 | ||
1435 | "cv1 T1" is reference compatible with "cv2 T2" if T1 is | |
1436 | reference-related to T2 and cv1 is the same cv-qualification as, | |
1437 | or greater cv-qualification than, cv2. */ | |
1438 | return (reference_related_p (t1, t2) | |
1439 | && at_least_as_qualified_p (t1, t2)); | |
1440 | } | |
1441 | ||
27b8d0cd MM |
1442 | /* A reference of the indicated TYPE is being bound directly to the |
1443 | expression represented by the implicit conversion sequence CONV. | |
1444 | Return a conversion sequence for this binding. */ | |
1445 | ||
5bd61841 MM |
1446 | static conversion * |
1447 | direct_reference_binding (tree type, conversion *conv) | |
27b8d0cd | 1448 | { |
3d938426 MM |
1449 | tree t; |
1450 | ||
50bc768d NS |
1451 | gcc_assert (TREE_CODE (type) == REFERENCE_TYPE); |
1452 | gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE); | |
3d938426 MM |
1453 | |
1454 | t = TREE_TYPE (type); | |
27b8d0cd | 1455 | |
c8094d83 MS |
1456 | /* [over.ics.rank] |
1457 | ||
27b8d0cd MM |
1458 | When a parameter of reference type binds directly |
1459 | (_dcl.init.ref_) to an argument expression, the implicit | |
1460 | conversion sequence is the identity conversion, unless the | |
1461 | argument expression has a type that is a derived class of the | |
1462 | parameter type, in which case the implicit conversion sequence is | |
1463 | a derived-to-base Conversion. | |
c8094d83 | 1464 | |
27b8d0cd MM |
1465 | If the parameter binds directly to the result of applying a |
1466 | conversion function to the argument expression, the implicit | |
1467 | conversion sequence is a user-defined conversion sequence | |
1468 | (_over.ics.user_), with the second standard conversion sequence | |
1469 | either an identity conversion or, if the conversion function | |
1470 | returns an entity of a type that is a derived class of the | |
1471 | parameter type, a derived-to-base conversion. */ | |
5bd61841 | 1472 | if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type)) |
27b8d0cd MM |
1473 | { |
1474 | /* Represent the derived-to-base conversion. */ | |
5bd61841 | 1475 | conv = build_conv (ck_base, t, conv); |
27b8d0cd MM |
1476 | /* We will actually be binding to the base-class subobject in |
1477 | the derived class, so we mark this conversion appropriately. | |
1478 | That way, convert_like knows not to generate a temporary. */ | |
5bd61841 | 1479 | conv->need_temporary_p = false; |
27b8d0cd | 1480 | } |
5bd61841 | 1481 | return build_conv (ck_ref_bind, type, conv); |
27b8d0cd MM |
1482 | } |
1483 | ||
c73964b2 MS |
1484 | /* Returns the conversion path from type FROM to reference type TO for |
1485 | purposes of reference binding. For lvalue binding, either pass a | |
c7f9c6f5 MM |
1486 | reference type to FROM or an lvalue expression to EXPR. If the |
1487 | reference will be bound to a temporary, NEED_TEMPORARY_P is set for | |
44ba4c4e JM |
1488 | the conversion returned. If C_CAST_P is true, this |
1489 | conversion is coming from a C-style cast. */ | |
c73964b2 | 1490 | |
5bd61841 | 1491 | static conversion * |
b40e334f PC |
1492 | reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags, |
1493 | tsubst_flags_t complain) | |
c73964b2 | 1494 | { |
5bd61841 | 1495 | conversion *conv = NULL; |
c73964b2 | 1496 | tree to = TREE_TYPE (rto); |
de22184b | 1497 | tree from = rfrom; |
24030e4c | 1498 | tree tfrom; |
94be8403 GDR |
1499 | bool related_p; |
1500 | bool compatible_p; | |
dbbc379e JM |
1501 | cp_lvalue_kind gl_kind; |
1502 | bool is_lvalue; | |
c73964b2 | 1503 | |
e6e174e5 JM |
1504 | if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr)) |
1505 | { | |
c2ea3a40 | 1506 | expr = instantiate_type (to, expr, tf_none); |
e6e174e5 | 1507 | if (expr == error_mark_node) |
5bd61841 | 1508 | return NULL; |
e6e174e5 JM |
1509 | from = TREE_TYPE (expr); |
1510 | } | |
1511 | ||
bd1f11be JM |
1512 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1513 | { | |
848f237b | 1514 | maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS); |
f235ad11 JM |
1515 | /* DR 1288: Otherwise, if the initializer list has a single element |
1516 | of type E and ... [T's] referenced type is reference-related to E, | |
1517 | the object or reference is initialized from that element... */ | |
1518 | if (CONSTRUCTOR_NELTS (expr) == 1) | |
bd1f11be | 1519 | { |
f235ad11 JM |
1520 | tree elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1521 | if (error_operand_p (elt)) | |
d22f0231 | 1522 | return NULL; |
f235ad11 JM |
1523 | tree etype = TREE_TYPE (elt); |
1524 | if (reference_related_p (to, etype)) | |
1525 | { | |
1526 | expr = elt; | |
1527 | from = etype; | |
1528 | goto skip; | |
1529 | } | |
bd1f11be | 1530 | } |
f235ad11 JM |
1531 | /* Otherwise, if T is a reference type, a prvalue temporary of the |
1532 | type referenced by T is copy-list-initialized or | |
1533 | direct-list-initialized, depending on the kind of initialization | |
1534 | for the reference, and the reference is bound to that temporary. */ | |
1535 | conv = implicit_conversion (to, from, expr, c_cast_p, | |
63a18c8e | 1536 | flags|LOOKUP_NO_TEMP_BIND, complain); |
f235ad11 | 1537 | skip:; |
bd1f11be JM |
1538 | } |
1539 | ||
dbbc379e JM |
1540 | if (TREE_CODE (from) == REFERENCE_TYPE) |
1541 | { | |
1542 | from = TREE_TYPE (from); | |
1543 | if (!TYPE_REF_IS_RVALUE (rfrom) | |
1544 | || TREE_CODE (from) == FUNCTION_TYPE) | |
1545 | gl_kind = clk_ordinary; | |
1546 | else | |
1547 | gl_kind = clk_rvalueref; | |
1548 | } | |
1549 | else if (expr) | |
1550 | { | |
1551 | gl_kind = lvalue_kind (expr); | |
1552 | if (gl_kind & clk_class) | |
1553 | /* A class prvalue is not a glvalue. */ | |
1554 | gl_kind = clk_none; | |
1555 | } | |
1556 | else | |
1557 | gl_kind = clk_none; | |
1558 | is_lvalue = gl_kind && !(gl_kind & clk_rvalueref); | |
eb66be0e | 1559 | |
24030e4c | 1560 | tfrom = from; |
dbbc379e | 1561 | if ((gl_kind & clk_bitfield) != 0) |
24030e4c JJ |
1562 | tfrom = unlowered_expr_type (expr); |
1563 | ||
b0385db8 | 1564 | /* Figure out whether or not the types are reference-related and |
026c3cfd | 1565 | reference compatible. We have to do this after stripping |
b0385db8 | 1566 | references from FROM. */ |
24030e4c | 1567 | related_p = reference_related_p (to, tfrom); |
44ba4c4e JM |
1568 | /* If this is a C cast, first convert to an appropriately qualified |
1569 | type, so that we can later do a const_cast to the desired type. */ | |
1570 | if (related_p && c_cast_p | |
24030e4c | 1571 | && !at_least_as_qualified_p (to, tfrom)) |
a3360e77 | 1572 | to = cp_build_qualified_type (to, cp_type_quals (tfrom)); |
24030e4c | 1573 | compatible_p = reference_compatible_p (to, tfrom); |
b0385db8 | 1574 | |
8af2fec4 | 1575 | /* Directly bind reference when target expression's type is compatible with |
6f4fd536 JM |
1576 | the reference and expression is an lvalue. In DR391, the wording in |
1577 | [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for | |
9771799c | 1578 | const and rvalue references to rvalues of compatible class type. |
dbbc379e | 1579 | We should also do direct bindings for non-class xvalues. */ |
d02f620d JM |
1580 | if (related_p |
1581 | && (gl_kind | |
1582 | || (!(flags & LOOKUP_NO_TEMP_BIND) | |
1583 | && (CLASS_TYPE_P (from) | |
1584 | || TREE_CODE (from) == ARRAY_TYPE)))) | |
c73964b2 | 1585 | { |
27b8d0cd | 1586 | /* [dcl.init.ref] |
c73964b2 | 1587 | |
c8094d83 MS |
1588 | If the initializer expression |
1589 | ||
27b8d0cd MM |
1590 | -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1" |
1591 | is reference-compatible with "cv2 T2," | |
c8094d83 | 1592 | |
34cd5ae7 | 1593 | the reference is bound directly to the initializer expression |
6f4fd536 JM |
1594 | lvalue. |
1595 | ||
1596 | [...] | |
1597 | If the initializer expression is an rvalue, with T2 a class type, | |
1598 | and "cv1 T1" is reference-compatible with "cv2 T2", the reference | |
1599 | is bound to the object represented by the rvalue or to a sub-object | |
1600 | within that object. */ | |
1601 | ||
24030e4c | 1602 | conv = build_identity_conv (tfrom, expr); |
27b8d0cd | 1603 | conv = direct_reference_binding (rto, conv); |
8af2fec4 RY |
1604 | |
1605 | if (flags & LOOKUP_PREFER_RVALUE) | |
1606 | /* The top-level caller requested that we pretend that the lvalue | |
1607 | be treated as an rvalue. */ | |
1608 | conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto); | |
0ad2cde8 JM |
1609 | else if (TREE_CODE (rfrom) == REFERENCE_TYPE) |
1610 | /* Handle rvalue reference to function properly. */ | |
1611 | conv->rvaluedness_matches_p | |
1612 | = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom)); | |
8af2fec4 RY |
1613 | else |
1614 | conv->rvaluedness_matches_p | |
9771799c | 1615 | = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue); |
8af2fec4 | 1616 | |
dbbc379e JM |
1617 | if ((gl_kind & clk_bitfield) != 0 |
1618 | || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to))) | |
27b8d0cd | 1619 | /* For the purposes of overload resolution, we ignore the fact |
e0d1297c | 1620 | this expression is a bitfield or packed field. (In particular, |
27b8d0cd MM |
1621 | [over.ics.ref] says specifically that a function with a |
1622 | non-const reference parameter is viable even if the | |
1623 | argument is a bitfield.) | |
1624 | ||
1625 | However, when we actually call the function we must create | |
1626 | a temporary to which to bind the reference. If the | |
1627 | reference is volatile, or isn't const, then we cannot make | |
1628 | a temporary, so we just issue an error when the conversion | |
1629 | actually occurs. */ | |
5bd61841 | 1630 | conv->need_temporary_p = true; |
c8094d83 | 1631 | |
b24290fb JM |
1632 | /* Don't allow binding of lvalues (other than function lvalues) to |
1633 | rvalue references. */ | |
e7f1930f | 1634 | if (is_lvalue && TYPE_REF_IS_RVALUE (rto) |
b24290fb | 1635 | && TREE_CODE (to) != FUNCTION_TYPE |
e7f1930f JM |
1636 | && !(flags & LOOKUP_PREFER_RVALUE)) |
1637 | conv->bad_p = true; | |
1638 | ||
d02f620d JM |
1639 | /* Nor the reverse. */ |
1640 | if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto) | |
1641 | && (!CP_TYPE_CONST_NON_VOLATILE_P (to) | |
1642 | || (flags & LOOKUP_NO_RVAL_BIND)) | |
1643 | && TREE_CODE (to) != FUNCTION_TYPE) | |
1644 | conv->bad_p = true; | |
1645 | ||
1646 | if (!compatible_p) | |
1647 | conv->bad_p = true; | |
1648 | ||
27b8d0cd | 1649 | return conv; |
c73964b2 | 1650 | } |
9380ed84 JM |
1651 | /* [class.conv.fct] A conversion function is never used to convert a |
1652 | (possibly cv-qualified) object to the (possibly cv-qualified) same | |
1653 | object type (or a reference to it), to a (possibly cv-qualified) base | |
1654 | class of that type (or a reference to it).... */ | |
1655 | else if (CLASS_TYPE_P (from) && !related_p | |
1656 | && !(flags & LOOKUP_NO_CONVERSION)) | |
c73964b2 | 1657 | { |
27b8d0cd MM |
1658 | /* [dcl.init.ref] |
1659 | ||
34cd5ae7 | 1660 | If the initializer expression |
27b8d0cd MM |
1661 | |
1662 | -- has a class type (i.e., T2 is a class type) can be | |
1663 | implicitly converted to an lvalue of type "cv3 T3," where | |
1664 | "cv1 T1" is reference-compatible with "cv3 T3". (this | |
1665 | conversion is selected by enumerating the applicable | |
1666 | conversion functions (_over.match.ref_) and choosing the | |
c8094d83 | 1667 | best one through overload resolution. (_over.match_). |
27b8d0cd | 1668 | |
0cbd7506 | 1669 | the reference is bound to the lvalue result of the conversion |
27b8d0cd | 1670 | in the second case. */ |
b40e334f PC |
1671 | z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, |
1672 | complain); | |
62a405dd JM |
1673 | if (cand) |
1674 | return cand->second_conv; | |
27b8d0cd | 1675 | } |
c73964b2 | 1676 | |
a7a64a77 MM |
1677 | /* From this point on, we conceptually need temporaries, even if we |
1678 | elide them. Only the cases above are "direct bindings". */ | |
1679 | if (flags & LOOKUP_NO_TEMP_BIND) | |
5bd61841 | 1680 | return NULL; |
a7a64a77 | 1681 | |
27b8d0cd | 1682 | /* [over.ics.rank] |
c8094d83 | 1683 | |
27b8d0cd MM |
1684 | When a parameter of reference type is not bound directly to an |
1685 | argument expression, the conversion sequence is the one required | |
1686 | to convert the argument expression to the underlying type of the | |
1687 | reference according to _over.best.ics_. Conceptually, this | |
1688 | conversion sequence corresponds to copy-initializing a temporary | |
1689 | of the underlying type with the argument expression. Any | |
1690 | difference in top-level cv-qualification is subsumed by the | |
1691 | initialization itself and does not constitute a conversion. */ | |
1692 | ||
f9b600ba JM |
1693 | /* [dcl.init.ref] |
1694 | ||
1695 | Otherwise, the reference shall be an lvalue reference to a | |
1696 | non-volatile const type, or the reference shall be an rvalue | |
1697 | reference. | |
1698 | ||
1699 | We try below to treat this as a bad conversion to improve diagnostics, | |
1700 | but if TO is an incomplete class, we need to reject this conversion | |
1701 | now to avoid unnecessary instantiation. */ | |
1702 | if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto) | |
1703 | && !COMPLETE_TYPE_P (to)) | |
1704 | return NULL; | |
1705 | ||
6f4fd536 JM |
1706 | /* We're generating a temporary now, but don't bind any more in the |
1707 | conversion (specifically, don't slice the temporary returned by a | |
1708 | conversion operator). */ | |
1709 | flags |= LOOKUP_NO_TEMP_BIND; | |
1710 | ||
cef62ad4 JM |
1711 | /* Core issue 899: When [copy-]initializing a temporary to be bound |
1712 | to the first parameter of a copy constructor (12.8) called with | |
1713 | a single argument in the context of direct-initialization, | |
1714 | explicit conversion functions are also considered. | |
1715 | ||
1716 | So don't set LOOKUP_ONLYCONVERTING in that case. */ | |
e57d93c6 JM |
1717 | if (!(flags & LOOKUP_COPY_PARM)) |
1718 | flags |= LOOKUP_ONLYCONVERTING; | |
1719 | ||
bd1f11be JM |
1720 | if (!conv) |
1721 | conv = implicit_conversion (to, from, expr, c_cast_p, | |
b40e334f | 1722 | flags, complain); |
27b8d0cd | 1723 | if (!conv) |
5bd61841 | 1724 | return NULL; |
27b8d0cd | 1725 | |
fc45aeee JM |
1726 | if (conv->user_conv_p) |
1727 | { | |
1728 | /* If initializing the temporary used a conversion function, | |
1729 | recalculate the second conversion sequence. */ | |
1730 | for (conversion *t = conv; t; t = next_conversion (t)) | |
1731 | if (t->kind == ck_user | |
1732 | && DECL_CONV_FN_P (t->cand->fn)) | |
1733 | { | |
1734 | tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn)); | |
1735 | int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND; | |
1736 | conversion *new_second | |
1737 | = reference_binding (rto, ftype, NULL_TREE, c_cast_p, | |
1738 | sflags, complain); | |
1739 | if (!new_second) | |
1740 | return NULL; | |
1741 | return merge_conversion_sequences (t, new_second); | |
1742 | } | |
1743 | } | |
1744 | ||
2f75f515 | 1745 | conv = build_conv (ck_ref_bind, rto, conv); |
27b8d0cd MM |
1746 | /* This reference binding, unlike those above, requires the |
1747 | creation of a temporary. */ | |
5bd61841 | 1748 | conv->need_temporary_p = true; |
fc45aeee | 1749 | conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto); |
27b8d0cd | 1750 | |
d02f620d JM |
1751 | /* [dcl.init.ref] |
1752 | ||
1753 | Otherwise, the reference shall be an lvalue reference to a | |
1754 | non-volatile const type, or the reference shall be an rvalue | |
1755 | reference. */ | |
1756 | if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)) | |
1757 | conv->bad_p = true; | |
1758 | ||
1759 | /* [dcl.init.ref] | |
1760 | ||
1761 | Otherwise, a temporary of type "cv1 T1" is created and | |
1762 | initialized from the initializer expression using the rules for a | |
1763 | non-reference copy initialization. If T1 is reference-related to | |
1764 | T2, cv1 must be the same cv-qualification as, or greater | |
1765 | cv-qualification than, cv2; otherwise, the program is ill-formed. */ | |
1766 | if (related_p && !at_least_as_qualified_p (to, from)) | |
1767 | conv->bad_p = true; | |
1768 | ||
c73964b2 MS |
1769 | return conv; |
1770 | } | |
1771 | ||
34b5375f MM |
1772 | /* Returns the implicit conversion sequence (see [over.ics]) from type |
1773 | FROM to type TO. The optional expression EXPR may affect the | |
248e1b22 MM |
1774 | conversion. FLAGS are the usual overloading flags. If C_CAST_P is |
1775 | true, this conversion is coming from a C-style cast. */ | |
c73964b2 | 1776 | |
5bd61841 | 1777 | static conversion * |
34b5375f | 1778 | implicit_conversion (tree to, tree from, tree expr, bool c_cast_p, |
b40e334f | 1779 | int flags, tsubst_flags_t complain) |
c73964b2 | 1780 | { |
5bd61841 | 1781 | conversion *conv; |
c73964b2 | 1782 | |
5d73aa63 MM |
1783 | if (from == error_mark_node || to == error_mark_node |
1784 | || expr == error_mark_node) | |
5bd61841 | 1785 | return NULL; |
5d73aa63 | 1786 | |
12b03642 JM |
1787 | /* Other flags only apply to the primary function in overload |
1788 | resolution, or after we've chosen one. */ | |
1789 | flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM | |
1790 | |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE | |
715a572a | 1791 | |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL); |
12b03642 | 1792 | |
4b978f96 PC |
1793 | /* FIXME: actually we don't want warnings either, but we can't just |
1794 | have 'complain &= ~(tf_warning|tf_error)' because it would cause | |
1795 | the regression of, eg, g++.old-deja/g++.benjamin/16077.C. | |
1796 | We really ought not to issue that warning until we've committed | |
1797 | to that conversion. */ | |
1798 | complain &= ~tf_error; | |
1799 | ||
9fa6ffe1 JM |
1800 | /* Call reshape_init early to remove redundant braces. */ |
1801 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr) | |
e8a3c597 | 1802 | && CLASS_TYPE_P (to) |
9fa6ffe1 | 1803 | && COMPLETE_TYPE_P (complete_type (to)) |
e8a3c597 | 1804 | && !CLASSTYPE_NON_AGGREGATE (to)) |
9fa6ffe1 JM |
1805 | { |
1806 | expr = reshape_init (to, expr, complain); | |
1807 | if (expr == error_mark_node) | |
1808 | return NULL; | |
1809 | from = TREE_TYPE (expr); | |
1810 | } | |
1811 | ||
c73964b2 | 1812 | if (TREE_CODE (to) == REFERENCE_TYPE) |
b40e334f | 1813 | conv = reference_binding (to, from, expr, c_cast_p, flags, complain); |
c73964b2 | 1814 | else |
34b5375f | 1815 | conv = standard_conversion (to, from, expr, c_cast_p, flags); |
c73964b2 MS |
1816 | |
1817 | if (conv) | |
b80f8ef3 MM |
1818 | return conv; |
1819 | ||
c5adc427 JM |
1820 | if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)) |
1821 | { | |
1822 | if (is_std_init_list (to)) | |
b40e334f | 1823 | return build_list_conv (to, expr, flags, complain); |
c5adc427 | 1824 | |
77a30e9a JM |
1825 | /* As an extension, allow list-initialization of _Complex. */ |
1826 | if (TREE_CODE (to) == COMPLEX_TYPE) | |
1827 | { | |
b40e334f | 1828 | conv = build_complex_conv (to, expr, flags, complain); |
77a30e9a JM |
1829 | if (conv) |
1830 | return conv; | |
1831 | } | |
1832 | ||
c5adc427 | 1833 | /* Allow conversion from an initializer-list with one element to a |
4ea08463 JM |
1834 | scalar type. */ |
1835 | if (SCALAR_TYPE_P (to)) | |
c5adc427 | 1836 | { |
4ea08463 | 1837 | int nelts = CONSTRUCTOR_NELTS (expr); |
c5adc427 | 1838 | tree elt; |
4ea08463 JM |
1839 | |
1840 | if (nelts == 0) | |
1c53d72b | 1841 | elt = build_value_init (to, tf_none); |
4ea08463 | 1842 | else if (nelts == 1) |
c5adc427 JM |
1843 | elt = CONSTRUCTOR_ELT (expr, 0)->value; |
1844 | else | |
4ea08463 JM |
1845 | elt = error_mark_node; |
1846 | ||
c5adc427 | 1847 | conv = implicit_conversion (to, TREE_TYPE (elt), elt, |
b40e334f | 1848 | c_cast_p, flags, complain); |
c5adc427 JM |
1849 | if (conv) |
1850 | { | |
1851 | conv->check_narrowing = true; | |
4ea08463 JM |
1852 | if (BRACE_ENCLOSED_INITIALIZER_P (elt)) |
1853 | /* Too many levels of braces, i.e. '{{1}}'. */ | |
1854 | conv->bad_p = true; | |
c5adc427 JM |
1855 | return conv; |
1856 | } | |
1857 | } | |
dd35aac7 | 1858 | else if (TREE_CODE (to) == ARRAY_TYPE) |
b40e334f | 1859 | return build_array_conv (to, expr, flags, complain); |
c5adc427 | 1860 | } |
09357846 | 1861 | |
b80f8ef3 | 1862 | if (expr != NULL_TREE |
9e1e64ec PC |
1863 | && (MAYBE_CLASS_TYPE_P (from) |
1864 | || MAYBE_CLASS_TYPE_P (to)) | |
b80f8ef3 | 1865 | && (flags & LOOKUP_NO_CONVERSION) == 0) |
c73964b2 | 1866 | { |
7993382e MM |
1867 | struct z_candidate *cand; |
1868 | ||
09357846 | 1869 | if (CLASS_TYPE_P (to) |
4ce1e770 JM |
1870 | && BRACE_ENCLOSED_INITIALIZER_P (expr) |
1871 | && !CLASSTYPE_NON_AGGREGATE (complete_type (to))) | |
b40e334f | 1872 | return build_aggr_conv (to, expr, flags, complain); |
09357846 | 1873 | |
b40e334f | 1874 | cand = build_user_type_conversion_1 (to, expr, flags, complain); |
eb66be0e MS |
1875 | if (cand) |
1876 | conv = cand->second_conv; | |
5e818b93 JM |
1877 | |
1878 | /* We used to try to bind a reference to a temporary here, but that | |
8af2fec4 | 1879 | is now handled after the recursive call to this function at the end |
5e818b93 | 1880 | of reference_binding. */ |
b80f8ef3 | 1881 | return conv; |
c73964b2 MS |
1882 | } |
1883 | ||
5bd61841 | 1884 | return NULL; |
c73964b2 MS |
1885 | } |
1886 | ||
5ffe581d | 1887 | /* Add a new entry to the list of candidates. Used by the add_*_candidate |
c166b898 ILT |
1888 | functions. ARGS will not be changed until a single candidate is |
1889 | selected. */ | |
5ffe581d JM |
1890 | |
1891 | static struct z_candidate * | |
c8094d83 | 1892 | add_candidate (struct z_candidate **candidates, |
9771b263 | 1893 | tree fn, tree first_arg, const vec<tree, va_gc> *args, |
c8094d83 MS |
1894 | size_t num_convs, conversion **convs, |
1895 | tree access_path, tree conversion_path, | |
4561285b JM |
1896 | int viable, struct rejection_reason *reason, |
1897 | int flags) | |
5ffe581d | 1898 | { |
67f5655f GDR |
1899 | struct z_candidate *cand = (struct z_candidate *) |
1900 | conversion_obstack_alloc (sizeof (struct z_candidate)); | |
5ffe581d JM |
1901 | |
1902 | cand->fn = fn; | |
c166b898 | 1903 | cand->first_arg = first_arg; |
b80f8ef3 | 1904 | cand->args = args; |
5ffe581d | 1905 | cand->convs = convs; |
5bd61841 | 1906 | cand->num_convs = num_convs; |
4ba126e4 MM |
1907 | cand->access_path = access_path; |
1908 | cand->conversion_path = conversion_path; | |
5ffe581d | 1909 | cand->viable = viable; |
feb6efc1 | 1910 | cand->reason = reason; |
7993382e | 1911 | cand->next = *candidates; |
4561285b | 1912 | cand->flags = flags; |
7993382e | 1913 | *candidates = cand; |
5ffe581d JM |
1914 | |
1915 | return cand; | |
1916 | } | |
1917 | ||
feb6efc1 NF |
1918 | /* Return the number of remaining arguments in the parameter list |
1919 | beginning with ARG. */ | |
1920 | ||
1921 | static int | |
1922 | remaining_arguments (tree arg) | |
1923 | { | |
1924 | int n; | |
1925 | ||
1926 | for (n = 0; arg != NULL_TREE && arg != void_list_node; | |
1927 | arg = TREE_CHAIN (arg)) | |
1928 | n++; | |
1929 | ||
1930 | return n; | |
1931 | } | |
1932 | ||
c166b898 ILT |
1933 | /* Create an overload candidate for the function or method FN called |
1934 | with the argument list FIRST_ARG/ARGS and add it to CANDIDATES. | |
1935 | FLAGS is passed on to implicit_conversion. | |
1936 | ||
1937 | This does not change ARGS. | |
aa52c1ff JM |
1938 | |
1939 | CTYPE, if non-NULL, is the type we want to pretend this function | |
1940 | comes from for purposes of overload resolution. */ | |
c73964b2 MS |
1941 | |
1942 | static struct z_candidate * | |
c8094d83 | 1943 | add_function_candidate (struct z_candidate **candidates, |
c166b898 | 1944 | tree fn, tree ctype, tree first_arg, |
9771b263 | 1945 | const vec<tree, va_gc> *args, tree access_path, |
b40e334f PC |
1946 | tree conversion_path, int flags, |
1947 | tsubst_flags_t complain) | |
c73964b2 MS |
1948 | { |
1949 | tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
1950 | int i, len; | |
5bd61841 | 1951 | conversion **convs; |
c166b898 ILT |
1952 | tree parmnode; |
1953 | tree orig_first_arg = first_arg; | |
1954 | int skip; | |
c73964b2 | 1955 | int viable = 1; |
feb6efc1 | 1956 | struct rejection_reason *reason = NULL; |
c73964b2 | 1957 | |
d63d5d0c ILT |
1958 | /* At this point we should not see any functions which haven't been |
1959 | explicitly declared, except for friend functions which will have | |
1960 | been found using argument dependent lookup. */ | |
1961 | gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn)); | |
089d6ea7 | 1962 | |
e0fff4b3 JM |
1963 | /* The `this', `in_chrg' and VTT arguments to constructors are not |
1964 | considered in overload resolution. */ | |
c73964b2 MS |
1965 | if (DECL_CONSTRUCTOR_P (fn)) |
1966 | { | |
e0fff4b3 | 1967 | parmlist = skip_artificial_parms_for (fn, parmlist); |
c166b898 ILT |
1968 | skip = num_artificial_parms_for (fn); |
1969 | if (skip > 0 && first_arg != NULL_TREE) | |
1970 | { | |
1971 | --skip; | |
1972 | first_arg = NULL_TREE; | |
1973 | } | |
c73964b2 | 1974 | } |
c8094d83 | 1975 | else |
c166b898 | 1976 | skip = 0; |
c73964b2 | 1977 | |
9771b263 | 1978 | len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0); |
5bd61841 | 1979 | convs = alloc_conversions (len); |
8f96c7ac JM |
1980 | |
1981 | /* 13.3.2 - Viable functions [over.match.viable] | |
1982 | First, to be a viable function, a candidate function shall have enough | |
1983 | parameters to agree in number with the arguments in the list. | |
1984 | ||
1985 | We need to check this first; otherwise, checking the ICSes might cause | |
1986 | us to produce an ill-formed template instantiation. */ | |
1987 | ||
1988 | parmnode = parmlist; | |
1989 | for (i = 0; i < len; ++i) | |
1990 | { | |
1991 | if (parmnode == NULL_TREE || parmnode == void_list_node) | |
1992 | break; | |
1993 | parmnode = TREE_CHAIN (parmnode); | |
1994 | } | |
1995 | ||
feb6efc1 NF |
1996 | if ((i < len && parmnode) |
1997 | || !sufficient_parms_p (parmnode)) | |
1998 | { | |
1999 | int remaining = remaining_arguments (parmnode); | |
2000 | viable = 0; | |
2001 | reason = arity_rejection (first_arg, i + remaining, len); | |
2002 | } | |
971e17ff AS |
2003 | |
2004 | /* Second, for a function to be viable, its constraints must be | |
2005 | satisfied. */ | |
2006 | if (flag_concepts && viable | |
2007 | && !constraints_satisfied_p (fn)) | |
2008 | { | |
2009 | reason = constraint_failure (fn); | |
2010 | viable = false; | |
2011 | } | |
2012 | ||
b8bf6ad9 JM |
2013 | /* When looking for a function from a subobject from an implicit |
2014 | copy/move constructor/operator=, don't consider anything that takes (a | |
2015 | reference to) an unrelated type. See c++/44909 and core 1092. */ | |
971e17ff | 2016 | if (viable && parmlist && (flags & LOOKUP_DEFAULTED)) |
10746f37 JM |
2017 | { |
2018 | if (DECL_CONSTRUCTOR_P (fn)) | |
2019 | i = 1; | |
2020 | else if (DECL_ASSIGNMENT_OPERATOR_P (fn) | |
2021 | && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR) | |
2022 | i = 2; | |
2023 | else | |
2024 | i = 0; | |
2025 | if (i && len == i) | |
2026 | { | |
2027 | parmnode = chain_index (i-1, parmlist); | |
f0d9b836 JM |
2028 | if (!reference_related_p (non_reference (TREE_VALUE (parmnode)), |
2029 | ctype)) | |
10746f37 JM |
2030 | viable = 0; |
2031 | } | |
b8bf6ad9 JM |
2032 | |
2033 | /* This only applies at the top level. */ | |
2034 | flags &= ~LOOKUP_DEFAULTED; | |
10746f37 JM |
2035 | } |
2036 | ||
8f96c7ac JM |
2037 | if (! viable) |
2038 | goto out; | |
2039 | ||
971e17ff | 2040 | /* Third, for F to be a viable function, there shall exist for each |
8f96c7ac JM |
2041 | argument an implicit conversion sequence that converts that argument |
2042 | to the corresponding parameter of F. */ | |
2043 | ||
2044 | parmnode = parmlist; | |
c73964b2 MS |
2045 | |
2046 | for (i = 0; i < len; ++i) | |
2047 | { | |
0823efed DN |
2048 | tree argtype, to_type; |
2049 | tree arg; | |
5bd61841 | 2050 | conversion *t; |
aa52c1ff | 2051 | int is_this; |
c73964b2 | 2052 | |
c73964b2 MS |
2053 | if (parmnode == void_list_node) |
2054 | break; | |
aa45967f | 2055 | |
c166b898 ILT |
2056 | if (i == 0 && first_arg != NULL_TREE) |
2057 | arg = first_arg; | |
2058 | else | |
0823efed | 2059 | arg = CONST_CAST_TREE ( |
9771b263 | 2060 | (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]); |
c166b898 ILT |
2061 | argtype = lvalue_type (arg); |
2062 | ||
aa52c1ff JM |
2063 | is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
2064 | && ! DECL_CONSTRUCTOR_P (fn)); | |
2065 | ||
aa45967f JM |
2066 | if (parmnode) |
2067 | { | |
2068 | tree parmtype = TREE_VALUE (parmnode); | |
09357846 | 2069 | int lflags = flags; |
aa45967f | 2070 | |
cef62ad4 JM |
2071 | parmnode = TREE_CHAIN (parmnode); |
2072 | ||
aa52c1ff JM |
2073 | /* The type of the implicit object parameter ('this') for |
2074 | overload resolution is not always the same as for the | |
2075 | function itself; conversion functions are considered to | |
2076 | be members of the class being converted, and functions | |
2077 | introduced by a using-declaration are considered to be | |
2078 | members of the class that uses them. | |
aa45967f | 2079 | |
aa52c1ff JM |
2080 | Since build_over_call ignores the ICS for the `this' |
2081 | parameter, we can just change the parm type. */ | |
2082 | if (ctype && is_this) | |
aa45967f | 2083 | { |
a3360e77 JM |
2084 | parmtype = cp_build_qualified_type |
2085 | (ctype, cp_type_quals (TREE_TYPE (parmtype))); | |
2eed8e37 BK |
2086 | if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn))) |
2087 | { | |
2088 | /* If the function has a ref-qualifier, the implicit | |
2089 | object parameter has reference type. */ | |
2090 | bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn)); | |
2091 | parmtype = cp_build_reference_type (parmtype, rv); | |
caa40bc0 JM |
2092 | /* The special handling of 'this' conversions in compare_ics |
2093 | does not apply if there is a ref-qualifier. */ | |
2094 | is_this = false; | |
2eed8e37 BK |
2095 | } |
2096 | else | |
a7175123 JM |
2097 | { |
2098 | parmtype = build_pointer_type (parmtype); | |
2099 | arg = build_this (arg); | |
2100 | argtype = lvalue_type (arg); | |
2101 | } | |
aa45967f JM |
2102 | } |
2103 | ||
cef62ad4 JM |
2104 | /* Core issue 899: When [copy-]initializing a temporary to be bound |
2105 | to the first parameter of a copy constructor (12.8) called with | |
2106 | a single argument in the context of direct-initialization, | |
2107 | explicit conversion functions are also considered. | |
2108 | ||
2109 | So set LOOKUP_COPY_PARM to let reference_binding know that | |
2110 | it's being called in that context. We generalize the above | |
2111 | to handle move constructors and template constructors as well; | |
2112 | the standardese should soon be updated similarly. */ | |
2113 | if (ctype && i == 0 && (len-skip == 1) | |
cef62ad4 JM |
2114 | && DECL_CONSTRUCTOR_P (fn) |
2115 | && parmtype != error_mark_node | |
2116 | && (same_type_ignoring_top_level_qualifiers_p | |
2117 | (non_reference (parmtype), ctype))) | |
e57d93c6 | 2118 | { |
11c71a22 JM |
2119 | if (!(flags & LOOKUP_ONLYCONVERTING)) |
2120 | lflags |= LOOKUP_COPY_PARM; | |
cef62ad4 | 2121 | /* We allow user-defined conversions within init-lists, but |
00ef7059 JM |
2122 | don't list-initialize the copy parm, as that would mean |
2123 | using two levels of braces for the same type. */ | |
11c71a22 | 2124 | if ((flags & LOOKUP_LIST_INIT_CTOR) |
00ef7059 | 2125 | && BRACE_ENCLOSED_INITIALIZER_P (arg)) |
e57d93c6 JM |
2126 | lflags |= LOOKUP_NO_CONVERSION; |
2127 | } | |
2128 | else | |
2129 | lflags |= LOOKUP_ONLYCONVERTING; | |
09357846 | 2130 | |
aa7349eb | 2131 | t = implicit_conversion (parmtype, argtype, arg, |
b40e334f | 2132 | /*c_cast_p=*/false, lflags, complain); |
feb6efc1 | 2133 | to_type = parmtype; |
aa45967f | 2134 | } |
c73964b2 MS |
2135 | else |
2136 | { | |
5bd61841 MM |
2137 | t = build_identity_conv (argtype, arg); |
2138 | t->ellipsis_p = true; | |
feb6efc1 | 2139 | to_type = argtype; |
c73964b2 MS |
2140 | } |
2141 | ||
aa52c1ff | 2142 | if (t && is_this) |
5bd61841 | 2143 | t->this_p = true; |
d11ad92e | 2144 | |
5bd61841 | 2145 | convs[i] = t; |
c73964b2 | 2146 | if (! t) |
8f96c7ac JM |
2147 | { |
2148 | viable = 0; | |
feb6efc1 | 2149 | reason = arg_conversion_rejection (first_arg, i, argtype, to_type); |
8f96c7ac JM |
2150 | break; |
2151 | } | |
c73964b2 | 2152 | |
5bd61841 | 2153 | if (t->bad_p) |
feb6efc1 NF |
2154 | { |
2155 | viable = -1; | |
89606913 | 2156 | reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type); |
feb6efc1 | 2157 | } |
c73964b2 MS |
2158 | } |
2159 | ||
8f96c7ac | 2160 | out: |
c166b898 | 2161 | return add_candidate (candidates, fn, orig_first_arg, args, len, convs, |
4561285b | 2162 | access_path, conversion_path, viable, reason, flags); |
c73964b2 MS |
2163 | } |
2164 | ||
2165 | /* Create an overload candidate for the conversion function FN which will | |
2166 | be invoked for expression OBJ, producing a pointer-to-function which | |
c166b898 ILT |
2167 | will in turn be called with the argument list FIRST_ARG/ARGLIST, |
2168 | and add it to CANDIDATES. This does not change ARGLIST. FLAGS is | |
2169 | passed on to implicit_conversion. | |
37b6eb34 JM |
2170 | |
2171 | Actually, we don't really care about FN; we care about the type it | |
2172 | converts to. There may be multiple conversion functions that will | |
2173 | convert to that type, and we rely on build_user_type_conversion_1 to | |
2174 | choose the best one; so when we create our candidate, we record the type | |
2175 | instead of the function. */ | |
c73964b2 MS |
2176 | |
2177 | static struct z_candidate * | |
7993382e | 2178 | add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj, |
9771b263 | 2179 | tree first_arg, const vec<tree, va_gc> *arglist, |
b40e334f PC |
2180 | tree access_path, tree conversion_path, |
2181 | tsubst_flags_t complain) | |
c73964b2 MS |
2182 | { |
2183 | tree totype = TREE_TYPE (TREE_TYPE (fn)); | |
477f6664 | 2184 | int i, len, viable, flags; |
c166b898 | 2185 | tree parmlist, parmnode; |
5bd61841 | 2186 | conversion **convs; |
feb6efc1 | 2187 | struct rejection_reason *reason; |
477f6664 JM |
2188 | |
2189 | for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; ) | |
2190 | parmlist = TREE_TYPE (parmlist); | |
2191 | parmlist = TYPE_ARG_TYPES (parmlist); | |
2192 | ||
9771b263 | 2193 | len = vec_safe_length (arglist) + (first_arg != NULL_TREE ? 1 : 0) + 1; |
5bd61841 | 2194 | convs = alloc_conversions (len); |
477f6664 | 2195 | parmnode = parmlist; |
477f6664 | 2196 | viable = 1; |
e57d93c6 | 2197 | flags = LOOKUP_IMPLICIT; |
feb6efc1 | 2198 | reason = NULL; |
c73964b2 | 2199 | |
37b6eb34 | 2200 | /* Don't bother looking up the same type twice. */ |
7993382e MM |
2201 | if (*candidates && (*candidates)->fn == totype) |
2202 | return NULL; | |
37b6eb34 | 2203 | |
c73964b2 MS |
2204 | for (i = 0; i < len; ++i) |
2205 | { | |
feb6efc1 | 2206 | tree arg, argtype, convert_type = NULL_TREE; |
5bd61841 | 2207 | conversion *t; |
c73964b2 | 2208 | |
c166b898 ILT |
2209 | if (i == 0) |
2210 | arg = obj; | |
2211 | else if (i == 1 && first_arg != NULL_TREE) | |
2212 | arg = first_arg; | |
2213 | else | |
9771b263 | 2214 | arg = (*arglist)[i - (first_arg != NULL_TREE ? 1 : 0) - 1]; |
c166b898 ILT |
2215 | argtype = lvalue_type (arg); |
2216 | ||
c73964b2 | 2217 | if (i == 0) |
feb6efc1 NF |
2218 | { |
2219 | t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false, | |
b40e334f | 2220 | flags, complain); |
feb6efc1 NF |
2221 | convert_type = totype; |
2222 | } | |
c73964b2 MS |
2223 | else if (parmnode == void_list_node) |
2224 | break; | |
2225 | else if (parmnode) | |
feb6efc1 NF |
2226 | { |
2227 | t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg, | |
b40e334f | 2228 | /*c_cast_p=*/false, flags, complain); |
feb6efc1 NF |
2229 | convert_type = TREE_VALUE (parmnode); |
2230 | } | |
c73964b2 MS |
2231 | else |
2232 | { | |
5bd61841 MM |
2233 | t = build_identity_conv (argtype, arg); |
2234 | t->ellipsis_p = true; | |
feb6efc1 | 2235 | convert_type = argtype; |
c73964b2 MS |
2236 | } |
2237 | ||
5bd61841 | 2238 | convs[i] = t; |
c73964b2 MS |
2239 | if (! t) |
2240 | break; | |
2241 | ||
5bd61841 | 2242 | if (t->bad_p) |
feb6efc1 NF |
2243 | { |
2244 | viable = -1; | |
89606913 | 2245 | reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type); |
feb6efc1 | 2246 | } |
d11ad92e | 2247 | |
c73964b2 MS |
2248 | if (i == 0) |
2249 | continue; | |
2250 | ||
2251 | if (parmnode) | |
2252 | parmnode = TREE_CHAIN (parmnode); | |
c73964b2 MS |
2253 | } |
2254 | ||
feb6efc1 NF |
2255 | if (i < len |
2256 | || ! sufficient_parms_p (parmnode)) | |
2257 | { | |
2258 | int remaining = remaining_arguments (parmnode); | |
2259 | viable = 0; | |
2260 | reason = arity_rejection (NULL_TREE, i + remaining, len); | |
2261 | } | |
c73964b2 | 2262 | |
c166b898 | 2263 | return add_candidate (candidates, totype, first_arg, arglist, len, convs, |
4561285b | 2264 | access_path, conversion_path, viable, reason, flags); |
c73964b2 MS |
2265 | } |
2266 | ||
7993382e MM |
2267 | static void |
2268 | build_builtin_candidate (struct z_candidate **candidates, tree fnname, | |
0cbd7506 | 2269 | tree type1, tree type2, tree *args, tree *argtypes, |
b40e334f | 2270 | int flags, tsubst_flags_t complain) |
c73964b2 | 2271 | { |
5bd61841 MM |
2272 | conversion *t; |
2273 | conversion **convs; | |
2274 | size_t num_convs; | |
c73964b2 | 2275 | int viable = 1, i; |
c73964b2 | 2276 | tree types[2]; |
feb6efc1 | 2277 | struct rejection_reason *reason = NULL; |
c73964b2 MS |
2278 | |
2279 | types[0] = type1; | |
2280 | types[1] = type2; | |
2281 | ||
5bd61841 MM |
2282 | num_convs = args[2] ? 3 : (args[1] ? 2 : 1); |
2283 | convs = alloc_conversions (num_convs); | |
1dad57e6 JM |
2284 | |
2285 | /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit | |
2286 | conversion ops are allowed. We handle that here by just checking for | |
2287 | boolean_type_node because other operators don't ask for it. COND_EXPR | |
2288 | also does contextual conversion to bool for the first operand, but we | |
2289 | handle that in build_conditional_expr, and type1 here is operand 2. */ | |
2290 | if (type1 != boolean_type_node) | |
2291 | flags |= LOOKUP_ONLYCONVERTING; | |
c73964b2 MS |
2292 | |
2293 | for (i = 0; i < 2; ++i) | |
2294 | { | |
2295 | if (! args[i]) | |
2296 | break; | |
2297 | ||
aa7349eb | 2298 | t = implicit_conversion (types[i], argtypes[i], args[i], |
b40e334f | 2299 | /*c_cast_p=*/false, flags, complain); |
c73964b2 MS |
2300 | if (! t) |
2301 | { | |
2302 | viable = 0; | |
2303 | /* We need something for printing the candidate. */ | |
5bd61841 | 2304 | t = build_identity_conv (types[i], NULL_TREE); |
b40e334f PC |
2305 | reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i], |
2306 | types[i]); | |
c73964b2 | 2307 | } |
5bd61841 | 2308 | else if (t->bad_p) |
feb6efc1 NF |
2309 | { |
2310 | viable = 0; | |
89606913 | 2311 | reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i], |
b40e334f | 2312 | types[i]); |
feb6efc1 | 2313 | } |
5bd61841 | 2314 | convs[i] = t; |
c73964b2 MS |
2315 | } |
2316 | ||
2317 | /* For COND_EXPR we rearranged the arguments; undo that now. */ | |
2318 | if (args[2]) | |
2319 | { | |
5bd61841 MM |
2320 | convs[2] = convs[1]; |
2321 | convs[1] = convs[0]; | |
aa7349eb | 2322 | t = implicit_conversion (boolean_type_node, argtypes[2], args[2], |
b40e334f PC |
2323 | /*c_cast_p=*/false, flags, |
2324 | complain); | |
c73964b2 | 2325 | if (t) |
5bd61841 | 2326 | convs[0] = t; |
c73964b2 | 2327 | else |
feb6efc1 NF |
2328 | { |
2329 | viable = 0; | |
2330 | reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2], | |
2331 | boolean_type_node); | |
2332 | } | |
c8094d83 | 2333 | } |
c73964b2 | 2334 | |
c166b898 | 2335 | add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL, |
c8094d83 | 2336 | num_convs, convs, |
7993382e MM |
2337 | /*access_path=*/NULL_TREE, |
2338 | /*conversion_path=*/NULL_TREE, | |
4561285b | 2339 | viable, reason, flags); |
c73964b2 MS |
2340 | } |
2341 | ||
94be8403 GDR |
2342 | static bool |
2343 | is_complete (tree t) | |
c73964b2 | 2344 | { |
d0f062fb | 2345 | return COMPLETE_TYPE_P (complete_type (t)); |
c73964b2 MS |
2346 | } |
2347 | ||
838dfd8a | 2348 | /* Returns nonzero if TYPE is a promoted arithmetic type. */ |
a7a64a77 | 2349 | |
94be8403 GDR |
2350 | static bool |
2351 | promoted_arithmetic_type_p (tree type) | |
a7a64a77 MM |
2352 | { |
2353 | /* [over.built] | |
2354 | ||
2355 | In this section, the term promoted integral type is used to refer | |
2356 | to those integral types which are preserved by integral promotion | |
2357 | (including e.g. int and long but excluding e.g. char). | |
2358 | Similarly, the term promoted arithmetic type refers to promoted | |
2359 | integral types plus floating types. */ | |
550a799d | 2360 | return ((CP_INTEGRAL_TYPE_P (type) |
a7a64a77 MM |
2361 | && same_type_p (type_promotes_to (type), type)) |
2362 | || TREE_CODE (type) == REAL_TYPE); | |
2363 | } | |
2364 | ||
c73964b2 MS |
2365 | /* Create any builtin operator overload candidates for the operator in |
2366 | question given the converted operand types TYPE1 and TYPE2. The other | |
2367 | args are passed through from add_builtin_candidates to | |
c8094d83 MS |
2368 | build_builtin_candidate. |
2369 | ||
2370 | TYPE1 and TYPE2 may not be permissible, and we must filter them. | |
4cff6abe NS |
2371 | If CODE is requires candidates operands of the same type of the kind |
2372 | of which TYPE1 and TYPE2 are, we add both candidates | |
2373 | CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */ | |
c73964b2 | 2374 | |
7993382e MM |
2375 | static void |
2376 | add_builtin_candidate (struct z_candidate **candidates, enum tree_code code, | |
0cbd7506 | 2377 | enum tree_code code2, tree fnname, tree type1, |
b40e334f PC |
2378 | tree type2, tree *args, tree *argtypes, int flags, |
2379 | tsubst_flags_t complain) | |
c73964b2 MS |
2380 | { |
2381 | switch (code) | |
2382 | { | |
2383 | case POSTINCREMENT_EXPR: | |
2384 | case POSTDECREMENT_EXPR: | |
2385 | args[1] = integer_zero_node; | |
2386 | type2 = integer_type_node; | |
7f85441b KG |
2387 | break; |
2388 | default: | |
2389 | break; | |
c73964b2 MS |
2390 | } |
2391 | ||
2392 | switch (code) | |
2393 | { | |
2394 | ||
2395 | /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type, | |
2396 | and VQ is either volatile or empty, there exist candidate operator | |
2397 | functions of the form | |
2398 | VQ T& operator++(VQ T&); | |
2399 | T operator++(VQ T&, int); | |
2400 | 5 For every pair T, VQ), where T is an enumeration type or an arithmetic | |
2401 | type other than bool, and VQ is either volatile or empty, there exist | |
2402 | candidate operator functions of the form | |
2403 | VQ T& operator--(VQ T&); | |
2404 | T operator--(VQ T&, int); | |
2405 | 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified | |
2406 | complete object type, and VQ is either volatile or empty, there exist | |
2407 | candidate operator functions of the form | |
2408 | T*VQ& operator++(T*VQ&); | |
2409 | T*VQ& operator--(T*VQ&); | |
2410 | T* operator++(T*VQ&, int); | |
2411 | T* operator--(T*VQ&, int); */ | |
2412 | ||
2413 | case POSTDECREMENT_EXPR: | |
2414 | case PREDECREMENT_EXPR: | |
2415 | if (TREE_CODE (type1) == BOOLEAN_TYPE) | |
7993382e | 2416 | return; |
c73964b2 MS |
2417 | case POSTINCREMENT_EXPR: |
2418 | case PREINCREMENT_EXPR: | |
4cff6abe | 2419 | if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1)) |
c73964b2 MS |
2420 | { |
2421 | type1 = build_reference_type (type1); | |
2422 | break; | |
2423 | } | |
7993382e | 2424 | return; |
c73964b2 | 2425 | |
b057bff4 | 2426 | /* 7 For every cv-qualified or cv-unqualified object type T, there |
c73964b2 MS |
2427 | exist candidate operator functions of the form |
2428 | ||
2429 | T& operator*(T*); | |
2430 | ||
2431 | 8 For every function type T, there exist candidate operator functions of | |
2432 | the form | |
2433 | T& operator*(T*); */ | |
2434 | ||
2435 | case INDIRECT_REF: | |
50e10fa8 | 2436 | if (TYPE_PTR_P (type1) |
c11b6f21 | 2437 | && (TYPE_PTROB_P (type1) |
c73964b2 MS |
2438 | || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)) |
2439 | break; | |
c8094d83 | 2440 | return; |
c73964b2 MS |
2441 | |
2442 | /* 9 For every type T, there exist candidate operator functions of the form | |
2443 | T* operator+(T*); | |
2444 | ||
2445 | 10For every promoted arithmetic type T, there exist candidate operator | |
2446 | functions of the form | |
2447 | T operator+(T); | |
2448 | T operator-(T); */ | |
2449 | ||
392e3d51 | 2450 | case UNARY_PLUS_EXPR: /* unary + */ |
50e10fa8 | 2451 | if (TYPE_PTR_P (type1)) |
c73964b2 MS |
2452 | break; |
2453 | case NEGATE_EXPR: | |
2454 | if (ARITHMETIC_TYPE_P (type1)) | |
2455 | break; | |
7993382e | 2456 | return; |
c73964b2 MS |
2457 | |
2458 | /* 11For every promoted integral type T, there exist candidate operator | |
2459 | functions of the form | |
2460 | T operator~(T); */ | |
2461 | ||
2462 | case BIT_NOT_EXPR: | |
550a799d | 2463 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1)) |
c73964b2 | 2464 | break; |
7993382e | 2465 | return; |
c73964b2 MS |
2466 | |
2467 | /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1 | |
2468 | is the same type as C2 or is a derived class of C2, T is a complete | |
2469 | object type or a function type, and CV1 and CV2 are cv-qualifier-seqs, | |
2470 | there exist candidate operator functions of the form | |
2471 | CV12 T& operator->*(CV1 C1*, CV2 T C2::*); | |
2472 | where CV12 is the union of CV1 and CV2. */ | |
2473 | ||
2474 | case MEMBER_REF: | |
50e10fa8 | 2475 | if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2)) |
c73964b2 MS |
2476 | { |
2477 | tree c1 = TREE_TYPE (type1); | |
a5ac359a | 2478 | tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2); |
c73964b2 | 2479 | |
9e1e64ec | 2480 | if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1) |
c73964b2 | 2481 | && (TYPE_PTRMEMFUNC_P (type2) |
796cccfc | 2482 | || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2)))) |
c73964b2 MS |
2483 | break; |
2484 | } | |
7993382e | 2485 | return; |
c73964b2 MS |
2486 | |
2487 | /* 13For every pair of promoted arithmetic types L and R, there exist can- | |
2488 | didate operator functions of the form | |
2489 | LR operator*(L, R); | |
2490 | LR operator/(L, R); | |
2491 | LR operator+(L, R); | |
2492 | LR operator-(L, R); | |
2493 | bool operator<(L, R); | |
2494 | bool operator>(L, R); | |
2495 | bool operator<=(L, R); | |
2496 | bool operator>=(L, R); | |
2497 | bool operator==(L, R); | |
2498 | bool operator!=(L, R); | |
2499 | where LR is the result of the usual arithmetic conversions between | |
2500 | types L and R. | |
2501 | ||
2502 | 14For every pair of types T and I, where T is a cv-qualified or cv- | |
2503 | unqualified complete object type and I is a promoted integral type, | |
2504 | there exist candidate operator functions of the form | |
2505 | T* operator+(T*, I); | |
2506 | T& operator[](T*, I); | |
2507 | T* operator-(T*, I); | |
2508 | T* operator+(I, T*); | |
2509 | T& operator[](I, T*); | |
2510 | ||
2511 | 15For every T, where T is a pointer to complete object type, there exist | |
2512 | candidate operator functions of the form112) | |
2513 | ptrdiff_t operator-(T, T); | |
2514 | ||
e5596aef | 2515 | 16For every pointer or enumeration type T, there exist candidate operator |
4cff6abe | 2516 | functions of the form |
c73964b2 MS |
2517 | bool operator<(T, T); |
2518 | bool operator>(T, T); | |
2519 | bool operator<=(T, T); | |
2520 | bool operator>=(T, T); | |
2521 | bool operator==(T, T); | |
2522 | bool operator!=(T, T); | |
2523 | ||
2524 | 17For every pointer to member type T, there exist candidate operator | |
2525 | functions of the form | |
2526 | bool operator==(T, T); | |
2527 | bool operator!=(T, T); */ | |
2528 | ||
2529 | case MINUS_EXPR: | |
c11b6f21 | 2530 | if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2)) |
c73964b2 | 2531 | break; |
550a799d JM |
2532 | if (TYPE_PTROB_P (type1) |
2533 | && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) | |
c73964b2 MS |
2534 | { |
2535 | type2 = ptrdiff_type_node; | |
2536 | break; | |
2537 | } | |
2538 | case MULT_EXPR: | |
2539 | case TRUNC_DIV_EXPR: | |
2540 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2541 | break; | |
7993382e | 2542 | return; |
c73964b2 MS |
2543 | |
2544 | case EQ_EXPR: | |
2545 | case NE_EXPR: | |
a703fb38 | 2546 | if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2)) |
66b1156a | 2547 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))) |
c73964b2 | 2548 | break; |
66b1156a | 2549 | if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1])) |
c73964b2 MS |
2550 | { |
2551 | type2 = type1; | |
2552 | break; | |
2553 | } | |
66b1156a | 2554 | if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0])) |
c73964b2 MS |
2555 | { |
2556 | type1 = type2; | |
2557 | break; | |
2558 | } | |
f4f206f4 | 2559 | /* Fall through. */ |
c73964b2 MS |
2560 | case LT_EXPR: |
2561 | case GT_EXPR: | |
2562 | case LE_EXPR: | |
2563 | case GE_EXPR: | |
2564 | case MAX_EXPR: | |
2565 | case MIN_EXPR: | |
4cff6abe | 2566 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) |
0cbd7506 | 2567 | break; |
4cff6abe | 2568 | if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
c73964b2 | 2569 | break; |
7b5d1e27 MM |
2570 | if (TREE_CODE (type1) == ENUMERAL_TYPE |
2571 | && TREE_CODE (type2) == ENUMERAL_TYPE) | |
0cbd7506 | 2572 | break; |
7b5d1e27 | 2573 | if (TYPE_PTR_P (type1) |
3c4e06c2 | 2574 | && null_ptr_cst_p (args[1])) |
c73964b2 MS |
2575 | { |
2576 | type2 = type1; | |
2577 | break; | |
2578 | } | |
7b5d1e27 | 2579 | if (null_ptr_cst_p (args[0]) |
3c4e06c2 | 2580 | && TYPE_PTR_P (type2)) |
c73964b2 MS |
2581 | { |
2582 | type1 = type2; | |
2583 | break; | |
2584 | } | |
7993382e | 2585 | return; |
c73964b2 MS |
2586 | |
2587 | case PLUS_EXPR: | |
2588 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2589 | break; | |
2590 | case ARRAY_REF: | |
550a799d | 2591 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2)) |
c73964b2 MS |
2592 | { |
2593 | type1 = ptrdiff_type_node; | |
2594 | break; | |
2595 | } | |
550a799d | 2596 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 MS |
2597 | { |
2598 | type2 = ptrdiff_type_node; | |
2599 | break; | |
2600 | } | |
7993382e | 2601 | return; |
c73964b2 MS |
2602 | |
2603 | /* 18For every pair of promoted integral types L and R, there exist candi- | |
2604 | date operator functions of the form | |
2605 | LR operator%(L, R); | |
2606 | LR operator&(L, R); | |
2607 | LR operator^(L, R); | |
2608 | LR operator|(L, R); | |
2609 | L operator<<(L, R); | |
2610 | L operator>>(L, R); | |
2611 | where LR is the result of the usual arithmetic conversions between | |
2612 | types L and R. */ | |
2613 | ||
2614 | case TRUNC_MOD_EXPR: | |
2615 | case BIT_AND_EXPR: | |
2616 | case BIT_IOR_EXPR: | |
2617 | case BIT_XOR_EXPR: | |
2618 | case LSHIFT_EXPR: | |
2619 | case RSHIFT_EXPR: | |
550a799d | 2620 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 | 2621 | break; |
7993382e | 2622 | return; |
c73964b2 MS |
2623 | |
2624 | /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration | |
2625 | type, VQ is either volatile or empty, and R is a promoted arithmetic | |
2626 | type, there exist candidate operator functions of the form | |
2627 | VQ L& operator=(VQ L&, R); | |
2628 | VQ L& operator*=(VQ L&, R); | |
2629 | VQ L& operator/=(VQ L&, R); | |
2630 | VQ L& operator+=(VQ L&, R); | |
2631 | VQ L& operator-=(VQ L&, R); | |
2632 | ||
2633 | 20For every pair T, VQ), where T is any type and VQ is either volatile | |
2634 | or empty, there exist candidate operator functions of the form | |
2635 | T*VQ& operator=(T*VQ&, T*); | |
2636 | ||
2637 | 21For every pair T, VQ), where T is a pointer to member type and VQ is | |
2638 | either volatile or empty, there exist candidate operator functions of | |
2639 | the form | |
2640 | VQ T& operator=(VQ T&, T); | |
2641 | ||
2642 | 22For every triple T, VQ, I), where T is a cv-qualified or cv- | |
2643 | unqualified complete object type, VQ is either volatile or empty, and | |
2644 | I is a promoted integral type, there exist candidate operator func- | |
2645 | tions of the form | |
2646 | T*VQ& operator+=(T*VQ&, I); | |
2647 | T*VQ& operator-=(T*VQ&, I); | |
2648 | ||
2649 | 23For every triple L, VQ, R), where L is an integral or enumeration | |
2650 | type, VQ is either volatile or empty, and R is a promoted integral | |
2651 | type, there exist candidate operator functions of the form | |
2652 | ||
2653 | VQ L& operator%=(VQ L&, R); | |
2654 | VQ L& operator<<=(VQ L&, R); | |
2655 | VQ L& operator>>=(VQ L&, R); | |
2656 | VQ L& operator&=(VQ L&, R); | |
2657 | VQ L& operator^=(VQ L&, R); | |
2658 | VQ L& operator|=(VQ L&, R); */ | |
2659 | ||
2660 | case MODIFY_EXPR: | |
2661 | switch (code2) | |
2662 | { | |
2663 | case PLUS_EXPR: | |
2664 | case MINUS_EXPR: | |
550a799d | 2665 | if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 MS |
2666 | { |
2667 | type2 = ptrdiff_type_node; | |
2668 | break; | |
2669 | } | |
2670 | case MULT_EXPR: | |
2671 | case TRUNC_DIV_EXPR: | |
2672 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2673 | break; | |
7993382e | 2674 | return; |
c73964b2 MS |
2675 | |
2676 | case TRUNC_MOD_EXPR: | |
2677 | case BIT_AND_EXPR: | |
2678 | case BIT_IOR_EXPR: | |
2679 | case BIT_XOR_EXPR: | |
2680 | case LSHIFT_EXPR: | |
2681 | case RSHIFT_EXPR: | |
550a799d | 2682 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2)) |
c73964b2 | 2683 | break; |
7993382e | 2684 | return; |
c73964b2 MS |
2685 | |
2686 | case NOP_EXPR: | |
2687 | if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2)) | |
2688 | break; | |
2689 | if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2)) | |
2690 | || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) | |
66b1156a | 2691 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
c73964b2 | 2692 | || ((TYPE_PTRMEMFUNC_P (type1) |
50e10fa8 | 2693 | || TYPE_PTR_P (type1)) |
c73964b2 MS |
2694 | && null_ptr_cst_p (args[1]))) |
2695 | { | |
2696 | type2 = type1; | |
2697 | break; | |
2698 | } | |
7993382e | 2699 | return; |
c73964b2 MS |
2700 | |
2701 | default: | |
8dc2b103 | 2702 | gcc_unreachable (); |
c73964b2 MS |
2703 | } |
2704 | type1 = build_reference_type (type1); | |
2705 | break; | |
2706 | ||
2707 | case COND_EXPR: | |
5b0c5896 | 2708 | /* [over.built] |
a7a64a77 MM |
2709 | |
2710 | For every pair of promoted arithmetic types L and R, there | |
c8094d83 | 2711 | exist candidate operator functions of the form |
de22184b | 2712 | |
c8094d83 | 2713 | LR operator?(bool, L, R); |
a7a64a77 MM |
2714 | |
2715 | where LR is the result of the usual arithmetic conversions | |
2716 | between types L and R. | |
2717 | ||
2718 | For every type T, where T is a pointer or pointer-to-member | |
2719 | type, there exist candidate operator functions of the form T | |
2720 | operator?(bool, T, T); */ | |
2721 | ||
2722 | if (promoted_arithmetic_type_p (type1) | |
2723 | && promoted_arithmetic_type_p (type2)) | |
2724 | /* That's OK. */ | |
c73964b2 | 2725 | break; |
a7a64a77 MM |
2726 | |
2727 | /* Otherwise, the types should be pointers. */ | |
66b1156a | 2728 | if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2)) |
7993382e | 2729 | return; |
c8094d83 | 2730 | |
a7a64a77 MM |
2731 | /* We don't check that the two types are the same; the logic |
2732 | below will actually create two candidates; one in which both | |
2733 | parameter types are TYPE1, and one in which both parameter | |
2734 | types are TYPE2. */ | |
7993382e | 2735 | break; |
c73964b2 | 2736 | |
6add7e94 PC |
2737 | case REALPART_EXPR: |
2738 | case IMAGPART_EXPR: | |
2739 | if (ARITHMETIC_TYPE_P (type1)) | |
2740 | break; | |
2741 | return; | |
2742 | ||
c73964b2 | 2743 | default: |
8dc2b103 | 2744 | gcc_unreachable (); |
c73964b2 MS |
2745 | } |
2746 | ||
3c4e06c2 JM |
2747 | /* Make sure we don't create builtin candidates with dependent types. */ |
2748 | bool u1 = uses_template_parms (type1); | |
2749 | bool u2 = type2 ? uses_template_parms (type2) : false; | |
2750 | if (u1 || u2) | |
2751 | { | |
2752 | /* Try to recover if one of the types is non-dependent. But if | |
2753 | there's only one type, there's nothing we can do. */ | |
2754 | if (!type2) | |
2755 | return; | |
2756 | /* And we lose if both are dependent. */ | |
2757 | if (u1 && u2) | |
2758 | return; | |
2759 | /* Or if they have different forms. */ | |
2760 | if (TREE_CODE (type1) != TREE_CODE (type2)) | |
2761 | return; | |
2762 | ||
2763 | if (u1 && !u2) | |
2764 | type1 = type2; | |
2765 | else if (u2 && !u1) | |
2766 | type2 = type1; | |
2767 | } | |
2768 | ||
4cff6abe NS |
2769 | /* If we're dealing with two pointer types or two enumeral types, |
2770 | we need candidates for both of them. */ | |
a7a64a77 | 2771 | if (type2 && !same_type_p (type1, type2) |
c73964b2 MS |
2772 | && TREE_CODE (type1) == TREE_CODE (type2) |
2773 | && (TREE_CODE (type1) == REFERENCE_TYPE | |
a5ac359a | 2774 | || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2)) |
66b1156a | 2775 | || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)) |
c73964b2 | 2776 | || TYPE_PTRMEMFUNC_P (type1) |
9e1e64ec | 2777 | || MAYBE_CLASS_TYPE_P (type1) |
4cff6abe | 2778 | || TREE_CODE (type1) == ENUMERAL_TYPE)) |
c73964b2 | 2779 | { |
66b1156a | 2780 | if (TYPE_PTR_OR_PTRMEM_P (type1)) |
008d5fcc PC |
2781 | { |
2782 | tree cptype = composite_pointer_type (type1, type2, | |
2783 | error_mark_node, | |
2784 | error_mark_node, | |
2785 | CPO_CONVERSION, | |
2786 | tf_none); | |
2787 | if (cptype != error_mark_node) | |
2788 | { | |
2789 | build_builtin_candidate | |
b40e334f PC |
2790 | (candidates, fnname, cptype, cptype, args, argtypes, |
2791 | flags, complain); | |
008d5fcc PC |
2792 | return; |
2793 | } | |
2794 | } | |
2795 | ||
7993382e | 2796 | build_builtin_candidate |
b40e334f | 2797 | (candidates, fnname, type1, type1, args, argtypes, flags, complain); |
7993382e | 2798 | build_builtin_candidate |
b40e334f | 2799 | (candidates, fnname, type2, type2, args, argtypes, flags, complain); |
7993382e | 2800 | return; |
c73964b2 MS |
2801 | } |
2802 | ||
7993382e | 2803 | build_builtin_candidate |
b40e334f | 2804 | (candidates, fnname, type1, type2, args, argtypes, flags, complain); |
c73964b2 MS |
2805 | } |
2806 | ||
2807 | tree | |
94be8403 | 2808 | type_decays_to (tree type) |
c73964b2 MS |
2809 | { |
2810 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2811 | return build_pointer_type (TREE_TYPE (type)); | |
2812 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
2813 | return build_pointer_type (type); | |
2814 | return type; | |
2815 | } | |
2816 | ||
2817 | /* There are three conditions of builtin candidates: | |
2818 | ||
2819 | 1) bool-taking candidates. These are the same regardless of the input. | |
2820 | 2) pointer-pair taking candidates. These are generated for each type | |
2821 | one of the input types converts to. | |
cab1f180 | 2822 | 3) arithmetic candidates. According to the standard, we should generate |
4cff6abe | 2823 | all of these, but I'm trying not to... |
c8094d83 | 2824 | |
4cff6abe NS |
2825 | Here we generate a superset of the possible candidates for this particular |
2826 | case. That is a subset of the full set the standard defines, plus some | |
2827 | other cases which the standard disallows. add_builtin_candidate will | |
0e339752 | 2828 | filter out the invalid set. */ |
c73964b2 | 2829 | |
7993382e MM |
2830 | static void |
2831 | add_builtin_candidates (struct z_candidate **candidates, enum tree_code code, | |
0cbd7506 | 2832 | enum tree_code code2, tree fnname, tree *args, |
b40e334f | 2833 | int flags, tsubst_flags_t complain) |
c73964b2 MS |
2834 | { |
2835 | int ref1, i; | |
4cff6abe | 2836 | int enum_p = 0; |
bfc48cd8 | 2837 | tree type, argtypes[3], t; |
a7a64a77 | 2838 | /* TYPES[i] is the set of possible builtin-operator parameter types |
bfc48cd8 | 2839 | we will consider for the Ith argument. */ |
9771b263 | 2840 | vec<tree, va_gc> *types[2]; |
bfc48cd8 | 2841 | unsigned ix; |
c73964b2 MS |
2842 | |
2843 | for (i = 0; i < 3; ++i) | |
2844 | { | |
2845 | if (args[i]) | |
24030e4c | 2846 | argtypes[i] = unlowered_expr_type (args[i]); |
c73964b2 MS |
2847 | else |
2848 | argtypes[i] = NULL_TREE; | |
2849 | } | |
2850 | ||
2851 | switch (code) | |
2852 | { | |
2853 | /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type, | |
2854 | and VQ is either volatile or empty, there exist candidate operator | |
2855 | functions of the form | |
2856 | VQ T& operator++(VQ T&); */ | |
2857 | ||
2858 | case POSTINCREMENT_EXPR: | |
2859 | case PREINCREMENT_EXPR: | |
2860 | case POSTDECREMENT_EXPR: | |
2861 | case PREDECREMENT_EXPR: | |
2862 | case MODIFY_EXPR: | |
2863 | ref1 = 1; | |
2864 | break; | |
2865 | ||
2866 | /* 24There also exist candidate operator functions of the form | |
2867 | bool operator!(bool); | |
2868 | bool operator&&(bool, bool); | |
2869 | bool operator||(bool, bool); */ | |
2870 | ||
2871 | case TRUTH_NOT_EXPR: | |
7993382e | 2872 | build_builtin_candidate |
c73964b2 | 2873 | (candidates, fnname, boolean_type_node, |
b40e334f | 2874 | NULL_TREE, args, argtypes, flags, complain); |
7993382e | 2875 | return; |
c73964b2 MS |
2876 | |
2877 | case TRUTH_ORIF_EXPR: | |
2878 | case TRUTH_ANDIF_EXPR: | |
7993382e | 2879 | build_builtin_candidate |
c73964b2 | 2880 | (candidates, fnname, boolean_type_node, |
b40e334f | 2881 | boolean_type_node, args, argtypes, flags, complain); |
7993382e | 2882 | return; |
c73964b2 MS |
2883 | |
2884 | case ADDR_EXPR: | |
2885 | case COMPOUND_EXPR: | |
2886 | case COMPONENT_REF: | |
7993382e | 2887 | return; |
c73964b2 | 2888 | |
4cff6abe NS |
2889 | case COND_EXPR: |
2890 | case EQ_EXPR: | |
2891 | case NE_EXPR: | |
2892 | case LT_EXPR: | |
2893 | case LE_EXPR: | |
2894 | case GT_EXPR: | |
2895 | case GE_EXPR: | |
2896 | enum_p = 1; | |
f4f206f4 | 2897 | /* Fall through. */ |
c8094d83 | 2898 | |
c73964b2 MS |
2899 | default: |
2900 | ref1 = 0; | |
2901 | } | |
2902 | ||
bfc48cd8 NF |
2903 | types[0] = make_tree_vector (); |
2904 | types[1] = make_tree_vector (); | |
c73964b2 MS |
2905 | |
2906 | for (i = 0; i < 2; ++i) | |
2907 | { | |
2908 | if (! args[i]) | |
2909 | ; | |
9e1e64ec | 2910 | else if (MAYBE_CLASS_TYPE_P (argtypes[i])) |
c73964b2 | 2911 | { |
47898a19 | 2912 | tree convs; |
c73964b2 | 2913 | |
02020185 | 2914 | if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR) |
7993382e | 2915 | return; |
02020185 | 2916 | |
9c7d5cae | 2917 | convs = lookup_conversions (argtypes[i]); |
02020185 | 2918 | |
c73964b2 MS |
2919 | if (code == COND_EXPR) |
2920 | { | |
2921 | if (real_lvalue_p (args[i])) | |
9771b263 | 2922 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
c73964b2 | 2923 | |
9771b263 | 2924 | vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i])); |
c73964b2 | 2925 | } |
02020185 JM |
2926 | |
2927 | else if (! convs) | |
7993382e | 2928 | return; |
c73964b2 MS |
2929 | |
2930 | for (; convs; convs = TREE_CHAIN (convs)) | |
2931 | { | |
e57d93c6 | 2932 | type = TREE_TYPE (convs); |
c73964b2 MS |
2933 | |
2934 | if (i == 0 && ref1 | |
2935 | && (TREE_CODE (type) != REFERENCE_TYPE | |
91063b51 | 2936 | || CP_TYPE_CONST_P (TREE_TYPE (type)))) |
c73964b2 MS |
2937 | continue; |
2938 | ||
2939 | if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE) | |
9771b263 | 2940 | vec_safe_push (types[i], type); |
c73964b2 MS |
2941 | |
2942 | type = non_reference (type); | |
2943 | if (i != 0 || ! ref1) | |
2944 | { | |
ccaff498 | 2945 | type = cv_unqualified (type_decays_to (type)); |
0cbd7506 | 2946 | if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE) |
9771b263 | 2947 | vec_safe_push (types[i], type); |
550a799d | 2948 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
c73964b2 MS |
2949 | type = type_promotes_to (type); |
2950 | } | |
2951 | ||
bfc48cd8 | 2952 | if (! vec_member (type, types[i])) |
9771b263 | 2953 | vec_safe_push (types[i], type); |
c73964b2 MS |
2954 | } |
2955 | } | |
2956 | else | |
2957 | { | |
2958 | if (code == COND_EXPR && real_lvalue_p (args[i])) | |
9771b263 | 2959 | vec_safe_push (types[i], build_reference_type (argtypes[i])); |
c73964b2 MS |
2960 | type = non_reference (argtypes[i]); |
2961 | if (i != 0 || ! ref1) | |
2962 | { | |
ccaff498 | 2963 | type = cv_unqualified (type_decays_to (type)); |
550a799d | 2964 | if (enum_p && UNSCOPED_ENUM_P (type)) |
9771b263 | 2965 | vec_safe_push (types[i], type); |
550a799d | 2966 | if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
c73964b2 MS |
2967 | type = type_promotes_to (type); |
2968 | } | |
9771b263 | 2969 | vec_safe_push (types[i], type); |
c73964b2 MS |
2970 | } |
2971 | } | |
2972 | ||
a7a64a77 MM |
2973 | /* Run through the possible parameter types of both arguments, |
2974 | creating candidates with those parameter types. */ | |
9771b263 | 2975 | FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t) |
c73964b2 | 2976 | { |
bfc48cd8 NF |
2977 | unsigned jx; |
2978 | tree u; | |
2979 | ||
9771b263 DN |
2980 | if (!types[1]->is_empty ()) |
2981 | FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u) | |
7993382e | 2982 | add_builtin_candidate |
bfc48cd8 | 2983 | (candidates, code, code2, fnname, t, |
b40e334f | 2984 | u, args, argtypes, flags, complain); |
c73964b2 | 2985 | else |
7993382e | 2986 | add_builtin_candidate |
bfc48cd8 | 2987 | (candidates, code, code2, fnname, t, |
b40e334f | 2988 | NULL_TREE, args, argtypes, flags, complain); |
c73964b2 | 2989 | } |
bfc48cd8 NF |
2990 | |
2991 | release_tree_vector (types[0]); | |
2992 | release_tree_vector (types[1]); | |
c73964b2 MS |
2993 | } |
2994 | ||
e1467ff2 | 2995 | |
386b8a85 JM |
2996 | /* If TMPL can be successfully instantiated as indicated by |
2997 | EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES. | |
2998 | ||
e1467ff2 MM |
2999 | TMPL is the template. EXPLICIT_TARGS are any explicit template |
3000 | arguments. ARGLIST is the arguments provided at the call-site. | |
c166b898 ILT |
3001 | This does not change ARGLIST. The RETURN_TYPE is the desired type |
3002 | for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are | |
3003 | as for add_function_candidate. If an OBJ is supplied, FLAGS and | |
3004 | CTYPE are ignored, and OBJ is as for add_conv_candidate. */ | |
e1467ff2 MM |
3005 | |
3006 | static struct z_candidate* | |
7993382e | 3007 | add_template_candidate_real (struct z_candidate **candidates, tree tmpl, |
c166b898 | 3008 | tree ctype, tree explicit_targs, tree first_arg, |
9771b263 | 3009 | const vec<tree, va_gc> *arglist, tree return_type, |
c166b898 | 3010 | tree access_path, tree conversion_path, |
b40e334f PC |
3011 | int flags, tree obj, unification_kind_t strict, |
3012 | tsubst_flags_t complain) | |
c73964b2 | 3013 | { |
98c1c668 | 3014 | int ntparms = DECL_NTPARMS (tmpl); |
f31c0a32 | 3015 | tree targs = make_tree_vec (ntparms); |
9771b263 | 3016 | unsigned int len = vec_safe_length (arglist); |
9c39ceab PC |
3017 | unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len; |
3018 | unsigned int skip_without_in_chrg = 0; | |
3019 | tree first_arg_without_in_chrg = first_arg; | |
c166b898 ILT |
3020 | tree *args_without_in_chrg; |
3021 | unsigned int nargs_without_in_chrg; | |
3022 | unsigned int ia, ix; | |
3023 | tree arg; | |
c73964b2 | 3024 | struct z_candidate *cand; |
c73964b2 | 3025 | tree fn; |
feb6efc1 | 3026 | struct rejection_reason *reason = NULL; |
3d2f6864 | 3027 | int errs; |
c73964b2 | 3028 | |
e5214479 JM |
3029 | /* We don't do deduction on the in-charge parameter, the VTT |
3030 | parameter or 'this'. */ | |
3031 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl)) | |
c166b898 ILT |
3032 | { |
3033 | if (first_arg_without_in_chrg != NULL_TREE) | |
3034 | first_arg_without_in_chrg = NULL_TREE; | |
3035 | else | |
3036 | ++skip_without_in_chrg; | |
3037 | } | |
e5214479 | 3038 | |
71a19881 MM |
3039 | if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl) |
3040 | || DECL_BASE_CONSTRUCTOR_P (tmpl)) | |
5775a06a | 3041 | && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl))) |
c166b898 ILT |
3042 | { |
3043 | if (first_arg_without_in_chrg != NULL_TREE) | |
3044 | first_arg_without_in_chrg = NULL_TREE; | |
3045 | else | |
3046 | ++skip_without_in_chrg; | |
3047 | } | |
3048 | ||
9c39ceab PC |
3049 | if (len < skip_without_in_chrg) |
3050 | return NULL; | |
3051 | ||
c166b898 | 3052 | nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0) |
9c39ceab | 3053 | + (len - skip_without_in_chrg)); |
c166b898 ILT |
3054 | args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg); |
3055 | ia = 0; | |
3056 | if (first_arg_without_in_chrg != NULL_TREE) | |
3057 | { | |
3058 | args_without_in_chrg[ia] = first_arg_without_in_chrg; | |
3059 | ++ia; | |
3060 | } | |
3061 | for (ix = skip_without_in_chrg; | |
9771b263 | 3062 | vec_safe_iterate (arglist, ix, &arg); |
c166b898 ILT |
3063 | ++ix) |
3064 | { | |
3065 | args_without_in_chrg[ia] = arg; | |
3066 | ++ia; | |
3067 | } | |
3068 | gcc_assert (ia == nargs_without_in_chrg); | |
71a19881 | 3069 | |
3d2f6864 | 3070 | errs = errorcount+sorrycount; |
cd057e3a JM |
3071 | fn = fn_type_unification (tmpl, explicit_targs, targs, |
3072 | args_without_in_chrg, | |
3073 | nargs_without_in_chrg, | |
2b24855e JM |
3074 | return_type, strict, flags, false, |
3075 | complain & tf_decltype); | |
98c1c668 | 3076 | |
cd057e3a | 3077 | if (fn == error_mark_node) |
3d2f6864 NF |
3078 | { |
3079 | /* Don't repeat unification later if it already resulted in errors. */ | |
3080 | if (errorcount+sorrycount == errs) | |
3081 | reason = template_unification_rejection (tmpl, explicit_targs, | |
3082 | targs, args_without_in_chrg, | |
3083 | nargs_without_in_chrg, | |
3084 | return_type, strict, flags); | |
3085 | else | |
3086 | reason = template_unification_error_rejection (); | |
3087 | goto fail; | |
3088 | } | |
c73964b2 | 3089 | |
9928a3d5 MM |
3090 | /* In [class.copy]: |
3091 | ||
3092 | A member function template is never instantiated to perform the | |
c8094d83 | 3093 | copy of a class object to an object of its class type. |
9928a3d5 MM |
3094 | |
3095 | It's a little unclear what this means; the standard explicitly | |
3096 | does allow a template to be used to copy a class. For example, | |
3097 | in: | |
3098 | ||
3099 | struct A { | |
0cbd7506 | 3100 | A(A&); |
9928a3d5 MM |
3101 | template <class T> A(const T&); |
3102 | }; | |
3103 | const A f (); | |
3104 | void g () { A a (f ()); } | |
c8094d83 | 3105 | |
9928a3d5 MM |
3106 | the member template will be used to make the copy. The section |
3107 | quoted above appears in the paragraph that forbids constructors | |
3108 | whose only parameter is (a possibly cv-qualified variant of) the | |
3109 | class type, and a logical interpretation is that the intent was | |
3110 | to forbid the instantiation of member templates which would then | |
3111 | have that form. */ | |
c166b898 | 3112 | if (DECL_CONSTRUCTOR_P (fn) && nargs == 2) |
9928a3d5 MM |
3113 | { |
3114 | tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
3115 | if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)), | |
3116 | ctype)) | |
3d2f6864 NF |
3117 | { |
3118 | reason = invalid_copy_with_fn_template_rejection (); | |
3119 | goto fail; | |
3120 | } | |
9928a3d5 MM |
3121 | } |
3122 | ||
e1467ff2 MM |
3123 | if (obj != NULL_TREE) |
3124 | /* Aha, this is a conversion function. */ | |
c166b898 | 3125 | cand = add_conv_candidate (candidates, fn, obj, first_arg, arglist, |
b40e334f | 3126 | access_path, conversion_path, complain); |
e1467ff2 | 3127 | else |
aa52c1ff | 3128 | cand = add_function_candidate (candidates, fn, ctype, |
c166b898 | 3129 | first_arg, arglist, access_path, |
b40e334f | 3130 | conversion_path, flags, complain); |
e1467ff2 MM |
3131 | if (DECL_TI_TEMPLATE (fn) != tmpl) |
3132 | /* This situation can occur if a member template of a template | |
3133 | class is specialized. Then, instantiate_template might return | |
3134 | an instantiation of the specialization, in which case the | |
3135 | DECL_TI_TEMPLATE field will point at the original | |
3136 | specialization. For example: | |
3137 | ||
3138 | template <class T> struct S { template <class U> void f(U); | |
3139 | template <> void f(int) {}; }; | |
3140 | S<double> sd; | |
3141 | sd.f(3); | |
3142 | ||
3143 | Here, TMPL will be template <class U> S<double>::f(U). | |
3144 | And, instantiate template will give us the specialization | |
3145 | template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field | |
3146 | for this will point at template <class T> template <> S<T>::f(int), | |
3147 | so that we can find the definition. For the purposes of | |
3148 | overload resolution, however, we want the original TMPL. */ | |
aa373032 | 3149 | cand->template_decl = build_template_info (tmpl, targs); |
e1467ff2 | 3150 | else |
ea0ad329 | 3151 | cand->template_decl = DECL_TEMPLATE_INFO (fn); |
f18ea1bf | 3152 | cand->explicit_targs = explicit_targs; |
e1467ff2 | 3153 | |
c73964b2 | 3154 | return cand; |
3784b33c JM |
3155 | fail: |
3156 | return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL, | |
4561285b | 3157 | access_path, conversion_path, 0, reason, flags); |
c73964b2 MS |
3158 | } |
3159 | ||
786b5245 MM |
3160 | |
3161 | static struct z_candidate * | |
7993382e | 3162 | add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype, |
c166b898 | 3163 | tree explicit_targs, tree first_arg, |
9771b263 | 3164 | const vec<tree, va_gc> *arglist, tree return_type, |
0cbd7506 | 3165 | tree access_path, tree conversion_path, int flags, |
b40e334f | 3166 | unification_kind_t strict, tsubst_flags_t complain) |
786b5245 | 3167 | { |
c8094d83 | 3168 | return |
aa52c1ff | 3169 | add_template_candidate_real (candidates, tmpl, ctype, |
c166b898 ILT |
3170 | explicit_targs, first_arg, arglist, |
3171 | return_type, access_path, conversion_path, | |
b40e334f | 3172 | flags, NULL_TREE, strict, complain); |
e1467ff2 | 3173 | } |
786b5245 | 3174 | |
786b5245 | 3175 | |
e1467ff2 | 3176 | static struct z_candidate * |
7993382e | 3177 | add_template_conv_candidate (struct z_candidate **candidates, tree tmpl, |
c166b898 | 3178 | tree obj, tree first_arg, |
9771b263 | 3179 | const vec<tree, va_gc> *arglist, |
c166b898 | 3180 | tree return_type, tree access_path, |
b40e334f | 3181 | tree conversion_path, tsubst_flags_t complain) |
e1467ff2 | 3182 | { |
c8094d83 | 3183 | return |
aa52c1ff | 3184 | add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE, |
c166b898 | 3185 | first_arg, arglist, return_type, access_path, |
b40e334f PC |
3186 | conversion_path, 0, obj, DEDUCE_CONV, |
3187 | complain); | |
786b5245 MM |
3188 | } |
3189 | ||
436f8a4c | 3190 | /* The CANDS are the set of candidates that were considered for |
3784b33c JM |
3191 | overload resolution. Return the set of viable candidates, or CANDS |
3192 | if none are viable. If any of the candidates were viable, set | |
3193 | *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be | |
3194 | considered viable only if it is strictly viable. */ | |
786b5245 | 3195 | |
436f8a4c MM |
3196 | static struct z_candidate* |
3197 | splice_viable (struct z_candidate *cands, | |
3198 | bool strict_p, | |
3199 | bool *any_viable_p) | |
c73964b2 | 3200 | { |
436f8a4c MM |
3201 | struct z_candidate *viable; |
3202 | struct z_candidate **last_viable; | |
3203 | struct z_candidate **cand; | |
89606913 | 3204 | bool found_strictly_viable = false; |
436f8a4c | 3205 | |
4d7f99c7 JM |
3206 | /* Be strict inside templates, since build_over_call won't actually |
3207 | do the conversions to get pedwarns. */ | |
3208 | if (processing_template_decl) | |
3209 | strict_p = true; | |
3210 | ||
436f8a4c MM |
3211 | viable = NULL; |
3212 | last_viable = &viable; | |
3213 | *any_viable_p = false; | |
3214 | ||
c8094d83 MS |
3215 | cand = &cands; |
3216 | while (*cand) | |
436f8a4c MM |
3217 | { |
3218 | struct z_candidate *c = *cand; | |
89606913 JM |
3219 | if (!strict_p |
3220 | && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL)) | |
3221 | { | |
3222 | /* Be strict in the presence of a viable candidate. Also if | |
3223 | there are template candidates, so that we get deduction errors | |
3224 | for them instead of silently preferring a bad conversion. */ | |
3225 | strict_p = true; | |
3226 | if (viable && !found_strictly_viable) | |
3227 | { | |
3228 | /* Put any spliced near matches back onto the main list so | |
3229 | that we see them if there is no strict match. */ | |
3230 | *any_viable_p = false; | |
3231 | *last_viable = cands; | |
3232 | cands = viable; | |
3233 | viable = NULL; | |
3234 | last_viable = &viable; | |
3235 | } | |
3236 | } | |
3237 | ||
436f8a4c MM |
3238 | if (strict_p ? c->viable == 1 : c->viable) |
3239 | { | |
3240 | *last_viable = c; | |
3241 | *cand = c->next; | |
3242 | c->next = NULL; | |
3243 | last_viable = &c->next; | |
3244 | *any_viable_p = true; | |
89606913 JM |
3245 | if (c->viable == 1) |
3246 | found_strictly_viable = true; | |
436f8a4c MM |
3247 | } |
3248 | else | |
3249 | cand = &c->next; | |
3250 | } | |
3251 | ||
3252 | return viable ? viable : cands; | |
c73964b2 MS |
3253 | } |
3254 | ||
94be8403 GDR |
3255 | static bool |
3256 | any_strictly_viable (struct z_candidate *cands) | |
ecc42c14 AO |
3257 | { |
3258 | for (; cands; cands = cands->next) | |
3259 | if (cands->viable == 1) | |
94be8403 GDR |
3260 | return true; |
3261 | return false; | |
ecc42c14 AO |
3262 | } |
3263 | ||
dfb5c523 MM |
3264 | /* OBJ is being used in an expression like "OBJ.f (...)". In other |
3265 | words, it is about to become the "this" pointer for a member | |
3266 | function call. Take the address of the object. */ | |
3267 | ||
824b9a4c | 3268 | static tree |
94be8403 | 3269 | build_this (tree obj) |
c73964b2 | 3270 | { |
dfb5c523 MM |
3271 | /* In a template, we are only concerned about the type of the |
3272 | expression, so we can take a shortcut. */ | |
3273 | if (processing_template_decl) | |
3274 | return build_address (obj); | |
3275 | ||
93c0e0bb | 3276 | return cp_build_addr_expr (obj, tf_warning_or_error); |
c73964b2 MS |
3277 | } |
3278 | ||
436f8a4c MM |
3279 | /* Returns true iff functions are equivalent. Equivalent functions are |
3280 | not '==' only if one is a function-local extern function or if | |
3281 | both are extern "C". */ | |
3282 | ||
3283 | static inline int | |
3284 | equal_functions (tree fn1, tree fn2) | |
3285 | { | |
3784b33c JM |
3286 | if (TREE_CODE (fn1) != TREE_CODE (fn2)) |
3287 | return 0; | |
3288 | if (TREE_CODE (fn1) == TEMPLATE_DECL) | |
3289 | return fn1 == fn2; | |
436f8a4c MM |
3290 | if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2) |
3291 | || DECL_EXTERN_C_FUNCTION_P (fn1)) | |
3292 | return decls_match (fn1, fn2); | |
3293 | return fn1 == fn2; | |
3294 | } | |
3295 | ||
feb6efc1 NF |
3296 | /* Print information about a candidate being rejected due to INFO. */ |
3297 | ||
3298 | static void | |
3299 | print_conversion_rejection (location_t loc, struct conversion_info *info) | |
3300 | { | |
89606913 JM |
3301 | tree from = info->from; |
3302 | if (!TYPE_P (from)) | |
3303 | from = lvalue_type (from); | |
feb6efc1 | 3304 | if (info->n_arg == -1) |
89606913 JM |
3305 | { |
3306 | /* Conversion of implicit `this' argument failed. */ | |
3307 | if (!TYPE_P (info->from)) | |
3308 | /* A bad conversion for 'this' must be discarding cv-quals. */ | |
8fa53379 | 3309 | inform (loc, " passing %qT as %<this%> " |
89606913 JM |
3310 | "argument discards qualifiers", |
3311 | from); | |
3312 | else | |
3313 | inform (loc, " no known conversion for implicit " | |
3314 | "%<this%> parameter from %qT to %qT", | |
3315 | from, info->to_type); | |
3316 | } | |
3317 | else if (!TYPE_P (info->from)) | |
3318 | { | |
3319 | if (info->n_arg >= 0) | |
3320 | inform (loc, " conversion of argument %d would be ill-formed:", | |
8fa53379 | 3321 | info->n_arg + 1); |
89606913 JM |
3322 | perform_implicit_conversion (info->to_type, info->from, |
3323 | tf_warning_or_error); | |
3324 | } | |
241172a5 JM |
3325 | else if (info->n_arg == -2) |
3326 | /* Conversion of conversion function return value failed. */ | |
3327 | inform (loc, " no known conversion from %qT to %qT", | |
89606913 | 3328 | from, info->to_type); |
feb6efc1 | 3329 | else |
80f4fc8c | 3330 | inform (loc, " no known conversion for argument %d from %qT to %qT", |
8fa53379 | 3331 | info->n_arg + 1, from, info->to_type); |
feb6efc1 NF |
3332 | } |
3333 | ||
3d2f6864 NF |
3334 | /* Print information about a candidate with WANT parameters and we found |
3335 | HAVE. */ | |
3336 | ||
3337 | static void | |
3338 | print_arity_information (location_t loc, unsigned int have, unsigned int want) | |
3339 | { | |
3340 | inform_n (loc, want, | |
3341 | " candidate expects %d argument, %d provided", | |
3342 | " candidate expects %d arguments, %d provided", | |
3343 | want, have); | |
3344 | } | |
3345 | ||
d2a6f3c0 ZW |
3346 | /* Print information about one overload candidate CANDIDATE. MSGSTR |
3347 | is the text to print before the candidate itself. | |
3348 | ||
3349 | NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected | |
3350 | to have been run through gettext by the caller. This wart makes | |
3351 | life simpler in print_z_candidates and for the translators. */ | |
b9747e59 JM |
3352 | |
3353 | static void | |
498ad15e PC |
3354 | print_z_candidate (location_t loc, const char *msgstr, |
3355 | struct z_candidate *candidate) | |
b9747e59 | 3356 | { |
feb6efc1 NF |
3357 | const char *msg = (msgstr == NULL |
3358 | ? "" | |
3359 | : ACONCAT ((msgstr, " ", NULL))); | |
498ad15e | 3360 | location_t cloc = location_of (candidate->fn); |
feb6efc1 | 3361 | |
9dc6f476 | 3362 | if (identifier_p (candidate->fn)) |
b9747e59 | 3363 | { |
498ad15e | 3364 | cloc = loc; |
5bd61841 | 3365 | if (candidate->num_convs == 3) |
498ad15e | 3366 | inform (cloc, "%s%D(%T, %T, %T) <built-in>", msg, candidate->fn, |
5bd61841 MM |
3367 | candidate->convs[0]->type, |
3368 | candidate->convs[1]->type, | |
3369 | candidate->convs[2]->type); | |
3370 | else if (candidate->num_convs == 2) | |
498ad15e | 3371 | inform (cloc, "%s%D(%T, %T) <built-in>", msg, candidate->fn, |
5bd61841 MM |
3372 | candidate->convs[0]->type, |
3373 | candidate->convs[1]->type); | |
b9747e59 | 3374 | else |
498ad15e | 3375 | inform (cloc, "%s%D(%T) <built-in>", msg, candidate->fn, |
5bd61841 | 3376 | candidate->convs[0]->type); |
b9747e59 JM |
3377 | } |
3378 | else if (TYPE_P (candidate->fn)) | |
498ad15e | 3379 | inform (cloc, "%s%T <conversion>", msg, candidate->fn); |
d2a6f3c0 | 3380 | else if (candidate->viable == -1) |
498ad15e | 3381 | inform (cloc, "%s%#D <near match>", msg, candidate->fn); |
f1ee5eaf | 3382 | else if (DECL_DELETED_FN (candidate->fn)) |
498ad15e | 3383 | inform (cloc, "%s%#D <deleted>", msg, candidate->fn); |
b9747e59 | 3384 | else |
498ad15e | 3385 | inform (cloc, "%s%#D", msg, candidate->fn); |
feb6efc1 NF |
3386 | /* Give the user some information about why this candidate failed. */ |
3387 | if (candidate->reason != NULL) | |
3388 | { | |
3389 | struct rejection_reason *r = candidate->reason; | |
3390 | ||
3391 | switch (r->code) | |
3392 | { | |
3393 | case rr_arity: | |
498ad15e | 3394 | print_arity_information (cloc, r->u.arity.actual, |
3d2f6864 | 3395 | r->u.arity.expected); |
feb6efc1 NF |
3396 | break; |
3397 | case rr_arg_conversion: | |
498ad15e | 3398 | print_conversion_rejection (cloc, &r->u.conversion); |
feb6efc1 NF |
3399 | break; |
3400 | case rr_bad_arg_conversion: | |
498ad15e | 3401 | print_conversion_rejection (cloc, &r->u.bad_conversion); |
feb6efc1 | 3402 | break; |
b028af11 | 3403 | case rr_explicit_conversion: |
498ad15e | 3404 | inform (cloc, " return type %qT of explicit conversion function " |
b028af11 | 3405 | "cannot be converted to %qT with a qualification " |
89606913 | 3406 | "conversion", r->u.conversion.from, |
b028af11 JM |
3407 | r->u.conversion.to_type); |
3408 | break; | |
c8580138 | 3409 | case rr_template_conversion: |
498ad15e | 3410 | inform (cloc, " conversion from return type %qT of template " |
c8580138 | 3411 | "conversion function specialization to %qT is not an " |
89606913 | 3412 | "exact match", r->u.conversion.from, |
c8580138 JM |
3413 | r->u.conversion.to_type); |
3414 | break; | |
3d2f6864 NF |
3415 | case rr_template_unification: |
3416 | /* We use template_unification_error_rejection if unification caused | |
3417 | actual non-SFINAE errors, in which case we don't need to repeat | |
3418 | them here. */ | |
3419 | if (r->u.template_unification.tmpl == NULL_TREE) | |
3420 | { | |
498ad15e | 3421 | inform (cloc, " substitution of deduced template arguments " |
3d2f6864 NF |
3422 | "resulted in errors seen above"); |
3423 | break; | |
3424 | } | |
3425 | /* Re-run template unification with diagnostics. */ | |
498ad15e | 3426 | inform (cloc, " template argument deduction/substitution failed:"); |
3d2f6864 NF |
3427 | fn_type_unification (r->u.template_unification.tmpl, |
3428 | r->u.template_unification.explicit_targs, | |
cd057e3a JM |
3429 | (make_tree_vec |
3430 | (r->u.template_unification.num_targs)), | |
3d2f6864 NF |
3431 | r->u.template_unification.args, |
3432 | r->u.template_unification.nargs, | |
3433 | r->u.template_unification.return_type, | |
3434 | r->u.template_unification.strict, | |
3435 | r->u.template_unification.flags, | |
2b24855e | 3436 | true, false); |
3d2f6864 | 3437 | break; |
3d2f6864 | 3438 | case rr_invalid_copy: |
498ad15e | 3439 | inform (cloc, |
3d2f6864 NF |
3440 | " a constructor taking a single argument of its own " |
3441 | "class type is invalid"); | |
3442 | break; | |
971e17ff AS |
3443 | case rr_constraint_failure: |
3444 | { | |
3445 | tree tmpl = r->u.template_instantiation.tmpl; | |
3446 | tree args = r->u.template_instantiation.targs; | |
3447 | diagnose_constraints (cloc, tmpl, args); | |
3448 | } | |
3449 | break; | |
feb6efc1 NF |
3450 | case rr_none: |
3451 | default: | |
3452 | /* This candidate didn't have any issues or we failed to | |
3453 | handle a particular code. Either way... */ | |
3454 | gcc_unreachable (); | |
3455 | } | |
3456 | } | |
b9747e59 JM |
3457 | } |
3458 | ||
c73964b2 | 3459 | static void |
feb6efc1 | 3460 | print_z_candidates (location_t loc, struct z_candidate *candidates) |
c73964b2 | 3461 | { |
436f8a4c MM |
3462 | struct z_candidate *cand1; |
3463 | struct z_candidate **cand2; | |
3464 | ||
f0673555 JM |
3465 | if (!candidates) |
3466 | return; | |
3467 | ||
e14eaea4 | 3468 | /* Remove non-viable deleted candidates. */ |
f0673555 JM |
3469 | cand1 = candidates; |
3470 | for (cand2 = &cand1; *cand2; ) | |
3471 | { | |
3472 | if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL | |
e14eaea4 | 3473 | && !(*cand2)->viable |
f0673555 JM |
3474 | && DECL_DELETED_FN ((*cand2)->fn)) |
3475 | *cand2 = (*cand2)->next; | |
3476 | else | |
3477 | cand2 = &(*cand2)->next; | |
3478 | } | |
3479 | /* ...if there are any non-deleted ones. */ | |
3480 | if (cand1) | |
3481 | candidates = cand1; | |
3482 | ||
436f8a4c MM |
3483 | /* There may be duplicates in the set of candidates. We put off |
3484 | checking this condition as long as possible, since we have no way | |
3485 | to eliminate duplicates from a set of functions in less than n^2 | |
3486 | time. Now we are about to emit an error message, so it is more | |
3487 | permissible to go slowly. */ | |
3488 | for (cand1 = candidates; cand1; cand1 = cand1->next) | |
3489 | { | |
3490 | tree fn = cand1->fn; | |
3491 | /* Skip builtin candidates and conversion functions. */ | |
3784b33c | 3492 | if (!DECL_P (fn)) |
436f8a4c MM |
3493 | continue; |
3494 | cand2 = &cand1->next; | |
3495 | while (*cand2) | |
3496 | { | |
3784b33c | 3497 | if (DECL_P ((*cand2)->fn) |
436f8a4c MM |
3498 | && equal_functions (fn, (*cand2)->fn)) |
3499 | *cand2 = (*cand2)->next; | |
3500 | else | |
3501 | cand2 = &(*cand2)->next; | |
3502 | } | |
3503 | } | |
3504 | ||
6ba6f70d | 3505 | for (; candidates; candidates = candidates->next) |
89606913 | 3506 | print_z_candidate (loc, "candidate:", candidates); |
c73964b2 MS |
3507 | } |
3508 | ||
3d938426 MM |
3509 | /* USER_SEQ is a user-defined conversion sequence, beginning with a |
3510 | USER_CONV. STD_SEQ is the standard conversion sequence applied to | |
3511 | the result of the conversion function to convert it to the final | |
78dcd41a | 3512 | desired type. Merge the two sequences into a single sequence, |
3d938426 MM |
3513 | and return the merged sequence. */ |
3514 | ||
5bd61841 MM |
3515 | static conversion * |
3516 | merge_conversion_sequences (conversion *user_seq, conversion *std_seq) | |
3d938426 | 3517 | { |
5bd61841 | 3518 | conversion **t; |
940023f4 | 3519 | bool bad = user_seq->bad_p; |
3d938426 | 3520 | |
50bc768d | 3521 | gcc_assert (user_seq->kind == ck_user); |
3d938426 MM |
3522 | |
3523 | /* Find the end of the second conversion sequence. */ | |
940023f4 JM |
3524 | for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next)) |
3525 | { | |
3526 | /* The entire sequence is a user-conversion sequence. */ | |
3527 | (*t)->user_conv_p = true; | |
3528 | if (bad) | |
3529 | (*t)->bad_p = true; | |
3530 | } | |
3d938426 MM |
3531 | |
3532 | /* Replace the identity conversion with the user conversion | |
3533 | sequence. */ | |
3534 | *t = user_seq; | |
3535 | ||
3d938426 MM |
3536 | return std_seq; |
3537 | } | |
3538 | ||
4c9b3895 JM |
3539 | /* Handle overload resolution for initializing an object of class type from |
3540 | an initializer list. First we look for a suitable constructor that | |
3541 | takes a std::initializer_list; if we don't find one, we then look for a | |
3542 | non-list constructor. | |
3543 | ||
3544 | Parameters are as for add_candidates, except that the arguments are in | |
9771b263 | 3545 | the form of a CONSTRUCTOR (the initializer list) rather than a vector, and |
4c9b3895 JM |
3546 | the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */ |
3547 | ||
3548 | static void | |
3549 | add_list_candidates (tree fns, tree first_arg, | |
3550 | tree init_list, tree totype, | |
3551 | tree explicit_targs, bool template_only, | |
3552 | tree conversion_path, tree access_path, | |
3553 | int flags, | |
b40e334f PC |
3554 | struct z_candidate **candidates, |
3555 | tsubst_flags_t complain) | |
4c9b3895 | 3556 | { |
9771b263 | 3557 | vec<tree, va_gc> *args; |
4c9b3895 JM |
3558 | |
3559 | gcc_assert (*candidates == NULL); | |
3560 | ||
11c71a22 JM |
3561 | /* We're looking for a ctor for list-initialization. */ |
3562 | flags |= LOOKUP_LIST_INIT_CTOR; | |
4c9b3895 JM |
3563 | /* And we don't allow narrowing conversions. We also use this flag to |
3564 | avoid the copy constructor call for copy-list-initialization. */ | |
3565 | flags |= LOOKUP_NO_NARROWING; | |
3566 | ||
3567 | /* Always use the default constructor if the list is empty (DR 990). */ | |
3568 | if (CONSTRUCTOR_NELTS (init_list) == 0 | |
3569 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)) | |
3570 | ; | |
3571 | /* If the class has a list ctor, try passing the list as a single | |
3572 | argument first, but only consider list ctors. */ | |
3573 | else if (TYPE_HAS_LIST_CTOR (totype)) | |
3574 | { | |
3575 | flags |= LOOKUP_LIST_ONLY; | |
3576 | args = make_tree_vector_single (init_list); | |
3577 | add_candidates (fns, first_arg, args, NULL_TREE, | |
3578 | explicit_targs, template_only, conversion_path, | |
b40e334f | 3579 | access_path, flags, candidates, complain); |
4c9b3895 JM |
3580 | if (any_strictly_viable (*candidates)) |
3581 | return; | |
3582 | } | |
3583 | ||
3584 | args = ctor_to_vec (init_list); | |
3585 | ||
3586 | /* We aren't looking for list-ctors anymore. */ | |
3587 | flags &= ~LOOKUP_LIST_ONLY; | |
3588 | /* We allow more user-defined conversions within an init-list. */ | |
3589 | flags &= ~LOOKUP_NO_CONVERSION; | |
4c9b3895 JM |
3590 | |
3591 | add_candidates (fns, first_arg, args, NULL_TREE, | |
3592 | explicit_targs, template_only, conversion_path, | |
b40e334f | 3593 | access_path, flags, candidates, complain); |
4c9b3895 JM |
3594 | } |
3595 | ||
c73964b2 | 3596 | /* Returns the best overload candidate to perform the requested |
eb66be0e MS |
3597 | conversion. This function is used for three the overloading situations |
3598 | described in [over.match.copy], [over.match.conv], and [over.match.ref]. | |
62a405dd | 3599 | If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as |
eb66be0e | 3600 | per [dcl.init.ref], so we ignore temporary bindings. */ |
c73964b2 MS |
3601 | |
3602 | static struct z_candidate * | |
b40e334f PC |
3603 | build_user_type_conversion_1 (tree totype, tree expr, int flags, |
3604 | tsubst_flags_t complain) | |
c73964b2 MS |
3605 | { |
3606 | struct z_candidate *candidates, *cand; | |
c2985fe5 | 3607 | tree fromtype; |
5bd61841 MM |
3608 | tree ctors = NULL_TREE; |
3609 | tree conv_fns = NULL_TREE; | |
3610 | conversion *conv = NULL; | |
c166b898 | 3611 | tree first_arg = NULL_TREE; |
9771b263 | 3612 | vec<tree, va_gc> *args = NULL; |
436f8a4c | 3613 | bool any_viable_p; |
6f4fd536 | 3614 | int convflags; |
c73964b2 | 3615 | |
c2985fe5 PC |
3616 | if (!expr) |
3617 | return NULL; | |
3618 | ||
3619 | fromtype = TREE_TYPE (expr); | |
3620 | ||
5e818b93 JM |
3621 | /* We represent conversion within a hierarchy using RVALUE_CONV and |
3622 | BASE_CONV, as specified by [over.best.ics]; these become plain | |
3623 | constructor calls, as specified in [dcl.init]. */ | |
9e1e64ec | 3624 | gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype) |
50bc768d | 3625 | || !DERIVED_FROM_P (totype, fromtype)); |
5e818b93 | 3626 | |
9e1e64ec | 3627 | if (MAYBE_CLASS_TYPE_P (totype)) |
c9b55889 JM |
3628 | /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid |
3629 | creating a garbage BASELINK; constructors can't be inherited. */ | |
3630 | ctors = lookup_fnfields_slot (totype, complete_ctor_identifier); | |
db9b2174 | 3631 | |
9e1e64ec | 3632 | if (MAYBE_CLASS_TYPE_P (fromtype)) |
a9a81e7d SM |
3633 | { |
3634 | tree to_nonref = non_reference (totype); | |
3635 | if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) || | |
3636 | (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype) | |
3637 | && DERIVED_FROM_P (to_nonref, fromtype))) | |
3638 | { | |
3639 | /* [class.conv.fct] A conversion function is never used to | |
3640 | convert a (possibly cv-qualified) object to the (possibly | |
3641 | cv-qualified) same object type (or a reference to it), to a | |
3642 | (possibly cv-qualified) base class of that type (or a | |
3643 | reference to it)... */ | |
3644 | } | |
3645 | else | |
9c7d5cae | 3646 | conv_fns = lookup_conversions (fromtype); |
a9a81e7d | 3647 | } |
c73964b2 MS |
3648 | |
3649 | candidates = 0; | |
3650 | flags |= LOOKUP_NO_CONVERSION; | |
5c824000 JM |
3651 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
3652 | flags |= LOOKUP_NO_NARROWING; | |
c73964b2 | 3653 | |
6f4fd536 JM |
3654 | /* It's OK to bind a temporary for converting constructor arguments, but |
3655 | not in converting the return value of a conversion operator. */ | |
2410819b PC |
3656 | convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION |
3657 | | (flags & LOOKUP_NO_NARROWING)); | |
6f4fd536 JM |
3658 | flags &= ~LOOKUP_NO_TEMP_BIND; |
3659 | ||
c73964b2 MS |
3660 | if (ctors) |
3661 | { | |
5c824000 | 3662 | int ctorflags = flags; |
454fa7a7 | 3663 | |
1dbdb756 | 3664 | first_arg = build_dummy_object (totype); |
c166b898 | 3665 | |
41f5d4b1 NS |
3666 | /* We should never try to call the abstract or base constructor |
3667 | from here. */ | |
50bc768d NS |
3668 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors)) |
3669 | && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors))); | |
c73964b2 | 3670 | |
4c9b3895 | 3671 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
d451d5b2 | 3672 | { |
4c9b3895 JM |
3673 | /* List-initialization. */ |
3674 | add_list_candidates (ctors, first_arg, expr, totype, NULL_TREE, | |
3675 | false, TYPE_BINFO (totype), TYPE_BINFO (totype), | |
b40e334f | 3676 | ctorflags, &candidates, complain); |
d451d5b2 | 3677 | } |
4c9b3895 | 3678 | else |
d451d5b2 | 3679 | { |
4c9b3895 | 3680 | args = make_tree_vector_single (expr); |
d451d5b2 JM |
3681 | add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false, |
3682 | TYPE_BINFO (totype), TYPE_BINFO (totype), | |
b40e334f | 3683 | ctorflags, &candidates, complain); |
d451d5b2 | 3684 | } |
98c1c668 | 3685 | |
5c824000 | 3686 | for (cand = candidates; cand; cand = cand->next) |
46225e26 JM |
3687 | { |
3688 | cand->second_conv = build_identity_conv (totype, NULL_TREE); | |
3689 | ||
3690 | /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't | |
3691 | set, then this is copy-initialization. In that case, "The | |
3692 | result of the call is then used to direct-initialize the | |
3693 | object that is the destination of the copy-initialization." | |
3694 | [dcl.init] | |
3695 | ||
3696 | We represent this in the conversion sequence with an | |
3697 | rvalue conversion, which means a constructor call. */ | |
3698 | if (TREE_CODE (totype) != REFERENCE_TYPE | |
3699 | && !(convflags & LOOKUP_NO_TEMP_BIND)) | |
3700 | cand->second_conv | |
3701 | = build_conv (ck_rvalue, totype, cand->second_conv); | |
3702 | } | |
c73964b2 MS |
3703 | } |
3704 | ||
5bd61841 | 3705 | if (conv_fns) |
a7175123 | 3706 | first_arg = expr; |
c73964b2 | 3707 | |
5bd61841 | 3708 | for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns)) |
c73964b2 | 3709 | { |
5bd61841 | 3710 | tree conversion_path = TREE_PURPOSE (conv_fns); |
5c824000 | 3711 | struct z_candidate *old_candidates; |
eb66be0e MS |
3712 | |
3713 | /* If we are called to convert to a reference type, we are trying to | |
dbbc379e JM |
3714 | find a direct binding, so don't even consider temporaries. If |
3715 | we don't find a direct binding, the caller will try again to | |
eb66be0e MS |
3716 | look for a temporary binding. */ |
3717 | if (TREE_CODE (totype) == REFERENCE_TYPE) | |
3718 | convflags |= LOOKUP_NO_TEMP_BIND; | |
c8094d83 | 3719 | |
5c824000 JM |
3720 | old_candidates = candidates; |
3721 | add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype, | |
3722 | NULL_TREE, false, | |
3723 | conversion_path, TYPE_BINFO (fromtype), | |
b40e334f | 3724 | flags, &candidates, complain); |
5c824000 JM |
3725 | |
3726 | for (cand = candidates; cand != old_candidates; cand = cand->next) | |
5dd236e2 | 3727 | { |
b028af11 | 3728 | tree rettype = TREE_TYPE (TREE_TYPE (cand->fn)); |
5c824000 JM |
3729 | conversion *ics |
3730 | = implicit_conversion (totype, | |
b028af11 | 3731 | rettype, |
5c824000 | 3732 | 0, |
b40e334f PC |
3733 | /*c_cast_p=*/false, convflags, |
3734 | complain); | |
5dd236e2 | 3735 | |
5c824000 JM |
3736 | /* If LOOKUP_NO_TEMP_BIND isn't set, then this is |
3737 | copy-initialization. In that case, "The result of the | |
3738 | call is then used to direct-initialize the object that is | |
3739 | the destination of the copy-initialization." [dcl.init] | |
3740 | ||
3741 | We represent this in the conversion sequence with an | |
3742 | rvalue conversion, which means a constructor call. But | |
3743 | don't add a second rvalue conversion if there's already | |
3744 | one there. Which there really shouldn't be, but it's | |
3745 | harmless since we'd add it here anyway. */ | |
3746 | if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue | |
3747 | && !(convflags & LOOKUP_NO_TEMP_BIND)) | |
3748 | ics = build_conv (ck_rvalue, totype, ics); | |
3749 | ||
3750 | cand->second_conv = ics; | |
3751 | ||
3752 | if (!ics) | |
feb6efc1 | 3753 | { |
feb6efc1 | 3754 | cand->viable = 0; |
241172a5 | 3755 | cand->reason = arg_conversion_rejection (NULL_TREE, -2, |
feb6efc1 NF |
3756 | rettype, totype); |
3757 | } | |
b028af11 JM |
3758 | else if (DECL_NONCONVERTING_P (cand->fn) |
3759 | && ics->rank > cr_exact) | |
3760 | { | |
3761 | /* 13.3.1.5: For direct-initialization, those explicit | |
3762 | conversion functions that are not hidden within S and | |
3763 | yield type T or a type that can be converted to type T | |
3764 | with a qualification conversion (4.4) are also candidate | |
3765 | functions. */ | |
62a405dd JM |
3766 | /* 13.3.1.6 doesn't have a parallel restriction, but it should; |
3767 | I've raised this issue with the committee. --jason 9/2011 */ | |
b028af11 JM |
3768 | cand->viable = -1; |
3769 | cand->reason = explicit_conversion_rejection (rettype, totype); | |
3770 | } | |
5c824000 | 3771 | else if (cand->viable == 1 && ics->bad_p) |
feb6efc1 | 3772 | { |
feb6efc1 NF |
3773 | cand->viable = -1; |
3774 | cand->reason | |
241172a5 | 3775 | = bad_arg_conversion_rejection (NULL_TREE, -2, |
feb6efc1 NF |
3776 | rettype, totype); |
3777 | } | |
c8580138 JM |
3778 | else if (primary_template_instantiation_p (cand->fn) |
3779 | && ics->rank > cr_exact) | |
3780 | { | |
3781 | /* 13.3.3.1.2: If the user-defined conversion is specified by | |
3782 | a specialization of a conversion function template, the | |
3783 | second standard conversion sequence shall have exact match | |
3784 | rank. */ | |
3785 | cand->viable = -1; | |
3786 | cand->reason = template_conversion_rejection (rettype, totype); | |
3787 | } | |
5dd236e2 | 3788 | } |
c73964b2 MS |
3789 | } |
3790 | ||
89606913 | 3791 | candidates = splice_viable (candidates, false, &any_viable_p); |
436f8a4c | 3792 | if (!any_viable_p) |
c9b55889 JM |
3793 | { |
3794 | if (args) | |
3795 | release_tree_vector (args); | |
3796 | return NULL; | |
3797 | } | |
c73964b2 | 3798 | |
b40e334f | 3799 | cand = tourney (candidates, complain); |
c73964b2 MS |
3800 | if (cand == 0) |
3801 | { | |
4b978f96 | 3802 | if (complain & tf_error) |
c73964b2 | 3803 | { |
41775162 | 3804 | error ("conversion from %qT to %qT is ambiguous", |
b40e334f | 3805 | fromtype, totype); |
feb6efc1 | 3806 | print_z_candidates (location_of (expr), candidates); |
c73964b2 MS |
3807 | } |
3808 | ||
3809 | cand = candidates; /* any one will do */ | |
5bd61841 MM |
3810 | cand->second_conv = build_ambiguous_conv (totype, expr); |
3811 | cand->second_conv->user_conv_p = true; | |
f576dfc4 | 3812 | if (!any_strictly_viable (candidates)) |
5bd61841 | 3813 | cand->second_conv->bad_p = true; |
f576dfc4 JM |
3814 | /* If there are viable candidates, don't set ICS_BAD_FLAG; an |
3815 | ambiguous conversion is no worse than another user-defined | |
3816 | conversion. */ | |
c73964b2 MS |
3817 | |
3818 | return cand; | |
3819 | } | |
3820 | ||
bfa58951 JM |
3821 | tree convtype; |
3822 | if (!DECL_CONSTRUCTOR_P (cand->fn)) | |
3823 | convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn))); | |
3824 | else if (cand->second_conv->kind == ck_rvalue) | |
3825 | /* DR 5: [in the first step of copy-initialization]...if the function | |
3826 | is a constructor, the call initializes a temporary of the | |
3827 | cv-unqualified version of the destination type. */ | |
3828 | convtype = cv_unqualified (totype); | |
3829 | else | |
3830 | convtype = totype; | |
3d938426 | 3831 | /* Build the user conversion sequence. */ |
5bd61841 MM |
3832 | conv = build_conv |
3833 | (ck_user, | |
bfa58951 | 3834 | convtype, |
5bd61841 MM |
3835 | build_identity_conv (TREE_TYPE (expr), expr)); |
3836 | conv->cand = cand; | |
940023f4 JM |
3837 | if (cand->viable == -1) |
3838 | conv->bad_p = true; | |
3d938426 | 3839 | |
3f6079dd JM |
3840 | /* Remember that this was a list-initialization. */ |
3841 | if (flags & LOOKUP_NO_NARROWING) | |
3842 | conv->check_narrowing = true; | |
3843 | ||
3d938426 | 3844 | /* Combine it with the second conversion sequence. */ |
5bd61841 | 3845 | cand->second_conv = merge_conversion_sequences (conv, |
3d938426 MM |
3846 | cand->second_conv); |
3847 | ||
c73964b2 MS |
3848 | return cand; |
3849 | } | |
3850 | ||
575bfb00 LC |
3851 | /* Wrapper for above. */ |
3852 | ||
c73964b2 | 3853 | tree |
b40e334f PC |
3854 | build_user_type_conversion (tree totype, tree expr, int flags, |
3855 | tsubst_flags_t complain) | |
c73964b2 | 3856 | { |
575bfb00 LC |
3857 | struct z_candidate *cand; |
3858 | tree ret; | |
3859 | ||
4877e471 | 3860 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
b40e334f | 3861 | cand = build_user_type_conversion_1 (totype, expr, flags, complain); |
c73964b2 MS |
3862 | |
3863 | if (cand) | |
3864 | { | |
5bd61841 | 3865 | if (cand->second_conv->kind == ck_ambig) |
575bfb00 LC |
3866 | ret = error_mark_node; |
3867 | else | |
3868 | { | |
b40e334f | 3869 | expr = convert_like (cand->second_conv, expr, complain); |
575bfb00 LC |
3870 | ret = convert_from_reference (expr); |
3871 | } | |
c73964b2 | 3872 | } |
575bfb00 LC |
3873 | else |
3874 | ret = NULL_TREE; | |
3875 | ||
4877e471 | 3876 | timevar_cond_stop (TV_OVERLOAD, subtime); |
575bfb00 | 3877 | return ret; |
c73964b2 MS |
3878 | } |
3879 | ||
61f8d165 JM |
3880 | /* Subroutine of convert_nontype_argument. |
3881 | ||
3882 | EXPR is an argument for a template non-type parameter of integral or | |
3883 | enumeration type. Do any necessary conversions (that are permitted for | |
3884 | non-type arguments) to convert it to the parameter type. | |
3885 | ||
3886 | If conversion is successful, returns the converted expression; | |
3887 | otherwise, returns error_mark_node. */ | |
3888 | ||
3889 | tree | |
3890 | build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain) | |
3891 | { | |
3892 | conversion *conv; | |
3893 | void *p; | |
3894 | tree t; | |
8400e75e | 3895 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
61f8d165 JM |
3896 | |
3897 | if (error_operand_p (expr)) | |
3898 | return error_mark_node; | |
3899 | ||
3900 | gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type)); | |
3901 | ||
3902 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
3903 | p = conversion_obstack_alloc (0); | |
3904 | ||
3905 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, | |
3906 | /*c_cast_p=*/false, | |
b40e334f | 3907 | LOOKUP_IMPLICIT, complain); |
61f8d165 JM |
3908 | |
3909 | /* for a non-type template-parameter of integral or | |
3910 | enumeration type, integral promotions (4.5) and integral | |
3911 | conversions (4.7) are applied. */ | |
3912 | /* It should be sufficient to check the outermost conversion step, since | |
3913 | there are no qualification conversions to integer type. */ | |
3914 | if (conv) | |
3915 | switch (conv->kind) | |
3916 | { | |
3917 | /* A conversion function is OK. If it isn't constexpr, we'll | |
3918 | complain later that the argument isn't constant. */ | |
3919 | case ck_user: | |
3920 | /* The lvalue-to-rvalue conversion is OK. */ | |
3921 | case ck_rvalue: | |
3922 | case ck_identity: | |
3923 | break; | |
3924 | ||
3925 | case ck_std: | |
40703fdf | 3926 | t = next_conversion (conv)->type; |
61f8d165 JM |
3927 | if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)) |
3928 | break; | |
3929 | ||
3930 | if (complain & tf_error) | |
5a3c9cf2 PC |
3931 | error_at (loc, "conversion from %qT to %qT not considered for " |
3932 | "non-type template argument", t, type); | |
61f8d165 JM |
3933 | /* and fall through. */ |
3934 | ||
3935 | default: | |
3936 | conv = NULL; | |
3937 | break; | |
3938 | } | |
3939 | ||
3940 | if (conv) | |
3941 | expr = convert_like (conv, expr, complain); | |
3942 | else | |
3943 | expr = error_mark_node; | |
3944 | ||
3945 | /* Free all the conversions we allocated. */ | |
3946 | obstack_free (&conversion_obstack, p); | |
3947 | ||
3948 | return expr; | |
3949 | } | |
3950 | ||
86e6f22f JM |
3951 | /* Do any initial processing on the arguments to a function call. */ |
3952 | ||
9771b263 DN |
3953 | static vec<tree, va_gc> * |
3954 | resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain) | |
86e6f22f | 3955 | { |
c166b898 ILT |
3956 | unsigned int ix; |
3957 | tree arg; | |
c8094d83 | 3958 | |
9771b263 | 3959 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
c166b898 | 3960 | { |
88217f44 | 3961 | if (error_operand_p (arg)) |
c166b898 | 3962 | return NULL; |
648c2206 | 3963 | else if (VOID_TYPE_P (TREE_TYPE (arg))) |
86e6f22f | 3964 | { |
b46c79a1 JM |
3965 | if (complain & tf_error) |
3966 | error ("invalid use of void expression"); | |
c166b898 | 3967 | return NULL; |
86e6f22f | 3968 | } |
d3ea4c06 | 3969 | else if (invalid_nonstatic_memfn_p (input_location, arg, complain)) |
c166b898 | 3970 | return NULL; |
86e6f22f JM |
3971 | } |
3972 | return args; | |
3973 | } | |
4ba126e4 | 3974 | |
125e6594 MM |
3975 | /* Perform overload resolution on FN, which is called with the ARGS. |
3976 | ||
3977 | Return the candidate function selected by overload resolution, or | |
3978 | NULL if the event that overload resolution failed. In the case | |
3979 | that overload resolution fails, *CANDIDATES will be the set of | |
3980 | candidates considered, and ANY_VIABLE_P will be set to true or | |
3981 | false to indicate whether or not any of the candidates were | |
c8094d83 | 3982 | viable. |
125e6594 MM |
3983 | |
3984 | The ARGS should already have gone through RESOLVE_ARGS before this | |
3985 | function is called. */ | |
3986 | ||
3987 | static struct z_candidate * | |
c8094d83 | 3988 | perform_overload_resolution (tree fn, |
9771b263 | 3989 | const vec<tree, va_gc> *args, |
125e6594 | 3990 | struct z_candidate **candidates, |
b40e334f | 3991 | bool *any_viable_p, tsubst_flags_t complain) |
c73964b2 | 3992 | { |
125e6594 | 3993 | struct z_candidate *cand; |
575bfb00 LC |
3994 | tree explicit_targs; |
3995 | int template_only; | |
3996 | ||
3997 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
3998 | ||
3999 | explicit_targs = NULL_TREE; | |
4000 | template_only = 0; | |
386b8a85 | 4001 | |
125e6594 MM |
4002 | *candidates = NULL; |
4003 | *any_viable_p = true; | |
4004 | ||
c166b898 | 4005 | /* Check FN. */ |
c8094d83 | 4006 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL |
50bc768d NS |
4007 | || TREE_CODE (fn) == TEMPLATE_DECL |
4008 | || TREE_CODE (fn) == OVERLOAD | |
4009 | || TREE_CODE (fn) == TEMPLATE_ID_EXPR); | |
4ba126e4 | 4010 | |
386b8a85 JM |
4011 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) |
4012 | { | |
4013 | explicit_targs = TREE_OPERAND (fn, 1); | |
4014 | fn = TREE_OPERAND (fn, 0); | |
c32381b1 | 4015 | template_only = 1; |
386b8a85 JM |
4016 | } |
4017 | ||
125e6594 | 4018 | /* Add the various candidate functions. */ |
5c824000 JM |
4019 | add_candidates (fn, NULL_TREE, args, NULL_TREE, |
4020 | explicit_targs, template_only, | |
125e6594 MM |
4021 | /*conversion_path=*/NULL_TREE, |
4022 | /*access_path=*/NULL_TREE, | |
4023 | LOOKUP_NORMAL, | |
b40e334f | 4024 | candidates, complain); |
125e6594 | 4025 | |
89606913 | 4026 | *candidates = splice_viable (*candidates, false, any_viable_p); |
575bfb00 | 4027 | if (*any_viable_p) |
b40e334f | 4028 | cand = tourney (*candidates, complain); |
575bfb00 LC |
4029 | else |
4030 | cand = NULL; | |
c73964b2 | 4031 | |
575bfb00 | 4032 | timevar_cond_stop (TV_OVERLOAD, subtime); |
125e6594 MM |
4033 | return cand; |
4034 | } | |
86e6f22f | 4035 | |
feb6efc1 NF |
4036 | /* Print an error message about being unable to build a call to FN with |
4037 | ARGS. ANY_VIABLE_P indicates whether any candidate functions could | |
4038 | be located; CANDIDATES is a possibly empty list of such | |
4039 | functions. */ | |
4040 | ||
4041 | static void | |
c29f393f | 4042 | print_error_for_call_failure (tree fn, vec<tree, va_gc> *args, |
feb6efc1 NF |
4043 | struct z_candidate *candidates) |
4044 | { | |
4045 | tree name = DECL_NAME (OVL_CURRENT (fn)); | |
4046 | location_t loc = location_of (name); | |
4047 | ||
c29f393f | 4048 | if (!any_strictly_viable (candidates)) |
feb6efc1 NF |
4049 | error_at (loc, "no matching function for call to %<%D(%A)%>", |
4050 | name, build_tree_list_vec (args)); | |
4051 | else | |
4052 | error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous", | |
4053 | name, build_tree_list_vec (args)); | |
4054 | if (candidates) | |
4055 | print_z_candidates (loc, candidates); | |
4056 | } | |
4057 | ||
125e6594 | 4058 | /* Return an expression for a call to FN (a namespace-scope function, |
c166b898 ILT |
4059 | or a static member function) with the ARGS. This may change |
4060 | ARGS. */ | |
c8094d83 | 4061 | |
125e6594 | 4062 | tree |
9771b263 | 4063 | build_new_function_call (tree fn, vec<tree, va_gc> **args, bool koenig_p, |
5ade1ed2 | 4064 | tsubst_flags_t complain) |
125e6594 MM |
4065 | { |
4066 | struct z_candidate *candidates, *cand; | |
4067 | bool any_viable_p; | |
5bd61841 MM |
4068 | void *p; |
4069 | tree result; | |
8f032717 | 4070 | |
c166b898 ILT |
4071 | if (args != NULL && *args != NULL) |
4072 | { | |
b46c79a1 | 4073 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4074 | if (*args == NULL) |
4075 | return error_mark_node; | |
4076 | } | |
a723baf1 | 4077 | |
0a35513e AH |
4078 | if (flag_tm) |
4079 | tm_malloc_replacement (fn); | |
4080 | ||
d63d5d0c ILT |
4081 | /* If this function was found without using argument dependent |
4082 | lookup, then we want to ignore any undeclared friend | |
4083 | functions. */ | |
4084 | if (!koenig_p) | |
4085 | { | |
4086 | tree orig_fn = fn; | |
4087 | ||
4088 | fn = remove_hidden_names (fn); | |
4089 | if (!fn) | |
4090 | { | |
5ade1ed2 | 4091 | if (complain & tf_error) |
c29f393f | 4092 | print_error_for_call_failure (orig_fn, *args, NULL); |
d63d5d0c ILT |
4093 | return error_mark_node; |
4094 | } | |
4095 | } | |
4096 | ||
5bd61841 MM |
4097 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4098 | p = conversion_obstack_alloc (0); | |
4099 | ||
b40e334f PC |
4100 | cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p, |
4101 | complain); | |
c73964b2 | 4102 | |
125e6594 MM |
4103 | if (!cand) |
4104 | { | |
5ade1ed2 DG |
4105 | if (complain & tf_error) |
4106 | { | |
971e17ff AS |
4107 | // If there is a single (non-viable) function candidate, |
4108 | // let the error be diagnosed by cp_build_function_call_vec. | |
3784b33c JM |
4109 | if (!any_viable_p && candidates && ! candidates->next |
4110 | && (TREE_CODE (candidates->fn) == FUNCTION_DECL)) | |
c166b898 | 4111 | return cp_build_function_call_vec (candidates->fn, args, complain); |
971e17ff AS |
4112 | |
4113 | // Otherwise, emit notes for non-viable candidates. | |
5ade1ed2 DG |
4114 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) |
4115 | fn = TREE_OPERAND (fn, 0); | |
c29f393f | 4116 | print_error_for_call_failure (fn, *args, candidates); |
5ade1ed2 | 4117 | } |
5bd61841 | 4118 | result = error_mark_node; |
125e6594 | 4119 | } |
5bd61841 | 4120 | else |
2e1df0f0 DN |
4121 | { |
4122 | int flags = LOOKUP_NORMAL; | |
4123 | /* If fn is template_id_expr, the call has explicit template arguments | |
4124 | (e.g. func<int>(5)), communicate this info to build_over_call | |
4125 | through flags so that later we can use it to decide whether to warn | |
4126 | about peculiar null pointer conversion. */ | |
4127 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
971e17ff AS |
4128 | { |
4129 | /* If overload resolution selects a specialization of a | |
4130 | function concept for non-dependent template arguments, | |
4131 | the expression is true if the constraints are satisfied | |
4132 | and false otherwise. | |
4133 | ||
4134 | NOTE: This is an extension of Concepts Lite TS that | |
4135 | allows constraints to be used in expressions. */ | |
4136 | if (flag_concepts && !processing_template_decl) | |
4137 | { | |
4138 | tree tmpl = DECL_TI_TEMPLATE (cand->fn); | |
4139 | tree targs = DECL_TI_ARGS (cand->fn); | |
4140 | tree decl = DECL_TEMPLATE_RESULT (tmpl); | |
4141 | if (DECL_DECLARED_CONCEPT_P (decl)) | |
4142 | return evaluate_function_concept (decl, targs); | |
4143 | } | |
4144 | ||
4145 | flags |= LOOKUP_EXPLICIT_TMPL_ARGS; | |
4146 | } | |
4147 | ||
2e1df0f0 DN |
4148 | result = build_over_call (cand, flags, complain); |
4149 | } | |
c73964b2 | 4150 | |
5bd61841 MM |
4151 | /* Free all the conversions we allocated. */ |
4152 | obstack_free (&conversion_obstack, p); | |
4153 | ||
4154 | return result; | |
125e6594 | 4155 | } |
c73964b2 | 4156 | |
125e6594 MM |
4157 | /* Build a call to a global operator new. FNNAME is the name of the |
4158 | operator (either "operator new" or "operator new[]") and ARGS are | |
c166b898 ILT |
4159 | the arguments provided. This may change ARGS. *SIZE points to the |
4160 | total number of bytes required by the allocation, and is updated if | |
4161 | that is changed here. *COOKIE_SIZE is non-NULL if a cookie should | |
4162 | be used. If this function determines that no cookie should be | |
4a84253c FW |
4163 | used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK |
4164 | is not NULL_TREE, it is evaluated before calculating the final | |
4165 | array size, and if it fails, the array size is replaced with | |
4166 | (size_t)-1 (usually triggering a std::bad_alloc exception). If FN | |
4167 | is non-NULL, it will be set, upon return, to the allocation | |
4168 | function called. */ | |
c73964b2 | 4169 | |
125e6594 | 4170 | tree |
9771b263 | 4171 | build_operator_new_call (tree fnname, vec<tree, va_gc> **args, |
4a84253c | 4172 | tree *size, tree *cookie_size, tree size_check, |
b40e334f | 4173 | tree *fn, tsubst_flags_t complain) |
125e6594 | 4174 | { |
4a84253c | 4175 | tree original_size = *size; |
125e6594 MM |
4176 | tree fns; |
4177 | struct z_candidate *candidates; | |
4178 | struct z_candidate *cand; | |
4179 | bool any_viable_p; | |
4180 | ||
63c9a190 MM |
4181 | if (fn) |
4182 | *fn = NULL_TREE; | |
4a84253c FW |
4183 | /* Set to (size_t)-1 if the size check fails. */ |
4184 | if (size_check != NULL_TREE) | |
7d5e76c8 JM |
4185 | { |
4186 | tree errval = TYPE_MAX_VALUE (sizetype); | |
f391b44b | 4187 | if (cxx_dialect >= cxx11 && flag_exceptions) |
7d5e76c8 JM |
4188 | errval = throw_bad_array_new_length (); |
4189 | *size = fold_build3 (COND_EXPR, sizetype, size_check, | |
4190 | original_size, errval); | |
4191 | } | |
9771b263 | 4192 | vec_safe_insert (*args, 0, *size); |
b40e334f | 4193 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4194 | if (*args == NULL) |
4195 | return error_mark_node; | |
125e6594 | 4196 | |
12cf89fa MM |
4197 | /* Based on: |
4198 | ||
4199 | [expr.new] | |
4200 | ||
4201 | If this lookup fails to find the name, or if the allocated type | |
4202 | is not a class type, the allocation function's name is looked | |
4203 | up in the global scope. | |
4204 | ||
4205 | we disregard block-scope declarations of "operator new". */ | |
c166b898 | 4206 | fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false); |
2c73f9f5 | 4207 | |
125e6594 | 4208 | /* Figure out what function is being called. */ |
b40e334f PC |
4209 | cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p, |
4210 | complain); | |
c8094d83 | 4211 | |
125e6594 MM |
4212 | /* If no suitable function could be found, issue an error message |
4213 | and give up. */ | |
4214 | if (!cand) | |
4215 | { | |
b40e334f | 4216 | if (complain & tf_error) |
c29f393f | 4217 | print_error_for_call_failure (fns, *args, candidates); |
125e6594 MM |
4218 | return error_mark_node; |
4219 | } | |
4220 | ||
4221 | /* If a cookie is required, add some extra space. Whether | |
4222 | or not a cookie is required cannot be determined until | |
4223 | after we know which function was called. */ | |
4224 | if (*cookie_size) | |
4225 | { | |
4226 | bool use_cookie = true; | |
90d84934 JM |
4227 | tree arg_types; |
4228 | ||
4229 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn)); | |
4230 | /* Skip the size_t parameter. */ | |
4231 | arg_types = TREE_CHAIN (arg_types); | |
4232 | /* Check the remaining parameters (if any). */ | |
4233 | if (arg_types | |
4234 | && TREE_CHAIN (arg_types) == void_list_node | |
4235 | && same_type_p (TREE_VALUE (arg_types), | |
4236 | ptr_type_node)) | |
4237 | use_cookie = false; | |
125e6594 MM |
4238 | /* If we need a cookie, adjust the number of bytes allocated. */ |
4239 | if (use_cookie) | |
4240 | { | |
4241 | /* Update the total size. */ | |
4a84253c FW |
4242 | *size = size_binop (PLUS_EXPR, original_size, *cookie_size); |
4243 | /* Set to (size_t)-1 if the size check fails. */ | |
4244 | gcc_assert (size_check != NULL_TREE); | |
4245 | *size = fold_build3 (COND_EXPR, sizetype, size_check, | |
4246 | *size, TYPE_MAX_VALUE (sizetype)); | |
125e6594 | 4247 | /* Update the argument list to reflect the adjusted size. */ |
9771b263 | 4248 | (**args)[0] = *size; |
125e6594 MM |
4249 | } |
4250 | else | |
4251 | *cookie_size = NULL_TREE; | |
4252 | } | |
4253 | ||
63c9a190 MM |
4254 | /* Tell our caller which function we decided to call. */ |
4255 | if (fn) | |
4256 | *fn = cand->fn; | |
4257 | ||
125e6594 | 4258 | /* Build the CALL_EXPR. */ |
b40e334f | 4259 | return build_over_call (cand, LOOKUP_NORMAL, complain); |
c73964b2 MS |
4260 | } |
4261 | ||
c166b898 ILT |
4262 | /* Build a new call to operator(). This may change ARGS. */ |
4263 | ||
575bfb00 | 4264 | static tree |
9771b263 | 4265 | build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
c73964b2 MS |
4266 | { |
4267 | struct z_candidate *candidates = 0, *cand; | |
c166b898 | 4268 | tree fns, convs, first_mem_arg = NULL_TREE; |
c73964b2 | 4269 | tree type = TREE_TYPE (obj); |
436f8a4c | 4270 | bool any_viable_p; |
5bd61841 MM |
4271 | tree result = NULL_TREE; |
4272 | void *p; | |
c73964b2 | 4273 | |
c166b898 ILT |
4274 | if (error_operand_p (obj)) |
4275 | return error_mark_node; | |
4276 | ||
4277 | obj = prep_operand (obj); | |
4278 | ||
297dcfb3 MM |
4279 | if (TYPE_PTRMEMFUNC_P (type)) |
4280 | { | |
5ade1ed2 DG |
4281 | if (complain & tf_error) |
4282 | /* It's no good looking for an overloaded operator() on a | |
4283 | pointer-to-member-function. */ | |
4284 | error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj); | |
297dcfb3 MM |
4285 | return error_mark_node; |
4286 | } | |
4287 | ||
687d71b3 DE |
4288 | if (TYPE_BINFO (type)) |
4289 | { | |
4290 | fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1); | |
4291 | if (fns == error_mark_node) | |
4292 | return error_mark_node; | |
4293 | } | |
4294 | else | |
4295 | fns = NULL_TREE; | |
c73964b2 | 4296 | |
c166b898 ILT |
4297 | if (args != NULL && *args != NULL) |
4298 | { | |
b46c79a1 | 4299 | *args = resolve_args (*args, complain); |
c166b898 ILT |
4300 | if (*args == NULL) |
4301 | return error_mark_node; | |
4302 | } | |
86e6f22f | 4303 | |
5bd61841 MM |
4304 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4305 | p = conversion_obstack_alloc (0); | |
4306 | ||
c73964b2 MS |
4307 | if (fns) |
4308 | { | |
a7175123 | 4309 | first_mem_arg = obj; |
c73964b2 | 4310 | |
5c824000 JM |
4311 | add_candidates (BASELINK_FUNCTIONS (fns), |
4312 | first_mem_arg, *args, NULL_TREE, | |
4313 | NULL_TREE, false, | |
4314 | BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns), | |
b40e334f | 4315 | LOOKUP_NORMAL, &candidates, complain); |
c73964b2 MS |
4316 | } |
4317 | ||
9c7d5cae | 4318 | convs = lookup_conversions (type); |
c73964b2 MS |
4319 | |
4320 | for (; convs; convs = TREE_CHAIN (convs)) | |
4321 | { | |
2c73f9f5 | 4322 | tree fns = TREE_VALUE (convs); |
e57d93c6 | 4323 | tree totype = TREE_TYPE (convs); |
c73964b2 | 4324 | |
5950480c PC |
4325 | if (TYPE_PTRFN_P (totype) |
4326 | || TYPE_REFFN_P (totype) | |
477f6664 | 4327 | || (TREE_CODE (totype) == REFERENCE_TYPE |
5950480c | 4328 | && TYPE_PTRFN_P (TREE_TYPE (totype)))) |
d64db93f | 4329 | for (; fns; fns = OVL_NEXT (fns)) |
c73964b2 | 4330 | { |
d64db93f | 4331 | tree fn = OVL_CURRENT (fns); |
e57d93c6 JM |
4332 | |
4333 | if (DECL_NONCONVERTING_P (fn)) | |
4334 | continue; | |
4335 | ||
c8094d83 MS |
4336 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
4337 | add_template_conv_candidate | |
c166b898 | 4338 | (&candidates, fn, obj, NULL_TREE, *args, totype, |
7993382e | 4339 | /*access_path=*/NULL_TREE, |
b40e334f | 4340 | /*conversion_path=*/NULL_TREE, complain); |
786b5245 | 4341 | else |
c166b898 ILT |
4342 | add_conv_candidate (&candidates, fn, obj, NULL_TREE, |
4343 | *args, /*conversion_path=*/NULL_TREE, | |
b40e334f | 4344 | /*access_path=*/NULL_TREE, complain); |
c73964b2 MS |
4345 | } |
4346 | } | |
4347 | ||
89606913 JM |
4348 | /* Be strict here because if we choose a bad conversion candidate, the |
4349 | errors we get won't mention the call context. */ | |
4350 | candidates = splice_viable (candidates, true, &any_viable_p); | |
436f8a4c | 4351 | if (!any_viable_p) |
c73964b2 | 4352 | { |
5ade1ed2 DG |
4353 | if (complain & tf_error) |
4354 | { | |
c166b898 ILT |
4355 | error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj), |
4356 | build_tree_list_vec (*args)); | |
feb6efc1 | 4357 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
5ade1ed2 | 4358 | } |
5bd61841 | 4359 | result = error_mark_node; |
c73964b2 | 4360 | } |
5bd61841 | 4361 | else |
c73964b2 | 4362 | { |
b40e334f | 4363 | cand = tourney (candidates, complain); |
5bd61841 MM |
4364 | if (cand == 0) |
4365 | { | |
5ade1ed2 DG |
4366 | if (complain & tf_error) |
4367 | { | |
4368 | error ("call of %<(%T) (%A)%> is ambiguous", | |
c166b898 | 4369 | TREE_TYPE (obj), build_tree_list_vec (*args)); |
feb6efc1 | 4370 | print_z_candidates (location_of (TREE_TYPE (obj)), candidates); |
5ade1ed2 | 4371 | } |
5bd61841 MM |
4372 | result = error_mark_node; |
4373 | } | |
4374 | /* Since cand->fn will be a type, not a function, for a conversion | |
4375 | function, we must be careful not to unconditionally look at | |
4376 | DECL_NAME here. */ | |
4377 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL | |
4378 | && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR) | |
5ade1ed2 | 4379 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
5bd61841 MM |
4380 | else |
4381 | { | |
5ade1ed2 DG |
4382 | obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1, |
4383 | complain); | |
db24eb1f | 4384 | obj = convert_from_reference (obj); |
c166b898 | 4385 | result = cp_build_function_call_vec (obj, args, complain); |
5bd61841 | 4386 | } |
c73964b2 MS |
4387 | } |
4388 | ||
5bd61841 MM |
4389 | /* Free all the conversions we allocated. */ |
4390 | obstack_free (&conversion_obstack, p); | |
c73964b2 | 4391 | |
5bd61841 | 4392 | return result; |
c73964b2 MS |
4393 | } |
4394 | ||
575bfb00 LC |
4395 | /* Wrapper for above. */ |
4396 | ||
4397 | tree | |
9771b263 | 4398 | build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain) |
575bfb00 LC |
4399 | { |
4400 | tree ret; | |
4877e471 | 4401 | bool subtime = timevar_cond_start (TV_OVERLOAD); |
575bfb00 | 4402 | ret = build_op_call_1 (obj, args, complain); |
4877e471 | 4403 | timevar_cond_stop (TV_OVERLOAD, subtime); |
575bfb00 LC |
4404 | return ret; |
4405 | } | |
4406 | ||
051b40ff PC |
4407 | /* Called by op_error to prepare format strings suitable for the error |
4408 | function. It concatenates a prefix (controlled by MATCH), ERRMSG, | |
4409 | and a suffix (controlled by NTYPES). */ | |
4410 | ||
4411 | static const char * | |
4412 | op_error_string (const char *errmsg, int ntypes, bool match) | |
4413 | { | |
4414 | const char *msg; | |
4415 | ||
4416 | const char *msgp = concat (match ? G_("ambiguous overload for ") | |
4417 | : G_("no match for "), errmsg, NULL); | |
4418 | ||
4419 | if (ntypes == 3) | |
4420 | msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL); | |
4421 | else if (ntypes == 2) | |
4422 | msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL); | |
4423 | else | |
4424 | msg = concat (msgp, G_(" (operand type is %qT)"), NULL); | |
4425 | ||
4426 | return msg; | |
4427 | } | |
4428 | ||
c73964b2 | 4429 | static void |
4fe977f2 | 4430 | op_error (location_t loc, enum tree_code code, enum tree_code code2, |
4cd5a50a | 4431 | tree arg1, tree arg2, tree arg3, bool match) |
c73964b2 | 4432 | { |
cdb71673 | 4433 | const char *opname; |
596ea4e5 AS |
4434 | |
4435 | if (code == MODIFY_EXPR) | |
4436 | opname = assignment_operator_name_info[code2].name; | |
4437 | else | |
4438 | opname = operator_name_info[code].name; | |
c73964b2 MS |
4439 | |
4440 | switch (code) | |
4441 | { | |
4442 | case COND_EXPR: | |
051b40ff | 4443 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4444 | error_at (loc, op_error_string (G_("ternary %<operator?:%>"), |
4445 | 3, match), | |
4446 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
4cd5a50a | 4447 | else |
4fe977f2 PC |
4448 | error_at (loc, op_error_string (G_("ternary %<operator?:%> " |
4449 | "in %<%E ? %E : %E%>"), 3, match), | |
4450 | arg1, arg2, arg3, | |
4451 | TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3)); | |
c73964b2 | 4452 | break; |
c8094d83 | 4453 | |
c73964b2 MS |
4454 | case POSTINCREMENT_EXPR: |
4455 | case POSTDECREMENT_EXPR: | |
051b40ff | 4456 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4457 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4458 | opname, TREE_TYPE (arg1)); | |
4cd5a50a | 4459 | else |
4fe977f2 PC |
4460 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"), |
4461 | 1, match), | |
4462 | opname, arg1, opname, TREE_TYPE (arg1)); | |
c73964b2 | 4463 | break; |
c8094d83 | 4464 | |
c73964b2 | 4465 | case ARRAY_REF: |
051b40ff | 4466 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4467 | error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match), |
4468 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
4cd5a50a | 4469 | else |
4fe977f2 PC |
4470 | error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"), |
4471 | 2, match), | |
4472 | arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
c73964b2 | 4473 | break; |
19948e32 GDR |
4474 | |
4475 | case REALPART_EXPR: | |
4476 | case IMAGPART_EXPR: | |
051b40ff | 4477 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4478 | error_at (loc, op_error_string (G_("%qs"), 1, match), |
4479 | opname, TREE_TYPE (arg1)); | |
4cd5a50a | 4480 | else |
4fe977f2 PC |
4481 | error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match), |
4482 | opname, opname, arg1, TREE_TYPE (arg1)); | |
19948e32 | 4483 | break; |
c8094d83 | 4484 | |
c73964b2 MS |
4485 | default: |
4486 | if (arg2) | |
051b40ff | 4487 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4488 | error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match), |
4489 | opname, TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
051b40ff | 4490 | else |
4fe977f2 PC |
4491 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"), |
4492 | 2, match), | |
4493 | opname, arg1, opname, arg2, | |
4494 | TREE_TYPE (arg1), TREE_TYPE (arg2)); | |
c73964b2 | 4495 | else |
051b40ff | 4496 | if (flag_diagnostics_show_caret) |
4fe977f2 PC |
4497 | error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match), |
4498 | opname, TREE_TYPE (arg1)); | |
051b40ff | 4499 | else |
4fe977f2 PC |
4500 | error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"), |
4501 | 1, match), | |
4502 | opname, opname, arg1, TREE_TYPE (arg1)); | |
84cc377e | 4503 | break; |
c73964b2 MS |
4504 | } |
4505 | } | |
4506 | ||
a7a64a77 MM |
4507 | /* Return the implicit conversion sequence that could be used to |
4508 | convert E1 to E2 in [expr.cond]. */ | |
4509 | ||
5bd61841 | 4510 | static conversion * |
b40e334f | 4511 | conditional_conversion (tree e1, tree e2, tsubst_flags_t complain) |
a7a64a77 MM |
4512 | { |
4513 | tree t1 = non_reference (TREE_TYPE (e1)); | |
4514 | tree t2 = non_reference (TREE_TYPE (e2)); | |
5bd61841 | 4515 | conversion *conv; |
9cefd2ca | 4516 | bool good_base; |
a7a64a77 MM |
4517 | |
4518 | /* [expr.cond] | |
4519 | ||
4520 | If E2 is an lvalue: E1 can be converted to match E2 if E1 can be | |
dbbc379e | 4521 | implicitly converted (clause _conv_) to the type "lvalue reference to |
a7a64a77 | 4522 | T2", subject to the constraint that in the conversion the |
e8ee694a JM |
4523 | reference must bind directly (_dcl.init.ref_) to an lvalue. |
4524 | ||
4525 | If E2 is an xvalue: E1 can be converted to match E2 if E1 can be | |
4526 | implicitly converted to the type "rvalue reference to T2", subject to | |
4527 | the constraint that the reference must bind directly. */ | |
4528 | if (lvalue_or_rvalue_with_address_p (e2)) | |
a7a64a77 | 4529 | { |
e8ee694a JM |
4530 | tree rtype = cp_build_reference_type (t2, !real_lvalue_p (e2)); |
4531 | conv = implicit_conversion (rtype, | |
a7a64a77 MM |
4532 | t1, |
4533 | e1, | |
34b5375f | 4534 | /*c_cast_p=*/false, |
dbbc379e | 4535 | LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND |
b40e334f PC |
4536 | |LOOKUP_ONLYCONVERTING, |
4537 | complain); | |
e8ee694a | 4538 | if (conv && !conv->bad_p) |
a7a64a77 MM |
4539 | return conv; |
4540 | } | |
4541 | ||
e8ee694a JM |
4542 | /* If E2 is a prvalue or if neither of the conversions above can be done |
4543 | and at least one of the operands has (possibly cv-qualified) class | |
4544 | type: */ | |
4545 | if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2)) | |
4546 | return NULL; | |
4547 | ||
a7a64a77 MM |
4548 | /* [expr.cond] |
4549 | ||
4550 | If E1 and E2 have class type, and the underlying class types are | |
4551 | the same or one is a base class of the other: E1 can be converted | |
4552 | to match E2 if the class of T2 is the same type as, or a base | |
4553 | class of, the class of T1, and the cv-qualification of T2 is the | |
4554 | same cv-qualification as, or a greater cv-qualification than, the | |
4555 | cv-qualification of T1. If the conversion is applied, E1 is | |
4556 | changed to an rvalue of type T2 that still refers to the original | |
26bcf8fc | 4557 | source class object (or the appropriate subobject thereof). */ |
a7a64a77 | 4558 | if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2) |
9cefd2ca | 4559 | && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2))) |
a7a64a77 | 4560 | { |
9cefd2ca | 4561 | if (good_base && at_least_as_qualified_p (t2, t1)) |
a7a64a77 | 4562 | { |
5bd61841 | 4563 | conv = build_identity_conv (t1, e1); |
c8094d83 | 4564 | if (!same_type_p (TYPE_MAIN_VARIANT (t1), |
4f0aa416 | 4565 | TYPE_MAIN_VARIANT (t2))) |
26bcf8fc | 4566 | conv = build_conv (ck_base, t2, conv); |
5f7262e6 | 4567 | else |
5bd61841 | 4568 | conv = build_conv (ck_rvalue, t2, conv); |
a7a64a77 MM |
4569 | return conv; |
4570 | } | |
4571 | else | |
5bd61841 | 4572 | return NULL; |
a7a64a77 | 4573 | } |
9cefd2ca JM |
4574 | else |
4575 | /* [expr.cond] | |
a7a64a77 | 4576 | |
9cefd2ca JM |
4577 | Otherwise: E1 can be converted to match E2 if E1 can be implicitly |
4578 | converted to the type that expression E2 would have if E2 were | |
4579 | converted to an rvalue (or the type it has, if E2 is an rvalue). */ | |
34b5375f | 4580 | return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false, |
b40e334f | 4581 | LOOKUP_IMPLICIT, complain); |
a7a64a77 MM |
4582 | } |
4583 | ||
4584 | /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three | |
4ba126e4 | 4585 | arguments to the conditional expression. */ |
a7a64a77 | 4586 | |
575bfb00 | 4587 | static tree |
4cbc4bd7 | 4588 | build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3, |
575bfb00 | 4589 | tsubst_flags_t complain) |
a7a64a77 MM |
4590 | { |
4591 | tree arg2_type; | |
4592 | tree arg3_type; | |
5bd61841 | 4593 | tree result = NULL_TREE; |
a7a64a77 | 4594 | tree result_type = NULL_TREE; |
94be8403 | 4595 | bool lvalue_p = true; |
a7a64a77 MM |
4596 | struct z_candidate *candidates = 0; |
4597 | struct z_candidate *cand; | |
5bd61841 | 4598 | void *p; |
8d0d1915 | 4599 | tree orig_arg2, orig_arg3; |
a7a64a77 MM |
4600 | |
4601 | /* As a G++ extension, the second argument to the conditional can be | |
4602 | omitted. (So that `a ? : c' is roughly equivalent to `a ? a : | |
09dd27d4 MM |
4603 | c'.) If the second operand is omitted, make sure it is |
4604 | calculated only once. */ | |
a7a64a77 MM |
4605 | if (!arg2) |
4606 | { | |
fcf73884 | 4607 | if (complain & tf_error) |
4cbc4bd7 | 4608 | pedwarn (loc, OPT_Wpedantic, |
fcf73884 | 4609 | "ISO C++ forbids omitting the middle term of a ?: expression"); |
4e8dca1c JM |
4610 | |
4611 | /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */ | |
4612 | if (real_lvalue_p (arg1)) | |
4613 | arg2 = arg1 = stabilize_reference (arg1); | |
4614 | else | |
4615 | arg2 = arg1 = save_expr (arg1); | |
a7a64a77 MM |
4616 | } |
4617 | ||
93100c6b MG |
4618 | /* If something has already gone wrong, just pass that fact up the |
4619 | tree. */ | |
4620 | if (error_operand_p (arg1) | |
4621 | || error_operand_p (arg2) | |
4622 | || error_operand_p (arg3)) | |
4623 | return error_mark_node; | |
4624 | ||
4625 | orig_arg2 = arg2; | |
4626 | orig_arg3 = arg3; | |
4627 | ||
4628 | if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1))) | |
4629 | { | |
4630 | arg1 = force_rvalue (arg1, complain); | |
4631 | arg2 = force_rvalue (arg2, complain); | |
4632 | arg3 = force_rvalue (arg3, complain); | |
4633 | ||
25c541b4 MG |
4634 | /* force_rvalue can return error_mark on valid arguments. */ |
4635 | if (error_operand_p (arg1) | |
4636 | || error_operand_p (arg2) | |
4637 | || error_operand_p (arg3)) | |
4638 | return error_mark_node; | |
4639 | ||
93100c6b MG |
4640 | tree arg1_type = TREE_TYPE (arg1); |
4641 | arg2_type = TREE_TYPE (arg2); | |
4642 | arg3_type = TREE_TYPE (arg3); | |
4643 | ||
b55b02ea MP |
4644 | if (!VECTOR_TYPE_P (arg2_type) |
4645 | && !VECTOR_TYPE_P (arg3_type)) | |
93100c6b | 4646 | { |
07298ffd MG |
4647 | /* Rely on the error messages of the scalar version. */ |
4648 | tree scal = build_conditional_expr_1 (loc, integer_one_node, | |
4649 | orig_arg2, orig_arg3, complain); | |
4650 | if (scal == error_mark_node) | |
4651 | return error_mark_node; | |
4652 | tree stype = TREE_TYPE (scal); | |
4653 | tree ctype = TREE_TYPE (arg1_type); | |
4654 | if (TYPE_SIZE (stype) != TYPE_SIZE (ctype) | |
4655 | || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype))) | |
4656 | { | |
4657 | if (complain & tf_error) | |
4658 | error_at (loc, "inferred scalar type %qT is not an integer or " | |
4659 | "floating point type of the same size as %qT", stype, | |
4660 | COMPARISON_CLASS_P (arg1) | |
4661 | ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0))) | |
4662 | : ctype); | |
4663 | return error_mark_node; | |
4664 | } | |
4665 | ||
4666 | tree vtype = build_opaque_vector_type (stype, | |
4667 | TYPE_VECTOR_SUBPARTS (arg1_type)); | |
4668 | /* We could pass complain & tf_warning to unsafe_conversion_p, | |
4669 | but the warnings (like Wsign-conversion) have already been | |
4670 | given by the scalar build_conditional_expr_1. We still check | |
4671 | unsafe_conversion_p to forbid truncating long long -> float. */ | |
68fca595 | 4672 | if (unsafe_conversion_p (loc, stype, arg2, false)) |
07298ffd MG |
4673 | { |
4674 | if (complain & tf_error) | |
4675 | error_at (loc, "conversion of scalar %qT to vector %qT " | |
4676 | "involves truncation", arg2_type, vtype); | |
4677 | return error_mark_node; | |
4678 | } | |
68fca595 | 4679 | if (unsafe_conversion_p (loc, stype, arg3, false)) |
07298ffd MG |
4680 | { |
4681 | if (complain & tf_error) | |
4682 | error_at (loc, "conversion of scalar %qT to vector %qT " | |
4683 | "involves truncation", arg3_type, vtype); | |
4684 | return error_mark_node; | |
4685 | } | |
4686 | ||
4687 | arg2 = cp_convert (stype, arg2, complain); | |
4688 | arg2 = save_expr (arg2); | |
4689 | arg2 = build_vector_from_val (vtype, arg2); | |
4690 | arg2_type = vtype; | |
4691 | arg3 = cp_convert (stype, arg3, complain); | |
4692 | arg3 = save_expr (arg3); | |
4693 | arg3 = build_vector_from_val (vtype, arg3); | |
4694 | arg3_type = vtype; | |
93100c6b MG |
4695 | } |
4696 | ||
b55b02ea | 4697 | if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type)) |
93100c6b MG |
4698 | { |
4699 | enum stv_conv convert_flag = | |
4cbc4bd7 | 4700 | scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3, |
93100c6b MG |
4701 | complain & tf_error); |
4702 | ||
4703 | switch (convert_flag) | |
4704 | { | |
4705 | case stv_error: | |
4706 | return error_mark_node; | |
4707 | case stv_firstarg: | |
4708 | { | |
07298ffd | 4709 | arg2 = save_expr (arg2); |
93100c6b MG |
4710 | arg2 = convert (TREE_TYPE (arg3_type), arg2); |
4711 | arg2 = build_vector_from_val (arg3_type, arg2); | |
4712 | arg2_type = TREE_TYPE (arg2); | |
4713 | break; | |
4714 | } | |
4715 | case stv_secondarg: | |
4716 | { | |
07298ffd | 4717 | arg3 = save_expr (arg3); |
93100c6b MG |
4718 | arg3 = convert (TREE_TYPE (arg2_type), arg3); |
4719 | arg3 = build_vector_from_val (arg2_type, arg3); | |
4720 | arg3_type = TREE_TYPE (arg3); | |
4721 | break; | |
4722 | } | |
4723 | default: | |
4724 | break; | |
4725 | } | |
4726 | } | |
4727 | ||
4728 | if (!same_type_p (arg2_type, arg3_type) | |
4729 | || TYPE_VECTOR_SUBPARTS (arg1_type) | |
4730 | != TYPE_VECTOR_SUBPARTS (arg2_type) | |
4731 | || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type)) | |
4732 | { | |
4733 | if (complain & tf_error) | |
4cbc4bd7 PC |
4734 | error_at (loc, |
4735 | "incompatible vector types in conditional expression: " | |
4736 | "%qT, %qT and %qT", TREE_TYPE (arg1), | |
4737 | TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3)); | |
93100c6b MG |
4738 | return error_mark_node; |
4739 | } | |
4740 | ||
4741 | if (!COMPARISON_CLASS_P (arg1)) | |
4cbc4bd7 | 4742 | arg1 = cp_build_binary_op (loc, NE_EXPR, arg1, |
749dee7e | 4743 | build_zero_cst (arg1_type), complain); |
08e0cda6 | 4744 | return fold_build3 (VEC_COND_EXPR, arg2_type, arg1, arg2, arg3); |
93100c6b MG |
4745 | } |
4746 | ||
07c88314 | 4747 | /* [expr.cond] |
c8094d83 | 4748 | |
39a13be5 | 4749 | The first expression is implicitly converted to bool (clause |
07c88314 | 4750 | _conv_). */ |
1dad57e6 JM |
4751 | arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain, |
4752 | LOOKUP_NORMAL); | |
93100c6b | 4753 | if (error_operand_p (arg1)) |
a7a64a77 MM |
4754 | return error_mark_node; |
4755 | ||
a7a64a77 MM |
4756 | /* [expr.cond] |
4757 | ||
4758 | If either the second or the third operand has type (possibly | |
4759 | cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_), | |
4760 | array-to-pointer (_conv.array_), and function-to-pointer | |
4761 | (_conv.func_) standard conversions are performed on the second | |
4762 | and third operands. */ | |
f9aa54d3 MM |
4763 | arg2_type = unlowered_expr_type (arg2); |
4764 | arg3_type = unlowered_expr_type (arg3); | |
b72801e2 | 4765 | if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type)) |
a7a64a77 | 4766 | { |
a7a64a77 MM |
4767 | /* Do the conversions. We don't these for `void' type arguments |
4768 | since it can't have any effect and since decay_conversion | |
4769 | does not handle that case gracefully. */ | |
b72801e2 | 4770 | if (!VOID_TYPE_P (arg2_type)) |
89fcabaf | 4771 | arg2 = decay_conversion (arg2, complain); |
b72801e2 | 4772 | if (!VOID_TYPE_P (arg3_type)) |
89fcabaf | 4773 | arg3 = decay_conversion (arg3, complain); |
a7a64a77 MM |
4774 | arg2_type = TREE_TYPE (arg2); |
4775 | arg3_type = TREE_TYPE (arg3); | |
4776 | ||
a7a64a77 MM |
4777 | /* [expr.cond] |
4778 | ||
4779 | One of the following shall hold: | |
4780 | ||
4781 | --The second or the third operand (but not both) is a | |
4782 | throw-expression (_except.throw_); the result is of the | |
4783 | type of the other and is an rvalue. | |
4784 | ||
4785 | --Both the second and the third operands have type void; the | |
c8094d83 | 4786 | result is of type void and is an rvalue. |
9d363a56 | 4787 | |
0cbd7506 | 4788 | We must avoid calling force_rvalue for expressions of type |
9d363a56 | 4789 | "void" because it will complain that their value is being |
324f9dfb | 4790 | used. */ |
c8094d83 | 4791 | if (TREE_CODE (arg2) == THROW_EXPR |
41dffe62 MM |
4792 | && TREE_CODE (arg3) != THROW_EXPR) |
4793 | { | |
9d363a56 | 4794 | if (!VOID_TYPE_P (arg3_type)) |
574cfaa4 JM |
4795 | { |
4796 | arg3 = force_rvalue (arg3, complain); | |
4797 | if (arg3 == error_mark_node) | |
4798 | return error_mark_node; | |
4799 | } | |
41dffe62 MM |
4800 | arg3_type = TREE_TYPE (arg3); |
4801 | result_type = arg3_type; | |
4802 | } | |
c8094d83 | 4803 | else if (TREE_CODE (arg2) != THROW_EXPR |
41dffe62 MM |
4804 | && TREE_CODE (arg3) == THROW_EXPR) |
4805 | { | |
9d363a56 | 4806 | if (!VOID_TYPE_P (arg2_type)) |
574cfaa4 JM |
4807 | { |
4808 | arg2 = force_rvalue (arg2, complain); | |
4809 | if (arg2 == error_mark_node) | |
4810 | return error_mark_node; | |
4811 | } | |
41dffe62 MM |
4812 | arg2_type = TREE_TYPE (arg2); |
4813 | result_type = arg2_type; | |
4814 | } | |
b72801e2 | 4815 | else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type)) |
a7a64a77 MM |
4816 | result_type = void_type_node; |
4817 | else | |
4818 | { | |
5ade1ed2 DG |
4819 | if (complain & tf_error) |
4820 | { | |
4821 | if (VOID_TYPE_P (arg2_type)) | |
4cbc4bd7 PC |
4822 | error_at (EXPR_LOC_OR_LOC (arg3, loc), |
4823 | "second operand to the conditional operator " | |
4824 | "is of type %<void%>, but the third operand is " | |
4825 | "neither a throw-expression nor of type %<void%>"); | |
5ade1ed2 | 4826 | else |
4cbc4bd7 PC |
4827 | error_at (EXPR_LOC_OR_LOC (arg2, loc), |
4828 | "third operand to the conditional operator " | |
4829 | "is of type %<void%>, but the second operand is " | |
4830 | "neither a throw-expression nor of type %<void%>"); | |
5ade1ed2 | 4831 | } |
a7a64a77 MM |
4832 | return error_mark_node; |
4833 | } | |
4834 | ||
94be8403 | 4835 | lvalue_p = false; |
a7a64a77 MM |
4836 | goto valid_operands; |
4837 | } | |
4838 | /* [expr.cond] | |
4839 | ||
4840 | Otherwise, if the second and third operand have different types, | |
e8ee694a JM |
4841 | and either has (possibly cv-qualified) class type, or if both are |
4842 | glvalues of the same value category and the same type except for | |
4843 | cv-qualification, an attempt is made to convert each of those operands | |
4844 | to the type of the other. */ | |
a7a64a77 | 4845 | else if (!same_type_p (arg2_type, arg3_type) |
e8ee694a JM |
4846 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type) |
4847 | || (same_type_ignoring_top_level_qualifiers_p (arg2_type, | |
4848 | arg3_type) | |
4849 | && lvalue_or_rvalue_with_address_p (arg2) | |
4850 | && lvalue_or_rvalue_with_address_p (arg3) | |
4851 | && real_lvalue_p (arg2) == real_lvalue_p (arg3)))) | |
a7a64a77 | 4852 | { |
5bd61841 MM |
4853 | conversion *conv2; |
4854 | conversion *conv3; | |
0eb5f158 | 4855 | bool converted = false; |
c8094d83 | 4856 | |
5bd61841 MM |
4857 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
4858 | p = conversion_obstack_alloc (0); | |
4859 | ||
b40e334f PC |
4860 | conv2 = conditional_conversion (arg2, arg3, complain); |
4861 | conv3 = conditional_conversion (arg3, arg2, complain); | |
5bd61841 | 4862 | |
a7a64a77 MM |
4863 | /* [expr.cond] |
4864 | ||
4865 | If both can be converted, or one can be converted but the | |
4866 | conversion is ambiguous, the program is ill-formed. If | |
4867 | neither can be converted, the operands are left unchanged and | |
4868 | further checking is performed as described below. If exactly | |
4869 | one conversion is possible, that conversion is applied to the | |
4870 | chosen operand and the converted operand is used in place of | |
4871 | the original operand for the remainder of this section. */ | |
5bd61841 MM |
4872 | if ((conv2 && !conv2->bad_p |
4873 | && conv3 && !conv3->bad_p) | |
4874 | || (conv2 && conv2->kind == ck_ambig) | |
4875 | || (conv3 && conv3->kind == ck_ambig)) | |
a7a64a77 | 4876 | { |
76545796 | 4877 | if (complain & tf_error) |
5f901ccf JM |
4878 | { |
4879 | error_at (loc, "operands to ?: have different types %qT and %qT", | |
4880 | arg2_type, arg3_type); | |
4881 | if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p) | |
4882 | inform (loc, " and each type can be converted to the other"); | |
4883 | else if (conv2 && conv2->kind == ck_ambig) | |
4884 | convert_like (conv2, arg2, complain); | |
4885 | else | |
4886 | convert_like (conv3, arg3, complain); | |
4887 | } | |
5bd61841 | 4888 | result = error_mark_node; |
a7a64a77 | 4889 | } |
bb8b1f69 | 4890 | else if (conv2 && !conv2->bad_p) |
a7a64a77 | 4891 | { |
5ade1ed2 | 4892 | arg2 = convert_like (conv2, arg2, complain); |
442aa4ec | 4893 | arg2 = convert_from_reference (arg2); |
a7a64a77 | 4894 | arg2_type = TREE_TYPE (arg2); |
2954333a MM |
4895 | /* Even if CONV2 is a valid conversion, the result of the |
4896 | conversion may be invalid. For example, if ARG3 has type | |
4897 | "volatile X", and X does not have a copy constructor | |
4898 | accepting a "volatile X&", then even if ARG2 can be | |
4899 | converted to X, the conversion will fail. */ | |
4900 | if (error_operand_p (arg2)) | |
4901 | result = error_mark_node; | |
0eb5f158 | 4902 | converted = true; |
a7a64a77 | 4903 | } |
bb8b1f69 | 4904 | else if (conv3 && !conv3->bad_p) |
a7a64a77 | 4905 | { |
5ade1ed2 | 4906 | arg3 = convert_like (conv3, arg3, complain); |
442aa4ec | 4907 | arg3 = convert_from_reference (arg3); |
a7a64a77 | 4908 | arg3_type = TREE_TYPE (arg3); |
2954333a MM |
4909 | if (error_operand_p (arg3)) |
4910 | result = error_mark_node; | |
0eb5f158 | 4911 | converted = true; |
a7a64a77 | 4912 | } |
5bd61841 MM |
4913 | |
4914 | /* Free all the conversions we allocated. */ | |
4915 | obstack_free (&conversion_obstack, p); | |
4916 | ||
4917 | if (result) | |
4918 | return result; | |
d2f2c87b MM |
4919 | |
4920 | /* If, after the conversion, both operands have class type, | |
4921 | treat the cv-qualification of both operands as if it were the | |
c8094d83 | 4922 | union of the cv-qualification of the operands. |
d2f2c87b MM |
4923 | |
4924 | The standard is not clear about what to do in this | |
4925 | circumstance. For example, if the first operand has type | |
4926 | "const X" and the second operand has a user-defined | |
4927 | conversion to "volatile X", what is the type of the second | |
4928 | operand after this step? Making it be "const X" (matching | |
4929 | the first operand) seems wrong, as that discards the | |
4ee31f1e | 4930 | qualification without actually performing a copy. Leaving it |
d2f2c87b MM |
4931 | as "volatile X" seems wrong as that will result in the |
4932 | conditional expression failing altogether, even though, | |
4933 | according to this step, the one operand could be converted to | |
4934 | the type of the other. */ | |
0eb5f158 | 4935 | if (converted |
d2f2c87b | 4936 | && CLASS_TYPE_P (arg2_type) |
a3360e77 | 4937 | && cp_type_quals (arg2_type) != cp_type_quals (arg3_type)) |
c8094d83 | 4938 | arg2_type = arg3_type = |
d2f2c87b | 4939 | cp_build_qualified_type (arg2_type, |
a3360e77 JM |
4940 | cp_type_quals (arg2_type) |
4941 | | cp_type_quals (arg3_type)); | |
a7a64a77 MM |
4942 | } |
4943 | ||
4944 | /* [expr.cond] | |
4945 | ||
76c7bf65 MG |
4946 | If the second and third operands are glvalues of the same value |
4947 | category and have the same type, the result is of that type and | |
4948 | value category. */ | |
4949 | if (((real_lvalue_p (arg2) && real_lvalue_p (arg3)) | |
4950 | || (xvalue_p (arg2) && xvalue_p (arg3))) | |
d18a8251 | 4951 | && same_type_p (arg2_type, arg3_type)) |
a7a64a77 MM |
4952 | { |
4953 | result_type = arg2_type; | |
416f380b JJ |
4954 | arg2 = mark_lvalue_use (arg2); |
4955 | arg3 = mark_lvalue_use (arg3); | |
a7a64a77 MM |
4956 | goto valid_operands; |
4957 | } | |
4958 | ||
4959 | /* [expr.cond] | |
4960 | ||
4961 | Otherwise, the result is an rvalue. If the second and third | |
4962 | operand do not have the same type, and either has (possibly | |
4963 | cv-qualified) class type, overload resolution is used to | |
4964 | determine the conversions (if any) to be applied to the operands | |
4965 | (_over.match.oper_, _over.built_). */ | |
94be8403 | 4966 | lvalue_p = false; |
a7a64a77 MM |
4967 | if (!same_type_p (arg2_type, arg3_type) |
4968 | && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type))) | |
4969 | { | |
4970 | tree args[3]; | |
5bd61841 | 4971 | conversion *conv; |
436f8a4c | 4972 | bool any_viable_p; |
a7a64a77 MM |
4973 | |
4974 | /* Rearrange the arguments so that add_builtin_candidate only has | |
7919d7b4 | 4975 | to know about two args. In build_builtin_candidate, the |
a7a64a77 MM |
4976 | arguments are unscrambled. */ |
4977 | args[0] = arg2; | |
4978 | args[1] = arg3; | |
4979 | args[2] = arg1; | |
c8094d83 MS |
4980 | add_builtin_candidates (&candidates, |
4981 | COND_EXPR, | |
7993382e MM |
4982 | NOP_EXPR, |
4983 | ansi_opname (COND_EXPR), | |
4984 | args, | |
b40e334f | 4985 | LOOKUP_NORMAL, complain); |
a7a64a77 MM |
4986 | |
4987 | /* [expr.cond] | |
4988 | ||
4989 | If the overload resolution fails, the program is | |
4990 | ill-formed. */ | |
89606913 | 4991 | candidates = splice_viable (candidates, false, &any_viable_p); |
436f8a4c | 4992 | if (!any_viable_p) |
a7a64a77 | 4993 | { |
5ade1ed2 | 4994 | if (complain & tf_error) |
5f901ccf JM |
4995 | error_at (loc, "operands to ?: have different types %qT and %qT", |
4996 | arg2_type, arg3_type); | |
a7a64a77 MM |
4997 | return error_mark_node; |
4998 | } | |
b40e334f | 4999 | cand = tourney (candidates, complain); |
a7a64a77 MM |
5000 | if (!cand) |
5001 | { | |
5ade1ed2 DG |
5002 | if (complain & tf_error) |
5003 | { | |
4cbc4bd7 PC |
5004 | op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE); |
5005 | print_z_candidates (loc, candidates); | |
5ade1ed2 | 5006 | } |
a7a64a77 MM |
5007 | return error_mark_node; |
5008 | } | |
5009 | ||
5010 | /* [expr.cond] | |
5011 | ||
5012 | Otherwise, the conversions thus determined are applied, and | |
5013 | the converted operands are used in place of the original | |
5014 | operands for the remainder of this section. */ | |
5bd61841 | 5015 | conv = cand->convs[0]; |
5ade1ed2 | 5016 | arg1 = convert_like (conv, arg1, complain); |
5bd61841 | 5017 | conv = cand->convs[1]; |
5ade1ed2 | 5018 | arg2 = convert_like (conv, arg2, complain); |
7919d7b4 | 5019 | arg2_type = TREE_TYPE (arg2); |
5bd61841 | 5020 | conv = cand->convs[2]; |
5ade1ed2 | 5021 | arg3 = convert_like (conv, arg3, complain); |
7919d7b4 | 5022 | arg3_type = TREE_TYPE (arg3); |
a7a64a77 MM |
5023 | } |
5024 | ||
5025 | /* [expr.cond] | |
5026 | ||
5027 | Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_), | |
5028 | and function-to-pointer (_conv.func_) standard conversions are | |
50fd6343 JM |
5029 | performed on the second and third operands. |
5030 | ||
5031 | We need to force the lvalue-to-rvalue conversion here for class types, | |
5032 | so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues | |
5033 | that isn't wrapped with a TARGET_EXPR plays havoc with exception | |
d2f2c87b | 5034 | regions. */ |
50fd6343 | 5035 | |
574cfaa4 | 5036 | arg2 = force_rvalue (arg2, complain); |
d2f2c87b MM |
5037 | if (!CLASS_TYPE_P (arg2_type)) |
5038 | arg2_type = TREE_TYPE (arg2); | |
50fd6343 | 5039 | |
574cfaa4 | 5040 | arg3 = force_rvalue (arg3, complain); |
7919d7b4 | 5041 | if (!CLASS_TYPE_P (arg3_type)) |
d2f2c87b | 5042 | arg3_type = TREE_TYPE (arg3); |
a7a64a77 | 5043 | |
40260429 NS |
5044 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5045 | return error_mark_node; | |
c8094d83 | 5046 | |
a7a64a77 | 5047 | /* [expr.cond] |
c8094d83 | 5048 | |
a7a64a77 MM |
5049 | After those conversions, one of the following shall hold: |
5050 | ||
5051 | --The second and third operands have the same type; the result is of | |
5052 | that type. */ | |
5053 | if (same_type_p (arg2_type, arg3_type)) | |
5054 | result_type = arg2_type; | |
5055 | /* [expr.cond] | |
5056 | ||
5057 | --The second and third operands have arithmetic or enumeration | |
5058 | type; the usual arithmetic conversions are performed to bring | |
5059 | them to a common type, and the result is of that type. */ | |
c8094d83 | 5060 | else if ((ARITHMETIC_TYPE_P (arg2_type) |
adf2edec | 5061 | || UNSCOPED_ENUM_P (arg2_type)) |
a7a64a77 | 5062 | && (ARITHMETIC_TYPE_P (arg3_type) |
adf2edec | 5063 | || UNSCOPED_ENUM_P (arg3_type))) |
a7a64a77 MM |
5064 | { |
5065 | /* In this case, there is always a common type. */ | |
c8094d83 | 5066 | result_type = type_after_usual_arithmetic_conversions (arg2_type, |
a7a64a77 | 5067 | arg3_type); |
76545796 PC |
5068 | if (complain & tf_warning) |
5069 | do_warn_double_promotion (result_type, arg2_type, arg3_type, | |
5070 | "implicit conversion from %qT to %qT to " | |
5071 | "match other result of conditional", | |
4cbc4bd7 | 5072 | loc); |
c8094d83 | 5073 | |
1b4d752a | 5074 | if (TREE_CODE (arg2_type) == ENUMERAL_TYPE |
0cbd7506 | 5075 | && TREE_CODE (arg3_type) == ENUMERAL_TYPE) |
5ade1ed2 | 5076 | { |
8d0d1915 JM |
5077 | if (TREE_CODE (orig_arg2) == CONST_DECL |
5078 | && TREE_CODE (orig_arg3) == CONST_DECL | |
5079 | && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3)) | |
5080 | /* Two enumerators from the same enumeration can have different | |
5081 | types when the enumeration is still being defined. */; | |
5082 | else if (complain & tf_warning) | |
4cbc4bd7 PC |
5083 | warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in " |
5084 | "conditional expression: %qT vs %qT", | |
5085 | arg2_type, arg3_type); | |
5ade1ed2 | 5086 | } |
1b4d752a | 5087 | else if (extra_warnings |
0cbd7506 MS |
5088 | && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE |
5089 | && !same_type_p (arg3_type, type_promotes_to (arg2_type))) | |
5090 | || (TREE_CODE (arg3_type) == ENUMERAL_TYPE | |
4cbc4bd7 PC |
5091 | && !same_type_p (arg2_type, |
5092 | type_promotes_to (arg3_type))))) | |
5ade1ed2 DG |
5093 | { |
5094 | if (complain & tf_warning) | |
598fc085 | 5095 | warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in " |
4cbc4bd7 | 5096 | "conditional expression"); |
5ade1ed2 | 5097 | } |
c8094d83 | 5098 | |
5ade1ed2 DG |
5099 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5100 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
a7a64a77 MM |
5101 | } |
5102 | /* [expr.cond] | |
5103 | ||
5104 | --The second and third operands have pointer type, or one has | |
5105 | pointer type and the other is a null pointer constant; pointer | |
5106 | conversions (_conv.ptr_) and qualification conversions | |
5107 | (_conv.qual_) are performed to bring them to their composite | |
5108 | pointer type (_expr.rel_). The result is of the composite | |
5109 | pointer type. | |
5110 | ||
5111 | --The second and third operands have pointer to member type, or | |
5112 | one has pointer to member type and the other is a null pointer | |
5113 | constant; pointer to member conversions (_conv.mem_) and | |
5114 | qualification conversions (_conv.qual_) are performed to bring | |
5115 | them to a common type, whose cv-qualification shall match the | |
5116 | cv-qualification of either the second or the third operand. | |
00a17e31 | 5117 | The result is of the common type. */ |
c8094d83 | 5118 | else if ((null_ptr_cst_p (arg2) |
66b1156a | 5119 | && TYPE_PTR_OR_PTRMEM_P (arg3_type)) |
c8094d83 | 5120 | || (null_ptr_cst_p (arg3) |
66b1156a | 5121 | && TYPE_PTR_OR_PTRMEM_P (arg2_type)) |
a7a64a77 | 5122 | || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type)) |
66b1156a | 5123 | || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type)) |
a5ac359a | 5124 | || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type))) |
a7a64a77 MM |
5125 | { |
5126 | result_type = composite_pointer_type (arg2_type, arg3_type, arg2, | |
c86818cf | 5127 | arg3, CPO_CONDITIONAL_EXPR, |
5ade1ed2 | 5128 | complain); |
6cf4d1bc MM |
5129 | if (result_type == error_mark_node) |
5130 | return error_mark_node; | |
5ade1ed2 DG |
5131 | arg2 = perform_implicit_conversion (result_type, arg2, complain); |
5132 | arg3 = perform_implicit_conversion (result_type, arg3, complain); | |
a7a64a77 MM |
5133 | } |
5134 | ||
5135 | if (!result_type) | |
5136 | { | |
5ade1ed2 | 5137 | if (complain & tf_error) |
4cbc4bd7 PC |
5138 | error_at (loc, "operands to ?: have different types %qT and %qT", |
5139 | arg2_type, arg3_type); | |
a7a64a77 MM |
5140 | return error_mark_node; |
5141 | } | |
5142 | ||
22854930 PC |
5143 | if (arg2 == error_mark_node || arg3 == error_mark_node) |
5144 | return error_mark_node; | |
5145 | ||
a7a64a77 | 5146 | valid_operands: |
46836b0e | 5147 | result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3); |
d8a0d13e JM |
5148 | if (!cp_unevaluated_operand) |
5149 | /* Avoid folding within decltype (c++/42013) and noexcept. */ | |
5150 | result = fold_if_not_in_template (result); | |
f33e4dd7 | 5151 | |
a65fd2d7 JM |
5152 | /* We can't use result_type below, as fold might have returned a |
5153 | throw_expr. */ | |
5154 | ||
41990f96 MM |
5155 | if (!lvalue_p) |
5156 | { | |
5157 | /* Expand both sides into the same slot, hopefully the target of | |
5158 | the ?: expression. We used to check for TARGET_EXPRs here, | |
5159 | but now we sometimes wrap them in NOP_EXPRs so the test would | |
5160 | fail. */ | |
5161 | if (CLASS_TYPE_P (TREE_TYPE (result))) | |
81bd268c | 5162 | result = get_target_expr_sfinae (result, complain); |
41990f96 MM |
5163 | /* If this expression is an rvalue, but might be mistaken for an |
5164 | lvalue, we must add a NON_LVALUE_EXPR. */ | |
5165 | result = rvalue (result); | |
5166 | } | |
10c6dc8e JM |
5167 | else |
5168 | result = force_paren_expr (result); | |
a7a64a77 MM |
5169 | |
5170 | return result; | |
5171 | } | |
5172 | ||
575bfb00 LC |
5173 | /* Wrapper for above. */ |
5174 | ||
5175 | tree | |
4cbc4bd7 | 5176 | build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3, |
575bfb00 LC |
5177 | tsubst_flags_t complain) |
5178 | { | |
5179 | tree ret; | |
5180 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
4cbc4bd7 | 5181 | ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain); |
575bfb00 LC |
5182 | timevar_cond_stop (TV_OVERLOAD, subtime); |
5183 | return ret; | |
5184 | } | |
5185 | ||
14d22dd6 MM |
5186 | /* OPERAND is an operand to an expression. Perform necessary steps |
5187 | required before using it. If OPERAND is NULL_TREE, NULL_TREE is | |
5188 | returned. */ | |
5189 | ||
5190 | static tree | |
5191 | prep_operand (tree operand) | |
5192 | { | |
5193 | if (operand) | |
5194 | { | |
14d22dd6 MM |
5195 | if (CLASS_TYPE_P (TREE_TYPE (operand)) |
5196 | && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand))) | |
5197 | /* Make sure the template type is instantiated now. */ | |
5198 | instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand))); | |
5199 | } | |
5200 | ||
5201 | return operand; | |
5202 | } | |
5203 | ||
b80f8ef3 MM |
5204 | /* Add each of the viable functions in FNS (a FUNCTION_DECL or |
5205 | OVERLOAD) to the CANDIDATES, returning an updated list of | |
5c824000 JM |
5206 | CANDIDATES. The ARGS are the arguments provided to the call; |
5207 | if FIRST_ARG is non-null it is the implicit object argument, | |
5208 | otherwise the first element of ARGS is used if needed. The | |
c166b898 ILT |
5209 | EXPLICIT_TARGS are explicit template arguments provided. |
5210 | TEMPLATE_ONLY is true if only template functions should be | |
5211 | considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for | |
5212 | add_function_candidate. */ | |
b80f8ef3 | 5213 | |
7993382e | 5214 | static void |
9771b263 | 5215 | add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args, |
5c824000 | 5216 | tree return_type, |
125e6594 | 5217 | tree explicit_targs, bool template_only, |
b80f8ef3 MM |
5218 | tree conversion_path, tree access_path, |
5219 | int flags, | |
b40e334f PC |
5220 | struct z_candidate **candidates, |
5221 | tsubst_flags_t complain) | |
b80f8ef3 MM |
5222 | { |
5223 | tree ctype; | |
9771b263 | 5224 | const vec<tree, va_gc> *non_static_args; |
d451d5b2 | 5225 | bool check_list_ctor; |
5c824000 JM |
5226 | bool check_converting; |
5227 | unification_kind_t strict; | |
5228 | tree fn; | |
5229 | ||
5230 | if (!fns) | |
5231 | return; | |
5232 | ||
5233 | /* Precalculate special handling of constructors and conversion ops. */ | |
5234 | fn = OVL_CURRENT (fns); | |
5235 | if (DECL_CONV_FN_P (fn)) | |
5236 | { | |
d451d5b2 | 5237 | check_list_ctor = false; |
5c824000 | 5238 | check_converting = !!(flags & LOOKUP_ONLYCONVERTING); |
404f08f8 JM |
5239 | if (flags & LOOKUP_NO_CONVERSION) |
5240 | /* We're doing return_type(x). */ | |
5241 | strict = DEDUCE_CONV; | |
5242 | else | |
5243 | /* We're doing x.operator return_type(). */ | |
5244 | strict = DEDUCE_EXACT; | |
5c824000 JM |
5245 | /* [over.match.funcs] For conversion functions, the function |
5246 | is considered to be a member of the class of the implicit | |
5247 | object argument for the purpose of defining the type of | |
5248 | the implicit object parameter. */ | |
a7175123 | 5249 | ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg)); |
5c824000 JM |
5250 | } |
5251 | else | |
5252 | { | |
5253 | if (DECL_CONSTRUCTOR_P (fn)) | |
d451d5b2 JM |
5254 | { |
5255 | check_list_ctor = !!(flags & LOOKUP_LIST_ONLY); | |
11c71a22 JM |
5256 | /* For list-initialization we consider explicit constructors |
5257 | and complain if one is chosen. */ | |
5258 | check_converting | |
5259 | = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR)) | |
5260 | == LOOKUP_ONLYCONVERTING); | |
d451d5b2 | 5261 | } |
5c824000 | 5262 | else |
d451d5b2 JM |
5263 | { |
5264 | check_list_ctor = false; | |
5265 | check_converting = false; | |
5266 | } | |
5c824000 JM |
5267 | strict = DEDUCE_CALL; |
5268 | ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE; | |
5269 | } | |
b80f8ef3 | 5270 | |
5c824000 JM |
5271 | if (first_arg) |
5272 | non_static_args = args; | |
5273 | else | |
5274 | /* Delay creating the implicit this parameter until it is needed. */ | |
5275 | non_static_args = NULL; | |
b80f8ef3 | 5276 | |
5c824000 | 5277 | for (; fns; fns = OVL_NEXT (fns)) |
b80f8ef3 | 5278 | { |
c166b898 | 5279 | tree fn_first_arg; |
9771b263 | 5280 | const vec<tree, va_gc> *fn_args; |
b80f8ef3 MM |
5281 | |
5282 | fn = OVL_CURRENT (fns); | |
5c824000 JM |
5283 | |
5284 | if (check_converting && DECL_NONCONVERTING_P (fn)) | |
5285 | continue; | |
d451d5b2 JM |
5286 | if (check_list_ctor && !is_list_ctor (fn)) |
5287 | continue; | |
5c824000 | 5288 | |
b80f8ef3 | 5289 | /* Figure out which set of arguments to use. */ |
125e6594 | 5290 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) |
b80f8ef3 | 5291 | { |
5c824000 JM |
5292 | /* If this function is a non-static member and we didn't get an |
5293 | implicit object argument, move it out of args. */ | |
5294 | if (first_arg == NULL_TREE) | |
c166b898 ILT |
5295 | { |
5296 | unsigned int ix; | |
5297 | tree arg; | |
9771b263 DN |
5298 | vec<tree, va_gc> *tempvec; |
5299 | vec_alloc (tempvec, args->length () - 1); | |
5300 | for (ix = 1; args->iterate (ix, &arg); ++ix) | |
5301 | tempvec->quick_push (arg); | |
5c824000 | 5302 | non_static_args = tempvec; |
a7175123 | 5303 | first_arg = (*args)[0]; |
c166b898 | 5304 | } |
5c824000 | 5305 | |
c166b898 | 5306 | fn_first_arg = first_arg; |
b80f8ef3 MM |
5307 | fn_args = non_static_args; |
5308 | } | |
5309 | else | |
c166b898 ILT |
5310 | { |
5311 | /* Otherwise, just use the list of arguments provided. */ | |
5312 | fn_first_arg = NULL_TREE; | |
5313 | fn_args = args; | |
5314 | } | |
b80f8ef3 MM |
5315 | |
5316 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
c8094d83 MS |
5317 | add_template_candidate (candidates, |
5318 | fn, | |
7993382e | 5319 | ctype, |
125e6594 | 5320 | explicit_targs, |
c166b898 | 5321 | fn_first_arg, |
7993382e | 5322 | fn_args, |
5c824000 | 5323 | return_type, |
7993382e MM |
5324 | access_path, |
5325 | conversion_path, | |
5326 | flags, | |
b40e334f PC |
5327 | strict, |
5328 | complain); | |
125e6594 | 5329 | else if (!template_only) |
7993382e MM |
5330 | add_function_candidate (candidates, |
5331 | fn, | |
5332 | ctype, | |
c166b898 | 5333 | fn_first_arg, |
7993382e MM |
5334 | fn_args, |
5335 | access_path, | |
5336 | conversion_path, | |
b40e334f PC |
5337 | flags, |
5338 | complain); | |
b80f8ef3 | 5339 | } |
b80f8ef3 MM |
5340 | } |
5341 | ||
575bfb00 | 5342 | static tree |
4fe977f2 PC |
5343 | build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1, |
5344 | tree arg2, tree arg3, tree *overload, tsubst_flags_t complain) | |
c73964b2 MS |
5345 | { |
5346 | struct z_candidate *candidates = 0, *cand; | |
9771b263 | 5347 | vec<tree, va_gc> *arglist; |
c166b898 | 5348 | tree fnname; |
b80f8ef3 | 5349 | tree args[3]; |
5bd61841 MM |
5350 | tree result = NULL_TREE; |
5351 | bool result_valid_p = false; | |
c73964b2 | 5352 | enum tree_code code2 = NOP_EXPR; |
ca409efd MLI |
5353 | enum tree_code code_orig_arg1 = ERROR_MARK; |
5354 | enum tree_code code_orig_arg2 = ERROR_MARK; | |
5bd61841 MM |
5355 | conversion *conv; |
5356 | void *p; | |
436f8a4c MM |
5357 | bool strict_p; |
5358 | bool any_viable_p; | |
c73964b2 | 5359 | |
c8094d83 MS |
5360 | if (error_operand_p (arg1) |
5361 | || error_operand_p (arg2) | |
a723baf1 | 5362 | || error_operand_p (arg3)) |
c73964b2 MS |
5363 | return error_mark_node; |
5364 | ||
5365 | if (code == MODIFY_EXPR) | |
5366 | { | |
5367 | code2 = TREE_CODE (arg3); | |
5368 | arg3 = NULL_TREE; | |
596ea4e5 | 5369 | fnname = ansi_assopname (code2); |
c73964b2 MS |
5370 | } |
5371 | else | |
596ea4e5 | 5372 | fnname = ansi_opname (code); |
c73964b2 | 5373 | |
14d22dd6 | 5374 | arg1 = prep_operand (arg1); |
c8094d83 | 5375 | |
e1926435 | 5376 | bool memonly = false; |
c73964b2 MS |
5377 | switch (code) |
5378 | { | |
5379 | case NEW_EXPR: | |
5380 | case VEC_NEW_EXPR: | |
c73964b2 MS |
5381 | case VEC_DELETE_EXPR: |
5382 | case DELETE_EXPR: | |
00a17e31 | 5383 | /* Use build_op_new_call and build_op_delete_call instead. */ |
8dc2b103 | 5384 | gcc_unreachable (); |
c73964b2 MS |
5385 | |
5386 | case CALL_EXPR: | |
c166b898 ILT |
5387 | /* Use build_op_call instead. */ |
5388 | gcc_unreachable (); | |
7f85441b | 5389 | |
63a08740 DM |
5390 | case TRUTH_ORIF_EXPR: |
5391 | case TRUTH_ANDIF_EXPR: | |
5392 | case TRUTH_AND_EXPR: | |
5393 | case TRUTH_OR_EXPR: | |
ca409efd MLI |
5394 | /* These are saved for the sake of warn_logical_operator. */ |
5395 | code_orig_arg1 = TREE_CODE (arg1); | |
5396 | code_orig_arg2 = TREE_CODE (arg2); | |
04159acf MP |
5397 | break; |
5398 | case GT_EXPR: | |
5399 | case LT_EXPR: | |
5400 | case GE_EXPR: | |
5401 | case LE_EXPR: | |
5402 | case EQ_EXPR: | |
5403 | case NE_EXPR: | |
5404 | /* These are saved for the sake of maybe_warn_bool_compare. */ | |
5405 | code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1)); | |
5406 | code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2)); | |
5407 | break; | |
e1926435 JM |
5408 | |
5409 | /* =, ->, [], () must be non-static member functions. */ | |
5410 | case MODIFY_EXPR: | |
5411 | if (code2 != NOP_EXPR) | |
5412 | break; | |
5413 | case COMPONENT_REF: | |
5414 | case ARRAY_REF: | |
5415 | memonly = true; | |
5416 | break; | |
5417 | ||
7f85441b KG |
5418 | default: |
5419 | break; | |
c73964b2 MS |
5420 | } |
5421 | ||
14d22dd6 MM |
5422 | arg2 = prep_operand (arg2); |
5423 | arg3 = prep_operand (arg3); | |
c8094d83 | 5424 | |
5156628f | 5425 | if (code == COND_EXPR) |
7919d7b4 JM |
5426 | /* Use build_conditional_expr instead. */ |
5427 | gcc_unreachable (); | |
73243d63 PC |
5428 | else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1)) |
5429 | && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2)))) | |
c73964b2 MS |
5430 | goto builtin; |
5431 | ||
5432 | if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR) | |
5433 | arg2 = integer_zero_node; | |
5434 | ||
9771b263 DN |
5435 | vec_alloc (arglist, 3); |
5436 | arglist->quick_push (arg1); | |
c166b898 | 5437 | if (arg2 != NULL_TREE) |
9771b263 | 5438 | arglist->quick_push (arg2); |
c166b898 | 5439 | if (arg3 != NULL_TREE) |
9771b263 | 5440 | arglist->quick_push (arg3); |
c73964b2 | 5441 | |
5bd61841 MM |
5442 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
5443 | p = conversion_obstack_alloc (0); | |
5444 | ||
b80f8ef3 MM |
5445 | /* Add namespace-scope operators to the list of functions to |
5446 | consider. */ | |
e1926435 JM |
5447 | if (!memonly) |
5448 | add_candidates (lookup_function_nonclass (fnname, arglist, | |
5449 | /*block_p=*/true), | |
5450 | NULL_TREE, arglist, NULL_TREE, | |
5451 | NULL_TREE, false, NULL_TREE, NULL_TREE, | |
5452 | flags, &candidates, complain); | |
52243905 AO |
5453 | |
5454 | args[0] = arg1; | |
5455 | args[1] = arg2; | |
5456 | args[2] = NULL_TREE; | |
5457 | ||
b80f8ef3 MM |
5458 | /* Add class-member operators to the candidate set. */ |
5459 | if (CLASS_TYPE_P (TREE_TYPE (arg1))) | |
c73964b2 | 5460 | { |
b80f8ef3 | 5461 | tree fns; |
c73964b2 | 5462 | |
cad7e87b | 5463 | fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1); |
734e8cc5 | 5464 | if (fns == error_mark_node) |
5bd61841 MM |
5465 | { |
5466 | result = error_mark_node; | |
5467 | goto user_defined_result_ready; | |
5468 | } | |
b80f8ef3 | 5469 | if (fns) |
5c824000 JM |
5470 | add_candidates (BASELINK_FUNCTIONS (fns), |
5471 | NULL_TREE, arglist, NULL_TREE, | |
125e6594 | 5472 | NULL_TREE, false, |
7993382e | 5473 | BASELINK_BINFO (fns), |
5c824000 | 5474 | BASELINK_ACCESS_BINFO (fns), |
b40e334f | 5475 | flags, &candidates, complain); |
734e8cc5 | 5476 | } |
52243905 AO |
5477 | /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then |
5478 | only non-member functions that have type T1 or reference to | |
5479 | cv-qualified-opt T1 for the first argument, if the first argument | |
5480 | has an enumeration type, or T2 or reference to cv-qualified-opt | |
026c3cfd | 5481 | T2 for the second argument, if the second argument has an |
52243905 AO |
5482 | enumeration type. Filter out those that don't match. */ |
5483 | else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2))) | |
5484 | { | |
5485 | struct z_candidate **candp, **next; | |
c73964b2 | 5486 | |
52243905 AO |
5487 | for (candp = &candidates; *candp; candp = next) |
5488 | { | |
5489 | tree parmlist, parmtype; | |
5490 | int i, nargs = (arg2 ? 2 : 1); | |
5491 | ||
5492 | cand = *candp; | |
5493 | next = &cand->next; | |
5494 | ||
5495 | parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn)); | |
5496 | ||
5497 | for (i = 0; i < nargs; ++i) | |
5498 | { | |
5499 | parmtype = TREE_VALUE (parmlist); | |
5500 | ||
5501 | if (TREE_CODE (parmtype) == REFERENCE_TYPE) | |
5502 | parmtype = TREE_TYPE (parmtype); | |
5503 | if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE | |
5504 | && (same_type_ignoring_top_level_qualifiers_p | |
5505 | (TREE_TYPE (args[i]), parmtype))) | |
5506 | break; | |
5507 | ||
5508 | parmlist = TREE_CHAIN (parmlist); | |
5509 | } | |
5510 | ||
5511 | /* No argument has an appropriate type, so remove this | |
5512 | candidate function from the list. */ | |
5513 | if (i == nargs) | |
5514 | { | |
5515 | *candp = cand->next; | |
5516 | next = candp; | |
5517 | } | |
5518 | } | |
5519 | } | |
c73964b2 | 5520 | |
b40e334f PC |
5521 | add_builtin_candidates (&candidates, code, code2, fnname, args, |
5522 | flags, complain); | |
c73964b2 | 5523 | |
ecc42c14 AO |
5524 | switch (code) |
5525 | { | |
5526 | case COMPOUND_EXPR: | |
5527 | case ADDR_EXPR: | |
5528 | /* For these, the built-in candidates set is empty | |
5529 | [over.match.oper]/3. We don't want non-strict matches | |
5530 | because exact matches are always possible with built-in | |
5531 | operators. The built-in candidate set for COMPONENT_REF | |
5532 | would be empty too, but since there are no such built-in | |
5533 | operators, we accept non-strict matches for them. */ | |
436f8a4c | 5534 | strict_p = true; |
ecc42c14 AO |
5535 | break; |
5536 | ||
5537 | default: | |
89606913 | 5538 | strict_p = false; |
ecc42c14 | 5539 | break; |
c8094d83 | 5540 | } |
ecc42c14 | 5541 | |
436f8a4c MM |
5542 | candidates = splice_viable (candidates, strict_p, &any_viable_p); |
5543 | if (!any_viable_p) | |
c73964b2 MS |
5544 | { |
5545 | switch (code) | |
5546 | { | |
5547 | case POSTINCREMENT_EXPR: | |
5548 | case POSTDECREMENT_EXPR: | |
5ade1ed2 DG |
5549 | /* Don't try anything fancy if we're not allowed to produce |
5550 | errors. */ | |
5551 | if (!(complain & tf_error)) | |
5552 | return error_mark_node; | |
5553 | ||
481817e4 MLI |
5554 | /* Look for an `operator++ (int)'. Pre-1985 C++ didn't |
5555 | distinguish between prefix and postfix ++ and | |
5556 | operator++() was used for both, so we allow this with | |
5557 | -fpermissive. */ | |
4b978f96 | 5558 | else |
481817e4 MLI |
5559 | { |
5560 | const char *msg = (flag_permissive) | |
5561 | ? G_("no %<%D(int)%> declared for postfix %qs," | |
5562 | " trying prefix operator instead") | |
5563 | : G_("no %<%D(int)%> declared for postfix %qs"); | |
4fe977f2 | 5564 | permerror (loc, msg, fnname, operator_name_info[code].name); |
481817e4 MLI |
5565 | } |
5566 | ||
5567 | if (!flag_permissive) | |
5568 | return error_mark_node; | |
5569 | ||
c73964b2 MS |
5570 | if (code == POSTINCREMENT_EXPR) |
5571 | code = PREINCREMENT_EXPR; | |
5572 | else | |
c8094d83 | 5573 | code = PREDECREMENT_EXPR; |
4fe977f2 PC |
5574 | result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE, |
5575 | NULL_TREE, overload, complain); | |
5bd61841 MM |
5576 | break; |
5577 | ||
c73964b2 MS |
5578 | /* The caller will deal with these. */ |
5579 | case ADDR_EXPR: | |
5580 | case COMPOUND_EXPR: | |
5581 | case COMPONENT_REF: | |
5bd61841 MM |
5582 | result = NULL_TREE; |
5583 | result_valid_p = true; | |
5584 | break; | |
7f85441b KG |
5585 | |
5586 | default: | |
4b978f96 | 5587 | if (complain & tf_error) |
5bd61841 | 5588 | { |
111a28c2 DS |
5589 | /* If one of the arguments of the operator represents |
5590 | an invalid use of member function pointer, try to report | |
5591 | a meaningful error ... */ | |
d3ea4c06 MLI |
5592 | if (invalid_nonstatic_memfn_p (loc, arg1, tf_error) |
5593 | || invalid_nonstatic_memfn_p (loc, arg2, tf_error) | |
5594 | || invalid_nonstatic_memfn_p (loc, arg3, tf_error)) | |
111a28c2 DS |
5595 | /* We displayed the error message. */; |
5596 | else | |
5597 | { | |
5598 | /* ... Otherwise, report the more generic | |
5599 | "no matching operator found" error */ | |
4fe977f2 PC |
5600 | op_error (loc, code, code2, arg1, arg2, arg3, FALSE); |
5601 | print_z_candidates (loc, candidates); | |
111a28c2 | 5602 | } |
5bd61841 MM |
5603 | } |
5604 | result = error_mark_node; | |
7f85441b | 5605 | break; |
c73964b2 | 5606 | } |
c73964b2 | 5607 | } |
5bd61841 | 5608 | else |
c73964b2 | 5609 | { |
b40e334f | 5610 | cand = tourney (candidates, complain); |
5bd61841 | 5611 | if (cand == 0) |
c73964b2 | 5612 | { |
4b978f96 | 5613 | if (complain & tf_error) |
5bd61841 | 5614 | { |
4fe977f2 PC |
5615 | op_error (loc, code, code2, arg1, arg2, arg3, TRUE); |
5616 | print_z_candidates (loc, candidates); | |
5bd61841 MM |
5617 | } |
5618 | result = error_mark_node; | |
c73964b2 | 5619 | } |
5bd61841 | 5620 | else if (TREE_CODE (cand->fn) == FUNCTION_DECL) |
c73964b2 | 5621 | { |
6904f4b4 DK |
5622 | if (overload) |
5623 | *overload = cand->fn; | |
ec835fb2 | 5624 | |
b46c79a1 | 5625 | if (resolve_args (arglist, complain) == NULL) |
ffbf5813 JJ |
5626 | result = error_mark_node; |
5627 | else | |
5ade1ed2 | 5628 | result = build_over_call (cand, LOOKUP_NORMAL, complain); |
5bd61841 MM |
5629 | } |
5630 | else | |
d11ad92e | 5631 | { |
4fe2a1a7 | 5632 | /* Give any warnings we noticed during overload resolution. */ |
5ade1ed2 | 5633 | if (cand->warnings && (complain & tf_warning)) |
4fe2a1a7 JM |
5634 | { |
5635 | struct candidate_warning *w; | |
5636 | for (w = cand->warnings; w; w = w->next) | |
b40e334f | 5637 | joust (cand, w->loser, 1, complain); |
4fe2a1a7 JM |
5638 | } |
5639 | ||
5bd61841 MM |
5640 | /* Check for comparison of different enum types. */ |
5641 | switch (code) | |
5642 | { | |
5643 | case GT_EXPR: | |
5644 | case LT_EXPR: | |
5645 | case GE_EXPR: | |
5646 | case LE_EXPR: | |
5647 | case EQ_EXPR: | |
5648 | case NE_EXPR: | |
c8094d83 MS |
5649 | if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE |
5650 | && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE | |
5bd61841 | 5651 | && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) |
5ade1ed2 DG |
5652 | != TYPE_MAIN_VARIANT (TREE_TYPE (arg2))) |
5653 | && (complain & tf_warning)) | |
5bd61841 | 5654 | { |
a3299096 MM |
5655 | warning (OPT_Wenum_compare, |
5656 | "comparison between %q#T and %q#T", | |
0cbd7506 | 5657 | TREE_TYPE (arg1), TREE_TYPE (arg2)); |
5bd61841 MM |
5658 | } |
5659 | break; | |
5660 | default: | |
5661 | break; | |
5662 | } | |
5663 | ||
5664 | /* We need to strip any leading REF_BIND so that bitfields | |
5665 | don't cause errors. This should not remove any important | |
5666 | conversions, because builtins don't apply to class | |
5667 | objects directly. */ | |
5668 | conv = cand->convs[0]; | |
5669 | if (conv->kind == ck_ref_bind) | |
40703fdf | 5670 | conv = next_conversion (conv); |
5ade1ed2 | 5671 | arg1 = convert_like (conv, arg1, complain); |
ca409efd | 5672 | |
5bd61841 MM |
5673 | if (arg2) |
5674 | { | |
8d0d1915 JM |
5675 | conv = cand->convs[1]; |
5676 | if (conv->kind == ck_ref_bind) | |
5677 | conv = next_conversion (conv); | |
5678 | else | |
5679 | arg2 = decay_conversion (arg2, complain); | |
5680 | ||
ca409efd | 5681 | /* We need to call warn_logical_operator before |
8d0d1915 JM |
5682 | converting arg2 to a boolean_type, but after |
5683 | decaying an enumerator to its value. */ | |
ca409efd | 5684 | if (complain & tf_warning) |
4fe977f2 | 5685 | warn_logical_operator (loc, code, boolean_type_node, |
ca409efd MLI |
5686 | code_orig_arg1, arg1, |
5687 | code_orig_arg2, arg2); | |
5688 | ||
5ade1ed2 | 5689 | arg2 = convert_like (conv, arg2, complain); |
5bd61841 MM |
5690 | } |
5691 | if (arg3) | |
5692 | { | |
5693 | conv = cand->convs[2]; | |
5694 | if (conv->kind == ck_ref_bind) | |
40703fdf | 5695 | conv = next_conversion (conv); |
5ade1ed2 | 5696 | arg3 = convert_like (conv, arg3, complain); |
5bd61841 | 5697 | } |
63a08740 | 5698 | |
d11ad92e MS |
5699 | } |
5700 | } | |
5701 | ||
5bd61841 MM |
5702 | user_defined_result_ready: |
5703 | ||
5704 | /* Free all the conversions we allocated. */ | |
5705 | obstack_free (&conversion_obstack, p); | |
5706 | ||
5707 | if (result || result_valid_p) | |
5708 | return result; | |
c73964b2 | 5709 | |
8dc2b103 | 5710 | builtin: |
c73964b2 MS |
5711 | switch (code) |
5712 | { | |
5713 | case MODIFY_EXPR: | |
5ade1ed2 | 5714 | return cp_build_modify_expr (arg1, code2, arg2, complain); |
c73964b2 MS |
5715 | |
5716 | case INDIRECT_REF: | |
dd865ef6 | 5717 | return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain); |
c73964b2 | 5718 | |
63a08740 DM |
5719 | case TRUTH_ANDIF_EXPR: |
5720 | case TRUTH_ORIF_EXPR: | |
5721 | case TRUTH_AND_EXPR: | |
5722 | case TRUTH_OR_EXPR: | |
cd95a0d5 MM |
5723 | if (complain & tf_warning) |
5724 | warn_logical_operator (loc, code, boolean_type_node, | |
5725 | code_orig_arg1, arg1, code_orig_arg2, arg2); | |
ca409efd | 5726 | /* Fall through. */ |
c73964b2 MS |
5727 | case GT_EXPR: |
5728 | case LT_EXPR: | |
5729 | case GE_EXPR: | |
5730 | case LE_EXPR: | |
5731 | case EQ_EXPR: | |
5732 | case NE_EXPR: | |
cd95a0d5 MM |
5733 | if ((complain & tf_warning) |
5734 | && ((code_orig_arg1 == BOOLEAN_TYPE) | |
5735 | ^ (code_orig_arg2 == BOOLEAN_TYPE))) | |
04159acf | 5736 | maybe_warn_bool_compare (loc, code, arg1, arg2); |
05b28fd6 MP |
5737 | if (complain & tf_warning && warn_tautological_compare) |
5738 | warn_tautological_cmp (loc, code, arg1, arg2); | |
04159acf MP |
5739 | /* Fall through. */ |
5740 | case PLUS_EXPR: | |
5741 | case MINUS_EXPR: | |
5742 | case MULT_EXPR: | |
5743 | case TRUNC_DIV_EXPR: | |
c73964b2 MS |
5744 | case MAX_EXPR: |
5745 | case MIN_EXPR: | |
5746 | case LSHIFT_EXPR: | |
5747 | case RSHIFT_EXPR: | |
5748 | case TRUNC_MOD_EXPR: | |
5749 | case BIT_AND_EXPR: | |
5750 | case BIT_IOR_EXPR: | |
5751 | case BIT_XOR_EXPR: | |
3c1247f0 | 5752 | return cp_build_binary_op (loc, code, arg1, arg2, complain); |
c73964b2 | 5753 | |
392e3d51 | 5754 | case UNARY_PLUS_EXPR: |
c73964b2 MS |
5755 | case NEGATE_EXPR: |
5756 | case BIT_NOT_EXPR: | |
5757 | case TRUTH_NOT_EXPR: | |
5758 | case PREINCREMENT_EXPR: | |
5759 | case POSTINCREMENT_EXPR: | |
5760 | case PREDECREMENT_EXPR: | |
5761 | case POSTDECREMENT_EXPR: | |
37c46b43 MS |
5762 | case REALPART_EXPR: |
5763 | case IMAGPART_EXPR: | |
6908120a | 5764 | case ABS_EXPR: |
5ade1ed2 | 5765 | return cp_build_unary_op (code, arg1, candidates != 0, complain); |
c73964b2 MS |
5766 | |
5767 | case ARRAY_REF: | |
3a11c665 | 5768 | return cp_build_array_ref (input_location, arg1, arg2, complain); |
c73964b2 | 5769 | |
c73964b2 | 5770 | case MEMBER_REF: |
5e54f81d | 5771 | return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR, |
5ade1ed2 | 5772 | complain), |
89fcabaf | 5773 | arg2, complain); |
c73964b2 MS |
5774 | |
5775 | /* The caller will deal with these. */ | |
5776 | case ADDR_EXPR: | |
5777 | case COMPONENT_REF: | |
5778 | case COMPOUND_EXPR: | |
5779 | return NULL_TREE; | |
5780 | ||
5781 | default: | |
8dc2b103 | 5782 | gcc_unreachable (); |
c73964b2 | 5783 | } |
8dc2b103 | 5784 | return NULL_TREE; |
c73964b2 MS |
5785 | } |
5786 | ||
575bfb00 LC |
5787 | /* Wrapper for above. */ |
5788 | ||
5789 | tree | |
4fe977f2 PC |
5790 | build_new_op (location_t loc, enum tree_code code, int flags, |
5791 | tree arg1, tree arg2, tree arg3, | |
6904f4b4 | 5792 | tree *overload, tsubst_flags_t complain) |
575bfb00 LC |
5793 | { |
5794 | tree ret; | |
5795 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
4fe977f2 PC |
5796 | ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3, |
5797 | overload, complain); | |
575bfb00 LC |
5798 | timevar_cond_stop (TV_OVERLOAD, subtime); |
5799 | return ret; | |
5800 | } | |
5801 | ||
12101053 JM |
5802 | /* Returns true if FN has two parameters, of which the second has type |
5803 | size_t. */ | |
5804 | ||
5805 | static bool | |
5806 | second_parm_is_size_t (tree fn) | |
5807 | { | |
5808 | tree t = FUNCTION_ARG_CHAIN (fn); | |
5809 | return (t | |
5810 | && same_type_p (TREE_VALUE (t), size_type_node) | |
5811 | && TREE_CHAIN (t) == void_list_node); | |
5812 | } | |
5813 | ||
58926110 JM |
5814 | /* Returns true iff T, an element of an OVERLOAD chain, is a usual |
5815 | deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */ | |
5816 | ||
20b06add | 5817 | bool |
58926110 JM |
5818 | non_placement_deallocation_fn_p (tree t) |
5819 | { | |
5820 | /* A template instance is never a usual deallocation function, | |
5821 | regardless of its signature. */ | |
5822 | if (TREE_CODE (t) == TEMPLATE_DECL | |
5823 | || primary_template_instantiation_p (t)) | |
5824 | return false; | |
5825 | ||
5826 | /* If a class T has a member deallocation function named operator delete | |
5827 | with exactly one parameter, then that function is a usual | |
5828 | (non-placement) deallocation function. If class T does not declare | |
5829 | such an operator delete but does declare a member deallocation | |
5830 | function named operator delete with exactly two parameters, the second | |
5831 | of which has type std::size_t (18.2), then this function is a usual | |
5832 | deallocation function. */ | |
20b06add | 5833 | bool global = DECL_NAMESPACE_SCOPE_P (t); |
12101053 JM |
5834 | if (FUNCTION_ARG_CHAIN (t) == void_list_node |
5835 | || ((!global || flag_sized_deallocation) | |
5836 | && second_parm_is_size_t (t))) | |
58926110 JM |
5837 | return true; |
5838 | return false; | |
5839 | } | |
5840 | ||
da4768fe JM |
5841 | /* Build a call to operator delete. This has to be handled very specially, |
5842 | because the restrictions on what signatures match are different from all | |
5843 | other call instances. For a normal delete, only a delete taking (void *) | |
5844 | or (void *, size_t) is accepted. For a placement delete, only an exact | |
5845 | match with the placement new is accepted. | |
5846 | ||
5847 | CODE is either DELETE_EXPR or VEC_DELETE_EXPR. | |
0ac7f923 | 5848 | ADDR is the pointer to be deleted. |
da4768fe | 5849 | SIZE is the size of the memory block to be deleted. |
5bd61841 MM |
5850 | GLOBAL_P is true if the delete-expression should not consider |
5851 | class-specific delete operators. | |
63c9a190 | 5852 | PLACEMENT is the corresponding placement new call, or NULL_TREE. |
32a11c08 MM |
5853 | |
5854 | If this call to "operator delete" is being generated as part to | |
5855 | deallocate memory allocated via a new-expression (as per [expr.new] | |
5856 | which requires that if the initialization throws an exception then | |
5857 | we call a deallocation function), then ALLOC_FN is the allocation | |
5858 | function. */ | |
da4768fe JM |
5859 | |
5860 | tree | |
94be8403 | 5861 | build_op_delete_call (enum tree_code code, tree addr, tree size, |
63c9a190 | 5862 | bool global_p, tree placement, |
4b978f96 | 5863 | tree alloc_fn, tsubst_flags_t complain) |
da4768fe | 5864 | { |
ae0ed63a | 5865 | tree fn = NULL_TREE; |
58926110 | 5866 | tree fns, fnname, type, t; |
da4768fe JM |
5867 | |
5868 | if (addr == error_mark_node) | |
5869 | return error_mark_node; | |
5870 | ||
8d4ce389 | 5871 | type = strip_array_types (TREE_TYPE (TREE_TYPE (addr))); |
c3e899c1 | 5872 | |
596ea4e5 | 5873 | fnname = ansi_opname (code); |
da4768fe | 5874 | |
c8094d83 | 5875 | if (CLASS_TYPE_P (type) |
6e5bdc64 MM |
5876 | && COMPLETE_TYPE_P (complete_type (type)) |
5877 | && !global_p) | |
734e8cc5 MM |
5878 | /* In [class.free] |
5879 | ||
5880 | If the result of the lookup is ambiguous or inaccessible, or if | |
5881 | the lookup selects a placement deallocation function, the | |
5882 | program is ill-formed. | |
c8094d83 | 5883 | |
cd0be382 | 5884 | Therefore, we ask lookup_fnfields to complain about ambiguity. */ |
734e8cc5 MM |
5885 | { |
5886 | fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1); | |
5887 | if (fns == error_mark_node) | |
5888 | return error_mark_node; | |
5889 | } | |
da4768fe JM |
5890 | else |
5891 | fns = NULL_TREE; | |
5892 | ||
519ebd1e | 5893 | if (fns == NULL_TREE) |
da4768fe JM |
5894 | fns = lookup_name_nonclass (fnname); |
5895 | ||
94a0dd7b | 5896 | /* Strip const and volatile from addr. */ |
4b978f96 | 5897 | addr = cp_convert (ptr_type_node, addr, complain); |
94a0dd7b | 5898 | |
da4768fe JM |
5899 | if (placement) |
5900 | { | |
58926110 JM |
5901 | /* "A declaration of a placement deallocation function matches the |
5902 | declaration of a placement allocation function if it has the same | |
5903 | number of parameters and, after parameter transformations (8.3.5), | |
5904 | all parameter types except the first are identical." | |
5905 | ||
5906 | So we build up the function type we want and ask instantiate_type | |
5907 | to get it for us. */ | |
5908 | t = FUNCTION_ARG_CHAIN (alloc_fn); | |
5909 | t = tree_cons (NULL_TREE, ptr_type_node, t); | |
5910 | t = build_function_type (void_type_node, t); | |
5911 | ||
5912 | fn = instantiate_type (t, fns, tf_none); | |
5913 | if (fn == error_mark_node) | |
5914 | return NULL_TREE; | |
3f41ffd8 | 5915 | |
58926110 JM |
5916 | if (BASELINK_P (fn)) |
5917 | fn = BASELINK_FUNCTIONS (fn); | |
3f41ffd8 | 5918 | |
58926110 JM |
5919 | /* "If the lookup finds the two-parameter form of a usual deallocation |
5920 | function (3.7.4.2) and that function, considered as a placement | |
5921 | deallocation function, would have been selected as a match for the | |
5922 | allocation function, the program is ill-formed." */ | |
12101053 | 5923 | if (second_parm_is_size_t (fn)) |
1e799955 | 5924 | { |
12101053 JM |
5925 | const char *msg1 |
5926 | = G_("exception cleanup for this placement new selects " | |
5927 | "non-placement operator delete"); | |
5928 | const char *msg2 | |
4b1cbcee | 5929 | = G_("%qD is a usual (non-placement) deallocation " |
12101053 JM |
5930 | "function in C++14 (or with -fsized-deallocation)"); |
5931 | ||
5cd25f07 JM |
5932 | /* But if the class has an operator delete (void *), then that is |
5933 | the usual deallocation function, so we shouldn't complain | |
5934 | about using the operator delete (void *, size_t). */ | |
12101053 JM |
5935 | if (DECL_CLASS_SCOPE_P (fn)) |
5936 | for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns; | |
5937 | t; t = OVL_NEXT (t)) | |
5938 | { | |
5939 | tree elt = OVL_CURRENT (t); | |
5940 | if (non_placement_deallocation_fn_p (elt) | |
5941 | && FUNCTION_ARG_CHAIN (elt) == void_list_node) | |
5942 | goto ok; | |
5943 | } | |
5944 | /* Before C++14 a two-parameter global deallocation function is | |
5945 | always a placement deallocation function, but warn if | |
5946 | -Wc++14-compat. */ | |
5947 | else if (!flag_sized_deallocation) | |
5cd25f07 | 5948 | { |
12101053 JM |
5949 | if ((complain & tf_warning) |
5950 | && warning (OPT_Wc__14_compat, msg1)) | |
4b1cbcee | 5951 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); |
12101053 | 5952 | goto ok; |
5cd25f07 | 5953 | } |
12101053 JM |
5954 | |
5955 | if (complain & tf_warning_or_error) | |
4b978f96 | 5956 | { |
12101053 JM |
5957 | if (permerror (input_location, msg1)) |
5958 | { | |
5959 | /* Only mention C++14 for namespace-scope delete. */ | |
5960 | if (DECL_NAMESPACE_SCOPE_P (fn)) | |
4b1cbcee | 5961 | inform (DECL_SOURCE_LOCATION (fn), msg2, fn); |
12101053 | 5962 | else |
4b1cbcee PC |
5963 | inform (DECL_SOURCE_LOCATION (fn), |
5964 | "%qD is a usual (non-placement) deallocation " | |
12101053 JM |
5965 | "function", fn); |
5966 | } | |
4b978f96 PC |
5967 | } |
5968 | else | |
5969 | return error_mark_node; | |
5cd25f07 | 5970 | ok:; |
1e799955 | 5971 | } |
3f41ffd8 | 5972 | } |
58926110 JM |
5973 | else |
5974 | /* "Any non-placement deallocation function matches a non-placement | |
5975 | allocation function. If the lookup finds a single matching | |
5976 | deallocation function, that function will be called; otherwise, no | |
5977 | deallocation function will be called." */ | |
5978 | for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns; | |
5979 | t; t = OVL_NEXT (t)) | |
5980 | { | |
5981 | tree elt = OVL_CURRENT (t); | |
5982 | if (non_placement_deallocation_fn_p (elt)) | |
5983 | { | |
5984 | fn = elt; | |
5985 | /* "If a class T has a member deallocation function named | |
5986 | operator delete with exactly one parameter, then that | |
5987 | function is a usual (non-placement) deallocation | |
5988 | function. If class T does not declare such an operator | |
5989 | delete but does declare a member deallocation function named | |
5990 | operator delete with exactly two parameters, the second of | |
5991 | which has type std::size_t (18.2), then this function is a | |
5992 | usual deallocation function." | |
5993 | ||
20b06add JM |
5994 | So in a class (void*) beats (void*, size_t). */ |
5995 | if (DECL_CLASS_SCOPE_P (fn)) | |
5996 | { | |
5997 | if (FUNCTION_ARG_CHAIN (fn) == void_list_node) | |
5998 | break; | |
5999 | } | |
6000 | /* At global scope (in C++14 and above) the rules are different: | |
6001 | ||
6002 | If deallocation function lookup finds both a usual | |
6003 | deallocation function with only a pointer parameter and a | |
6004 | usual deallocation function with both a pointer parameter | |
6005 | and a size parameter, the function to be called is selected | |
6006 | as follows: | |
6007 | ||
6008 | * If the type is complete and if, for the second alternative | |
6009 | (delete array) only, the operand is a pointer to a class | |
6010 | type with a non-trivial destructor or a (possibly | |
6011 | multi-dimensional) array thereof, the function with two | |
6012 | parameters is selected. | |
6013 | ||
6014 | * Otherwise, it is unspecified which of the two deallocation | |
6015 | functions is selected. */ | |
6016 | else | |
6017 | { | |
6018 | bool want_size = COMPLETE_TYPE_P (type); | |
6019 | if (code == VEC_DELETE_EXPR | |
6020 | && !TYPE_VEC_NEW_USES_COOKIE (type)) | |
6021 | /* We need a cookie to determine the array size. */ | |
6022 | want_size = false; | |
6023 | bool have_size = (FUNCTION_ARG_CHAIN (fn) != void_list_node); | |
6024 | if (want_size == have_size) | |
6025 | break; | |
6026 | } | |
58926110 JM |
6027 | } |
6028 | } | |
3f41ffd8 MM |
6029 | |
6030 | /* If we have a matching function, call it. */ | |
6031 | if (fn) | |
6032 | { | |
58926110 | 6033 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); |
3f41ffd8 MM |
6034 | |
6035 | /* If the FN is a member function, make sure that it is | |
6036 | accessible. */ | |
58926110 | 6037 | if (BASELINK_P (fns)) |
0e69fdf0 PC |
6038 | perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn, |
6039 | complain); | |
3f41ffd8 | 6040 | |
67a6e816 JM |
6041 | /* Core issue 901: It's ok to new a type with deleted delete. */ |
6042 | if (DECL_DELETED_FN (fn) && alloc_fn) | |
6043 | return NULL_TREE; | |
6044 | ||
a6111661 JM |
6045 | if (placement) |
6046 | { | |
6047 | /* The placement args might not be suitable for overload | |
6048 | resolution at this point, so build the call directly. */ | |
94a0dd7b | 6049 | int nargs = call_expr_nargs (placement); |
86b8fed1 | 6050 | tree *argarray = XALLOCAVEC (tree, nargs); |
94a0dd7b SL |
6051 | int i; |
6052 | argarray[0] = addr; | |
6053 | for (i = 1; i < nargs; i++) | |
6054 | argarray[i] = CALL_EXPR_ARG (placement, i); | |
9f635aba PC |
6055 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
6056 | return error_mark_node; | |
e2e03032 | 6057 | return build_cxx_call (fn, nargs, argarray, complain); |
a6111661 JM |
6058 | } |
6059 | else | |
94a0dd7b | 6060 | { |
c166b898 | 6061 | tree ret; |
928d850f | 6062 | vec<tree, va_gc> *args = make_tree_vector (); |
9771b263 | 6063 | args->quick_push (addr); |
58926110 | 6064 | if (FUNCTION_ARG_CHAIN (fn) != void_list_node) |
9771b263 | 6065 | args->quick_push (size); |
4b978f96 | 6066 | ret = cp_build_function_call_vec (fn, &args, complain); |
928d850f | 6067 | release_tree_vector (args); |
c166b898 | 6068 | return ret; |
94a0dd7b | 6069 | } |
519ebd1e JM |
6070 | } |
6071 | ||
32a11c08 MM |
6072 | /* [expr.new] |
6073 | ||
6074 | If no unambiguous matching deallocation function can be found, | |
6075 | propagating the exception does not cause the object's memory to | |
6076 | be freed. */ | |
6077 | if (alloc_fn) | |
6078 | { | |
4b978f96 PC |
6079 | if ((complain & tf_warning) |
6080 | && !placement) | |
bcac2b89 | 6081 | warning (0, "no corresponding deallocation function for %qD", |
32a11c08 MM |
6082 | alloc_fn); |
6083 | return NULL_TREE; | |
6084 | } | |
da4768fe | 6085 | |
4b978f96 PC |
6086 | if (complain & tf_error) |
6087 | error ("no suitable %<operator %s%> for %qT", | |
6088 | operator_name_info[(int)code].name, type); | |
da4768fe JM |
6089 | return error_mark_node; |
6090 | } | |
6091 | ||
38afd588 | 6092 | /* If the current scope isn't allowed to access DECL along |
d6479fe7 | 6093 | BASETYPE_PATH, give an error. The most derived class in |
02022f3a SM |
6094 | BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is |
6095 | the declaration to use in the error diagnostic. */ | |
da4768fe | 6096 | |
94be8403 | 6097 | bool |
0e69fdf0 PC |
6098 | enforce_access (tree basetype_path, tree decl, tree diag_decl, |
6099 | tsubst_flags_t complain) | |
c73964b2 | 6100 | { |
50bc768d | 6101 | gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO); |
c8094d83 | 6102 | |
18e4be85 | 6103 | if (!accessible_p (basetype_path, decl, true)) |
c73964b2 | 6104 | { |
0e69fdf0 PC |
6105 | if (complain & tf_error) |
6106 | { | |
6107 | if (TREE_PRIVATE (decl)) | |
3a1351b9 PC |
6108 | { |
6109 | error ("%q#D is private within this context", diag_decl); | |
6110 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6111 | "declared private here"); | |
6112 | } | |
0e69fdf0 | 6113 | else if (TREE_PROTECTED (decl)) |
3a1351b9 PC |
6114 | { |
6115 | error ("%q#D is protected within this context", diag_decl); | |
6116 | inform (DECL_SOURCE_LOCATION (diag_decl), | |
6117 | "declared protected here"); | |
6118 | } | |
0e69fdf0 | 6119 | else |
3a1351b9 PC |
6120 | { |
6121 | error ("%q#D is inaccessible within this context", diag_decl); | |
6122 | inform (DECL_SOURCE_LOCATION (diag_decl), "declared here"); | |
6123 | } | |
0e69fdf0 | 6124 | } |
94be8403 | 6125 | return false; |
c73964b2 | 6126 | } |
d6479fe7 | 6127 | |
94be8403 | 6128 | return true; |
c73964b2 MS |
6129 | } |
6130 | ||
4f8163b1 MM |
6131 | /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a |
6132 | bitwise or of LOOKUP_* values. If any errors are warnings are | |
6133 | generated, set *DIAGNOSTIC_FN to "error" or "warning", | |
6134 | respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN | |
6135 | to NULL. */ | |
6136 | ||
6137 | static tree | |
c8094d83 | 6138 | build_temp (tree expr, tree type, int flags, |
248ce2f8 | 6139 | diagnostic_t *diagnostic_kind, tsubst_flags_t complain) |
4f8163b1 MM |
6140 | { |
6141 | int savew, savee; | |
9771b263 | 6142 | vec<tree, va_gc> *args; |
c8094d83 | 6143 | |
37e99116 | 6144 | savew = warningcount + werrorcount, savee = errorcount; |
c166b898 ILT |
6145 | args = make_tree_vector_single (expr); |
6146 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
248ce2f8 | 6147 | &args, type, flags, complain); |
c166b898 | 6148 | release_tree_vector (args); |
37e99116 | 6149 | if (warningcount + werrorcount > savew) |
71205d17 | 6150 | *diagnostic_kind = DK_WARNING; |
4f8163b1 | 6151 | else if (errorcount > savee) |
71205d17 | 6152 | *diagnostic_kind = DK_ERROR; |
4f8163b1 | 6153 | else |
32e8bb8e | 6154 | *diagnostic_kind = DK_UNSPECIFIED; |
4f8163b1 MM |
6155 | return expr; |
6156 | } | |
c8094d83 | 6157 | |
07231d4f MLI |
6158 | /* Perform warnings about peculiar, but valid, conversions from/to NULL. |
6159 | EXPR is implicitly converted to type TOTYPE. | |
1f7f19c4 DM |
6160 | FN and ARGNUM are used for diagnostics. */ |
6161 | ||
6162 | static void | |
07231d4f | 6163 | conversion_null_warnings (tree totype, tree expr, tree fn, int argnum) |
1f7f19c4 | 6164 | { |
1f7f19c4 | 6165 | /* Issue warnings about peculiar, but valid, uses of NULL. */ |
6dc99b79 PC |
6166 | if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE |
6167 | && ARITHMETIC_TYPE_P (totype)) | |
1f7f19c4 | 6168 | { |
70dc395a DS |
6169 | source_location loc = |
6170 | expansion_point_location_if_in_system_header (input_location); | |
6171 | ||
1f7f19c4 | 6172 | if (fn) |
70dc395a | 6173 | warning_at (loc, OPT_Wconversion_null, |
17251338 MLI |
6174 | "passing NULL to non-pointer argument %P of %qD", |
6175 | argnum, fn); | |
1f7f19c4 | 6176 | else |
70dc395a | 6177 | warning_at (loc, OPT_Wconversion_null, |
6dc99b79 | 6178 | "converting to non-pointer type %qT from NULL", totype); |
1f7f19c4 DM |
6179 | } |
6180 | ||
1f7f19c4 | 6181 | /* Issue warnings if "false" is converted to a NULL pointer */ |
92b4d64c PC |
6182 | else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE |
6183 | && TYPE_PTR_P (totype)) | |
2e1df0f0 DN |
6184 | { |
6185 | if (fn) | |
6186 | warning_at (input_location, OPT_Wconversion_null, | |
6187 | "converting %<false%> to pointer type for argument %P " | |
6188 | "of %qD", argnum, fn); | |
6189 | else | |
6190 | warning_at (input_location, OPT_Wconversion_null, | |
6dc99b79 | 6191 | "converting %<false%> to pointer type %qT", totype); |
2e1df0f0 | 6192 | } |
1f7f19c4 | 6193 | } |
4f8163b1 | 6194 | |
3f55e16a JM |
6195 | /* We gave a diagnostic during a conversion. If this was in the second |
6196 | standard conversion sequence of a user-defined conversion sequence, say | |
6197 | which user-defined conversion. */ | |
6198 | ||
6199 | static void | |
6200 | maybe_print_user_conv_context (conversion *convs) | |
6201 | { | |
6202 | if (convs->user_conv_p) | |
6203 | for (conversion *t = convs; t; t = next_conversion (t)) | |
6204 | if (t->kind == ck_user) | |
6205 | { | |
6206 | print_z_candidate (0, " after user-defined conversion:", | |
6207 | t->cand); | |
6208 | break; | |
6209 | } | |
6210 | } | |
6211 | ||
3fe18f1d MM |
6212 | /* Perform the conversions in CONVS on the expression EXPR. FN and |
6213 | ARGNUM are used for diagnostics. ARGNUM is zero based, -1 | |
838dfd8a | 6214 | indicates the `this' argument of a method. INNER is nonzero when |
78fe06c2 | 6215 | being called to continue a conversion chain. It is negative when a |
3fe18f1d MM |
6216 | reference binding will be applied, positive otherwise. If |
6217 | ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious | |
33c25e5c MM |
6218 | conversions will be emitted if appropriate. If C_CAST_P is true, |
6219 | this conversion is coming from a C-style cast; in that case, | |
6220 | conversions to inaccessible bases are permitted. */ | |
c73964b2 MS |
6221 | |
6222 | static tree | |
c8094d83 | 6223 | convert_like_real (conversion *convs, tree expr, tree fn, int argnum, |
33c25e5c | 6224 | int inner, bool issue_conversion_warnings, |
5ade1ed2 | 6225 | bool c_cast_p, tsubst_flags_t complain) |
c73964b2 | 6226 | { |
5bd61841 | 6227 | tree totype = convs->type; |
71205d17 | 6228 | diagnostic_t diag_kind; |
156d614f | 6229 | int flags; |
8400e75e | 6230 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
5e818b93 | 6231 | |
7888350f JM |
6232 | if (convs->bad_p && !(complain & tf_error)) |
6233 | return error_mark_node; | |
6234 | ||
5bd61841 MM |
6235 | if (convs->bad_p |
6236 | && convs->kind != ck_user | |
c5adc427 | 6237 | && convs->kind != ck_list |
5bd61841 | 6238 | && convs->kind != ck_ambig |
940023f4 | 6239 | && (convs->kind != ck_ref_bind |
63a18c8e | 6240 | || (convs->user_conv_p && next_conversion (convs)->bad_p)) |
11074000 JM |
6241 | && (convs->kind != ck_rvalue |
6242 | || SCALAR_TYPE_P (totype)) | |
6b3a665c | 6243 | && convs->kind != ck_base) |
d11ad92e | 6244 | { |
11074000 | 6245 | bool complained = false; |
5bd61841 | 6246 | conversion *t = convs; |
4ea08463 JM |
6247 | |
6248 | /* Give a helpful error if this is bad because of excess braces. */ | |
6249 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6250 | && SCALAR_TYPE_P (totype) | |
6251 | && CONSTRUCTOR_NELTS (expr) > 0 | |
6252 | && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value)) | |
11074000 JM |
6253 | { |
6254 | complained = permerror (loc, "too many braces around initializer " | |
6255 | "for %qT", totype); | |
6256 | while (BRACE_ENCLOSED_INITIALIZER_P (expr) | |
6257 | && CONSTRUCTOR_NELTS (expr) == 1) | |
6258 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6259 | } | |
4ea08463 | 6260 | |
3c61a5ba PC |
6261 | /* Give a helpful error if this is bad because a conversion to bool |
6262 | from std::nullptr_t requires direct-initialization. */ | |
6263 | if (NULLPTR_TYPE_P (TREE_TYPE (expr)) | |
6264 | && TREE_CODE (totype) == BOOLEAN_TYPE) | |
6265 | complained = permerror (loc, "converting to %qT from %qT requires " | |
6266 | "direct-initialization", | |
6267 | totype, TREE_TYPE (expr)); | |
6268 | ||
3c72114c | 6269 | for (; t ; t = next_conversion (t)) |
d11ad92e | 6270 | { |
b028af11 JM |
6271 | if (t->kind == ck_user && t->cand->reason) |
6272 | { | |
603a0084 PC |
6273 | complained = permerror (loc, "invalid user-defined conversion " |
6274 | "from %qT to %qT", TREE_TYPE (expr), | |
6275 | totype); | |
6276 | if (complained) | |
6277 | print_z_candidate (loc, "candidate is:", t->cand); | |
b028af11 JM |
6278 | expr = convert_like_real (t, expr, fn, argnum, 1, |
6279 | /*issue_conversion_warnings=*/false, | |
6280 | /*c_cast_p=*/false, | |
6281 | complain); | |
940023f4 | 6282 | if (convs->kind == ck_ref_bind) |
3f55e16a | 6283 | expr = convert_to_reference (totype, expr, CONV_IMPLICIT, |
4b978f96 PC |
6284 | LOOKUP_NORMAL, NULL_TREE, |
6285 | complain); | |
940023f4 | 6286 | else |
3f55e16a | 6287 | expr = cp_convert (totype, expr, complain); |
603a0084 | 6288 | if (complained && fn) |
3f55e16a JM |
6289 | inform (DECL_SOURCE_LOCATION (fn), |
6290 | " initializing argument %P of %qD", argnum, fn); | |
6291 | return expr; | |
b028af11 JM |
6292 | } |
6293 | else if (t->kind == ck_user || !t->bad_p) | |
d11ad92e | 6294 | { |
3fe18f1d | 6295 | expr = convert_like_real (t, expr, fn, argnum, 1, |
33c25e5c | 6296 | /*issue_conversion_warnings=*/false, |
5ade1ed2 DG |
6297 | /*c_cast_p=*/false, |
6298 | complain); | |
d11ad92e MS |
6299 | break; |
6300 | } | |
5bd61841 | 6301 | else if (t->kind == ck_ambig) |
3fe18f1d | 6302 | return convert_like_real (t, expr, fn, argnum, 1, |
33c25e5c | 6303 | /*issue_conversion_warnings=*/false, |
5ade1ed2 DG |
6304 | /*c_cast_p=*/false, |
6305 | complain); | |
5bd61841 | 6306 | else if (t->kind == ck_identity) |
d11ad92e MS |
6307 | break; |
6308 | } | |
11074000 JM |
6309 | if (!complained) |
6310 | complained = permerror (loc, "invalid conversion from %qT to %qT", | |
6311 | TREE_TYPE (expr), totype); | |
6312 | if (complained && fn) | |
7abebba7 | 6313 | inform (DECL_SOURCE_LOCATION (fn), |
3f55e16a | 6314 | " initializing argument %P of %qD", argnum, fn); |
5ade1ed2 | 6315 | |
4b978f96 | 6316 | return cp_convert (totype, expr, complain); |
d11ad92e | 6317 | } |
c8094d83 | 6318 | |
5ade1ed2 | 6319 | if (issue_conversion_warnings && (complain & tf_warning)) |
07231d4f | 6320 | conversion_null_warnings (totype, expr, fn, argnum); |
6fc98adf | 6321 | |
5bd61841 | 6322 | switch (convs->kind) |
c73964b2 | 6323 | { |
5bd61841 | 6324 | case ck_user: |
c73964b2 | 6325 | { |
5bd61841 | 6326 | struct z_candidate *cand = convs->cand; |
5e818b93 | 6327 | tree convfn = cand->fn; |
156d614f JM |
6328 | unsigned i; |
6329 | ||
b8dd6913 JM |
6330 | /* If we're initializing from {}, it's value-initialization. Note |
6331 | that under the resolution of core 1630, value-initialization can | |
6332 | use explicit constructors. */ | |
2061820e JM |
6333 | if (BRACE_ENCLOSED_INITIALIZER_P (expr) |
6334 | && CONSTRUCTOR_NELTS (expr) == 0 | |
6335 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)) | |
6336 | { | |
e08cc018 | 6337 | bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr); |
2061820e JM |
6338 | expr = build_value_init (totype, complain); |
6339 | expr = get_target_expr_sfinae (expr, complain); | |
6340 | if (expr != error_mark_node) | |
e08cc018 JM |
6341 | { |
6342 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
6343 | TARGET_EXPR_DIRECT_INIT_P (expr) = direct; | |
6344 | } | |
2061820e JM |
6345 | return expr; |
6346 | } | |
6347 | ||
b8dd6913 JM |
6348 | /* When converting from an init list we consider explicit |
6349 | constructors, but actually trying to call one is an error. */ | |
6350 | if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn) | |
6351 | /* Unless this is for direct-list-initialization. */ | |
6352 | && !DIRECT_LIST_INIT_P (expr)) | |
6353 | { | |
6354 | if (!(complain & tf_error)) | |
6355 | return error_mark_node; | |
6356 | error ("converting to %qT from initializer list would use " | |
6357 | "explicit constructor %qD", totype, convfn); | |
6358 | } | |
6359 | ||
03a904b5 JJ |
6360 | expr = mark_rvalue_use (expr); |
6361 | ||
156d614f JM |
6362 | /* Set user_conv_p on the argument conversions, so rvalue/base |
6363 | handling knows not to allow any more UDCs. */ | |
6364 | for (i = 0; i < cand->num_convs; ++i) | |
6365 | cand->convs[i]->user_conv_p = true; | |
c73964b2 | 6366 | |
5ade1ed2 | 6367 | expr = build_over_call (cand, LOOKUP_NORMAL, complain); |
c73964b2 MS |
6368 | |
6369 | /* If this is a constructor or a function returning an aggr type, | |
6370 | we need to build up a TARGET_EXPR. */ | |
5e818b93 | 6371 | if (DECL_CONSTRUCTOR_P (convfn)) |
3f6079dd | 6372 | { |
362115a9 | 6373 | expr = build_cplus_new (totype, expr, complain); |
3f6079dd JM |
6374 | |
6375 | /* Remember that this was list-initialization. */ | |
fe7eb484 | 6376 | if (convs->check_narrowing && expr != error_mark_node) |
3f6079dd JM |
6377 | TARGET_EXPR_LIST_INIT_P (expr) = true; |
6378 | } | |
5e818b93 | 6379 | |
c73964b2 MS |
6380 | return expr; |
6381 | } | |
5bd61841 | 6382 | case ck_identity: |
c5adc427 JM |
6383 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
6384 | { | |
6385 | int nelts = CONSTRUCTOR_NELTS (expr); | |
6386 | if (nelts == 0) | |
2061820e | 6387 | expr = build_value_init (totype, complain); |
c5adc427 JM |
6388 | else if (nelts == 1) |
6389 | expr = CONSTRUCTOR_ELT (expr, 0)->value; | |
6390 | else | |
6391 | gcc_unreachable (); | |
6392 | } | |
207fd212 | 6393 | expr = mark_rvalue_use (expr); |
c5adc427 | 6394 | |
c73964b2 | 6395 | if (type_unknown_p (expr)) |
5ade1ed2 | 6396 | expr = instantiate_type (totype, expr, complain); |
8a784e4a NS |
6397 | /* Convert a constant to its underlying value, unless we are |
6398 | about to bind it to a reference, in which case we need to | |
4e8dca1c | 6399 | leave it as an lvalue. */ |
8a784e4a | 6400 | if (inner >= 0) |
6ca39fcb | 6401 | { |
69eb4fde | 6402 | expr = scalar_constant_value (expr); |
550a799d | 6403 | if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype)) |
6ca39fcb MM |
6404 | /* If __null has been converted to an integer type, we do not |
6405 | want to warn about uses of EXPR as an integer, rather than | |
6406 | as a pointer. */ | |
6407 | expr = build_int_cst (totype, 0); | |
6408 | } | |
391c4bc5 | 6409 | return expr; |
5bd61841 | 6410 | case ck_ambig: |
0ab71f30 JM |
6411 | /* We leave bad_p off ck_ambig because overload resolution considers |
6412 | it valid, it just fails when we try to perform it. So we need to | |
6413 | check complain here, too. */ | |
0842c29f JM |
6414 | if (complain & tf_error) |
6415 | { | |
6416 | /* Call build_user_type_conversion again for the error. */ | |
b40e334f PC |
6417 | build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL, |
6418 | complain); | |
0842c29f | 6419 | if (fn) |
4b1cbcee PC |
6420 | inform (DECL_SOURCE_LOCATION (fn), |
6421 | " initializing argument %P of %qD", argnum, fn); | |
0842c29f JM |
6422 | } |
6423 | return error_mark_node; | |
7f85441b | 6424 | |
09357846 JM |
6425 | case ck_list: |
6426 | { | |
6427 | /* Conversion to std::initializer_list<T>. */ | |
6428 | tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0); | |
6429 | tree new_ctor = build_constructor (init_list_type_node, NULL); | |
6430 | unsigned len = CONSTRUCTOR_NELTS (expr); | |
88d37ae6 | 6431 | tree array, val, field; |
9771b263 | 6432 | vec<constructor_elt, va_gc> *vec = NULL; |
09357846 JM |
6433 | unsigned ix; |
6434 | ||
6435 | /* Convert all the elements. */ | |
6436 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val) | |
6437 | { | |
6438 | tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum, | |
6439 | 1, false, false, complain); | |
6440 | if (sub == error_mark_node) | |
6441 | return sub; | |
6a6bdc3d PC |
6442 | if (!BRACE_ENCLOSED_INITIALIZER_P (val) |
6443 | && !check_narrowing (TREE_TYPE (sub), val, complain)) | |
6444 | return error_mark_node; | |
09357846 | 6445 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub); |
c06ce6e4 JM |
6446 | if (!TREE_CONSTANT (sub)) |
6447 | TREE_CONSTANT (new_ctor) = false; | |
09357846 JM |
6448 | } |
6449 | /* Build up the array. */ | |
6450 | elttype = cp_build_qualified_type | |
a3360e77 | 6451 | (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST); |
09357846 | 6452 | array = build_array_of_n_type (elttype, len); |
834aa426 | 6453 | array = finish_compound_literal (array, new_ctor, complain); |
1f37c583 JM |
6454 | /* Take the address explicitly rather than via decay_conversion |
6455 | to avoid the error about taking the address of a temporary. */ | |
6456 | array = cp_build_addr_expr (array, complain); | |
4b978f96 | 6457 | array = cp_convert (build_pointer_type (elttype), array, complain); |
408249b2 JM |
6458 | if (array == error_mark_node) |
6459 | return error_mark_node; | |
09357846 | 6460 | |
88d37ae6 JM |
6461 | /* Build up the initializer_list object. */ |
6462 | totype = complete_type (totype); | |
6463 | field = next_initializable_field (TYPE_FIELDS (totype)); | |
1f37c583 | 6464 | CONSTRUCTOR_APPEND_ELT (vec, field, array); |
88d37ae6 JM |
6465 | field = next_initializable_field (DECL_CHAIN (field)); |
6466 | CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len)); | |
6467 | new_ctor = build_constructor (totype, vec); | |
81bd268c | 6468 | return get_target_expr_sfinae (new_ctor, complain); |
09357846 JM |
6469 | } |
6470 | ||
6471 | case ck_aggr: | |
77a30e9a JM |
6472 | if (TREE_CODE (totype) == COMPLEX_TYPE) |
6473 | { | |
6474 | tree real = CONSTRUCTOR_ELT (expr, 0)->value; | |
6475 | tree imag = CONSTRUCTOR_ELT (expr, 1)->value; | |
6476 | real = perform_implicit_conversion (TREE_TYPE (totype), | |
6477 | real, complain); | |
6478 | imag = perform_implicit_conversion (TREE_TYPE (totype), | |
6479 | imag, complain); | |
6480 | expr = build2 (COMPLEX_EXPR, totype, real, imag); | |
6481 | return fold_if_not_in_template (expr); | |
6482 | } | |
743af85b | 6483 | expr = reshape_init (totype, expr, complain); |
408249b2 | 6484 | expr = get_target_expr_sfinae (digest_init (totype, expr, complain), |
81bd268c | 6485 | complain); |
408249b2 JM |
6486 | if (expr != error_mark_node) |
6487 | TARGET_EXPR_LIST_INIT_P (expr) = true; | |
6488 | return expr; | |
09357846 | 6489 | |
7f85441b KG |
6490 | default: |
6491 | break; | |
c73964b2 MS |
6492 | }; |
6493 | ||
40703fdf | 6494 | expr = convert_like_real (next_conversion (convs), expr, fn, argnum, |
5bd61841 | 6495 | convs->kind == ck_ref_bind ? -1 : 1, |
07231d4f | 6496 | convs->kind == ck_ref_bind ? issue_conversion_warnings : false, |
5ade1ed2 DG |
6497 | c_cast_p, |
6498 | complain); | |
c73964b2 MS |
6499 | if (expr == error_mark_node) |
6500 | return error_mark_node; | |
6501 | ||
5bd61841 | 6502 | switch (convs->kind) |
c73964b2 | 6503 | { |
5bd61841 | 6504 | case ck_rvalue: |
89fcabaf PC |
6505 | expr = decay_conversion (expr, complain); |
6506 | if (expr == error_mark_node) | |
6507 | return error_mark_node; | |
6508 | ||
9e1e64ec | 6509 | if (! MAYBE_CLASS_TYPE_P (totype)) |
de22184b | 6510 | return expr; |
f4f206f4 | 6511 | /* Else fall through. */ |
5bd61841 MM |
6512 | case ck_base: |
6513 | if (convs->kind == ck_base && !convs->need_temporary_p) | |
4f0aa416 MM |
6514 | { |
6515 | /* We are going to bind a reference directly to a base-class | |
6516 | subobject of EXPR. */ | |
4f0aa416 | 6517 | /* Build an expression for `*((base*) &expr)'. */ |
d1522e8f | 6518 | expr = convert_to_base (expr, totype, |
798ec807 | 6519 | !c_cast_p, /*nonnull=*/true, complain); |
4f0aa416 MM |
6520 | return expr; |
6521 | } | |
6522 | ||
5e818b93 JM |
6523 | /* Copy-initialization where the cv-unqualified version of the source |
6524 | type is the same class as, or a derived class of, the class of the | |
6525 | destination [is treated as direct-initialization]. [dcl.init] */ | |
0a73242e | 6526 | flags = LOOKUP_NORMAL; |
156d614f JM |
6527 | if (convs->user_conv_p) |
6528 | /* This conversion is being done in the context of a user-defined | |
46225e26 JM |
6529 | conversion (i.e. the second step of copy-initialization), so |
6530 | don't allow any more. */ | |
156d614f | 6531 | flags |= LOOKUP_NO_CONVERSION; |
0a73242e PC |
6532 | else |
6533 | flags |= LOOKUP_ONLYCONVERTING; | |
f8f12278 JM |
6534 | if (convs->rvaluedness_matches_p) |
6535 | flags |= LOOKUP_PREFER_RVALUE; | |
be5e6908 JM |
6536 | if (TREE_CODE (expr) == TARGET_EXPR |
6537 | && TARGET_EXPR_LIST_INIT_P (expr)) | |
6538 | /* Copy-list-initialization doesn't actually involve a copy. */ | |
6539 | return expr; | |
248ce2f8 | 6540 | expr = build_temp (expr, totype, flags, &diag_kind, complain); |
3f55e16a JM |
6541 | if (diag_kind && complain) |
6542 | { | |
6543 | maybe_print_user_conv_context (convs); | |
6544 | if (fn) | |
6545 | inform (DECL_SOURCE_LOCATION (fn), | |
6546 | " initializing argument %P of %qD", argnum, fn); | |
6547 | } | |
6548 | ||
362115a9 | 6549 | return build_cplus_new (totype, expr, complain); |
41efda8f | 6550 | |
5bd61841 | 6551 | case ck_ref_bind: |
27b8d0cd | 6552 | { |
5e818b93 | 6553 | tree ref_type = totype; |
27b8d0cd | 6554 | |
40703fdf | 6555 | if (convs->bad_p && !next_conversion (convs)->bad_p) |
e7f1930f | 6556 | { |
d02f620d JM |
6557 | tree extype = TREE_TYPE (expr); |
6558 | if (TYPE_REF_IS_RVALUE (ref_type) | |
6559 | && real_lvalue_p (expr)) | |
6560 | error_at (loc, "cannot bind %qT lvalue to %qT", | |
6561 | extype, totype); | |
6562 | else if (!TYPE_REF_IS_RVALUE (ref_type) && !real_lvalue_p (expr) | |
6563 | && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type))) | |
6564 | error_at (loc, "invalid initialization of non-const reference of " | |
6565 | "type %qT from an rvalue of type %qT", totype, extype); | |
6566 | else if (!reference_compatible_p (TREE_TYPE (totype), extype)) | |
6567 | error_at (loc, "binding %qT to reference of type %qT " | |
6568 | "discards qualifiers", extype, totype); | |
6569 | else | |
6570 | gcc_unreachable (); | |
3f55e16a | 6571 | maybe_print_user_conv_context (convs); |
0ab71f30 | 6572 | if (fn) |
4b1cbcee PC |
6573 | inform (DECL_SOURCE_LOCATION (fn), |
6574 | " initializing argument %P of %qD", argnum, fn); | |
e7f1930f JM |
6575 | return error_mark_node; |
6576 | } | |
6577 | ||
8af2fec4 RY |
6578 | /* If necessary, create a temporary. |
6579 | ||
6580 | VA_ARG_EXPR and CONSTRUCTOR expressions are special cases | |
6581 | that need temporaries, even when their types are reference | |
6582 | compatible with the type of reference being bound, so the | |
93c0e0bb | 6583 | upcoming call to cp_build_addr_expr doesn't fail. */ |
8af2fec4 RY |
6584 | if (convs->need_temporary_p |
6585 | || TREE_CODE (expr) == CONSTRUCTOR | |
6586 | || TREE_CODE (expr) == VA_ARG_EXPR) | |
27b8d0cd | 6587 | { |
02a39a93 JM |
6588 | /* Otherwise, a temporary of type "cv1 T1" is created and |
6589 | initialized from the initializer expression using the rules | |
6590 | for a non-reference copy-initialization (8.5). */ | |
6591 | ||
6592 | tree type = TREE_TYPE (ref_type); | |
943e3ede | 6593 | cp_lvalue_kind lvalue = real_lvalue_p (expr); |
e0d1297c | 6594 | |
02a39a93 | 6595 | gcc_assert (same_type_ignoring_top_level_qualifiers_p |
40703fdf | 6596 | (type, next_conversion (convs)->type)); |
02a39a93 | 6597 | if (!CP_TYPE_CONST_NON_VOLATILE_P (type) |
8af2fec4 | 6598 | && !TYPE_REF_IS_RVALUE (ref_type)) |
e0d1297c | 6599 | { |
0ab71f30 JM |
6600 | /* If the reference is volatile or non-const, we |
6601 | cannot create a temporary. */ | |
6602 | if (lvalue & clk_bitfield) | |
5a3c9cf2 PC |
6603 | error_at (loc, "cannot bind bitfield %qE to %qT", |
6604 | expr, ref_type); | |
0ab71f30 | 6605 | else if (lvalue & clk_packed) |
5a3c9cf2 PC |
6606 | error_at (loc, "cannot bind packed field %qE to %qT", |
6607 | expr, ref_type); | |
0ab71f30 | 6608 | else |
5a3c9cf2 PC |
6609 | error_at (loc, "cannot bind rvalue %qE to %qT", |
6610 | expr, ref_type); | |
e0d1297c NS |
6611 | return error_mark_node; |
6612 | } | |
943e3ede MM |
6613 | /* If the source is a packed field, and we must use a copy |
6614 | constructor, then building the target expr will require | |
6615 | binding the field to the reference parameter to the | |
6616 | copy constructor, and we'll end up with an infinite | |
6617 | loop. If we can use a bitwise copy, then we'll be | |
6618 | OK. */ | |
c8094d83 MS |
6619 | if ((lvalue & clk_packed) |
6620 | && CLASS_TYPE_P (type) | |
d758e847 | 6621 | && type_has_nontrivial_copy_init (type)) |
943e3ede | 6622 | { |
5a3c9cf2 PC |
6623 | error_at (loc, "cannot bind packed field %qE to %qT", |
6624 | expr, ref_type); | |
943e3ede MM |
6625 | return error_mark_node; |
6626 | } | |
04941f76 | 6627 | if (lvalue & clk_bitfield) |
bced8304 AO |
6628 | { |
6629 | expr = convert_bitfield_to_declared_type (expr); | |
6630 | expr = fold_convert (type, expr); | |
6631 | } | |
574cfaa4 | 6632 | expr = build_target_expr_with_type (expr, type, complain); |
27b8d0cd MM |
6633 | } |
6634 | ||
6635 | /* Take the address of the thing to which we will bind the | |
6636 | reference. */ | |
93c0e0bb | 6637 | expr = cp_build_addr_expr (expr, complain); |
27b8d0cd MM |
6638 | if (expr == error_mark_node) |
6639 | return error_mark_node; | |
6640 | ||
6641 | /* Convert it to a pointer to the type referred to by the | |
6642 | reference. This will adjust the pointer if a derived to | |
6643 | base conversion is being performed. */ | |
c8094d83 | 6644 | expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)), |
4b978f96 | 6645 | expr, complain); |
27b8d0cd | 6646 | /* Convert the pointer to the desired reference type. */ |
7993382e | 6647 | return build_nop (ref_type, expr); |
27b8d0cd MM |
6648 | } |
6649 | ||
5bd61841 | 6650 | case ck_lvalue: |
89fcabaf | 6651 | return decay_conversion (expr, complain); |
7f85441b | 6652 | |
b8fd7909 JM |
6653 | case ck_tsafe: |
6654 | /* ??? Should the address of a transaction-safe pointer point to the TM | |
6655 | clone, and this conversion look up the primary function? */ | |
6656 | return build_nop (totype, expr); | |
6657 | ||
5bd61841 | 6658 | case ck_qual: |
d9cf7c82 | 6659 | /* Warn about deprecated conversion if appropriate. */ |
5e818b93 | 6660 | string_conv_p (totype, expr, 1); |
d9cf7c82 | 6661 | break; |
33c25e5c MM |
6662 | |
6663 | case ck_ptr: | |
6664 | if (convs->base_p) | |
08e17d9d | 6665 | expr = convert_to_base (expr, totype, !c_cast_p, |
798ec807 | 6666 | /*nonnull=*/false, complain); |
33c25e5c MM |
6667 | return build_nop (totype, expr); |
6668 | ||
08e17d9d MM |
6669 | case ck_pmem: |
6670 | return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false, | |
135d47df | 6671 | c_cast_p, complain); |
08e17d9d | 6672 | |
7f85441b KG |
6673 | default: |
6674 | break; | |
c73964b2 | 6675 | } |
3c955a04 | 6676 | |
6a6bdc3d PC |
6677 | if (convs->check_narrowing |
6678 | && !check_narrowing (totype, expr, complain)) | |
6679 | return error_mark_node; | |
09357846 | 6680 | |
da834cfc JM |
6681 | if (issue_conversion_warnings) |
6682 | expr = cp_convert_and_check (totype, expr, complain); | |
3c955a04 | 6683 | else |
da834cfc | 6684 | expr = cp_convert (totype, expr, complain); |
3c955a04 MM |
6685 | |
6686 | return expr; | |
c73964b2 MS |
6687 | } |
6688 | ||
41efda8f | 6689 | /* ARG is being passed to a varargs function. Perform any conversions |
0a72704b | 6690 | required. Return the converted value. */ |
41efda8f MM |
6691 | |
6692 | tree | |
b40e334f | 6693 | convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain) |
41efda8f | 6694 | { |
c5ee1358 | 6695 | tree arg_type; |
8400e75e | 6696 | location_t loc = EXPR_LOC_OR_LOC (arg, input_location); |
c5ee1358 | 6697 | |
0a72704b MM |
6698 | /* [expr.call] |
6699 | ||
6700 | The lvalue-to-rvalue, array-to-pointer, and function-to-pointer | |
6701 | standard conversions are performed. */ | |
b40e334f | 6702 | arg = decay_conversion (arg, complain); |
c5ee1358 | 6703 | arg_type = TREE_TYPE (arg); |
0a72704b MM |
6704 | /* [expr.call] |
6705 | ||
6706 | If the argument has integral or enumeration type that is subject | |
6707 | to the integral promotions (_conv.prom_), or a floating point | |
6708 | type that is subject to the floating point promotion | |
6709 | (_conv.fpprom_), the value of the argument is converted to the | |
6710 | promoted type before the call. */ | |
c5ee1358 MM |
6711 | if (TREE_CODE (arg_type) == REAL_TYPE |
6712 | && (TYPE_PRECISION (arg_type) | |
776d0022 | 6713 | < TYPE_PRECISION (double_type_node)) |
c5ee1358 MM |
6714 | && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type))) |
6715 | { | |
b40e334f PC |
6716 | if ((complain & tf_warning) |
6717 | && warn_double_promotion && !c_inhibit_evaluation_warnings) | |
5a3c9cf2 PC |
6718 | warning_at (loc, OPT_Wdouble_promotion, |
6719 | "implicit conversion from %qT to %qT when passing " | |
6720 | "argument to function", | |
6721 | arg_type, double_type_node); | |
c5ee1358 MM |
6722 | arg = convert_to_real (double_type_node, arg); |
6723 | } | |
6724 | else if (NULLPTR_TYPE_P (arg_type)) | |
14c2101d | 6725 | arg = null_pointer_node; |
c5ee1358 | 6726 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type)) |
3c395ecf | 6727 | { |
62984918 | 6728 | if (SCOPED_ENUM_P (arg_type)) |
3c395ecf | 6729 | { |
62984918 JM |
6730 | tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg, |
6731 | complain); | |
6732 | prom = cp_perform_integral_promotions (prom, complain); | |
6733 | if (abi_version_crosses (6) | |
6734 | && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type) | |
6735 | && (complain & tf_warning)) | |
6736 | warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as " | |
6737 | "%qT before -fabi-version=6, %qT after", arg_type, | |
6738 | TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type)); | |
6739 | if (!abi_version_at_least (6)) | |
6740 | arg = prom; | |
3c395ecf | 6741 | } |
62984918 JM |
6742 | else |
6743 | arg = cp_perform_integral_promotions (arg, complain); | |
3c395ecf | 6744 | } |
41efda8f | 6745 | |
e2e03032 | 6746 | arg = require_complete_type_sfinae (arg, complain); |
c5ee1358 | 6747 | arg_type = TREE_TYPE (arg); |
c8094d83 | 6748 | |
5840af0f | 6749 | if (arg != error_mark_node |
85a273ba | 6750 | /* In a template (or ill-formed code), we can have an incomplete type |
e2e03032 | 6751 | even after require_complete_type_sfinae, in which case we don't know |
85a273ba | 6752 | whether it has trivial copy or not. */ |
874aeeed | 6753 | && COMPLETE_TYPE_P (arg_type)) |
1b4d752a | 6754 | { |
874aeeed JM |
6755 | /* Build up a real lvalue-to-rvalue conversion in case the |
6756 | copy constructor is trivial but not callable. */ | |
98b3c04e | 6757 | if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type)) |
b40e334f | 6758 | force_rvalue (arg, complain); |
874aeeed | 6759 | |
c32097d8 JM |
6760 | /* [expr.call] 5.2.2/7: |
6761 | Passing a potentially-evaluated argument of class type (Clause 9) | |
6762 | with a non-trivial copy constructor or a non-trivial destructor | |
6763 | with no corresponding parameter is conditionally-supported, with | |
6764 | implementation-defined semantics. | |
6765 | ||
d2f2e467 JM |
6766 | We support it as pass-by-invisible-reference, just like a normal |
6767 | value parameter. | |
c32097d8 | 6768 | |
c8094d83 | 6769 | If the call appears in the context of a sizeof expression, |
c32097d8 | 6770 | it is not potentially-evaluated. */ |
874aeeed JM |
6771 | if (cp_unevaluated_operand == 0 |
6772 | && (type_has_nontrivial_copy_init (arg_type) | |
6773 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))) | |
b40e334f | 6774 | { |
d2f2e467 JM |
6775 | if (complain & tf_warning) |
6776 | warning (OPT_Wconditionally_supported, | |
6777 | "passing objects of non-trivially-copyable " | |
6778 | "type %q#T through %<...%> is conditionally supported", | |
6779 | arg_type); | |
6780 | return cp_build_addr_expr (arg, complain); | |
b40e334f | 6781 | } |
1b4d752a NS |
6782 | } |
6783 | ||
41efda8f MM |
6784 | return arg; |
6785 | } | |
6786 | ||
356955cf NS |
6787 | /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */ |
6788 | ||
6789 | tree | |
e42d0630 | 6790 | build_x_va_arg (source_location loc, tree expr, tree type) |
356955cf | 6791 | { |
ea333e1c | 6792 | if (processing_template_decl) |
d2f2e467 JM |
6793 | { |
6794 | tree r = build_min (VA_ARG_EXPR, type, expr); | |
6795 | SET_EXPR_LOCATION (r, loc); | |
6796 | return r; | |
6797 | } | |
c8094d83 | 6798 | |
356955cf NS |
6799 | type = complete_type_or_else (type, NULL_TREE); |
6800 | ||
6801 | if (expr == error_mark_node || !type) | |
6802 | return error_mark_node; | |
c8094d83 | 6803 | |
03a904b5 JJ |
6804 | expr = mark_lvalue_use (expr); |
6805 | ||
d2f2e467 JM |
6806 | if (TREE_CODE (type) == REFERENCE_TYPE) |
6807 | { | |
6808 | error ("cannot receive reference type %qT through %<...%>", type); | |
6809 | return error_mark_node; | |
6810 | } | |
6811 | ||
c32097d8 | 6812 | if (type_has_nontrivial_copy_init (type) |
d2f2e467 JM |
6813 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
6814 | { | |
6815 | /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat | |
6816 | it as pass by invisible reference. */ | |
6817 | warning_at (loc, OPT_Wconditionally_supported, | |
6818 | "receiving objects of non-trivially-copyable type %q#T " | |
6819 | "through %<...%> is conditionally-supported", type); | |
6820 | ||
6821 | tree ref = cp_build_reference_type (type, false); | |
6822 | expr = build_va_arg (loc, expr, ref); | |
6823 | return convert_from_reference (expr); | |
356955cf | 6824 | } |
c8094d83 | 6825 | |
e42d0630 | 6826 | return build_va_arg (loc, expr, type); |
356955cf NS |
6827 | } |
6828 | ||
ab393bf1 NB |
6829 | /* TYPE has been given to va_arg. Apply the default conversions which |
6830 | would have happened when passed via ellipsis. Return the promoted | |
6831 | type, or the passed type if there is no change. */ | |
356955cf NS |
6832 | |
6833 | tree | |
94be8403 | 6834 | cxx_type_promotes_to (tree type) |
356955cf NS |
6835 | { |
6836 | tree promote; | |
ab393bf1 | 6837 | |
a7e8c268 MM |
6838 | /* Perform the array-to-pointer and function-to-pointer |
6839 | conversions. */ | |
6840 | type = type_decays_to (type); | |
ab393bf1 NB |
6841 | |
6842 | promote = type_promotes_to (type); | |
6843 | if (same_type_p (type, promote)) | |
6844 | promote = type; | |
c8094d83 | 6845 | |
ab393bf1 | 6846 | return promote; |
356955cf NS |
6847 | } |
6848 | ||
41efda8f | 6849 | /* ARG is a default argument expression being passed to a parameter of |
4c66d85a JM |
6850 | the indicated TYPE, which is a parameter to FN. PARMNUM is the |
6851 | zero-based argument number. Do any required conversions. Return | |
6852 | the converted value. */ | |
41efda8f | 6853 | |
9771b263 | 6854 | static GTY(()) vec<tree, va_gc> *default_arg_context; |
4c66d85a JM |
6855 | void |
6856 | push_defarg_context (tree fn) | |
9771b263 DN |
6857 | { vec_safe_push (default_arg_context, fn); } |
6858 | ||
4c66d85a JM |
6859 | void |
6860 | pop_defarg_context (void) | |
9771b263 | 6861 | { default_arg_context->pop (); } |
d02dbde6 | 6862 | |
41efda8f | 6863 | tree |
b40e334f PC |
6864 | convert_default_arg (tree type, tree arg, tree fn, int parmnum, |
6865 | tsubst_flags_t complain) | |
c73964b2 | 6866 | { |
d02dbde6 JM |
6867 | int i; |
6868 | tree t; | |
6869 | ||
4c66d85a JM |
6870 | /* See through clones. */ |
6871 | fn = DECL_ORIGIN (fn); | |
96a1e32d | 6872 | |
d02dbde6 | 6873 | /* Detect recursion. */ |
9771b263 | 6874 | FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t) |
d02dbde6 JM |
6875 | if (t == fn) |
6876 | { | |
b40e334f PC |
6877 | if (complain & tf_error) |
6878 | error ("recursive evaluation of default argument for %q#D", fn); | |
d02dbde6 JM |
6879 | return error_mark_node; |
6880 | } | |
4c66d85a JM |
6881 | |
6882 | /* If the ARG is an unparsed default argument expression, the | |
6883 | conversion cannot be performed. */ | |
6884 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
6885 | { | |
b40e334f PC |
6886 | if (complain & tf_error) |
6887 | error ("call to %qD uses the default argument for parameter %P, which " | |
6888 | "is not yet defined", fn, parmnum); | |
4c66d85a JM |
6889 | return error_mark_node; |
6890 | } | |
6891 | ||
6892 | push_defarg_context (fn); | |
d02dbde6 | 6893 | |
297e73d8 | 6894 | if (fn && DECL_TEMPLATE_INFO (fn)) |
4004afb3 | 6895 | arg = tsubst_default_argument (fn, type, arg, complain); |
297e73d8 | 6896 | |
248e1b22 MM |
6897 | /* Due to: |
6898 | ||
6899 | [dcl.fct.default] | |
c73964b2 | 6900 | |
248e1b22 MM |
6901 | The names in the expression are bound, and the semantic |
6902 | constraints are checked, at the point where the default | |
6903 | expressions appears. | |
6904 | ||
6905 | we must not perform access checks here. */ | |
6906 | push_deferring_access_checks (dk_no_check); | |
a4d25b44 JM |
6907 | /* We must make a copy of ARG, in case subsequent processing |
6908 | alters any part of it. */ | |
248e1b22 | 6909 | arg = break_out_target_exprs (arg); |
4a4e80cb JM |
6910 | arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT, |
6911 | ICR_DEFAULT_ARGUMENT, fn, parmnum, | |
6912 | complain); | |
6913 | arg = convert_for_arg_passing (type, arg, complain); | |
248e1b22 | 6914 | pop_deferring_access_checks(); |
c73964b2 | 6915 | |
4c66d85a | 6916 | pop_defarg_context (); |
d02dbde6 | 6917 | |
c73964b2 MS |
6918 | return arg; |
6919 | } | |
6920 | ||
8e51619a JM |
6921 | /* Returns the type which will really be used for passing an argument of |
6922 | type TYPE. */ | |
6923 | ||
6924 | tree | |
94be8403 | 6925 | type_passed_as (tree type) |
8e51619a JM |
6926 | { |
6927 | /* Pass classes with copy ctors by invisible reference. */ | |
6928 | if (TREE_ADDRESSABLE (type)) | |
d8472c75 JM |
6929 | { |
6930 | type = build_reference_type (type); | |
6931 | /* There are no other pointers to this temporary. */ | |
a3360e77 | 6932 | type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT); |
d8472c75 | 6933 | } |
136e64db | 6934 | else if (targetm.calls.promote_prototypes (type) |
8e51619a | 6935 | && INTEGRAL_TYPE_P (type) |
3f50d3dd | 6936 | && COMPLETE_TYPE_P (type) |
807e902e | 6937 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
8e51619a JM |
6938 | type = integer_type_node; |
6939 | ||
6940 | return type; | |
6941 | } | |
6942 | ||
6943 | /* Actually perform the appropriate conversion. */ | |
6944 | ||
6945 | tree | |
b40e334f | 6946 | convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain) |
8e51619a | 6947 | { |
83144bd6 MM |
6948 | tree bitfield_type; |
6949 | ||
6950 | /* If VAL is a bitfield, then -- since it has already been converted | |
6951 | to TYPE -- it cannot have a precision greater than TYPE. | |
6952 | ||
6953 | If it has a smaller precision, we must widen it here. For | |
6954 | example, passing "int f:3;" to a function expecting an "int" will | |
6955 | not result in any conversion before this point. | |
6956 | ||
6957 | If the precision is the same we must not risk widening. For | |
6958 | example, the COMPONENT_REF for a 32-bit "long long" bitfield will | |
6959 | often have type "int", even though the C++ type for the field is | |
6960 | "long long". If the value is being passed to a function | |
6961 | expecting an "int", then no conversions will be required. But, | |
6962 | if we call convert_bitfield_to_declared_type, the bitfield will | |
6963 | be converted to "long long". */ | |
6964 | bitfield_type = is_bitfield_expr_with_lowered_type (val); | |
6965 | if (bitfield_type | |
6966 | && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)) | |
6967 | val = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), val); | |
6968 | ||
c246c65d JM |
6969 | if (val == error_mark_node) |
6970 | ; | |
8e51619a | 6971 | /* Pass classes with copy ctors by invisible reference. */ |
c246c65d JM |
6972 | else if (TREE_ADDRESSABLE (type)) |
6973 | val = build1 (ADDR_EXPR, build_reference_type (type), val); | |
136e64db | 6974 | else if (targetm.calls.promote_prototypes (type) |
8e51619a | 6975 | && INTEGRAL_TYPE_P (type) |
3f50d3dd | 6976 | && COMPLETE_TYPE_P (type) |
807e902e | 6977 | && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node))) |
4b978f96 | 6978 | val = cp_perform_integral_promotions (val, complain); |
b40e334f | 6979 | if ((complain & tf_warning) |
90137d8f | 6980 | && warn_suggest_attribute_format) |
104f8784 KG |
6981 | { |
6982 | tree rhstype = TREE_TYPE (val); | |
6983 | const enum tree_code coder = TREE_CODE (rhstype); | |
6984 | const enum tree_code codel = TREE_CODE (type); | |
6985 | if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE) | |
6986 | && coder == codel | |
6987 | && check_missing_format_attribute (type, rhstype)) | |
90137d8f | 6988 | warning (OPT_Wsuggest_attribute_format, |
104f8784 KG |
6989 | "argument of function call might be a candidate for a format attribute"); |
6990 | } | |
8e51619a JM |
6991 | return val; |
6992 | } | |
6993 | ||
a6f86b51 JM |
6994 | /* Returns true iff FN is a function with magic varargs, i.e. ones for |
6995 | which no conversions at all should be done. This is true for some | |
6996 | builtins which don't act like normal functions. */ | |
6997 | ||
1141ed3f | 6998 | bool |
a6f86b51 JM |
6999 | magic_varargs_p (tree fn) |
7000 | { | |
b72271b9 | 7001 | if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE) |
1141ed3f BI |
7002 | return true; |
7003 | ||
a6f86b51 JM |
7004 | if (DECL_BUILT_IN (fn)) |
7005 | switch (DECL_FUNCTION_CODE (fn)) | |
7006 | { | |
7007 | case BUILT_IN_CLASSIFY_TYPE: | |
7008 | case BUILT_IN_CONSTANT_P: | |
7009 | case BUILT_IN_NEXT_ARG: | |
a6f86b51 JM |
7010 | case BUILT_IN_VA_START: |
7011 | return true; | |
7012 | ||
7013 | default:; | |
59f89d34 KG |
7014 | return lookup_attribute ("type generic", |
7015 | TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0; | |
a6f86b51 JM |
7016 | } |
7017 | ||
7018 | return false; | |
7019 | } | |
7020 | ||
3649b9b7 ST |
7021 | /* Returns the decl of the dispatcher function if FN is a function version. */ |
7022 | ||
beb42d20 | 7023 | tree |
3649b9b7 ST |
7024 | get_function_version_dispatcher (tree fn) |
7025 | { | |
7026 | tree dispatcher_decl = NULL; | |
7027 | ||
7028 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL | |
7029 | && DECL_FUNCTION_VERSIONED (fn)); | |
7030 | ||
7031 | gcc_assert (targetm.get_function_versions_dispatcher); | |
7032 | dispatcher_decl = targetm.get_function_versions_dispatcher (fn); | |
7033 | ||
7034 | if (dispatcher_decl == NULL) | |
7035 | { | |
beb42d20 ST |
7036 | error_at (input_location, "use of multiversioned function " |
7037 | "without a default"); | |
3649b9b7 ST |
7038 | return NULL; |
7039 | } | |
7040 | ||
7041 | retrofit_lang_decl (dispatcher_decl); | |
7042 | gcc_assert (dispatcher_decl != NULL); | |
7043 | return dispatcher_decl; | |
7044 | } | |
7045 | ||
7046 | /* fn is a function version dispatcher that is marked used. Mark all the | |
7047 | semantically identical function versions it will dispatch as used. */ | |
7048 | ||
beb42d20 | 7049 | void |
3649b9b7 ST |
7050 | mark_versions_used (tree fn) |
7051 | { | |
7052 | struct cgraph_node *node; | |
7053 | struct cgraph_function_version_info *node_v; | |
7054 | struct cgraph_function_version_info *it_v; | |
7055 | ||
7056 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
7057 | ||
d52f5295 | 7058 | node = cgraph_node::get (fn); |
3649b9b7 ST |
7059 | if (node == NULL) |
7060 | return; | |
7061 | ||
7062 | gcc_assert (node->dispatcher_function); | |
7063 | ||
d52f5295 | 7064 | node_v = node->function_version (); |
3649b9b7 ST |
7065 | if (node_v == NULL) |
7066 | return; | |
7067 | ||
7068 | /* All semantically identical versions are chained. Traverse and mark each | |
7069 | one of them as used. */ | |
7070 | it_v = node_v->next; | |
7071 | while (it_v != NULL) | |
7072 | { | |
67348ccc | 7073 | mark_used (it_v->this_node->decl); |
3649b9b7 ST |
7074 | it_v = it_v->next; |
7075 | } | |
7076 | } | |
7077 | ||
9efe5fbd JM |
7078 | /* Build a call to "the copy constructor" for the type of A, even if it |
7079 | wouldn't be selected by normal overload resolution. Used for | |
7080 | diagnostics. */ | |
7081 | ||
7082 | static tree | |
7083 | call_copy_ctor (tree a, tsubst_flags_t complain) | |
7084 | { | |
7085 | tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a)); | |
7086 | tree binfo = TYPE_BINFO (ctype); | |
7087 | tree copy = get_copy_ctor (ctype, complain); | |
7088 | copy = build_baselink (binfo, binfo, copy, NULL_TREE); | |
7089 | tree ob = build_dummy_object (ctype); | |
7090 | vec<tree, va_gc>* args = make_tree_vector_single (a); | |
7091 | tree r = build_new_method_call (ob, copy, &args, NULL_TREE, | |
7092 | LOOKUP_NORMAL, NULL, complain); | |
7093 | release_tree_vector (args); | |
7094 | return r; | |
7095 | } | |
7096 | ||
3c769e5a JM |
7097 | /* Return true iff T refers to a base field. */ |
7098 | ||
7099 | static bool | |
7100 | is_base_field_ref (tree t) | |
7101 | { | |
7102 | STRIP_NOPS (t); | |
7103 | if (TREE_CODE (t) == ADDR_EXPR) | |
7104 | t = TREE_OPERAND (t, 0); | |
7105 | if (TREE_CODE (t) == COMPONENT_REF) | |
7106 | t = TREE_OPERAND (t, 1); | |
7107 | if (TREE_CODE (t) == FIELD_DECL) | |
7108 | return DECL_FIELD_IS_BASE (t); | |
7109 | return false; | |
7110 | } | |
7111 | ||
7112 | /* We can't elide a copy from a function returning by value to a base | |
7113 | subobject, as the callee might clobber tail padding. Return true iff this | |
7114 | could be that case. */ | |
7115 | ||
7116 | static bool | |
7117 | unsafe_copy_elision_p (tree target, tree exp) | |
7118 | { | |
7119 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); | |
7120 | if (type == CLASSTYPE_AS_BASE (type)) | |
7121 | return false; | |
7122 | if (!is_base_field_ref (target) | |
7123 | && resolves_to_fixed_type_p (target, NULL)) | |
7124 | return false; | |
7125 | tree init = TARGET_EXPR_INITIAL (exp); | |
7126 | return (TREE_CODE (init) == AGGR_INIT_EXPR | |
7127 | && !AGGR_INIT_VIA_CTOR_P (init)); | |
7128 | } | |
7129 | ||
c050ec51 JM |
7130 | /* Subroutine of the various build_*_call functions. Overload resolution |
7131 | has chosen a winning candidate CAND; build up a CALL_EXPR accordingly. | |
7132 | ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a | |
7133 | bitmask of various LOOKUP_* flags which apply to the call itself. */ | |
7134 | ||
c73964b2 | 7135 | static tree |
5ade1ed2 | 7136 | build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain) |
c73964b2 | 7137 | { |
5ffe581d | 7138 | tree fn = cand->fn; |
9771b263 | 7139 | const vec<tree, va_gc> *args = cand->args; |
c166b898 | 7140 | tree first_arg = cand->first_arg; |
5bd61841 MM |
7141 | conversion **convs = cand->convs; |
7142 | conversion *conv; | |
c73964b2 | 7143 | tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
94a0dd7b | 7144 | int parmlen; |
c166b898 | 7145 | tree val; |
c73964b2 | 7146 | int i = 0; |
94a0dd7b | 7147 | int j = 0; |
c166b898 | 7148 | unsigned int arg_index = 0; |
d11ad92e | 7149 | int is_method = 0; |
94a0dd7b SL |
7150 | int nargs; |
7151 | tree *argarray; | |
b87d79e6 | 7152 | bool already_used = false; |
c73964b2 | 7153 | |
b7c707d1 MM |
7154 | /* In a template, there is no need to perform all of the work that |
7155 | is normally done. We are only interested in the type of the call | |
7156 | expression, i.e., the return type of the function. Any semantic | |
7157 | errors will be deferred until the template is instantiated. */ | |
7158 | if (processing_template_decl) | |
7159 | { | |
89fcabaf | 7160 | tree expr, addr; |
b7c707d1 | 7161 | tree return_type; |
c166b898 ILT |
7162 | const tree *argarray; |
7163 | unsigned int nargs; | |
7164 | ||
b7c707d1 | 7165 | return_type = TREE_TYPE (TREE_TYPE (fn)); |
9771b263 | 7166 | nargs = vec_safe_length (args); |
c166b898 | 7167 | if (first_arg == NULL_TREE) |
9771b263 | 7168 | argarray = args->address (); |
c166b898 ILT |
7169 | else |
7170 | { | |
7171 | tree *alcarray; | |
7172 | unsigned int ix; | |
7173 | tree arg; | |
7174 | ||
7175 | ++nargs; | |
7176 | alcarray = XALLOCAVEC (tree, nargs); | |
e2498d54 | 7177 | alcarray[0] = build_this (first_arg); |
9771b263 | 7178 | FOR_EACH_VEC_SAFE_ELT (args, ix, arg) |
c166b898 ILT |
7179 | alcarray[ix + 1] = arg; |
7180 | argarray = alcarray; | |
7181 | } | |
89fcabaf PC |
7182 | |
7183 | addr = build_addr_func (fn, complain); | |
7184 | if (addr == error_mark_node) | |
7185 | return error_mark_node; | |
7186 | expr = build_call_array_loc (input_location, return_type, | |
7187 | addr, nargs, argarray); | |
c8b2e872 MM |
7188 | if (TREE_THIS_VOLATILE (fn) && cfun) |
7189 | current_function_returns_abnormally = 1; | |
b7c707d1 MM |
7190 | return convert_from_reference (expr); |
7191 | } | |
7192 | ||
5ffe581d | 7193 | /* Give any warnings we noticed during overload resolution. */ |
46408846 | 7194 | if (cand->warnings && (complain & tf_warning)) |
5bd61841 MM |
7195 | { |
7196 | struct candidate_warning *w; | |
7197 | for (w = cand->warnings; w; w = w->next) | |
b40e334f | 7198 | joust (cand, w->loser, 1, complain); |
5bd61841 | 7199 | } |
5ffe581d | 7200 | |
4ad610c9 JM |
7201 | /* Make =delete work with SFINAE. */ |
7202 | if (DECL_DELETED_FN (fn) && !(complain & tf_error)) | |
7203 | return error_mark_node; | |
7204 | ||
5ffe581d | 7205 | if (DECL_FUNCTION_MEMBER_P (fn)) |
3dfa3500 | 7206 | { |
ac177431 | 7207 | tree access_fn; |
3dfa3500 KL |
7208 | /* If FN is a template function, two cases must be considered. |
7209 | For example: | |
7210 | ||
7211 | struct A { | |
7212 | protected: | |
7213 | template <class T> void f(); | |
7214 | }; | |
7215 | template <class T> struct B { | |
7216 | protected: | |
7217 | void g(); | |
7218 | }; | |
7219 | struct C : A, B<int> { | |
7220 | using A::f; // #1 | |
7221 | using B<int>::g; // #2 | |
7222 | }; | |
7223 | ||
7224 | In case #1 where `A::f' is a member template, DECL_ACCESS is | |
7225 | recorded in the primary template but not in its specialization. | |
7226 | We check access of FN using its primary template. | |
7227 | ||
7228 | In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply | |
7229 | because it is a member of class template B, DECL_ACCESS is | |
7230 | recorded in the specialization `B<int>::g'. We cannot use its | |
7231 | primary template because `B<T>::g' and `B<int>::g' may have | |
7232 | different access. */ | |
7233 | if (DECL_TEMPLATE_INFO (fn) | |
c7222c02 | 7234 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn))) |
ac177431 | 7235 | access_fn = DECL_TI_TEMPLATE (fn); |
3dfa3500 | 7236 | else |
ac177431 | 7237 | access_fn = fn; |
0e69fdf0 PC |
7238 | if (!perform_or_defer_access_check (cand->access_path, access_fn, |
7239 | fn, complain)) | |
7240 | return error_mark_node; | |
ac177431 JM |
7241 | } |
7242 | ||
7243 | /* If we're checking for implicit delete, don't bother with argument | |
7244 | conversions. */ | |
7245 | if (flags & LOOKUP_SPECULATIVE) | |
7246 | { | |
7247 | if (DECL_DELETED_FN (fn)) | |
7248 | { | |
4b978f96 | 7249 | if (complain & tf_error) |
ac177431 JM |
7250 | mark_used (fn); |
7251 | return error_mark_node; | |
7252 | } | |
7253 | if (cand->viable == 1) | |
7254 | return fn; | |
4b978f96 | 7255 | else if (!(complain & tf_error)) |
ac177431 JM |
7256 | /* Reject bad conversions now. */ |
7257 | return error_mark_node; | |
7258 | /* else continue to get conversion error. */ | |
3dfa3500 | 7259 | } |
5ffe581d | 7260 | |
57fcd4f4 JM |
7261 | /* N3276 magic doesn't apply to nested calls. */ |
7262 | int decltype_flag = (complain & tf_decltype); | |
7263 | complain &= ~tf_decltype; | |
7264 | ||
94a0dd7b SL |
7265 | /* Find maximum size of vector to hold converted arguments. */ |
7266 | parmlen = list_length (parm); | |
9771b263 | 7267 | nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0); |
94a0dd7b SL |
7268 | if (parmlen > nargs) |
7269 | nargs = parmlen; | |
86b8fed1 | 7270 | argarray = XALLOCAVEC (tree, nargs); |
94a0dd7b | 7271 | |
c73964b2 MS |
7272 | /* The implicit parameters to a constructor are not considered by overload |
7273 | resolution, and must be of the proper type. */ | |
7274 | if (DECL_CONSTRUCTOR_P (fn)) | |
7275 | { | |
a7175123 | 7276 | tree object_arg; |
c166b898 ILT |
7277 | if (first_arg != NULL_TREE) |
7278 | { | |
a7175123 | 7279 | object_arg = first_arg; |
c166b898 ILT |
7280 | first_arg = NULL_TREE; |
7281 | } | |
7282 | else | |
7283 | { | |
a7175123 | 7284 | object_arg = (*args)[arg_index]; |
c166b898 ILT |
7285 | ++arg_index; |
7286 | } | |
a7175123 | 7287 | argarray[j++] = build_this (object_arg); |
c73964b2 | 7288 | parm = TREE_CHAIN (parm); |
8dc2b103 NS |
7289 | /* We should never try to call the abstract constructor. */ |
7290 | gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn)); | |
c8094d83 | 7291 | |
e0fff4b3 | 7292 | if (DECL_HAS_VTT_PARM_P (fn)) |
c73964b2 | 7293 | { |
9771b263 | 7294 | argarray[j++] = (*args)[arg_index]; |
c166b898 | 7295 | ++arg_index; |
c73964b2 MS |
7296 | parm = TREE_CHAIN (parm); |
7297 | } | |
c8094d83 | 7298 | } |
c73964b2 MS |
7299 | /* Bypass access control for 'this' parameter. */ |
7300 | else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7301 | { | |
d11ad92e | 7302 | tree parmtype = TREE_VALUE (parm); |
a7175123 JM |
7303 | tree arg = build_this (first_arg != NULL_TREE |
7304 | ? first_arg | |
7305 | : (*args)[arg_index]); | |
c166b898 | 7306 | tree argtype = TREE_TYPE (arg); |
4ba126e4 | 7307 | tree converted_arg; |
3baab484 | 7308 | tree base_binfo; |
c8094d83 | 7309 | |
5bd61841 | 7310 | if (convs[i]->bad_p) |
5ade1ed2 DG |
7311 | { |
7312 | if (complain & tf_error) | |
3f55e16a JM |
7313 | { |
7314 | if (permerror (input_location, "passing %qT as %<this%> " | |
7315 | "argument discards qualifiers", | |
7316 | TREE_TYPE (argtype))) | |
7317 | inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn); | |
7318 | } | |
5ade1ed2 DG |
7319 | else |
7320 | return error_mark_node; | |
7321 | } | |
91063b51 | 7322 | |
1fa2969f PC |
7323 | /* See if the function member or the whole class type is declared |
7324 | final and the call can be devirtualized. */ | |
7325 | if (DECL_FINAL_P (fn) | |
7326 | || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn)))) | |
7327 | flags |= LOOKUP_NONVIRTUAL; | |
7328 | ||
51ddb82e JM |
7329 | /* [class.mfct.nonstatic]: If a nonstatic member function of a class |
7330 | X is called for an object that is not of type X, or of a type | |
7331 | derived from X, the behavior is undefined. | |
7332 | ||
0cbd7506 | 7333 | So we can assume that anything passed as 'this' is non-null, and |
51ddb82e | 7334 | optimize accordingly. */ |
50e10fa8 | 7335 | gcc_assert (TYPE_PTR_P (parmtype)); |
4ba126e4 | 7336 | /* Convert to the base in which the function was declared. */ |
50bc768d | 7337 | gcc_assert (cand->conversion_path != NULL_TREE); |
4ba126e4 | 7338 | converted_arg = build_base_path (PLUS_EXPR, |
c166b898 | 7339 | arg, |
4ba126e4 | 7340 | cand->conversion_path, |
a271590a | 7341 | 1, complain); |
bd16cb25 | 7342 | /* Check that the base class is accessible. */ |
c8094d83 | 7343 | if (!accessible_base_p (TREE_TYPE (argtype), |
18e4be85 | 7344 | BINFO_TYPE (cand->conversion_path), true)) |
76545796 PC |
7345 | { |
7346 | if (complain & tf_error) | |
7347 | error ("%qT is not an accessible base of %qT", | |
7348 | BINFO_TYPE (cand->conversion_path), | |
7349 | TREE_TYPE (argtype)); | |
7350 | else | |
7351 | return error_mark_node; | |
7352 | } | |
3baab484 | 7353 | /* If fn was found by a using declaration, the conversion path |
0cbd7506 MS |
7354 | will be to the derived class, not the base declaring fn. We |
7355 | must convert from derived to base. */ | |
3baab484 | 7356 | base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)), |
22854930 PC |
7357 | TREE_TYPE (parmtype), ba_unique, |
7358 | NULL, complain); | |
3baab484 | 7359 | converted_arg = build_base_path (PLUS_EXPR, converted_arg, |
a271590a | 7360 | base_binfo, 1, complain); |
c8094d83 | 7361 | |
94a0dd7b | 7362 | argarray[j++] = converted_arg; |
c73964b2 | 7363 | parm = TREE_CHAIN (parm); |
c166b898 ILT |
7364 | if (first_arg != NULL_TREE) |
7365 | first_arg = NULL_TREE; | |
7366 | else | |
7367 | ++arg_index; | |
c73964b2 | 7368 | ++i; |
d11ad92e | 7369 | is_method = 1; |
c73964b2 MS |
7370 | } |
7371 | ||
c166b898 | 7372 | gcc_assert (first_arg == NULL_TREE); |
9771b263 | 7373 | for (; arg_index < vec_safe_length (args) && parm; |
c166b898 | 7374 | parm = TREE_CHAIN (parm), ++arg_index, ++i) |
c73964b2 MS |
7375 | { |
7376 | tree type = TREE_VALUE (parm); | |
9771b263 | 7377 | tree arg = (*args)[arg_index]; |
2e1df0f0 | 7378 | bool conversion_warning = true; |
d11ad92e | 7379 | |
5bd61841 | 7380 | conv = convs[i]; |
a5c42740 | 7381 | |
2e1df0f0 DN |
7382 | /* If the argument is NULL and used to (implicitly) instantiate a |
7383 | template function (and bind one of the template arguments to | |
7384 | the type of 'long int'), we don't want to warn about passing NULL | |
7385 | to non-pointer argument. | |
7386 | For example, if we have this template function: | |
7387 | ||
7388 | template<typename T> void func(T x) {} | |
7389 | ||
7390 | we want to warn (when -Wconversion is enabled) in this case: | |
7391 | ||
7392 | void foo() { | |
7393 | func<int>(NULL); | |
7394 | } | |
7395 | ||
7396 | but not in this case: | |
7397 | ||
7398 | void foo() { | |
7399 | func(NULL); | |
7400 | } | |
7401 | */ | |
7402 | if (arg == null_node | |
7403 | && DECL_TEMPLATE_INFO (fn) | |
7404 | && cand->template_decl | |
7405 | && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS)) | |
7406 | conversion_warning = false; | |
7407 | ||
5f5babf1 JM |
7408 | /* Warn about initializer_list deduction that isn't currently in the |
7409 | working draft. */ | |
7410 | if (cxx_dialect > cxx98 | |
7411 | && flag_deduce_init_list | |
7412 | && cand->template_decl | |
9d2b7551 JM |
7413 | && is_std_init_list (non_reference (type)) |
7414 | && BRACE_ENCLOSED_INITIALIZER_P (arg)) | |
5f5babf1 JM |
7415 | { |
7416 | tree tmpl = TI_TEMPLATE (cand->template_decl); | |
7417 | tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn)); | |
7418 | tree patparm = get_pattern_parm (realparm, tmpl); | |
d097567d JM |
7419 | tree pattype = TREE_TYPE (patparm); |
7420 | if (PACK_EXPANSION_P (pattype)) | |
7421 | pattype = PACK_EXPANSION_PATTERN (pattype); | |
7422 | pattype = non_reference (pattype); | |
5f5babf1 | 7423 | |
f18ea1bf JM |
7424 | if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM |
7425 | && (cand->explicit_targs == NULL_TREE | |
7426 | || (TREE_VEC_LENGTH (cand->explicit_targs) | |
7427 | <= TEMPLATE_TYPE_IDX (pattype)))) | |
5f5babf1 JM |
7428 | { |
7429 | pedwarn (input_location, 0, "deducing %qT as %qT", | |
7430 | non_reference (TREE_TYPE (patparm)), | |
7431 | non_reference (type)); | |
4b1cbcee PC |
7432 | pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0, |
7433 | " in call to %qD", cand->fn); | |
5f5babf1 JM |
7434 | pedwarn (input_location, 0, |
7435 | " (you can disable this with -fno-deduce-init-list)"); | |
7436 | } | |
7437 | } | |
1141ed3f BI |
7438 | val = convert_like_with_context (conv, arg, fn, i - is_method, |
7439 | conversion_warning | |
7440 | ? complain | |
7441 | : complain & (~tf_warning)); | |
5f5babf1 | 7442 | |
1141ed3f BI |
7443 | val = convert_for_arg_passing (type, val, complain); |
7444 | ||
267e265c | 7445 | if (val == error_mark_node) |
5ade1ed2 DG |
7446 | return error_mark_node; |
7447 | else | |
7448 | argarray[j++] = val; | |
c73964b2 MS |
7449 | } |
7450 | ||
7451 | /* Default arguments */ | |
c3f08228 | 7452 | for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++) |
7cc35b68 PC |
7453 | { |
7454 | if (TREE_VALUE (parm) == error_mark_node) | |
7455 | return error_mark_node; | |
7456 | argarray[j++] = convert_default_arg (TREE_VALUE (parm), | |
7457 | TREE_PURPOSE (parm), | |
b40e334f PC |
7458 | fn, i - is_method, |
7459 | complain); | |
7cc35b68 PC |
7460 | } |
7461 | ||
c73964b2 | 7462 | /* Ellipsis */ |
9771b263 | 7463 | for (; arg_index < vec_safe_length (args); ++arg_index) |
a6f86b51 | 7464 | { |
9771b263 | 7465 | tree a = (*args)[arg_index]; |
a6f86b51 | 7466 | if (magic_varargs_p (fn)) |
03a904b5 JJ |
7467 | /* Do no conversions for magic varargs. */ |
7468 | a = mark_type_use (a); | |
9efe5fbd JM |
7469 | else if (DECL_CONSTRUCTOR_P (fn) |
7470 | && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn), | |
7471 | TREE_TYPE (a))) | |
7472 | { | |
7473 | /* Avoid infinite recursion trying to call A(...). */ | |
7474 | if (complain & tf_error) | |
7475 | /* Try to call the actual copy constructor for a good error. */ | |
7476 | call_copy_ctor (a, complain); | |
7477 | return error_mark_node; | |
7478 | } | |
a6f86b51 | 7479 | else |
b40e334f | 7480 | a = convert_arg_to_ellipsis (a, complain); |
94a0dd7b | 7481 | argarray[j++] = a; |
a6f86b51 | 7482 | } |
c73964b2 | 7483 | |
94a0dd7b SL |
7484 | gcc_assert (j <= nargs); |
7485 | nargs = j; | |
c73964b2 | 7486 | |
dde05067 | 7487 | check_function_arguments (TREE_TYPE (fn), nargs, argarray); |
61cd552e | 7488 | |
c11b6f21 MS |
7489 | /* Avoid actually calling copy constructors and copy assignment operators, |
7490 | if possible. */ | |
56ae6d77 JM |
7491 | |
7492 | if (! flag_elide_constructors) | |
7493 | /* Do things the hard way. */; | |
8af2fec4 RY |
7494 | else if (cand->num_convs == 1 |
7495 | && (DECL_COPY_CONSTRUCTOR_P (fn) | |
04bbdb1d PC |
7496 | || DECL_MOVE_CONSTRUCTOR_P (fn)) |
7497 | /* It's unsafe to elide the constructor when handling | |
7498 | a noexcept-expression, it may evaluate to the wrong | |
7499 | value (c++/53025). */ | |
7500 | && cp_noexcept_operand == 0) | |
c11b6f21 | 7501 | { |
eb66be0e | 7502 | tree targ; |
c166b898 ILT |
7503 | tree arg = argarray[num_artificial_parms_for (fn)]; |
7504 | tree fa; | |
ac177431 | 7505 | bool trivial = trivial_fn_p (fn); |
c11b6f21 MS |
7506 | |
7507 | /* Pull out the real argument, disregarding const-correctness. */ | |
eb66be0e | 7508 | targ = arg; |
63a906f0 TB |
7509 | while (CONVERT_EXPR_P (targ) |
7510 | || TREE_CODE (targ) == NON_LVALUE_EXPR) | |
eb66be0e MS |
7511 | targ = TREE_OPERAND (targ, 0); |
7512 | if (TREE_CODE (targ) == ADDR_EXPR) | |
7513 | { | |
7514 | targ = TREE_OPERAND (targ, 0); | |
c8094d83 | 7515 | if (!same_type_ignoring_top_level_qualifiers_p |
9edc3913 | 7516 | (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ))) |
c11b6f21 MS |
7517 | targ = NULL_TREE; |
7518 | } | |
eb66be0e MS |
7519 | else |
7520 | targ = NULL_TREE; | |
c11b6f21 MS |
7521 | |
7522 | if (targ) | |
7523 | arg = targ; | |
7524 | else | |
dd865ef6 | 7525 | arg = cp_build_indirect_ref (arg, RO_NULL, complain); |
c11b6f21 | 7526 | |
bd6dd845 MS |
7527 | /* [class.copy]: the copy constructor is implicitly defined even if |
7528 | the implementation elided its use. */ | |
be5e6908 | 7529 | if (!trivial || DECL_DELETED_FN (fn)) |
b87d79e6 | 7530 | { |
9f635aba PC |
7531 | if (!mark_used (fn, complain) && !(complain & tf_error)) |
7532 | return error_mark_node; | |
b87d79e6 JM |
7533 | already_used = true; |
7534 | } | |
bd6dd845 | 7535 | |
c11b6f21 | 7536 | /* If we're creating a temp and we already have one, don't create a |
0cbd7506 MS |
7537 | new one. If we're not creating a temp but we get one, use |
7538 | INIT_EXPR to collapse the temp into our target. Otherwise, if the | |
7539 | ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a | |
7540 | temp or an INIT_EXPR otherwise. */ | |
2dfa30b4 | 7541 | fa = argarray[0]; |
1dbdb756 | 7542 | if (is_dummy_object (fa)) |
c11b6f21 | 7543 | { |
c246c65d | 7544 | if (TREE_CODE (arg) == TARGET_EXPR) |
c11b6f21 | 7545 | return arg; |
ac177431 | 7546 | else if (trivial) |
574cfaa4 | 7547 | return force_target_expr (DECL_CONTEXT (fn), arg, complain); |
c11b6f21 | 7548 | } |
3c769e5a JM |
7549 | else if (trivial |
7550 | || (TREE_CODE (arg) == TARGET_EXPR | |
7551 | && !unsafe_copy_elision_p (fa, arg))) | |
c11b6f21 | 7552 | { |
dd865ef6 | 7553 | tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL, |
c166b898 | 7554 | complain)); |
a59ca936 | 7555 | |
6d729f28 | 7556 | val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg); |
6de9cd9a | 7557 | return val; |
c11b6f21 MS |
7558 | } |
7559 | } | |
596ea4e5 | 7560 | else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR |
66753821 JM |
7561 | && trivial_fn_p (fn) |
7562 | && !DECL_DELETED_FN (fn)) | |
c11b6f21 MS |
7563 | { |
7564 | tree to = stabilize_reference | |
dd865ef6 | 7565 | (cp_build_indirect_ref (argarray[0], RO_NULL, complain)); |
a0c68737 NS |
7566 | tree type = TREE_TYPE (to); |
7567 | tree as_base = CLASSTYPE_AS_BASE (type); | |
c166b898 | 7568 | tree arg = argarray[1]; |
a59ca936 | 7569 | |
9ba59715 JM |
7570 | if (is_really_empty_class (type)) |
7571 | { | |
7572 | /* Avoid copying empty classes. */ | |
7573 | val = build2 (COMPOUND_EXPR, void_type_node, to, arg); | |
7574 | TREE_NO_WARNING (val) = 1; | |
7575 | val = build2 (COMPOUND_EXPR, type, val, to); | |
7576 | TREE_NO_WARNING (val) = 1; | |
7577 | } | |
7578 | else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base))) | |
1d528e29 | 7579 | { |
dd865ef6 | 7580 | arg = cp_build_indirect_ref (arg, RO_NULL, complain); |
f293ce4b | 7581 | val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg); |
1d528e29 | 7582 | } |
a0c68737 NS |
7583 | else |
7584 | { | |
6aeb8c99 RG |
7585 | /* We must only copy the non-tail padding parts. */ |
7586 | tree arg0, arg2, t; | |
7587 | tree array_type, alias_set; | |
1d528e29 | 7588 | |
94a0dd7b | 7589 | arg2 = TYPE_SIZE_UNIT (as_base); |
93c0e0bb | 7590 | arg0 = cp_build_addr_expr (to, complain); |
15237f9a | 7591 | |
6aeb8c99 RG |
7592 | array_type = build_array_type (char_type_node, |
7593 | build_index_type | |
7594 | (size_binop (MINUS_EXPR, | |
7595 | arg2, size_int (1)))); | |
7596 | alias_set = build_int_cst (build_pointer_type (type), 0); | |
7597 | t = build2 (MODIFY_EXPR, void_type_node, | |
7598 | build2 (MEM_REF, array_type, arg0, alias_set), | |
7599 | build2 (MEM_REF, array_type, arg, alias_set)); | |
7600 | val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to); | |
041d7a27 | 7601 | TREE_NO_WARNING (val) = 1; |
a0c68737 | 7602 | } |
c8094d83 | 7603 | |
c11b6f21 MS |
7604 | return val; |
7605 | } | |
f7029277 JM |
7606 | else if (DECL_DESTRUCTOR_P (fn) |
7607 | && trivial_fn_p (fn) | |
7608 | && !DECL_DELETED_FN (fn)) | |
7609 | return fold_convert (void_type_node, argarray[0]); | |
7610 | /* FIXME handle trivial default constructor, too. */ | |
c11b6f21 | 7611 | |
3649b9b7 ST |
7612 | /* For calls to a multi-versioned function, overload resolution |
7613 | returns the function with the highest target priority, that is, | |
7614 | the version that will checked for dispatching first. If this | |
7615 | version is inlinable, a direct call to this version can be made | |
7616 | otherwise the call should go through the dispatcher. */ | |
7617 | ||
7618 | if (DECL_FUNCTION_VERSIONED (fn) | |
7f678e7e ST |
7619 | && (current_function_decl == NULL |
7620 | || !targetm.target_option.can_inline_p (current_function_decl, fn))) | |
3649b9b7 ST |
7621 | { |
7622 | fn = get_function_version_dispatcher (fn); | |
7623 | if (fn == NULL) | |
7624 | return NULL; | |
7625 | if (!already_used) | |
7626 | mark_versions_used (fn); | |
7627 | } | |
7628 | ||
39344c99 | 7629 | if (!already_used |
41cee85a | 7630 | && !mark_used (fn, complain)) |
39344c99 | 7631 | return error_mark_node; |
bd6dd845 | 7632 | |
c966f2de | 7633 | if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0 |
234bef96 PC |
7634 | /* Don't mess with virtual lookup in instantiate_non_dependent_expr; |
7635 | virtual functions can't be constexpr. */ | |
c966f2de | 7636 | && !in_template_function ()) |
c73964b2 | 7637 | { |
94a0dd7b SL |
7638 | tree t; |
7639 | tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])), | |
e93ee644 | 7640 | DECL_CONTEXT (fn), |
22854930 | 7641 | ba_any, NULL, complain); |
50bc768d | 7642 | gcc_assert (binfo && binfo != error_mark_node); |
c8094d83 | 7643 | |
a271590a PC |
7644 | argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1, |
7645 | complain); | |
94a0dd7b SL |
7646 | if (TREE_SIDE_EFFECTS (argarray[0])) |
7647 | argarray[0] = save_expr (argarray[0]); | |
c73964b2 | 7648 | t = build_pointer_type (TREE_TYPE (fn)); |
60c87482 | 7649 | if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn))) |
94a0dd7b | 7650 | fn = build_java_interface_fn_ref (fn, argarray[0]); |
60c87482 | 7651 | else |
94a0dd7b | 7652 | fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn)); |
c73964b2 MS |
7653 | TREE_TYPE (fn) = t; |
7654 | } | |
c73964b2 | 7655 | else |
89fcabaf PC |
7656 | { |
7657 | fn = build_addr_func (fn, complain); | |
7658 | if (fn == error_mark_node) | |
7659 | return error_mark_node; | |
7660 | } | |
c73964b2 | 7661 | |
4561285b JM |
7662 | tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag); |
7663 | if (TREE_CODE (call) == CALL_EXPR | |
7664 | && (cand->flags & LOOKUP_LIST_INIT_CTOR)) | |
7665 | CALL_EXPR_LIST_INIT_P (call) = true; | |
7666 | return call; | |
b2dd096b MM |
7667 | } |
7668 | ||
94a0dd7b SL |
7669 | /* Build and return a call to FN, using NARGS arguments in ARGARRAY. |
7670 | This function performs no overload resolution, conversion, or other | |
7671 | high-level operations. */ | |
b2dd096b MM |
7672 | |
7673 | tree | |
e2e03032 PC |
7674 | build_cxx_call (tree fn, int nargs, tree *argarray, |
7675 | tsubst_flags_t complain) | |
b2dd096b MM |
7676 | { |
7677 | tree fndecl; | |
a73b8b59 | 7678 | int optimize_sav; |
b2dd096b | 7679 | |
f732fa7b | 7680 | /* Remember roughly where this call is. */ |
8400e75e | 7681 | location_t loc = EXPR_LOC_OR_LOC (fn, input_location); |
94a0dd7b | 7682 | fn = build_call_a (fn, nargs, argarray); |
f732fa7b | 7683 | SET_EXPR_LOCATION (fn, loc); |
b2dd096b | 7684 | |
b2dd096b | 7685 | fndecl = get_callee_fndecl (fn); |
b2dd096b | 7686 | |
1466cf1a RG |
7687 | /* Check that arguments to builtin functions match the expectations. */ |
7688 | if (fndecl | |
7689 | && DECL_BUILT_IN (fndecl) | |
7690 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
7691 | && !check_builtin_function_arguments (fndecl, nargs, argarray)) | |
7692 | return error_mark_node; | |
7693 | ||
318cda85 BI |
7694 | /* If it is a built-in array notation function, then the return type of |
7695 | the function is the element type of the array passed in as array | |
7696 | notation (i.e. the first parameter of the function). */ | |
b72271b9 | 7697 | if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR) |
318cda85 BI |
7698 | { |
7699 | enum built_in_function bif = | |
7700 | is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn)); | |
7701 | if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD | |
7702 | || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL | |
7703 | || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX | |
7704 | || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN | |
7705 | || bif == BUILT_IN_CILKPLUS_SEC_REDUCE | |
7706 | || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING) | |
7707 | { | |
5e88a8f4 IZ |
7708 | if (call_expr_nargs (fn) == 0) |
7709 | { | |
7710 | error_at (EXPR_LOCATION (fn), "Invalid builtin arguments"); | |
7711 | return error_mark_node; | |
7712 | } | |
318cda85 BI |
7713 | /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or |
7714 | BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or | |
7715 | BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or | |
7716 | BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or | |
7717 | BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or | |
7718 | BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND | |
7719 | The pre-defined return-type is the correct one. */ | |
7720 | tree array_ntn = CALL_EXPR_ARG (fn, 0); | |
7721 | TREE_TYPE (fn) = TREE_TYPE (array_ntn); | |
7722 | return fn; | |
7723 | } | |
7724 | } | |
7725 | ||
b2dd096b | 7726 | /* Some built-in function calls will be evaluated at compile-time in |
a73b8b59 JM |
7727 | fold (). Set optimize to 1 when folding __builtin_constant_p inside |
7728 | a constexpr function so that fold_builtin_1 doesn't fold it to 0. */ | |
7729 | optimize_sav = optimize; | |
7730 | if (!optimize && fndecl && DECL_IS_BUILTIN_CONSTANT_P (fndecl) | |
7731 | && current_function_decl | |
7732 | && DECL_DECLARED_CONSTEXPR_P (current_function_decl)) | |
7733 | optimize = 1; | |
455f19cb | 7734 | fn = fold_if_not_in_template (fn); |
a73b8b59 | 7735 | optimize = optimize_sav; |
b2dd096b | 7736 | |
2c92b94d | 7737 | if (VOID_TYPE_P (TREE_TYPE (fn))) |
c73964b2 | 7738 | return fn; |
b2dd096b | 7739 | |
57fcd4f4 JM |
7740 | /* 5.2.2/11: If a function call is a prvalue of object type: if the |
7741 | function call is either the operand of a decltype-specifier or the | |
7742 | right operand of a comma operator that is the operand of a | |
7743 | decltype-specifier, a temporary object is not introduced for the | |
7744 | prvalue. The type of the prvalue may be incomplete. */ | |
7745 | if (!(complain & tf_decltype)) | |
7746 | { | |
7747 | fn = require_complete_type_sfinae (fn, complain); | |
7748 | if (fn == error_mark_node) | |
7749 | return error_mark_node; | |
b2dd096b | 7750 | |
57fcd4f4 JM |
7751 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn))) |
7752 | fn = build_cplus_new (TREE_TYPE (fn), fn, complain); | |
7753 | } | |
b82b76c6 | 7754 | return convert_from_reference (fn); |
c73964b2 MS |
7755 | } |
7756 | ||
e2500fed | 7757 | static GTY(()) tree java_iface_lookup_fn; |
60c87482 BM |
7758 | |
7759 | /* Make an expression which yields the address of the Java interface | |
7760 | method FN. This is achieved by generating a call to libjava's | |
7761 | _Jv_LookupInterfaceMethodIdx(). */ | |
7762 | ||
7763 | static tree | |
94be8403 | 7764 | build_java_interface_fn_ref (tree fn, tree instance) |
60c87482 | 7765 | { |
94a0dd7b | 7766 | tree lookup_fn, method, idx; |
60c87482 BM |
7767 | tree klass_ref, iface, iface_ref; |
7768 | int i; | |
c8094d83 | 7769 | |
60c87482 BM |
7770 | if (!java_iface_lookup_fn) |
7771 | { | |
0244e6f7 NF |
7772 | tree ftype = build_function_type_list (ptr_type_node, |
7773 | ptr_type_node, ptr_type_node, | |
7774 | java_int_type_node, NULL_TREE); | |
c8094d83 | 7775 | java_iface_lookup_fn |
0244e6f7 | 7776 | = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype, |
c79efc4d | 7777 | 0, NOT_BUILT_IN, NULL, NULL_TREE); |
60c87482 BM |
7778 | } |
7779 | ||
c8094d83 | 7780 | /* Look up the pointer to the runtime java.lang.Class object for `instance'. |
00a17e31 | 7781 | This is the first entry in the vtable. */ |
7ad86035 | 7782 | klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL, |
5ade1ed2 | 7783 | tf_warning_or_error), |
60c87482 BM |
7784 | integer_zero_node); |
7785 | ||
00a17e31 | 7786 | /* Get the java.lang.Class pointer for the interface being called. */ |
60c87482 | 7787 | iface = DECL_CONTEXT (fn); |
86ac0575 | 7788 | iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false); |
5a6ccc94 | 7789 | if (!iface_ref || !VAR_P (iface_ref) |
60c87482 BM |
7790 | || DECL_CONTEXT (iface_ref) != iface) |
7791 | { | |
c8094d83 | 7792 | error ("could not find class$ field in java interface type %qT", |
60c87482 BM |
7793 | iface); |
7794 | return error_mark_node; | |
7795 | } | |
6de9cd9a DN |
7796 | iface_ref = build_address (iface_ref); |
7797 | iface_ref = convert (build_pointer_type (iface), iface_ref); | |
c8094d83 | 7798 | |
00a17e31 | 7799 | /* Determine the itable index of FN. */ |
60c87482 | 7800 | i = 1; |
910ad8de | 7801 | for (method = TYPE_METHODS (iface); method; method = DECL_CHAIN (method)) |
60c87482 BM |
7802 | { |
7803 | if (!DECL_VIRTUAL_P (method)) | |
0cbd7506 | 7804 | continue; |
60c87482 | 7805 | if (fn == method) |
0cbd7506 | 7806 | break; |
60c87482 BM |
7807 | i++; |
7808 | } | |
7d60be94 | 7809 | idx = build_int_cst (NULL_TREE, i); |
60c87482 | 7810 | |
c8094d83 | 7811 | lookup_fn = build1 (ADDR_EXPR, |
60c87482 BM |
7812 | build_pointer_type (TREE_TYPE (java_iface_lookup_fn)), |
7813 | java_iface_lookup_fn); | |
94a0dd7b SL |
7814 | return build_call_nary (ptr_type_node, lookup_fn, |
7815 | 3, klass_ref, iface_ref, idx); | |
60c87482 BM |
7816 | } |
7817 | ||
298d6f60 | 7818 | /* Returns the value to use for the in-charge parameter when making a |
8dc2b103 | 7819 | call to a function with the indicated NAME. |
c8094d83 | 7820 | |
8dc2b103 | 7821 | FIXME:Can't we find a neater way to do this mapping? */ |
298d6f60 MM |
7822 | |
7823 | tree | |
94be8403 | 7824 | in_charge_arg_for_name (tree name) |
298d6f60 | 7825 | { |
8dc2b103 | 7826 | if (name == base_ctor_identifier |
298d6f60 MM |
7827 | || name == base_dtor_identifier) |
7828 | return integer_zero_node; | |
7829 | else if (name == complete_ctor_identifier) | |
7830 | return integer_one_node; | |
7831 | else if (name == complete_dtor_identifier) | |
7832 | return integer_two_node; | |
7833 | else if (name == deleting_dtor_identifier) | |
7834 | return integer_three_node; | |
7835 | ||
7836 | /* This function should only be called with one of the names listed | |
7837 | above. */ | |
8dc2b103 | 7838 | gcc_unreachable (); |
298d6f60 MM |
7839 | return NULL_TREE; |
7840 | } | |
7841 | ||
4ba126e4 MM |
7842 | /* Build a call to a constructor, destructor, or an assignment |
7843 | operator for INSTANCE, an expression with class type. NAME | |
c166b898 ILT |
7844 | indicates the special member function to call; *ARGS are the |
7845 | arguments. ARGS may be NULL. This may change ARGS. BINFO | |
7846 | indicates the base of INSTANCE that is to be passed as the `this' | |
7847 | parameter to the member function called. | |
4ba126e4 MM |
7848 | |
7849 | FLAGS are the LOOKUP_* flags to use when processing the call. | |
7850 | ||
7851 | If NAME indicates a complete object constructor, INSTANCE may be | |
7852 | NULL_TREE. In this case, the caller will call build_cplus_new to | |
7853 | store the newly constructed object into a VAR_DECL. */ | |
7854 | ||
7855 | tree | |
9771b263 | 7856 | build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args, |
5ade1ed2 | 7857 | tree binfo, int flags, tsubst_flags_t complain) |
4ba126e4 MM |
7858 | { |
7859 | tree fns; | |
7860 | /* The type of the subobject to be constructed or destroyed. */ | |
7861 | tree class_type; | |
9771b263 | 7862 | vec<tree, va_gc> *allocated = NULL; |
c166b898 | 7863 | tree ret; |
4ba126e4 | 7864 | |
50bc768d NS |
7865 | gcc_assert (name == complete_ctor_identifier |
7866 | || name == base_ctor_identifier | |
7867 | || name == complete_dtor_identifier | |
7868 | || name == base_dtor_identifier | |
7869 | || name == deleting_dtor_identifier | |
7870 | || name == ansi_assopname (NOP_EXPR)); | |
cad7e87b NS |
7871 | if (TYPE_P (binfo)) |
7872 | { | |
7873 | /* Resolve the name. */ | |
309714d4 | 7874 | if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain)) |
cad7e87b NS |
7875 | return error_mark_node; |
7876 | ||
7877 | binfo = TYPE_BINFO (binfo); | |
7878 | } | |
c8094d83 | 7879 | |
50bc768d | 7880 | gcc_assert (binfo != NULL_TREE); |
4ba126e4 MM |
7881 | |
7882 | class_type = BINFO_TYPE (binfo); | |
7883 | ||
7884 | /* Handle the special case where INSTANCE is NULL_TREE. */ | |
7885 | if (name == complete_ctor_identifier && !instance) | |
1dbdb756 | 7886 | instance = build_dummy_object (class_type); |
22ed7e5f MM |
7887 | else |
7888 | { | |
c8094d83 | 7889 | if (name == complete_dtor_identifier |
22ed7e5f MM |
7890 | || name == base_dtor_identifier |
7891 | || name == deleting_dtor_identifier) | |
9771b263 | 7892 | gcc_assert (args == NULL || vec_safe_is_empty (*args)); |
22ed7e5f | 7893 | |
4c2a4b90 | 7894 | /* Convert to the base class, if necessary. */ |
c8094d83 | 7895 | if (!same_type_ignoring_top_level_qualifiers_p |
22ed7e5f | 7896 | (TREE_TYPE (instance), BINFO_TYPE (binfo))) |
4c2a4b90 MM |
7897 | { |
7898 | if (name != ansi_assopname (NOP_EXPR)) | |
7899 | /* For constructors and destructors, either the base is | |
7900 | non-virtual, or it is virtual but we are doing the | |
7901 | conversion from a constructor or destructor for the | |
7902 | complete object. In either case, we can convert | |
7903 | statically. */ | |
7904 | instance = convert_to_base_statically (instance, binfo); | |
7905 | else | |
7906 | /* However, for assignment operators, we must convert | |
7907 | dynamically if the base is virtual. */ | |
7908 | instance = build_base_path (PLUS_EXPR, instance, | |
a271590a | 7909 | binfo, /*nonnull=*/1, complain); |
4c2a4b90 | 7910 | } |
22ed7e5f | 7911 | } |
c8094d83 | 7912 | |
50bc768d | 7913 | gcc_assert (instance != NULL_TREE); |
4ba126e4 | 7914 | |
4ba126e4 | 7915 | fns = lookup_fnfields (binfo, name, 1); |
c8094d83 | 7916 | |
4ba126e4 MM |
7917 | /* When making a call to a constructor or destructor for a subobject |
7918 | that uses virtual base classes, pass down a pointer to a VTT for | |
7919 | the subobject. */ | |
7920 | if ((name == base_ctor_identifier | |
7921 | || name == base_dtor_identifier) | |
5775a06a | 7922 | && CLASSTYPE_VBASECLASSES (class_type)) |
4ba126e4 MM |
7923 | { |
7924 | tree vtt; | |
7925 | tree sub_vtt; | |
7926 | ||
7927 | /* If the current function is a complete object constructor | |
7928 | or destructor, then we fetch the VTT directly. | |
7929 | Otherwise, we look it up using the VTT we were given. */ | |
910ad8de | 7930 | vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type)); |
89fcabaf PC |
7931 | vtt = decay_conversion (vtt, complain); |
7932 | if (vtt == error_mark_node) | |
7933 | return error_mark_node; | |
f293ce4b RS |
7934 | vtt = build3 (COND_EXPR, TREE_TYPE (vtt), |
7935 | build2 (EQ_EXPR, boolean_type_node, | |
7936 | current_in_charge_parm, integer_zero_node), | |
7937 | current_vtt_parm, | |
7938 | vtt); | |
238e471c VV |
7939 | if (BINFO_SUBVTT_INDEX (binfo)) |
7940 | sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo)); | |
7941 | else | |
7942 | sub_vtt = vtt; | |
4ba126e4 | 7943 | |
c166b898 ILT |
7944 | if (args == NULL) |
7945 | { | |
7946 | allocated = make_tree_vector (); | |
7947 | args = &allocated; | |
7948 | } | |
7949 | ||
9771b263 | 7950 | vec_safe_insert (*args, 0, sub_vtt); |
4ba126e4 MM |
7951 | } |
7952 | ||
c166b898 ILT |
7953 | ret = build_new_method_call (instance, fns, args, |
7954 | TYPE_BINFO (BINFO_TYPE (binfo)), | |
7955 | flags, /*fn=*/NULL, | |
7956 | complain); | |
7957 | ||
7958 | if (allocated != NULL) | |
7959 | release_tree_vector (allocated); | |
7960 | ||
a624d5fe PC |
7961 | if ((complain & tf_error) |
7962 | && (flags & LOOKUP_DELEGATING_CONS) | |
7963 | && name == complete_ctor_identifier | |
7964 | && TREE_CODE (ret) == CALL_EXPR | |
7965 | && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret), 0)) | |
7966 | == current_function_decl)) | |
7967 | error ("constructor delegates to itself"); | |
7968 | ||
c166b898 | 7969 | return ret; |
4ba126e4 MM |
7970 | } |
7971 | ||
a723baf1 MM |
7972 | /* Return the NAME, as a C string. The NAME indicates a function that |
7973 | is a member of TYPE. *FREE_P is set to true if the caller must | |
c8094d83 | 7974 | free the memory returned. |
a723baf1 MM |
7975 | |
7976 | Rather than go through all of this, we should simply set the names | |
7977 | of constructors and destructors appropriately, and dispense with | |
7978 | ctor_identifier, dtor_identifier, etc. */ | |
7979 | ||
7980 | static char * | |
7981 | name_as_c_string (tree name, tree type, bool *free_p) | |
7982 | { | |
7983 | char *pretty_name; | |
7984 | ||
7985 | /* Assume that we will not allocate memory. */ | |
7986 | *free_p = false; | |
7987 | /* Constructors and destructors are special. */ | |
7988 | if (IDENTIFIER_CTOR_OR_DTOR_P (name)) | |
7989 | { | |
c8094d83 | 7990 | pretty_name |
f41c4af3 | 7991 | = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)))); |
a723baf1 MM |
7992 | /* For a destructor, add the '~'. */ |
7993 | if (name == complete_dtor_identifier | |
7994 | || name == base_dtor_identifier | |
7995 | || name == deleting_dtor_identifier) | |
7996 | { | |
7997 | pretty_name = concat ("~", pretty_name, NULL); | |
7998 | /* Remember that we need to free the memory allocated. */ | |
7999 | *free_p = true; | |
8000 | } | |
8001 | } | |
144e414d MM |
8002 | else if (IDENTIFIER_TYPENAME_P (name)) |
8003 | { | |
8004 | pretty_name = concat ("operator ", | |
f41c4af3 JM |
8005 | type_as_string_translate (TREE_TYPE (name), |
8006 | TFF_PLAIN_IDENTIFIER), | |
144e414d MM |
8007 | NULL); |
8008 | /* Remember that we need to free the memory allocated. */ | |
8009 | *free_p = true; | |
8010 | } | |
a723baf1 | 8011 | else |
f41c4af3 | 8012 | pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name))); |
a723baf1 MM |
8013 | |
8014 | return pretty_name; | |
8015 | } | |
8016 | ||
63c9a190 | 8017 | /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will |
c166b898 ILT |
8018 | be set, upon return, to the function called. ARGS may be NULL. |
8019 | This may change ARGS. */ | |
4ba126e4 | 8020 | |
575bfb00 | 8021 | static tree |
9771b263 | 8022 | build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args, |
575bfb00 LC |
8023 | tree conversion_path, int flags, |
8024 | tree *fn_p, tsubst_flags_t complain) | |
c73964b2 MS |
8025 | { |
8026 | struct z_candidate *candidates = 0, *cand; | |
386b8a85 | 8027 | tree explicit_targs = NULL_TREE; |
4ba126e4 | 8028 | tree basetype = NULL_TREE; |
f8b0f44f | 8029 | tree access_binfo, binfo; |
4ba126e4 | 8030 | tree optype; |
c166b898 | 8031 | tree first_mem_arg = NULL_TREE; |
a723baf1 | 8032 | tree name; |
c166b898 | 8033 | bool skip_first_for_error; |
9771b263 | 8034 | vec<tree, va_gc> *user_args; |
3c8c2a0a | 8035 | tree call; |
a723baf1 | 8036 | tree fn; |
c32381b1 | 8037 | int template_only = 0; |
436f8a4c | 8038 | bool any_viable_p; |
d17811fd MM |
8039 | tree orig_instance; |
8040 | tree orig_fns; | |
9771b263 | 8041 | vec<tree, va_gc> *orig_args = NULL; |
5bd61841 | 8042 | void *p; |
824b9a4c | 8043 | |
50bc768d | 8044 | gcc_assert (instance != NULL_TREE); |
8f032717 | 8045 | |
63c9a190 MM |
8046 | /* We don't know what function we're going to call, yet. */ |
8047 | if (fn_p) | |
8048 | *fn_p = NULL_TREE; | |
8049 | ||
c8094d83 | 8050 | if (error_operand_p (instance) |
4ac4b596 | 8051 | || !fns || error_operand_p (fns)) |
4ba126e4 | 8052 | return error_mark_node; |
386b8a85 | 8053 | |
4ba126e4 | 8054 | if (!BASELINK_P (fns)) |
c73964b2 | 8055 | { |
5ade1ed2 DG |
8056 | if (complain & tf_error) |
8057 | error ("call to non-function %qD", fns); | |
4ba126e4 MM |
8058 | return error_mark_node; |
8059 | } | |
c73964b2 | 8060 | |
51b099e5 MM |
8061 | orig_instance = instance; |
8062 | orig_fns = fns; | |
51b099e5 | 8063 | |
aa7349eb | 8064 | /* Dismantle the baselink to collect all the information we need. */ |
4ba126e4 MM |
8065 | if (!conversion_path) |
8066 | conversion_path = BASELINK_BINFO (fns); | |
8067 | access_binfo = BASELINK_ACCESS_BINFO (fns); | |
f8b0f44f | 8068 | binfo = BASELINK_BINFO (fns); |
4ba126e4 MM |
8069 | optype = BASELINK_OPTYPE (fns); |
8070 | fns = BASELINK_FUNCTIONS (fns); | |
4ba126e4 MM |
8071 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) |
8072 | { | |
8073 | explicit_targs = TREE_OPERAND (fns, 1); | |
8074 | fns = TREE_OPERAND (fns, 0); | |
8075 | template_only = 1; | |
c73964b2 | 8076 | } |
50bc768d NS |
8077 | gcc_assert (TREE_CODE (fns) == FUNCTION_DECL |
8078 | || TREE_CODE (fns) == TEMPLATE_DECL | |
8079 | || TREE_CODE (fns) == OVERLOAD); | |
51b099e5 MM |
8080 | fn = get_first_fn (fns); |
8081 | name = DECL_NAME (fn); | |
c73964b2 | 8082 | |
51b099e5 MM |
8083 | basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance)); |
8084 | gcc_assert (CLASS_TYPE_P (basetype)); | |
c73964b2 | 8085 | |
51b099e5 MM |
8086 | if (processing_template_decl) |
8087 | { | |
c166b898 | 8088 | orig_args = args == NULL ? NULL : make_tree_vector_copy (*args); |
51b099e5 | 8089 | instance = build_non_dependent_expr (instance); |
c166b898 ILT |
8090 | if (args != NULL) |
8091 | make_args_non_dependent (*args); | |
8092 | } | |
8093 | ||
55388afd JM |
8094 | user_args = args == NULL ? NULL : *args; |
8095 | /* Under DR 147 A::A() is an invalid constructor call, | |
8096 | not a functional cast. */ | |
8097 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) | |
8098 | { | |
8099 | if (! (complain & tf_error)) | |
8100 | return error_mark_node; | |
8101 | ||
7abebba7 PC |
8102 | if (permerror (input_location, |
8103 | "cannot call constructor %<%T::%D%> directly", | |
8104 | basetype, name)) | |
8105 | inform (input_location, "for a function-style cast, remove the " | |
8106 | "redundant %<::%D%>", name); | |
55388afd JM |
8107 | call = build_functional_cast (basetype, build_tree_list_vec (user_args), |
8108 | complain); | |
55388afd JM |
8109 | return call; |
8110 | } | |
8111 | ||
c166b898 ILT |
8112 | /* Figure out whether to skip the first argument for the error |
8113 | message we will display to users if an error occurs. We don't | |
8114 | want to display any compiler-generated arguments. The "this" | |
8115 | pointer hasn't been added yet. However, we must remove the VTT | |
8116 | pointer if this is a call to a base-class constructor or | |
8117 | destructor. */ | |
8118 | skip_first_for_error = false; | |
298d6f60 | 8119 | if (IDENTIFIER_CTOR_OR_DTOR_P (name)) |
9eb71d8c | 8120 | { |
4ba126e4 MM |
8121 | /* Callers should explicitly indicate whether they want to construct |
8122 | the complete object or just the part without virtual bases. */ | |
50bc768d | 8123 | gcc_assert (name != ctor_identifier); |
4ba126e4 | 8124 | /* Similarly for destructors. */ |
50bc768d | 8125 | gcc_assert (name != dtor_identifier); |
51b099e5 MM |
8126 | /* Remove the VTT pointer, if present. */ |
8127 | if ((name == base_ctor_identifier || name == base_dtor_identifier) | |
8128 | && CLASSTYPE_VBASECLASSES (basetype)) | |
c166b898 | 8129 | skip_first_for_error = true; |
9eb71d8c | 8130 | } |
c73964b2 | 8131 | |
51b099e5 | 8132 | /* Process the argument list. */ |
c166b898 ILT |
8133 | if (args != NULL && *args != NULL) |
8134 | { | |
b46c79a1 | 8135 | *args = resolve_args (*args, complain); |
c166b898 ILT |
8136 | if (*args == NULL) |
8137 | return error_mark_node; | |
8138 | } | |
51b099e5 | 8139 | |
a7175123 JM |
8140 | /* Consider the object argument to be used even if we end up selecting a |
8141 | static member function. */ | |
8142 | instance = mark_type_use (instance); | |
51b099e5 | 8143 | |
a489b1f0 | 8144 | /* It's OK to call destructors and constructors on cv-qualified objects. |
a7175123 | 8145 | Therefore, convert the INSTANCE to the unqualified type, if |
a489b1f0 RG |
8146 | necessary. */ |
8147 | if (DECL_DESTRUCTOR_P (fn) | |
8148 | || DECL_CONSTRUCTOR_P (fn)) | |
c73964b2 | 8149 | { |
a7175123 JM |
8150 | if (!same_type_p (basetype, TREE_TYPE (instance))) |
8151 | { | |
8152 | instance = build_this (instance); | |
8153 | instance = build_nop (build_pointer_type (basetype), instance); | |
8154 | instance = build_fold_indirect_ref (instance); | |
8155 | } | |
a723baf1 | 8156 | } |
a489b1f0 RG |
8157 | if (DECL_DESTRUCTOR_P (fn)) |
8158 | name = complete_dtor_identifier; | |
4ba126e4 | 8159 | |
0b360a07 MV |
8160 | /* For the overload resolution we need to find the actual `this` |
8161 | that would be captured if the call turns out to be to a | |
8162 | non-static member function. Do not actually capture it at this | |
8163 | point. */ | |
a2f259ef JM |
8164 | if (DECL_CONSTRUCTOR_P (fn)) |
8165 | /* Constructors don't use the enclosing 'this'. */ | |
8166 | first_mem_arg = instance; | |
8167 | else | |
8168 | first_mem_arg = maybe_resolve_dummy (instance, false); | |
4c9b3895 JM |
8169 | |
8170 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
8171 | p = conversion_obstack_alloc (0); | |
8172 | ||
09357846 | 8173 | /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form |
4c9b3895 | 8174 | initializer, not T({ }). */ |
9771b263 | 8175 | if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !vec_safe_is_empty (*args) |
014397c2 | 8176 | && DIRECT_LIST_INIT_P ((**args)[0])) |
09357846 | 8177 | { |
9771b263 | 8178 | tree init_list = (**args)[0]; |
b1c83c23 | 8179 | tree init = NULL_TREE; |
2061820e | 8180 | |
9771b263 | 8181 | gcc_assert ((*args)->length () == 1 |
611d6f76 | 8182 | && !(flags & LOOKUP_ONLYCONVERTING)); |
d451d5b2 | 8183 | |
2061820e JM |
8184 | /* If the initializer list has no elements and T is a class type with |
8185 | a default constructor, the object is value-initialized. Handle | |
8186 | this here so we don't need to handle it wherever we use | |
8187 | build_special_member_call. */ | |
8188 | if (CONSTRUCTOR_NELTS (init_list) == 0 | |
8189 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) | |
3a322efd JM |
8190 | /* For a user-provided default constructor, use the normal |
8191 | mechanisms so that protected access works. */ | |
a710f1f8 | 8192 | && type_has_non_user_provided_default_constructor (basetype) |
2061820e | 8193 | && !processing_template_decl) |
b1c83c23 JM |
8194 | init = build_value_init (basetype, complain); |
8195 | ||
8196 | /* If BASETYPE is an aggregate, we need to do aggregate | |
8197 | initialization. */ | |
8198 | else if (CP_AGGREGATE_TYPE_P (basetype)) | |
e056dfd0 JM |
8199 | { |
8200 | init = reshape_init (basetype, init_list, complain); | |
8201 | init = digest_init (basetype, init, complain); | |
8202 | } | |
b1c83c23 JM |
8203 | |
8204 | if (init) | |
2061820e | 8205 | { |
1dbdb756 | 8206 | if (is_dummy_object (instance)) |
2061820e | 8207 | return get_target_expr_sfinae (init, complain); |
a7175123 | 8208 | init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init); |
2061820e JM |
8209 | TREE_SIDE_EFFECTS (init) = true; |
8210 | return init; | |
8211 | } | |
8212 | ||
b1c83c23 | 8213 | /* Otherwise go ahead with overload resolution. */ |
2061820e | 8214 | add_list_candidates (fns, first_mem_arg, init_list, |
4c9b3895 | 8215 | basetype, explicit_targs, template_only, |
b40e334f PC |
8216 | conversion_path, access_binfo, flags, |
8217 | &candidates, complain); | |
09357846 | 8218 | } |
4c9b3895 | 8219 | else |
d451d5b2 JM |
8220 | { |
8221 | add_candidates (fns, first_mem_arg, user_args, optype, | |
8222 | explicit_targs, template_only, conversion_path, | |
b40e334f | 8223 | access_binfo, flags, &candidates, complain); |
d451d5b2 | 8224 | } |
4c9b3895 | 8225 | any_viable_p = false; |
89606913 | 8226 | candidates = splice_viable (candidates, false, &any_viable_p); |
c73964b2 | 8227 | |
436f8a4c | 8228 | if (!any_viable_p) |
c73964b2 | 8229 | { |
5ade1ed2 | 8230 | if (complain & tf_error) |
a723baf1 | 8231 | { |
be5e6908 | 8232 | if (!COMPLETE_OR_OPEN_TYPE_P (basetype)) |
a7175123 | 8233 | cxx_incomplete_type_error (instance, basetype); |
404f08f8 JM |
8234 | else if (optype) |
8235 | error ("no matching function for call to %<%T::operator %T(%A)%#V%>", | |
8236 | basetype, optype, build_tree_list_vec (user_args), | |
a7175123 | 8237 | TREE_TYPE (instance)); |
5ade1ed2 DG |
8238 | else |
8239 | { | |
8240 | char *pretty_name; | |
8241 | bool free_p; | |
c166b898 | 8242 | tree arglist; |
5ade1ed2 DG |
8243 | |
8244 | pretty_name = name_as_c_string (name, basetype, &free_p); | |
c166b898 ILT |
8245 | arglist = build_tree_list_vec (user_args); |
8246 | if (skip_first_for_error) | |
8247 | arglist = TREE_CHAIN (arglist); | |
5ade1ed2 | 8248 | error ("no matching function for call to %<%T::%s(%A)%#V%>", |
c166b898 | 8249 | basetype, pretty_name, arglist, |
a7175123 | 8250 | TREE_TYPE (instance)); |
5ade1ed2 DG |
8251 | if (free_p) |
8252 | free (pretty_name); | |
8253 | } | |
feb6efc1 | 8254 | print_z_candidates (location_of (name), candidates); |
a723baf1 | 8255 | } |
5bd61841 | 8256 | call = error_mark_node; |
c73964b2 | 8257 | } |
5bd61841 | 8258 | else |
c73964b2 | 8259 | { |
b40e334f | 8260 | cand = tourney (candidates, complain); |
5bd61841 MM |
8261 | if (cand == 0) |
8262 | { | |
8263 | char *pretty_name; | |
8264 | bool free_p; | |
c166b898 | 8265 | tree arglist; |
a723baf1 | 8266 | |
5ade1ed2 DG |
8267 | if (complain & tf_error) |
8268 | { | |
8269 | pretty_name = name_as_c_string (name, basetype, &free_p); | |
c166b898 ILT |
8270 | arglist = build_tree_list_vec (user_args); |
8271 | if (skip_first_for_error) | |
8272 | arglist = TREE_CHAIN (arglist); | |
c29f393f JM |
8273 | if (!any_strictly_viable (candidates)) |
8274 | error ("no matching function for call to %<%s(%A)%>", | |
8275 | pretty_name, arglist); | |
8276 | else | |
8277 | error ("call of overloaded %<%s(%A)%> is ambiguous", | |
8278 | pretty_name, arglist); | |
feb6efc1 | 8279 | print_z_candidates (location_of (name), candidates); |
5ade1ed2 DG |
8280 | if (free_p) |
8281 | free (pretty_name); | |
8282 | } | |
5bd61841 MM |
8283 | call = error_mark_node; |
8284 | } | |
8285 | else | |
8286 | { | |
63c9a190 | 8287 | fn = cand->fn; |
0ef811d7 | 8288 | call = NULL_TREE; |
63c9a190 | 8289 | |
585b44d3 | 8290 | if (!(flags & LOOKUP_NONVIRTUAL) |
63c9a190 | 8291 | && DECL_PURE_VIRTUAL_P (fn) |
5bd61841 | 8292 | && instance == current_class_ref |
5ade1ed2 | 8293 | && (complain & tf_warning)) |
7d092805 PC |
8294 | { |
8295 | /* This is not an error, it is runtime undefined | |
8296 | behavior. */ | |
8297 | if (!current_function_decl) | |
8298 | warning (0, "pure virtual %q#D called from " | |
8299 | "non-static data member initializer", fn); | |
8300 | else if (DECL_CONSTRUCTOR_P (current_function_decl) | |
8301 | || DECL_DESTRUCTOR_P (current_function_decl)) | |
8302 | warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) | |
8303 | ? "pure virtual %q#D called from constructor" | |
8304 | : "pure virtual %q#D called from destructor"), | |
8305 | fn); | |
8306 | } | |
c8094d83 | 8307 | |
63c9a190 | 8308 | if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE |
1dbdb756 | 8309 | && !DECL_CONSTRUCTOR_P (fn) |
a7175123 | 8310 | && is_dummy_object (instance)) |
5bd61841 | 8311 | { |
0b360a07 | 8312 | instance = maybe_resolve_dummy (instance, true); |
0ef811d7 JM |
8313 | if (instance == error_mark_node) |
8314 | call = error_mark_node; | |
8315 | else if (!is_dummy_object (instance)) | |
8316 | { | |
8317 | /* We captured 'this' in the current lambda now that | |
8318 | we know we really need it. */ | |
a7175123 | 8319 | cand->first_arg = instance; |
0ef811d7 JM |
8320 | } |
8321 | else | |
8322 | { | |
8323 | if (complain & tf_error) | |
8324 | error ("cannot call member function %qD without object", | |
8325 | fn); | |
8326 | call = error_mark_node; | |
8327 | } | |
5bd61841 | 8328 | } |
0ef811d7 JM |
8329 | |
8330 | if (call != error_mark_node) | |
5bd61841 | 8331 | { |
7628dc54 FC |
8332 | /* Optimize away vtable lookup if we know that this |
8333 | function can't be overridden. We need to check if | |
f8b0f44f | 8334 | the context and the type where we found fn are the same, |
7628dc54 FC |
8335 | actually FN might be defined in a different class |
8336 | type because of a using-declaration. In this case, we | |
8337 | do not want to perform a non-virtual call. */ | |
63c9a190 | 8338 | if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL) |
7628dc54 | 8339 | && same_type_ignoring_top_level_qualifiers_p |
f8b0f44f | 8340 | (DECL_CONTEXT (fn), BINFO_TYPE (binfo)) |
1fa2969f | 8341 | && resolves_to_fixed_type_p (instance, 0)) |
5bd61841 | 8342 | flags |= LOOKUP_NONVIRTUAL; |
2e1df0f0 DN |
8343 | if (explicit_targs) |
8344 | flags |= LOOKUP_EXPLICIT_TMPL_ARGS; | |
63c9a190 MM |
8345 | /* Now we know what function is being called. */ |
8346 | if (fn_p) | |
8347 | *fn_p = fn; | |
e69460b6 | 8348 | /* Build the actual CALL_EXPR. */ |
5ade1ed2 | 8349 | call = build_over_call (cand, flags, complain); |
5bd61841 MM |
8350 | /* In an expression of the form `a->f()' where `f' turns |
8351 | out to be a static member function, `a' is | |
8352 | none-the-less evaluated. */ | |
63c9a190 | 8353 | if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE |
a7175123 JM |
8354 | && !is_dummy_object (instance) |
8355 | && TREE_SIDE_EFFECTS (instance)) | |
c8094d83 | 8356 | call = build2 (COMPOUND_EXPR, TREE_TYPE (call), |
a7175123 | 8357 | instance, call); |
c88b0c50 MM |
8358 | else if (call != error_mark_node |
8359 | && DECL_DESTRUCTOR_P (cand->fn) | |
8360 | && !VOID_TYPE_P (TREE_TYPE (call))) | |
8361 | /* An explicit call of the form "x->~X()" has type | |
8362 | "void". However, on platforms where destructors | |
8363 | return "this" (i.e., those where | |
8364 | targetm.cxx.cdtor_returns_this is true), such calls | |
8365 | will appear to have a return value of pointer type | |
8366 | to the low-level call machinery. We do not want to | |
8367 | change the low-level machinery, since we want to be | |
8368 | able to optimize "delete f()" on such platforms as | |
8369 | "operator delete(~X(f()))" (rather than generating | |
8370 | "t = f(), ~X(t), operator delete (t)"). */ | |
8371 | call = build_nop (void_type_node, call); | |
5bd61841 MM |
8372 | } |
8373 | } | |
c73964b2 MS |
8374 | } |
8375 | ||
5bd61841 | 8376 | if (processing_template_decl && call != error_mark_node) |
c7962e7d | 8377 | { |
6cea69fe JJ |
8378 | bool cast_to_void = false; |
8379 | ||
8380 | if (TREE_CODE (call) == COMPOUND_EXPR) | |
8381 | call = TREE_OPERAND (call, 1); | |
8382 | else if (TREE_CODE (call) == NOP_EXPR) | |
8383 | { | |
8384 | cast_to_void = true; | |
8385 | call = TREE_OPERAND (call, 0); | |
8386 | } | |
591cb3cf | 8387 | if (INDIRECT_REF_P (call)) |
c7962e7d | 8388 | call = TREE_OPERAND (call, 0); |
c166b898 | 8389 | call = (build_min_non_dep_call_vec |
c7962e7d JM |
8390 | (call, |
8391 | build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)), | |
8392 | orig_instance, orig_fns, NULL_TREE), | |
8393 | orig_args)); | |
03b8c9bf | 8394 | SET_EXPR_LOCATION (call, input_location); |
c7962e7d | 8395 | call = convert_from_reference (call); |
6cea69fe JJ |
8396 | if (cast_to_void) |
8397 | call = build_nop (void_type_node, call); | |
c7962e7d | 8398 | } |
c73964b2 | 8399 | |
5bd61841 MM |
8400 | /* Free all the conversions we allocated. */ |
8401 | obstack_free (&conversion_obstack, p); | |
c73964b2 | 8402 | |
c166b898 ILT |
8403 | if (orig_args != NULL) |
8404 | release_tree_vector (orig_args); | |
8405 | ||
3c8c2a0a | 8406 | return call; |
c73964b2 MS |
8407 | } |
8408 | ||
575bfb00 LC |
8409 | /* Wrapper for above. */ |
8410 | ||
8411 | tree | |
9771b263 | 8412 | build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args, |
575bfb00 LC |
8413 | tree conversion_path, int flags, |
8414 | tree *fn_p, tsubst_flags_t complain) | |
8415 | { | |
8416 | tree ret; | |
8417 | bool subtime = timevar_cond_start (TV_OVERLOAD); | |
8418 | ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags, | |
8419 | fn_p, complain); | |
8420 | timevar_cond_stop (TV_OVERLOAD, subtime); | |
8421 | return ret; | |
8422 | } | |
8423 | ||
94be8403 | 8424 | /* Returns true iff standard conversion sequence ICS1 is a proper |
ceab47eb | 8425 | subsequence of ICS2. */ |
c73964b2 | 8426 | |
94be8403 | 8427 | static bool |
5bd61841 | 8428 | is_subseq (conversion *ics1, conversion *ics2) |
c73964b2 | 8429 | { |
ceab47eb MM |
8430 | /* We can assume that a conversion of the same code |
8431 | between the same types indicates a subsequence since we only get | |
8432 | here if the types we are converting from are the same. */ | |
549121cd | 8433 | |
5bd61841 MM |
8434 | while (ics1->kind == ck_rvalue |
8435 | || ics1->kind == ck_lvalue) | |
40703fdf | 8436 | ics1 = next_conversion (ics1); |
c73964b2 | 8437 | |
ceab47eb | 8438 | while (1) |
c73964b2 | 8439 | { |
5bd61841 MM |
8440 | while (ics2->kind == ck_rvalue |
8441 | || ics2->kind == ck_lvalue) | |
40703fdf | 8442 | ics2 = next_conversion (ics2); |
c73964b2 | 8443 | |
5bd61841 MM |
8444 | if (ics2->kind == ck_user |
8445 | || ics2->kind == ck_ambig | |
756bcf03 JM |
8446 | || ics2->kind == ck_aggr |
8447 | || ics2->kind == ck_list | |
5bd61841 | 8448 | || ics2->kind == ck_identity) |
ceab47eb MM |
8449 | /* At this point, ICS1 cannot be a proper subsequence of |
8450 | ICS2. We can get a USER_CONV when we are comparing the | |
8451 | second standard conversion sequence of two user conversion | |
8452 | sequences. */ | |
94be8403 | 8453 | return false; |
f62dbf03 | 8454 | |
40703fdf | 8455 | ics2 = next_conversion (ics2); |
653cc74a | 8456 | |
5bd61841 MM |
8457 | if (ics2->kind == ics1->kind |
8458 | && same_type_p (ics2->type, ics1->type) | |
40703fdf DS |
8459 | && same_type_p (next_conversion (ics2)->type, |
8460 | next_conversion (ics1)->type)) | |
94be8403 | 8461 | return true; |
f62dbf03 JM |
8462 | } |
8463 | } | |
8464 | ||
838dfd8a | 8465 | /* Returns nonzero iff DERIVED is derived from BASE. The inputs may |
ceab47eb | 8466 | be any _TYPE nodes. */ |
c73964b2 | 8467 | |
94be8403 GDR |
8468 | bool |
8469 | is_properly_derived_from (tree derived, tree base) | |
c73964b2 | 8470 | { |
9e1e64ec | 8471 | if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base)) |
94be8403 | 8472 | return false; |
c73964b2 | 8473 | |
ceab47eb MM |
8474 | /* We only allow proper derivation here. The DERIVED_FROM_P macro |
8475 | considers every class derived from itself. */ | |
9edc3913 | 8476 | return (!same_type_ignoring_top_level_qualifiers_p (derived, base) |
ceab47eb MM |
8477 | && DERIVED_FROM_P (base, derived)); |
8478 | } | |
d11ad92e | 8479 | |
ceab47eb MM |
8480 | /* We build the ICS for an implicit object parameter as a pointer |
8481 | conversion sequence. However, such a sequence should be compared | |
8482 | as if it were a reference conversion sequence. If ICS is the | |
8483 | implicit conversion sequence for an implicit object parameter, | |
8484 | modify it accordingly. */ | |
d11ad92e | 8485 | |
ceab47eb | 8486 | static void |
5bd61841 | 8487 | maybe_handle_implicit_object (conversion **ics) |
ceab47eb | 8488 | { |
5bd61841 | 8489 | if ((*ics)->this_p) |
d11ad92e | 8490 | { |
ceab47eb | 8491 | /* [over.match.funcs] |
c8094d83 | 8492 | |
ceab47eb MM |
8493 | For non-static member functions, the type of the |
8494 | implicit object parameter is "reference to cv X" | |
8495 | where X is the class of which the function is a | |
8496 | member and cv is the cv-qualification on the member | |
8497 | function declaration. */ | |
5bd61841 | 8498 | conversion *t = *ics; |
b0385db8 MM |
8499 | tree reference_type; |
8500 | ||
8501 | /* The `this' parameter is a pointer to a class type. Make the | |
34cd5ae7 | 8502 | implicit conversion talk about a reference to that same class |
b0385db8 | 8503 | type. */ |
5bd61841 | 8504 | reference_type = TREE_TYPE (t->type); |
b0385db8 MM |
8505 | reference_type = build_reference_type (reference_type); |
8506 | ||
5bd61841 | 8507 | if (t->kind == ck_qual) |
40703fdf | 8508 | t = next_conversion (t); |
5bd61841 | 8509 | if (t->kind == ck_ptr) |
40703fdf | 8510 | t = next_conversion (t); |
5bd61841 | 8511 | t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE); |
c8094d83 | 8512 | t = direct_reference_binding (reference_type, t); |
0ee3f0a8 NS |
8513 | t->this_p = 1; |
8514 | t->rvaluedness_matches_p = 0; | |
ceab47eb | 8515 | *ics = t; |
d11ad92e | 8516 | } |
ceab47eb MM |
8517 | } |
8518 | ||
2d2e8123 | 8519 | /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion, |
8af2fec4 RY |
8520 | and return the initial reference binding conversion. Otherwise, |
8521 | leave *ICS unchanged and return NULL. */ | |
ceab47eb | 8522 | |
8af2fec4 | 8523 | static conversion * |
5bd61841 | 8524 | maybe_handle_ref_bind (conversion **ics) |
ceab47eb | 8525 | { |
5bd61841 | 8526 | if ((*ics)->kind == ck_ref_bind) |
d11ad92e | 8527 | { |
5bd61841 | 8528 | conversion *old_ics = *ics; |
40703fdf | 8529 | *ics = next_conversion (old_ics); |
5bd61841 | 8530 | (*ics)->user_conv_p = old_ics->user_conv_p; |
8af2fec4 | 8531 | return old_ics; |
d11ad92e | 8532 | } |
351a0f00 | 8533 | |
8af2fec4 | 8534 | return NULL; |
ceab47eb MM |
8535 | } |
8536 | ||
8537 | /* Compare two implicit conversion sequences according to the rules set out in | |
8538 | [over.ics.rank]. Return values: | |
d11ad92e | 8539 | |
ceab47eb MM |
8540 | 1: ics1 is better than ics2 |
8541 | -1: ics2 is better than ics1 | |
8542 | 0: ics1 and ics2 are indistinguishable */ | |
8543 | ||
8544 | static int | |
5bd61841 | 8545 | compare_ics (conversion *ics1, conversion *ics2) |
ceab47eb MM |
8546 | { |
8547 | tree from_type1; | |
8548 | tree from_type2; | |
8549 | tree to_type1; | |
8550 | tree to_type2; | |
8551 | tree deref_from_type1 = NULL_TREE; | |
87603ed0 KG |
8552 | tree deref_from_type2 = NULL_TREE; |
8553 | tree deref_to_type1 = NULL_TREE; | |
8554 | tree deref_to_type2 = NULL_TREE; | |
5bd61841 | 8555 | conversion_rank rank1, rank2; |
ceab47eb | 8556 | |
838dfd8a | 8557 | /* REF_BINDING is nonzero if the result of the conversion sequence |
8af2fec4 RY |
8558 | is a reference type. In that case REF_CONV is the reference |
8559 | binding conversion. */ | |
8560 | conversion *ref_conv1; | |
8561 | conversion *ref_conv2; | |
ceab47eb | 8562 | |
d02f620d JM |
8563 | /* Compare badness before stripping the reference conversion. */ |
8564 | if (ics1->bad_p > ics2->bad_p) | |
8565 | return -1; | |
8566 | else if (ics1->bad_p < ics2->bad_p) | |
8567 | return 1; | |
8568 | ||
ceab47eb MM |
8569 | /* Handle implicit object parameters. */ |
8570 | maybe_handle_implicit_object (&ics1); | |
8571 | maybe_handle_implicit_object (&ics2); | |
8572 | ||
8573 | /* Handle reference parameters. */ | |
8af2fec4 RY |
8574 | ref_conv1 = maybe_handle_ref_bind (&ics1); |
8575 | ref_conv2 = maybe_handle_ref_bind (&ics2); | |
ceab47eb | 8576 | |
50ea39ff JM |
8577 | /* List-initialization sequence L1 is a better conversion sequence than |
8578 | list-initialization sequence L2 if L1 converts to | |
8579 | std::initializer_list<X> for some X and L2 does not. */ | |
8580 | if (ics1->kind == ck_list && ics2->kind != ck_list) | |
8581 | return 1; | |
8582 | if (ics2->kind == ck_list && ics1->kind != ck_list) | |
8583 | return -1; | |
8584 | ||
ceab47eb MM |
8585 | /* [over.ics.rank] |
8586 | ||
8587 | When comparing the basic forms of implicit conversion sequences (as | |
8588 | defined in _over.best.ics_) | |
8589 | ||
8590 | --a standard conversion sequence (_over.ics.scs_) is a better | |
8591 | conversion sequence than a user-defined conversion sequence | |
8592 | or an ellipsis conversion sequence, and | |
c8094d83 | 8593 | |
ceab47eb MM |
8594 | --a user-defined conversion sequence (_over.ics.user_) is a |
8595 | better conversion sequence than an ellipsis conversion sequence | |
8596 | (_over.ics.ellipsis_). */ | |
d02f620d JM |
8597 | /* Use BAD_CONVERSION_RANK because we already checked for a badness |
8598 | mismatch. If both ICS are bad, we try to make a decision based on | |
8599 | what would have happened if they'd been good. This is not an | |
8600 | extension, we'll still give an error when we build up the call; this | |
8601 | just helps us give a more helpful error message. */ | |
8602 | rank1 = BAD_CONVERSION_RANK (ics1); | |
8603 | rank2 = BAD_CONVERSION_RANK (ics2); | |
c8094d83 | 8604 | |
bea09693 | 8605 | if (rank1 > rank2) |
c73964b2 | 8606 | return -1; |
bea09693 | 8607 | else if (rank1 < rank2) |
c73964b2 MS |
8608 | return 1; |
8609 | ||
6eb208a6 JM |
8610 | if (ics1->ellipsis_p) |
8611 | /* Both conversions are ellipsis conversions. */ | |
ceab47eb MM |
8612 | return 0; |
8613 | ||
c73964b2 MS |
8614 | /* User-defined conversion sequence U1 is a better conversion sequence |
8615 | than another user-defined conversion sequence U2 if they contain the | |
8616 | same user-defined conversion operator or constructor and if the sec- | |
8617 | ond standard conversion sequence of U1 is better than the second | |
8618 | standard conversion sequence of U2. */ | |
8619 | ||
6eb208a6 JM |
8620 | /* Handle list-conversion with the same code even though it isn't always |
8621 | ranked as a user-defined conversion and it doesn't have a second | |
8622 | standard conversion sequence; it will still have the desired effect. | |
8623 | Specifically, we need to do the reference binding comparison at the | |
8624 | end of this function. */ | |
8625 | ||
37b9a3bd | 8626 | if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr) |
c73964b2 | 8627 | { |
5bd61841 MM |
8628 | conversion *t1; |
8629 | conversion *t2; | |
c73964b2 | 8630 | |
40703fdf | 8631 | for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1)) |
6eb208a6 JM |
8632 | if (t1->kind == ck_ambig || t1->kind == ck_aggr |
8633 | || t1->kind == ck_list) | |
756bcf03 | 8634 | break; |
40703fdf | 8635 | for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2)) |
6eb208a6 JM |
8636 | if (t2->kind == ck_ambig || t2->kind == ck_aggr |
8637 | || t2->kind == ck_list) | |
756bcf03 | 8638 | break; |
c73964b2 | 8639 | |
756bcf03 | 8640 | if (t1->kind != t2->kind) |
c73964b2 | 8641 | return 0; |
756bcf03 JM |
8642 | else if (t1->kind == ck_user) |
8643 | { | |
8644 | if (t1->cand->fn != t2->cand->fn) | |
8645 | return 0; | |
8646 | } | |
8647 | else | |
8648 | { | |
8649 | /* For ambiguous or aggregate conversions, use the target type as | |
8650 | a proxy for the conversion function. */ | |
8651 | if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type)) | |
8652 | return 0; | |
8653 | } | |
c73964b2 | 8654 | |
ceab47eb MM |
8655 | /* We can just fall through here, after setting up |
8656 | FROM_TYPE1 and FROM_TYPE2. */ | |
5bd61841 MM |
8657 | from_type1 = t1->type; |
8658 | from_type2 = t2->type; | |
c73964b2 | 8659 | } |
ceab47eb MM |
8660 | else |
8661 | { | |
5bd61841 MM |
8662 | conversion *t1; |
8663 | conversion *t2; | |
8664 | ||
c8094d83 | 8665 | /* We're dealing with two standard conversion sequences. |
c73964b2 | 8666 | |
ceab47eb | 8667 | [over.ics.rank] |
c8094d83 | 8668 | |
ceab47eb MM |
8669 | Standard conversion sequence S1 is a better conversion |
8670 | sequence than standard conversion sequence S2 if | |
c8094d83 | 8671 | |
ceab47eb MM |
8672 | --S1 is a proper subsequence of S2 (comparing the conversion |
8673 | sequences in the canonical form defined by _over.ics.scs_, | |
8674 | excluding any Lvalue Transformation; the identity | |
8675 | conversion sequence is considered to be a subsequence of | |
8676 | any non-identity conversion sequence */ | |
c8094d83 | 8677 | |
5bd61841 MM |
8678 | t1 = ics1; |
8679 | while (t1->kind != ck_identity) | |
40703fdf | 8680 | t1 = next_conversion (t1); |
5bd61841 | 8681 | from_type1 = t1->type; |
c8094d83 | 8682 | |
5bd61841 MM |
8683 | t2 = ics2; |
8684 | while (t2->kind != ck_identity) | |
40703fdf | 8685 | t2 = next_conversion (t2); |
5bd61841 | 8686 | from_type2 = t2->type; |
ceab47eb | 8687 | } |
c73964b2 | 8688 | |
b6219f42 JM |
8689 | /* One sequence can only be a subsequence of the other if they start with |
8690 | the same type. They can start with different types when comparing the | |
8691 | second standard conversion sequence in two user-defined conversion | |
8692 | sequences. */ | |
3bfdc719 | 8693 | if (same_type_p (from_type1, from_type2)) |
f62dbf03 | 8694 | { |
ceab47eb | 8695 | if (is_subseq (ics1, ics2)) |
f62dbf03 | 8696 | return 1; |
ceab47eb | 8697 | if (is_subseq (ics2, ics1)) |
f62dbf03 | 8698 | return -1; |
f62dbf03 | 8699 | } |
c73964b2 | 8700 | |
ceab47eb | 8701 | /* [over.ics.rank] |
c73964b2 | 8702 | |
ceab47eb | 8703 | Or, if not that, |
c73964b2 | 8704 | |
ceab47eb MM |
8705 | --the rank of S1 is better than the rank of S2 (by the rules |
8706 | defined below): | |
c73964b2 | 8707 | |
ceab47eb MM |
8708 | Standard conversion sequences are ordered by their ranks: an Exact |
8709 | Match is a better conversion than a Promotion, which is a better | |
8710 | conversion than a Conversion. | |
c73964b2 | 8711 | |
ceab47eb MM |
8712 | Two conversion sequences with the same rank are indistinguishable |
8713 | unless one of the following rules applies: | |
c73964b2 | 8714 | |
14c2101d JM |
8715 | --A conversion that does not a convert a pointer, pointer to member, |
8716 | or std::nullptr_t to bool is better than one that does. | |
c73964b2 | 8717 | |
ceab47eb MM |
8718 | The ICS_STD_RANK automatically handles the pointer-to-bool rule, |
8719 | so that we do not have to check it explicitly. */ | |
5bd61841 | 8720 | if (ics1->rank < ics2->rank) |
ceab47eb | 8721 | return 1; |
5bd61841 | 8722 | else if (ics2->rank < ics1->rank) |
ceab47eb | 8723 | return -1; |
c73964b2 | 8724 | |
5bd61841 MM |
8725 | to_type1 = ics1->type; |
8726 | to_type2 = ics2->type; | |
c73964b2 | 8727 | |
b6219f42 JM |
8728 | /* A conversion from scalar arithmetic type to complex is worse than a |
8729 | conversion between scalar arithmetic types. */ | |
8730 | if (same_type_p (from_type1, from_type2) | |
8731 | && ARITHMETIC_TYPE_P (from_type1) | |
8732 | && ARITHMETIC_TYPE_P (to_type1) | |
8733 | && ARITHMETIC_TYPE_P (to_type2) | |
8734 | && ((TREE_CODE (to_type1) == COMPLEX_TYPE) | |
8735 | != (TREE_CODE (to_type2) == COMPLEX_TYPE))) | |
8736 | { | |
8737 | if (TREE_CODE (to_type1) == COMPLEX_TYPE) | |
8738 | return -1; | |
8739 | else | |
8740 | return 1; | |
8741 | } | |
8742 | ||
ceab47eb MM |
8743 | if (TYPE_PTR_P (from_type1) |
8744 | && TYPE_PTR_P (from_type2) | |
8745 | && TYPE_PTR_P (to_type1) | |
8746 | && TYPE_PTR_P (to_type2)) | |
8747 | { | |
8748 | deref_from_type1 = TREE_TYPE (from_type1); | |
8749 | deref_from_type2 = TREE_TYPE (from_type2); | |
8750 | deref_to_type1 = TREE_TYPE (to_type1); | |
8751 | deref_to_type2 = TREE_TYPE (to_type2); | |
8752 | } | |
8753 | /* The rules for pointers to members A::* are just like the rules | |
8754 | for pointers A*, except opposite: if B is derived from A then | |
8755 | A::* converts to B::*, not vice versa. For that reason, we | |
8756 | switch the from_ and to_ variables here. */ | |
66b1156a PC |
8757 | else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2) |
8758 | && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2)) | |
a5ac359a MM |
8759 | || (TYPE_PTRMEMFUNC_P (from_type1) |
8760 | && TYPE_PTRMEMFUNC_P (from_type2) | |
8761 | && TYPE_PTRMEMFUNC_P (to_type1) | |
8762 | && TYPE_PTRMEMFUNC_P (to_type2))) | |
8763 | { | |
8764 | deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1); | |
8765 | deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2); | |
8766 | deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1); | |
8767 | deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2); | |
ceab47eb | 8768 | } |
c73964b2 | 8769 | |
ceab47eb | 8770 | if (deref_from_type1 != NULL_TREE |
9e1e64ec PC |
8771 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1)) |
8772 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2))) | |
ceab47eb | 8773 | { |
c8094d83 | 8774 | /* This was one of the pointer or pointer-like conversions. |
ceab47eb MM |
8775 | |
8776 | [over.ics.rank] | |
c8094d83 | 8777 | |
ceab47eb MM |
8778 | --If class B is derived directly or indirectly from class A, |
8779 | conversion of B* to A* is better than conversion of B* to | |
8780 | void*, and conversion of A* to void* is better than | |
8781 | conversion of B* to void*. */ | |
50e10fa8 PC |
8782 | if (VOID_TYPE_P (deref_to_type1) |
8783 | && VOID_TYPE_P (deref_to_type2)) | |
c73964b2 | 8784 | { |
ceab47eb MM |
8785 | if (is_properly_derived_from (deref_from_type1, |
8786 | deref_from_type2)) | |
c73964b2 | 8787 | return -1; |
ceab47eb MM |
8788 | else if (is_properly_derived_from (deref_from_type2, |
8789 | deref_from_type1)) | |
8790 | return 1; | |
c73964b2 | 8791 | } |
50e10fa8 PC |
8792 | else if (VOID_TYPE_P (deref_to_type1) |
8793 | || VOID_TYPE_P (deref_to_type2)) | |
c73964b2 | 8794 | { |
3bfdc719 | 8795 | if (same_type_p (deref_from_type1, deref_from_type2)) |
ceab47eb | 8796 | { |
50e10fa8 | 8797 | if (VOID_TYPE_P (deref_to_type2)) |
ceab47eb MM |
8798 | { |
8799 | if (is_properly_derived_from (deref_from_type1, | |
8800 | deref_to_type1)) | |
8801 | return 1; | |
8802 | } | |
8803 | /* We know that DEREF_TO_TYPE1 is `void' here. */ | |
8804 | else if (is_properly_derived_from (deref_from_type1, | |
8805 | deref_to_type2)) | |
8806 | return -1; | |
8807 | } | |
c73964b2 | 8808 | } |
9e1e64ec PC |
8809 | else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1)) |
8810 | && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2))) | |
c73964b2 | 8811 | { |
ceab47eb MM |
8812 | /* [over.ics.rank] |
8813 | ||
8814 | --If class B is derived directly or indirectly from class A | |
8815 | and class C is derived directly or indirectly from B, | |
c8094d83 | 8816 | |
ceab47eb | 8817 | --conversion of C* to B* is better than conversion of C* to |
c8094d83 MS |
8818 | A*, |
8819 | ||
ceab47eb MM |
8820 | --conversion of B* to A* is better than conversion of C* to |
8821 | A* */ | |
3bfdc719 | 8822 | if (same_type_p (deref_from_type1, deref_from_type2)) |
ceab47eb MM |
8823 | { |
8824 | if (is_properly_derived_from (deref_to_type1, | |
8825 | deref_to_type2)) | |
8826 | return 1; | |
8827 | else if (is_properly_derived_from (deref_to_type2, | |
8828 | deref_to_type1)) | |
8829 | return -1; | |
8830 | } | |
3bfdc719 | 8831 | else if (same_type_p (deref_to_type1, deref_to_type2)) |
ceab47eb MM |
8832 | { |
8833 | if (is_properly_derived_from (deref_from_type2, | |
8834 | deref_from_type1)) | |
8835 | return 1; | |
8836 | else if (is_properly_derived_from (deref_from_type1, | |
8837 | deref_from_type2)) | |
8838 | return -1; | |
8839 | } | |
c73964b2 | 8840 | } |
ceab47eb | 8841 | } |
2d2e8123 | 8842 | else if (CLASS_TYPE_P (non_reference (from_type1)) |
3bfdc719 | 8843 | && same_type_p (from_type1, from_type2)) |
ceab47eb | 8844 | { |
2d2e8123 MM |
8845 | tree from = non_reference (from_type1); |
8846 | ||
ceab47eb | 8847 | /* [over.ics.rank] |
c8094d83 | 8848 | |
ceab47eb MM |
8849 | --binding of an expression of type C to a reference of type |
8850 | B& is better than binding an expression of type C to a | |
8851 | reference of type A& | |
8852 | ||
8853 | --conversion of C to B is better than conversion of C to A, */ | |
2d2e8123 MM |
8854 | if (is_properly_derived_from (from, to_type1) |
8855 | && is_properly_derived_from (from, to_type2)) | |
c73964b2 | 8856 | { |
ceab47eb | 8857 | if (is_properly_derived_from (to_type1, to_type2)) |
c73964b2 | 8858 | return 1; |
ceab47eb | 8859 | else if (is_properly_derived_from (to_type2, to_type1)) |
c73964b2 MS |
8860 | return -1; |
8861 | } | |
8862 | } | |
2d2e8123 | 8863 | else if (CLASS_TYPE_P (non_reference (to_type1)) |
3bfdc719 | 8864 | && same_type_p (to_type1, to_type2)) |
c73964b2 | 8865 | { |
2d2e8123 MM |
8866 | tree to = non_reference (to_type1); |
8867 | ||
ceab47eb | 8868 | /* [over.ics.rank] |
c73964b2 | 8869 | |
ceab47eb MM |
8870 | --binding of an expression of type B to a reference of type |
8871 | A& is better than binding an expression of type C to a | |
c8094d83 | 8872 | reference of type A&, |
ceab47eb | 8873 | |
77077b39 | 8874 | --conversion of B to A is better than conversion of C to A */ |
2d2e8123 MM |
8875 | if (is_properly_derived_from (from_type1, to) |
8876 | && is_properly_derived_from (from_type2, to)) | |
ceab47eb MM |
8877 | { |
8878 | if (is_properly_derived_from (from_type2, from_type1)) | |
8879 | return 1; | |
8880 | else if (is_properly_derived_from (from_type1, from_type2)) | |
8881 | return -1; | |
8882 | } | |
c73964b2 MS |
8883 | } |
8884 | ||
ceab47eb MM |
8885 | /* [over.ics.rank] |
8886 | ||
8887 | --S1 and S2 differ only in their qualification conversion and yield | |
8888 | similar types T1 and T2 (_conv.qual_), respectively, and the cv- | |
8889 | qualification signature of type T1 is a proper subset of the cv- | |
8890 | qualification signature of type T2 */ | |
5bd61841 MM |
8891 | if (ics1->kind == ck_qual |
8892 | && ics2->kind == ck_qual | |
3bfdc719 | 8893 | && same_type_p (from_type1, from_type2)) |
86089be5 DG |
8894 | { |
8895 | int result = comp_cv_qual_signature (to_type1, to_type2); | |
8896 | if (result != 0) | |
8897 | return result; | |
8898 | } | |
ceab47eb MM |
8899 | |
8900 | /* [over.ics.rank] | |
c8094d83 | 8901 | |
8af2fec4 | 8902 | --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers |
caa40bc0 JM |
8903 | to an implicit object parameter of a non-static member function |
8904 | declared without a ref-qualifier, and either S1 binds an lvalue | |
8905 | reference to an lvalue and S2 binds an rvalue reference or S1 binds an | |
8906 | rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x | |
8907 | draft standard, 13.3.3.2) | |
8af2fec4 | 8908 | |
ceab47eb MM |
8909 | --S1 and S2 are reference bindings (_dcl.init.ref_), and the |
8910 | types to which the references refer are the same type except for | |
8911 | top-level cv-qualifiers, and the type to which the reference | |
8912 | initialized by S2 refers is more cv-qualified than the type to | |
6cb1ef51 JM |
8913 | which the reference initialized by S1 refers. |
8914 | ||
8915 | DR 1328 [over.match.best]: the context is an initialization by | |
8916 | conversion function for direct reference binding (13.3.1.6) of a | |
8917 | reference to function type, the return type of F1 is the same kind of | |
8918 | reference (i.e. lvalue or rvalue) as the reference being initialized, | |
8919 | and the return type of F2 is not. */ | |
c8094d83 | 8920 | |
0ee3f0a8 | 8921 | if (ref_conv1 && ref_conv2) |
8af2fec4 | 8922 | { |
6cb1ef51 JM |
8923 | if (!ref_conv1->this_p && !ref_conv2->this_p |
8924 | && (ref_conv1->rvaluedness_matches_p | |
8925 | != ref_conv2->rvaluedness_matches_p) | |
8926 | && (same_type_p (ref_conv1->type, ref_conv2->type) | |
8927 | || (TYPE_REF_IS_RVALUE (ref_conv1->type) | |
8928 | != TYPE_REF_IS_RVALUE (ref_conv2->type)))) | |
0ee3f0a8 | 8929 | { |
d02f620d JM |
8930 | if (ref_conv1->bad_p |
8931 | && !same_type_p (TREE_TYPE (ref_conv1->type), | |
8932 | TREE_TYPE (ref_conv2->type))) | |
8933 | /* Don't prefer a bad conversion that drops cv-quals to a bad | |
8934 | conversion with the wrong rvalueness. */ | |
8935 | return 0; | |
6cb1ef51 JM |
8936 | return (ref_conv1->rvaluedness_matches_p |
8937 | - ref_conv2->rvaluedness_matches_p); | |
0ee3f0a8 | 8938 | } |
8af2fec4 | 8939 | |
0ee3f0a8 | 8940 | if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2)) |
d02f620d JM |
8941 | { |
8942 | int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type)); | |
8943 | int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type)); | |
8944 | if (ref_conv1->bad_p) | |
8945 | { | |
8946 | /* Prefer the one that drops fewer cv-quals. */ | |
8947 | tree ftype = next_conversion (ref_conv1)->type; | |
8948 | int fquals = cp_type_quals (ftype); | |
8949 | q1 ^= fquals; | |
8950 | q2 ^= fquals; | |
8951 | } | |
8952 | return comp_cv_qualification (q2, q1); | |
8953 | } | |
8af2fec4 | 8954 | } |
ceab47eb MM |
8955 | |
8956 | /* Neither conversion sequence is better than the other. */ | |
c73964b2 MS |
8957 | return 0; |
8958 | } | |
8959 | ||
03e70705 JM |
8960 | /* The source type for this standard conversion sequence. */ |
8961 | ||
8e69329a | 8962 | static tree |
5bd61841 | 8963 | source_type (conversion *t) |
8e69329a | 8964 | { |
40703fdf | 8965 | for (;; t = next_conversion (t)) |
8e69329a | 8966 | { |
5bd61841 MM |
8967 | if (t->kind == ck_user |
8968 | || t->kind == ck_ambig | |
8969 | || t->kind == ck_identity) | |
8970 | return t->type; | |
8e69329a | 8971 | } |
8dc2b103 | 8972 | gcc_unreachable (); |
8e69329a | 8973 | } |
5ffe581d JM |
8974 | |
8975 | /* Note a warning about preferring WINNER to LOSER. We do this by storing | |
8976 | a pointer to LOSER and re-running joust to produce the warning if WINNER | |
8977 | is actually used. */ | |
8978 | ||
8979 | static void | |
94be8403 | 8980 | add_warning (struct z_candidate *winner, struct z_candidate *loser) |
5ffe581d | 8981 | { |
67f5655f GDR |
8982 | candidate_warning *cw = (candidate_warning *) |
8983 | conversion_obstack_alloc (sizeof (candidate_warning)); | |
5bd61841 MM |
8984 | cw->loser = loser; |
8985 | cw->next = winner->warnings; | |
8986 | winner->warnings = cw; | |
5ffe581d | 8987 | } |
8e69329a | 8988 | |
c73964b2 MS |
8989 | /* Compare two candidates for overloading as described in |
8990 | [over.match.best]. Return values: | |
8991 | ||
8992 | 1: cand1 is better than cand2 | |
8993 | -1: cand2 is better than cand1 | |
8994 | 0: cand1 and cand2 are indistinguishable */ | |
8995 | ||
8996 | static int | |
b40e334f PC |
8997 | joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn, |
8998 | tsubst_flags_t complain) | |
c73964b2 MS |
8999 | { |
9000 | int winner = 0; | |
5bd61841 MM |
9001 | int off1 = 0, off2 = 0; |
9002 | size_t i; | |
9003 | size_t len; | |
c73964b2 | 9004 | |
d11ad92e MS |
9005 | /* Candidates that involve bad conversions are always worse than those |
9006 | that don't. */ | |
9007 | if (cand1->viable > cand2->viable) | |
9008 | return 1; | |
9009 | if (cand1->viable < cand2->viable) | |
9010 | return -1; | |
9011 | ||
37b6eb34 | 9012 | /* If we have two pseudo-candidates for conversions to the same type, |
6e9dcc25 JM |
9013 | or two candidates for the same function, arbitrarily pick one. */ |
9014 | if (cand1->fn == cand2->fn | |
6615c446 | 9015 | && (IS_TYPE_OR_DECL_P (cand1->fn))) |
37b6eb34 JM |
9016 | return 1; |
9017 | ||
f14edc1a JM |
9018 | /* Prefer a non-deleted function over an implicitly deleted move |
9019 | constructor or assignment operator. This differs slightly from the | |
9020 | wording for issue 1402 (which says the move op is ignored by overload | |
9021 | resolution), but this way produces better error messages. */ | |
9022 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
9023 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
9024 | && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn)) | |
9025 | { | |
9026 | if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn) | |
9027 | && move_fn_p (cand1->fn)) | |
9028 | return -1; | |
9029 | if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn) | |
9030 | && move_fn_p (cand2->fn)) | |
9031 | return 1; | |
9032 | } | |
9033 | ||
c73964b2 MS |
9034 | /* a viable function F1 |
9035 | is defined to be a better function than another viable function F2 if | |
9036 | for all arguments i, ICSi(F1) is not a worse conversion sequence than | |
9037 | ICSi(F2), and then */ | |
9038 | ||
9039 | /* for some argument j, ICSj(F1) is a better conversion sequence than | |
9040 | ICSj(F2) */ | |
9041 | ||
cab1f180 ML |
9042 | /* For comparing static and non-static member functions, we ignore |
9043 | the implicit object parameter of the non-static function. The | |
9044 | standard says to pretend that the static function has an object | |
9045 | parm, but that won't work with operator overloading. */ | |
5bd61841 MM |
9046 | len = cand1->num_convs; |
9047 | if (len != cand2->num_convs) | |
c73964b2 | 9048 | { |
8dc2b103 NS |
9049 | int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn); |
9050 | int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn); | |
9051 | ||
7aca561c JM |
9052 | if (DECL_CONSTRUCTOR_P (cand1->fn) |
9053 | && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn)) | |
9054 | /* We're comparing a near-match list constructor and a near-match | |
9055 | non-list constructor. Just treat them as unordered. */ | |
9056 | return 0; | |
9057 | ||
8dc2b103 | 9058 | gcc_assert (static_1 != static_2); |
c8094d83 | 9059 | |
8dc2b103 | 9060 | if (static_1) |
c73964b2 | 9061 | off2 = 1; |
8dc2b103 | 9062 | else |
c73964b2 MS |
9063 | { |
9064 | off1 = 1; | |
9065 | --len; | |
9066 | } | |
c73964b2 MS |
9067 | } |
9068 | ||
9069 | for (i = 0; i < len; ++i) | |
9070 | { | |
5bd61841 MM |
9071 | conversion *t1 = cand1->convs[i + off1]; |
9072 | conversion *t2 = cand2->convs[i + off2]; | |
da20811c | 9073 | int comp = compare_ics (t1, t2); |
c73964b2 MS |
9074 | |
9075 | if (comp != 0) | |
9076 | { | |
b40e334f PC |
9077 | if ((complain & tf_warning) |
9078 | && warn_sign_promo | |
5bd61841 MM |
9079 | && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2) |
9080 | == cr_std + cr_promotion) | |
9081 | && t1->kind == ck_std | |
9082 | && t2->kind == ck_std | |
9083 | && TREE_CODE (t1->type) == INTEGER_TYPE | |
9084 | && TREE_CODE (t2->type) == INTEGER_TYPE | |
9085 | && (TYPE_PRECISION (t1->type) | |
9086 | == TYPE_PRECISION (t2->type)) | |
40703fdf DS |
9087 | && (TYPE_UNSIGNED (next_conversion (t1)->type) |
9088 | || (TREE_CODE (next_conversion (t1)->type) | |
da20811c JM |
9089 | == ENUMERAL_TYPE))) |
9090 | { | |
40703fdf | 9091 | tree type = next_conversion (t1)->type; |
da20811c | 9092 | tree type1, type2; |
5ffe581d | 9093 | struct z_candidate *w, *l; |
da20811c | 9094 | if (comp > 0) |
5bd61841 | 9095 | type1 = t1->type, type2 = t2->type, |
5ffe581d | 9096 | w = cand1, l = cand2; |
da20811c | 9097 | else |
5bd61841 | 9098 | type1 = t2->type, type2 = t1->type, |
5ffe581d | 9099 | w = cand2, l = cand1; |
da20811c | 9100 | |
5ffe581d JM |
9101 | if (warn) |
9102 | { | |
74fa0285 | 9103 | warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT", |
3db45ab5 | 9104 | type, type1, type2); |
74fa0285 | 9105 | warning (OPT_Wsign_promo, " in call to %qD", w->fn); |
5ffe581d JM |
9106 | } |
9107 | else | |
9108 | add_warning (w, l); | |
da20811c JM |
9109 | } |
9110 | ||
c73964b2 | 9111 | if (winner && comp != winner) |
c11b6f21 MS |
9112 | { |
9113 | winner = 0; | |
9114 | goto tweak; | |
9115 | } | |
c73964b2 MS |
9116 | winner = comp; |
9117 | } | |
9118 | } | |
9119 | ||
9a68c51f JM |
9120 | /* warn about confusing overload resolution for user-defined conversions, |
9121 | either between a constructor and a conversion op, or between two | |
9122 | conversion ops. */ | |
b40e334f PC |
9123 | if ((complain & tf_warning) |
9124 | && winner && warn_conversion && cand1->second_conv | |
f8986275 NS |
9125 | && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn)) |
9126 | && winner != compare_ics (cand1->second_conv, cand2->second_conv)) | |
9127 | { | |
9128 | struct z_candidate *w, *l; | |
9129 | bool give_warning = false; | |
c8094d83 | 9130 | |
f8986275 NS |
9131 | if (winner == 1) |
9132 | w = cand1, l = cand2; | |
9133 | else | |
9134 | w = cand2, l = cand1; | |
c8094d83 | 9135 | |
f8986275 NS |
9136 | /* We don't want to complain about `X::operator T1 ()' |
9137 | beating `X::operator T2 () const', when T2 is a no less | |
9bcb9aae | 9138 | cv-qualified version of T1. */ |
f8986275 NS |
9139 | if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn) |
9140 | && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn)) | |
8e69329a | 9141 | { |
f8986275 NS |
9142 | tree t = TREE_TYPE (TREE_TYPE (l->fn)); |
9143 | tree f = TREE_TYPE (TREE_TYPE (w->fn)); | |
c8094d83 | 9144 | |
f8986275 | 9145 | if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t)) |
5ffe581d | 9146 | { |
f8986275 NS |
9147 | t = TREE_TYPE (t); |
9148 | f = TREE_TYPE (f); | |
5ffe581d | 9149 | } |
f8986275 NS |
9150 | if (!comp_ptr_ttypes (t, f)) |
9151 | give_warning = true; | |
9152 | } | |
9153 | else | |
9154 | give_warning = true; | |
c8094d83 | 9155 | |
f8986275 NS |
9156 | if (!give_warning) |
9157 | /*NOP*/; | |
2e2d4075 | 9158 | else if (warn) |
f8986275 | 9159 | { |
5bd61841 | 9160 | tree source = source_type (w->convs[0]); |
f8986275 NS |
9161 | if (! DECL_CONSTRUCTOR_P (w->fn)) |
9162 | source = TREE_TYPE (source); | |
71205d17 MLI |
9163 | if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn) |
9164 | && warning (OPT_Wconversion, " for conversion from %qT to %qT", | |
9165 | source, w->second_conv->type)) | |
9166 | { | |
1f5b3869 | 9167 | inform (input_location, " because conversion sequence for the argument is better"); |
71205d17 | 9168 | } |
8e69329a | 9169 | } |
f8986275 NS |
9170 | else |
9171 | add_warning (w, l); | |
8e69329a JM |
9172 | } |
9173 | ||
c73964b2 MS |
9174 | if (winner) |
9175 | return winner; | |
9176 | ||
49fe93f4 JM |
9177 | /* DR 495 moved this tiebreaker above the template ones. */ |
9178 | /* or, if not that, | |
9179 | the context is an initialization by user-defined conversion (see | |
9180 | _dcl.init_ and _over.match.user_) and the standard conversion | |
9181 | sequence from the return type of F1 to the destination type (i.e., | |
9182 | the type of the entity being initialized) is a better conversion | |
9183 | sequence than the standard conversion sequence from the return type | |
9184 | of F2 to the destination type. */ | |
9185 | ||
9186 | if (cand1->second_conv) | |
9187 | { | |
9188 | winner = compare_ics (cand1->second_conv, cand2->second_conv); | |
9189 | if (winner) | |
9190 | return winner; | |
9191 | } | |
9192 | ||
e5596aef NS |
9193 | /* or, if not that, |
9194 | F1 is a non-template function and F2 is a template function | |
9195 | specialization. */ | |
c8094d83 | 9196 | |
ea0ad329 | 9197 | if (!cand1->template_decl && cand2->template_decl) |
c73964b2 | 9198 | return 1; |
ea0ad329 | 9199 | else if (cand1->template_decl && !cand2->template_decl) |
c73964b2 | 9200 | return -1; |
c8094d83 | 9201 | |
e5596aef NS |
9202 | /* or, if not that, |
9203 | F1 and F2 are template functions and the function template for F1 is | |
9204 | more specialized than the template for F2 according to the partial | |
9205 | ordering rules. */ | |
c8094d83 | 9206 | |
ea0ad329 | 9207 | if (cand1->template_decl && cand2->template_decl) |
4cff6abe | 9208 | { |
dda04398 | 9209 | winner = more_specialized_fn |
0cbd7506 MS |
9210 | (TI_TEMPLATE (cand1->template_decl), |
9211 | TI_TEMPLATE (cand2->template_decl), | |
48884537 | 9212 | /* [temp.func.order]: The presence of unused ellipsis and default |
d9579a59 | 9213 | arguments has no effect on the partial ordering of function |
48884537 NS |
9214 | templates. add_function_candidate() will not have |
9215 | counted the "this" argument for constructors. */ | |
9216 | cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn)); | |
4cff6abe | 9217 | if (winner) |
0cbd7506 | 9218 | return winner; |
4cff6abe | 9219 | } |
c73964b2 | 9220 | |
a2dfb563 JM |
9221 | // C++ Concepts |
9222 | // or, if not that, F1 is more constrained than F2. | |
9223 | if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn)) | |
9224 | { | |
9225 | winner = more_constrained (cand1->fn, cand2->fn); | |
9226 | if (winner) | |
9227 | return winner; | |
9228 | } | |
971e17ff | 9229 | |
08ac397c JM |
9230 | /* Check whether we can discard a builtin candidate, either because we |
9231 | have two identical ones or matching builtin and non-builtin candidates. | |
9232 | ||
9233 | (Pedantically in the latter case the builtin which matched the user | |
9234 | function should not be added to the overload set, but we spot it here. | |
c8094d83 | 9235 | |
08ac397c JM |
9236 | [over.match.oper] |
9237 | ... the builtin candidates include ... | |
9238 | - do not have the same parameter type list as any non-template | |
9239 | non-member candidate. */ | |
c8094d83 | 9240 | |
9dc6f476 | 9241 | if (identifier_p (cand1->fn) || identifier_p (cand2->fn)) |
c73964b2 | 9242 | { |
c11b6f21 | 9243 | for (i = 0; i < len; ++i) |
5bd61841 MM |
9244 | if (!same_type_p (cand1->convs[i]->type, |
9245 | cand2->convs[i]->type)) | |
c73964b2 | 9246 | break; |
5bd61841 | 9247 | if (i == cand1->num_convs) |
08ac397c JM |
9248 | { |
9249 | if (cand1->fn == cand2->fn) | |
9250 | /* Two built-in candidates; arbitrarily pick one. */ | |
9251 | return 1; | |
9dc6f476 | 9252 | else if (identifier_p (cand1->fn)) |
08ac397c JM |
9253 | /* cand1 is built-in; prefer cand2. */ |
9254 | return -1; | |
9255 | else | |
9256 | /* cand2 is built-in; prefer cand1. */ | |
9257 | return 1; | |
9258 | } | |
c73964b2 MS |
9259 | } |
9260 | ||
3649b9b7 ST |
9261 | /* For candidates of a multi-versioned function, make the version with |
9262 | the highest priority win. This version will be checked for dispatching | |
9263 | first. If this version can be inlined into the caller, the front-end | |
9264 | will simply make a direct call to this function. */ | |
9265 | ||
9266 | if (TREE_CODE (cand1->fn) == FUNCTION_DECL | |
9267 | && DECL_FUNCTION_VERSIONED (cand1->fn) | |
9268 | && TREE_CODE (cand2->fn) == FUNCTION_DECL | |
9269 | && DECL_FUNCTION_VERSIONED (cand2->fn)) | |
9270 | { | |
9271 | tree f1 = TREE_TYPE (cand1->fn); | |
9272 | tree f2 = TREE_TYPE (cand2->fn); | |
9273 | tree p1 = TYPE_ARG_TYPES (f1); | |
9274 | tree p2 = TYPE_ARG_TYPES (f2); | |
9275 | ||
9276 | /* Check if cand1->fn and cand2->fn are versions of the same function. It | |
9277 | is possible that cand1->fn and cand2->fn are function versions but of | |
9278 | different functions. Check types to see if they are versions of the same | |
9279 | function. */ | |
9280 | if (compparms (p1, p2) | |
9281 | && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) | |
9282 | { | |
9283 | /* Always make the version with the higher priority, more | |
9284 | specialized, win. */ | |
9285 | gcc_assert (targetm.compare_version_priority); | |
9286 | if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0) | |
9287 | return 1; | |
9288 | else | |
9289 | return -1; | |
9290 | } | |
9291 | } | |
9292 | ||
e04c614e JM |
9293 | /* If the two function declarations represent the same function (this can |
9294 | happen with declarations in multiple scopes and arg-dependent lookup), | |
9295 | arbitrarily choose one. But first make sure the default args we're | |
9296 | using match. */ | |
2c169bab JM |
9297 | if (DECL_P (cand1->fn) && DECL_P (cand2->fn) |
9298 | && equal_functions (cand1->fn, cand2->fn)) | |
e04c614e JM |
9299 | { |
9300 | tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn)); | |
9301 | tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn)); | |
9302 | ||
9303 | gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn)); | |
9304 | ||
9305 | for (i = 0; i < len; ++i) | |
9306 | { | |
0f8a7706 JM |
9307 | /* Don't crash if the fn is variadic. */ |
9308 | if (!parms1) | |
9309 | break; | |
e04c614e JM |
9310 | parms1 = TREE_CHAIN (parms1); |
9311 | parms2 = TREE_CHAIN (parms2); | |
9312 | } | |
9313 | ||
9314 | if (off1) | |
9315 | parms1 = TREE_CHAIN (parms1); | |
9316 | else if (off2) | |
9317 | parms2 = TREE_CHAIN (parms2); | |
9318 | ||
9319 | for (; parms1; ++i) | |
9320 | { | |
9321 | if (!cp_tree_equal (TREE_PURPOSE (parms1), | |
9322 | TREE_PURPOSE (parms2))) | |
9323 | { | |
9324 | if (warn) | |
9325 | { | |
b40e334f PC |
9326 | if (complain & tf_error) |
9327 | { | |
129677c1 PC |
9328 | if (permerror (input_location, |
9329 | "default argument mismatch in " | |
9330 | "overload resolution")) | |
9331 | { | |
9332 | inform (input_location, | |
9333 | " candidate 1: %q+#F", cand1->fn); | |
9334 | inform (input_location, | |
9335 | " candidate 2: %q+#F", cand2->fn); | |
9336 | } | |
b40e334f PC |
9337 | } |
9338 | else | |
9339 | return 0; | |
e04c614e JM |
9340 | } |
9341 | else | |
9342 | add_warning (cand1, cand2); | |
9343 | break; | |
9344 | } | |
9345 | parms1 = TREE_CHAIN (parms1); | |
9346 | parms2 = TREE_CHAIN (parms2); | |
9347 | } | |
9348 | ||
9349 | return 1; | |
9350 | } | |
c8094d83 | 9351 | |
c11b6f21 MS |
9352 | tweak: |
9353 | ||
9354 | /* Extension: If the worst conversion for one candidate is worse than the | |
9355 | worst conversion for the other, take the first. */ | |
b40e334f | 9356 | if (!pedantic && (complain & tf_warning_or_error)) |
c11b6f21 | 9357 | { |
5bd61841 | 9358 | conversion_rank rank1 = cr_identity, rank2 = cr_identity; |
ae0ed63a | 9359 | struct z_candidate *w = 0, *l = 0; |
c11b6f21 MS |
9360 | |
9361 | for (i = 0; i < len; ++i) | |
9362 | { | |
5bd61841 MM |
9363 | if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1) |
9364 | rank1 = CONVERSION_RANK (cand1->convs[i+off1]); | |
9365 | if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2) | |
9366 | rank2 = CONVERSION_RANK (cand2->convs[i + off2]); | |
c11b6f21 | 9367 | } |
c11b6f21 | 9368 | if (rank1 < rank2) |
f86fdf68 | 9369 | winner = 1, w = cand1, l = cand2; |
c11b6f21 | 9370 | if (rank1 > rank2) |
f86fdf68 NS |
9371 | winner = -1, w = cand2, l = cand1; |
9372 | if (winner) | |
0cbd7506 | 9373 | { |
e14eaea4 JM |
9374 | /* Don't choose a deleted function over ambiguity. */ |
9375 | if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn)) | |
9376 | return 0; | |
f86fdf68 NS |
9377 | if (warn) |
9378 | { | |
509c9d60 | 9379 | pedwarn (input_location, 0, |
37ec60ed JW |
9380 | "ISO C++ says that these are ambiguous, even " |
9381 | "though the worst conversion for the first is better than " | |
9382 | "the worst conversion for the second:"); | |
498ad15e PC |
9383 | print_z_candidate (input_location, _("candidate 1:"), w); |
9384 | print_z_candidate (input_location, _("candidate 2:"), l); | |
f86fdf68 NS |
9385 | } |
9386 | else | |
9387 | add_warning (w, l); | |
0cbd7506 MS |
9388 | return winner; |
9389 | } | |
c11b6f21 MS |
9390 | } |
9391 | ||
50bc768d | 9392 | gcc_assert (!winner); |
4cff6abe | 9393 | return 0; |
c73964b2 MS |
9394 | } |
9395 | ||
9396 | /* Given a list of candidates for overloading, find the best one, if any. | |
9397 | This algorithm has a worst case of O(2n) (winner is last), and a best | |
9398 | case of O(n/2) (totally ambiguous); much better than a sorting | |
9399 | algorithm. */ | |
9400 | ||
9401 | static struct z_candidate * | |
b40e334f | 9402 | tourney (struct z_candidate *candidates, tsubst_flags_t complain) |
c73964b2 MS |
9403 | { |
9404 | struct z_candidate *champ = candidates, *challenger; | |
9405 | int fate; | |
b265c11a | 9406 | int champ_compared_to_predecessor = 0; |
c73964b2 MS |
9407 | |
9408 | /* Walk through the list once, comparing each current champ to the next | |
9409 | candidate, knocking out a candidate or two with each comparison. */ | |
9410 | ||
9411 | for (challenger = champ->next; challenger; ) | |
9412 | { | |
b40e334f | 9413 | fate = joust (champ, challenger, 0, complain); |
c73964b2 MS |
9414 | if (fate == 1) |
9415 | challenger = challenger->next; | |
9416 | else | |
9417 | { | |
9418 | if (fate == 0) | |
9419 | { | |
9420 | champ = challenger->next; | |
9421 | if (champ == 0) | |
6aed477a | 9422 | return NULL; |
b265c11a | 9423 | champ_compared_to_predecessor = 0; |
c73964b2 MS |
9424 | } |
9425 | else | |
b265c11a MM |
9426 | { |
9427 | champ = challenger; | |
9428 | champ_compared_to_predecessor = 1; | |
9429 | } | |
c73964b2 MS |
9430 | |
9431 | challenger = champ->next; | |
9432 | } | |
9433 | } | |
9434 | ||
9435 | /* Make sure the champ is better than all the candidates it hasn't yet | |
b265c11a | 9436 | been compared to. */ |
c73964b2 | 9437 | |
c8094d83 MS |
9438 | for (challenger = candidates; |
9439 | challenger != champ | |
b265c11a | 9440 | && !(champ_compared_to_predecessor && challenger->next == champ); |
c73964b2 MS |
9441 | challenger = challenger->next) |
9442 | { | |
b40e334f | 9443 | fate = joust (champ, challenger, 0, complain); |
c73964b2 | 9444 | if (fate != 1) |
6aed477a | 9445 | return NULL; |
c73964b2 MS |
9446 | } |
9447 | ||
9448 | return champ; | |
9449 | } | |
c11b6f21 | 9450 | |
838dfd8a | 9451 | /* Returns nonzero if things of type FROM can be converted to TO. */ |
4143af33 | 9452 | |
94be8403 | 9453 | bool |
b40e334f | 9454 | can_convert (tree to, tree from, tsubst_flags_t complain) |
53db1bc0 JM |
9455 | { |
9456 | tree arg = NULL_TREE; | |
9457 | /* implicit_conversion only considers user-defined conversions | |
9458 | if it has an expression for the call argument list. */ | |
9459 | if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to)) | |
9460 | arg = build1 (CAST_EXPR, from, NULL_TREE); | |
9461 | return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain); | |
9462 | } | |
9463 | ||
9464 | /* Returns nonzero if things of type FROM can be converted to TO with a | |
9465 | standard conversion. */ | |
9466 | ||
9467 | bool | |
9468 | can_convert_standard (tree to, tree from, tsubst_flags_t complain) | |
c11b6f21 | 9469 | { |
b40e334f | 9470 | return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain); |
c11b6f21 MS |
9471 | } |
9472 | ||
838dfd8a | 9473 | /* Returns nonzero if ARG (of type FROM) can be converted to TO. */ |
4143af33 | 9474 | |
94be8403 | 9475 | bool |
b40e334f PC |
9476 | can_convert_arg (tree to, tree from, tree arg, int flags, |
9477 | tsubst_flags_t complain) | |
c11b6f21 | 9478 | { |
5bd61841 MM |
9479 | conversion *t; |
9480 | void *p; | |
9481 | bool ok_p; | |
9482 | ||
9483 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9484 | p = conversion_obstack_alloc (0); | |
3ced2284 JM |
9485 | /* We want to discard any access checks done for this test, |
9486 | as we might not be in the appropriate access context and | |
9487 | we'll do the check again when we actually perform the | |
9488 | conversion. */ | |
9489 | push_deferring_access_checks (dk_deferred); | |
5bd61841 | 9490 | |
aa7349eb | 9491 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
b40e334f | 9492 | flags, complain); |
5bd61841 MM |
9493 | ok_p = (t && !t->bad_p); |
9494 | ||
3ced2284 JM |
9495 | /* Discard the access checks now. */ |
9496 | pop_deferring_access_checks (); | |
5bd61841 MM |
9497 | /* Free all the conversions we allocated. */ |
9498 | obstack_free (&conversion_obstack, p); | |
9499 | ||
9500 | return ok_p; | |
c11b6f21 | 9501 | } |
27b8d0cd | 9502 | |
72a08131 JM |
9503 | /* Like can_convert_arg, but allows dubious conversions as well. */ |
9504 | ||
94be8403 | 9505 | bool |
b40e334f PC |
9506 | can_convert_arg_bad (tree to, tree from, tree arg, int flags, |
9507 | tsubst_flags_t complain) | |
72a08131 | 9508 | { |
5bd61841 MM |
9509 | conversion *t; |
9510 | void *p; | |
9511 | ||
9512 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9513 | p = conversion_obstack_alloc (0); | |
9514 | /* Try to perform the conversion. */ | |
34b5375f | 9515 | t = implicit_conversion (to, from, arg, /*c_cast_p=*/false, |
b40e334f | 9516 | flags, complain); |
5bd61841 MM |
9517 | /* Free all the conversions we allocated. */ |
9518 | obstack_free (&conversion_obstack, p); | |
9519 | ||
9520 | return t != NULL; | |
72a08131 JM |
9521 | } |
9522 | ||
9523 | /* Convert EXPR to TYPE. Return the converted expression. | |
9524 | ||
9525 | Note that we allow bad conversions here because by the time we get to | |
9526 | this point we are committed to doing the conversion. If we end up | |
9527 | doing a bad conversion, convert_like will complain. */ | |
4143af33 | 9528 | |
a7a64a77 | 9529 | tree |
b40e334f PC |
9530 | perform_implicit_conversion_flags (tree type, tree expr, |
9531 | tsubst_flags_t complain, int flags) | |
a7a64a77 | 9532 | { |
5bd61841 MM |
9533 | conversion *conv; |
9534 | void *p; | |
8400e75e | 9535 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
5bd61841 | 9536 | |
a723baf1 | 9537 | if (error_operand_p (expr)) |
b5534c65 | 9538 | return error_mark_node; |
5bd61841 MM |
9539 | |
9540 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9541 | p = conversion_obstack_alloc (0); | |
9542 | ||
b5534c65 | 9543 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
34b5375f | 9544 | /*c_cast_p=*/false, |
b40e334f | 9545 | flags, complain); |
e57d93c6 | 9546 | |
72a08131 | 9547 | if (!conv) |
a7a64a77 | 9548 | { |
5ade1ed2 | 9549 | if (complain & tf_error) |
e57d93c6 JM |
9550 | { |
9551 | /* If expr has unknown type, then it is an overloaded function. | |
9552 | Call instantiate_type to get good error messages. */ | |
9553 | if (TREE_TYPE (expr) == unknown_type_node) | |
9554 | instantiate_type (type, expr, complain); | |
d3ea4c06 | 9555 | else if (invalid_nonstatic_memfn_p (loc, expr, complain)) |
e57d93c6 JM |
9556 | /* We gave an error. */; |
9557 | else | |
5a3c9cf2 PC |
9558 | error_at (loc, "could not convert %qE from %qT to %qT", expr, |
9559 | TREE_TYPE (expr), type); | |
e57d93c6 | 9560 | } |
5bd61841 | 9561 | expr = error_mark_node; |
a7a64a77 | 9562 | } |
d179d179 | 9563 | else if (processing_template_decl && conv->kind != ck_identity) |
07471dfb MM |
9564 | { |
9565 | /* In a template, we are only concerned about determining the | |
9566 | type of non-dependent expressions, so we do not have to | |
a4474a38 JM |
9567 | perform the actual conversion. But for initializers, we |
9568 | need to be able to perform it at instantiation | |
234bef96 | 9569 | (or instantiate_non_dependent_expr) time. */ |
a4474a38 JM |
9570 | expr = build1 (IMPLICIT_CONV_EXPR, type, expr); |
9571 | if (!(flags & LOOKUP_ONLYCONVERTING)) | |
9572 | IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true; | |
07471dfb | 9573 | } |
5bd61841 | 9574 | else |
5ade1ed2 | 9575 | expr = convert_like (conv, expr, complain); |
5bd61841 MM |
9576 | |
9577 | /* Free all the conversions we allocated. */ | |
9578 | obstack_free (&conversion_obstack, p); | |
a7a64a77 | 9579 | |
5bd61841 | 9580 | return expr; |
a7a64a77 MM |
9581 | } |
9582 | ||
e57d93c6 JM |
9583 | tree |
9584 | perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain) | |
9585 | { | |
b40e334f PC |
9586 | return perform_implicit_conversion_flags (type, expr, complain, |
9587 | LOOKUP_IMPLICIT); | |
e57d93c6 JM |
9588 | } |
9589 | ||
3fe18f1d MM |
9590 | /* Convert EXPR to TYPE (as a direct-initialization) if that is |
9591 | permitted. If the conversion is valid, the converted expression is | |
ceeae2d1 | 9592 | returned. Otherwise, NULL_TREE is returned, except in the case |
33c25e5c | 9593 | that TYPE is a class type; in that case, an error is issued. If |
2061820e | 9594 | C_CAST_P is true, then this direct-initialization is taking |
33c25e5c MM |
9595 | place as part of a static_cast being attempted as part of a C-style |
9596 | cast. */ | |
3fe18f1d MM |
9597 | |
9598 | tree | |
c8094d83 | 9599 | perform_direct_initialization_if_possible (tree type, |
33c25e5c | 9600 | tree expr, |
5ade1ed2 DG |
9601 | bool c_cast_p, |
9602 | tsubst_flags_t complain) | |
3fe18f1d | 9603 | { |
5bd61841 MM |
9604 | conversion *conv; |
9605 | void *p; | |
9606 | ||
3fe18f1d MM |
9607 | if (type == error_mark_node || error_operand_p (expr)) |
9608 | return error_mark_node; | |
ceeae2d1 MM |
9609 | /* [dcl.init] |
9610 | ||
9611 | If the destination type is a (possibly cv-qualified) class type: | |
9612 | ||
9613 | -- If the initialization is direct-initialization ..., | |
9614 | constructors are considered. ... If no constructor applies, or | |
9615 | the overload resolution is ambiguous, the initialization is | |
9616 | ill-formed. */ | |
9617 | if (CLASS_TYPE_P (type)) | |
385bce06 | 9618 | { |
9771b263 | 9619 | vec<tree, va_gc> *args = make_tree_vector_single (expr); |
385bce06 | 9620 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, |
c166b898 ILT |
9621 | &args, type, LOOKUP_NORMAL, complain); |
9622 | release_tree_vector (args); | |
362115a9 | 9623 | return build_cplus_new (type, expr, complain); |
385bce06 | 9624 | } |
5bd61841 MM |
9625 | |
9626 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ | |
9627 | p = conversion_obstack_alloc (0); | |
9628 | ||
3fe18f1d | 9629 | conv = implicit_conversion (type, TREE_TYPE (expr), expr, |
34b5375f | 9630 | c_cast_p, |
b40e334f | 9631 | LOOKUP_NORMAL, complain); |
5bd61841 MM |
9632 | if (!conv || conv->bad_p) |
9633 | expr = NULL_TREE; | |
9634 | else | |
c8094d83 | 9635 | expr = convert_like_real (conv, expr, NULL_TREE, 0, 0, |
33c25e5c | 9636 | /*issue_conversion_warnings=*/false, |
5ade1ed2 | 9637 | c_cast_p, |
798ec807 | 9638 | complain); |
5bd61841 MM |
9639 | |
9640 | /* Free all the conversions we allocated. */ | |
9641 | obstack_free (&conversion_obstack, p); | |
9642 | ||
9643 | return expr; | |
3fe18f1d MM |
9644 | } |
9645 | ||
b25dd954 JM |
9646 | /* When initializing a reference that lasts longer than a full-expression, |
9647 | this special rule applies: | |
9648 | ||
9649 | [class.temporary] | |
9650 | ||
9651 | The temporary to which the reference is bound or the temporary | |
9652 | that is the complete object to which the reference is bound | |
9653 | persists for the lifetime of the reference. | |
9654 | ||
9655 | The temporaries created during the evaluation of the expression | |
9656 | initializing the reference, except the temporary to which the | |
9657 | reference is bound, are destroyed at the end of the | |
9658 | full-expression in which they are created. | |
9659 | ||
9660 | In that case, we store the converted expression into a new | |
9661 | VAR_DECL in a new scope. | |
9662 | ||
9663 | However, we want to be careful not to create temporaries when | |
9664 | they are not required. For example, given: | |
9665 | ||
9666 | struct B {}; | |
9667 | struct D : public B {}; | |
9668 | D f(); | |
9669 | const B& b = f(); | |
9670 | ||
9671 | there is no need to copy the return value from "f"; we can just | |
9672 | extend its lifetime. Similarly, given: | |
9673 | ||
9674 | struct S {}; | |
9675 | struct T { operator S(); }; | |
9676 | T t; | |
9677 | const S& s = t; | |
9678 | ||
9679 | we can extend the lifetime of the return value of the conversion | |
9680 | operator. | |
9681 | ||
9682 | The next several functions are involved in this lifetime extension. */ | |
9683 | ||
b1db7f91 JM |
9684 | /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The |
9685 | reference is being bound to a temporary. Create and return a new | |
9686 | VAR_DECL with the indicated TYPE; this variable will store the value to | |
aa6e8ed3 | 9687 | which the reference is bound. */ |
7993382e | 9688 | |
c8094d83 | 9689 | tree |
aa6e8ed3 | 9690 | make_temporary_var_for_ref_to_temp (tree decl, tree type) |
7993382e | 9691 | { |
7993382e MM |
9692 | tree var; |
9693 | ||
7993382e | 9694 | /* Create the variable. */ |
3b2db49f | 9695 | var = create_temporary_var (type); |
7993382e MM |
9696 | |
9697 | /* Register the variable. */ | |
5a6ccc94 | 9698 | if (VAR_P (decl) |
3048c0c7 | 9699 | && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl))) |
7993382e MM |
9700 | { |
9701 | /* Namespace-scope or local static; give it a mangled name. */ | |
b25dd954 | 9702 | /* FIXME share comdat with decl? */ |
7993382e MM |
9703 | tree name; |
9704 | ||
b1db7f91 | 9705 | TREE_STATIC (var) = TREE_STATIC (decl); |
3048c0c7 | 9706 | CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl); |
56363ffd | 9707 | set_decl_tls_model (var, DECL_TLS_MODEL (decl)); |
7993382e MM |
9708 | name = mangle_ref_init_variable (decl); |
9709 | DECL_NAME (var) = name; | |
9710 | SET_DECL_ASSEMBLER_NAME (var, name); | |
9711 | var = pushdecl_top_level (var); | |
9712 | } | |
9713 | else | |
3b2db49f MM |
9714 | /* Create a new cleanup level if necessary. */ |
9715 | maybe_push_cleanup_level (type); | |
7993382e MM |
9716 | |
9717 | return var; | |
9718 | } | |
9719 | ||
09357846 JM |
9720 | /* EXPR is the initializer for a variable DECL of reference or |
9721 | std::initializer_list type. Create, push and return a new VAR_DECL | |
9722 | for the initializer so that it will live as long as DECL. Any | |
9723 | cleanup for the new variable is returned through CLEANUP, and the | |
9724 | code to initialize the new variable is returned through INITP. */ | |
9725 | ||
b25dd954 | 9726 | static tree |
9771b263 | 9727 | set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups, |
b25dd954 | 9728 | tree *initp) |
09357846 JM |
9729 | { |
9730 | tree init; | |
9731 | tree type; | |
9732 | tree var; | |
9733 | ||
9734 | /* Create the temporary variable. */ | |
9735 | type = TREE_TYPE (expr); | |
9736 | var = make_temporary_var_for_ref_to_temp (decl, type); | |
9737 | layout_decl (var, 0); | |
9738 | /* If the rvalue is the result of a function call it will be | |
9739 | a TARGET_EXPR. If it is some other construct (such as a | |
9740 | member access expression where the underlying object is | |
9741 | itself the result of a function call), turn it into a | |
9742 | TARGET_EXPR here. It is important that EXPR be a | |
9743 | TARGET_EXPR below since otherwise the INIT_EXPR will | |
9744 | attempt to make a bitwise copy of EXPR to initialize | |
9745 | VAR. */ | |
9746 | if (TREE_CODE (expr) != TARGET_EXPR) | |
9747 | expr = get_target_expr (expr); | |
fa2200cb | 9748 | |
2c6f7927 JM |
9749 | if (TREE_CODE (decl) == FIELD_DECL |
9750 | && extra_warnings && !TREE_NO_WARNING (decl)) | |
9751 | { | |
9752 | warning (OPT_Wextra, "a temporary bound to %qD only persists " | |
9753 | "until the constructor exits", decl); | |
9754 | TREE_NO_WARNING (decl) = true; | |
9755 | } | |
9756 | ||
b25dd954 JM |
9757 | /* Recursively extend temps in this initializer. */ |
9758 | TARGET_EXPR_INITIAL (expr) | |
9759 | = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups); | |
9760 | ||
7a7fc980 JM |
9761 | /* Any reference temp has a non-trivial initializer. */ |
9762 | DECL_NONTRIVIALLY_INITIALIZED_P (var) = true; | |
9763 | ||
fa2200cb JM |
9764 | /* If the initializer is constant, put it in DECL_INITIAL so we get |
9765 | static initialization and use in constant expressions. */ | |
9766 | init = maybe_constant_init (expr); | |
9767 | if (TREE_CONSTANT (init)) | |
9768 | { | |
9769 | if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type)) | |
9770 | { | |
9771 | /* 5.19 says that a constant expression can include an | |
9772 | lvalue-rvalue conversion applied to "a glvalue of literal type | |
9773 | that refers to a non-volatile temporary object initialized | |
9774 | with a constant expression". Rather than try to communicate | |
9775 | that this VAR_DECL is a temporary, just mark it constexpr. | |
9776 | ||
9777 | Currently this is only useful for initializer_list temporaries, | |
9778 | since reference vars can't appear in constant expressions. */ | |
9779 | DECL_DECLARED_CONSTEXPR_P (var) = true; | |
9931a2bf | 9780 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true; |
fa2200cb JM |
9781 | TREE_CONSTANT (var) = true; |
9782 | } | |
9783 | DECL_INITIAL (var) = init; | |
9784 | init = NULL_TREE; | |
9785 | } | |
9786 | else | |
9787 | /* Create the INIT_EXPR that will initialize the temporary | |
9788 | variable. */ | |
89631a43 | 9789 | init = split_nonconstant_init (var, expr); |
09357846 JM |
9790 | if (at_function_scope_p ()) |
9791 | { | |
9792 | add_decl_expr (var); | |
9793 | ||
9794 | if (TREE_STATIC (var)) | |
9795 | init = add_stmt_to_compound (init, register_dtor_fn (var)); | |
9796 | else | |
b25dd954 JM |
9797 | { |
9798 | tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
9799 | if (cleanup) | |
9771b263 | 9800 | vec_safe_push (*cleanups, cleanup); |
b25dd954 | 9801 | } |
09357846 JM |
9802 | |
9803 | /* We must be careful to destroy the temporary only | |
9804 | after its initialization has taken place. If the | |
9805 | initialization throws an exception, then the | |
9806 | destructor should not be run. We cannot simply | |
9807 | transform INIT into something like: | |
9808 | ||
9809 | (INIT, ({ CLEANUP_STMT; })) | |
9810 | ||
9811 | because emit_local_var always treats the | |
9812 | initializer as a full-expression. Thus, the | |
9813 | destructor would run too early; it would run at the | |
9814 | end of initializing the reference variable, rather | |
9815 | than at the end of the block enclosing the | |
9816 | reference variable. | |
9817 | ||
9818 | The solution is to pass back a cleanup expression | |
9819 | which the caller is responsible for attaching to | |
9820 | the statement tree. */ | |
9821 | } | |
9822 | else | |
9823 | { | |
9824 | rest_of_decl_compilation (var, /*toplev=*/1, at_eof); | |
9825 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
7c424acd | 9826 | { |
3048c0c7 | 9827 | if (CP_DECL_THREAD_LOCAL_P (var)) |
7c424acd JM |
9828 | tls_aggregates = tree_cons (NULL_TREE, var, |
9829 | tls_aggregates); | |
9830 | else | |
9831 | static_aggregates = tree_cons (NULL_TREE, var, | |
9832 | static_aggregates); | |
9833 | } | |
eca7fc57 JM |
9834 | else |
9835 | /* Check whether the dtor is callable. */ | |
9836 | cxx_maybe_build_cleanup (var, tf_warning_or_error); | |
09357846 | 9837 | } |
9127c38e JM |
9838 | /* Avoid -Wunused-variable warning (c++/38958). */ |
9839 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
56a6f1d3 | 9840 | && VAR_P (decl)) |
9127c38e | 9841 | TREE_USED (decl) = DECL_READ_P (decl) = true; |
09357846 JM |
9842 | |
9843 | *initp = init; | |
9844 | return var; | |
9845 | } | |
9846 | ||
27b8d0cd | 9847 | /* Convert EXPR to the indicated reference TYPE, in a way suitable for |
b25dd954 | 9848 | initializing a variable of that TYPE. */ |
27b8d0cd MM |
9849 | |
9850 | tree | |
b25dd954 | 9851 | initialize_reference (tree type, tree expr, |
e495f6b0 | 9852 | int flags, tsubst_flags_t complain) |
27b8d0cd | 9853 | { |
5bd61841 MM |
9854 | conversion *conv; |
9855 | void *p; | |
8400e75e | 9856 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
7993382e MM |
9857 | |
9858 | if (type == error_mark_node || error_operand_p (expr)) | |
9859 | return error_mark_node; | |
27b8d0cd | 9860 | |
5bd61841 MM |
9861 | /* Get the high-water mark for the CONVERSION_OBSTACK. */ |
9862 | p = conversion_obstack_alloc (0); | |
9863 | ||
44ba4c4e | 9864 | conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false, |
b40e334f | 9865 | flags, complain); |
5bd61841 | 9866 | if (!conv || conv->bad_p) |
27b8d0cd | 9867 | { |
60d21717 JM |
9868 | if (complain & tf_error) |
9869 | { | |
940023f4 JM |
9870 | if (conv) |
9871 | convert_like (conv, expr, complain); | |
9872 | else if (!CP_TYPE_CONST_P (TREE_TYPE (type)) | |
9873 | && !TYPE_REF_IS_RVALUE (type) | |
9874 | && !real_lvalue_p (expr)) | |
5a3c9cf2 PC |
9875 | error_at (loc, "invalid initialization of non-const reference of " |
9876 | "type %qT from an rvalue of type %qT", | |
9877 | type, TREE_TYPE (expr)); | |
60d21717 | 9878 | else |
5a3c9cf2 PC |
9879 | error_at (loc, "invalid initialization of reference of type " |
9880 | "%qT from expression of type %qT", type, | |
9881 | TREE_TYPE (expr)); | |
60d21717 | 9882 | } |
27b8d0cd MM |
9883 | return error_mark_node; |
9884 | } | |
9885 | ||
3ea1e328 PC |
9886 | if (conv->kind == ck_ref_bind) |
9887 | /* Perform the conversion. */ | |
9888 | expr = convert_like (conv, expr, complain); | |
9889 | else if (conv->kind == ck_ambig) | |
9890 | /* We gave an error in build_user_type_conversion_1. */ | |
9891 | expr = error_mark_node; | |
9892 | else | |
9893 | gcc_unreachable (); | |
7993382e | 9894 | |
b25dd954 JM |
9895 | /* Free all the conversions we allocated. */ |
9896 | obstack_free (&conversion_obstack, p); | |
aa6e8ed3 | 9897 | |
b25dd954 JM |
9898 | return expr; |
9899 | } | |
aa6e8ed3 | 9900 | |
b25dd954 JM |
9901 | /* Subroutine of extend_ref_init_temps. Possibly extend one initializer, |
9902 | which is bound either to a reference or a std::initializer_list. */ | |
aa6e8ed3 | 9903 | |
b25dd954 | 9904 | static tree |
9771b263 | 9905 | extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups) |
b25dd954 JM |
9906 | { |
9907 | tree sub = init; | |
9908 | tree *p; | |
9909 | STRIP_NOPS (sub); | |
5efef981 OW |
9910 | if (TREE_CODE (sub) == COMPOUND_EXPR) |
9911 | { | |
9912 | TREE_OPERAND (sub, 1) | |
9913 | = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups); | |
9914 | return init; | |
9915 | } | |
b25dd954 JM |
9916 | if (TREE_CODE (sub) != ADDR_EXPR) |
9917 | return init; | |
9918 | /* Deal with binding to a subobject. */ | |
9919 | for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; ) | |
9920 | p = &TREE_OPERAND (*p, 0); | |
9921 | if (TREE_CODE (*p) == TARGET_EXPR) | |
9922 | { | |
9923 | tree subinit = NULL_TREE; | |
9924 | *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit); | |
51d72abe JM |
9925 | recompute_tree_invariant_for_addr_expr (sub); |
9926 | if (init != sub) | |
9927 | init = fold_convert (TREE_TYPE (init), sub); | |
b25dd954 JM |
9928 | if (subinit) |
9929 | init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init); | |
9930 | } | |
9931 | return init; | |
9932 | } | |
aa6e8ed3 | 9933 | |
b25dd954 JM |
9934 | /* INIT is part of the initializer for DECL. If there are any |
9935 | reference or initializer lists being initialized, extend their | |
9936 | lifetime to match that of DECL. */ | |
aa6e8ed3 | 9937 | |
b25dd954 | 9938 | tree |
9771b263 | 9939 | extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups) |
b25dd954 JM |
9940 | { |
9941 | tree type = TREE_TYPE (init); | |
9942 | if (processing_template_decl) | |
9943 | return init; | |
9944 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
9945 | init = extend_ref_init_temps_1 (decl, init, cleanups); | |
9946 | else if (is_std_init_list (type)) | |
7993382e | 9947 | { |
b25dd954 JM |
9948 | /* The temporary array underlying a std::initializer_list |
9949 | is handled like a reference temporary. */ | |
9950 | tree ctor = init; | |
9951 | if (TREE_CODE (ctor) == TARGET_EXPR) | |
9952 | ctor = TARGET_EXPR_INITIAL (ctor); | |
9953 | if (TREE_CODE (ctor) == CONSTRUCTOR) | |
aa6e8ed3 | 9954 | { |
b25dd954 JM |
9955 | tree array = CONSTRUCTOR_ELT (ctor, 0)->value; |
9956 | array = extend_ref_init_temps_1 (decl, array, cleanups); | |
9957 | CONSTRUCTOR_ELT (ctor, 0)->value = array; | |
aa6e8ed3 | 9958 | } |
7993382e | 9959 | } |
b25dd954 JM |
9960 | else if (TREE_CODE (init) == CONSTRUCTOR) |
9961 | { | |
9962 | unsigned i; | |
9963 | constructor_elt *p; | |
9771b263 DN |
9964 | vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (init); |
9965 | FOR_EACH_VEC_SAFE_ELT (elts, i, p) | |
b25dd954 JM |
9966 | p->value = extend_ref_init_temps (decl, p->value, cleanups); |
9967 | } | |
7993382e | 9968 | |
b25dd954 | 9969 | return init; |
27b8d0cd | 9970 | } |
e2500fed | 9971 | |
99c4346a JM |
9972 | /* Returns true iff an initializer for TYPE could contain temporaries that |
9973 | need to be extended because they are bound to references or | |
9974 | std::initializer_list. */ | |
9975 | ||
9976 | bool | |
9977 | type_has_extended_temps (tree type) | |
9978 | { | |
9979 | type = strip_array_types (type); | |
9980 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
9981 | return true; | |
9982 | if (CLASS_TYPE_P (type)) | |
9983 | { | |
9984 | if (is_std_init_list (type)) | |
9985 | return true; | |
9986 | for (tree f = next_initializable_field (TYPE_FIELDS (type)); | |
9987 | f; f = next_initializable_field (DECL_CHAIN (f))) | |
9988 | if (type_has_extended_temps (TREE_TYPE (f))) | |
9989 | return true; | |
9990 | } | |
9991 | return false; | |
9992 | } | |
9993 | ||
09357846 JM |
9994 | /* Returns true iff TYPE is some variant of std::initializer_list. */ |
9995 | ||
9996 | bool | |
9997 | is_std_init_list (tree type) | |
9998 | { | |
0060a10a JM |
9999 | /* Look through typedefs. */ |
10000 | if (!TYPE_P (type)) | |
10001 | return false; | |
bd459a61 PC |
10002 | if (cxx_dialect == cxx98) |
10003 | return false; | |
0060a10a | 10004 | type = TYPE_MAIN_VARIANT (type); |
09357846 JM |
10005 | return (CLASS_TYPE_P (type) |
10006 | && CP_TYPE_CONTEXT (type) == std_node | |
10007 | && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0); | |
10008 | } | |
10009 | ||
10010 | /* Returns true iff DECL is a list constructor: i.e. a constructor which | |
10011 | will accept an argument list of a single std::initializer_list<T>. */ | |
10012 | ||
10013 | bool | |
10014 | is_list_ctor (tree decl) | |
10015 | { | |
10016 | tree args = FUNCTION_FIRST_USER_PARMTYPE (decl); | |
10017 | tree arg; | |
10018 | ||
10019 | if (!args || args == void_list_node) | |
10020 | return false; | |
10021 | ||
10022 | arg = non_reference (TREE_VALUE (args)); | |
10023 | if (!is_std_init_list (arg)) | |
10024 | return false; | |
10025 | ||
10026 | args = TREE_CHAIN (args); | |
10027 | ||
10028 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
10029 | /* There are more non-defaulted parms. */ | |
10030 | return false; | |
10031 | ||
10032 | return true; | |
10033 | } | |
10034 | ||
e2500fed | 10035 | #include "gt-cp-call.h" |