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 : 26694444 : cp_convert_to_pointer (tree type, tree expr, bool dofold,
77 : : tsubst_flags_t complain)
78 : : {
79 : 26694444 : tree intype = TREE_TYPE (expr);
80 : 26694444 : enum tree_code form;
81 : 26694444 : tree rval;
82 : 26694444 : location_t loc = cp_expr_loc_or_input_loc (expr);
83 : :
84 : 26694444 : if (intype == error_mark_node)
85 : : return error_mark_node;
86 : :
87 : 26694444 : 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 : 26694444 : if (TYPE_PTR_P (type)
111 : 26694444 : && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
112 : 26531138 : || VOID_TYPE_P (TREE_TYPE (type))))
113 : : {
114 : 12 : if (TYPE_PTRMEMFUNC_P (intype)
115 : 2160616 : || TREE_CODE (intype) == METHOD_TYPE)
116 : 9 : return convert_member_func_to_ptr (type, expr, complain);
117 : 2160604 : if (TYPE_PTR_P (TREE_TYPE (expr)))
118 : 1155739 : return build_nop (type, expr);
119 : 1004865 : intype = TREE_TYPE (expr);
120 : : }
121 : :
122 : 25538696 : if (expr == error_mark_node)
123 : : return error_mark_node;
124 : :
125 : 25538696 : form = TREE_CODE (intype);
126 : :
127 : 25538696 : if (INDIRECT_TYPE_P (intype))
128 : : {
129 : 17152825 : intype = TYPE_MAIN_VARIANT (intype);
130 : :
131 : 17152825 : if (TYPE_MAIN_VARIANT (type) != intype
132 : 11823533 : && TYPE_PTR_P (type)
133 : 11816533 : && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
134 : 5068590 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (type))
135 : 4989479 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype))
136 : 22066866 : && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE)
137 : : {
138 : 4914041 : enum tree_code code = PLUS_EXPR;
139 : 4914041 : tree binfo;
140 : 4914041 : tree intype_class;
141 : 4914041 : tree type_class;
142 : 4914041 : bool same_p;
143 : :
144 : 4914041 : intype_class = TREE_TYPE (intype);
145 : 4914041 : type_class = TREE_TYPE (type);
146 : :
147 : 4914041 : same_p = same_type_p (TYPE_MAIN_VARIANT (intype_class),
148 : : TYPE_MAIN_VARIANT (type_class));
149 : 4914041 : binfo = NULL_TREE;
150 : : /* Try derived to base conversion. */
151 : 4914041 : if (!same_p)
152 : 31625 : binfo = lookup_base (intype_class, type_class, ba_check,
153 : : NULL, complain);
154 : 4914041 : 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 : 4914041 : if (binfo == error_mark_node)
162 : : return error_mark_node;
163 : 4914032 : if (binfo || same_p)
164 : : {
165 : 4914032 : if (binfo)
166 : 31616 : expr = build_base_path (code, expr, binfo, 0, complain);
167 : : /* Add any qualifier conversions. */
168 : 4914032 : return build_nop (type, expr);
169 : : }
170 : : }
171 : :
172 : 12238784 : 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 : 12238784 : return build_nop (type, expr);
181 : : }
182 : 1572 : else if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
183 : 8387345 : || (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 : 8385758 : 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 : 8385758 : if (null_ptr_cst_p (expr))
208 : : {
209 : 5273211 : if (TYPE_PTRMEMFUNC_P (type))
210 : 749 : return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0,
211 : 749 : /*c_cast_p=*/false, complain);
212 : :
213 : 5272462 : if (complain & tf_warning)
214 : 3755130 : 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 : 5272462 : tree val = (TYPE_PTRDATAMEM_P (type)
219 : 5272462 : ? build_int_cst_type (type, -1)
220 : 5270988 : : build_int_cst (type, 0));
221 : :
222 : 5272462 : return (TREE_SIDE_EFFECTS (expr)
223 : 5272462 : ? build2 (COMPOUND_EXPR, type, expr, val) : val);
224 : : }
225 : 3112547 : 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 : 3112547 : if (INTEGRAL_CODE_P (form))
233 : : {
234 : 3128440 : if (TYPE_PRECISION (intype) == POINTER_SIZE)
235 : 3091897 : return build1 (CONVERT_EXPR, type, expr);
236 : 20644 : 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 : 61932 : 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 : 20644 : if (!dofold)
247 : 20644 : 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 : 7687774 : convert_to_pointer_force (tree type, tree expr, tsubst_flags_t complain)
267 : : {
268 : 7687774 : tree intype = TREE_TYPE (expr);
269 : 7687774 : enum tree_code form = TREE_CODE (intype);
270 : :
271 : 7687774 : if (form == POINTER_TYPE)
272 : : {
273 : 7687774 : intype = TYPE_MAIN_VARIANT (intype);
274 : :
275 : 7687774 : if (TYPE_MAIN_VARIANT (type) != intype
276 : 2358463 : && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
277 : 2358433 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (type))
278 : 2358430 : && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype))
279 : 10046204 : && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE)
280 : : {
281 : 2358430 : enum tree_code code = PLUS_EXPR;
282 : 2358430 : tree binfo;
283 : :
284 : 2358430 : binfo = lookup_base (TREE_TYPE (intype), TREE_TYPE (type),
285 : : ba_unique, NULL, complain);
286 : 2358430 : 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 : 2358430 : if (binfo == error_mark_node)
293 : : return error_mark_node;
294 : 2358430 : if (binfo)
295 : : {
296 : 2358427 : expr = build_base_path (code, expr, binfo, 0, complain);
297 : 2358427 : if (expr == error_mark_node)
298 : : return error_mark_node;
299 : : /* Add any qualifier conversions. */
300 : 2358427 : if (!same_type_p (TREE_TYPE (TREE_TYPE (expr)),
301 : : TREE_TYPE (type)))
302 : 383610 : expr = build_nop (type, expr);
303 : 2358427 : return expr;
304 : : }
305 : : }
306 : : }
307 : :
308 : 5329347 : 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 : 241 : build_up_reference (tree type, tree arg, int flags, tree decl,
321 : : tsubst_flags_t complain)
322 : : {
323 : 241 : tree rval;
324 : 241 : tree argtype = TREE_TYPE (arg);
325 : 241 : tree target_type = TREE_TYPE (type);
326 : :
327 : 241 : gcc_assert (TYPE_REF_P (type));
328 : :
329 : 241 : 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 : 241 : 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 : 240 : rval = cp_build_addr_expr (arg, complain);
349 : 240 : if (rval == error_mark_node)
350 : : return error_mark_node;
351 : :
352 : 240 : if ((flags & LOOKUP_PROTECT)
353 : 240 : && TYPE_MAIN_VARIANT (argtype) != TYPE_MAIN_VARIANT (target_type)
354 : 9 : && MAYBE_CLASS_TYPE_P (argtype)
355 : 249 : && 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 : 231 : rval
368 : 231 : = convert_to_pointer_force (build_pointer_type (target_type),
369 : : rval, complain);
370 : 240 : 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 : 243 : convert_to_reference (tree reftype, tree expr, int convtype,
417 : : int flags, tree decl, tsubst_flags_t complain)
418 : : {
419 : 243 : tree type = TYPE_MAIN_VARIANT (TREE_TYPE (reftype));
420 : 243 : tree intype;
421 : 243 : tree rval = NULL_TREE;
422 : 243 : tree rval_as_conversion = NULL_TREE;
423 : 243 : bool can_convert_intype_to_type;
424 : 243 : location_t loc = cp_expr_loc_or_input_loc (expr);
425 : :
426 : 243 : if (TREE_CODE (type) == FUNCTION_TYPE
427 : 243 : && TREE_TYPE (expr) == unknown_type_node)
428 : 0 : expr = instantiate_type (type, expr, complain);
429 : :
430 : 243 : if (expr == error_mark_node)
431 : : return error_mark_node;
432 : :
433 : 241 : intype = TREE_TYPE (expr);
434 : :
435 : 241 : gcc_assert (!TYPE_REF_P (intype));
436 : 241 : gcc_assert (TYPE_REF_P (reftype));
437 : :
438 : 241 : intype = TYPE_MAIN_VARIANT (intype);
439 : :
440 : 241 : can_convert_intype_to_type = can_convert_standard (type, intype, complain);
441 : :
442 : 241 : if (!can_convert_intype_to_type
443 : 4 : && (convtype & CONV_IMPLICIT) && MAYBE_CLASS_TYPE_P (intype)
444 : 241 : && ! (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 : 241 : rval_as_conversion = NULL_TREE;
456 : : intype = type;
457 : : can_convert_intype_to_type = 1;
458 : : }
459 : : }
460 : :
461 : 241 : if (((convtype & CONV_STATIC)
462 : 0 : && can_convert_standard (intype, type, complain))
463 : 241 : || ((convtype & CONV_IMPLICIT) && can_convert_intype_to_type))
464 : : {
465 : 237 : {
466 : 237 : tree ttl = TREE_TYPE (reftype);
467 : 237 : tree ttr = lvalue_type (expr);
468 : :
469 : 237 : if ((complain & tf_error)
470 : 237 : && ! lvalue_p (expr))
471 : 3 : diagnose_ref_binding (loc, reftype, intype, decl);
472 : :
473 : 237 : if (! (convtype & CONV_CONST)
474 : 237 : && !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 : 237 : 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 : 1752902751 : convert_from_reference (tree val)
537 : : {
538 : 1752902751 : if (TREE_TYPE (val)
539 : 1752902751 : && TYPE_REF_P (TREE_TYPE (val)))
540 : : {
541 : 198225655 : tree t = TREE_TYPE (TREE_TYPE (val));
542 : 198225655 : tree ref = build1 (INDIRECT_REF, t, val);
543 : :
544 : 198225655 : 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 : 198225655 : TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
549 : 198225655 : TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
550 : 198225655 : TREE_SIDE_EFFECTS (ref)
551 : 198225655 : = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (val));
552 : 198225655 : val = ref;
553 : : }
554 : :
555 : 1752902751 : 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 : 15219706 : force_rvalue (tree expr, tsubst_flags_t complain)
563 : : {
564 : 15219706 : tree type = TREE_TYPE (expr);
565 : 15219706 : if (MAYBE_CLASS_TYPE_P (type) && TREE_CODE (expr) != TARGET_EXPR)
566 : : {
567 : 138314 : releasing_vec args (make_tree_vector_single (expr));
568 : 138314 : expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
569 : : &args, type, LOOKUP_NORMAL, complain);
570 : 138314 : expr = build_cplus_new (type, expr, complain);
571 : 138314 : }
572 : : else
573 : 15081392 : expr = decay_conversion (expr, complain);
574 : :
575 : 15219706 : return expr;
576 : : }
577 : :
578 : : /* Force EXPR to be an lvalue, if it isn't already. */
579 : :
580 : : tree
581 : 245385 : force_lvalue (tree expr, tsubst_flags_t complain)
582 : : {
583 : 245385 : 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 : 245385 : 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 : 138209032 : ignore_overflows (tree expr, tree orig)
598 : : {
599 : 138209032 : tree stripped_expr = tree_strip_any_location_wrapper (expr);
600 : 138209032 : tree stripped_orig = tree_strip_any_location_wrapper (orig);
601 : :
602 : 138209032 : if (TREE_CODE (stripped_expr) == INTEGER_CST
603 : 89759411 : && TREE_CODE (stripped_orig) == INTEGER_CST
604 : 227965885 : && TREE_OVERFLOW (stripped_expr) != TREE_OVERFLOW (stripped_orig))
605 : : {
606 : 5276 : gcc_assert (!TREE_OVERFLOW (stripped_orig));
607 : : /* Ensure constant sharing. */
608 : 5276 : stripped_expr = wide_int_to_tree (TREE_TYPE (stripped_expr),
609 : 10552 : wi::to_wide (stripped_expr));
610 : : }
611 : :
612 : 138209032 : 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 : 30029231 : cp_fold_convert (tree type, tree expr)
621 : : {
622 : 30029231 : tree conv;
623 : 30029231 : if (TREE_TYPE (expr) == type)
624 : : conv = expr;
625 : 12208314 : else if (TREE_CODE (expr) == PTRMEM_CST
626 : 12208314 : && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type),
627 : : PTRMEM_CST_CLASS (expr)))
628 : : {
629 : : /* Avoid wrapping a PTRMEM_CST in NOP_EXPR. */
630 : 226 : conv = copy_node (expr);
631 : 226 : TREE_TYPE (conv) = type;
632 : : }
633 : 12208088 : 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 : 12208082 : conv = fold_convert (type, expr);
642 : 12208082 : conv = ignore_overflows (conv, expr);
643 : : }
644 : :
645 : 30029231 : if (TREE_CODE (expr) == TREE_CODE (conv))
646 : 18444608 : copy_warning (conv, expr);
647 : :
648 : 30029231 : return conv;
649 : : }
650 : :
651 : : /* C++ conversions, preference to static cast conversions. */
652 : :
653 : : tree
654 : 221858758 : cp_convert (tree type, tree expr, tsubst_flags_t complain)
655 : : {
656 : 221858758 : 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 : 61701048 : cp_convert_and_check (tree type, tree expr, tsubst_flags_t complain)
668 : : {
669 : 61701048 : tree result, expr_for_warning = expr;
670 : :
671 : 61701048 : if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
672 : 94 : expr = TREE_OPERAND (expr, 0);
673 : 61701048 : if (TREE_TYPE (expr) == type)
674 : : return expr;
675 : 61701035 : if (expr == error_mark_node)
676 : : return expr;
677 : 61701035 : result = cp_convert (type, expr, complain);
678 : :
679 : 61701035 : if ((complain & tf_warning)
680 : 57257540 : && c_inhibit_evaluation_warnings == 0)
681 : : {
682 : 56174251 : tree folded = cp_fully_fold (expr_for_warning);
683 : 56174251 : tree folded_result;
684 : 56174251 : if (folded == expr)
685 : : folded_result = result;
686 : : else
687 : : {
688 : : /* Avoid bogus -Wparentheses warnings. */
689 : 22971093 : warning_sentinel w (warn_parentheses);
690 : 22971093 : warning_sentinel c (warn_int_in_bool_context);
691 : 22971093 : folded_result = cp_convert (type, folded, tf_none);
692 : 22971093 : }
693 : 56174251 : folded_result = fold_simple (folded_result);
694 : 44605133 : if (!TREE_OVERFLOW_P (folded)
695 : 100779381 : && folded_result != error_mark_node)
696 : 87235951 : 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 : 353322161 : ocp_convert (tree type, tree expr, int convtype, int flags,
709 : : tsubst_flags_t complain)
710 : : {
711 : 353322161 : tree e = expr;
712 : 353322161 : enum tree_code code = TREE_CODE (type);
713 : 353322161 : const char *invalid_conv_diag;
714 : 353322161 : tree e1;
715 : 353322161 : location_t loc = cp_expr_loc_or_input_loc (expr);
716 : 353322161 : bool dofold = (convtype & CONV_FOLD);
717 : :
718 : 353322161 : if (error_operand_p (e) || type == error_mark_node)
719 : 104 : return error_mark_node;
720 : :
721 : 353322057 : if (TREE_CODE (e) == COMPOUND_EXPR)
722 : : {
723 : 450483 : e = ocp_convert (type, TREE_OPERAND (e, 1), convtype, flags, complain);
724 : 450483 : if (e == error_mark_node)
725 : : return error_mark_node;
726 : 450483 : if (e == TREE_OPERAND (expr, 1))
727 : : return expr;
728 : 450468 : e = build2_loc (EXPR_LOCATION (expr), COMPOUND_EXPR, TREE_TYPE (e),
729 : 450468 : TREE_OPERAND (expr, 0), e);
730 : 450468 : copy_warning (e, expr);
731 : 450468 : return e;
732 : : }
733 : :
734 : 352871574 : complete_type (type);
735 : 352871574 : complete_type (TREE_TYPE (expr));
736 : :
737 : 705743148 : if ((invalid_conv_diag
738 : 352871574 : = 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 : 352871574 : if (!CLASS_TYPE_P (type))
747 : : {
748 : 333462099 : e = mark_rvalue_use (e);
749 : 333462099 : tree v = scalar_constant_value (e);
750 : 333462099 : if (!error_operand_p (v))
751 : 333462038 : e = v;
752 : : }
753 : 352871574 : if (error_operand_p (e))
754 : 0 : return error_mark_node;
755 : :
756 : 352871574 : if (NULLPTR_TYPE_P (type) && null_ptr_cst_p (e))
757 : : {
758 : 7345 : if (complain & tf_warning)
759 : 3709 : maybe_warn_zero_as_null_pointer_constant (e, loc);
760 : :
761 : 7345 : if (!TREE_SIDE_EFFECTS (e))
762 : 7337 : return nullptr_node;
763 : : }
764 : :
765 : 352864237 : if (MAYBE_CLASS_TYPE_P (type) && (convtype & CONV_FORCE_TEMP))
766 : : /* We need a new temporary; don't take this shortcut. */;
767 : 351838440 : else if (same_type_ignoring_top_level_qualifiers_p (type, TREE_TYPE (e)))
768 : : {
769 : 176467680 : tree etype = TREE_TYPE (e);
770 : 176467680 : 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 : 15706025 : else if (TREE_CODE (type) == COMPLEX_TYPE)
781 : 0 : return convert_to_complex_maybe_fold (type, e, dofold);
782 : 15706025 : else if (VECTOR_TYPE_P (type))
783 : 3075 : return convert_to_vector (type, rvalue (e));
784 : 15702950 : 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 : 104531 : gcc_assert (same_type_ignoring_top_level_qualifiers_p (type, etype));
789 : 104531 : TREE_TYPE (e) = TREE_TYPE (TARGET_EXPR_SLOT (e)) = type;
790 : 104531 : return e;
791 : : }
792 : 15598419 : 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 : 15598414 : gcc_assert (!TREE_ADDRESSABLE (type));
803 : 15598414 : return build_nop (type, e);
804 : : }
805 : : }
806 : :
807 : 176396557 : e1 = targetm.convert_to_type (type, e);
808 : 176396557 : if (e1)
809 : : return e1;
810 : :
811 : 176396557 : if (code == VOID_TYPE && (convtype & CONV_STATIC))
812 : : {
813 : 9490 : e = convert_to_void (e, ICV_CAST, complain);
814 : 9490 : return e;
815 : : }
816 : :
817 : 176387067 : if (INTEGRAL_CODE_P (code))
818 : : {
819 : 133013649 : tree intype = TREE_TYPE (e);
820 : 133013649 : tree converted;
821 : :
822 : 133013649 : if (TREE_CODE (type) == ENUMERAL_TYPE)
823 : : {
824 : : /* enum = enum, enum = int, enum = float, (enum)pointer are all
825 : : errors. */
826 : 756369 : if (((INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
827 : 6 : || SCALAR_FLOAT_TYPE_P (intype))
828 : 756369 : && ! (convtype & CONV_STATIC))
829 : 756369 : || 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 : 756369 : tree val = fold_for_warn (e);
845 : 756369 : if ((complain & tf_warning)
846 : 755997 : && TREE_CODE (val) == INTEGER_CST
847 : 175813 : && ENUM_UNDERLYING_TYPE (type)
848 : 932179 : && !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 : 133013649 : 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 : 133013640 : if (code == BOOLEAN_TYPE)
865 : : {
866 : 7012690 : 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 : 7012672 : 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 : 7012672 : if (SCOPED_ENUM_P (intype) && (convtype & CONV_STATIC))
886 : 38 : e = build_nop (ENUM_UNDERLYING_TYPE (intype), e);
887 : 7012672 : if (complain & tf_warning)
888 : 4141919 : 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 : 2870753 : warning_sentinel w (warn_int_in_bool_context);
894 : 2870753 : warning_sentinel c (warn_sign_compare);
895 : 2870753 : return cp_truthvalue_conversion (e, complain);
896 : 2870753 : }
897 : : }
898 : :
899 : 126000950 : converted = convert_to_integer_maybe_fold (type, e, dofold);
900 : :
901 : : /* Ignore any integer overflow caused by the conversion. */
902 : 126000950 : return ignore_overflows (converted, e);
903 : : }
904 : 43373418 : if (INDIRECT_TYPE_P (type) || TYPE_PTRMEM_P (type))
905 : 21365097 : return cp_convert_to_pointer (type, e, dofold, complain);
906 : 22008321 : 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 : 22003929 : if (code == REAL_TYPE || code == COMPLEX_TYPE)
923 : : {
924 : 20978126 : 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 : 20978126 : if (code == REAL_TYPE)
936 : 20480582 : return convert_to_real_maybe_fold (type, e, dofold);
937 : 497544 : else if (code == COMPLEX_TYPE)
938 : 497544 : 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 : 1025803 : if (RECORD_OR_UNION_CODE_P (code))
945 : : {
946 : 1025797 : tree dtype = TREE_TYPE (e);
947 : 1025797 : tree ctor = NULL_TREE;
948 : :
949 : 1025797 : 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 : 1025797 : ctor = e;
959 : :
960 : 1025797 : if (abstract_virtuals_error (NULL_TREE, type, complain))
961 : 0 : return error_mark_node;
962 : :
963 : 1025797 : if (BRACE_ENCLOSED_INITIALIZER_P (ctor))
964 : 23722 : ctor = perform_implicit_conversion (type, ctor, complain);
965 : 1002075 : else if ((flags & LOOKUP_ONLYCONVERTING)
966 : 1002075 : && ! (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 : 21263 : ctor = build_user_type_conversion (type, ctor, flags, complain);
971 : : else
972 : : {
973 : 980812 : releasing_vec ctor_vec (make_tree_vector_single (ctor));
974 : 980812 : ctor = build_special_member_call (NULL_TREE,
975 : : complete_ctor_identifier,
976 : : &ctor_vec,
977 : : type, flags, complain);
978 : 980812 : }
979 : 1025797 : if (ctor)
980 : 1025621 : return build_cplus_new (type, ctor, complain);
981 : : }
982 : :
983 : 182 : 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 : 182 : if (invalid_nonstatic_memfn_p (loc, expr, complain))
988 : : /* We displayed the error message. */;
989 : : else
990 : 179 : error_at (loc, "conversion from %qH to non-scalar type %qI requested",
991 : 179 : TREE_TYPE (expr), type);
992 : : }
993 : 182 : return error_mark_node;
994 : : }
995 : :
996 : : /* If CALL is a call, return the callee; otherwise null. */
997 : :
998 : : tree
999 : 773057435 : cp_get_callee (tree call)
1000 : : {
1001 : 773057435 : if (call == NULL_TREE)
1002 : : return call;
1003 : 773057435 : else if (TREE_CODE (call) == CALL_EXPR)
1004 : 736651924 : return CALL_EXPR_FN (call);
1005 : 36405511 : else if (TREE_CODE (call) == AGGR_INIT_EXPR)
1006 : 23415086 : 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 : 614740441 : cp_get_fndecl_from_callee (tree fn, bool fold /* = true */)
1015 : : {
1016 : 614740441 : 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 : 1176910464 : auto fn_or_local_alias = [] (tree f)
1024 : : {
1025 : 563939609 : if (DECL_LOCAL_DECL_P (f))
1026 : 43049 : if (tree alias = DECL_LOCAL_DECL_ALIAS (f))
1027 : 43049 : if (alias != error_mark_node)
1028 : 43049 : return alias;
1029 : : return f;
1030 : : };
1031 : :
1032 : 612970855 : if (TREE_CODE (fn) == FUNCTION_DECL)
1033 : 7438148 : return fn_or_local_alias (fn);
1034 : 605532707 : tree type = TREE_TYPE (fn);
1035 : 605532707 : if (type == NULL_TREE || !INDIRECT_TYPE_P (type))
1036 : : return NULL_TREE;
1037 : 561493686 : if (fold)
1038 : 2494455 : fn = maybe_constant_init (fn);
1039 : 561493686 : STRIP_NOPS (fn);
1040 : 561493686 : if (TREE_CODE (fn) == ADDR_EXPR
1041 : 561493686 : || TREE_CODE (fn) == FDESC_EXPR)
1042 : 556501555 : fn = TREE_OPERAND (fn, 0);
1043 : 561493686 : if (TREE_CODE (fn) == FUNCTION_DECL)
1044 : 556501461 : 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 : 256190844 : cp_get_callee_fndecl_nofold (tree call)
1061 : : {
1062 : 256190844 : 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 : 4245420 : maybe_warn_nodiscard (tree expr, impl_conv_void implicit)
1070 : : {
1071 : 4245420 : if (!warn_unused_result || c_inhibit_evaluation_warnings)
1072 : : return;
1073 : :
1074 : 4238726 : tree call = expr;
1075 : 4238726 : if (TREE_CODE (expr) == TARGET_EXPR)
1076 : 49764 : call = TARGET_EXPR_INITIAL (expr);
1077 : 4238726 : location_t loc = cp_expr_loc_or_input_loc (call);
1078 : 4238726 : tree callee = cp_get_callee (call);
1079 : 4238726 : if (!callee || !TREE_TYPE (callee))
1080 : : return;
1081 : :
1082 : 4237010 : tree type = TREE_TYPE (callee);
1083 : 4237010 : if (TYPE_PTRMEMFUNC_P (type))
1084 : 0 : type = TYPE_PTRMEMFUNC_FN_TYPE (type);
1085 : 4237010 : if (INDIRECT_TYPE_P (type))
1086 : 2494455 : type = TREE_TYPE (type);
1087 : 4237010 : if (!FUNC_OR_METHOD_TYPE_P (type))
1088 : : return;
1089 : :
1090 : 4236959 : tree rettype = TREE_TYPE (type);
1091 : 4236959 : tree fn = cp_get_fndecl_from_callee (callee);
1092 : 4236959 : tree attr;
1093 : 4236959 : if (implicit != ICV_CAST && fn
1094 : 4236959 : && (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 : 4236533 : else if (implicit != ICV_CAST
1113 : 4236533 : && (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 : 4236416 : else if (TREE_CODE (expr) == TARGET_EXPR
1138 : 4236416 : && 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 : 81982510 : convert_to_void (tree expr, impl_conv_void implicit, tsubst_flags_t complain)
1180 : : {
1181 : 85454215 : location_t loc = cp_expr_loc_or_input_loc (expr);
1182 : :
1183 : 85454215 : if (expr == error_mark_node
1184 : 85454215 : || TREE_TYPE (expr) == error_mark_node)
1185 : : return error_mark_node;
1186 : :
1187 : 85450156 : expr = maybe_undo_parenthesized_ref (expr);
1188 : :
1189 : 85450156 : expr = mark_discarded_use (expr);
1190 : 85450156 : if (implicit == ICV_CAST)
1191 : : /* An explicit cast to void avoids all -Wunused-but-set* warnings. */
1192 : 345344 : mark_exp_read (expr);
1193 : :
1194 : 85450156 : if (!TREE_TYPE (expr))
1195 : : return expr;
1196 : 85450156 : if (invalid_nonstatic_memfn_p (loc, expr, complain))
1197 : 20 : return error_mark_node;
1198 : 85450136 : if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
1199 : : {
1200 : 6 : if (complain & tf_error)
1201 : 6 : error_at (loc, "pseudo-destructor is not called");
1202 : 6 : return error_mark_node;
1203 : : }
1204 : :
1205 : : /* Explicitly evaluate void-converted concept checks since their
1206 : : satisfaction may produce ill-formed programs. */
1207 : 85450130 : if (concept_check_p (expr))
1208 : 29 : expr = evaluate_concept_check (expr);
1209 : :
1210 : 85450130 : if (VOID_TYPE_P (TREE_TYPE (expr)))
1211 : : return expr;
1212 : 54566739 : switch (TREE_CODE (expr))
1213 : : {
1214 : 16855 : case COND_EXPR:
1215 : 16855 : {
1216 : : /* The two parts of a cond expr might be separate lvalues. */
1217 : 16855 : tree op1 = TREE_OPERAND (expr,1);
1218 : 16855 : tree op2 = TREE_OPERAND (expr,2);
1219 : 16849 : bool side_effects = ((op1 && TREE_SIDE_EFFECTS (op1))
1220 : 17167 : || TREE_SIDE_EFFECTS (op2));
1221 : 16855 : tree new_op1, new_op2;
1222 : 16855 : new_op1 = NULL_TREE;
1223 : 16855 : if (implicit != ICV_CAST && !side_effects)
1224 : : {
1225 : 69 : if (op1)
1226 : 66 : new_op1 = convert_to_void (op1, ICV_SECOND_OF_COND, complain);
1227 : 69 : new_op2 = convert_to_void (op2, ICV_THIRD_OF_COND, complain);
1228 : : }
1229 : : else
1230 : : {
1231 : 16786 : if (op1)
1232 : 16783 : new_op1 = convert_to_void (op1, ICV_CAST, complain);
1233 : 16786 : new_op2 = convert_to_void (op2, ICV_CAST, complain);
1234 : : }
1235 : :
1236 : 16855 : expr = build3_loc (loc, COND_EXPR, TREE_TYPE (new_op2),
1237 : 16855 : TREE_OPERAND (expr, 0), new_op1, new_op2);
1238 : 16855 : break;
1239 : : }
1240 : :
1241 : 326501 : case COMPOUND_EXPR:
1242 : 326501 : {
1243 : : /* The second part of a compound expr contains the value. */
1244 : 326501 : tree op1 = TREE_OPERAND (expr,1);
1245 : 326501 : tree new_op1;
1246 : 326501 : if (implicit != ICV_CAST && !warning_suppressed_p (expr /* What warning? */))
1247 : 192181 : new_op1 = convert_to_void (op1, ICV_RIGHT_OF_COMMA, complain);
1248 : : else
1249 : 134320 : new_op1 = convert_to_void (op1, ICV_CAST, complain);
1250 : :
1251 : 326501 : if (new_op1 != op1)
1252 : : {
1253 : 326501 : tree t = build2_loc (loc, COMPOUND_EXPR, TREE_TYPE (new_op1),
1254 : 326501 : TREE_OPERAND (expr, 0), new_op1);
1255 : 326501 : expr = t;
1256 : : }
1257 : :
1258 : : break;
1259 : : }
1260 : :
1261 : : case NON_LVALUE_EXPR:
1262 : : case NOP_EXPR:
1263 : : /* These have already decayed to rvalue. */
1264 : : break;
1265 : :
1266 : 5310033 : case CALL_EXPR: /* We have a special meaning for volatile void fn(). */
1267 : : /* cdtors may return this or void, depending on
1268 : : targetm.cxx.cdtor_returns_this, but this shouldn't affect our
1269 : : decisions here: neither nodiscard warnings (nodiscard dtors
1270 : : are nonsensical and ctors have a different behavior with that
1271 : : attribute that is handled in the TARGET_EXPR case), nor should
1272 : : any constexpr or template instantiations be affected by an ABI
1273 : : property that is, or at least ought to be transparent to the
1274 : : language. */
1275 : 5310033 : if (tree fn = cp_get_callee_fndecl_nofold (expr))
1276 : 9469498 : if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
1277 : : return expr;
1278 : :
1279 : 5310033 : if (complain & tf_warning)
1280 : 4195504 : maybe_warn_nodiscard (expr, implicit);
1281 : : break;
1282 : :
1283 : 3671013 : case INDIRECT_REF:
1284 : 3671013 : {
1285 : 3671013 : tree type = TREE_TYPE (expr);
1286 : 3671013 : int is_reference = TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr, 0)));
1287 : 3671013 : int is_volatile = TYPE_VOLATILE (type);
1288 : 3671013 : if (is_volatile)
1289 : 424 : complete_type (type);
1290 : 3671013 : int is_complete = COMPLETE_TYPE_P (type);
1291 : :
1292 : : /* Don't load the value if this is an implicit dereference, or if
1293 : : the type needs to be handled by ctors/dtors. */
1294 : 3671013 : if (is_reference)
1295 : : {
1296 : 292 : if (is_volatile && (complain & tf_warning)
1297 : : /* A co_await expression, in its await_resume expression, also
1298 : : contains an implicit dereference. As a result, we don't
1299 : : need to warn about them here. */
1300 : 3471786 : && TREE_CODE (TREE_OPERAND (expr, 0)) != CO_AWAIT_EXPR)
1301 : 72 : switch (implicit)
1302 : : {
1303 : 36 : case ICV_CAST:
1304 : 36 : warning_at (loc, 0, "conversion to void will not access "
1305 : : "object of type %qT", type);
1306 : 36 : break;
1307 : 0 : case ICV_SECOND_OF_COND:
1308 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1309 : : "object of type %qT in second operand of "
1310 : : "conditional expression", type);
1311 : 0 : break;
1312 : 0 : case ICV_THIRD_OF_COND:
1313 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1314 : : "object of type %qT in third operand of "
1315 : : "conditional expression", type);
1316 : 0 : break;
1317 : 0 : case ICV_RIGHT_OF_COMMA:
1318 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1319 : : "object of type %qT in right operand of "
1320 : : "comma operator", type);
1321 : 0 : break;
1322 : 0 : case ICV_LEFT_OF_COMMA:
1323 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1324 : : "object of type %qT in left operand of comma "
1325 : : "operator", type);
1326 : 0 : break;
1327 : 36 : case ICV_STATEMENT:
1328 : 36 : warning_at (loc, 0, "implicit dereference will not access "
1329 : : "object of type %qT in statement", type);
1330 : 36 : break;
1331 : 0 : case ICV_THIRD_IN_FOR:
1332 : 0 : warning_at (loc, 0, "implicit dereference will not access "
1333 : : "object of type %qT in for increment expression",
1334 : : type);
1335 : 0 : break;
1336 : 0 : default:
1337 : 0 : gcc_unreachable ();
1338 : : }
1339 : :
1340 : : /* Since this was an implicit dereference, we should also act as if
1341 : : it was never there. */
1342 : 3471705 : return convert_to_void (TREE_OPERAND (expr, 0), implicit, complain);
1343 : : }
1344 : : /* Can't load the value if we don't know the type. */
1345 : 199308 : else if (is_volatile && !is_complete)
1346 : : {
1347 : 18 : if (complain & tf_warning)
1348 : 18 : switch (implicit)
1349 : : {
1350 : 12 : case ICV_CAST:
1351 : 12 : warning_at (loc, 0, "conversion to void will not access "
1352 : : "object of incomplete type %qT", type);
1353 : 12 : break;
1354 : 0 : case ICV_SECOND_OF_COND:
1355 : 0 : warning_at (loc, 0, "indirection will not access object of "
1356 : : "incomplete type %qT in second operand "
1357 : : "of conditional expression", type);
1358 : 0 : break;
1359 : 0 : case ICV_THIRD_OF_COND:
1360 : 0 : warning_at (loc, 0, "indirection will not access object of "
1361 : : "incomplete type %qT in third operand "
1362 : : "of conditional expression", type);
1363 : 0 : break;
1364 : 0 : case ICV_RIGHT_OF_COMMA:
1365 : 0 : warning_at (loc, 0, "indirection will not access object of "
1366 : : "incomplete type %qT in right operand of "
1367 : : "comma operator", type);
1368 : 0 : break;
1369 : 0 : case ICV_LEFT_OF_COMMA:
1370 : 0 : warning_at (loc, 0, "indirection will not access object of "
1371 : : "incomplete type %qT in left operand of "
1372 : : "comma operator", type);
1373 : 0 : break;
1374 : 6 : case ICV_STATEMENT:
1375 : 6 : warning_at (loc, 0, "indirection will not access object of "
1376 : : "incomplete type %qT in statement", type);
1377 : 6 : break;
1378 : 0 : case ICV_THIRD_IN_FOR:
1379 : 0 : warning_at (loc, 0, "indirection will not access object of "
1380 : : "incomplete type %qT in for increment "
1381 : : "expression", type);
1382 : 0 : break;
1383 : 0 : default:
1384 : 0 : gcc_unreachable ();
1385 : : }
1386 : : }
1387 : 199290 : else if (is_volatile && TREE_ADDRESSABLE (type))
1388 : : {
1389 : 3 : if (complain & tf_warning)
1390 : 3 : switch (implicit)
1391 : : {
1392 : 0 : case ICV_CAST:
1393 : 0 : warning_at (loc, 0, "conversion to void will not access "
1394 : : "object of non-trivially-copyable type %qT",
1395 : : type);
1396 : 0 : break;
1397 : 0 : case ICV_SECOND_OF_COND:
1398 : 0 : warning_at (loc, 0, "indirection will not access object of "
1399 : : "non-trivially-copyable type %qT in second "
1400 : : "operand of conditional expression", type);
1401 : 0 : break;
1402 : 0 : case ICV_THIRD_OF_COND:
1403 : 0 : warning_at (loc, 0, "indirection will not access object of "
1404 : : "non-trivially-copyable type %qT in third "
1405 : : "operand of conditional expression", type);
1406 : 0 : break;
1407 : 0 : case ICV_RIGHT_OF_COMMA:
1408 : 0 : warning_at (loc, 0, "indirection will not access object of "
1409 : : "non-trivially-copyable type %qT in right "
1410 : : "operand of comma operator", type);
1411 : 0 : break;
1412 : 0 : case ICV_LEFT_OF_COMMA:
1413 : 0 : warning_at (loc, 0, "indirection will not access object of "
1414 : : "non-trivially-copyable type %qT in left "
1415 : : "operand of comma operator", type);
1416 : 0 : break;
1417 : 3 : case ICV_STATEMENT:
1418 : 3 : warning_at (loc, 0, "indirection will not access object of "
1419 : : "non-trivially-copyable type %qT in statement",
1420 : : type);
1421 : 3 : break;
1422 : 0 : case ICV_THIRD_IN_FOR:
1423 : 0 : warning_at (loc, 0, "indirection will not access object of "
1424 : : "non-trivially-copyable type %qT in for "
1425 : : "increment expression", type);
1426 : 0 : break;
1427 : 0 : default:
1428 : 0 : gcc_unreachable ();
1429 : : }
1430 : : }
1431 : 199308 : if (!is_volatile || !is_complete || TREE_ADDRESSABLE (type))
1432 : : {
1433 : : /* Emit a warning (if enabled) when the "effect-less" INDIRECT_REF
1434 : : operation is stripped off. Note that we don't warn about
1435 : : - an expression with TREE_NO_WARNING set. (For an example of
1436 : : such expressions, see build_over_call in call.cc.)
1437 : : - automatic dereferencing of references, since the user cannot
1438 : : control it. (See also warn_if_unused_value() in c-common.cc.) */
1439 : 199197 : if (warn_unused_value
1440 : 1182 : && implicit != ICV_CAST
1441 : 680 : && (complain & tf_warning)
1442 : 9 : && !warning_suppressed_p (expr, OPT_Wunused_value)
1443 : 199197 : && !is_reference)
1444 : 9 : warning_at (loc, OPT_Wunused_value, "value computed is not used");
1445 : 199197 : expr = TREE_OPERAND (expr, 0);
1446 : : }
1447 : :
1448 : : break;
1449 : : }
1450 : :
1451 : 16009 : case VAR_DECL:
1452 : 16009 : {
1453 : : /* External variables might be incomplete. */
1454 : 16009 : tree type = TREE_TYPE (expr);
1455 : :
1456 : 16009 : if (TYPE_VOLATILE (type)
1457 : 138 : && !COMPLETE_TYPE_P (complete_type (type))
1458 : 16024 : && (complain & tf_warning))
1459 : 15 : switch (implicit)
1460 : : {
1461 : 12 : case ICV_CAST:
1462 : 12 : warning_at (loc, 0, "conversion to void will not access "
1463 : : "object %qE of incomplete type %qT", expr, type);
1464 : 12 : break;
1465 : 0 : case ICV_SECOND_OF_COND:
1466 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1467 : : "not be accessed in second operand of "
1468 : : "conditional expression", expr, type);
1469 : 0 : break;
1470 : 0 : case ICV_THIRD_OF_COND:
1471 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1472 : : "not be accessed in third operand of "
1473 : : "conditional expression", expr, type);
1474 : 0 : break;
1475 : 0 : case ICV_RIGHT_OF_COMMA:
1476 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1477 : : "not be accessed in right operand of comma operator",
1478 : : expr, type);
1479 : 0 : break;
1480 : 0 : case ICV_LEFT_OF_COMMA:
1481 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1482 : : "not be accessed in left operand of comma operator",
1483 : : expr, type);
1484 : 0 : break;
1485 : 3 : case ICV_STATEMENT:
1486 : 3 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1487 : : "not be accessed in statement", expr, type);
1488 : 3 : break;
1489 : 0 : case ICV_THIRD_IN_FOR:
1490 : 0 : warning_at (loc, 0, "variable %qE of incomplete type %qT will "
1491 : : "not be accessed in for increment expression",
1492 : : expr, type);
1493 : 0 : break;
1494 : 0 : default:
1495 : 0 : gcc_unreachable ();
1496 : : }
1497 : :
1498 : : break;
1499 : : }
1500 : :
1501 : 873983 : case TARGET_EXPR:
1502 : : /* Don't bother with the temporary object returned from a function if
1503 : : we don't use it, don't need to destroy it, and won't abort in
1504 : : assign_temp. We'll still
1505 : : allocate space for it in expand_call or declare_return_variable,
1506 : : but we don't need to track it through all the tree phases. */
1507 : 873983 : if (TARGET_EXPR_IMPLICIT_P (expr)
1508 : 873983 : && !TREE_ADDRESSABLE (TREE_TYPE (expr)))
1509 : : {
1510 : 421511 : tree init = TARGET_EXPR_INITIAL (expr);
1511 : 421511 : if (TREE_CODE (init) == AGGR_INIT_EXPR
1512 : 421511 : && !AGGR_INIT_VIA_CTOR_P (init))
1513 : : {
1514 : 0 : tree fn = AGGR_INIT_EXPR_FN (init);
1515 : 0 : expr = build_call_array_loc (input_location,
1516 : 0 : TREE_TYPE (TREE_TYPE
1517 : : (TREE_TYPE (fn))),
1518 : : fn,
1519 : 0 : aggr_init_expr_nargs (init),
1520 : 0 : AGGR_INIT_EXPR_ARGP (init));
1521 : : }
1522 : : }
1523 : 873983 : if (complain & tf_warning)
1524 : 49916 : maybe_warn_nodiscard (expr, implicit);
1525 : : break;
1526 : :
1527 : 230 : case CO_AWAIT_EXPR:
1528 : 230 : if (auto awr = co_await_get_resume_call (expr))
1529 : 218 : convert_to_void (awr, implicit, complain);
1530 : : break;
1531 : :
1532 : 51095034 : default:;
1533 : : }
1534 : 51095034 : expr = resolve_nondeduced_context (expr, complain);
1535 : 51095034 : if (!mark_single_function (expr, complain))
1536 : 3 : return error_mark_node;
1537 : :
1538 : 51095031 : {
1539 : 51095031 : tree probe = expr;
1540 : :
1541 : 51095031 : if (TREE_CODE (probe) == ADDR_EXPR)
1542 : 343 : probe = TREE_OPERAND (expr, 0);
1543 : 51095031 : if (type_unknown_p (probe))
1544 : : {
1545 : : /* [over.over] enumerates the places where we can take the address
1546 : : of an overloaded function, and this is not one of them. */
1547 : 55 : if (complain & tf_error)
1548 : 36 : switch (implicit)
1549 : : {
1550 : 12 : case ICV_CAST:
1551 : 12 : error_at (loc, "conversion to void "
1552 : : "cannot resolve address of overloaded function");
1553 : 12 : break;
1554 : 0 : case ICV_SECOND_OF_COND:
1555 : 0 : error_at (loc, "second operand of conditional expression "
1556 : : "cannot resolve address of overloaded function");
1557 : 0 : break;
1558 : 0 : case ICV_THIRD_OF_COND:
1559 : 0 : error_at (loc, "third operand of conditional expression "
1560 : : "cannot resolve address of overloaded function");
1561 : 0 : break;
1562 : 0 : case ICV_RIGHT_OF_COMMA:
1563 : 0 : error_at (loc, "right operand of comma operator "
1564 : : "cannot resolve address of overloaded function");
1565 : 0 : break;
1566 : 0 : case ICV_LEFT_OF_COMMA:
1567 : 0 : error_at (loc, "left operand of comma operator "
1568 : : "cannot resolve address of overloaded function");
1569 : 0 : break;
1570 : 24 : case ICV_STATEMENT:
1571 : 24 : error_at (loc, "statement "
1572 : : "cannot resolve address of overloaded function");
1573 : 24 : break;
1574 : 0 : case ICV_THIRD_IN_FOR:
1575 : 0 : error_at (loc, "for increment expression "
1576 : : "cannot resolve address of overloaded function");
1577 : 0 : break;
1578 : : }
1579 : : else
1580 : 19 : return error_mark_node;
1581 : 36 : expr = void_node;
1582 : : }
1583 : 51094976 : else if (implicit != ICV_CAST && probe == expr && is_overloaded_fn (probe))
1584 : : {
1585 : : /* Only warn when there is no &. */
1586 : 104 : if (complain & tf_warning)
1587 : 104 : switch (implicit)
1588 : : {
1589 : 3 : case ICV_SECOND_OF_COND:
1590 : 3 : warning_at (loc, OPT_Waddress,
1591 : : "second operand of conditional expression "
1592 : : "is a reference, not call, to function %qE", expr);
1593 : 3 : break;
1594 : 3 : case ICV_THIRD_OF_COND:
1595 : 3 : warning_at (loc, OPT_Waddress,
1596 : : "third operand of conditional expression "
1597 : : "is a reference, not call, to function %qE", expr);
1598 : 3 : break;
1599 : 0 : case ICV_RIGHT_OF_COMMA:
1600 : 0 : warning_at (loc, OPT_Waddress,
1601 : : "right operand of comma operator "
1602 : : "is a reference, not call, to function %qE", expr);
1603 : 0 : break;
1604 : 9 : case ICV_LEFT_OF_COMMA:
1605 : 9 : warning_at (loc, OPT_Waddress,
1606 : : "left operand of comma operator "
1607 : : "is a reference, not call, to function %qE", expr);
1608 : 9 : break;
1609 : 89 : case ICV_STATEMENT:
1610 : 89 : warning_at (loc, OPT_Waddress,
1611 : : "statement is a reference, not call, to function %qE",
1612 : : expr);
1613 : 89 : break;
1614 : 0 : case ICV_THIRD_IN_FOR:
1615 : 0 : warning_at (loc, OPT_Waddress,
1616 : : "for increment expression "
1617 : : "is a reference, not call, to function %qE", expr);
1618 : 0 : break;
1619 : 0 : default:
1620 : 0 : gcc_unreachable ();
1621 : : }
1622 : :
1623 : 104 : if (TREE_CODE (expr) == COMPONENT_REF)
1624 : 9 : expr = TREE_OPERAND (expr, 0);
1625 : : }
1626 : : }
1627 : :
1628 : 51095012 : if (expr != error_mark_node && !VOID_TYPE_P (TREE_TYPE (expr)))
1629 : : {
1630 : 50751620 : if (implicit != ICV_CAST
1631 : 50419392 : && warn_unused_value
1632 : 614192 : && !warning_suppressed_p (expr, OPT_Wunused_value)
1633 : 612415 : && !processing_template_decl
1634 : 487496 : && !cp_unevaluated_operand
1635 : 51215611 : && (complain & tf_warning))
1636 : : {
1637 : : /* The middle end does not warn about expressions that have
1638 : : been explicitly cast to void, so we must do so here. */
1639 : 462836 : if (!TREE_SIDE_EFFECTS (expr))
1640 : : {
1641 : 96 : switch (implicit)
1642 : : {
1643 : 3 : case ICV_SECOND_OF_COND:
1644 : 3 : warning_at (loc, OPT_Wunused_value,
1645 : : "second operand of conditional expression "
1646 : : "has no effect");
1647 : 3 : break;
1648 : 3 : case ICV_THIRD_OF_COND:
1649 : 3 : warning_at (loc, OPT_Wunused_value,
1650 : : "third operand of conditional expression "
1651 : : "has no effect");
1652 : 3 : break;
1653 : 39 : case ICV_RIGHT_OF_COMMA:
1654 : 39 : warning_at (loc, OPT_Wunused_value,
1655 : : "right operand of comma operator has no effect");
1656 : 39 : break;
1657 : 12 : case ICV_LEFT_OF_COMMA:
1658 : 12 : warning_at (loc, OPT_Wunused_value,
1659 : : "left operand of comma operator has no effect");
1660 : 12 : break;
1661 : 39 : case ICV_STATEMENT:
1662 : 39 : warning_at (loc, OPT_Wunused_value,
1663 : : "statement has no effect");
1664 : 36 : break;
1665 : 0 : case ICV_THIRD_IN_FOR:
1666 : 0 : warning_at (loc, OPT_Wunused_value,
1667 : : "for increment expression has no effect");
1668 : 0 : break;
1669 : 0 : default:
1670 : 0 : gcc_unreachable ();
1671 : : }
1672 : : }
1673 : : else
1674 : : {
1675 : : tree e = expr;
1676 : : /* We might like to warn about (say) "(int) f()", as the
1677 : : cast has no effect, but the compiler itself will
1678 : : generate implicit conversions under some
1679 : : circumstances. (For example a block copy will be
1680 : : turned into a call to "__builtin_memcpy", with a
1681 : : conversion of the return value to an appropriate
1682 : : type.) So, to avoid false positives, we strip
1683 : : conversions. Do not use STRIP_NOPs because it will
1684 : : not strip conversions to "void", as that is not a
1685 : : mode-preserving conversion. */
1686 : 463068 : while (TREE_CODE (e) == NOP_EXPR)
1687 : 328 : e = TREE_OPERAND (e, 0);
1688 : :
1689 : 462740 : enum tree_code code = TREE_CODE (e);
1690 : 462740 : enum tree_code_class tclass = TREE_CODE_CLASS (code);
1691 : 462740 : if (tclass == tcc_comparison
1692 : : || tclass == tcc_unary
1693 : 462740 : || tclass == tcc_binary
1694 : 462665 : || code == TRUTH_NOT_EXPR
1695 : 462665 : || code == ADDR_EXPR
1696 : : || code == VEC_PERM_EXPR
1697 : 462658 : || code == VEC_COND_EXPR)
1698 : 88 : warn_if_unused_value (e, loc);
1699 : : }
1700 : : }
1701 : 50751617 : expr = build1 (CONVERT_EXPR, void_type_node, expr);
1702 : : }
1703 : 51095009 : if (! TREE_SIDE_EFFECTS (expr))
1704 : 1091716 : expr = void_node;
1705 : : return expr;
1706 : : }
1707 : :
1708 : : /* Create an expression whose value is that of EXPR,
1709 : : converted to type TYPE. The TREE_TYPE of the value
1710 : : is always TYPE. This function implements all reasonable
1711 : : conversions; callers should filter out those that are
1712 : : not permitted by the language being compiled.
1713 : :
1714 : : Most of this routine is from build_reinterpret_cast.
1715 : :
1716 : : The back end cannot call cp_convert (what was convert) because
1717 : : conversions to/from basetypes may involve memory references
1718 : : (vbases) and adding or subtracting small values (multiple
1719 : : inheritance), but it calls convert from the constant folding code
1720 : : on subtrees of already built trees after it has ripped them apart.
1721 : :
1722 : : Also, if we ever support range variables, we'll probably also have to
1723 : : do a little bit more work. */
1724 : :
1725 : : tree
1726 : 164442388 : convert (tree type, tree expr)
1727 : : {
1728 : 164442388 : tree intype;
1729 : :
1730 : 164442388 : if (type == error_mark_node || expr == error_mark_node)
1731 : : return error_mark_node;
1732 : :
1733 : 164440212 : intype = TREE_TYPE (expr);
1734 : :
1735 : 164440212 : if (INDIRECT_TYPE_P (type) && INDIRECT_TYPE_P (intype))
1736 : 36134091 : return build_nop (type, expr);
1737 : :
1738 : 128306121 : return ocp_convert (type, expr, CONV_BACKEND_CONVERT,
1739 : : LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
1740 : 128306121 : tf_warning_or_error);
1741 : : }
1742 : :
1743 : : /* Like convert, but in a static initializer (called from
1744 : : convert_and_check). */
1745 : :
1746 : : tree
1747 : 0 : convert_init (tree type, tree expr)
1748 : : {
1749 : 0 : return convert (type, expr);
1750 : : }
1751 : :
1752 : : /* Like cp_convert, except permit conversions to take place which
1753 : : are not normally allowed due to access restrictions
1754 : : (such as conversion from sub-type to private super-type). */
1755 : :
1756 : : tree
1757 : 7687543 : convert_force (tree type, tree expr, int convtype, tsubst_flags_t complain)
1758 : : {
1759 : 7687543 : tree e = expr;
1760 : 7687543 : enum tree_code code = TREE_CODE (type);
1761 : :
1762 : 7687543 : if (code == REFERENCE_TYPE)
1763 : 0 : return convert_to_reference (type, e, CONV_C_CAST, 0,
1764 : 0 : NULL_TREE, complain);
1765 : :
1766 : 7687543 : if (code == POINTER_TYPE)
1767 : 7687543 : return convert_to_pointer_force (type, e, complain);
1768 : :
1769 : : /* From typeck.cc convert_for_assignment */
1770 : 0 : if (((TYPE_PTR_P (TREE_TYPE (e)) && TREE_CODE (e) == ADDR_EXPR
1771 : 0 : && TREE_CODE (TREE_TYPE (TREE_TYPE (e))) == METHOD_TYPE)
1772 : 0 : || integer_zerop (e)
1773 : 0 : || TYPE_PTRMEMFUNC_P (TREE_TYPE (e)))
1774 : 0 : && TYPE_PTRMEMFUNC_P (type))
1775 : : /* compatible pointer to member functions. */
1776 : 0 : return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), e, 1,
1777 : 0 : /*c_cast_p=*/1, complain);
1778 : :
1779 : 0 : return ocp_convert (type, e, CONV_C_CAST|convtype, LOOKUP_NORMAL, complain);
1780 : : }
1781 : :
1782 : : /* Convert an aggregate EXPR to type XTYPE. If a conversion
1783 : : exists, return the attempted conversion. This may
1784 : : return ERROR_MARK_NODE if the conversion is not
1785 : : allowed (references private members, etc).
1786 : : If no conversion exists, NULL_TREE is returned.
1787 : :
1788 : : FIXME: Ambiguity checking is wrong. Should choose one by the implicit
1789 : : object parameter, or by the second standard conversion sequence if
1790 : : that doesn't do it. This will probably wait for an overloading rewrite.
1791 : : (jason 8/9/95) */
1792 : :
1793 : : static tree
1794 : 12 : build_type_conversion (tree xtype, tree expr)
1795 : : {
1796 : : /* C++: check to see if we can convert this aggregate type
1797 : : into the required type. */
1798 : 12 : return build_user_type_conversion (xtype, expr, LOOKUP_NORMAL,
1799 : 0 : tf_warning_or_error);
1800 : : }
1801 : :
1802 : : /* Convert the given EXPR to one of a group of types suitable for use in an
1803 : : expression. DESIRES is a combination of various WANT_* flags (q.v.)
1804 : : which indicates which types are suitable. If COMPLAIN is true, complain
1805 : : about ambiguity; otherwise, the caller will deal with it. */
1806 : :
1807 : : tree
1808 : 54687520 : build_expr_type_conversion (int desires, tree expr, bool complain)
1809 : : {
1810 : 54687520 : tree basetype = TREE_TYPE (expr);
1811 : 54687520 : tree conv = NULL_TREE;
1812 : 54687520 : tree winner = NULL_TREE;
1813 : :
1814 : 54687520 : if (null_node_p (expr)
1815 : 45 : && (desires & WANT_INT)
1816 : 54687556 : && !(desires & WANT_NULL))
1817 : : {
1818 : 36 : location_t loc =
1819 : 36 : expansion_point_location_if_in_system_header (input_location);
1820 : :
1821 : 36 : warning_at (loc, OPT_Wconversion_null,
1822 : : "converting NULL to non-pointer type");
1823 : : }
1824 : :
1825 : 54687520 : if (basetype == error_mark_node)
1826 : : return error_mark_node;
1827 : :
1828 : 54687508 : if (! MAYBE_CLASS_TYPE_P (basetype))
1829 : 54687306 : switch (TREE_CODE (basetype))
1830 : : {
1831 : 45717417 : case INTEGER_TYPE:
1832 : 45717417 : if ((desires & WANT_NULL) && null_ptr_cst_p (expr))
1833 : : return expr;
1834 : : /* fall through. */
1835 : :
1836 : 45756261 : case BOOLEAN_TYPE:
1837 : 48723397 : return (desires & WANT_INT) ? expr : NULL_TREE;
1838 : 81377 : case ENUMERAL_TYPE:
1839 : 83021 : return (desires & WANT_ENUM) ? expr : NULL_TREE;
1840 : 1784031 : case REAL_TYPE:
1841 : 1784071 : return (desires & WANT_FLOAT) ? expr : NULL_TREE;
1842 : 5949519 : case POINTER_TYPE:
1843 : 7835793 : return (desires & WANT_POINTER) ? expr : NULL_TREE;
1844 : :
1845 : 1045324 : case FUNCTION_TYPE:
1846 : 1045324 : case ARRAY_TYPE:
1847 : 1045324 : return (desires & WANT_POINTER) ? decay_conversion (expr,
1848 : : tf_warning_or_error)
1849 : : : NULL_TREE;
1850 : :
1851 : 55374 : case VECTOR_TYPE:
1852 : 55374 : if (!gnu_vector_type_p (basetype))
1853 : : return NULL_TREE;
1854 : : /* FALLTHROUGH */
1855 : 70734 : case COMPLEX_TYPE:
1856 : 70734 : if ((desires & WANT_VECTOR_OR_COMPLEX) == 0)
1857 : : return NULL_TREE;
1858 : 33283 : switch (TREE_CODE (TREE_TYPE (basetype)))
1859 : : {
1860 : 400 : case INTEGER_TYPE:
1861 : 400 : case BOOLEAN_TYPE:
1862 : 400 : return (desires & WANT_INT) ? expr : NULL_TREE;
1863 : 0 : case ENUMERAL_TYPE:
1864 : 0 : return (desires & WANT_ENUM) ? expr : NULL_TREE;
1865 : 32883 : case REAL_TYPE:
1866 : 32889 : return (desires & WANT_FLOAT) ? expr : NULL_TREE;
1867 : : default:
1868 : : return NULL_TREE;
1869 : : }
1870 : :
1871 : : default:
1872 : : return NULL_TREE;
1873 : : }
1874 : :
1875 : : /* The code for conversions from class type is currently only used for
1876 : : delete expressions. Other expressions are handled by build_new_op. */
1877 : 202 : if (!complete_type_or_maybe_complain (basetype, expr, complain))
1878 : 0 : return error_mark_node;
1879 : 202 : if (!TYPE_HAS_CONVERSION (basetype))
1880 : : return NULL_TREE;
1881 : :
1882 : 407 : for (conv = lookup_conversions (basetype); conv; conv = TREE_CHAIN (conv))
1883 : : {
1884 : 220 : int win = 0;
1885 : 220 : tree candidate;
1886 : 220 : tree cand = TREE_VALUE (conv);
1887 : 220 : cand = OVL_FIRST (cand);
1888 : :
1889 : 220 : if (winner && winner == cand)
1890 : 0 : continue;
1891 : :
1892 : 220 : if (DECL_NONCONVERTING_P (cand))
1893 : 3 : continue;
1894 : :
1895 : 217 : candidate = non_reference (TREE_TYPE (TREE_TYPE (cand)));
1896 : :
1897 : 217 : switch (TREE_CODE (candidate))
1898 : : {
1899 : 160 : case BOOLEAN_TYPE:
1900 : 160 : case INTEGER_TYPE:
1901 : 160 : win = (desires & WANT_INT); break;
1902 : 15 : case ENUMERAL_TYPE:
1903 : 15 : win = (desires & WANT_ENUM); break;
1904 : 3 : case REAL_TYPE:
1905 : 3 : win = (desires & WANT_FLOAT); break;
1906 : 36 : case POINTER_TYPE:
1907 : 36 : win = (desires & WANT_POINTER); break;
1908 : :
1909 : 0 : case COMPLEX_TYPE:
1910 : 0 : case VECTOR_TYPE:
1911 : 0 : if ((desires & WANT_VECTOR_OR_COMPLEX) == 0)
1912 : : break;
1913 : 0 : switch (TREE_CODE (TREE_TYPE (candidate)))
1914 : : {
1915 : 0 : case BOOLEAN_TYPE:
1916 : 0 : case INTEGER_TYPE:
1917 : 0 : win = (desires & WANT_INT); break;
1918 : 0 : case ENUMERAL_TYPE:
1919 : 0 : win = (desires & WANT_ENUM); break;
1920 : 0 : case REAL_TYPE:
1921 : 0 : win = (desires & WANT_FLOAT); break;
1922 : : default:
1923 : : break;
1924 : : }
1925 : : break;
1926 : :
1927 : 3 : default:
1928 : : /* A wildcard could be instantiated to match any desired
1929 : : type, but we can't deduce the template argument. */
1930 : 3 : if (WILDCARD_TYPE_P (candidate))
1931 : : win = true;
1932 : : break;
1933 : : }
1934 : :
1935 : 214 : if (win)
1936 : : {
1937 : 205 : if (TREE_CODE (cand) == TEMPLATE_DECL)
1938 : : {
1939 : 6 : if (complain)
1940 : 6 : error ("default type conversion cannot deduce template"
1941 : : " argument for %qD", cand);
1942 : 6 : return error_mark_node;
1943 : : }
1944 : :
1945 : 199 : if (winner)
1946 : : {
1947 : 15 : tree winner_type
1948 : 15 : = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1949 : :
1950 : 15 : if (!same_type_ignoring_top_level_qualifiers_p (winner_type,
1951 : : candidate))
1952 : : {
1953 : 3 : if (complain)
1954 : : {
1955 : 3 : auto_diagnostic_group d;
1956 : 3 : error ("ambiguous default type conversion from %qT",
1957 : : basetype);
1958 : 3 : inform (input_location,
1959 : : " candidate conversions include %qD and %qD",
1960 : : winner, cand);
1961 : 3 : }
1962 : 3 : return error_mark_node;
1963 : : }
1964 : : }
1965 : :
1966 : : winner = cand;
1967 : : }
1968 : : }
1969 : :
1970 : 187 : if (winner)
1971 : : {
1972 : 181 : tree type = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1973 : 181 : return build_user_type_conversion (type, expr, LOOKUP_NORMAL,
1974 : 181 : tf_warning_or_error);
1975 : : }
1976 : :
1977 : : return NULL_TREE;
1978 : : }
1979 : :
1980 : : /* Implements integral promotion (4.1) and float->double promotion. */
1981 : :
1982 : : tree
1983 : 309329769 : type_promotes_to (tree type)
1984 : : {
1985 : 315322591 : tree promoted_type;
1986 : :
1987 : 315322591 : if (type == error_mark_node)
1988 : : return error_mark_node;
1989 : :
1990 : 315322591 : type = TYPE_MAIN_VARIANT (type);
1991 : :
1992 : : /* Check for promotions of target-defined types first. */
1993 : 315322591 : promoted_type = targetm.promoted_type (type);
1994 : 315322591 : if (promoted_type)
1995 : : return promoted_type;
1996 : :
1997 : : /* bool always promotes to int (not unsigned), even if it's the same
1998 : : size. */
1999 : 315322591 : if (TREE_CODE (type) == BOOLEAN_TYPE)
2000 : 3704845 : type = integer_type_node;
2001 : :
2002 : : /* Normally convert enums to int, but convert wide enums to something
2003 : : wider. Scoped enums don't promote, but pretend they do for backward
2004 : : ABI bug compatibility wrt varargs. */
2005 : 311617746 : else if (TREE_CODE (type) == ENUMERAL_TYPE
2006 : 291820412 : || type == char8_type_node
2007 : 291751011 : || type == char16_type_node
2008 : 291522643 : || type == char32_type_node
2009 : 291135773 : || type == wchar_type_node)
2010 : : {
2011 : 21408710 : tree prom = type;
2012 : :
2013 : 21408710 : if (TREE_CODE (type) == ENUMERAL_TYPE)
2014 : : {
2015 : 19797334 : prom = ENUM_UNDERLYING_TYPE (prom);
2016 : 19797334 : if (!ENUM_IS_SCOPED (type)
2017 : 19797334 : && ENUM_FIXED_UNDERLYING_TYPE_P (type))
2018 : : {
2019 : : /* ISO C++17, 7.6/4. A prvalue of an unscoped enumeration type
2020 : : whose underlying type is fixed (10.2) can be converted to a
2021 : : prvalue of its underlying type. Moreover, if integral promotion
2022 : : can be applied to its underlying type, a prvalue of an unscoped
2023 : : enumeration type whose underlying type is fixed can also be
2024 : : converted to a prvalue of the promoted underlying type. */
2025 : : return type_promotes_to (prom);
2026 : : }
2027 : : }
2028 : :
2029 : 15415888 : int precision = MAX (TYPE_PRECISION (type),
2030 : : TYPE_PRECISION (integer_type_node));
2031 : 15415888 : tree totype = c_common_type_for_size (precision, 0);
2032 : 15415888 : if (TYPE_UNSIGNED (prom)
2033 : 15415888 : && ! int_fits_type_p (TYPE_MAX_VALUE (prom), totype))
2034 : 686821 : prom = c_common_type_for_size (precision, 1);
2035 : : else
2036 : : prom = totype;
2037 : 15415888 : if (SCOPED_ENUM_P (type))
2038 : : {
2039 : 63 : if (abi_version_crosses (6)
2040 : 33 : && TYPE_MODE (prom) != TYPE_MODE (type))
2041 : 60 : warning (OPT_Wabi, "scoped enum %qT passed through %<...%> as "
2042 : : "%qT before %<-fabi-version=6%>, %qT after",
2043 : 30 : type, prom, ENUM_UNDERLYING_TYPE (type));
2044 : 33 : if (!abi_version_at_least (6))
2045 : 15415858 : type = prom;
2046 : : }
2047 : : else
2048 : : type = prom;
2049 : : }
2050 : 290209036 : else if (c_promoting_integer_type_p (type))
2051 : : {
2052 : : /* Retain unsignedness if really not getting bigger. */
2053 : 8114695 : if (TYPE_UNSIGNED (type)
2054 : 8114695 : && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
2055 : 0 : type = unsigned_type_node;
2056 : : else
2057 : 8114695 : type = integer_type_node;
2058 : : }
2059 : 282094341 : else if (type == float_type_node)
2060 : 11462719 : type = double_type_node;
2061 : :
2062 : : return type;
2063 : : }
2064 : :
2065 : : /* The routines below this point are carefully written to conform to
2066 : : the standard. They use the same terminology, and follow the rules
2067 : : closely. Although they are used only in pt.cc at the moment, they
2068 : : should presumably be used everywhere in the future. */
2069 : :
2070 : : /* True iff EXPR can be converted to TYPE via a qualification conversion.
2071 : : Callers should check for identical types before calling this function. */
2072 : :
2073 : : bool
2074 : 51 : can_convert_qual (tree type, tree expr)
2075 : : {
2076 : 51 : tree expr_type = TREE_TYPE (expr);
2077 : 51 : gcc_assert (!same_type_p (type, expr_type));
2078 : :
2079 : : /* A function pointer conversion also counts as a Qualification Adjustment
2080 : : under [over.ics.scs]. */
2081 : 51 : if (fnptr_conv_p (type, expr_type))
2082 : : return true;
2083 : :
2084 : 41 : if (TYPE_PTR_P (type) && TYPE_PTR_P (expr_type))
2085 : 8 : return comp_ptr_ttypes (TREE_TYPE (type), TREE_TYPE (expr_type));
2086 : 33 : else if (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (expr_type))
2087 : 32 : return (same_type_p (TYPE_PTRMEM_CLASS_TYPE (type),
2088 : : TYPE_PTRMEM_CLASS_TYPE (expr_type))
2089 : 61 : && comp_ptr_ttypes (TYPE_PTRMEM_POINTED_TO_TYPE (type),
2090 : 29 : TYPE_PTRMEM_POINTED_TO_TYPE (expr_type)));
2091 : : else
2092 : : return false;
2093 : : }
2094 : :
2095 : : /* Attempt to perform qualification conversions on EXPR to convert it
2096 : : to TYPE. Return the resulting expression, or error_mark_node if
2097 : : the conversion was impossible. Since this is only used by
2098 : : convert_nontype_argument, we fold the conversion. */
2099 : :
2100 : : tree
2101 : 1039 : perform_qualification_conversions (tree type, tree expr)
2102 : : {
2103 : 1039 : tree expr_type;
2104 : :
2105 : 1039 : expr_type = TREE_TYPE (expr);
2106 : :
2107 : 1039 : if (same_type_p (type, expr_type))
2108 : : return expr;
2109 : 21 : else if (can_convert_qual (type, expr))
2110 : 14 : return cp_fold_convert (type, expr);
2111 : : else
2112 : 7 : return error_mark_node;
2113 : : }
2114 : :
2115 : : /* True iff T is a transaction-safe function type. */
2116 : :
2117 : : bool
2118 : 7678338 : tx_safe_fn_type_p (tree t)
2119 : : {
2120 : 7678338 : if (!FUNC_OR_METHOD_TYPE_P (t))
2121 : : return false;
2122 : 7674020 : return !!lookup_attribute ("transaction_safe", TYPE_ATTRIBUTES (t));
2123 : : }
2124 : :
2125 : : /* Return the transaction-unsafe variant of transaction-safe function type
2126 : : T. */
2127 : :
2128 : : tree
2129 : 38 : tx_unsafe_fn_variant (tree t)
2130 : : {
2131 : 38 : gcc_assert (tx_safe_fn_type_p (t));
2132 : 38 : tree attrs = remove_attribute ("transaction_safe",
2133 : 38 : TYPE_ATTRIBUTES (t));
2134 : 38 : return cp_build_type_attribute_variant (t, attrs);
2135 : : }
2136 : :
2137 : : /* Return true iff FROM can convert to TO by a transaction-safety
2138 : : conversion. */
2139 : :
2140 : : static bool
2141 : 95713115 : can_convert_tx_safety (tree to, tree from)
2142 : : {
2143 : 3486 : return (flag_tm && tx_safe_fn_type_p (from)
2144 : 95713151 : && same_type_p (to, tx_unsafe_fn_variant (from)));
2145 : : }
2146 : :
2147 : : /* Return true iff FROM can convert to TO by dropping noexcept.
2148 : : This is just a subroutine of fnptr_conv_p. */
2149 : :
2150 : : static bool
2151 : 96191677 : noexcept_conv_p (tree to, tree from)
2152 : : {
2153 : 96191677 : if (!flag_noexcept_type)
2154 : : return false;
2155 : :
2156 : 95833425 : if (TREE_CODE (to) != TREE_CODE (from))
2157 : : return false;
2158 : 50571214 : if (!FUNC_OR_METHOD_TYPE_P (from))
2159 : : return false;
2160 : 2102672 : if (!type_throw_all_p (to)
2161 : 2102672 : || type_throw_all_p (from))
2162 : 93840 : return false;
2163 : 2008832 : tree v = build_exception_variant (from, NULL_TREE);
2164 : 2008832 : return same_type_p (to, v);
2165 : : }
2166 : :
2167 : : /* Return true iff FROM can convert to TO by a function pointer conversion. */
2168 : :
2169 : : bool
2170 : 96191677 : fnptr_conv_p (tree to, tree from)
2171 : : {
2172 : 96191677 : tree t = to;
2173 : 96191677 : tree f = from;
2174 : 926 : if (TYPE_PTRMEMFUNC_P (t)
2175 : 96192603 : && TYPE_PTRMEMFUNC_P (f))
2176 : : {
2177 : 863 : t = TYPE_PTRMEMFUNC_FN_TYPE (t);
2178 : 863 : f = TYPE_PTRMEMFUNC_FN_TYPE (f);
2179 : : }
2180 : 96191677 : if (INDIRECT_TYPE_P (t)
2181 : 94313099 : && INDIRECT_TYPE_P (f))
2182 : : {
2183 : 94313088 : t = TREE_TYPE (t);
2184 : 94313088 : f = TREE_TYPE (f);
2185 : : }
2186 : :
2187 : 96191677 : return (noexcept_conv_p (t, f)
2188 : 96191677 : || can_convert_tx_safety (t, f));
2189 : : }
2190 : :
2191 : : /* Return FN with any NOP_EXPRs stripped that represent function pointer
2192 : : conversions or conversions to the same type. */
2193 : :
2194 : : tree
2195 : 866 : strip_fnptr_conv (tree fn)
2196 : : {
2197 : 879 : while (TREE_CODE (fn) == NOP_EXPR)
2198 : : {
2199 : 35 : tree op = TREE_OPERAND (fn, 0);
2200 : 35 : tree ft = TREE_TYPE (fn);
2201 : 35 : tree ot = TREE_TYPE (op);
2202 : 70 : if (same_type_p (ft, ot)
2203 : 35 : || fnptr_conv_p (ft, ot))
2204 : : fn = op;
2205 : : else
2206 : : break;
2207 : : }
2208 : 866 : return fn;
2209 : : }
|
