Branch data Line data Source code
1 : : /* Language-level data type conversion for GNU C++.
2 : : Copyright (C) 1987-2025 Free Software Foundation, Inc.
3 : : Hacked by Michael Tiemann (tiemann@cygnus.com)
4 : :
5 : : This file is part of GCC.
6 : :
7 : : GCC is free software; you can redistribute it and/or modify
8 : : it under the terms of the GNU General Public License as published by
9 : : the Free Software Foundation; either version 3, or (at your option)
10 : : any later version.
11 : :
12 : : GCC is distributed in the hope that it will be useful,
13 : : but WITHOUT ANY WARRANTY; without even the implied warranty of
14 : : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 : : GNU General Public License for more details.
16 : :
17 : : You should have received a copy of the GNU General Public License
18 : : along with GCC; see the file COPYING3. If not see
19 : : <http://www.gnu.org/licenses/>. */
20 : :
21 : :
22 : : /* This file contains the functions for converting C++ expressions
23 : : to different data types. The only entry point is `convert'.
24 : : Every language front end must have a `convert' function
25 : : but what kind of conversions it does will depend on the language. */
26 : :
27 : : #include "config.h"
28 : : #include "system.h"
29 : : #include "coretypes.h"
30 : : #include "target.h"
31 : : #include "cp-tree.h"
32 : : #include "stor-layout.h"
33 : : #include "flags.h"
34 : : #include "intl.h"
35 : : #include "convert.h"
36 : : #include "stringpool.h"
37 : : #include "attribs.h"
38 : : #include "escaped_string.h"
39 : : #include "gcc-urlifier.h"
40 : :
41 : : static tree convert_to_pointer_force (tree, tree, tsubst_flags_t);
42 : : static tree build_type_conversion (tree, tree);
43 : : static tree build_up_reference (tree, tree, int, tree, tsubst_flags_t);
44 : : static void diagnose_ref_binding (location_t, tree, tree, tree);
45 : :
46 : : /* Change of width--truncation and extension of integers or reals--
47 : : is represented with NOP_EXPR. Proper functioning of many things
48 : : assumes that no other conversions can be NOP_EXPRs.
49 : :
50 : : Conversion between integer and pointer is represented with CONVERT_EXPR.
51 : : Converting integer to real uses FLOAT_EXPR
52 : : and real to integer uses FIX_TRUNC_EXPR.
53 : :
54 : : Here is a list of all the functions that assume that widening and
55 : : narrowing is always done with a NOP_EXPR:
56 : : In convert.cc, convert_to_integer[_maybe_fold].
57 : : In c-typeck.cc, build_binary_op_nodefault (boolean ops),
58 : : and c_common_truthvalue_conversion.
59 : : In expr.cc: expand_expr, for operands of a MULT_EXPR.
60 : : In fold-const.cc: fold.
61 : : In tree.cc: get_narrower and get_unwidened.
62 : :
63 : : C++: in multiple-inheritance, converting between pointers may involve
64 : : adjusting them by a delta stored within the class definition. */
65 : :
66 : : /* Subroutines of `convert'. */
67 : :
68 : : /* if converting pointer to pointer
69 : : if dealing with classes, check for derived->base or vice versa
70 : : else if dealing with method pointers, delegate
71 : : else convert blindly
72 : : else if converting class, pass off to build_type_conversion
73 : : else try C-style pointer conversion. */
74 : :
75 : : static tree
76 : 27900347 : cp_convert_to_pointer (tree type, tree expr, bool dofold,
77 : : tsubst_flags_t complain)
78 : : {
79 : 27900347 : tree intype = TREE_TYPE (expr);
80 : 27900347 : enum tree_code form;
81 : 27900347 : tree rval;
82 : 27900347 : location_t loc = cp_expr_loc_or_input_loc (expr);
83 : :
84 : 27900347 : if (intype == error_mark_node)
85 : : return error_mark_node;
86 : :
87 : 27900347 : if (MAYBE_CLASS_TYPE_P (intype))
88 : : {
89 : 3 : intype = complete_type (intype);
90 : 3 : if (!COMPLETE_TYPE_P (intype))
91 : : {
92 : 0 : if (complain & tf_error)
93 : 0 : error_at (loc, "cannot convert from incomplete type %qH to %qI",
94 : : intype, type);
95 : 0 : return error_mark_node;
96 : : }
97 : :
98 : 6 : rval = build_type_conversion (type, expr);
99 : 3 : if (rval)
100 : : {
101 : 0 : if ((complain & tf_error)
102 : 0 : && rval == error_mark_node)
103 : 0 : error_at (loc, "conversion of %qE from %qH to %qI is ambiguous",
104 : : expr, intype, type);
105 : 0 : return rval;
106 : : }
107 : : }
108 : :
109 : : /* Handle anachronistic conversions from (::*)() to cv void* or (*)(). */
110 : 27900347 : if (TYPE_PTR_P (type)
111 : 27900347 : && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
112 : 27734277 : || VOID_TYPE_P (TREE_TYPE (type))))
113 : : {
114 : 12 : if (TYPE_PTRMEMFUNC_P (intype)
115 : 2236038 : || TREE_CODE (intype) == METHOD_TYPE)
116 : 9 : return convert_member_func_to_ptr (type, expr, complain);
117 : 2236026 : if (TYPE_PTR_P (TREE_TYPE (expr)))
118 : 1198223 : return build_nop (type, expr);
119 : 1037803 : intype = TREE_TYPE (expr);
120 : : }
121 : :
122 : 26702115 : if (expr == error_mark_node)
123 : : return error_mark_node;
124 : :
125 : 26702115 : form = TREE_CODE (intype);
126 : :
127 : 26702115 : if (INDIRECT_TYPE_P (intype))
128 : : {
129 : 17927224 : intype = TYPE_MAIN_VARIANT (intype);
130 : :
131 : 17927224 : if (TYPE_MAIN_VARIANT (type) != intype
132 : 12445260 : && TYPE_PTR_P (type)
133 : 12437537 : && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
134 : 5437707 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (type))
135 : 5357886 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype))
136 : 23205657 : && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE)
137 : : {
138 : 5278433 : enum tree_code code = PLUS_EXPR;
139 : 5278433 : tree binfo;
140 : 5278433 : tree intype_class;
141 : 5278433 : tree type_class;
142 : 5278433 : bool same_p;
143 : :
144 : 5278433 : intype_class = TREE_TYPE (intype);
145 : 5278433 : type_class = TREE_TYPE (type);
146 : :
147 : 5278433 : same_p = same_type_p (TYPE_MAIN_VARIANT (intype_class),
148 : : TYPE_MAIN_VARIANT (type_class));
149 : 5278433 : binfo = NULL_TREE;
150 : : /* Try derived to base conversion. */
151 : 5278433 : if (!same_p)
152 : 32119 : binfo = lookup_base (intype_class, type_class, ba_check,
153 : : NULL, complain);
154 : 5278433 : if (!same_p && !binfo)
155 : : {
156 : : /* Try base to derived conversion. */
157 : 19 : binfo = lookup_base (type_class, intype_class, ba_check,
158 : : NULL, complain);
159 : 19 : code = MINUS_EXPR;
160 : : }
161 : 5278433 : if (binfo == error_mark_node)
162 : : return error_mark_node;
163 : 5278424 : if (binfo || same_p)
164 : : {
165 : 5278424 : if (binfo)
166 : 32110 : expr = build_base_path (code, expr, binfo, 0, complain);
167 : : /* Add any qualifier conversions. */
168 : 5278424 : return build_nop (type, expr);
169 : : }
170 : : }
171 : :
172 : 12648791 : if (TYPE_PTRMEMFUNC_P (type))
173 : : {
174 : 0 : if (complain & tf_error)
175 : 0 : error_at (loc, "cannot convert %qE from type %qH to type %qI",
176 : : expr, intype, type);
177 : 0 : return error_mark_node;
178 : : }
179 : :
180 : 12648791 : return build_nop (type, expr);
181 : : }
182 : 1583 : else if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
183 : 8776376 : || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
184 : 113 : return convert_ptrmem (type, expr, /*allow_inverse_p=*/false,
185 : 113 : /*c_cast_p=*/false, complain);
186 : 8774778 : else if (TYPE_PTRMEMFUNC_P (intype))
187 : : {
188 : 0 : if (!warn_pmf2ptr)
189 : : {
190 : 0 : if (TREE_CODE (expr) == PTRMEM_CST)
191 : 0 : return cp_convert_to_pointer (type, PTRMEM_CST_MEMBER (expr),
192 : 0 : dofold, complain);
193 : 0 : else if (TREE_CODE (expr) == OFFSET_REF)
194 : : {
195 : 0 : tree object = TREE_OPERAND (expr, 0);
196 : 0 : return get_member_function_from_ptrfunc (&object,
197 : 0 : TREE_OPERAND (expr, 1),
198 : : complain);
199 : : }
200 : : }
201 : 0 : if (complain & tf_error)
202 : 0 : error_at (loc, "cannot convert %qE from type %qH to type %qI",
203 : : expr, intype, type);
204 : 0 : return error_mark_node;
205 : : }
206 : :
207 : 8774778 : if (null_ptr_cst_p (expr))
208 : : {
209 : 5485979 : if (TYPE_PTRMEMFUNC_P (type))
210 : 788 : return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0,
211 : 788 : /*c_cast_p=*/false, complain);
212 : :
213 : 5485191 : if (complain & tf_warning)
214 : 3922624 : maybe_warn_zero_as_null_pointer_constant (expr, loc);
215 : :
216 : : /* A NULL pointer-to-data-member is represented by -1, not by
217 : : zero. */
218 : 5485191 : tree val = (TYPE_PTRDATAMEM_P (type)
219 : 5485191 : ? build_int_cst_type (type, -1)
220 : 5483706 : : build_int_cst (type, 0));
221 : :
222 : 5485191 : return (TREE_SIDE_EFFECTS (expr)
223 : 5485191 : ? build2 (COMPOUND_EXPR, type, expr, val) : val);
224 : : }
225 : 3288799 : else if (TYPE_PTRMEM_P (type) && INTEGRAL_CODE_P (form))
226 : : {
227 : 0 : if (complain & tf_error)
228 : 0 : error_at (loc, "invalid conversion from %qH to %qI", intype, type);
229 : 0 : return error_mark_node;
230 : : }
231 : :
232 : 3288799 : if (INTEGRAL_CODE_P (form))
233 : : {
234 : 3305937 : if (TYPE_PRECISION (intype) == POINTER_SIZE)
235 : 3267892 : return build1 (CONVERT_EXPR, type, expr);
236 : 20901 : expr = cp_convert (c_common_type_for_size (TYPE_PRECISION (type), 0), expr,
237 : : complain);
238 : : /* Modes may be different but sizes should be the same. There
239 : : is supposed to be some integral type that is the same width
240 : : as a pointer. */
241 : 62703 : gcc_assert (GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (TREE_TYPE (expr)))
242 : : == GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type)));
243 : :
244 : : /* FIXME needed because convert_to_pointer_maybe_fold still folds
245 : : conversion of constants. */
246 : 20901 : if (!dofold)
247 : 20901 : return build1 (CONVERT_EXPR, type, expr);
248 : :
249 : 0 : return convert_to_pointer_maybe_fold (type, expr, dofold);
250 : : }
251 : :
252 : 6 : if (type_unknown_p (expr))
253 : 0 : return instantiate_type (type, expr, complain);
254 : :
255 : 6 : if (complain & tf_error)
256 : 6 : error_at (loc, "cannot convert %qE from type %qH to type %qI",
257 : : expr, intype, type);
258 : 6 : return error_mark_node;
259 : : }
260 : :
261 : : /* Like convert, except permit conversions to take place which
262 : : are not normally allowed due to access restrictions
263 : : (such as conversion from sub-type to private super-type). */
264 : :
265 : : static tree
266 : 7891899 : convert_to_pointer_force (tree type, tree expr, tsubst_flags_t complain)
267 : : {
268 : 7891899 : tree intype = TREE_TYPE (expr);
269 : 7891899 : enum tree_code form = TREE_CODE (intype);
270 : :
271 : 7891899 : if (form == POINTER_TYPE)
272 : : {
273 : 7891899 : intype = TYPE_MAIN_VARIANT (intype);
274 : :
275 : 7891899 : if (TYPE_MAIN_VARIANT (type) != intype
276 : 2409916 : && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
277 : 2409886 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (type))
278 : 2409883 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype))
279 : 10301782 : && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE)
280 : : {
281 : 2409883 : enum tree_code code = PLUS_EXPR;
282 : 2409883 : tree binfo;
283 : :
284 : 2409883 : binfo = lookup_base (TREE_TYPE (intype), TREE_TYPE (type),
285 : : ba_unique, NULL, complain);
286 : 2409883 : if (!binfo)
287 : : {
288 : 3 : binfo = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
289 : : ba_unique, NULL, complain);
290 : 3 : code = MINUS_EXPR;
291 : : }
292 : 2409883 : if (binfo == error_mark_node)
293 : : return error_mark_node;
294 : 2409883 : if (binfo)
295 : : {
296 : 2409880 : expr = build_base_path (code, expr, binfo, 0, complain);
297 : 2409880 : if (expr == error_mark_node)
298 : : return error_mark_node;
299 : : /* Add any qualifier conversions. */
300 : 2409880 : if (!same_type_p (TREE_TYPE (TREE_TYPE (expr)),
301 : : TREE_TYPE (type)))
302 : 389390 : expr = build_nop (type, expr);
303 : 2409880 : return expr;
304 : : }
305 : : }
306 : : }
307 : :
308 : 5482019 : return cp_convert_to_pointer (type, expr, /*fold*/false, complain);
309 : : }
310 : :
311 : : /* We are passing something to a function which requires a reference.
312 : : The type we are interested in is in TYPE. The initial
313 : : value we have to begin with is in ARG.
314 : :
315 : : FLAGS controls how we manage access checking.
316 : : DIRECT_BIND in FLAGS controls how any temporaries are generated.
317 : : If DIRECT_BIND is set, DECL is the reference we're binding to. */
318 : :
319 : : static tree
320 : 246 : build_up_reference (tree type, tree arg, int flags, tree decl,
321 : : tsubst_flags_t complain)
322 : : {
323 : 246 : tree rval;
324 : 246 : tree argtype = TREE_TYPE (arg);
325 : 246 : tree target_type = TREE_TYPE (type);
326 : :
327 : 246 : gcc_assert (TYPE_REF_P (type));
328 : :
329 : 246 : if ((flags & DIRECT_BIND) && ! lvalue_p (arg))
330 : : {
331 : : /* Create a new temporary variable. We can't just use a TARGET_EXPR
332 : : here because it needs to live as long as DECL. */
333 : 0 : tree targ = arg;
334 : :
335 : 0 : arg = make_temporary_var_for_ref_to_temp (decl, target_type);
336 : :
337 : : /* Process the initializer for the declaration. */
338 : 0 : DECL_INITIAL (arg) = targ;
339 : 0 : cp_finish_decl (arg, targ, /*init_const_expr_p=*/false, NULL_TREE,
340 : : LOOKUP_ONLYCONVERTING|DIRECT_BIND);
341 : : }
342 : 246 : else if (!(flags & DIRECT_BIND) && ! obvalue_p (arg))
343 : 1 : return get_target_expr (arg, complain);
344 : :
345 : : /* If we had a way to wrap this up, and say, if we ever needed its
346 : : address, transform all occurrences of the register, into a memory
347 : : reference we could win better. */
348 : 245 : rval = cp_build_addr_expr (arg, complain);
349 : 245 : if (rval == error_mark_node)
350 : : return error_mark_node;
351 : :
352 : 245 : if ((flags & LOOKUP_PROTECT)
353 : 245 : && TYPE_MAIN_VARIANT (argtype) != TYPE_MAIN_VARIANT (target_type)
354 : 9 : && MAYBE_CLASS_TYPE_P (argtype)
355 : 254 : && MAYBE_CLASS_TYPE_P (target_type))
356 : : {
357 : : /* We go through lookup_base for the access control. */
358 : 9 : tree binfo = lookup_base (argtype, target_type, ba_check,
359 : : NULL, complain);
360 : 9 : if (binfo == error_mark_node)
361 : : return error_mark_node;
362 : 9 : if (binfo == NULL_TREE)
363 : 0 : return error_not_base_type (target_type, argtype);
364 : 9 : rval = build_base_path (PLUS_EXPR, rval, binfo, 1, complain);
365 : : }
366 : : else
367 : 236 : rval
368 : 236 : = convert_to_pointer_force (build_pointer_type (target_type),
369 : : rval, complain);
370 : 245 : return build_nop (type, rval);
371 : : }
372 : :
373 : : /* Subroutine of convert_to_reference. REFTYPE is the target reference type.
374 : : INTYPE is the original rvalue type and DECL is an optional _DECL node
375 : : for diagnostics.
376 : :
377 : : [dcl.init.ref] says that if an rvalue is used to
378 : : initialize a reference, then the reference must be to a
379 : : non-volatile const type. */
380 : :
381 : : static void
382 : 7 : diagnose_ref_binding (location_t loc, tree reftype, tree intype, tree decl)
383 : : {
384 : 7 : tree ttl = TREE_TYPE (reftype);
385 : :
386 : 7 : if (!TYPE_REF_IS_RVALUE (reftype)
387 : 7 : && !CP_TYPE_CONST_NON_VOLATILE_P (ttl))
388 : : {
389 : 0 : const char *msg;
390 : :
391 : 0 : if (CP_TYPE_VOLATILE_P (ttl) && decl)
392 : : msg = G_("initialization of volatile reference type %q#T from "
393 : : "rvalue of type %qT");
394 : 0 : else if (CP_TYPE_VOLATILE_P (ttl))
395 : : msg = G_("conversion to volatile reference type %q#T "
396 : : "from rvalue of type %qT");
397 : 0 : else if (decl)
398 : : msg = G_("initialization of non-const reference type %q#T from "
399 : : "rvalue of type %qT");
400 : : else
401 : 0 : msg = G_("conversion to non-const reference type %q#T from "
402 : : "rvalue of type %qT");
403 : :
404 : 0 : permerror (loc, msg, reftype, intype);
405 : : }
406 : 7 : }
407 : :
408 : : /* For C++: Only need to do one-level references, but cannot
409 : : get tripped up on signed/unsigned differences.
410 : :
411 : : DECL is either NULL_TREE or the _DECL node for a reference that is being
412 : : initialized. It can be error_mark_node if we don't know the _DECL but
413 : : we know it's an initialization. */
414 : :
415 : : tree
416 : 248 : convert_to_reference (tree reftype, tree expr, int convtype,
417 : : int flags, tree decl, tsubst_flags_t complain)
418 : : {
419 : 248 : tree type = TYPE_MAIN_VARIANT (TREE_TYPE (reftype));
420 : 248 : tree intype;
421 : 248 : tree rval = NULL_TREE;
422 : 248 : tree rval_as_conversion = NULL_TREE;
423 : 248 : bool can_convert_intype_to_type;
424 : 248 : location_t loc = cp_expr_loc_or_input_loc (expr);
425 : :
426 : 248 : if (TREE_CODE (type) == FUNCTION_TYPE
427 : 248 : && TREE_TYPE (expr) == unknown_type_node)
428 : 0 : expr = instantiate_type (type, expr, complain);
429 : :
430 : 248 : if (expr == error_mark_node)
431 : : return error_mark_node;
432 : :
433 : 246 : intype = TREE_TYPE (expr);
434 : :
435 : 246 : gcc_assert (!TYPE_REF_P (intype));
436 : 246 : gcc_assert (TYPE_REF_P (reftype));
437 : :
438 : 246 : intype = TYPE_MAIN_VARIANT (intype);
439 : :
440 : 246 : can_convert_intype_to_type = can_convert_standard (type, intype, complain);
441 : :
442 : 246 : if (!can_convert_intype_to_type
443 : 4 : && (convtype & CONV_IMPLICIT) && MAYBE_CLASS_TYPE_P (intype)
444 : 246 : && ! (flags & LOOKUP_NO_CONVERSION))
445 : : {
446 : : /* Look for a user-defined conversion to lvalue that we can use. */
447 : :
448 : 0 : rval_as_conversion
449 : 0 : = build_type_conversion (reftype, expr);
450 : :
451 : 0 : if (rval_as_conversion && rval_as_conversion != error_mark_node
452 : 0 : && lvalue_p (rval_as_conversion))
453 : : {
454 : : expr = rval_as_conversion;
455 : 246 : rval_as_conversion = NULL_TREE;
456 : : intype = type;
457 : : can_convert_intype_to_type = 1;
458 : : }
459 : : }
460 : :
461 : 246 : if (((convtype & CONV_STATIC)
462 : 0 : && can_convert_standard (intype, type, complain))
463 : 246 : || ((convtype & CONV_IMPLICIT) && can_convert_intype_to_type))
464 : : {
465 : 242 : {
466 : 242 : tree ttl = TREE_TYPE (reftype);
467 : 242 : tree ttr = lvalue_type (expr);
468 : :
469 : 242 : if ((complain & tf_error)
470 : 242 : && ! lvalue_p (expr))
471 : 3 : diagnose_ref_binding (loc, reftype, intype, decl);
472 : :
473 : 242 : if (! (convtype & CONV_CONST)
474 : 242 : && !at_least_as_qualified_p (ttl, ttr))
475 : : {
476 : 6 : if (complain & tf_error)
477 : 6 : permerror (loc, "conversion from %qH to %qI discards qualifiers",
478 : : ttr, reftype);
479 : : else
480 : 0 : return error_mark_node;
481 : : }
482 : : }
483 : :
484 : 242 : return build_up_reference (reftype, expr, flags, decl, complain);
485 : : }
486 : 4 : else if ((convtype & CONV_REINTERPRET) && obvalue_p (expr))
487 : : {
488 : : /* When casting an lvalue to a reference type, just convert into
489 : : a pointer to the new type and deference it. This is allowed
490 : : by San Diego WP section 5.2.9 paragraph 12, though perhaps it
491 : : should be done directly (jason). (int &)ri ---> *(int*)&ri */
492 : :
493 : : /* B* bp; A& ar = (A&)bp; is valid, but it's probably not what they
494 : : meant. */
495 : 0 : if ((complain & tf_warning)
496 : 0 : && TYPE_PTR_P (intype)
497 : 0 : && (comptypes (TREE_TYPE (intype), type,
498 : : COMPARE_BASE | COMPARE_DERIVED)))
499 : 0 : warning_at (loc, 0, "casting %qT to %qT does not dereference pointer",
500 : : intype, reftype);
501 : :
502 : 0 : rval = cp_build_addr_expr (expr, complain);
503 : 0 : if (rval != error_mark_node)
504 : 0 : rval = convert_force (build_pointer_type (TREE_TYPE (reftype)),
505 : : rval, 0, complain);
506 : 0 : if (rval != error_mark_node)
507 : 0 : rval = build1 (NOP_EXPR, reftype, rval);
508 : : }
509 : : else
510 : : {
511 : 4 : rval = convert_for_initialization (NULL_TREE, type, expr, flags,
512 : : ICR_CONVERTING, 0, 0, complain);
513 : 4 : if (rval == NULL_TREE || rval == error_mark_node)
514 : : return rval;
515 : 4 : if (complain & tf_error)
516 : 4 : diagnose_ref_binding (loc, reftype, intype, decl);
517 : 4 : rval = build_up_reference (reftype, rval, flags, decl, complain);
518 : : }
519 : :
520 : 4 : if (rval)
521 : : {
522 : : /* If we found a way to convert earlier, then use it. */
523 : : return rval;
524 : : }
525 : :
526 : 0 : if (complain & tf_error)
527 : 0 : error_at (loc, "cannot convert type %qH to type %qI", intype, reftype);
528 : :
529 : 0 : return error_mark_node;
530 : : }
531 : :
532 : : /* We are using a reference VAL for its value. Bash that reference all the
533 : : way down to its lowest form. */
534 : :
535 : : tree
536 : 1806983336 : convert_from_reference (tree val)
537 : : {
538 : 1806983336 : if (TREE_TYPE (val)
539 : 1806983336 : && TYPE_REF_P (TREE_TYPE (val)))
540 : : {
541 : 207569224 : tree t = TREE_TYPE (TREE_TYPE (val));
542 : 207569224 : tree ref = build1 (INDIRECT_REF, t, val);
543 : :
544 : 207569224 : mark_exp_read (val);
545 : : /* We *must* set TREE_READONLY when dereferencing a pointer to const,
546 : : so that we get the proper error message if the result is used
547 : : to assign to. Also, &* is supposed to be a no-op. */
548 : 207569224 : TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
549 : 207569224 : TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
550 : 207569224 : TREE_SIDE_EFFECTS (ref)
551 : 207569224 : = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (val));
552 : 207569224 : val = ref;
553 : : }
554 : :
555 : 1806983336 : return val;
556 : : }
557 : :
558 : : /* Really perform an lvalue-to-rvalue conversion, including copying an
559 : : argument of class type into a temporary. */
560 : :
561 : : tree
562 : 17757777 : force_rvalue (tree expr, tsubst_flags_t complain)
563 : : {
564 : 17757777 : tree type = TREE_TYPE (expr);
565 : 17757777 : if (MAYBE_CLASS_TYPE_P (type) && TREE_CODE (expr) != TARGET_EXPR)
566 : : {
567 : 140208 : releasing_vec args (make_tree_vector_single (expr));
568 : 140208 : expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
569 : : &args, type, LOOKUP_NORMAL, complain);
570 : 140208 : expr = build_cplus_new (type, expr, complain);
571 : 140208 : }
572 : : else
573 : 17617569 : expr = decay_conversion (expr, complain);
574 : :
575 : 17757777 : return expr;
576 : : }
577 : :
578 : : /* Force EXPR to be an lvalue, if it isn't already. */
579 : :
580 : : tree
581 : 316668 : force_lvalue (tree expr, tsubst_flags_t complain)
582 : : {
583 : 316668 : if (!lvalue_p (expr))
584 : : {
585 : 27 : expr = cp_build_addr_expr (expr, complain);
586 : 27 : expr = cp_build_indirect_ref (input_location, expr, RO_ARROW, complain);
587 : : }
588 : 316668 : return expr;
589 : : }
590 : :
591 : :
592 : : /* If EXPR and ORIG are INTEGER_CSTs, return a version of EXPR that has
593 : : TREE_OVERFLOW set only if it is set in ORIG. Otherwise, return EXPR
594 : : unchanged. */
595 : :
596 : : static tree
597 : 144512704 : ignore_overflows (tree expr, tree orig)
598 : : {
599 : 144512704 : tree stripped_expr = tree_strip_any_location_wrapper (expr);
600 : 144512704 : tree stripped_orig = tree_strip_any_location_wrapper (orig);
601 : :
602 : 144512704 : if (TREE_CODE (stripped_expr) == INTEGER_CST
603 : 93605345 : && TREE_CODE (stripped_orig) == INTEGER_CST
604 : 238115495 : && TREE_OVERFLOW (stripped_expr) != TREE_OVERFLOW (stripped_orig))
605 : : {
606 : 5579 : gcc_assert (!TREE_OVERFLOW (stripped_orig));
607 : : /* Ensure constant sharing. */
608 : 5579 : stripped_expr = wide_int_to_tree (TREE_TYPE (stripped_expr),
609 : 11158 : wi::to_wide (stripped_expr));
610 : : }
611 : :
612 : 144512704 : return preserve_any_location_wrapper (stripped_expr, expr);
613 : : }
614 : :
615 : : /* Fold away simple conversions, but make sure TREE_OVERFLOW is set
616 : : properly and propagate TREE_NO_WARNING if folding EXPR results
617 : : in the same expression code. */
618 : :
619 : : tree
620 : 33537463 : cp_fold_convert (tree type, tree expr)
621 : : {
622 : 33537463 : tree conv;
623 : 33537463 : if (TREE_TYPE (expr) == type)
624 : : conv = expr;
625 : 13530433 : else if (TREE_CODE (expr) == PTRMEM_CST
626 : 13530433 : && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type),
627 : : PTRMEM_CST_CLASS (expr)))
628 : : {
629 : : /* Avoid wrapping a PTRMEM_CST in NOP_EXPR. */
630 : 233 : conv = copy_node (expr);
631 : 233 : TREE_TYPE (conv) = type;
632 : : }
633 : 13530200 : else if (TYPE_PTRMEM_P (type))
634 : : {
635 : 6 : conv = convert_ptrmem (type, expr, true, false,
636 : : tf_warning_or_error);
637 : 6 : conv = cp_fully_fold (conv);
638 : : }
639 : : else
640 : : {
641 : 13530194 : conv = fold_convert (type, expr);
642 : 13530194 : conv = ignore_overflows (conv, expr);
643 : : }
644 : :
645 : 33537463 : if (TREE_CODE (expr) == TREE_CODE (conv))
646 : 20698347 : copy_warning (conv, expr);
647 : :
648 : 33537463 : return conv;
649 : : }
650 : :
651 : : /* C++ conversions, preference to static cast conversions. */
652 : :
653 : : tree
654 : 230693261 : cp_convert (tree type, tree expr, tsubst_flags_t complain)
655 : : {
656 : 230693261 : return ocp_convert (type, expr, CONV_OLD_CONVERT, LOOKUP_NORMAL, complain);
657 : : }
658 : :
659 : : /* C++ equivalent of convert_and_check but using cp_convert as the
660 : : conversion function.
661 : :
662 : : Convert EXPR to TYPE, warning about conversion problems with constants.
663 : : Invoke this function on every expression that is converted implicitly,
664 : : i.e. because of language rules and not because of an explicit cast. */
665 : :
666 : : tree
667 : 64274953 : cp_convert_and_check (tree type, tree expr, tsubst_flags_t complain)
668 : : {
669 : 64274953 : tree result, expr_for_warning = expr;
670 : :
671 : 64274953 : if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
672 : 94 : expr = TREE_OPERAND (expr, 0);
673 : 64274953 : if (TREE_TYPE (expr) == type)
674 : : return expr;
675 : 64274940 : if (expr == error_mark_node)
676 : : return expr;
677 : 64274940 : result = cp_convert (type, expr, complain);
678 : :
679 : 64274940 : if ((complain & tf_warning)
680 : 59672082 : && c_inhibit_evaluation_warnings == 0)
681 : : {
682 : 58536401 : tree folded = cp_fully_fold (expr_for_warning);
683 : 58536401 : tree folded_result;
684 : 58536401 : if (folded == expr)
685 : : folded_result = result;
686 : : else
687 : : {
688 : : /* Avoid bogus -Wparentheses warnings. */
689 : 24022436 : warning_sentinel w (warn_parentheses);
690 : 24022436 : warning_sentinel c (warn_int_in_bool_context);
691 : 24022436 : folded_result = cp_convert (type, folded, tf_none);
692 : 24022436 : }
693 : 58536401 : folded_result = fold_simple (folded_result);
694 : 46625800 : if (!TREE_OVERFLOW_P (folded)
695 : 105162198 : && folded_result != error_mark_node)
696 : 90881974 : warnings_for_convert_and_check (cp_expr_loc_or_input_loc (expr),
697 : : type, folded, folded_result);
698 : : }
699 : :
700 : : return result;
701 : : }
702 : :
703 : : /* Conversion...
704 : :
705 : : FLAGS indicates how we should behave. */
706 : :
707 : : tree
708 : 365766519 : ocp_convert (tree type, tree expr, int convtype, int flags,
709 : : tsubst_flags_t complain)
710 : : {
711 : 365766519 : tree e = expr;
712 : 365766519 : enum tree_code code = TREE_CODE (type);
713 : 365766519 : const char *invalid_conv_diag;
714 : 365766519 : tree e1;
715 : 365766519 : location_t loc = cp_expr_loc_or_input_loc (expr);
716 : 365766519 : bool dofold = (convtype & CONV_FOLD);
717 : :
718 : 365766519 : if (error_operand_p (e) || type == error_mark_node)
719 : 104 : return error_mark_node;
720 : :
721 : 365766415 : if (TREE_CODE (e) == COMPOUND_EXPR)
722 : : {
723 : 459378 : e = ocp_convert (type, TREE_OPERAND (e, 1), convtype, flags, complain);
724 : 459378 : if (e == error_mark_node)
725 : : return error_mark_node;
726 : 459378 : if (e == TREE_OPERAND (expr, 1))
727 : : return expr;
728 : 459357 : e = build2_loc (EXPR_LOCATION (expr), COMPOUND_EXPR, TREE_TYPE (e),
729 : 459357 : TREE_OPERAND (expr, 0), e);
730 : 459357 : copy_warning (e, expr);
731 : 459357 : return e;
732 : : }
733 : :
734 : 365307037 : complete_type (type);
735 : 365307037 : complete_type (TREE_TYPE (expr));
736 : :
737 : 730614074 : if ((invalid_conv_diag
738 : 365307037 : = targetm.invalid_conversion (TREE_TYPE (expr), type)))
739 : : {
740 : 0 : if (complain & tf_error)
741 : 0 : error (invalid_conv_diag);
742 : 0 : return error_mark_node;
743 : : }
744 : :
745 : : /* FIXME remove when moving to c_fully_fold model. */
746 : 365307037 : if (!CLASS_TYPE_P (type))
747 : : {
748 : 345290856 : e = mark_rvalue_use (e);
749 : 345290856 : tree v = scalar_constant_value (e);
750 : 345290856 : if (!error_operand_p (v))
751 : 345290795 : e = v;
752 : : }
753 : 365307037 : if (error_operand_p (e))
754 : 0 : return error_mark_node;
755 : :
756 : 365307037 : if (NULLPTR_TYPE_P (type) && null_ptr_cst_p (e))
757 : : {
758 : 7063 : if (complain & tf_warning)
759 : 3589 : maybe_warn_zero_as_null_pointer_constant (e, loc);
760 : :
761 : 7063 : if (!TREE_SIDE_EFFECTS (e))
762 : 7051 : return nullptr_node;
763 : : }
764 : :
765 : 365299986 : if (MAYBE_CLASS_TYPE_P (type) && (convtype & CONV_FORCE_TEMP))
766 : : /* We need a new temporary; don't take this shortcut. */;
767 : 364226549 : else if (same_type_ignoring_top_level_qualifiers_p (type, TREE_TYPE (e)))
768 : : {
769 : 182226602 : tree etype = TREE_TYPE (e);
770 : 182226602 : if (same_type_p (type, etype))
771 : : /* The call to fold will not always remove the NOP_EXPR as
772 : : might be expected, since if one of the types is a typedef;
773 : : the comparison in fold is just equality of pointers, not a
774 : : call to comptypes. We don't call fold in this case because
775 : : that can result in infinite recursion; fold will call
776 : : convert, which will call ocp_convert, etc. */
777 : : return e;
778 : : /* For complex data types, we need to perform componentwise
779 : : conversion. */
780 : 16324211 : else if (TREE_CODE (type) == COMPLEX_TYPE)
781 : 0 : return convert_to_complex_maybe_fold (type, e, dofold);
782 : 16324211 : else if (VECTOR_TYPE_P (type))
783 : 3075 : return convert_to_vector (type, rvalue (e));
784 : 16321136 : else if (TREE_CODE (e) == TARGET_EXPR)
785 : : {
786 : : /* Don't build a NOP_EXPR of class type. Instead, change the
787 : : type of the temporary. */
788 : 108745 : gcc_assert (same_type_ignoring_top_level_qualifiers_p (type, etype));
789 : 108745 : TREE_TYPE (e) = TREE_TYPE (TARGET_EXPR_SLOT (e)) = type;
790 : 108745 : return e;
791 : : }
792 : 16212391 : else if (TREE_CODE (e) == CONSTRUCTOR)
793 : : {
794 : 5 : gcc_assert (same_type_ignoring_top_level_qualifiers_p (type, etype));
795 : 5 : TREE_TYPE (e) = type;
796 : 5 : return e;
797 : : }
798 : : else
799 : : {
800 : : /* We shouldn't be treating objects of ADDRESSABLE type as
801 : : rvalues. */
802 : 16212386 : gcc_assert (!TREE_ADDRESSABLE (type));
803 : 16212386 : return build_nop (type, e);
804 : : }
805 : : }
806 : :
807 : 183073384 : e1 = targetm.convert_to_type (type, e);
808 : 183073384 : if (e1)
809 : : return e1;
810 : :
811 : 183073384 : if (code == VOID_TYPE && (convtype & CONV_STATIC))
812 : : {
813 : 9980 : e = convert_to_void (e, ICV_CAST, complain);
814 : 9980 : return e;
815 : : }
816 : :
817 : 183063404 : if (INTEGRAL_CODE_P (code))
818 : : {
819 : 138175193 : tree intype = TREE_TYPE (e);
820 : 138175193 : tree converted;
821 : :
822 : 138175193 : if (TREE_CODE (type) == ENUMERAL_TYPE)
823 : : {
824 : : /* enum = enum, enum = int, enum = float, (enum)pointer are all
825 : : errors. */
826 : 767599 : if (((INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
827 : 6 : || SCALAR_FLOAT_TYPE_P (intype))
828 : 767599 : && ! (convtype & CONV_STATIC))
829 : 767599 : || TYPE_PTR_P (intype))
830 : : {
831 : 0 : if (complain & tf_error)
832 : 0 : permerror (loc, "conversion from %q#T to %q#T", intype, type);
833 : : else
834 : 0 : return error_mark_node;
835 : : }
836 : :
837 : : /* [expr.static.cast]
838 : :
839 : : 8. A value of integral or enumeration type can be explicitly
840 : : converted to an enumeration type. The value is unchanged if
841 : : the original value is within the range of the enumeration
842 : : values. Otherwise, the resulting enumeration value is
843 : : unspecified. */
844 : 767599 : tree val = fold_for_warn (e);
845 : 767599 : if ((complain & tf_warning)
846 : 767227 : && TREE_CODE (val) == INTEGER_CST
847 : 178244 : && ENUM_UNDERLYING_TYPE (type)
848 : 945840 : && !int_fits_type_p (val, ENUM_UNDERLYING_TYPE (type)))
849 : 121 : warning_at (loc, OPT_Wconversion,
850 : : "the result of the conversion is unspecified because "
851 : : "%qE is outside the range of type %qT",
852 : : expr, type);
853 : : }
854 : 138175193 : if (MAYBE_CLASS_TYPE_P (intype))
855 : : {
856 : 9 : tree rval;
857 : 18 : rval = build_type_conversion (type, e);
858 : 9 : if (rval)
859 : : return rval;
860 : 0 : if (complain & tf_error)
861 : 0 : error_at (loc, "%q#T used where a %qT was expected", intype, type);
862 : 0 : return error_mark_node;
863 : : }
864 : 138175184 : if (code == BOOLEAN_TYPE)
865 : : {
866 : 7192674 : if (VOID_TYPE_P (intype))
867 : : {
868 : 18 : if (complain & tf_error)
869 : 18 : error_at (loc,
870 : : "could not convert %qE from %<void%> to %<bool%>",
871 : : expr);
872 : 18 : return error_mark_node;
873 : : }
874 : :
875 : 7192656 : if (VECTOR_TYPE_P (intype) && !gnu_vector_type_p (intype))
876 : : {
877 : 0 : if (complain & tf_error)
878 : 0 : error_at (loc, "could not convert %qE from %qH to %qI", expr,
879 : 0 : TREE_TYPE (expr), type);
880 : 0 : return error_mark_node;
881 : : }
882 : :
883 : : /* We can't implicitly convert a scoped enum to bool, so convert
884 : : to the underlying type first. */
885 : 7192656 : if (SCOPED_ENUM_P (intype) && (convtype & CONV_STATIC))
886 : 39 : e = build_nop (ENUM_UNDERLYING_TYPE (intype), e);
887 : 7192656 : if (complain & tf_warning)
888 : 4259455 : return cp_truthvalue_conversion (e, complain);
889 : : else
890 : : {
891 : : /* Prevent bogus -Wint-in-bool-context warnings coming
892 : : from c_common_truthvalue_conversion down the line. */
893 : 2933201 : warning_sentinel w (warn_int_in_bool_context);
894 : 2933201 : warning_sentinel c (warn_sign_compare);
895 : 2933201 : return cp_truthvalue_conversion (e, complain);
896 : 2933201 : }
897 : : }
898 : :
899 : 130982510 : converted = convert_to_integer_maybe_fold (type, e, dofold);
900 : :
901 : : /* Ignore any integer overflow caused by the conversion. */
902 : 130982510 : return ignore_overflows (converted, e);
903 : : }
904 : 44888211 : if (INDIRECT_TYPE_P (type) || TYPE_PTRMEM_P (type))
905 : 22418328 : return cp_convert_to_pointer (type, e, dofold, complain);
906 : 22469883 : if (code == VECTOR_TYPE)
907 : : {
908 : 4392 : tree in_vtype = TREE_TYPE (e);
909 : 4392 : if (MAYBE_CLASS_TYPE_P (in_vtype))
910 : : {
911 : 0 : tree ret_val;
912 : 0 : ret_val = build_type_conversion (type, e);
913 : 0 : if (ret_val)
914 : : return ret_val;
915 : 0 : if (complain & tf_error)
916 : 0 : error_at (loc, "%q#T used where a %qT was expected",
917 : : in_vtype, type);
918 : 0 : return error_mark_node;
919 : : }
920 : 4392 : return convert_to_vector (type, rvalue (e));
921 : : }
922 : 22465491 : if (code == REAL_TYPE || code == COMPLEX_TYPE)
923 : : {
924 : 21392048 : if (MAYBE_CLASS_TYPE_P (TREE_TYPE (e)))
925 : : {
926 : 0 : tree rval;
927 : 0 : rval = build_type_conversion (type, e);
928 : 0 : if (rval)
929 : : return rval;
930 : 0 : else if (complain & tf_error)
931 : 0 : error_at (loc,
932 : : "%q#T used where a floating-point value was expected",
933 : 0 : TREE_TYPE (e));
934 : : }
935 : 21392048 : if (code == REAL_TYPE)
936 : 20871728 : return convert_to_real_maybe_fold (type, e, dofold);
937 : 520320 : else if (code == COMPLEX_TYPE)
938 : 520320 : return convert_to_complex_maybe_fold (type, e, dofold);
939 : : }
940 : :
941 : : /* New C++ semantics: since assignment is now based on
942 : : memberwise copying, if the rhs type is derived from the
943 : : lhs type, then we may still do a conversion. */
944 : 1073443 : if (RECORD_OR_UNION_CODE_P (code))
945 : : {
946 : 1073437 : tree dtype = TREE_TYPE (e);
947 : 1073437 : tree ctor = NULL_TREE;
948 : :
949 : 1073437 : dtype = TYPE_MAIN_VARIANT (dtype);
950 : :
951 : : /* Conversion between aggregate types. New C++ semantics allow
952 : : objects of derived type to be cast to objects of base type.
953 : : Old semantics only allowed this between pointers.
954 : :
955 : : There may be some ambiguity between using a constructor
956 : : vs. using a type conversion operator when both apply. */
957 : :
958 : 1073437 : ctor = e;
959 : :
960 : 1073437 : if (abstract_virtuals_error (NULL_TREE, type, complain))
961 : 0 : return error_mark_node;
962 : :
963 : 1073437 : if (BRACE_ENCLOSED_INITIALIZER_P (ctor))
964 : 23762 : ctor = perform_implicit_conversion (type, ctor, complain);
965 : 1049675 : else if ((flags & LOOKUP_ONLYCONVERTING)
966 : 1049675 : && ! (CLASS_TYPE_P (dtype) && DERIVED_FROM_P (type, dtype)))
967 : : /* For copy-initialization, first we create a temp of the proper type
968 : : with a user-defined conversion sequence, then we direct-initialize
969 : : the target with the temp (see [dcl.init]). */
970 : 23202 : ctor = build_user_type_conversion (type, ctor, flags, complain);
971 : : else
972 : : {
973 : 1026473 : releasing_vec ctor_vec (make_tree_vector_single (ctor));
974 : 1026473 : ctor = build_special_member_call (NULL_TREE,
975 : : complete_ctor_identifier,
976 : : &ctor_vec,
977 : : type, flags, complain);
978 : 1026473 : }
979 : 1073437 : if (ctor)
980 : 1073237 : return build_cplus_new (type, ctor, complain);
981 : : }
982 : :
983 : 206 : if (complain & tf_error)
984 : : {
985 : : /* If the conversion failed and expr was an invalid use of pointer to
986 : : member function, try to report a meaningful error. */
987 : 206 : if (invalid_nonstatic_memfn_p (loc, expr, complain))
988 : : /* We displayed the error message. */;
989 : : else
990 : 203 : error_at (loc, "conversion from %qH to non-scalar type %qI requested",
991 : 203 : TREE_TYPE (expr), type);
992 : : }
993 : 206 : return error_mark_node;
994 : : }
995 : :
996 : : /* If CALL is a call, return the callee; otherwise null. */
997 : :
998 : : tree
999 : 846377484 : cp_get_callee (tree call)
1000 : : {
1001 : 846377484 : if (call == NULL_TREE)
1002 : : return call;
1003 : 846377484 : else if (TREE_CODE (call) == CALL_EXPR)
1004 : 806069235 : return CALL_EXPR_FN (call);
1005 : 40308249 : else if (TREE_CODE (call) == AGGR_INIT_EXPR)
1006 : 26952665 : return AGGR_INIT_EXPR_FN (call);
1007 : : return NULL_TREE;
1008 : : }
1009 : :
1010 : : /* FN is the callee of a CALL_EXPR or AGGR_INIT_EXPR; return the FUNCTION_DECL
1011 : : if we can. */
1012 : :
1013 : : tree
1014 : 679989178 : cp_get_fndecl_from_callee (tree fn, bool fold /* = true */)
1015 : : {
1016 : 679989178 : if (fn == NULL_TREE)
1017 : : return fn;
1018 : :
1019 : : /* We evaluate constexpr functions on the original, pre-genericization
1020 : : bodies. So block-scope extern declarations have not been mapped to
1021 : : declarations in outer scopes. Use the namespace-scope declaration,
1022 : : if any, so that retrieve_constexpr_fundef can find it (PR111132). */
1023 : 1299965519 : auto fn_or_local_alias = [] (tree f)
1024 : : {
1025 : 621981087 : if (DECL_LOCAL_DECL_P (f))
1026 : 43625 : if (tree alias = DECL_LOCAL_DECL_ALIAS (f))
1027 : 43625 : if (alias != error_mark_node)
1028 : 43625 : return alias;
1029 : : return f;
1030 : : };
1031 : :
1032 : 677984432 : if (TREE_CODE (fn) == FUNCTION_DECL)
1033 : 8374561 : return fn_or_local_alias (fn);
1034 : 669609871 : tree type = TREE_TYPE (fn);
1035 : 669609871 : if (type == NULL_TREE || !INDIRECT_TYPE_P (type))
1036 : : return NULL_TREE;
1037 : 619335574 : if (fold)
1038 : 2583365 : fn = maybe_constant_init (fn);
1039 : 619335574 : STRIP_NOPS (fn);
1040 : 619335574 : if (TREE_CODE (fn) == ADDR_EXPR
1041 : 619335574 : || TREE_CODE (fn) == FDESC_EXPR)
1042 : 613606620 : fn = TREE_OPERAND (fn, 0);
1043 : 619335574 : if (TREE_CODE (fn) == FUNCTION_DECL)
1044 : 613606526 : return fn_or_local_alias (fn);
1045 : : return NULL_TREE;
1046 : : }
1047 : :
1048 : : /* Like get_callee_fndecl, but handles AGGR_INIT_EXPR as well and uses the
1049 : : constexpr machinery. */
1050 : :
1051 : : tree
1052 : 0 : cp_get_callee_fndecl (tree call)
1053 : : {
1054 : 0 : return cp_get_fndecl_from_callee (cp_get_callee (call));
1055 : : }
1056 : :
1057 : : /* As above, but not using the constexpr machinery. */
1058 : :
1059 : : tree
1060 : 267526043 : cp_get_callee_fndecl_nofold (tree call)
1061 : : {
1062 : 267526043 : return cp_get_fndecl_from_callee (cp_get_callee (call), false);
1063 : : }
1064 : :
1065 : : /* Subroutine of convert_to_void. Warn if we're discarding something with
1066 : : attribute [[nodiscard]]. */
1067 : :
1068 : : static void
1069 : 4370858 : maybe_warn_nodiscard (tree expr, impl_conv_void implicit)
1070 : : {
1071 : 4370858 : if (!warn_unused_result || c_inhibit_evaluation_warnings)
1072 : : return;
1073 : :
1074 : 4361394 : tree call = expr;
1075 : 4361394 : if (TREE_CODE (expr) == TARGET_EXPR)
1076 : 53100 : call = TARGET_EXPR_INITIAL (expr);
1077 : 4361394 : location_t loc = cp_expr_loc_or_input_loc (call);
1078 : 4361394 : tree callee = cp_get_callee (call);
1079 : 4361394 : if (!callee || !TREE_TYPE (callee))
1080 : : return;
1081 : :
1082 : 4359482 : tree type = TREE_TYPE (callee);
1083 : 4359482 : if (TYPE_PTRMEMFUNC_P (type))
1084 : 0 : type = TYPE_PTRMEMFUNC_FN_TYPE (type);
1085 : 4359482 : if (INDIRECT_TYPE_P (type))
1086 : 2583365 : type = TREE_TYPE (type);
1087 : 4359482 : if (!FUNC_OR_METHOD_TYPE_P (type))
1088 : : return;
1089 : :
1090 : 4359431 : tree rettype = TREE_TYPE (type);
1091 : 4359431 : tree fn = cp_get_fndecl_from_callee (callee);
1092 : 4359431 : tree attr;
1093 : 4359431 : if (implicit != ICV_CAST && fn
1094 : 4359431 : && (attr = lookup_attribute ("nodiscard", DECL_ATTRIBUTES (fn))))
1095 : : {
1096 : 426 : escaped_string msg;
1097 : 426 : tree args = TREE_VALUE (attr);
1098 : 426 : if (args)
1099 : 57 : msg.escape (TREE_STRING_POINTER (TREE_VALUE (args)));
1100 : 426 : const char *format
1101 : 426 : = (msg
1102 : 426 : ? G_("ignoring return value of %qD, "
1103 : : "declared with attribute %<nodiscard%>: %qs")
1104 : : : G_("ignoring return value of %qD, "
1105 : 369 : "declared with attribute %<nodiscard%>%s"));
1106 : 426 : const char *raw_msg = msg ? (const char *) msg : "";
1107 : 426 : auto_diagnostic_group d;
1108 : 426 : auto_urlify_attributes sentinel;
1109 : 426 : if (warning_at (loc, OPT_Wunused_result, format, fn, raw_msg))
1110 : 426 : inform (DECL_SOURCE_LOCATION (fn), "declared here");
1111 : 426 : }
1112 : 4359005 : else if (implicit != ICV_CAST
1113 : 4359005 : && (attr = lookup_attribute ("nodiscard", TYPE_ATTRIBUTES (rettype))))
1114 : : {
1115 : 117 : escaped_string msg;
1116 : 117 : tree args = TREE_VALUE (attr);
1117 : 117 : if (args)
1118 : 54 : msg.escape (TREE_STRING_POINTER (TREE_VALUE (args)));
1119 : 117 : const char *format
1120 : 117 : = (msg
1121 : 117 : ? G_("ignoring returned value of type %qT, "
1122 : : "declared with attribute %<nodiscard%>: %qs")
1123 : : : G_("ignoring returned value of type %qT, "
1124 : 63 : "declared with attribute %<nodiscard%>%s"));
1125 : 117 : const char *raw_msg = msg ? (const char *) msg : "";
1126 : 117 : auto_diagnostic_group d;
1127 : 117 : auto_urlify_attributes sentinel;
1128 : 117 : if (warning_at (loc, OPT_Wunused_result, format, rettype, raw_msg))
1129 : : {
1130 : 117 : if (fn)
1131 : 18 : inform (DECL_SOURCE_LOCATION (fn),
1132 : : "in call to %qD, declared here", fn);
1133 : 117 : inform (DECL_SOURCE_LOCATION (TYPE_NAME (rettype)),
1134 : : "%qT declared here", rettype);
1135 : : }
1136 : 117 : }
1137 : 4358888 : else if (TREE_CODE (expr) == TARGET_EXPR
1138 : 4358888 : && lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (type)))
1139 : : {
1140 : : /* The TARGET_EXPR confuses do_warn_unused_result into thinking that the
1141 : : result is used, so handle that case here. */
1142 : 63 : auto_urlify_attributes sentinel;
1143 : 63 : if (fn)
1144 : : {
1145 : 63 : auto_diagnostic_group d;
1146 : 63 : if (warning_at (loc, OPT_Wunused_result,
1147 : : "ignoring return value of %qD, "
1148 : : "declared with attribute %<warn_unused_result%>",
1149 : : fn))
1150 : 63 : inform (DECL_SOURCE_LOCATION (fn), "declared here");
1151 : 63 : }
1152 : : else
1153 : 0 : warning_at (loc, OPT_Wunused_result,
1154 : : "ignoring return value of function "
1155 : : "declared with attribute %<warn_unused_result%>");
1156 : 63 : }
1157 : : }
1158 : :
1159 : : /* When an expression is used in a void context, its value is discarded and
1160 : : no lvalue-rvalue and similar conversions happen [expr.static.cast/4,
1161 : : stmt.expr/1, expr.comma/1]. This permits dereferencing an incomplete type
1162 : : in a void context. The C++ standard does not define what an `access' to an
1163 : : object is, but there is reason to believe that it is the lvalue to rvalue
1164 : : conversion -- if it were not, `*&*p = 1' would violate [expr]/4 in that it
1165 : : accesses `*p' not to calculate the value to be stored. But, dcl.type.cv/8
1166 : : indicates that volatile semantics should be the same between C and C++
1167 : : where ever possible. C leaves it implementation defined as to what
1168 : : constitutes an access to a volatile. So, we interpret `*vp' as a read of
1169 : : the volatile object `vp' points to, unless that is an incomplete type. For
1170 : : volatile references we do not do this interpretation, because that would
1171 : : make it impossible to ignore the reference return value from functions. We
1172 : : issue warnings in the confusing cases.
1173 : :
1174 : : The IMPLICIT is ICV_CAST when the user is explicitly converting an expression
1175 : : to void via a cast. If an expression is being implicitly converted, IMPLICIT
1176 : : indicates the context of the implicit conversion. */
1177 : :
1178 : : tree
1179 : 81553155 : convert_to_void (tree expr, impl_conv_void implicit, tsubst_flags_t complain)
1180 : : {
1181 : 85242406 : location_t loc = cp_expr_loc_or_input_loc (expr);
1182 : :
1183 : 85242406 : if (expr == error_mark_node
1184 : 85242406 : || TREE_TYPE (expr) == error_mark_node)
1185 : : return error_mark_node;
1186 : :
1187 : 85238320 : expr = maybe_undo_parenthesized_ref (expr);
1188 : :
1189 : 85238320 : if (invalid_nonstatic_memfn_p (loc, expr, complain))
1190 : 20 : return error_mark_node;
1191 : 85238300 : if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
1192 : : {
1193 : 6 : if (complain & tf_error)
1194 : 6 : error_at (loc, "pseudo-destructor is not called");
1195 : 6 : return error_mark_node;
1196 : : }
1197 : :
1198 : : /* Explicitly evaluate void-converted concept checks since their
1199 : : satisfaction may produce ill-formed programs. */
1200 : 85238294 : if (concept_check_p (expr))
1201 : 29 : expr = evaluate_concept_check (expr);
1202 : :
1203 : 85238294 : if (VOID_TYPE_P (TREE_TYPE (expr)))
1204 : : return expr;
1205 : :
1206 : 57543873 : expr = mark_discarded_use (expr);
1207 : 57543873 : if (implicit == ICV_CAST)
1208 : : /* An explicit cast to void avoids all -Wunused-but-set* warnings. */
1209 : 760962 : mark_exp_read (expr);
1210 : :
1211 : 57543873 : switch (TREE_CODE (expr))
1212 : : {
1213 : 129362 : case COND_EXPR:
1214 : 129362 : {
1215 : : /* The two parts of a cond expr might be separate lvalues. */
1216 : 129362 : tree op1 = TREE_OPERAND (expr,1);
1217 : 129362 : tree op2 = TREE_OPERAND (expr,2);
1218 : 129356 : bool side_effects = ((op1 && TREE_SIDE_EFFECTS (op1))
1219 : 241831 : || TREE_SIDE_EFFECTS (op2));
1220 : 129362 : tree new_op1, new_op2;
1221 : 129362 : new_op1 = NULL_TREE;
1222 : 129362 : if (implicit != ICV_CAST && !side_effects)
1223 : : {
1224 : 69 : if (op1)
1225 : 66 : new_op1 = convert_to_void (op1, ICV_SECOND_OF_COND, complain);
1226 : 69 : new_op2 = convert_to_void (op2, ICV_THIRD_OF_COND, complain);
1227 : : }
1228 : : else
1229 : : {
1230 : 129293 : if (op1)
1231 : 129290 : new_op1 = convert_to_void (op1, ICV_CAST, complain);
1232 : 129293 : new_op2 = convert_to_void (op2, ICV_CAST, complain);
1233 : : }
1234 : :
1235 : 129362 : expr = build3_loc (loc, COND_EXPR, TREE_TYPE (new_op2),
1236 : 129362 : TREE_OPERAND (expr, 0), new_op1, new_op2);
1237 : 129362 : break;
1238 : : }
1239 : :
1240 : 388031 : case COMPOUND_EXPR:
1241 : 388031 : {
1242 : : /* The second part of a compound expr contains the value. */
1243 : 388031 : tree op1 = TREE_OPERAND (expr,1);
1244 : 388031 : tree new_op1;
1245 : 388031 : if (implicit != ICV_CAST && !warning_suppressed_p (expr /* What warning? */))
1246 : 194684 : new_op1 = convert_to_void (op1, ICV_RIGHT_OF_COMMA, complain);
1247 : : else
1248 : 193347 : new_op1 = convert_to_void (op1, ICV_CAST, complain);
1249 : :
1250 : 388031 : if (new_op1 != op1)
1251 : : {
1252 : 388031 : tree t = build2_loc (loc, COMPOUND_EXPR, TREE_TYPE (new_op1),
1253 : 388031 : TREE_OPERAND (expr, 0), new_op1);
1254 : 388031 : expr = t;
1255 : : }
1256 : :
1257 : : break;
1258 : : }
1259 : :
1260 : : case NON_LVALUE_EXPR:
1261 : : case NOP_EXPR:
1262 : : /* These have already decayed to rvalue. */
1263 : : break;
1264 : :
1265 : 5518356 : case CALL_EXPR: /* We have a special meaning for volatile void fn(). */
1266 : : /* cdtors may return this or void, depending on
1267 : : targetm.cxx.cdtor_returns_this, but this shouldn't affect our
1268 : : decisions here: neither nodiscard warnings (nodiscard dtors
1269 : : are nonsensical and ctors have a different behavior with that
1270 : : attribute that is handled in the TARGET_EXPR case), nor should
1271 : : any constexpr or template instantiations be affected by an ABI
1272 : : property that is, or at least ought to be transparent to the
1273 : : language. */
1274 : 5518356 : if (tree fn = cp_get_callee_fndecl_nofold (expr))
1275 : 9865536 : if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
1276 : : return expr;
1277 : :
1278 : 5518356 : if (complain & tf_warning)
1279 : 4317594 : maybe_warn_nodiscard (expr, implicit);
1280 : : break;
1281 : :
1282 : 4024068 : case INDIRECT_REF:
1283 : 4024068 : {
1284 : 4024068 : tree type = TREE_TYPE (expr);
1285 : 4024068 : int is_reference = TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr, 0)));
1286 : 4024068 : int is_volatile = TYPE_VOLATILE (type);
1287 : 4024068 : if (is_volatile)
1288 : 424 : complete_type (type);
1289 : 4024068 : int is_complete = COMPLETE_TYPE_P (type);
1290 : :
1291 : : /* Don't load the value if this is an implicit dereference, or if
1292 : : the type needs to be handled by ctors/dtors. */
1293 : 4024068 : if (is_reference)
1294 : : {
1295 : 292 : if (is_volatile && (complain & tf_warning)
1296 : : /* A co_await expression, in its await_resume expression, also
1297 : : contains an implicit dereference. As a result, we don't
1298 : : need to warn about them here. */
1299 : 3689332 : && TREE_CODE (TREE_OPERAND (expr, 0)) != CO_AWAIT_EXPR)
1300 : 72 : switch (implicit)
1301 : : {
1302 : 36 : case ICV_CAST:
1303 : 36 : warning_at (loc, 0, "conversion to void will not access "
1304 : : "object of type %qT", type);
1305 : 36 : break;
1306 : 0 : case ICV_SECOND_OF_COND:
1307 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1308 : : "object of type %qT in second operand of "
1309 : : "conditional expression", type);
1310 : 0 : break;
1311 : 0 : case ICV_THIRD_OF_COND:
1312 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1313 : : "object of type %qT in third operand of "
1314 : : "conditional expression", type);
1315 : 0 : break;
1316 : 0 : case ICV_RIGHT_OF_COMMA:
1317 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1318 : : "object of type %qT in right operand of "
1319 : : "comma operator", type);
1320 : 0 : break;
1321 : 0 : case ICV_LEFT_OF_COMMA:
1322 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1323 : : "object of type %qT in left operand of comma "
1324 : : "operator", type);
1325 : 0 : break;
1326 : 36 : case ICV_STATEMENT:
1327 : 36 : warning_at (loc, 0, "implicit dereference will not access "
1328 : : "object of type %qT in statement", type);
1329 : 36 : break;
1330 : 0 : case ICV_THIRD_IN_FOR:
1331 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1332 : : "object of type %qT in for increment expression",
1333 : : type);
1334 : 0 : break;
1335 : 0 : default:
1336 : 0 : gcc_unreachable ();
1337 : : }
1338 : :
1339 : : /* Since this was an implicit dereference, we should also act as if
1340 : : it was never there. */
1341 : 3689251 : return convert_to_void (TREE_OPERAND (expr, 0), implicit, complain);
1342 : : }
1343 : : /* Can't load the value if we don't know the type. */
1344 : 334817 : else if (is_volatile && !is_complete)
1345 : : {
1346 : 18 : if (complain & tf_warning)
1347 : 18 : switch (implicit)
1348 : : {
1349 : 12 : case ICV_CAST:
1350 : 12 : warning_at (loc, 0, "conversion to void will not access "
1351 : : "object of incomplete type %qT", type);
1352 : 12 : break;
1353 : 0 : case ICV_SECOND_OF_COND:
1354 : 0 : warning_at (loc, 0, "indirection will not access object of "
1355 : : "incomplete type %qT in second operand "
1356 : : "of conditional expression", type);
1357 : 0 : break;
1358 : 0 : case ICV_THIRD_OF_COND:
1359 : 0 : warning_at (loc, 0, "indirection will not access object of "
1360 : : "incomplete type %qT in third operand "
1361 : : "of conditional expression", type);
1362 : 0 : break;
1363 : 0 : case ICV_RIGHT_OF_COMMA:
1364 : 0 : warning_at (loc, 0, "indirection will not access object of "
1365 : : "incomplete type %qT in right operand of "
1366 : : "comma operator", type);
1367 : 0 : break;
1368 : 0 : case ICV_LEFT_OF_COMMA:
1369 : 0 : warning_at (loc, 0, "indirection will not access object of "
1370 : : "incomplete type %qT in left operand of "
1371 : : "comma operator", type);
1372 : 0 : break;
1373 : 6 : case ICV_STATEMENT:
1374 : 6 : warning_at (loc, 0, "indirection will not access object of "
1375 : : "incomplete type %qT in statement", type);
1376 : 6 : break;
1377 : 0 : case ICV_THIRD_IN_FOR:
1378 : 0 : warning_at (loc, 0, "indirection will not access object of "
1379 : : "incomplete type %qT in for increment "
1380 : : "expression", type);
1381 : 0 : break;
1382 : 0 : default:
1383 : 0 : gcc_unreachable ();
1384 : : }
1385 : : }
1386 : 334799 : else if (is_volatile && TREE_ADDRESSABLE (type))
1387 : : {
1388 : 3 : if (complain & tf_warning)
1389 : 3 : switch (implicit)
1390 : : {
1391 : 0 : case ICV_CAST:
1392 : 0 : warning_at (loc, 0, "conversion to void will not access "
1393 : : "object of non-trivially-copyable type %qT",
1394 : : type);
1395 : 0 : break;
1396 : 0 : case ICV_SECOND_OF_COND:
1397 : 0 : warning_at (loc, 0, "indirection will not access object of "
1398 : : "non-trivially-copyable type %qT in second "
1399 : : "operand of conditional expression", type);
1400 : 0 : break;
1401 : 0 : case ICV_THIRD_OF_COND:
1402 : 0 : warning_at (loc, 0, "indirection will not access object of "
1403 : : "non-trivially-copyable type %qT in third "
1404 : : "operand of conditional expression", type);
1405 : 0 : break;
1406 : 0 : case ICV_RIGHT_OF_COMMA:
1407 : 0 : warning_at (loc, 0, "indirection will not access object of "
1408 : : "non-trivially-copyable type %qT in right "
1409 : : "operand of comma operator", type);
1410 : 0 : break;
1411 : 0 : case ICV_LEFT_OF_COMMA:
1412 : 0 : warning_at (loc, 0, "indirection will not access object of "
1413 : : "non-trivially-copyable type %qT in left "
1414 : : "operand of comma operator", type);
1415 : 0 : break;
1416 : 3 : case ICV_STATEMENT:
1417 : 3 : warning_at (loc, 0, "indirection will not access object of "
1418 : : "non-trivially-copyable type %qT in statement",
1419 : : type);
1420 : 3 : break;
1421 : 0 : case ICV_THIRD_IN_FOR:
1422 : 0 : warning_at (loc, 0, "indirection will not access object of "
1423 : : "non-trivially-copyable type %qT in for "
1424 : : "increment expression", type);
1425 : 0 : break;
1426 : 0 : default:
1427 : 0 : gcc_unreachable ();
1428 : : }
1429 : : }
1430 : 334817 : if (!is_volatile || !is_complete || TREE_ADDRESSABLE (type))
1431 : : {
1432 : : /* Emit a warning (if enabled) when the "effect-less" INDIRECT_REF
1433 : : operation is stripped off. Note that we don't warn about
1434 : : - an expression with TREE_NO_WARNING set. (For an example of
1435 : : such expressions, see build_over_call in call.cc.)
1436 : : - automatic dereferencing of references, since the user cannot
1437 : : control it. (See also warn_if_unused_value() in c-common.cc.) */
1438 : 334706 : if (warn_unused_value
1439 : 2418 : && implicit != ICV_CAST
1440 : 1588 : && (complain & tf_warning)
1441 : 9 : && !warning_suppressed_p (expr, OPT_Wunused_value)
1442 : 334706 : && !is_reference)
1443 : 9 : warning_at (loc, OPT_Wunused_value, "value computed is not used");
1444 : 334706 : expr = TREE_OPERAND (expr, 0);
1445 : : }
1446 : :
1447 : : break;
1448 : : }
1449 : :
1450 : 21980 : case VAR_DECL:
1451 : 21980 : {
1452 : : /* External variables might be incomplete. */
1453 : 21980 : tree type = TREE_TYPE (expr);
1454 : :
1455 : 21980 : if (TYPE_VOLATILE (type)
1456 : 138 : && !COMPLETE_TYPE_P (complete_type (type))
1457 : 21995 : && (complain & tf_warning))
1458 : 15 : switch (implicit)
1459 : : {
1460 : 12 : case ICV_CAST:
1461 : 12 : warning_at (loc, 0, "conversion to void will not access "
1462 : : "object %qE of incomplete type %qT", expr, type);
1463 : 12 : break;
1464 : 0 : case ICV_SECOND_OF_COND:
1465 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1466 : : "not be accessed in second operand of "
1467 : : "conditional expression", expr, type);
1468 : 0 : break;
1469 : 0 : case ICV_THIRD_OF_COND:
1470 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1471 : : "not be accessed in third operand of "
1472 : : "conditional expression", expr, type);
1473 : 0 : break;
1474 : 0 : case ICV_RIGHT_OF_COMMA:
1475 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1476 : : "not be accessed in right operand of comma operator",
1477 : : expr, type);
1478 : 0 : break;
1479 : 0 : case ICV_LEFT_OF_COMMA:
1480 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1481 : : "not be accessed in left operand of comma operator",
1482 : : expr, type);
1483 : 0 : break;
1484 : 3 : case ICV_STATEMENT:
1485 : 3 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1486 : : "not be accessed in statement", expr, type);
1487 : 3 : break;
1488 : 0 : case ICV_THIRD_IN_FOR:
1489 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1490 : : "not be accessed in for increment expression",
1491 : : expr, type);
1492 : 0 : break;
1493 : 0 : default:
1494 : 0 : gcc_unreachable ();
1495 : : }
1496 : :
1497 : : break;
1498 : : }
1499 : :
1500 : 975808 : case TARGET_EXPR:
1501 : : /* Don't bother with the temporary object returned from a function if
1502 : : we don't use it, don't need to destroy it, and won't abort in
1503 : : assign_temp. We'll still
1504 : : allocate space for it in expand_call or declare_return_variable,
1505 : : but we don't need to track it through all the tree phases. */
1506 : 975808 : if (TARGET_EXPR_IMPLICIT_P (expr)
1507 : 975808 : && !TREE_ADDRESSABLE (TREE_TYPE (expr)))
1508 : : {
1509 : 482704 : tree init = TARGET_EXPR_INITIAL (expr);
1510 : 482704 : if (TREE_CODE (init) == AGGR_INIT_EXPR
1511 : 482704 : && !AGGR_INIT_VIA_CTOR_P (init))
1512 : : {
1513 : 0 : tree fn = AGGR_INIT_EXPR_FN (init);
1514 : 0 : expr = build_call_array_loc (input_location,
1515 : 0 : TREE_TYPE (TREE_TYPE
1516 : : (TREE_TYPE (fn))),
1517 : : fn,
1518 : 0 : aggr_init_expr_nargs (init),
1519 : 0 : AGGR_INIT_EXPR_ARGP (init));
1520 : : }
1521 : : }
1522 : 975808 : if (complain & tf_warning)
1523 : 53264 : maybe_warn_nodiscard (expr, implicit);
1524 : : break;
1525 : :
1526 : 230 : case CO_AWAIT_EXPR:
1527 : 230 : if (auto awr = co_await_get_resume_call (expr))
1528 : 218 : convert_to_void (awr, implicit, complain);
1529 : : break;
1530 : :
1531 : 53854622 : default:;
1532 : : }
1533 : 53854622 : expr = resolve_nondeduced_context (expr, complain);
1534 : 53854622 : if (!mark_single_function (expr, complain))
1535 : 3 : return error_mark_node;
1536 : :
1537 : 53854619 : {
1538 : 53854619 : tree probe = expr;
1539 : :
1540 : 53854619 : if (TREE_CODE (probe) == ADDR_EXPR)
1541 : 343 : probe = TREE_OPERAND (expr, 0);
1542 : 53854619 : if (type_unknown_p (probe))
1543 : : {
1544 : : /* [over.over] enumerates the places where we can take the address
1545 : : of an overloaded function, and this is not one of them. */
1546 : 55 : if (complain & tf_error)
1547 : 36 : switch (implicit)
1548 : : {
1549 : 12 : case ICV_CAST:
1550 : 12 : error_at (loc, "conversion to void "
1551 : : "cannot resolve address of overloaded function");
1552 : 12 : break;
1553 : 0 : case ICV_SECOND_OF_COND:
1554 : 0 : error_at (loc, "second operand of conditional expression "
1555 : : "cannot resolve address of overloaded function");
1556 : 0 : break;
1557 : 0 : case ICV_THIRD_OF_COND:
1558 : 0 : error_at (loc, "third operand of conditional expression "
1559 : : "cannot resolve address of overloaded function");
1560 : 0 : break;
1561 : 0 : case ICV_RIGHT_OF_COMMA:
1562 : 0 : error_at (loc, "right operand of comma operator "
1563 : : "cannot resolve address of overloaded function");
1564 : 0 : break;
1565 : 0 : case ICV_LEFT_OF_COMMA:
1566 : 0 : error_at (loc, "left operand of comma operator "
1567 : : "cannot resolve address of overloaded function");
1568 : 0 : break;
1569 : 24 : case ICV_STATEMENT:
1570 : 24 : error_at (loc, "statement "
1571 : : "cannot resolve address of overloaded function");
1572 : 24 : break;
1573 : 0 : case ICV_THIRD_IN_FOR:
1574 : 0 : error_at (loc, "for increment expression "
1575 : : "cannot resolve address of overloaded function");
1576 : 0 : break;
1577 : : }
1578 : : else
1579 : 19 : return error_mark_node;
1580 : 36 : expr = void_node;
1581 : : }
1582 : 53854564 : else if (implicit != ICV_CAST && probe == expr && is_overloaded_fn (probe))
1583 : : {
1584 : : /* Only warn when there is no &. */
1585 : 108 : if (complain & tf_warning)
1586 : 108 : switch (implicit)
1587 : : {
1588 : 3 : case ICV_SECOND_OF_COND:
1589 : 3 : warning_at (loc, OPT_Waddress,
1590 : : "second operand of conditional expression "
1591 : : "is a reference, not call, to function %qE", expr);
1592 : 3 : break;
1593 : 3 : case ICV_THIRD_OF_COND:
1594 : 3 : warning_at (loc, OPT_Waddress,
1595 : : "third operand of conditional expression "
1596 : : "is a reference, not call, to function %qE", expr);
1597 : 3 : break;
1598 : 0 : case ICV_RIGHT_OF_COMMA:
1599 : 0 : warning_at (loc, OPT_Waddress,
1600 : : "right operand of comma operator "
1601 : : "is a reference, not call, to function %qE", expr);
1602 : 0 : break;
1603 : 9 : case ICV_LEFT_OF_COMMA:
1604 : 9 : warning_at (loc, OPT_Waddress,
1605 : : "left operand of comma operator "
1606 : : "is a reference, not call, to function %qE", expr);
1607 : 9 : break;
1608 : 93 : case ICV_STATEMENT:
1609 : 93 : warning_at (loc, OPT_Waddress,
1610 : : "statement is a reference, not call, to function %qE",
1611 : : expr);
1612 : 93 : break;
1613 : 0 : case ICV_THIRD_IN_FOR:
1614 : 0 : warning_at (loc, OPT_Waddress,
1615 : : "for increment expression "
1616 : : "is a reference, not call, to function %qE", expr);
1617 : 0 : break;
1618 : 0 : default:
1619 : 0 : gcc_unreachable ();
1620 : : }
1621 : :
1622 : 108 : if (TREE_CODE (expr) == COMPONENT_REF)
1623 : 9 : expr = TREE_OPERAND (expr, 0);
1624 : : }
1625 : : }
1626 : :
1627 : 53854600 : if (expr != error_mark_node && !VOID_TYPE_P (TREE_TYPE (expr)))
1628 : : {
1629 : 53337171 : if (implicit != ICV_CAST
1630 : 52691991 : && warn_unused_value
1631 : 647831 : && !warning_suppressed_p (expr, OPT_Wunused_value)
1632 : 645914 : && !processing_template_decl
1633 : 516610 : && !cp_unevaluated_operand
1634 : 53816638 : && (complain & tf_warning))
1635 : : {
1636 : : /* The middle end does not warn about expressions that have
1637 : : been explicitly cast to void, so we must do so here. */
1638 : 478294 : if (!TREE_SIDE_EFFECTS (expr))
1639 : : {
1640 : 96 : switch (implicit)
1641 : : {
1642 : 3 : case ICV_SECOND_OF_COND:
1643 : 3 : warning_at (loc, OPT_Wunused_value,
1644 : : "second operand of conditional expression "
1645 : : "has no effect");
1646 : 3 : break;
1647 : 3 : case ICV_THIRD_OF_COND:
1648 : 3 : warning_at (loc, OPT_Wunused_value,
1649 : : "third operand of conditional expression "
1650 : : "has no effect");
1651 : 3 : break;
1652 : 39 : case ICV_RIGHT_OF_COMMA:
1653 : 39 : warning_at (loc, OPT_Wunused_value,
1654 : : "right operand of comma operator has no effect");
1655 : 39 : break;
1656 : 12 : case ICV_LEFT_OF_COMMA:
1657 : 12 : warning_at (loc, OPT_Wunused_value,
1658 : : "left operand of comma operator has no effect");
1659 : 12 : break;
1660 : 39 : case ICV_STATEMENT:
1661 : 39 : warning_at (loc, OPT_Wunused_value,
1662 : : "statement has no effect");
1663 : 36 : break;
1664 : 0 : case ICV_THIRD_IN_FOR:
1665 : 0 : warning_at (loc, OPT_Wunused_value,
1666 : : "for increment expression has no effect");
1667 : 0 : break;
1668 : 0 : default:
1669 : 0 : gcc_unreachable ();
1670 : : }
1671 : : }
1672 : : else
1673 : : {
1674 : : tree e = expr;
1675 : : /* We might like to warn about (say) "(int) f()", as the
1676 : : cast has no effect, but the compiler itself will
1677 : : generate implicit conversions under some
1678 : : circumstances. (For example a block copy will be
1679 : : turned into a call to "__builtin_memcpy", with a
1680 : : conversion of the return value to an appropriate
1681 : : type.) So, to avoid false positives, we strip
1682 : : conversions. Do not use STRIP_NOPs because it will
1683 : : not strip conversions to "void", as that is not a
1684 : : mode-preserving conversion. */
1685 : 478532 : while (TREE_CODE (e) == NOP_EXPR)
1686 : 334 : e = TREE_OPERAND (e, 0);
1687 : :
1688 : 478198 : enum tree_code code = TREE_CODE (e);
1689 : 478198 : enum tree_code_class tclass = TREE_CODE_CLASS (code);
1690 : 478198 : if (tclass == tcc_comparison
1691 : : || tclass == tcc_unary
1692 : 478198 : || tclass == tcc_binary
1693 : 478123 : || code == TRUTH_NOT_EXPR
1694 : 478123 : || code == ADDR_EXPR
1695 : : || code == VEC_PERM_EXPR
1696 : 478116 : || code == VEC_COND_EXPR)
1697 : 88 : warn_if_unused_value (e, loc);
1698 : : }
1699 : : }
1700 : 53337168 : expr = build1 (CONVERT_EXPR, void_type_node, expr);
1701 : : }
1702 : 53854597 : if (! TREE_SIDE_EFFECTS (expr))
1703 : 1896146 : expr = void_node;
1704 : : return expr;
1705 : : }
1706 : :
1707 : : /* Create an expression whose value is that of EXPR,
1708 : : converted to type TYPE. The TREE_TYPE of the value
1709 : : is always TYPE. This function implements all reasonable
1710 : : conversions; callers should filter out those that are
1711 : : not permitted by the language being compiled.
1712 : :
1713 : : Most of this routine is from build_reinterpret_cast.
1714 : :
1715 : : The back end cannot call cp_convert (what was convert) because
1716 : : conversions to/from basetypes may involve memory references
1717 : : (vbases) and adding or subtracting small values (multiple
1718 : : inheritance), but it calls convert from the constant folding code
1719 : : on subtrees of already built trees after it has ripped them apart.
1720 : :
1721 : : Also, if we ever support range variables, we'll probably also have to
1722 : : do a little bit more work. */
1723 : :
1724 : : tree
1725 : 169161389 : convert (tree type, tree expr)
1726 : : {
1727 : 169161389 : tree intype;
1728 : :
1729 : 169161389 : if (type == error_mark_node || expr == error_mark_node)
1730 : : return error_mark_node;
1731 : :
1732 : 169159182 : intype = TREE_TYPE (expr);
1733 : :
1734 : 169159182 : if (INDIRECT_TYPE_P (type) && INDIRECT_TYPE_P (intype))
1735 : 37333703 : return build_nop (type, expr);
1736 : :
1737 : 131825479 : return ocp_convert (type, expr, CONV_BACKEND_CONVERT,
1738 : : LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
1739 : 131825479 : tf_warning_or_error);
1740 : : }
1741 : :
1742 : : /* Like convert, but in a static initializer (called from
1743 : : convert_and_check). */
1744 : :
1745 : : tree
1746 : 0 : convert_init (tree type, tree expr)
1747 : : {
1748 : 0 : return convert (type, expr);
1749 : : }
1750 : :
1751 : : /* Like cp_convert, except permit conversions to take place which
1752 : : are not normally allowed due to access restrictions
1753 : : (such as conversion from sub-type to private super-type). */
1754 : :
1755 : : tree
1756 : 7891663 : convert_force (tree type, tree expr, int convtype, tsubst_flags_t complain)
1757 : : {
1758 : 7891663 : tree e = expr;
1759 : 7891663 : enum tree_code code = TREE_CODE (type);
1760 : :
1761 : 7891663 : if (code == REFERENCE_TYPE)
1762 : 0 : return convert_to_reference (type, e, CONV_C_CAST, 0,
1763 : 0 : NULL_TREE, complain);
1764 : :
1765 : 7891663 : if (code == POINTER_TYPE)
1766 : 7891663 : return convert_to_pointer_force (type, e, complain);
1767 : :
1768 : : /* From typeck.cc convert_for_assignment */
1769 : 0 : if (((TYPE_PTR_P (TREE_TYPE (e)) && TREE_CODE (e) == ADDR_EXPR
1770 : 0 : && TREE_CODE (TREE_TYPE (TREE_TYPE (e))) == METHOD_TYPE)
1771 : 0 : || integer_zerop (e)
1772 : 0 : || TYPE_PTRMEMFUNC_P (TREE_TYPE (e)))
1773 : 0 : && TYPE_PTRMEMFUNC_P (type))
1774 : : /* compatible pointer to member functions. */
1775 : 0 : return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), e, 1,
1776 : 0 : /*c_cast_p=*/1, complain);
1777 : :
1778 : 0 : return ocp_convert (type, e, CONV_C_CAST|convtype, LOOKUP_NORMAL, complain);
1779 : : }
1780 : :
1781 : : /* Convert an aggregate EXPR to type XTYPE. If a conversion
1782 : : exists, return the attempted conversion. This may
1783 : : return ERROR_MARK_NODE if the conversion is not
1784 : : allowed (references private members, etc).
1785 : : If no conversion exists, NULL_TREE is returned.
1786 : :
1787 : : FIXME: Ambiguity checking is wrong. Should choose one by the implicit
1788 : : object parameter, or by the second standard conversion sequence if
1789 : : that doesn't do it. This will probably wait for an overloading rewrite.
1790 : : (jason 8/9/95) */
1791 : :
1792 : : static tree
1793 : 12 : build_type_conversion (tree xtype, tree expr)
1794 : : {
1795 : : /* C++: check to see if we can convert this aggregate type
1796 : : into the required type. */
1797 : 12 : return build_user_type_conversion (xtype, expr, LOOKUP_NORMAL,
1798 : 0 : tf_warning_or_error);
1799 : : }
1800 : :
1801 : : /* Convert the given EXPR to one of a group of types suitable for use in an
1802 : : expression. DESIRES is a combination of various WANT_* flags (q.v.)
1803 : : which indicates which types are suitable. If COMPLAIN is true, complain
1804 : : about ambiguity; otherwise, the caller will deal with it. */
1805 : :
1806 : : tree
1807 : 58287753 : build_expr_type_conversion (int desires, tree expr, bool complain)
1808 : : {
1809 : 58287753 : tree basetype = TREE_TYPE (expr);
1810 : 58287753 : tree conv = NULL_TREE;
1811 : 58287753 : tree winner = NULL_TREE;
1812 : :
1813 : 58287753 : if (null_node_p (expr)
1814 : 45 : && (desires & WANT_INT)
1815 : 58287789 : && !(desires & WANT_NULL))
1816 : : {
1817 : 36 : location_t loc =
1818 : 36 : expansion_point_location_if_in_system_header (input_location);
1819 : :
1820 : 36 : warning_at (loc, OPT_Wconversion_null,
1821 : : "converting NULL to non-pointer type");
1822 : : }
1823 : :
1824 : 58287753 : if (basetype == error_mark_node)
1825 : : return error_mark_node;
1826 : :
1827 : 58287741 : if (! MAYBE_CLASS_TYPE_P (basetype))
1828 : 58287539 : switch (TREE_CODE (basetype))
1829 : : {
1830 : 49092080 : case INTEGER_TYPE:
1831 : 49092080 : if ((desires & WANT_NULL) && null_ptr_cst_p (expr))
1832 : : return expr;
1833 : : /* fall through. */
1834 : :
1835 : 49127074 : case BOOLEAN_TYPE:
1836 : 52123579 : return (desires & WANT_INT) ? expr : NULL_TREE;
1837 : 83260 : case ENUMERAL_TYPE:
1838 : 84896 : return (desires & WANT_ENUM) ? expr : NULL_TREE;
1839 : 1807984 : case REAL_TYPE:
1840 : 1808024 : return (desires & WANT_FLOAT) ? expr : NULL_TREE;
1841 : 6148732 : case POINTER_TYPE:
1842 : 8059996 : return (desires & WANT_POINTER) ? expr : NULL_TREE;
1843 : :
1844 : 1049695 : case FUNCTION_TYPE:
1845 : 1049695 : case ARRAY_TYPE:
1846 : 1049695 : return (desires & WANT_POINTER) ? decay_conversion (expr,
1847 : : tf_warning_or_error)
1848 : : : NULL_TREE;
1849 : :
1850 : 55374 : case VECTOR_TYPE:
1851 : 55374 : if (!gnu_vector_type_p (basetype))
1852 : : return NULL_TREE;
1853 : : /* FALLTHROUGH */
1854 : 70734 : case COMPLEX_TYPE:
1855 : 70734 : if ((desires & WANT_VECTOR_OR_COMPLEX) == 0)
1856 : : return NULL_TREE;
1857 : 33283 : switch (TREE_CODE (TREE_TYPE (basetype)))
1858 : : {
1859 : 400 : case INTEGER_TYPE:
1860 : 400 : case BOOLEAN_TYPE:
1861 : 400 : return (desires & WANT_INT) ? expr : NULL_TREE;
1862 : 0 : case ENUMERAL_TYPE:
1863 : 0 : return (desires & WANT_ENUM) ? expr : NULL_TREE;
1864 : 32883 : case REAL_TYPE:
1865 : 32889 : return (desires & WANT_FLOAT) ? expr : NULL_TREE;
1866 : : default:
1867 : : return NULL_TREE;
1868 : : }
1869 : :
1870 : : default:
1871 : : return NULL_TREE;
1872 : : }
1873 : :
1874 : : /* The code for conversions from class type is currently only used for
1875 : : delete expressions. Other expressions are handled by build_new_op. */
1876 : 202 : if (!complete_type_or_maybe_complain (basetype, expr, complain))
1877 : 0 : return error_mark_node;
1878 : 202 : if (!TYPE_HAS_CONVERSION (basetype))
1879 : : return NULL_TREE;
1880 : :
1881 : 407 : for (conv = lookup_conversions (basetype); conv; conv = TREE_CHAIN (conv))
1882 : : {
1883 : 220 : int win = 0;
1884 : 220 : tree candidate;
1885 : 220 : tree cand = TREE_VALUE (conv);
1886 : 220 : cand = OVL_FIRST (cand);
1887 : :
1888 : 220 : if (winner && winner == cand)
1889 : 0 : continue;
1890 : :
1891 : 220 : if (DECL_NONCONVERTING_P (cand))
1892 : 3 : continue;
1893 : :
1894 : 217 : candidate = non_reference (TREE_TYPE (TREE_TYPE (cand)));
1895 : :
1896 : 217 : switch (TREE_CODE (candidate))
1897 : : {
1898 : 160 : case BOOLEAN_TYPE:
1899 : 160 : case INTEGER_TYPE:
1900 : 160 : win = (desires & WANT_INT); break;
1901 : 15 : case ENUMERAL_TYPE:
1902 : 15 : win = (desires & WANT_ENUM); break;
1903 : 3 : case REAL_TYPE:
1904 : 3 : win = (desires & WANT_FLOAT); break;
1905 : 36 : case POINTER_TYPE:
1906 : 36 : win = (desires & WANT_POINTER); break;
1907 : :
1908 : 0 : case COMPLEX_TYPE:
1909 : 0 : case VECTOR_TYPE:
1910 : 0 : if ((desires & WANT_VECTOR_OR_COMPLEX) == 0)
1911 : : break;
1912 : 0 : switch (TREE_CODE (TREE_TYPE (candidate)))
1913 : : {
1914 : 0 : case BOOLEAN_TYPE:
1915 : 0 : case INTEGER_TYPE:
1916 : 0 : win = (desires & WANT_INT); break;
1917 : 0 : case ENUMERAL_TYPE:
1918 : 0 : win = (desires & WANT_ENUM); break;
1919 : 0 : case REAL_TYPE:
1920 : 0 : win = (desires & WANT_FLOAT); break;
1921 : : default:
1922 : : break;
1923 : : }
1924 : : break;
1925 : :
1926 : 3 : default:
1927 : : /* A wildcard could be instantiated to match any desired
1928 : : type, but we can't deduce the template argument. */
1929 : 3 : if (WILDCARD_TYPE_P (candidate))
1930 : : win = true;
1931 : : break;
1932 : : }
1933 : :
1934 : 214 : if (win)
1935 : : {
1936 : 205 : if (TREE_CODE (cand) == TEMPLATE_DECL)
1937 : : {
1938 : 6 : if (complain)
1939 : 6 : error ("default type conversion cannot deduce template"
1940 : : " argument for %qD", cand);
1941 : 6 : return error_mark_node;
1942 : : }
1943 : :
1944 : 199 : if (winner)
1945 : : {
1946 : 15 : tree winner_type
1947 : 15 : = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1948 : :
1949 : 15 : if (!same_type_ignoring_top_level_qualifiers_p (winner_type,
1950 : : candidate))
1951 : : {
1952 : 3 : if (complain)
1953 : : {
1954 : 3 : auto_diagnostic_group d;
1955 : 3 : error ("ambiguous default type conversion from %qT",
1956 : : basetype);
1957 : 3 : inform (input_location,
1958 : : " candidate conversions include %qD and %qD",
1959 : : winner, cand);
1960 : 3 : }
1961 : 3 : return error_mark_node;
1962 : : }
1963 : : }
1964 : :
1965 : : winner = cand;
1966 : : }
1967 : : }
1968 : :
1969 : 187 : if (winner)
1970 : : {
1971 : 181 : tree type = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1972 : 181 : return build_user_type_conversion (type, expr, LOOKUP_NORMAL,
1973 : 181 : tf_warning_or_error);
1974 : : }
1975 : :
1976 : : return NULL_TREE;
1977 : : }
1978 : :
1979 : : /* Implements integral promotion (4.1) and float->double promotion. */
1980 : :
1981 : : tree
1982 : 320559483 : type_promotes_to (tree type)
1983 : : {
1984 : 326619716 : tree promoted_type;
1985 : :
1986 : 326619716 : if (type == error_mark_node)
1987 : : return error_mark_node;
1988 : :
1989 : 326619716 : type = TYPE_MAIN_VARIANT (type);
1990 : :
1991 : : /* Check for promotions of target-defined types first. */
1992 : 326619716 : promoted_type = targetm.promoted_type (type);
1993 : 326619716 : if (promoted_type)
1994 : : return promoted_type;
1995 : :
1996 : : /* bool always promotes to int (not unsigned), even if it's the same
1997 : : size. */
1998 : 326619716 : if (TREE_CODE (type) == BOOLEAN_TYPE)
1999 : 3812235 : type = integer_type_node;
2000 : :
2001 : : /* Normally convert enums to int, but convert wide enums to something
2002 : : wider. Scoped enums don't promote, but pretend they do for backward
2003 : : ABI bug compatibility wrt varargs. */
2004 : 322807481 : else if (TREE_CODE (type) == ENUMERAL_TYPE
2005 : 302705168 : || type == char8_type_node
2006 : 302626210 : || type == char16_type_node
2007 : 302388430 : || type == char32_type_node
2008 : 301963852 : || type == wchar_type_node)
2009 : : {
2010 : 21805131 : tree prom = type;
2011 : :
2012 : 21805131 : if (TREE_CODE (type) == ENUMERAL_TYPE)
2013 : : {
2014 : 20102313 : prom = ENUM_UNDERLYING_TYPE (prom);
2015 : 20102313 : if (!ENUM_IS_SCOPED (type)
2016 : 20102313 : && ENUM_FIXED_UNDERLYING_TYPE_P (type))
2017 : : {
2018 : : /* ISO C++17, 7.6/4. A prvalue of an unscoped enumeration type
2019 : : whose underlying type is fixed (10.2) can be converted to a
2020 : : prvalue of its underlying type. Moreover, if integral promotion
2021 : : can be applied to its underlying type, a prvalue of an unscoped
2022 : : enumeration type whose underlying type is fixed can also be
2023 : : converted to a prvalue of the promoted underlying type. */
2024 : : return type_promotes_to (prom);
2025 : : }
2026 : : }
2027 : :
2028 : 15744898 : int precision = MAX (TYPE_PRECISION (type),
2029 : : TYPE_PRECISION (integer_type_node));
2030 : 15744898 : tree totype = c_common_type_for_size (precision, 0);
2031 : 15744898 : if (TYPE_UNSIGNED (prom)
2032 : 15744898 : && ! int_fits_type_p (TYPE_MAX_VALUE (prom), totype))
2033 : 726988 : prom = c_common_type_for_size (precision, 1);
2034 : : else
2035 : : prom = totype;
2036 : 15744898 : if (SCOPED_ENUM_P (type))
2037 : : {
2038 : 63 : if (abi_version_crosses (6)
2039 : 33 : && TYPE_MODE (prom) != TYPE_MODE (type))
2040 : 60 : warning (OPT_Wabi, "scoped enum %qT passed through %<...%> as "
2041 : : "%qT before %<-fabi-version=6%>, %qT after",
2042 : 30 : type, prom, ENUM_UNDERLYING_TYPE (type));
2043 : 33 : if (!abi_version_at_least (6))
2044 : 15744868 : type = prom;
2045 : : }
2046 : : else
2047 : : type = prom;
2048 : : }
2049 : 301002350 : else if (c_promoting_integer_type_p (type))
2050 : : {
2051 : : /* Retain unsignedness if really not getting bigger. */
2052 : 8410206 : if (TYPE_UNSIGNED (type)
2053 : 8410206 : && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
2054 : 0 : type = unsigned_type_node;
2055 : : else
2056 : 8410206 : type = integer_type_node;
2057 : : }
2058 : 292592144 : else if (type == float_type_node)
2059 : 11730786 : type = double_type_node;
2060 : :
2061 : : return type;
2062 : : }
2063 : :
2064 : : /* The routines below this point are carefully written to conform to
2065 : : the standard. They use the same terminology, and follow the rules
2066 : : closely. Although they are used only in pt.cc at the moment, they
2067 : : should presumably be used everywhere in the future. */
2068 : :
2069 : : /* True iff EXPR can be converted to TYPE via a qualification conversion.
2070 : : Callers should check for identical types before calling this function. */
2071 : :
2072 : : bool
2073 : 51 : can_convert_qual (tree type, tree expr)
2074 : : {
2075 : 51 : tree expr_type = TREE_TYPE (expr);
2076 : 51 : gcc_assert (!same_type_p (type, expr_type));
2077 : :
2078 : : /* A function pointer conversion also counts as a Qualification Adjustment
2079 : : under [over.ics.scs]. */
2080 : 51 : if (fnptr_conv_p (type, expr_type))
2081 : : return true;
2082 : :
2083 : 41 : if (TYPE_PTR_P (type) && TYPE_PTR_P (expr_type))
2084 : 8 : return comp_ptr_ttypes (TREE_TYPE (type), TREE_TYPE (expr_type));
2085 : 33 : else if (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (expr_type))
2086 : 32 : return (same_type_p (TYPE_PTRMEM_CLASS_TYPE (type),
2087 : : TYPE_PTRMEM_CLASS_TYPE (expr_type))
2088 : 61 : && comp_ptr_ttypes (TYPE_PTRMEM_POINTED_TO_TYPE (type),
2089 : 29 : TYPE_PTRMEM_POINTED_TO_TYPE (expr_type)));
2090 : : else
2091 : : return false;
2092 : : }
2093 : :
2094 : : /* Attempt to perform qualification conversions on EXPR to convert it
2095 : : to TYPE. Return the resulting expression, or error_mark_node if
2096 : : the conversion was impossible. Since this is only used by
2097 : : convert_nontype_argument, we fold the conversion. */
2098 : :
2099 : : tree
2100 : 1049 : perform_qualification_conversions (tree type, tree expr)
2101 : : {
2102 : 1049 : tree expr_type;
2103 : :
2104 : 1049 : expr_type = TREE_TYPE (expr);
2105 : :
2106 : 1049 : if (same_type_p (type, expr_type))
2107 : : return expr;
2108 : 21 : else if (can_convert_qual (type, expr))
2109 : 14 : return cp_fold_convert (type, expr);
2110 : : else
2111 : 7 : return error_mark_node;
2112 : : }
2113 : :
2114 : : /* True iff T is a transaction-safe function type. */
2115 : :
2116 : : bool
2117 : 7817651 : tx_safe_fn_type_p (tree t)
2118 : : {
2119 : 7817651 : if (!FUNC_OR_METHOD_TYPE_P (t))
2120 : : return false;
2121 : 7813296 : return !!lookup_attribute ("transaction_safe", TYPE_ATTRIBUTES (t));
2122 : : }
2123 : :
2124 : : /* Return the transaction-unsafe variant of transaction-safe function type
2125 : : T. */
2126 : :
2127 : : tree
2128 : 38 : tx_unsafe_fn_variant (tree t)
2129 : : {
2130 : 38 : gcc_assert (tx_safe_fn_type_p (t));
2131 : 38 : tree attrs = remove_attribute ("transaction_safe",
2132 : 38 : TYPE_ATTRIBUTES (t));
2133 : 38 : return cp_build_type_attribute_variant (t, attrs);
2134 : : }
2135 : :
2136 : : /* Return true iff FROM can convert to TO by a transaction-safety
2137 : : conversion. */
2138 : :
2139 : : static bool
2140 : 100593061 : can_convert_tx_safety (tree to, tree from)
2141 : : {
2142 : 3504 : return (flag_tm && tx_safe_fn_type_p (from)
2143 : 100593097 : && same_type_p (to, tx_unsafe_fn_variant (from)));
2144 : : }
2145 : :
2146 : : /* Return true iff FROM can convert to TO by dropping noexcept.
2147 : : This is just a subroutine of fnptr_conv_p. */
2148 : :
2149 : : static bool
2150 : 101081286 : noexcept_conv_p (tree to, tree from)
2151 : : {
2152 : 101081286 : if (!flag_noexcept_type)
2153 : : return false;
2154 : :
2155 : 100721058 : if (TREE_CODE (to) != TREE_CODE (from))
2156 : : return false;
2157 : 54026923 : if (!FUNC_OR_METHOD_TYPE_P (from))
2158 : : return false;
2159 : 2154074 : if (!type_throw_all_p (to)
2160 : 2154074 : || type_throw_all_p (from))
2161 : 95131 : return false;
2162 : 2058943 : tree v = build_exception_variant (from, NULL_TREE);
2163 : 2058943 : return same_type_p (to, v);
2164 : : }
2165 : :
2166 : : /* Return true iff FROM can convert to TO by a function pointer conversion. */
2167 : :
2168 : : bool
2169 : 101081286 : fnptr_conv_p (tree to, tree from)
2170 : : {
2171 : 101081286 : tree t = to;
2172 : 101081286 : tree f = from;
2173 : 1010 : if (TYPE_PTRMEMFUNC_P (t)
2174 : 101082296 : && TYPE_PTRMEMFUNC_P (f))
2175 : : {
2176 : 947 : t = TYPE_PTRMEMFUNC_FN_TYPE (t);
2177 : 947 : f = TYPE_PTRMEMFUNC_FN_TYPE (f);
2178 : : }
2179 : 101081286 : if (INDIRECT_TYPE_P (t)
2180 : 99154380 : && INDIRECT_TYPE_P (f))
2181 : : {
2182 : 99154369 : t = TREE_TYPE (t);
2183 : 99154369 : f = TREE_TYPE (f);
2184 : : }
2185 : :
2186 : 101081286 : return (noexcept_conv_p (t, f)
2187 : 101081286 : || can_convert_tx_safety (t, f));
2188 : : }
2189 : :
2190 : : /* Return FN with any NOP_EXPRs stripped that represent function pointer
2191 : : conversions or conversions to the same type. */
2192 : :
2193 : : tree
2194 : 916 : strip_fnptr_conv (tree fn)
2195 : : {
2196 : 935 : while (TREE_CODE (fn) == NOP_EXPR)
2197 : : {
2198 : 41 : tree op = TREE_OPERAND (fn, 0);
2199 : 41 : tree ft = TREE_TYPE (fn);
2200 : 41 : tree ot = TREE_TYPE (op);
2201 : 82 : if (same_type_p (ft, ot)
2202 : 41 : || fnptr_conv_p (ft, ot))
2203 : : fn = op;
2204 : : else
2205 : : break;
2206 : : }
2207 : 916 : return fn;
2208 : : }
|
