]>
Commit | Line | Data |
---|---|---|
471086d6 | 1 | /* Language-level data type conversion for GNU C++. |
aad93da1 | 2 | Copyright (C) 1987-2017 Free Software Foundation, Inc. |
471086d6 | 3 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
4 | ||
6f0d25a6 | 5 | This file is part of GCC. |
471086d6 | 6 | |
6f0d25a6 | 7 | GCC is free software; you can redistribute it and/or modify |
471086d6 | 8 | it under the terms of the GNU General Public License as published by |
aa139c3f | 9 | the Free Software Foundation; either version 3, or (at your option) |
471086d6 | 10 | any later version. |
11 | ||
6f0d25a6 | 12 | GCC is distributed in the hope that it will be useful, |
471086d6 | 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 | |
aa139c3f | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
471086d6 | 20 | |
21 | ||
af86cc06 | 22 | /* This file contains the functions for converting C++ expressions |
471086d6 | 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" | |
b3ef7553 | 28 | #include "system.h" |
805e22b2 | 29 | #include "coretypes.h" |
4cba6f60 | 30 | #include "target.h" |
4cba6f60 | 31 | #include "cp-tree.h" |
9ed99284 | 32 | #include "stor-layout.h" |
471086d6 | 33 | #include "flags.h" |
ca82e026 | 34 | #include "intl.h" |
471086d6 | 35 | #include "convert.h" |
96624a9e | 36 | |
c4698a21 | 37 | static tree convert_to_pointer_force (tree, tree, tsubst_flags_t); |
ef9571e5 | 38 | static tree build_type_conversion (tree, tree); |
c4698a21 | 39 | static tree build_up_reference (tree, tree, int, tree, tsubst_flags_t); |
19b271a9 | 40 | static void diagnose_ref_binding (location_t, tree, tree, tree); |
71ccdfff | 41 | |
471086d6 | 42 | /* Change of width--truncation and extension of integers or reals-- |
43 | is represented with NOP_EXPR. Proper functioning of many things | |
44 | assumes that no other conversions can be NOP_EXPRs. | |
45 | ||
46 | Conversion between integer and pointer is represented with CONVERT_EXPR. | |
47 | Converting integer to real uses FLOAT_EXPR | |
48 | and real to integer uses FIX_TRUNC_EXPR. | |
49 | ||
50 | Here is a list of all the functions that assume that widening and | |
51 | narrowing is always done with a NOP_EXPR: | |
b981525c | 52 | In convert.c, convert_to_integer[_maybe_fold]. |
471086d6 | 53 | In c-typeck.c, build_binary_op_nodefault (boolean ops), |
653e5405 | 54 | and c_common_truthvalue_conversion. |
471086d6 | 55 | In expr.c: expand_expr, for operands of a MULT_EXPR. |
56 | In fold-const.c: fold. | |
57 | In tree.c: get_narrower and get_unwidened. | |
58 | ||
59 | C++: in multiple-inheritance, converting between pointers may involve | |
60 | adjusting them by a delta stored within the class definition. */ | |
61 | \f | |
62 | /* Subroutines of `convert'. */ | |
63 | ||
471086d6 | 64 | /* if converting pointer to pointer |
65 | if dealing with classes, check for derived->base or vice versa | |
66 | else if dealing with method pointers, delegate | |
67 | else convert blindly | |
68 | else if converting class, pass off to build_type_conversion | |
e5ead12a | 69 | else try C-style pointer conversion. */ |
96624a9e | 70 | |
471086d6 | 71 | static tree |
b981525c | 72 | cp_convert_to_pointer (tree type, tree expr, bool dofold, |
73 | tsubst_flags_t complain) | |
471086d6 | 74 | { |
cd16867a | 75 | tree intype = TREE_TYPE (expr); |
76 | enum tree_code form; | |
f82eeb87 | 77 | tree rval; |
3df42822 | 78 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
61f69bc9 | 79 | |
8bf328bf | 80 | if (intype == error_mark_node) |
81 | return error_mark_node; | |
74002e1d | 82 | |
95397ff9 | 83 | if (MAYBE_CLASS_TYPE_P (intype)) |
96624a9e | 84 | { |
96624a9e | 85 | intype = complete_type (intype); |
4b72716d | 86 | if (!COMPLETE_TYPE_P (intype)) |
96624a9e | 87 | { |
c4698a21 | 88 | if (complain & tf_error) |
89 | error_at (loc, "can%'t convert from incomplete type %qT to %qT", | |
90 | intype, type); | |
96624a9e | 91 | return error_mark_node; |
92 | } | |
93 | ||
8999978b | 94 | rval = build_type_conversion (type, expr); |
96624a9e | 95 | if (rval) |
96 | { | |
c4698a21 | 97 | if ((complain & tf_error) |
98 | && rval == error_mark_node) | |
61f69bc9 | 99 | error_at (loc, "conversion of %qE from %qT to %qT is ambiguous", |
100 | expr, intype, type); | |
96624a9e | 101 | return rval; |
102 | } | |
103 | } | |
104 | ||
860740a7 | 105 | /* Handle anachronistic conversions from (::*)() to cv void* or (*)(). */ |
c21c015b | 106 | if (TYPE_PTR_P (type) |
38281c46 | 107 | && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE |
e3cfe3ce | 108 | || VOID_TYPE_P (TREE_TYPE (type)))) |
38281c46 | 109 | { |
6ab399e8 | 110 | if (TYPE_PTRMEMFUNC_P (intype) |
111 | || TREE_CODE (intype) == METHOD_TYPE) | |
c4698a21 | 112 | return convert_member_func_to_ptr (type, expr, complain); |
c21c015b | 113 | if (TYPE_PTR_P (TREE_TYPE (expr))) |
a63bc44c | 114 | return build_nop (type, expr); |
38281c46 | 115 | intype = TREE_TYPE (expr); |
116 | } | |
117 | ||
311e42bc | 118 | if (expr == error_mark_node) |
119 | return error_mark_node; | |
120 | ||
74002e1d | 121 | form = TREE_CODE (intype); |
122 | ||
2b77484d | 123 | if (POINTER_TYPE_P (intype)) |
471086d6 | 124 | { |
125 | intype = TYPE_MAIN_VARIANT (intype); | |
126 | ||
127 | if (TYPE_MAIN_VARIANT (type) != intype | |
c21c015b | 128 | && TYPE_PTR_P (type) |
471086d6 | 129 | && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE |
95397ff9 | 130 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (type)) |
131 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype)) | |
4a2680fc | 132 | && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE) |
471086d6 | 133 | { |
134 | enum tree_code code = PLUS_EXPR; | |
4a2680fc | 135 | tree binfo; |
8999978b | 136 | tree intype_class; |
137 | tree type_class; | |
138 | bool same_p; | |
4a2680fc | 139 | |
8999978b | 140 | intype_class = TREE_TYPE (intype); |
141 | type_class = TREE_TYPE (type); | |
142 | ||
9031d10b | 143 | same_p = same_type_p (TYPE_MAIN_VARIANT (intype_class), |
8999978b | 144 | TYPE_MAIN_VARIANT (type_class)); |
145 | binfo = NULL_TREE; | |
c0af329c | 146 | /* Try derived to base conversion. */ |
8999978b | 147 | if (!same_p) |
ae260dcc | 148 | binfo = lookup_base (intype_class, type_class, ba_check, |
149 | NULL, complain); | |
8999978b | 150 | if (!same_p && !binfo) |
471086d6 | 151 | { |
c0af329c | 152 | /* Try base to derived conversion. */ |
ae260dcc | 153 | binfo = lookup_base (type_class, intype_class, ba_check, |
154 | NULL, complain); | |
471086d6 | 155 | code = MINUS_EXPR; |
156 | } | |
4a2680fc | 157 | if (binfo == error_mark_node) |
158 | return error_mark_node; | |
8999978b | 159 | if (binfo || same_p) |
471086d6 | 160 | { |
8999978b | 161 | if (binfo) |
c4698a21 | 162 | expr = build_base_path (code, expr, binfo, 0, complain); |
c0af329c | 163 | /* Add any qualifier conversions. */ |
8999978b | 164 | return build_nop (type, expr); |
471086d6 | 165 | } |
166 | } | |
471086d6 | 167 | |
1bc16cab | 168 | if (TYPE_PTRMEMFUNC_P (type)) |
bea7d742 | 169 | { |
c4698a21 | 170 | if (complain & tf_error) |
171 | error_at (loc, "cannot convert %qE from type %qT to type %qT", | |
172 | expr, intype, type); | |
1bc16cab | 173 | return error_mark_node; |
174 | } | |
a17aefa2 | 175 | |
1bc16cab | 176 | return build_nop (type, expr); |
177 | } | |
05765a91 | 178 | else if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype)) |
e5ead12a | 179 | || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype))) |
180 | return convert_ptrmem (type, expr, /*allow_inverse_p=*/false, | |
c4698a21 | 181 | /*c_cast_p=*/false, complain); |
2b77484d | 182 | else if (TYPE_PTRMEMFUNC_P (intype)) |
183 | { | |
a63bc44c | 184 | if (!warn_pmf2ptr) |
185 | { | |
186 | if (TREE_CODE (expr) == PTRMEM_CST) | |
c4698a21 | 187 | return cp_convert_to_pointer (type, PTRMEM_CST_MEMBER (expr), |
b981525c | 188 | dofold, complain); |
a63bc44c | 189 | else if (TREE_CODE (expr) == OFFSET_REF) |
190 | { | |
191 | tree object = TREE_OPERAND (expr, 0); | |
192 | return get_member_function_from_ptrfunc (&object, | |
4405c1ad | 193 | TREE_OPERAND (expr, 1), |
c4698a21 | 194 | complain); |
a63bc44c | 195 | } |
196 | } | |
d3f0af4b | 197 | if (complain & tf_error) |
198 | error_at (loc, "cannot convert %qE from type %qT to type %qT", | |
199 | expr, intype, type); | |
2b77484d | 200 | return error_mark_node; |
201 | } | |
471086d6 | 202 | |
ef434176 | 203 | if (null_ptr_cst_p (expr)) |
471086d6 | 204 | { |
2b77484d | 205 | if (TYPE_PTRMEMFUNC_P (type)) |
cb02169c | 206 | return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0, |
c4698a21 | 207 | /*c_cast_p=*/false, complain); |
ad63a0fc | 208 | |
106c3d67 | 209 | if (complain & tf_warning) |
210 | maybe_warn_zero_as_null_pointer_constant (expr, loc); | |
211 | ||
7ba2f86f | 212 | /* A NULL pointer-to-data-member is represented by -1, not by |
213 | zero. */ | |
214 | tree val = (TYPE_PTRDATAMEM_P (type) | |
215 | ? build_int_cst_type (type, -1) | |
216 | : build_int_cst (type, 0)); | |
217 | ||
218 | return (TREE_SIDE_EFFECTS (expr) | |
219 | ? build2 (COMPOUND_EXPR, type, expr, val) : val); | |
471086d6 | 220 | } |
05765a91 | 221 | else if (TYPE_PTRMEM_P (type) && INTEGRAL_CODE_P (form)) |
de1f960a | 222 | { |
c4698a21 | 223 | if (complain & tf_error) |
224 | error_at (loc, "invalid conversion from %qT to %qT", intype, type); | |
de1f960a | 225 | return error_mark_node; |
226 | } | |
471086d6 | 227 | |
bb0726a1 | 228 | if (INTEGRAL_CODE_P (form)) |
471086d6 | 229 | { |
c5aa1e92 | 230 | if (TYPE_PRECISION (intype) == POINTER_SIZE) |
471086d6 | 231 | return build1 (CONVERT_EXPR, type, expr); |
c4698a21 | 232 | expr = cp_convert (c_common_type_for_size (POINTER_SIZE, 0), expr, |
233 | complain); | |
092b1d6f | 234 | /* Modes may be different but sizes should be the same. There |
235 | is supposed to be some integral type that is the same width | |
236 | as a pointer. */ | |
237 | gcc_assert (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (expr))) | |
238 | == GET_MODE_SIZE (TYPE_MODE (type))); | |
9031d10b | 239 | |
b981525c | 240 | return convert_to_pointer_maybe_fold (type, expr, dofold); |
471086d6 | 241 | } |
242 | ||
cc4d0855 | 243 | if (type_unknown_p (expr)) |
c4698a21 | 244 | return instantiate_type (type, expr, complain); |
cc4d0855 | 245 | |
c4698a21 | 246 | if (complain & tf_error) |
247 | error_at (loc, "cannot convert %qE from type %qT to type %qT", | |
248 | expr, intype, type); | |
471086d6 | 249 | return error_mark_node; |
250 | } | |
251 | ||
252 | /* Like convert, except permit conversions to take place which | |
253 | are not normally allowed due to access restrictions | |
254 | (such as conversion from sub-type to private super-type). */ | |
96624a9e | 255 | |
471086d6 | 256 | static tree |
c4698a21 | 257 | convert_to_pointer_force (tree type, tree expr, tsubst_flags_t complain) |
471086d6 | 258 | { |
cd16867a | 259 | tree intype = TREE_TYPE (expr); |
260 | enum tree_code form = TREE_CODE (intype); | |
9031d10b | 261 | |
471086d6 | 262 | if (form == POINTER_TYPE) |
263 | { | |
264 | intype = TYPE_MAIN_VARIANT (intype); | |
265 | ||
266 | if (TYPE_MAIN_VARIANT (type) != intype | |
267 | && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE | |
95397ff9 | 268 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (type)) |
269 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (intype)) | |
471086d6 | 270 | && TREE_CODE (TREE_TYPE (intype)) == RECORD_TYPE) |
271 | { | |
272 | enum tree_code code = PLUS_EXPR; | |
4a2680fc | 273 | tree binfo; |
274 | ||
275 | binfo = lookup_base (TREE_TYPE (intype), TREE_TYPE (type), | |
ae260dcc | 276 | ba_unique, NULL, complain); |
4a2680fc | 277 | if (!binfo) |
471086d6 | 278 | { |
4a2680fc | 279 | binfo = lookup_base (TREE_TYPE (type), TREE_TYPE (intype), |
ae260dcc | 280 | ba_unique, NULL, complain); |
4a2680fc | 281 | code = MINUS_EXPR; |
471086d6 | 282 | } |
4a2680fc | 283 | if (binfo == error_mark_node) |
284 | return error_mark_node; | |
285 | if (binfo) | |
471086d6 | 286 | { |
c4698a21 | 287 | expr = build_base_path (code, expr, binfo, 0, complain); |
653e5405 | 288 | if (expr == error_mark_node) |
289 | return error_mark_node; | |
c0af329c | 290 | /* Add any qualifier conversions. */ |
4a2680fc | 291 | if (!same_type_p (TREE_TYPE (TREE_TYPE (expr)), |
292 | TREE_TYPE (type))) | |
8999978b | 293 | expr = build_nop (type, expr); |
4a2680fc | 294 | return expr; |
471086d6 | 295 | } |
471086d6 | 296 | } |
471086d6 | 297 | } |
298 | ||
b981525c | 299 | return cp_convert_to_pointer (type, expr, /*fold*/false, complain); |
471086d6 | 300 | } |
301 | ||
302 | /* We are passing something to a function which requires a reference. | |
303 | The type we are interested in is in TYPE. The initial | |
304 | value we have to begin with is in ARG. | |
305 | ||
306 | FLAGS controls how we manage access checking. | |
ca106ab1 | 307 | DIRECT_BIND in FLAGS controls how any temporaries are generated. |
308 | If DIRECT_BIND is set, DECL is the reference we're binding to. */ | |
96624a9e | 309 | |
471086d6 | 310 | static tree |
c4698a21 | 311 | build_up_reference (tree type, tree arg, int flags, tree decl, |
312 | tsubst_flags_t complain) | |
471086d6 | 313 | { |
c76251c1 | 314 | tree rval; |
0543e7a9 | 315 | tree argtype = TREE_TYPE (arg); |
471086d6 | 316 | tree target_type = TREE_TYPE (type); |
471086d6 | 317 | |
b4df430b | 318 | gcc_assert (TREE_CODE (type) == REFERENCE_TYPE); |
471086d6 | 319 | |
18bede74 | 320 | if ((flags & DIRECT_BIND) && ! lvalue_p (arg)) |
471086d6 | 321 | { |
ca106ab1 | 322 | /* Create a new temporary variable. We can't just use a TARGET_EXPR |
323 | here because it needs to live as long as DECL. */ | |
c76251c1 | 324 | tree targ = arg; |
ca106ab1 | 325 | |
5ab1aaca | 326 | arg = make_temporary_var_for_ref_to_temp (decl, target_type); |
c23ebfdd | 327 | |
328 | /* Process the initializer for the declaration. */ | |
38281c46 | 329 | DECL_INITIAL (arg) = targ; |
d91303a6 | 330 | cp_finish_decl (arg, targ, /*init_const_expr_p=*/false, NULL_TREE, |
011310f7 | 331 | LOOKUP_ONLYCONVERTING|DIRECT_BIND); |
1ad432f2 | 332 | } |
049132bc | 333 | else if (!(flags & DIRECT_BIND) && ! obvalue_p (arg)) |
44189c16 | 334 | return get_target_expr_sfinae (arg, complain); |
1ad432f2 | 335 | |
ca106ab1 | 336 | /* If we had a way to wrap this up, and say, if we ever needed its |
b0df6589 | 337 | address, transform all occurrences of the register, into a memory |
338 | reference we could win better. */ | |
44189c16 | 339 | rval = cp_build_addr_expr (arg, complain); |
15e55420 | 340 | if (rval == error_mark_node) |
341 | return error_mark_node; | |
342 | ||
6686e84d | 343 | if ((flags & LOOKUP_PROTECT) |
344 | && TYPE_MAIN_VARIANT (argtype) != TYPE_MAIN_VARIANT (target_type) | |
95397ff9 | 345 | && MAYBE_CLASS_TYPE_P (argtype) |
346 | && MAYBE_CLASS_TYPE_P (target_type)) | |
6686e84d | 347 | { |
7e6960e0 | 348 | /* We go through lookup_base for the access control. */ |
ae260dcc | 349 | tree binfo = lookup_base (argtype, target_type, ba_check, |
350 | NULL, complain); | |
6686e84d | 351 | if (binfo == error_mark_node) |
352 | return error_mark_node; | |
353 | if (binfo == NULL_TREE) | |
354 | return error_not_base_type (target_type, argtype); | |
c4698a21 | 355 | rval = build_base_path (PLUS_EXPR, rval, binfo, 1, complain); |
6686e84d | 356 | } |
c76251c1 | 357 | else |
358 | rval | |
c4698a21 | 359 | = convert_to_pointer_force (build_pointer_type (target_type), |
360 | rval, complain); | |
8999978b | 361 | return build_nop (type, rval); |
471086d6 | 362 | } |
363 | ||
519ba62c | 364 | /* Subroutine of convert_to_reference. REFTYPE is the target reference type. |
365 | INTYPE is the original rvalue type and DECL is an optional _DECL node | |
366 | for diagnostics. | |
9031d10b | 367 | |
519ba62c | 368 | [dcl.init.ref] says that if an rvalue is used to |
369 | initialize a reference, then the reference must be to a | |
370 | non-volatile const type. */ | |
371 | ||
372 | static void | |
19b271a9 | 373 | diagnose_ref_binding (location_t loc, tree reftype, tree intype, tree decl) |
519ba62c | 374 | { |
375 | tree ttl = TREE_TYPE (reftype); | |
9031d10b | 376 | |
519ba62c | 377 | if (!CP_TYPE_CONST_NON_VOLATILE_P (ttl)) |
378 | { | |
379 | const char *msg; | |
380 | ||
381 | if (CP_TYPE_VOLATILE_P (ttl) && decl) | |
ca82e026 | 382 | msg = G_("initialization of volatile reference type %q#T from " |
383 | "rvalue of type %qT"); | |
519ba62c | 384 | else if (CP_TYPE_VOLATILE_P (ttl)) |
ca82e026 | 385 | msg = G_("conversion to volatile reference type %q#T " |
386 | "from rvalue of type %qT"); | |
519ba62c | 387 | else if (decl) |
ca82e026 | 388 | msg = G_("initialization of non-const reference type %q#T from " |
389 | "rvalue of type %qT"); | |
519ba62c | 390 | else |
ca82e026 | 391 | msg = G_("conversion to non-const reference type %q#T from " |
392 | "rvalue of type %qT"); | |
519ba62c | 393 | |
61f69bc9 | 394 | permerror (loc, msg, reftype, intype); |
519ba62c | 395 | } |
396 | } | |
397 | ||
471086d6 | 398 | /* For C++: Only need to do one-level references, but cannot |
399 | get tripped up on signed/unsigned differences. | |
400 | ||
d81e00a4 | 401 | DECL is either NULL_TREE or the _DECL node for a reference that is being |
402 | initialized. It can be error_mark_node if we don't know the _DECL but | |
403 | we know it's an initialization. */ | |
471086d6 | 404 | |
471086d6 | 405 | tree |
35771a9a | 406 | convert_to_reference (tree reftype, tree expr, int convtype, |
c4698a21 | 407 | int flags, tree decl, tsubst_flags_t complain) |
471086d6 | 408 | { |
cd16867a | 409 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (reftype)); |
410 | tree intype; | |
471086d6 | 411 | tree rval = NULL_TREE; |
1a3f833b | 412 | tree rval_as_conversion = NULL_TREE; |
1bc16cab | 413 | bool can_convert_intype_to_type; |
3df42822 | 414 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
1a3f833b | 415 | |
9031d10b | 416 | if (TREE_CODE (type) == FUNCTION_TYPE |
d32df6a6 | 417 | && TREE_TYPE (expr) == unknown_type_node) |
66bbeb85 | 418 | expr = instantiate_type (type, expr, complain); |
0a3b29ad | 419 | |
420 | if (expr == error_mark_node) | |
421 | return error_mark_node; | |
422 | ||
423 | intype = TREE_TYPE (expr); | |
cc4d0855 | 424 | |
b4df430b | 425 | gcc_assert (TREE_CODE (intype) != REFERENCE_TYPE); |
ab12ed55 | 426 | gcc_assert (TREE_CODE (reftype) == REFERENCE_TYPE); |
471086d6 | 427 | |
471086d6 | 428 | intype = TYPE_MAIN_VARIANT (intype); |
429 | ||
b657f346 | 430 | can_convert_intype_to_type = can_convert_standard (type, intype, complain); |
66bbeb85 | 431 | |
1bc16cab | 432 | if (!can_convert_intype_to_type |
95397ff9 | 433 | && (convtype & CONV_IMPLICIT) && MAYBE_CLASS_TYPE_P (intype) |
1a3f833b | 434 | && ! (flags & LOOKUP_NO_CONVERSION)) |
435 | { | |
436 | /* Look for a user-defined conversion to lvalue that we can use. */ | |
437 | ||
0a4be248 | 438 | rval_as_conversion |
8999978b | 439 | = build_type_conversion (reftype, expr); |
1a3f833b | 440 | |
441 | if (rval_as_conversion && rval_as_conversion != error_mark_node | |
18bede74 | 442 | && lvalue_p (rval_as_conversion)) |
1a3f833b | 443 | { |
444 | expr = rval_as_conversion; | |
445 | rval_as_conversion = NULL_TREE; | |
446 | intype = type; | |
1bc16cab | 447 | can_convert_intype_to_type = 1; |
1a3f833b | 448 | } |
449 | } | |
450 | ||
b657f346 | 451 | if (((convtype & CONV_STATIC) |
452 | && can_convert_standard (intype, type, complain)) | |
1bc16cab | 453 | || ((convtype & CONV_IMPLICIT) && can_convert_intype_to_type)) |
471086d6 | 454 | { |
c4698a21 | 455 | { |
456 | tree ttl = TREE_TYPE (reftype); | |
457 | tree ttr = lvalue_type (expr); | |
471086d6 | 458 | |
19b271a9 | 459 | if ((complain & tf_error) |
18bede74 | 460 | && ! lvalue_p (expr)) |
19b271a9 | 461 | diagnose_ref_binding (loc, reftype, intype, decl); |
9031d10b | 462 | |
c4698a21 | 463 | if (! (convtype & CONV_CONST) |
464 | && !at_least_as_qualified_p (ttl, ttr)) | |
465 | { | |
466 | if (complain & tf_error) | |
467 | permerror (loc, "conversion from %qT to %qT discards qualifiers", | |
468 | ttr, reftype); | |
469 | else | |
470 | return error_mark_node; | |
471 | } | |
472 | } | |
0543e7a9 | 473 | |
c4698a21 | 474 | return build_up_reference (reftype, expr, flags, decl, complain); |
471086d6 | 475 | } |
049132bc | 476 | else if ((convtype & CONV_REINTERPRET) && obvalue_p (expr)) |
0543e7a9 | 477 | { |
478 | /* When casting an lvalue to a reference type, just convert into | |
479 | a pointer to the new type and deference it. This is allowed | |
e581f478 | 480 | by San Diego WP section 5.2.9 paragraph 12, though perhaps it |
0543e7a9 | 481 | should be done directly (jason). (int &)ri ---> *(int*)&ri */ |
e581f478 | 482 | |
3748625f | 483 | /* B* bp; A& ar = (A&)bp; is valid, but it's probably not what they |
653e5405 | 484 | meant. */ |
c4698a21 | 485 | if ((complain & tf_warning) |
c21c015b | 486 | && TYPE_PTR_P (intype) |
a09db423 | 487 | && (comptypes (TREE_TYPE (intype), type, |
488 | COMPARE_BASE | COMPARE_DERIVED))) | |
61f69bc9 | 489 | warning_at (loc, 0, "casting %qT to %qT does not dereference pointer", |
490 | intype, reftype); | |
9031d10b | 491 | |
c4698a21 | 492 | rval = cp_build_addr_expr (expr, complain); |
0543e7a9 | 493 | if (rval != error_mark_node) |
985e9ee0 | 494 | rval = convert_force (build_pointer_type (TREE_TYPE (reftype)), |
c4698a21 | 495 | rval, 0, complain); |
0543e7a9 | 496 | if (rval != error_mark_node) |
b0722fac | 497 | rval = build1 (NOP_EXPR, reftype, rval); |
0543e7a9 | 498 | } |
0a4be248 | 499 | else |
860740a7 | 500 | { |
501 | rval = convert_for_initialization (NULL_TREE, type, expr, flags, | |
c4698a21 | 502 | ICR_CONVERTING, 0, 0, complain); |
a66fe4cb | 503 | if (rval == NULL_TREE || rval == error_mark_node) |
504 | return rval; | |
19b271a9 | 505 | if (complain & tf_error) |
506 | diagnose_ref_binding (loc, reftype, intype, decl); | |
c4698a21 | 507 | rval = build_up_reference (reftype, rval, flags, decl, complain); |
860740a7 | 508 | } |
471086d6 | 509 | |
510 | if (rval) | |
511 | { | |
96624a9e | 512 | /* If we found a way to convert earlier, then use it. */ |
471086d6 | 513 | return rval; |
514 | } | |
515 | ||
c4698a21 | 516 | if (complain & tf_error) |
61f69bc9 | 517 | error_at (loc, "cannot convert type %qT to type %qT", intype, reftype); |
b248d3f7 | 518 | |
471086d6 | 519 | return error_mark_node; |
520 | } | |
521 | ||
522 | /* We are using a reference VAL for its value. Bash that reference all the | |
96624a9e | 523 | way down to its lowest form. */ |
524 | ||
471086d6 | 525 | tree |
35771a9a | 526 | convert_from_reference (tree val) |
471086d6 | 527 | { |
73bdcca2 | 528 | if (TREE_TYPE (val) |
529 | && TREE_CODE (TREE_TYPE (val)) == REFERENCE_TYPE) | |
729f89ff | 530 | { |
2fb61329 | 531 | tree t = TREE_TYPE (TREE_TYPE (val)); |
729f89ff | 532 | tree ref = build1 (INDIRECT_REF, t, val); |
9031d10b | 533 | |
3d37a176 | 534 | mark_exp_read (val); |
729f89ff | 535 | /* We *must* set TREE_READONLY when dereferencing a pointer to const, |
536 | so that we get the proper error message if the result is used | |
537 | to assign to. Also, &* is supposed to be a no-op. */ | |
538 | TREE_READONLY (ref) = CP_TYPE_CONST_P (t); | |
539 | TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t); | |
540 | TREE_SIDE_EFFECTS (ref) | |
541 | = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (val)); | |
729f89ff | 542 | val = ref; |
543 | } | |
9031d10b | 544 | |
471086d6 | 545 | return val; |
546 | } | |
e5dab226 | 547 | |
548 | /* Really perform an lvalue-to-rvalue conversion, including copying an | |
549 | argument of class type into a temporary. */ | |
550 | ||
551 | tree | |
9e505437 | 552 | force_rvalue (tree expr, tsubst_flags_t complain) |
e5dab226 | 553 | { |
9e505437 | 554 | tree type = TREE_TYPE (expr); |
555 | if (MAYBE_CLASS_TYPE_P (type) && TREE_CODE (expr) != TARGET_EXPR) | |
556 | { | |
f1f41a6c | 557 | vec<tree, va_gc> *args = make_tree_vector_single (expr); |
9e505437 | 558 | expr = build_special_member_call (NULL_TREE, complete_ctor_identifier, |
559 | &args, type, LOOKUP_NORMAL, complain); | |
560 | release_tree_vector (args); | |
561 | expr = build_cplus_new (type, expr, complain); | |
562 | } | |
e5dab226 | 563 | else |
4405c1ad | 564 | expr = decay_conversion (expr, complain); |
e5dab226 | 565 | |
566 | return expr; | |
567 | } | |
f5220369 | 568 | |
471086d6 | 569 | \f |
a1f05651 | 570 | /* If EXPR and ORIG are INTEGER_CSTs, return a version of EXPR that has |
571 | TREE_OVERFLOW set only if it is set in ORIG. Otherwise, return EXPR | |
572 | unchanged. */ | |
573 | ||
574 | static tree | |
575 | ignore_overflows (tree expr, tree orig) | |
576 | { | |
577 | if (TREE_CODE (expr) == INTEGER_CST | |
578 | && TREE_CODE (orig) == INTEGER_CST | |
579 | && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig)) | |
580 | { | |
581 | gcc_assert (!TREE_OVERFLOW (orig)); | |
582 | /* Ensure constant sharing. */ | |
e913b5cd | 583 | expr = wide_int_to_tree (TREE_TYPE (expr), expr); |
a1f05651 | 584 | } |
585 | return expr; | |
586 | } | |
587 | ||
588 | /* Fold away simple conversions, but make sure TREE_OVERFLOW is set | |
589 | properly. */ | |
f5220369 | 590 | |
591 | tree | |
592 | cp_fold_convert (tree type, tree expr) | |
593 | { | |
fe565588 | 594 | tree conv; |
595 | if (TREE_TYPE (expr) == type) | |
596 | conv = expr; | |
597 | else if (TREE_CODE (expr) == PTRMEM_CST) | |
598 | { | |
599 | /* Avoid wrapping a PTRMEM_CST in NOP_EXPR. */ | |
600 | conv = copy_node (expr); | |
601 | TREE_TYPE (conv) = type; | |
602 | } | |
603 | else | |
604 | { | |
605 | conv = fold_convert (type, expr); | |
606 | conv = ignore_overflows (conv, expr); | |
607 | } | |
a1f05651 | 608 | return conv; |
f5220369 | 609 | } |
610 | ||
c4a8ac95 | 611 | /* C++ conversions, preference to static cast conversions. */ |
612 | ||
613 | tree | |
c4698a21 | 614 | cp_convert (tree type, tree expr, tsubst_flags_t complain) |
c4a8ac95 | 615 | { |
c4698a21 | 616 | return ocp_convert (type, expr, CONV_OLD_CONVERT, LOOKUP_NORMAL, complain); |
c4a8ac95 | 617 | } |
618 | ||
59dd8856 | 619 | /* C++ equivalent of convert_and_check but using cp_convert as the |
620 | conversion function. | |
621 | ||
622 | Convert EXPR to TYPE, warning about conversion problems with constants. | |
623 | Invoke this function on every expression that is converted implicitly, | |
624 | i.e. because of language rules and not because of an explicit cast. */ | |
625 | ||
626 | tree | |
c4698a21 | 627 | cp_convert_and_check (tree type, tree expr, tsubst_flags_t complain) |
59dd8856 | 628 | { |
629 | tree result; | |
630 | ||
631 | if (TREE_TYPE (expr) == type) | |
632 | return expr; | |
d2c63826 | 633 | if (expr == error_mark_node) |
634 | return expr; | |
c4698a21 | 635 | result = cp_convert (type, expr, complain); |
59dd8856 | 636 | |
c4698a21 | 637 | if ((complain & tf_warning) |
65615944 | 638 | && c_inhibit_evaluation_warnings == 0) |
639 | { | |
d2c63826 | 640 | tree folded = cp_fully_fold (expr); |
641 | tree folded_result; | |
642 | if (folded == expr) | |
643 | folded_result = result; | |
644 | else | |
645 | { | |
646 | /* Avoid bogus -Wparentheses warnings. */ | |
93a735ed | 647 | warning_sentinel w (warn_parentheses); |
bed03df1 | 648 | warning_sentinel c (warn_int_in_bool_context); |
d2c63826 | 649 | folded_result = cp_convert (type, folded, tf_none); |
650 | } | |
651 | folded_result = fold_simple (folded_result); | |
652 | if (!TREE_OVERFLOW_P (folded) | |
65615944 | 653 | && folded_result != error_mark_node) |
3d27a0fa | 654 | warnings_for_convert_and_check (EXPR_LOC_OR_LOC (expr, input_location), |
655 | type, folded, folded_result); | |
65615944 | 656 | } |
59dd8856 | 657 | |
658 | return result; | |
659 | } | |
660 | ||
b248d3f7 | 661 | /* Conversion... |
662 | ||
663 | FLAGS indicates how we should behave. */ | |
664 | ||
471086d6 | 665 | tree |
c4698a21 | 666 | ocp_convert (tree type, tree expr, int convtype, int flags, |
667 | tsubst_flags_t complain) | |
471086d6 | 668 | { |
cd16867a | 669 | tree e = expr; |
670 | enum tree_code code = TREE_CODE (type); | |
7a979707 | 671 | const char *invalid_conv_diag; |
2b3c93a3 | 672 | tree e1; |
3df42822 | 673 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
b981525c | 674 | bool dofold = (convtype & CONV_FOLD); |
471086d6 | 675 | |
1bc16cab | 676 | if (error_operand_p (e) || type == error_mark_node) |
471086d6 | 677 | return error_mark_node; |
d81e00a4 | 678 | |
5b592939 | 679 | complete_type (type); |
680 | complete_type (TREE_TYPE (expr)); | |
681 | ||
7a979707 | 682 | if ((invalid_conv_diag |
683 | = targetm.invalid_conversion (TREE_TYPE (expr), type))) | |
684 | { | |
c4698a21 | 685 | if (complain & tf_error) |
686 | error (invalid_conv_diag); | |
7a979707 | 687 | return error_mark_node; |
688 | } | |
689 | ||
ce984e5e | 690 | /* FIXME remove when moving to c_fully_fold model. */ |
0a7452a8 | 691 | if (!CLASS_TYPE_P (type)) |
692 | e = scalar_constant_value (e); | |
7a00f939 | 693 | if (error_operand_p (e)) |
694 | return error_mark_node; | |
7745052b | 695 | |
c821ae1a | 696 | if (MAYBE_CLASS_TYPE_P (type) && (convtype & CONV_FORCE_TEMP)) |
ceab25e5 | 697 | /* We need a new temporary; don't take this shortcut. */; |
930e8175 | 698 | else if (same_type_ignoring_top_level_qualifiers_p (type, TREE_TYPE (e))) |
ca23ec64 | 699 | { |
daf9ff67 | 700 | if (same_type_p (type, TREE_TYPE (e))) |
ca23ec64 | 701 | /* The call to fold will not always remove the NOP_EXPR as |
702 | might be expected, since if one of the types is a typedef; | |
755edffd | 703 | the comparison in fold is just equality of pointers, not a |
a09db423 | 704 | call to comptypes. We don't call fold in this case because |
f699c174 | 705 | that can result in infinite recursion; fold will call |
706 | convert, which will call ocp_convert, etc. */ | |
707 | return e; | |
372e0e29 | 708 | /* For complex data types, we need to perform componentwise |
653e5405 | 709 | conversion. */ |
372e0e29 | 710 | else if (TREE_CODE (type) == COMPLEX_TYPE) |
b981525c | 711 | return convert_to_complex_maybe_fold (type, e, dofold); |
76249021 | 712 | else if (VECTOR_TYPE_P (type)) |
d2c63826 | 713 | return convert_to_vector (type, e); |
bdb2219e | 714 | else if (TREE_CODE (e) == TARGET_EXPR) |
715 | { | |
716 | /* Don't build a NOP_EXPR of class type. Instead, change the | |
930e8175 | 717 | type of the temporary. */ |
bdb2219e | 718 | TREE_TYPE (e) = TREE_TYPE (TARGET_EXPR_SLOT (e)) = type; |
719 | return e; | |
720 | } | |
ca23ec64 | 721 | else |
092b1d6f | 722 | { |
723 | /* We shouldn't be treating objects of ADDRESSABLE type as | |
724 | rvalues. */ | |
725 | gcc_assert (!TREE_ADDRESSABLE (type)); | |
d2c63826 | 726 | return build_nop (type, e); |
092b1d6f | 727 | } |
ca23ec64 | 728 | } |
729 | ||
2b3c93a3 | 730 | e1 = targetm.convert_to_type (type, e); |
731 | if (e1) | |
732 | return e1; | |
733 | ||
d81e00a4 | 734 | if (code == VOID_TYPE && (convtype & CONV_STATIC)) |
95b2ac55 | 735 | { |
c4698a21 | 736 | e = convert_to_void (e, ICV_CAST, complain); |
aeef2be5 | 737 | return e; |
95b2ac55 | 738 | } |
d81e00a4 | 739 | |
bb0726a1 | 740 | if (INTEGRAL_CODE_P (code)) |
471086d6 | 741 | { |
617abf06 | 742 | tree intype = TREE_TYPE (e); |
a1f05651 | 743 | tree converted; |
384590d4 | 744 | |
745 | if (TREE_CODE (type) == ENUMERAL_TYPE) | |
746 | { | |
747 | /* enum = enum, enum = int, enum = float, (enum)pointer are all | |
748 | errors. */ | |
749 | if (((INTEGRAL_OR_ENUMERATION_TYPE_P (intype) | |
653e5405 | 750 | || TREE_CODE (intype) == REAL_TYPE) |
b312a686 | 751 | && ! (convtype & CONV_STATIC)) |
c21c015b | 752 | || TYPE_PTR_P (intype)) |
384590d4 | 753 | { |
c4698a21 | 754 | if (complain & tf_error) |
61f69bc9 | 755 | permerror (loc, "conversion from %q#T to %q#T", intype, type); |
c4698a21 | 756 | else |
384590d4 | 757 | return error_mark_node; |
758 | } | |
759 | ||
760 | /* [expr.static.cast] | |
761 | ||
762 | 8. A value of integral or enumeration type can be explicitly | |
763 | converted to an enumeration type. The value is unchanged if | |
764 | the original value is within the range of the enumeration | |
765 | values. Otherwise, the resulting enumeration value is | |
766 | unspecified. */ | |
c4698a21 | 767 | if ((complain & tf_warning) |
c28ddc97 | 768 | && TREE_CODE (e) == INTEGER_CST |
0116c9f8 | 769 | && ENUM_UNDERLYING_TYPE (type) |
c28ddc97 | 770 | && !int_fits_type_p (e, ENUM_UNDERLYING_TYPE (type))) |
61f69bc9 | 771 | warning_at (loc, OPT_Wconversion, |
772 | "the result of the conversion is unspecified because " | |
773 | "%qE is outside the range of type %qT", | |
774 | expr, type); | |
471086d6 | 775 | } |
95397ff9 | 776 | if (MAYBE_CLASS_TYPE_P (intype)) |
471086d6 | 777 | { |
778 | tree rval; | |
8999978b | 779 | rval = build_type_conversion (type, e); |
6495357a | 780 | if (rval) |
781 | return rval; | |
c4698a21 | 782 | if (complain & tf_error) |
61f69bc9 | 783 | error_at (loc, "%q#T used where a %qT was expected", intype, type); |
471086d6 | 784 | return error_mark_node; |
785 | } | |
bb0726a1 | 786 | if (code == BOOLEAN_TYPE) |
f8913d47 | 787 | { |
c21c015b | 788 | if (VOID_TYPE_P (intype)) |
61f69bc9 | 789 | { |
c4698a21 | 790 | if (complain & tf_error) |
791 | error_at (loc, | |
792 | "could not convert %qE from %<void%> to %<bool%>", | |
793 | expr); | |
61f69bc9 | 794 | return error_mark_node; |
795 | } | |
796 | ||
f8913d47 | 797 | /* We can't implicitly convert a scoped enum to bool, so convert |
798 | to the underlying type first. */ | |
799 | if (SCOPED_ENUM_P (intype) && (convtype & CONV_STATIC)) | |
172fff7b | 800 | e = build_nop (ENUM_UNDERLYING_TYPE (intype), e); |
493196c0 | 801 | if (complain & tf_warning) |
802 | return cp_truthvalue_conversion (e); | |
803 | else | |
804 | { | |
805 | /* Prevent bogus -Wint-in-bool-context warnings coming | |
806 | from c_common_truthvalue_conversion down the line. */ | |
807 | warning_sentinel w (warn_int_in_bool_context); | |
808 | return cp_truthvalue_conversion (e); | |
809 | } | |
f8913d47 | 810 | } |
ce871053 | 811 | |
b981525c | 812 | converted = convert_to_integer_maybe_fold (type, e, dofold); |
a1f05651 | 813 | |
814 | /* Ignore any integer overflow caused by the conversion. */ | |
815 | return ignore_overflows (converted, e); | |
471086d6 | 816 | } |
c7ca48ea | 817 | if (NULLPTR_TYPE_P (type) && e && null_ptr_cst_p (e)) |
49858f84 | 818 | { |
819 | if (complain & tf_warning) | |
820 | maybe_warn_zero_as_null_pointer_constant (e, loc); | |
821 | return nullptr_node; | |
822 | } | |
05765a91 | 823 | if (POINTER_TYPE_P (type) || TYPE_PTRMEM_P (type)) |
b981525c | 824 | return cp_convert_to_pointer (type, e, dofold, complain); |
684b9d79 | 825 | if (code == VECTOR_TYPE) |
c37ff371 | 826 | { |
827 | tree in_vtype = TREE_TYPE (e); | |
95397ff9 | 828 | if (MAYBE_CLASS_TYPE_P (in_vtype)) |
c37ff371 | 829 | { |
830 | tree ret_val; | |
831 | ret_val = build_type_conversion (type, e); | |
653e5405 | 832 | if (ret_val) |
833 | return ret_val; | |
c4698a21 | 834 | if (complain & tf_error) |
835 | error_at (loc, "%q#T used where a %qT was expected", | |
836 | in_vtype, type); | |
653e5405 | 837 | return error_mark_node; |
c37ff371 | 838 | } |
d2c63826 | 839 | return convert_to_vector (type, e); |
c37ff371 | 840 | } |
c4a8ac95 | 841 | if (code == REAL_TYPE || code == COMPLEX_TYPE) |
471086d6 | 842 | { |
95397ff9 | 843 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (e))) |
471086d6 | 844 | { |
845 | tree rval; | |
8999978b | 846 | rval = build_type_conversion (type, e); |
471086d6 | 847 | if (rval) |
848 | return rval; | |
c4698a21 | 849 | else if (complain & tf_error) |
850 | error_at (loc, | |
851 | "%q#T used where a floating point value was expected", | |
852 | TREE_TYPE (e)); | |
471086d6 | 853 | } |
c4a8ac95 | 854 | if (code == REAL_TYPE) |
b981525c | 855 | return convert_to_real_maybe_fold (type, e, dofold); |
c4a8ac95 | 856 | else if (code == COMPLEX_TYPE) |
b981525c | 857 | return convert_to_complex_maybe_fold (type, e, dofold); |
471086d6 | 858 | } |
859 | ||
860 | /* New C++ semantics: since assignment is now based on | |
861 | memberwise copying, if the rhs type is derived from the | |
862 | lhs type, then we may still do a conversion. */ | |
95397ff9 | 863 | if (RECORD_OR_UNION_CODE_P (code)) |
471086d6 | 864 | { |
865 | tree dtype = TREE_TYPE (e); | |
c25194fd | 866 | tree ctor = NULL_TREE; |
471086d6 | 867 | |
471086d6 | 868 | dtype = TYPE_MAIN_VARIANT (dtype); |
869 | ||
471086d6 | 870 | /* Conversion between aggregate types. New C++ semantics allow |
871 | objects of derived type to be cast to objects of base type. | |
872 | Old semantics only allowed this between pointers. | |
873 | ||
874 | There may be some ambiguity between using a constructor | |
875 | vs. using a type conversion operator when both apply. */ | |
876 | ||
0a4be248 | 877 | ctor = e; |
860740a7 | 878 | |
44189c16 | 879 | if (abstract_virtuals_error_sfinae (NULL_TREE, type, complain)) |
8c18e707 | 880 | return error_mark_node; |
6cbb4197 | 881 | |
f82f1250 | 882 | if (BRACE_ENCLOSED_INITIALIZER_P (ctor)) |
c4698a21 | 883 | ctor = perform_implicit_conversion (type, ctor, complain); |
f82f1250 | 884 | else if ((flags & LOOKUP_ONLYCONVERTING) |
885 | && ! (CLASS_TYPE_P (dtype) && DERIVED_FROM_P (type, dtype))) | |
fce73460 | 886 | /* For copy-initialization, first we create a temp of the proper type |
887 | with a user-defined conversion sequence, then we direct-initialize | |
888 | the target with the temp (see [dcl.init]). */ | |
c4698a21 | 889 | ctor = build_user_type_conversion (type, ctor, flags, complain); |
3eb89cd8 | 890 | else |
f352a3fb | 891 | { |
f1f41a6c | 892 | vec<tree, va_gc> *ctor_vec = make_tree_vector_single (ctor); |
f352a3fb | 893 | ctor = build_special_member_call (NULL_TREE, |
894 | complete_ctor_identifier, | |
895 | &ctor_vec, | |
c4698a21 | 896 | type, flags, complain); |
f352a3fb | 897 | release_tree_vector (ctor_vec); |
898 | } | |
0a4be248 | 899 | if (ctor) |
c4698a21 | 900 | return build_cplus_new (type, ctor, complain); |
471086d6 | 901 | } |
902 | ||
c4698a21 | 903 | if (complain & tf_error) |
a7cc1549 | 904 | { |
905 | /* If the conversion failed and expr was an invalid use of pointer to | |
906 | member function, try to report a meaningful error. */ | |
5c874cd3 | 907 | if (invalid_nonstatic_memfn_p (loc, expr, complain)) |
a7cc1549 | 908 | /* We displayed the error message. */; |
909 | else | |
61f69bc9 | 910 | error_at (loc, "conversion from %qT to non-scalar type %qT requested", |
911 | TREE_TYPE (expr), type); | |
a7cc1549 | 912 | } |
471086d6 | 913 | return error_mark_node; |
914 | } | |
915 | ||
3ae3cb42 | 916 | /* If CALL is a call, return the callee; otherwise null. */ |
917 | ||
918 | tree | |
919 | cp_get_callee (tree call) | |
920 | { | |
921 | if (call == NULL_TREE) | |
922 | return call; | |
923 | else if (TREE_CODE (call) == CALL_EXPR) | |
924 | return CALL_EXPR_FN (call); | |
925 | else if (TREE_CODE (call) == AGGR_INIT_EXPR) | |
926 | return AGGR_INIT_EXPR_FN (call); | |
927 | return NULL_TREE; | |
928 | } | |
929 | ||
ddd2a3d4 | 930 | /* FN is the callee of a CALL_EXPR or AGGR_INIT_EXPR; return the FUNCTION_DECL |
931 | if we can. */ | |
932 | ||
933 | tree | |
934 | cp_get_fndecl_from_callee (tree fn) | |
935 | { | |
936 | if (fn == NULL_TREE) | |
937 | return fn; | |
938 | if (TREE_CODE (fn) == FUNCTION_DECL) | |
939 | return fn; | |
940 | tree type = TREE_TYPE (fn); | |
941 | if (type == unknown_type_node) | |
942 | return NULL_TREE; | |
943 | gcc_assert (POINTER_TYPE_P (type)); | |
944 | fn = maybe_constant_init (fn); | |
945 | STRIP_NOPS (fn); | |
946 | if (TREE_CODE (fn) == ADDR_EXPR) | |
947 | { | |
948 | fn = TREE_OPERAND (fn, 0); | |
949 | if (TREE_CODE (fn) == FUNCTION_DECL) | |
950 | return fn; | |
951 | } | |
952 | return NULL_TREE; | |
953 | } | |
954 | ||
955 | /* Like get_callee_fndecl, but handles AGGR_INIT_EXPR as well and uses the | |
956 | constexpr machinery. */ | |
957 | ||
958 | tree | |
959 | cp_get_callee_fndecl (tree call) | |
960 | { | |
961 | return cp_get_fndecl_from_callee (cp_get_callee (call)); | |
962 | } | |
963 | ||
964 | /* Subroutine of convert_to_void. Warn if we're discarding something with | |
965 | attribute [[nodiscard]]. */ | |
966 | ||
967 | static void | |
968 | maybe_warn_nodiscard (tree expr, impl_conv_void implicit) | |
969 | { | |
970 | tree call = expr; | |
971 | if (TREE_CODE (expr) == TARGET_EXPR) | |
972 | call = TARGET_EXPR_INITIAL (expr); | |
973 | location_t loc = EXPR_LOC_OR_LOC (call, input_location); | |
974 | tree callee = cp_get_callee (call); | |
975 | if (!callee) | |
976 | return; | |
977 | ||
978 | tree type = TREE_TYPE (callee); | |
979 | if (TYPE_PTRMEMFUNC_P (type)) | |
980 | type = TYPE_PTRMEMFUNC_FN_TYPE (type); | |
981 | if (POINTER_TYPE_P (type)) | |
982 | type = TREE_TYPE (type); | |
983 | ||
984 | tree rettype = TREE_TYPE (type); | |
985 | tree fn = cp_get_fndecl_from_callee (callee); | |
986 | if (implicit != ICV_CAST && fn | |
987 | && lookup_attribute ("nodiscard", DECL_ATTRIBUTES (fn))) | |
988 | { | |
989 | if (warning_at (loc, OPT_Wunused_result, | |
990 | "ignoring return value of %qD, " | |
991 | "declared with attribute nodiscard", fn)) | |
992 | inform (DECL_SOURCE_LOCATION (fn), "declared here"); | |
993 | } | |
994 | else if (implicit != ICV_CAST | |
995 | && lookup_attribute ("nodiscard", TYPE_ATTRIBUTES (rettype))) | |
996 | { | |
997 | if (warning_at (loc, OPT_Wunused_result, | |
998 | "ignoring returned value of type %qT, " | |
999 | "declared with attribute nodiscard", rettype)) | |
1000 | { | |
1001 | if (fn) | |
1002 | inform (DECL_SOURCE_LOCATION (fn), | |
1003 | "in call to %qD, declared here", fn); | |
1004 | inform (DECL_SOURCE_LOCATION (TYPE_NAME (rettype)), | |
1005 | "%qT declared here", rettype); | |
1006 | } | |
1007 | } | |
1008 | else if (TREE_CODE (expr) == TARGET_EXPR | |
1009 | && lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (type))) | |
1010 | { | |
1011 | /* The TARGET_EXPR confuses do_warn_unused_result into thinking that the | |
1012 | result is used, so handle that case here. */ | |
1013 | if (fn) | |
1014 | { | |
1015 | if (warning_at (loc, OPT_Wunused_result, | |
1016 | "ignoring return value of %qD, " | |
1017 | "declared with attribute warn_unused_result", | |
1018 | fn)) | |
1019 | inform (DECL_SOURCE_LOCATION (fn), "declared here"); | |
1020 | } | |
1021 | else | |
1022 | warning_at (loc, OPT_Wunused_result, | |
1023 | "ignoring return value of function " | |
1024 | "declared with attribute warn_unused_result"); | |
1025 | } | |
1026 | } | |
1027 | ||
b1a8d4ce | 1028 | /* When an expression is used in a void context, its value is discarded and |
1029 | no lvalue-rvalue and similar conversions happen [expr.static.cast/4, | |
1030 | stmt.expr/1, expr.comma/1]. This permits dereferencing an incomplete type | |
1031 | in a void context. The C++ standard does not define what an `access' to an | |
63eff20d | 1032 | object is, but there is reason to believe that it is the lvalue to rvalue |
b1a8d4ce | 1033 | conversion -- if it were not, `*&*p = 1' would violate [expr]/4 in that it |
1034 | accesses `*p' not to calculate the value to be stored. But, dcl.type.cv/8 | |
1035 | indicates that volatile semantics should be the same between C and C++ | |
1036 | where ever possible. C leaves it implementation defined as to what | |
1037 | constitutes an access to a volatile. So, we interpret `*vp' as a read of | |
1038 | the volatile object `vp' points to, unless that is an incomplete type. For | |
1039 | volatile references we do not do this interpretation, because that would | |
1040 | make it impossible to ignore the reference return value from functions. We | |
1041 | issue warnings in the confusing cases. | |
9031d10b | 1042 | |
dab3247a | 1043 | The IMPLICIT is ICV_CAST when the user is explicitly converting an expression |
1044 | to void via a cast. If an expression is being implicitly converted, IMPLICIT | |
1045 | indicates the context of the implicit conversion. */ | |
b1a8d4ce | 1046 | |
1047 | tree | |
dab3247a | 1048 | convert_to_void (tree expr, impl_conv_void implicit, tsubst_flags_t complain) |
b1a8d4ce | 1049 | { |
3df42822 | 1050 | location_t loc = EXPR_LOC_OR_LOC (expr, input_location); |
61f69bc9 | 1051 | |
9031d10b | 1052 | if (expr == error_mark_node |
3d411d73 | 1053 | || TREE_TYPE (expr) == error_mark_node) |
1054 | return error_mark_node; | |
b2af2a93 | 1055 | |
dab3247a | 1056 | if (implicit == ICV_CAST) |
f94341bb | 1057 | mark_exp_read (expr); |
1058 | else | |
1059 | { | |
1060 | tree exprv = expr; | |
1061 | ||
1062 | while (TREE_CODE (exprv) == COMPOUND_EXPR) | |
1063 | exprv = TREE_OPERAND (exprv, 1); | |
0388391d | 1064 | if (DECL_P (exprv) |
1065 | || handled_component_p (exprv) | |
86ccc124 | 1066 | || INDIRECT_REF_P (exprv)) |
f94341bb | 1067 | /* Expr is not being 'used' here, otherwise we whould have |
1068 | called mark_{rl}value_use use here, which would have in turn | |
1069 | called mark_exp_read. Rather, we call mark_exp_read directly | |
1070 | to avoid some warnings when | |
1071 | -Wunused-but-set-{variable,parameter} is in effect. */ | |
1072 | mark_exp_read (exprv); | |
1073 | } | |
b2af2a93 | 1074 | |
b1a8d4ce | 1075 | if (!TREE_TYPE (expr)) |
1076 | return expr; | |
5c874cd3 | 1077 | if (invalid_nonstatic_memfn_p (loc, expr, complain)) |
334f6ce1 | 1078 | return error_mark_node; |
ed36f1cf | 1079 | if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR) |
1080 | { | |
ebd21de4 | 1081 | if (complain & tf_error) |
61f69bc9 | 1082 | error_at (loc, "pseudo-destructor is not called"); |
ed36f1cf | 1083 | return error_mark_node; |
1084 | } | |
e3cfe3ce | 1085 | if (VOID_TYPE_P (TREE_TYPE (expr))) |
b1a8d4ce | 1086 | return expr; |
1087 | switch (TREE_CODE (expr)) | |
1088 | { | |
1089 | case COND_EXPR: | |
1090 | { | |
653e5405 | 1091 | /* The two parts of a cond expr might be separate lvalues. */ |
1092 | tree op1 = TREE_OPERAND (expr,1); | |
1093 | tree op2 = TREE_OPERAND (expr,2); | |
527facbb | 1094 | bool side_effects = ((op1 && TREE_SIDE_EFFECTS (op1)) |
1095 | || TREE_SIDE_EFFECTS (op2)); | |
dab3247a | 1096 | tree new_op1, new_op2; |
527facbb | 1097 | new_op1 = NULL_TREE; |
dab3247a | 1098 | if (implicit != ICV_CAST && !side_effects) |
1099 | { | |
527facbb | 1100 | if (op1) |
1101 | new_op1 = convert_to_void (op1, ICV_SECOND_OF_COND, complain); | |
dab3247a | 1102 | new_op2 = convert_to_void (op2, ICV_THIRD_OF_COND, complain); |
1103 | } | |
1104 | else | |
1105 | { | |
527facbb | 1106 | if (op1) |
1107 | new_op1 = convert_to_void (op1, ICV_CAST, complain); | |
dab3247a | 1108 | new_op2 = convert_to_void (op2, ICV_CAST, complain); |
1109 | } | |
9031d10b | 1110 | |
527facbb | 1111 | expr = build3 (COND_EXPR, TREE_TYPE (new_op2), |
831d52a2 | 1112 | TREE_OPERAND (expr, 0), new_op1, new_op2); |
653e5405 | 1113 | break; |
b1a8d4ce | 1114 | } |
9031d10b | 1115 | |
b1a8d4ce | 1116 | case COMPOUND_EXPR: |
1117 | { | |
653e5405 | 1118 | /* The second part of a compound expr contains the value. */ |
1119 | tree op1 = TREE_OPERAND (expr,1); | |
dab3247a | 1120 | tree new_op1; |
1121 | if (implicit != ICV_CAST && !TREE_NO_WARNING (expr)) | |
1122 | new_op1 = convert_to_void (op1, ICV_RIGHT_OF_COMMA, complain); | |
1123 | else | |
1124 | new_op1 = convert_to_void (op1, ICV_CAST, complain); | |
9031d10b | 1125 | |
653e5405 | 1126 | if (new_op1 != op1) |
e907a2e9 | 1127 | { |
831d52a2 | 1128 | tree t = build2 (COMPOUND_EXPR, TREE_TYPE (new_op1), |
1129 | TREE_OPERAND (expr, 0), new_op1); | |
e907a2e9 | 1130 | expr = t; |
1131 | } | |
1132 | ||
653e5405 | 1133 | break; |
b1a8d4ce | 1134 | } |
9031d10b | 1135 | |
b1a8d4ce | 1136 | case NON_LVALUE_EXPR: |
1137 | case NOP_EXPR: | |
c0af329c | 1138 | /* These have already decayed to rvalue. */ |
b1a8d4ce | 1139 | break; |
9031d10b | 1140 | |
331bc0ad | 1141 | case CALL_EXPR: /* We have a special meaning for volatile void fn(). */ |
ddd2a3d4 | 1142 | maybe_warn_nodiscard (expr, implicit); |
b1a8d4ce | 1143 | break; |
9031d10b | 1144 | |
b1a8d4ce | 1145 | case INDIRECT_REF: |
1146 | { | |
653e5405 | 1147 | tree type = TREE_TYPE (expr); |
1148 | int is_reference = TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) | |
1149 | == REFERENCE_TYPE; | |
1150 | int is_volatile = TYPE_VOLATILE (type); | |
1151 | int is_complete = COMPLETE_TYPE_P (complete_type (type)); | |
1152 | ||
dc02da7f | 1153 | /* Can't load the value if we don't know the type. */ |
653e5405 | 1154 | if (is_volatile && !is_complete) |
ebd21de4 | 1155 | { |
1156 | if (complain & tf_warning) | |
dab3247a | 1157 | switch (implicit) |
1158 | { | |
1159 | case ICV_CAST: | |
61f69bc9 | 1160 | warning_at (loc, 0, "conversion to void will not access " |
dab3247a | 1161 | "object of incomplete type %qT", type); |
1162 | break; | |
1163 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1164 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1165 | "incomplete type %qT in second operand " |
1166 | "of conditional expression", type); | |
1167 | break; | |
1168 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1169 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1170 | "incomplete type %qT in third operand " |
1171 | "of conditional expression", type); | |
1172 | break; | |
1173 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1174 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1175 | "incomplete type %qT in right operand of " |
1176 | "comma operator", type); | |
1177 | break; | |
1178 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1179 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1180 | "incomplete type %qT in left operand of " |
1181 | "comma operator", type); | |
1182 | break; | |
1183 | case ICV_STATEMENT: | |
61f69bc9 | 1184 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1185 | "incomplete type %qT in statement", type); |
1186 | break; | |
1187 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1188 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1189 | "incomplete type %qT in for increment " |
1190 | "expression", type); | |
1191 | break; | |
1192 | default: | |
1193 | gcc_unreachable (); | |
1194 | } | |
ebd21de4 | 1195 | } |
dc02da7f | 1196 | /* Don't load the value if this is an implicit dereference, or if |
1197 | the type needs to be handled by ctors/dtors. */ | |
dab3247a | 1198 | else if (is_volatile && is_reference) |
ebd21de4 | 1199 | { |
1200 | if (complain & tf_warning) | |
dab3247a | 1201 | switch (implicit) |
1202 | { | |
1203 | case ICV_CAST: | |
61f69bc9 | 1204 | warning_at (loc, 0, "conversion to void will not access " |
dab3247a | 1205 | "object of type %qT", type); |
1206 | break; | |
1207 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1208 | warning_at (loc, 0, "implicit dereference will not access " |
1209 | "object of type %qT in second operand of " | |
dab3247a | 1210 | "conditional expression", type); |
1211 | break; | |
1212 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1213 | warning_at (loc, 0, "implicit dereference will not access " |
1214 | "object of type %qT in third operand of " | |
dab3247a | 1215 | "conditional expression", type); |
1216 | break; | |
1217 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1218 | warning_at (loc, 0, "implicit dereference will not access " |
1219 | "object of type %qT in right operand of " | |
dab3247a | 1220 | "comma operator", type); |
1221 | break; | |
1222 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1223 | warning_at (loc, 0, "implicit dereference will not access " |
1224 | "object of type %qT in left operand of comma " | |
1225 | "operator", type); | |
dab3247a | 1226 | break; |
1227 | case ICV_STATEMENT: | |
61f69bc9 | 1228 | warning_at (loc, 0, "implicit dereference will not access " |
1229 | "object of type %qT in statement", type); | |
dab3247a | 1230 | break; |
1231 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1232 | warning_at (loc, 0, "implicit dereference will not access " |
1233 | "object of type %qT in for increment expression", | |
1234 | type); | |
dab3247a | 1235 | break; |
1236 | default: | |
1237 | gcc_unreachable (); | |
1238 | } | |
ebd21de4 | 1239 | } |
dab3247a | 1240 | else if (is_volatile && TREE_ADDRESSABLE (type)) |
1241 | { | |
1242 | if (complain & tf_warning) | |
1243 | switch (implicit) | |
1244 | { | |
1245 | case ICV_CAST: | |
61f69bc9 | 1246 | warning_at (loc, 0, "conversion to void will not access " |
dab3247a | 1247 | "object of non-trivially-copyable type %qT", |
61f69bc9 | 1248 | type); |
dab3247a | 1249 | break; |
1250 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1251 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1252 | "non-trivially-copyable type %qT in second " |
1253 | "operand of conditional expression", type); | |
1254 | break; | |
1255 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1256 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1257 | "non-trivially-copyable type %qT in third " |
1258 | "operand of conditional expression", type); | |
1259 | break; | |
1260 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1261 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1262 | "non-trivially-copyable type %qT in right " |
1263 | "operand of comma operator", type); | |
1264 | break; | |
1265 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1266 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1267 | "non-trivially-copyable type %qT in left " |
1268 | "operand of comma operator", type); | |
1269 | break; | |
1270 | case ICV_STATEMENT: | |
61f69bc9 | 1271 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1272 | "non-trivially-copyable type %qT in statement", |
61f69bc9 | 1273 | type); |
dab3247a | 1274 | break; |
1275 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1276 | warning_at (loc, 0, "indirection will not access object of " |
dab3247a | 1277 | "non-trivially-copyable type %qT in for " |
1278 | "increment expression", type); | |
1279 | break; | |
1280 | default: | |
1281 | gcc_unreachable (); | |
1282 | } | |
1283 | } | |
dc02da7f | 1284 | if (is_reference || !is_volatile || !is_complete || TREE_ADDRESSABLE (type)) |
a4d4030b | 1285 | { |
1286 | /* Emit a warning (if enabled) when the "effect-less" INDIRECT_REF | |
1287 | operation is stripped off. Note that we don't warn about | |
1288 | - an expression with TREE_NO_WARNING set. (For an example of | |
1289 | such expressions, see build_over_call in call.c.) | |
1290 | - automatic dereferencing of references, since the user cannot | |
3d177e8c | 1291 | control it. (See also warn_if_unused_value() in c-common.c.) */ |
a4d4030b | 1292 | if (warn_unused_value |
dab3247a | 1293 | && implicit != ICV_CAST |
a4d4030b | 1294 | && (complain & tf_warning) |
1295 | && !TREE_NO_WARNING (expr) | |
1296 | && !is_reference) | |
61f69bc9 | 1297 | warning_at (loc, OPT_Wunused_value, "value computed is not used"); |
a4d4030b | 1298 | expr = TREE_OPERAND (expr, 0); |
1299 | } | |
653e5405 | 1300 | |
1301 | break; | |
b1a8d4ce | 1302 | } |
9031d10b | 1303 | |
b1a8d4ce | 1304 | case VAR_DECL: |
1305 | { | |
653e5405 | 1306 | /* External variables might be incomplete. */ |
1307 | tree type = TREE_TYPE (expr); | |
1308 | int is_complete = COMPLETE_TYPE_P (complete_type (type)); | |
1309 | ||
ebd21de4 | 1310 | if (TYPE_VOLATILE (type) && !is_complete && (complain & tf_warning)) |
dab3247a | 1311 | switch (implicit) |
1312 | { | |
1313 | case ICV_CAST: | |
61f69bc9 | 1314 | warning_at (loc, 0, "conversion to void will not access " |
dab3247a | 1315 | "object %qE of incomplete type %qT", expr, type); |
1316 | break; | |
1317 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1318 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1319 | "not be accessed in second operand of " | |
dab3247a | 1320 | "conditional expression", expr, type); |
1321 | break; | |
1322 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1323 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1324 | "not be accessed in third operand of " | |
dab3247a | 1325 | "conditional expression", expr, type); |
1326 | break; | |
1327 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1328 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1329 | "not be accessed in right operand of comma operator", | |
1330 | expr, type); | |
dab3247a | 1331 | break; |
1332 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1333 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1334 | "not be accessed in left operand of comma operator", | |
1335 | expr, type); | |
dab3247a | 1336 | break; |
1337 | case ICV_STATEMENT: | |
61f69bc9 | 1338 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1339 | "not be accessed in statement", expr, type); | |
dab3247a | 1340 | break; |
1341 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1342 | warning_at (loc, 0, "variable %qE of incomplete type %qT will " |
1343 | "not be accessed in for increment expression", | |
1344 | expr, type); | |
dab3247a | 1345 | break; |
1346 | default: | |
1347 | gcc_unreachable (); | |
1348 | } | |
1349 | ||
653e5405 | 1350 | break; |
b1a8d4ce | 1351 | } |
d9f88785 | 1352 | |
25b3017b | 1353 | case TARGET_EXPR: |
1354 | /* Don't bother with the temporary object returned from a function if | |
1fe75cf2 | 1355 | we don't use it, don't need to destroy it, and won't abort in |
1356 | assign_temp. We'll still | |
25b3017b | 1357 | allocate space for it in expand_call or declare_return_variable, |
1358 | but we don't need to track it through all the tree phases. */ | |
67bb1301 | 1359 | if (TARGET_EXPR_IMPLICIT_P (expr) |
1fe75cf2 | 1360 | && !TREE_ADDRESSABLE (TREE_TYPE (expr))) |
25b3017b | 1361 | { |
1362 | tree init = TARGET_EXPR_INITIAL (expr); | |
1363 | if (TREE_CODE (init) == AGGR_INIT_EXPR | |
1364 | && !AGGR_INIT_VIA_CTOR_P (init)) | |
1365 | { | |
c2f47e15 | 1366 | tree fn = AGGR_INIT_EXPR_FN (init); |
389dd41b | 1367 | expr = build_call_array_loc (input_location, |
ddd2a3d4 | 1368 | TREE_TYPE (TREE_TYPE |
1369 | (TREE_TYPE (fn))), | |
389dd41b | 1370 | fn, |
1371 | aggr_init_expr_nargs (init), | |
1372 | AGGR_INIT_EXPR_ARGP (init)); | |
25b3017b | 1373 | } |
1374 | } | |
ddd2a3d4 | 1375 | maybe_warn_nodiscard (expr, implicit); |
25b3017b | 1376 | break; |
1377 | ||
b1a8d4ce | 1378 | default:; |
1379 | } | |
703eb775 | 1380 | expr = resolve_nondeduced_context (expr, complain); |
b1a8d4ce | 1381 | { |
1382 | tree probe = expr; | |
9031d10b | 1383 | |
b1a8d4ce | 1384 | if (TREE_CODE (probe) == ADDR_EXPR) |
1385 | probe = TREE_OPERAND (expr, 0); | |
2e0e6579 | 1386 | if (type_unknown_p (probe)) |
1387 | { | |
1388 | /* [over.over] enumerates the places where we can take the address | |
1389 | of an overloaded function, and this is not one of them. */ | |
ebd21de4 | 1390 | if (complain & tf_error) |
dab3247a | 1391 | switch (implicit) |
1392 | { | |
1393 | case ICV_CAST: | |
61f69bc9 | 1394 | error_at (loc, "conversion to void " |
1395 | "cannot resolve address of overloaded function"); | |
dab3247a | 1396 | break; |
1397 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1398 | error_at (loc, "second operand of conditional expression " |
1399 | "cannot resolve address of overloaded function"); | |
dab3247a | 1400 | break; |
1401 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1402 | error_at (loc, "third operand of conditional expression " |
1403 | "cannot resolve address of overloaded function"); | |
dab3247a | 1404 | break; |
1405 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1406 | error_at (loc, "right operand of comma operator " |
1407 | "cannot resolve address of overloaded function"); | |
dab3247a | 1408 | break; |
1409 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1410 | error_at (loc, "left operand of comma operator " |
1411 | "cannot resolve address of overloaded function"); | |
dab3247a | 1412 | break; |
1413 | case ICV_STATEMENT: | |
61f69bc9 | 1414 | error_at (loc, "statement " |
1415 | "cannot resolve address of overloaded function"); | |
dab3247a | 1416 | break; |
1417 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1418 | error_at (loc, "for increment expression " |
1419 | "cannot resolve address of overloaded function"); | |
dab3247a | 1420 | break; |
1421 | } | |
ebd21de4 | 1422 | else |
1423 | return error_mark_node; | |
3ab4693e | 1424 | expr = void_node; |
2e0e6579 | 1425 | } |
dab3247a | 1426 | else if (implicit != ICV_CAST && probe == expr && is_overloaded_fn (probe)) |
2056769e | 1427 | { |
1428 | /* Only warn when there is no &. */ | |
ebd21de4 | 1429 | if (complain & tf_warning) |
dab3247a | 1430 | switch (implicit) |
1431 | { | |
1432 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1433 | warning_at (loc, OPT_Waddress, |
1434 | "second operand of conditional expression " | |
1435 | "is a reference, not call, to function %qE", expr); | |
dab3247a | 1436 | break; |
1437 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1438 | warning_at (loc, OPT_Waddress, |
1439 | "third operand of conditional expression " | |
1440 | "is a reference, not call, to function %qE", expr); | |
dab3247a | 1441 | break; |
1442 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1443 | warning_at (loc, OPT_Waddress, |
1444 | "right operand of comma operator " | |
1445 | "is a reference, not call, to function %qE", expr); | |
dab3247a | 1446 | break; |
1447 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1448 | warning_at (loc, OPT_Waddress, |
1449 | "left operand of comma operator " | |
1450 | "is a reference, not call, to function %qE", expr); | |
dab3247a | 1451 | break; |
1452 | case ICV_STATEMENT: | |
61f69bc9 | 1453 | warning_at (loc, OPT_Waddress, |
1454 | "statement is a reference, not call, to function %qE", | |
1455 | expr); | |
dab3247a | 1456 | break; |
1457 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1458 | warning_at (loc, OPT_Waddress, |
1459 | "for increment expression " | |
1460 | "is a reference, not call, to function %qE", expr); | |
dab3247a | 1461 | break; |
1462 | default: | |
1463 | gcc_unreachable (); | |
1464 | } | |
1465 | ||
2056769e | 1466 | if (TREE_CODE (expr) == COMPONENT_REF) |
1467 | expr = TREE_OPERAND (expr, 0); | |
1468 | } | |
b1a8d4ce | 1469 | } |
9031d10b | 1470 | |
e3cfe3ce | 1471 | if (expr != error_mark_node && !VOID_TYPE_P (TREE_TYPE (expr))) |
b1a8d4ce | 1472 | { |
dab3247a | 1473 | if (implicit != ICV_CAST |
5e2a4133 | 1474 | && warn_unused_value |
1475 | && !TREE_NO_WARNING (expr) | |
1476 | && !processing_template_decl) | |
1fe46df1 | 1477 | { |
1478 | /* The middle end does not warn about expressions that have | |
1479 | been explicitly cast to void, so we must do so here. */ | |
ebd21de4 | 1480 | if (!TREE_SIDE_EFFECTS (expr)) { |
1481 | if (complain & tf_warning) | |
dab3247a | 1482 | switch (implicit) |
1483 | { | |
1484 | case ICV_SECOND_OF_COND: | |
61f69bc9 | 1485 | warning_at (loc, OPT_Wunused_value, |
1486 | "second operand of conditional expression " | |
1487 | "has no effect"); | |
dab3247a | 1488 | break; |
1489 | case ICV_THIRD_OF_COND: | |
61f69bc9 | 1490 | warning_at (loc, OPT_Wunused_value, |
1491 | "third operand of conditional expression " | |
1492 | "has no effect"); | |
dab3247a | 1493 | break; |
1494 | case ICV_RIGHT_OF_COMMA: | |
61f69bc9 | 1495 | warning_at (loc, OPT_Wunused_value, |
1496 | "right operand of comma operator has no effect"); | |
dab3247a | 1497 | break; |
1498 | case ICV_LEFT_OF_COMMA: | |
61f69bc9 | 1499 | warning_at (loc, OPT_Wunused_value, |
1500 | "left operand of comma operator has no effect"); | |
dab3247a | 1501 | break; |
1502 | case ICV_STATEMENT: | |
61f69bc9 | 1503 | warning_at (loc, OPT_Wunused_value, |
1504 | "statement has no effect"); | |
dab3247a | 1505 | break; |
1506 | case ICV_THIRD_IN_FOR: | |
61f69bc9 | 1507 | warning_at (loc, OPT_Wunused_value, |
1508 | "for increment expression has no effect"); | |
dab3247a | 1509 | break; |
1510 | default: | |
1511 | gcc_unreachable (); | |
1512 | } | |
ebd21de4 | 1513 | } |
9031d10b | 1514 | else |
1515 | { | |
1fe46df1 | 1516 | tree e; |
1517 | enum tree_code code; | |
607a5d68 | 1518 | enum tree_code_class tclass; |
9031d10b | 1519 | |
1fe46df1 | 1520 | e = expr; |
1521 | /* We might like to warn about (say) "(int) f()", as the | |
1522 | cast has no effect, but the compiler itself will | |
1523 | generate implicit conversions under some | |
324d8f2d | 1524 | circumstances. (For example a block copy will be |
1fe46df1 | 1525 | turned into a call to "__builtin_memcpy", with a |
1526 | conversion of the return value to an appropriate | |
1527 | type.) So, to avoid false positives, we strip | |
416ce344 | 1528 | conversions. Do not use STRIP_NOPs because it will |
1529 | not strip conversions to "void", as that is not a | |
1530 | mode-preserving conversion. */ | |
1531 | while (TREE_CODE (e) == NOP_EXPR) | |
1532 | e = TREE_OPERAND (e, 0); | |
1fe46df1 | 1533 | |
1534 | code = TREE_CODE (e); | |
607a5d68 | 1535 | tclass = TREE_CODE_CLASS (code); |
1536 | if ((tclass == tcc_comparison | |
1537 | || tclass == tcc_unary | |
1538 | || (tclass == tcc_binary | |
1fe46df1 | 1539 | && !(code == MODIFY_EXPR |
1540 | || code == INIT_EXPR | |
1541 | || code == PREDECREMENT_EXPR | |
1542 | || code == PREINCREMENT_EXPR | |
1543 | || code == POSTDECREMENT_EXPR | |
9372a89d | 1544 | || code == POSTINCREMENT_EXPR)) |
1545 | || code == VEC_PERM_EXPR | |
1546 | || code == VEC_COND_EXPR) | |
ebd21de4 | 1547 | && (complain & tf_warning)) |
61f69bc9 | 1548 | warning_at (loc, OPT_Wunused_value, "value computed is not used"); |
1fe46df1 | 1549 | } |
1550 | } | |
00fa9079 | 1551 | expr = build1 (CONVERT_EXPR, void_type_node, expr); |
b1a8d4ce | 1552 | } |
de5ad4cb | 1553 | if (! TREE_SIDE_EFFECTS (expr)) |
3ab4693e | 1554 | expr = void_node; |
b1a8d4ce | 1555 | return expr; |
1556 | } | |
1557 | ||
d81e00a4 | 1558 | /* Create an expression whose value is that of EXPR, |
1559 | converted to type TYPE. The TREE_TYPE of the value | |
1560 | is always TYPE. This function implements all reasonable | |
1561 | conversions; callers should filter out those that are | |
c4a8ac95 | 1562 | not permitted by the language being compiled. |
1563 | ||
1564 | Most of this routine is from build_reinterpret_cast. | |
1565 | ||
a17c2a3a | 1566 | The back end cannot call cp_convert (what was convert) because |
c4a8ac95 | 1567 | conversions to/from basetypes may involve memory references |
1568 | (vbases) and adding or subtracting small values (multiple | |
1569 | inheritance), but it calls convert from the constant folding code | |
e0aa5007 | 1570 | on subtrees of already built trees after it has ripped them apart. |
c4a8ac95 | 1571 | |
1572 | Also, if we ever support range variables, we'll probably also have to | |
1573 | do a little bit more work. */ | |
d81e00a4 | 1574 | |
1575 | tree | |
35771a9a | 1576 | convert (tree type, tree expr) |
d81e00a4 | 1577 | { |
c4a8ac95 | 1578 | tree intype; |
1579 | ||
1580 | if (type == error_mark_node || expr == error_mark_node) | |
1581 | return error_mark_node; | |
1582 | ||
c4a8ac95 | 1583 | intype = TREE_TYPE (expr); |
1584 | ||
6686e84d | 1585 | if (POINTER_TYPE_P (type) && POINTER_TYPE_P (intype)) |
d2c63826 | 1586 | return build_nop (type, expr); |
c4a8ac95 | 1587 | |
b981525c | 1588 | return ocp_convert (type, expr, CONV_BACKEND_CONVERT, |
c4698a21 | 1589 | LOOKUP_NORMAL|LOOKUP_NO_CONVERSION, |
1590 | tf_warning_or_error); | |
d81e00a4 | 1591 | } |
1592 | ||
c4a8ac95 | 1593 | /* Like cp_convert, except permit conversions to take place which |
471086d6 | 1594 | are not normally allowed due to access restrictions |
1595 | (such as conversion from sub-type to private super-type). */ | |
96624a9e | 1596 | |
471086d6 | 1597 | tree |
c4698a21 | 1598 | convert_force (tree type, tree expr, int convtype, tsubst_flags_t complain) |
471086d6 | 1599 | { |
cd16867a | 1600 | tree e = expr; |
1601 | enum tree_code code = TREE_CODE (type); | |
471086d6 | 1602 | |
1603 | if (code == REFERENCE_TYPE) | |
d2c63826 | 1604 | return convert_to_reference (type, e, CONV_C_CAST, 0, |
1605 | NULL_TREE, complain); | |
471086d6 | 1606 | |
1607 | if (code == POINTER_TYPE) | |
d2c63826 | 1608 | return convert_to_pointer_force (type, e, complain); |
471086d6 | 1609 | |
ac9386a0 | 1610 | /* From typeck.c convert_for_assignment */ |
c21c015b | 1611 | if (((TYPE_PTR_P (TREE_TYPE (e)) && TREE_CODE (e) == ADDR_EXPR |
471086d6 | 1612 | && TREE_CODE (TREE_TYPE (TREE_TYPE (e))) == METHOD_TYPE) |
ac9386a0 | 1613 | || integer_zerop (e) |
1614 | || TYPE_PTRMEMFUNC_P (TREE_TYPE (e))) | |
471086d6 | 1615 | && TYPE_PTRMEMFUNC_P (type)) |
cb02169c | 1616 | /* compatible pointer to member functions. */ |
1617 | return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), e, 1, | |
c4698a21 | 1618 | /*c_cast_p=*/1, complain); |
a74e8896 | 1619 | |
c4698a21 | 1620 | return ocp_convert (type, e, CONV_C_CAST|convtype, LOOKUP_NORMAL, complain); |
471086d6 | 1621 | } |
1622 | ||
471086d6 | 1623 | /* Convert an aggregate EXPR to type XTYPE. If a conversion |
1624 | exists, return the attempted conversion. This may | |
1625 | return ERROR_MARK_NODE if the conversion is not | |
1626 | allowed (references private members, etc). | |
1627 | If no conversion exists, NULL_TREE is returned. | |
1628 | ||
ce28ee2e | 1629 | FIXME: Ambiguity checking is wrong. Should choose one by the implicit |
1630 | object parameter, or by the second standard conversion sequence if | |
1631 | that doesn't do it. This will probably wait for an overloading rewrite. | |
1632 | (jason 8/9/95) */ | |
471086d6 | 1633 | |
ef9571e5 | 1634 | static tree |
8999978b | 1635 | build_type_conversion (tree xtype, tree expr) |
471086d6 | 1636 | { |
1637 | /* C++: check to see if we can convert this aggregate type | |
bcf789d7 | 1638 | into the required type. */ |
66bbeb85 | 1639 | return build_user_type_conversion (xtype, expr, LOOKUP_NORMAL, |
1640 | tf_warning_or_error); | |
471086d6 | 1641 | } |
1642 | ||
1e66592c | 1643 | /* Convert the given EXPR to one of a group of types suitable for use in an |
1644 | expression. DESIRES is a combination of various WANT_* flags (q.v.) | |
35771a9a | 1645 | which indicates which types are suitable. If COMPLAIN is true, complain |
1e66592c | 1646 | about ambiguity; otherwise, the caller will deal with it. */ |
471086d6 | 1647 | |
1e66592c | 1648 | tree |
35771a9a | 1649 | build_expr_type_conversion (int desires, tree expr, bool complain) |
471086d6 | 1650 | { |
1e66592c | 1651 | tree basetype = TREE_TYPE (expr); |
6a44e72e | 1652 | tree conv = NULL_TREE; |
bdd152ce | 1653 | tree winner = NULL_TREE; |
471086d6 | 1654 | |
9031d10b | 1655 | if (expr == null_node |
1656 | && (desires & WANT_INT) | |
954885ed | 1657 | && !(desires & WANT_NULL)) |
db30b351 | 1658 | { |
1659 | source_location loc = | |
1660 | expansion_point_location_if_in_system_header (input_location); | |
1661 | ||
1662 | warning_at (loc, OPT_Wconversion_null, | |
1663 | "converting NULL to non-pointer type"); | |
1664 | } | |
9031d10b | 1665 | |
3d411d73 | 1666 | if (basetype == error_mark_node) |
1667 | return error_mark_node; | |
1668 | ||
95397ff9 | 1669 | if (! MAYBE_CLASS_TYPE_P (basetype)) |
bdd152ce | 1670 | switch (TREE_CODE (basetype)) |
1671 | { | |
1672 | case INTEGER_TYPE: | |
954885ed | 1673 | if ((desires & WANT_NULL) && null_ptr_cst_p (expr)) |
bdd152ce | 1674 | return expr; |
e3533433 | 1675 | /* fall through. */ |
bdd152ce | 1676 | |
1677 | case BOOLEAN_TYPE: | |
1678 | return (desires & WANT_INT) ? expr : NULL_TREE; | |
1679 | case ENUMERAL_TYPE: | |
1680 | return (desires & WANT_ENUM) ? expr : NULL_TREE; | |
1681 | case REAL_TYPE: | |
1682 | return (desires & WANT_FLOAT) ? expr : NULL_TREE; | |
1683 | case POINTER_TYPE: | |
1684 | return (desires & WANT_POINTER) ? expr : NULL_TREE; | |
9031d10b | 1685 | |
bdd152ce | 1686 | case FUNCTION_TYPE: |
1687 | case ARRAY_TYPE: | |
4405c1ad | 1688 | return (desires & WANT_POINTER) ? decay_conversion (expr, |
1689 | tf_warning_or_error) | |
653e5405 | 1690 | : NULL_TREE; |
96ec9e30 | 1691 | |
64ec1ad6 | 1692 | case COMPLEX_TYPE: |
96ec9e30 | 1693 | case VECTOR_TYPE: |
64ec1ad6 | 1694 | if ((desires & WANT_VECTOR_OR_COMPLEX) == 0) |
96ec9e30 | 1695 | return NULL_TREE; |
1696 | switch (TREE_CODE (TREE_TYPE (basetype))) | |
1697 | { | |
1698 | case INTEGER_TYPE: | |
1699 | case BOOLEAN_TYPE: | |
1700 | return (desires & WANT_INT) ? expr : NULL_TREE; | |
1701 | case ENUMERAL_TYPE: | |
1702 | return (desires & WANT_ENUM) ? expr : NULL_TREE; | |
1703 | case REAL_TYPE: | |
1704 | return (desires & WANT_FLOAT) ? expr : NULL_TREE; | |
1705 | default: | |
1706 | return NULL_TREE; | |
1707 | } | |
1708 | ||
bdd152ce | 1709 | default: |
1710 | return NULL_TREE; | |
1711 | } | |
1712 | ||
1713 | /* The code for conversions from class type is currently only used for | |
1714 | delete expressions. Other expressions are handled by build_new_op. */ | |
a5f2d620 | 1715 | if (!complete_type_or_maybe_complain (basetype, expr, complain)) |
f8182e08 | 1716 | return error_mark_node; |
1717 | if (!TYPE_HAS_CONVERSION (basetype)) | |
bdd152ce | 1718 | return NULL_TREE; |
1719 | ||
9960d752 | 1720 | for (conv = lookup_conversions (basetype); conv; conv = TREE_CHAIN (conv)) |
bdd152ce | 1721 | { |
1722 | int win = 0; | |
1723 | tree candidate; | |
1724 | tree cand = TREE_VALUE (conv); | |
c1ca2f12 | 1725 | cand = OVL_CURRENT (cand); |
bdd152ce | 1726 | |
1727 | if (winner && winner == cand) | |
1728 | continue; | |
1729 | ||
cf7aa2e5 | 1730 | if (DECL_NONCONVERTING_P (cand)) |
1731 | continue; | |
1732 | ||
ef4534a3 | 1733 | candidate = non_reference (TREE_TYPE (TREE_TYPE (cand))); |
bdd152ce | 1734 | |
1735 | switch (TREE_CODE (candidate)) | |
1736 | { | |
1737 | case BOOLEAN_TYPE: | |
1738 | case INTEGER_TYPE: | |
1739 | win = (desires & WANT_INT); break; | |
1740 | case ENUMERAL_TYPE: | |
1741 | win = (desires & WANT_ENUM); break; | |
1742 | case REAL_TYPE: | |
1743 | win = (desires & WANT_FLOAT); break; | |
1744 | case POINTER_TYPE: | |
1745 | win = (desires & WANT_POINTER); break; | |
1746 | ||
64ec1ad6 | 1747 | case COMPLEX_TYPE: |
96ec9e30 | 1748 | case VECTOR_TYPE: |
64ec1ad6 | 1749 | if ((desires & WANT_VECTOR_OR_COMPLEX) == 0) |
96ec9e30 | 1750 | break; |
1751 | switch (TREE_CODE (TREE_TYPE (candidate))) | |
1752 | { | |
1753 | case BOOLEAN_TYPE: | |
1754 | case INTEGER_TYPE: | |
1755 | win = (desires & WANT_INT); break; | |
1756 | case ENUMERAL_TYPE: | |
1757 | win = (desires & WANT_ENUM); break; | |
1758 | case REAL_TYPE: | |
1759 | win = (desires & WANT_FLOAT); break; | |
1760 | default: | |
1761 | break; | |
1762 | } | |
1763 | break; | |
1764 | ||
bdd152ce | 1765 | default: |
9c4c1195 | 1766 | /* A wildcard could be instantiated to match any desired |
1767 | type, but we can't deduce the template argument. */ | |
1768 | if (WILDCARD_TYPE_P (candidate)) | |
1769 | win = true; | |
bdd152ce | 1770 | break; |
1771 | } | |
1772 | ||
1773 | if (win) | |
1774 | { | |
9c4c1195 | 1775 | if (TREE_CODE (cand) == TEMPLATE_DECL) |
1776 | { | |
1777 | if (complain) | |
1778 | error ("default type conversion can't deduce template" | |
1779 | " argument for %qD", cand); | |
1780 | return error_mark_node; | |
1781 | } | |
1782 | ||
bdd152ce | 1783 | if (winner) |
1784 | { | |
609c541f | 1785 | tree winner_type |
1786 | = non_reference (TREE_TYPE (TREE_TYPE (winner))); | |
1787 | ||
1788 | if (!same_type_ignoring_top_level_qualifiers_p (winner_type, | |
1789 | candidate)) | |
bdd152ce | 1790 | { |
609c541f | 1791 | if (complain) |
1792 | { | |
1793 | error ("ambiguous default type conversion from %qT", | |
1794 | basetype); | |
392214f6 | 1795 | inform (input_location, |
1796 | " candidate conversions include %qD and %qD", | |
1797 | winner, cand); | |
609c541f | 1798 | } |
1799 | return error_mark_node; | |
bdd152ce | 1800 | } |
bdd152ce | 1801 | } |
609c541f | 1802 | |
1803 | winner = cand; | |
bdd152ce | 1804 | } |
1805 | } | |
1e66592c | 1806 | |
bdd152ce | 1807 | if (winner) |
1808 | { | |
ef4534a3 | 1809 | tree type = non_reference (TREE_TYPE (TREE_TYPE (winner))); |
66bbeb85 | 1810 | return build_user_type_conversion (type, expr, LOOKUP_NORMAL, |
1811 | tf_warning_or_error); | |
471086d6 | 1812 | } |
1e66592c | 1813 | |
985e9ee0 | 1814 | return NULL_TREE; |
471086d6 | 1815 | } |
bc3887cf | 1816 | |
96624a9e | 1817 | /* Implements integral promotion (4.1) and float->double promotion. */ |
1818 | ||
bc3887cf | 1819 | tree |
35771a9a | 1820 | type_promotes_to (tree type) |
bc3887cf | 1821 | { |
2b3c93a3 | 1822 | tree promoted_type; |
1823 | ||
ce28ee2e | 1824 | if (type == error_mark_node) |
1825 | return error_mark_node; | |
1826 | ||
bc3887cf | 1827 | type = TYPE_MAIN_VARIANT (type); |
bb0726a1 | 1828 | |
2b3c93a3 | 1829 | /* Check for promotions of target-defined types first. */ |
1830 | promoted_type = targetm.promoted_type (type); | |
1831 | if (promoted_type) | |
1832 | return promoted_type; | |
1833 | ||
bb0726a1 | 1834 | /* bool always promotes to int (not unsigned), even if it's the same |
1835 | size. */ | |
9e1a8234 | 1836 | if (TREE_CODE (type) == BOOLEAN_TYPE) |
bb0726a1 | 1837 | type = integer_type_node; |
1838 | ||
1839 | /* Normally convert enums to int, but convert wide enums to something | |
74b777e5 | 1840 | wider. Scoped enums don't promote, but pretend they do for backward |
1841 | ABI bug compatibility wrt varargs. */ | |
bb0726a1 | 1842 | else if (TREE_CODE (type) == ENUMERAL_TYPE |
924bbf02 | 1843 | || type == char16_type_node |
1844 | || type == char32_type_node | |
bb0726a1 | 1845 | || type == wchar_type_node) |
6c9497b1 | 1846 | { |
1847 | int precision = MAX (TYPE_PRECISION (type), | |
1848 | TYPE_PRECISION (integer_type_node)); | |
771d21fa | 1849 | tree totype = c_common_type_for_size (precision, 0); |
74b777e5 | 1850 | tree prom = type; |
1851 | if (TREE_CODE (prom) == ENUMERAL_TYPE) | |
1852 | prom = ENUM_UNDERLYING_TYPE (prom); | |
1853 | if (TYPE_UNSIGNED (prom) | |
1854 | && ! int_fits_type_p (TYPE_MAX_VALUE (prom), totype)) | |
1855 | prom = c_common_type_for_size (precision, 1); | |
1856 | else | |
1857 | prom = totype; | |
72fc0f64 | 1858 | if (SCOPED_ENUM_P (type)) |
74b777e5 | 1859 | { |
1860 | if (abi_version_crosses (6) | |
1861 | && TYPE_MODE (prom) != TYPE_MODE (type)) | |
1862 | warning (OPT_Wabi, "scoped enum %qT passed through ... as " | |
1863 | "%qT before -fabi-version=6, %qT after", | |
1864 | type, prom, ENUM_UNDERLYING_TYPE (type)); | |
1865 | if (!abi_version_at_least (6)) | |
1866 | type = prom; | |
1867 | } | |
6c9497b1 | 1868 | else |
74b777e5 | 1869 | type = prom; |
6c9497b1 | 1870 | } |
d7aeef06 | 1871 | else if (c_promoting_integer_type_p (type)) |
bc3887cf | 1872 | { |
d0acef9e | 1873 | /* Retain unsignedness if really not getting bigger. */ |
78a8ed03 | 1874 | if (TYPE_UNSIGNED (type) |
d0acef9e | 1875 | && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)) |
bc3887cf | 1876 | type = unsigned_type_node; |
1877 | else | |
1878 | type = integer_type_node; | |
1879 | } | |
1880 | else if (type == float_type_node) | |
1881 | type = double_type_node; | |
9031d10b | 1882 | |
a681799d | 1883 | return type; |
bc3887cf | 1884 | } |
668ae905 | 1885 | |
668ae905 | 1886 | /* The routines below this point are carefully written to conform to |
1887 | the standard. They use the same terminology, and follow the rules | |
1888 | closely. Although they are used only in pt.c at the moment, they | |
1889 | should presumably be used everywhere in the future. */ | |
1890 | ||
1146f179 | 1891 | /* Attempt to perform qualification conversions on EXPR to convert it |
1892 | to TYPE. Return the resulting expression, or error_mark_node if | |
1893 | the conversion was impossible. */ | |
1894 | ||
9031d10b | 1895 | tree |
35771a9a | 1896 | perform_qualification_conversions (tree type, tree expr) |
668ae905 | 1897 | { |
1bc16cab | 1898 | tree expr_type; |
1899 | ||
1900 | expr_type = TREE_TYPE (expr); | |
1901 | ||
3b087710 | 1902 | if (same_type_p (type, expr_type)) |
1903 | return expr; | |
1904 | else if (TYPE_PTR_P (type) && TYPE_PTR_P (expr_type) | |
1905 | && comp_ptr_ttypes (TREE_TYPE (type), TREE_TYPE (expr_type))) | |
1bc16cab | 1906 | return build_nop (type, expr); |
05765a91 | 1907 | else if (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (expr_type) |
1bc16cab | 1908 | && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type), |
1909 | TYPE_PTRMEM_CLASS_TYPE (expr_type)) | |
1910 | && comp_ptr_ttypes (TYPE_PTRMEM_POINTED_TO_TYPE (type), | |
1911 | TYPE_PTRMEM_POINTED_TO_TYPE (expr_type))) | |
1912 | return build_nop (type, expr); | |
1146f179 | 1913 | else |
1914 | return error_mark_node; | |
668ae905 | 1915 | } |
6d02e6b2 | 1916 | |
1917 | /* True iff T is a transaction-safe function type. */ | |
1918 | ||
1919 | bool | |
1920 | tx_safe_fn_type_p (tree t) | |
1921 | { | |
1922 | if (TREE_CODE (t) != FUNCTION_TYPE | |
1923 | && TREE_CODE (t) != METHOD_TYPE) | |
1924 | return false; | |
1925 | return !!lookup_attribute ("transaction_safe", TYPE_ATTRIBUTES (t)); | |
1926 | } | |
1927 | ||
1928 | /* Return the transaction-unsafe variant of transaction-safe function type | |
1929 | T. */ | |
1930 | ||
1931 | tree | |
1932 | tx_unsafe_fn_variant (tree t) | |
1933 | { | |
1934 | gcc_assert (tx_safe_fn_type_p (t)); | |
1935 | tree attrs = remove_attribute ("transaction_safe", | |
1936 | TYPE_ATTRIBUTES (t)); | |
1937 | return cp_build_type_attribute_variant (t, attrs); | |
1938 | } | |
1939 | ||
1940 | /* Return true iff FROM can convert to TO by a transaction-safety | |
1941 | conversion. */ | |
1942 | ||
2e9e9363 | 1943 | static bool |
6d02e6b2 | 1944 | can_convert_tx_safety (tree to, tree from) |
1945 | { | |
1946 | return (flag_tm && tx_safe_fn_type_p (from) | |
1947 | && same_type_p (to, tx_unsafe_fn_variant (from))); | |
1948 | } | |
2e9e9363 | 1949 | |
1950 | /* Return true iff FROM can convert to TO by dropping noexcept. */ | |
1951 | ||
1952 | static bool | |
1953 | noexcept_conv_p (tree to, tree from) | |
1954 | { | |
1955 | if (!flag_noexcept_type) | |
1956 | return false; | |
1957 | ||
1958 | tree t = non_reference (to); | |
1959 | tree f = from; | |
1960 | if (TYPE_PTRMEMFUNC_P (t) | |
1961 | && TYPE_PTRMEMFUNC_P (f)) | |
1962 | { | |
1963 | t = TYPE_PTRMEMFUNC_FN_TYPE (t); | |
1964 | f = TYPE_PTRMEMFUNC_FN_TYPE (f); | |
1965 | } | |
1966 | if (TREE_CODE (t) == POINTER_TYPE | |
1967 | && TREE_CODE (f) == POINTER_TYPE) | |
1968 | { | |
1969 | t = TREE_TYPE (t); | |
1970 | f = TREE_TYPE (f); | |
1971 | } | |
1972 | tree_code code = TREE_CODE (f); | |
1973 | if (TREE_CODE (t) != code) | |
1974 | return false; | |
1975 | if (code != FUNCTION_TYPE && code != METHOD_TYPE) | |
1976 | return false; | |
1977 | if (!type_throw_all_p (t) | |
1978 | || type_throw_all_p (f)) | |
1979 | return false; | |
1980 | tree v = build_exception_variant (f, NULL_TREE); | |
1981 | return same_type_p (t, v); | |
1982 | } | |
1983 | ||
1984 | /* Return true iff FROM can convert to TO by a function pointer conversion. */ | |
1985 | ||
1986 | bool | |
1987 | fnptr_conv_p (tree to, tree from) | |
1988 | { | |
1989 | tree t = non_reference (to); | |
1990 | tree f = from; | |
1991 | if (TYPE_PTRMEMFUNC_P (t) | |
1992 | && TYPE_PTRMEMFUNC_P (f)) | |
1993 | { | |
1994 | t = TYPE_PTRMEMFUNC_FN_TYPE (t); | |
1995 | f = TYPE_PTRMEMFUNC_FN_TYPE (f); | |
1996 | } | |
1997 | if (TREE_CODE (t) == POINTER_TYPE | |
1998 | && TREE_CODE (f) == POINTER_TYPE) | |
1999 | { | |
2000 | t = TREE_TYPE (t); | |
2001 | f = TREE_TYPE (f); | |
2002 | } | |
2003 | ||
2004 | return (noexcept_conv_p (t, f) | |
2005 | || can_convert_tx_safety (t, f)); | |
2006 | } | |
2007 | ||
2008 | /* Return FN with any NOP_EXPRs that represent function pointer | |
2009 | conversions stripped. */ | |
2010 | ||
2011 | tree | |
2012 | strip_fnptr_conv (tree fn) | |
2013 | { | |
2014 | while (TREE_CODE (fn) == NOP_EXPR) | |
2015 | { | |
2016 | tree op = TREE_OPERAND (fn, 0); | |
2017 | if (fnptr_conv_p (TREE_TYPE (fn), TREE_TYPE (op))) | |
2018 | fn = op; | |
2019 | else | |
2020 | break; | |
2021 | } | |
2022 | return fn; | |
2023 | } |