]>
Commit | Line | Data |
---|---|---|
5e6908ea | 1 | /* Utility routines for data type conversion for GCC. |
cbe34bb5 | 2 | Copyright (C) 1987-2017 Free Software Foundation, Inc. |
76e616db | 3 | |
1322177d | 4 | This file is part of GCC. |
76e616db | 5 | |
1322177d LB |
6 | GCC is free software; you can redistribute it and/or modify it under |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 9 | version. |
76e616db | 10 | |
1322177d LB |
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
76e616db BK |
15 | |
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
76e616db BK |
19 | |
20 | ||
21 | /* These routines are somewhat language-independent utility function | |
0f41302f | 22 | intended to be called by the language-specific convert () functions. */ |
76e616db BK |
23 | |
24 | #include "config.h" | |
c5c76735 | 25 | #include "system.h" |
4977bab6 | 26 | #include "coretypes.h" |
957060b5 | 27 | #include "target.h" |
76e616db | 28 | #include "tree.h" |
957060b5 | 29 | #include "diagnostic-core.h" |
40e23961 | 30 | #include "fold-const.h" |
d8a2d370 | 31 | #include "stor-layout.h" |
76e616db | 32 | #include "convert.h" |
b0c48229 | 33 | #include "langhooks.h" |
9b2b7279 | 34 | #include "builtins.h" |
85a16bf8 | 35 | #include "ubsan.h" |
314e6352 ML |
36 | #include "stringpool.h" |
37 | #include "attribs.h" | |
45b2222a | 38 | #include "asan.h" |
76e616db | 39 | |
269e63b7 KT |
40 | #define maybe_fold_build1_loc(FOLD_P, LOC, CODE, TYPE, EXPR) \ |
41 | ((FOLD_P) ? fold_build1_loc (LOC, CODE, TYPE, EXPR) \ | |
42 | : build1_loc (LOC, CODE, TYPE, EXPR)) | |
43 | #define maybe_fold_build2_loc(FOLD_P, LOC, CODE, TYPE, EXPR1, EXPR2) \ | |
44 | ((FOLD_P) ? fold_build2_loc (LOC, CODE, TYPE, EXPR1, EXPR2) \ | |
45 | : build2_loc (LOC, CODE, TYPE, EXPR1, EXPR2)) | |
46 | ||
0a931ce5 | 47 | /* Convert EXPR to some pointer or reference type TYPE. |
98c76e3c | 48 | EXPR must be pointer, reference, integer, enumeral, or literal zero; |
269e63b7 KT |
49 | in other cases error is called. If FOLD_P is true, try to fold the |
50 | expression. */ | |
76e616db | 51 | |
269e63b7 KT |
52 | static tree |
53 | convert_to_pointer_1 (tree type, tree expr, bool fold_p) | |
76e616db | 54 | { |
db3927fb | 55 | location_t loc = EXPR_LOCATION (expr); |
0a931ce5 RS |
56 | if (TREE_TYPE (expr) == type) |
57 | return expr; | |
58 | ||
f5963e61 | 59 | switch (TREE_CODE (TREE_TYPE (expr))) |
76e616db | 60 | { |
f5963e61 JL |
61 | case POINTER_TYPE: |
62 | case REFERENCE_TYPE: | |
09e881c9 BE |
63 | { |
64 | /* If the pointers point to different address spaces, conversion needs | |
65 | to be done via a ADDR_SPACE_CONVERT_EXPR instead of a NOP_EXPR. */ | |
66 | addr_space_t to_as = TYPE_ADDR_SPACE (TREE_TYPE (type)); | |
67 | addr_space_t from_as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (expr))); | |
68 | ||
69 | if (to_as == from_as) | |
269e63b7 | 70 | return maybe_fold_build1_loc (fold_p, loc, NOP_EXPR, type, expr); |
09e881c9 | 71 | else |
269e63b7 KT |
72 | return maybe_fold_build1_loc (fold_p, loc, ADDR_SPACE_CONVERT_EXPR, |
73 | type, expr); | |
09e881c9 | 74 | } |
f5963e61 JL |
75 | |
76 | case INTEGER_TYPE: | |
77 | case ENUMERAL_TYPE: | |
78 | case BOOLEAN_TYPE: | |
cf157324 OH |
79 | { |
80 | /* If the input precision differs from the target pointer type | |
81 | precision, first convert the input expression to an integer type of | |
82 | the target precision. Some targets, e.g. VMS, need several pointer | |
83 | sizes to coexist so the latter isn't necessarily POINTER_SIZE. */ | |
84 | unsigned int pprec = TYPE_PRECISION (type); | |
85 | unsigned int eprec = TYPE_PRECISION (TREE_TYPE (expr)); | |
86 | ||
269e63b7 KT |
87 | if (eprec != pprec) |
88 | expr | |
89 | = maybe_fold_build1_loc (fold_p, loc, NOP_EXPR, | |
90 | lang_hooks.types.type_for_size (pprec, 0), | |
91 | expr); | |
cf157324 | 92 | } |
269e63b7 | 93 | return maybe_fold_build1_loc (fold_p, loc, CONVERT_EXPR, type, expr); |
76e616db | 94 | |
f5963e61 JL |
95 | default: |
96 | error ("cannot convert to a pointer type"); | |
269e63b7 | 97 | return convert_to_pointer_1 (type, integer_zero_node, fold_p); |
f5963e61 | 98 | } |
76e616db BK |
99 | } |
100 | ||
269e63b7 KT |
101 | /* A wrapper around convert_to_pointer_1 that always folds the |
102 | expression. */ | |
103 | ||
104 | tree | |
105 | convert_to_pointer (tree type, tree expr) | |
106 | { | |
107 | return convert_to_pointer_1 (type, expr, true); | |
108 | } | |
109 | ||
110 | /* A wrapper around convert_to_pointer_1 that only folds the | |
415594bb | 111 | expression if DOFOLD, or if it is CONSTANT_CLASS_P. */ |
269e63b7 KT |
112 | |
113 | tree | |
415594bb | 114 | convert_to_pointer_maybe_fold (tree type, tree expr, bool dofold) |
269e63b7 | 115 | { |
415594bb | 116 | return convert_to_pointer_1 (type, expr, dofold || CONSTANT_CLASS_P (expr)); |
269e63b7 | 117 | } |
4977bab6 | 118 | |
76e616db BK |
119 | /* Convert EXPR to some floating-point type TYPE. |
120 | ||
0f996086 | 121 | EXPR must be float, fixed-point, integer, or enumeral; |
269e63b7 KT |
122 | in other cases error is called. If FOLD_P is true, try to fold |
123 | the expression. */ | |
76e616db | 124 | |
269e63b7 KT |
125 | static tree |
126 | convert_to_real_1 (tree type, tree expr, bool fold_p) | |
76e616db | 127 | { |
27a6aa72 | 128 | enum built_in_function fcode = builtin_mathfn_code (expr); |
4977bab6 | 129 | tree itype = TREE_TYPE (expr); |
269e63b7 | 130 | location_t loc = EXPR_LOCATION (expr); |
4977bab6 | 131 | |
c05eeebc JJ |
132 | if (TREE_CODE (expr) == COMPOUND_EXPR) |
133 | { | |
269e63b7 | 134 | tree t = convert_to_real_1 (type, TREE_OPERAND (expr, 1), fold_p); |
c05eeebc JJ |
135 | if (t == TREE_OPERAND (expr, 1)) |
136 | return expr; | |
137 | return build2_loc (EXPR_LOCATION (expr), COMPOUND_EXPR, TREE_TYPE (t), | |
138 | TREE_OPERAND (expr, 0), t); | |
139 | } | |
140 | ||
4b207444 JH |
141 | /* Disable until we figure out how to decide whether the functions are |
142 | present in runtime. */ | |
4977bab6 | 143 | /* Convert (float)sqrt((double)x) where x is float into sqrtf(x) */ |
78bd5210 | 144 | if (optimize |
4977bab6 ZW |
145 | && (TYPE_MODE (type) == TYPE_MODE (double_type_node) |
146 | || TYPE_MODE (type) == TYPE_MODE (float_type_node))) | |
147 | { | |
b3810360 KG |
148 | switch (fcode) |
149 | { | |
150 | #define CASE_MATHFN(FN) case BUILT_IN_##FN: case BUILT_IN_##FN##L: | |
1fb7e3af | 151 | CASE_MATHFN (COSH) |
b3810360 | 152 | CASE_MATHFN (EXP) |
1fb7e3af KG |
153 | CASE_MATHFN (EXP10) |
154 | CASE_MATHFN (EXP2) | |
f060a261 | 155 | CASE_MATHFN (EXPM1) |
1fb7e3af KG |
156 | CASE_MATHFN (GAMMA) |
157 | CASE_MATHFN (J0) | |
158 | CASE_MATHFN (J1) | |
159 | CASE_MATHFN (LGAMMA) | |
1fb7e3af | 160 | CASE_MATHFN (POW10) |
1fb7e3af | 161 | CASE_MATHFN (SINH) |
1fb7e3af KG |
162 | CASE_MATHFN (TGAMMA) |
163 | CASE_MATHFN (Y0) | |
164 | CASE_MATHFN (Y1) | |
f060a261 RG |
165 | /* The above functions may set errno differently with float |
166 | input or output so this transformation is not safe with | |
167 | -fmath-errno. */ | |
168 | if (flag_errno_math) | |
169 | break; | |
81fea426 | 170 | gcc_fallthrough (); |
f060a261 RG |
171 | CASE_MATHFN (ACOS) |
172 | CASE_MATHFN (ACOSH) | |
173 | CASE_MATHFN (ASIN) | |
174 | CASE_MATHFN (ASINH) | |
175 | CASE_MATHFN (ATAN) | |
176 | CASE_MATHFN (ATANH) | |
177 | CASE_MATHFN (CBRT) | |
178 | CASE_MATHFN (COS) | |
179 | CASE_MATHFN (ERF) | |
180 | CASE_MATHFN (ERFC) | |
f060a261 RG |
181 | CASE_MATHFN (LOG) |
182 | CASE_MATHFN (LOG10) | |
183 | CASE_MATHFN (LOG2) | |
184 | CASE_MATHFN (LOG1P) | |
f060a261 | 185 | CASE_MATHFN (SIN) |
f060a261 RG |
186 | CASE_MATHFN (TAN) |
187 | CASE_MATHFN (TANH) | |
247dbcf4 CH |
188 | /* The above functions are not safe to do this conversion. */ |
189 | if (!flag_unsafe_math_optimizations) | |
190 | break; | |
81fea426 | 191 | gcc_fallthrough (); |
247dbcf4 CH |
192 | CASE_MATHFN (SQRT) |
193 | CASE_MATHFN (FABS) | |
194 | CASE_MATHFN (LOGB) | |
b3810360 | 195 | #undef CASE_MATHFN |
4977bab6 | 196 | { |
5039610b | 197 | tree arg0 = strip_float_extensions (CALL_EXPR_ARG (expr, 0)); |
b3810360 KG |
198 | tree newtype = type; |
199 | ||
200 | /* We have (outertype)sqrt((innertype)x). Choose the wider mode from | |
201 | the both as the safe type for operation. */ | |
202 | if (TYPE_PRECISION (TREE_TYPE (arg0)) > TYPE_PRECISION (type)) | |
203 | newtype = TREE_TYPE (arg0); | |
204 | ||
247dbcf4 CH |
205 | /* We consider to convert |
206 | ||
207 | (T1) sqrtT2 ((T2) exprT3) | |
208 | to | |
209 | (T1) sqrtT4 ((T4) exprT3) | |
210 | ||
211 | , where T1 is TYPE, T2 is ITYPE, T3 is TREE_TYPE (ARG0), | |
212 | and T4 is NEWTYPE. All those types are of floating point types. | |
213 | T4 (NEWTYPE) should be narrower than T2 (ITYPE). This conversion | |
214 | is safe only if P1 >= P2*2+2, where P1 and P2 are precisions of | |
215 | T2 and T4. See the following URL for a reference: | |
216 | http://stackoverflow.com/questions/9235456/determining- | |
217 | floating-point-square-root | |
218 | */ | |
219 | if ((fcode == BUILT_IN_SQRT || fcode == BUILT_IN_SQRTL) | |
220 | && !flag_unsafe_math_optimizations) | |
221 | { | |
222 | /* The following conversion is unsafe even the precision condition | |
223 | below is satisfied: | |
224 | ||
225 | (float) sqrtl ((long double) double_val) -> (float) sqrt (double_val) | |
226 | */ | |
227 | if (TYPE_MODE (type) != TYPE_MODE (newtype)) | |
228 | break; | |
229 | ||
230 | int p1 = REAL_MODE_FORMAT (TYPE_MODE (itype))->p; | |
231 | int p2 = REAL_MODE_FORMAT (TYPE_MODE (newtype))->p; | |
232 | if (p1 < p2 * 2 + 2) | |
233 | break; | |
234 | } | |
235 | ||
b3810360 KG |
236 | /* Be careful about integer to fp conversions. |
237 | These may overflow still. */ | |
238 | if (FLOAT_TYPE_P (TREE_TYPE (arg0)) | |
239 | && TYPE_PRECISION (newtype) < TYPE_PRECISION (itype) | |
240 | && (TYPE_MODE (newtype) == TYPE_MODE (double_type_node) | |
241 | || TYPE_MODE (newtype) == TYPE_MODE (float_type_node))) | |
247dbcf4 | 242 | { |
b3810360 | 243 | tree fn = mathfn_built_in (newtype, fcode); |
b3810360 | 244 | if (fn) |
269e63b7 KT |
245 | { |
246 | tree arg = convert_to_real_1 (newtype, arg0, fold_p); | |
247 | expr = build_call_expr (fn, 1, arg); | |
248 | if (newtype == type) | |
249 | return expr; | |
250 | } | |
b3810360 | 251 | } |
4977bab6 | 252 | } |
b3810360 KG |
253 | default: |
254 | break; | |
4977bab6 ZW |
255 | } |
256 | } | |
257 | ||
258 | /* Propagate the cast into the operation. */ | |
259 | if (itype != type && FLOAT_TYPE_P (type)) | |
260 | switch (TREE_CODE (expr)) | |
261 | { | |
4f76e46b | 262 | /* Convert (float)-x into -(float)x. This is safe for |
18b0ea8f | 263 | round-to-nearest rounding mode when the inner type is float. */ |
4977bab6 ZW |
264 | case ABS_EXPR: |
265 | case NEGATE_EXPR: | |
4f76e46b | 266 | if (!flag_rounding_math |
18b0ea8f MM |
267 | && FLOAT_TYPE_P (itype) |
268 | && TYPE_PRECISION (type) < TYPE_PRECISION (itype)) | |
269e63b7 KT |
269 | { |
270 | tree arg = convert_to_real_1 (type, TREE_OPERAND (expr, 0), | |
271 | fold_p); | |
272 | return build1 (TREE_CODE (expr), type, arg); | |
273 | } | |
b1a6f8db | 274 | break; |
beb235f8 | 275 | /* Convert (outertype)((innertype0)a+(innertype1)b) |
4977bab6 ZW |
276 | into ((newtype)a+(newtype)b) where newtype |
277 | is the widest mode from all of these. */ | |
278 | case PLUS_EXPR: | |
279 | case MINUS_EXPR: | |
280 | case MULT_EXPR: | |
281 | case RDIV_EXPR: | |
282 | { | |
283 | tree arg0 = strip_float_extensions (TREE_OPERAND (expr, 0)); | |
284 | tree arg1 = strip_float_extensions (TREE_OPERAND (expr, 1)); | |
285 | ||
286 | if (FLOAT_TYPE_P (TREE_TYPE (arg0)) | |
20ded7a6 JM |
287 | && FLOAT_TYPE_P (TREE_TYPE (arg1)) |
288 | && DECIMAL_FLOAT_TYPE_P (itype) == DECIMAL_FLOAT_TYPE_P (type)) | |
4977bab6 ZW |
289 | { |
290 | tree newtype = type; | |
15ed7b52 JG |
291 | |
292 | if (TYPE_MODE (TREE_TYPE (arg0)) == SDmode | |
20ded7a6 JM |
293 | || TYPE_MODE (TREE_TYPE (arg1)) == SDmode |
294 | || TYPE_MODE (type) == SDmode) | |
15ed7b52 JG |
295 | newtype = dfloat32_type_node; |
296 | if (TYPE_MODE (TREE_TYPE (arg0)) == DDmode | |
20ded7a6 JM |
297 | || TYPE_MODE (TREE_TYPE (arg1)) == DDmode |
298 | || TYPE_MODE (type) == DDmode) | |
15ed7b52 JG |
299 | newtype = dfloat64_type_node; |
300 | if (TYPE_MODE (TREE_TYPE (arg0)) == TDmode | |
20ded7a6 JM |
301 | || TYPE_MODE (TREE_TYPE (arg1)) == TDmode |
302 | || TYPE_MODE (type) == TDmode) | |
15ed7b52 JG |
303 | newtype = dfloat128_type_node; |
304 | if (newtype == dfloat32_type_node | |
305 | || newtype == dfloat64_type_node | |
306 | || newtype == dfloat128_type_node) | |
307 | { | |
308 | expr = build2 (TREE_CODE (expr), newtype, | |
269e63b7 KT |
309 | convert_to_real_1 (newtype, arg0, |
310 | fold_p), | |
311 | convert_to_real_1 (newtype, arg1, | |
312 | fold_p)); | |
15ed7b52 JG |
313 | if (newtype == type) |
314 | return expr; | |
315 | break; | |
316 | } | |
317 | ||
4977bab6 ZW |
318 | if (TYPE_PRECISION (TREE_TYPE (arg0)) > TYPE_PRECISION (newtype)) |
319 | newtype = TREE_TYPE (arg0); | |
320 | if (TYPE_PRECISION (TREE_TYPE (arg1)) > TYPE_PRECISION (newtype)) | |
321 | newtype = TREE_TYPE (arg1); | |
20ded7a6 JM |
322 | /* Sometimes this transformation is safe (cannot |
323 | change results through affecting double rounding | |
324 | cases) and sometimes it is not. If NEWTYPE is | |
325 | wider than TYPE, e.g. (float)((long double)double | |
326 | + (long double)double) converted to | |
327 | (float)(double + double), the transformation is | |
328 | unsafe regardless of the details of the types | |
329 | involved; double rounding can arise if the result | |
330 | of NEWTYPE arithmetic is a NEWTYPE value half way | |
331 | between two representable TYPE values but the | |
332 | exact value is sufficiently different (in the | |
333 | right direction) for this difference to be | |
334 | visible in ITYPE arithmetic. If NEWTYPE is the | |
335 | same as TYPE, however, the transformation may be | |
336 | safe depending on the types involved: it is safe | |
337 | if the ITYPE has strictly more than twice as many | |
338 | mantissa bits as TYPE, can represent infinities | |
339 | and NaNs if the TYPE can, and has sufficient | |
340 | exponent range for the product or ratio of two | |
341 | values representable in the TYPE to be within the | |
342 | range of normal values of ITYPE. */ | |
343 | if (TYPE_PRECISION (newtype) < TYPE_PRECISION (itype) | |
344 | && (flag_unsafe_math_optimizations | |
345 | || (TYPE_PRECISION (newtype) == TYPE_PRECISION (type) | |
346 | && real_can_shorten_arithmetic (TYPE_MODE (itype), | |
8ce94e44 JM |
347 | TYPE_MODE (type)) |
348 | && !excess_precision_type (newtype)))) | |
4977bab6 | 349 | { |
3244e67d | 350 | expr = build2 (TREE_CODE (expr), newtype, |
269e63b7 KT |
351 | convert_to_real_1 (newtype, arg0, |
352 | fold_p), | |
353 | convert_to_real_1 (newtype, arg1, | |
354 | fold_p)); | |
4977bab6 ZW |
355 | if (newtype == type) |
356 | return expr; | |
357 | } | |
358 | } | |
359 | } | |
360 | break; | |
361 | default: | |
362 | break; | |
363 | } | |
364 | ||
f5963e61 JL |
365 | switch (TREE_CODE (TREE_TYPE (expr))) |
366 | { | |
367 | case REAL_TYPE: | |
5fc89bfd JJ |
368 | /* Ignore the conversion if we don't need to store intermediate |
369 | results and neither type is a decimal float. */ | |
e87eed2a DM |
370 | return build1_loc (loc, |
371 | (flag_float_store | |
372 | || DECIMAL_FLOAT_TYPE_P (type) | |
373 | || DECIMAL_FLOAT_TYPE_P (itype)) | |
374 | ? CONVERT_EXPR : NOP_EXPR, type, expr); | |
f5963e61 JL |
375 | |
376 | case INTEGER_TYPE: | |
377 | case ENUMERAL_TYPE: | |
378 | case BOOLEAN_TYPE: | |
f5963e61 JL |
379 | return build1 (FLOAT_EXPR, type, expr); |
380 | ||
0f996086 CF |
381 | case FIXED_POINT_TYPE: |
382 | return build1 (FIXED_CONVERT_EXPR, type, expr); | |
383 | ||
f5963e61 JL |
384 | case COMPLEX_TYPE: |
385 | return convert (type, | |
269e63b7 KT |
386 | maybe_fold_build1_loc (fold_p, loc, REALPART_EXPR, |
387 | TREE_TYPE (TREE_TYPE (expr)), | |
388 | expr)); | |
f5963e61 JL |
389 | |
390 | case POINTER_TYPE: | |
391 | case REFERENCE_TYPE: | |
392 | error ("pointer value used where a floating point value was expected"); | |
269e63b7 | 393 | return convert_to_real_1 (type, integer_zero_node, fold_p); |
f5963e61 JL |
394 | |
395 | default: | |
396 | error ("aggregate value used where a float was expected"); | |
269e63b7 | 397 | return convert_to_real_1 (type, integer_zero_node, fold_p); |
f5963e61 | 398 | } |
76e616db BK |
399 | } |
400 | ||
269e63b7 KT |
401 | /* A wrapper around convert_to_real_1 that always folds the |
402 | expression. */ | |
403 | ||
404 | tree | |
405 | convert_to_real (tree type, tree expr) | |
406 | { | |
407 | return convert_to_real_1 (type, expr, true); | |
408 | } | |
409 | ||
410 | /* A wrapper around convert_to_real_1 that only folds the | |
415594bb | 411 | expression if DOFOLD, or if it is CONSTANT_CLASS_P. */ |
269e63b7 KT |
412 | |
413 | tree | |
415594bb | 414 | convert_to_real_maybe_fold (tree type, tree expr, bool dofold) |
269e63b7 | 415 | { |
415594bb | 416 | return convert_to_real_1 (type, expr, dofold || CONSTANT_CLASS_P (expr)); |
269e63b7 KT |
417 | } |
418 | ||
2d143ba8 RB |
419 | /* Try to narrow EX_FORM ARG0 ARG1 in narrowed arg types producing a |
420 | result in TYPE. */ | |
421 | ||
422 | static tree | |
423 | do_narrow (location_t loc, | |
424 | enum tree_code ex_form, tree type, tree arg0, tree arg1, | |
425 | tree expr, unsigned inprec, unsigned outprec, bool dofold) | |
426 | { | |
427 | /* Do the arithmetic in type TYPEX, | |
428 | then convert result to TYPE. */ | |
429 | tree typex = type; | |
430 | ||
431 | /* Can't do arithmetic in enumeral types | |
432 | so use an integer type that will hold the values. */ | |
433 | if (TREE_CODE (typex) == ENUMERAL_TYPE) | |
434 | typex = lang_hooks.types.type_for_size (TYPE_PRECISION (typex), | |
435 | TYPE_UNSIGNED (typex)); | |
436 | ||
437 | /* But now perhaps TYPEX is as wide as INPREC. | |
438 | In that case, do nothing special here. | |
439 | (Otherwise would recurse infinitely in convert. */ | |
440 | if (TYPE_PRECISION (typex) != inprec) | |
441 | { | |
442 | /* Don't do unsigned arithmetic where signed was wanted, | |
443 | or vice versa. | |
444 | Exception: if both of the original operands were | |
445 | unsigned then we can safely do the work as unsigned. | |
446 | Exception: shift operations take their type solely | |
447 | from the first argument. | |
448 | Exception: the LSHIFT_EXPR case above requires that | |
449 | we perform this operation unsigned lest we produce | |
450 | signed-overflow undefinedness. | |
451 | And we may need to do it as unsigned | |
452 | if we truncate to the original size. */ | |
453 | if (TYPE_UNSIGNED (TREE_TYPE (expr)) | |
454 | || (TYPE_UNSIGNED (TREE_TYPE (arg0)) | |
455 | && (TYPE_UNSIGNED (TREE_TYPE (arg1)) | |
456 | || ex_form == LSHIFT_EXPR | |
457 | || ex_form == RSHIFT_EXPR | |
458 | || ex_form == LROTATE_EXPR | |
459 | || ex_form == RROTATE_EXPR)) | |
460 | || ex_form == LSHIFT_EXPR | |
461 | /* If we have !flag_wrapv, and either ARG0 or | |
462 | ARG1 is of a signed type, we have to do | |
463 | PLUS_EXPR, MINUS_EXPR or MULT_EXPR in an unsigned | |
464 | type in case the operation in outprec precision | |
465 | could overflow. Otherwise, we would introduce | |
466 | signed-overflow undefinedness. */ | |
467 | || ((!TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0)) | |
468 | || !TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1))) | |
469 | && ((TYPE_PRECISION (TREE_TYPE (arg0)) * 2u | |
470 | > outprec) | |
471 | || (TYPE_PRECISION (TREE_TYPE (arg1)) * 2u | |
472 | > outprec)) | |
473 | && (ex_form == PLUS_EXPR | |
474 | || ex_form == MINUS_EXPR | |
475 | || ex_form == MULT_EXPR))) | |
476 | { | |
477 | if (!TYPE_UNSIGNED (typex)) | |
478 | typex = unsigned_type_for (typex); | |
479 | } | |
480 | else | |
481 | { | |
482 | if (TYPE_UNSIGNED (typex)) | |
483 | typex = signed_type_for (typex); | |
484 | } | |
485 | /* We should do away with all this once we have a proper | |
486 | type promotion/demotion pass, see PR45397. */ | |
487 | expr = maybe_fold_build2_loc (dofold, loc, ex_form, typex, | |
488 | convert (typex, arg0), | |
489 | convert (typex, arg1)); | |
490 | return convert (type, expr); | |
491 | } | |
492 | ||
493 | return NULL_TREE; | |
494 | } | |
495 | ||
76e616db BK |
496 | /* Convert EXPR to some integer (or enum) type TYPE. |
497 | ||
0f996086 CF |
498 | EXPR must be pointer, integer, discrete (enum, char, or bool), float, |
499 | fixed-point or vector; in other cases error is called. | |
76e616db | 500 | |
269e63b7 KT |
501 | If DOFOLD is TRUE, we try to simplify newly-created patterns by folding. |
502 | ||
76e616db BK |
503 | The result of this is always supposed to be a newly created tree node |
504 | not in use in any existing structure. */ | |
505 | ||
269e63b7 KT |
506 | static tree |
507 | convert_to_integer_1 (tree type, tree expr, bool dofold) | |
76e616db | 508 | { |
f5963e61 JL |
509 | enum tree_code ex_form = TREE_CODE (expr); |
510 | tree intype = TREE_TYPE (expr); | |
a5e0cd1d MG |
511 | unsigned int inprec = element_precision (intype); |
512 | unsigned int outprec = element_precision (type); | |
85a16bf8 | 513 | location_t loc = EXPR_LOCATION (expr); |
76e616db | 514 | |
9c4cb3a3 MM |
515 | /* An INTEGER_TYPE cannot be incomplete, but an ENUMERAL_TYPE can |
516 | be. Consider `enum E = { a, b = (enum E) 3 };'. */ | |
d0f062fb | 517 | if (!COMPLETE_TYPE_P (type)) |
9c4cb3a3 MM |
518 | { |
519 | error ("conversion to incomplete type"); | |
520 | return error_mark_node; | |
521 | } | |
522 | ||
c05eeebc JJ |
523 | if (ex_form == COMPOUND_EXPR) |
524 | { | |
269e63b7 | 525 | tree t = convert_to_integer_1 (type, TREE_OPERAND (expr, 1), dofold); |
c05eeebc JJ |
526 | if (t == TREE_OPERAND (expr, 1)) |
527 | return expr; | |
528 | return build2_loc (EXPR_LOCATION (expr), COMPOUND_EXPR, TREE_TYPE (t), | |
529 | TREE_OPERAND (expr, 0), t); | |
530 | } | |
531 | ||
332d782c KG |
532 | /* Convert e.g. (long)round(d) -> lround(d). */ |
533 | /* If we're converting to char, we may encounter differing behavior | |
534 | between converting from double->char vs double->long->char. | |
535 | We're in "undefined" territory but we prefer to be conservative, | |
536 | so only proceed in "unsafe" math mode. */ | |
537 | if (optimize | |
538 | && (flag_unsafe_math_optimizations | |
d2be4368 KG |
539 | || (long_integer_type_node |
540 | && outprec >= TYPE_PRECISION (long_integer_type_node)))) | |
332d782c KG |
541 | { |
542 | tree s_expr = strip_float_extensions (expr); | |
543 | tree s_intype = TREE_TYPE (s_expr); | |
544 | const enum built_in_function fcode = builtin_mathfn_code (s_expr); | |
545 | tree fn = 0; | |
b8698a0f | 546 | |
332d782c KG |
547 | switch (fcode) |
548 | { | |
ea6a6627 | 549 | CASE_FLT_FN (BUILT_IN_CEIL): |
1c432a0c | 550 | /* Only convert in ISO C99 mode. */ |
d33d9e47 | 551 | if (!targetm.libc_has_function (function_c99_misc)) |
1c432a0c | 552 | break; |
6c32ee74 UB |
553 | if (outprec < TYPE_PRECISION (integer_type_node) |
554 | || (outprec == TYPE_PRECISION (integer_type_node) | |
738764ef | 555 | && !TYPE_UNSIGNED (type))) |
6c32ee74 UB |
556 | fn = mathfn_built_in (s_intype, BUILT_IN_ICEIL); |
557 | else if (outprec == TYPE_PRECISION (long_integer_type_node) | |
558 | && !TYPE_UNSIGNED (type)) | |
f94b1661 | 559 | fn = mathfn_built_in (s_intype, BUILT_IN_LCEIL); |
738764ef RS |
560 | else if (outprec == TYPE_PRECISION (long_long_integer_type_node) |
561 | && !TYPE_UNSIGNED (type)) | |
562 | fn = mathfn_built_in (s_intype, BUILT_IN_LLCEIL); | |
f94b1661 UB |
563 | break; |
564 | ||
ea6a6627 | 565 | CASE_FLT_FN (BUILT_IN_FLOOR): |
1c432a0c | 566 | /* Only convert in ISO C99 mode. */ |
d33d9e47 | 567 | if (!targetm.libc_has_function (function_c99_misc)) |
1c432a0c | 568 | break; |
6c32ee74 UB |
569 | if (outprec < TYPE_PRECISION (integer_type_node) |
570 | || (outprec == TYPE_PRECISION (integer_type_node) | |
738764ef | 571 | && !TYPE_UNSIGNED (type))) |
6c32ee74 UB |
572 | fn = mathfn_built_in (s_intype, BUILT_IN_IFLOOR); |
573 | else if (outprec == TYPE_PRECISION (long_integer_type_node) | |
574 | && !TYPE_UNSIGNED (type)) | |
d8b42d06 | 575 | fn = mathfn_built_in (s_intype, BUILT_IN_LFLOOR); |
738764ef RS |
576 | else if (outprec == TYPE_PRECISION (long_long_integer_type_node) |
577 | && !TYPE_UNSIGNED (type)) | |
578 | fn = mathfn_built_in (s_intype, BUILT_IN_LLFLOOR); | |
d8b42d06 UB |
579 | break; |
580 | ||
ea6a6627 | 581 | CASE_FLT_FN (BUILT_IN_ROUND): |
25be91ac KT |
582 | /* Only convert in ISO C99 mode and with -fno-math-errno. */ |
583 | if (!targetm.libc_has_function (function_c99_misc) || flag_errno_math) | |
44782c0c | 584 | break; |
6c32ee74 UB |
585 | if (outprec < TYPE_PRECISION (integer_type_node) |
586 | || (outprec == TYPE_PRECISION (integer_type_node) | |
738764ef | 587 | && !TYPE_UNSIGNED (type))) |
6c32ee74 UB |
588 | fn = mathfn_built_in (s_intype, BUILT_IN_IROUND); |
589 | else if (outprec == TYPE_PRECISION (long_integer_type_node) | |
590 | && !TYPE_UNSIGNED (type)) | |
332d782c | 591 | fn = mathfn_built_in (s_intype, BUILT_IN_LROUND); |
738764ef RS |
592 | else if (outprec == TYPE_PRECISION (long_long_integer_type_node) |
593 | && !TYPE_UNSIGNED (type)) | |
594 | fn = mathfn_built_in (s_intype, BUILT_IN_LLROUND); | |
332d782c KG |
595 | break; |
596 | ||
65bda21f KG |
597 | CASE_FLT_FN (BUILT_IN_NEARBYINT): |
598 | /* Only convert nearbyint* if we can ignore math exceptions. */ | |
332d782c KG |
599 | if (flag_trapping_math) |
600 | break; | |
81fea426 | 601 | gcc_fallthrough (); |
65bda21f | 602 | CASE_FLT_FN (BUILT_IN_RINT): |
371e764d KT |
603 | /* Only convert in ISO C99 mode and with -fno-math-errno. */ |
604 | if (!targetm.libc_has_function (function_c99_misc) || flag_errno_math) | |
44782c0c | 605 | break; |
6c32ee74 UB |
606 | if (outprec < TYPE_PRECISION (integer_type_node) |
607 | || (outprec == TYPE_PRECISION (integer_type_node) | |
738764ef | 608 | && !TYPE_UNSIGNED (type))) |
6c32ee74 | 609 | fn = mathfn_built_in (s_intype, BUILT_IN_IRINT); |
44782c0c | 610 | else if (outprec == TYPE_PRECISION (long_integer_type_node) |
6c32ee74 | 611 | && !TYPE_UNSIGNED (type)) |
738764ef RS |
612 | fn = mathfn_built_in (s_intype, BUILT_IN_LRINT); |
613 | else if (outprec == TYPE_PRECISION (long_long_integer_type_node) | |
614 | && !TYPE_UNSIGNED (type)) | |
615 | fn = mathfn_built_in (s_intype, BUILT_IN_LLRINT); | |
332d782c | 616 | break; |
2ec76fdb | 617 | |
ea6a6627 | 618 | CASE_FLT_FN (BUILT_IN_TRUNC): |
269e63b7 | 619 | return convert_to_integer_1 (type, CALL_EXPR_ARG (s_expr, 0), dofold); |
2ec76fdb | 620 | |
332d782c KG |
621 | default: |
622 | break; | |
623 | } | |
b8698a0f | 624 | |
332d782c KG |
625 | if (fn) |
626 | { | |
5039610b | 627 | tree newexpr = build_call_expr (fn, 1, CALL_EXPR_ARG (s_expr, 0)); |
269e63b7 | 628 | return convert_to_integer_1 (type, newexpr, dofold); |
332d782c KG |
629 | } |
630 | } | |
631 | ||
2c2f70e1 UB |
632 | /* Convert (int)logb(d) -> ilogb(d). */ |
633 | if (optimize | |
634 | && flag_unsafe_math_optimizations | |
635 | && !flag_trapping_math && !flag_errno_math && flag_finite_math_only | |
636 | && integer_type_node | |
637 | && (outprec > TYPE_PRECISION (integer_type_node) | |
638 | || (outprec == TYPE_PRECISION (integer_type_node) | |
639 | && !TYPE_UNSIGNED (type)))) | |
640 | { | |
641 | tree s_expr = strip_float_extensions (expr); | |
642 | tree s_intype = TREE_TYPE (s_expr); | |
643 | const enum built_in_function fcode = builtin_mathfn_code (s_expr); | |
644 | tree fn = 0; | |
b8698a0f | 645 | |
2c2f70e1 UB |
646 | switch (fcode) |
647 | { | |
648 | CASE_FLT_FN (BUILT_IN_LOGB): | |
649 | fn = mathfn_built_in (s_intype, BUILT_IN_ILOGB); | |
650 | break; | |
651 | ||
652 | default: | |
653 | break; | |
654 | } | |
655 | ||
656 | if (fn) | |
657 | { | |
658 | tree newexpr = build_call_expr (fn, 1, CALL_EXPR_ARG (s_expr, 0)); | |
269e63b7 | 659 | return convert_to_integer_1 (type, newexpr, dofold); |
2c2f70e1 UB |
660 | } |
661 | } | |
662 | ||
f5963e61 | 663 | switch (TREE_CODE (intype)) |
76e616db | 664 | { |
f5963e61 JL |
665 | case POINTER_TYPE: |
666 | case REFERENCE_TYPE: | |
76e616db | 667 | if (integer_zerop (expr)) |
97471d8f RS |
668 | return build_int_cst (type, 0); |
669 | ||
c767899e OH |
670 | /* Convert to an unsigned integer of the correct width first, and from |
671 | there widen/truncate to the required type. Some targets support the | |
672 | coexistence of multiple valid pointer sizes, so fetch the one we need | |
673 | from the type. */ | |
269e63b7 KT |
674 | if (!dofold) |
675 | return build1 (CONVERT_EXPR, type, expr); | |
97471d8f | 676 | expr = fold_build1 (CONVERT_EXPR, |
c767899e OH |
677 | lang_hooks.types.type_for_size |
678 | (TYPE_PRECISION (intype), 0), | |
97471d8f | 679 | expr); |
e7a6c127 | 680 | return fold_convert (type, expr); |
76e616db | 681 | |
f5963e61 JL |
682 | case INTEGER_TYPE: |
683 | case ENUMERAL_TYPE: | |
684 | case BOOLEAN_TYPE: | |
6175f578 | 685 | case OFFSET_TYPE: |
f5963e61 | 686 | /* If this is a logical operation, which just returns 0 or 1, we can |
a338ab5a | 687 | change the type of the expression. */ |
76e616db | 688 | |
6615c446 | 689 | if (TREE_CODE_CLASS (ex_form) == tcc_comparison) |
76e616db | 690 | { |
5dfa45d0 | 691 | expr = copy_node (expr); |
76e616db BK |
692 | TREE_TYPE (expr) = type; |
693 | return expr; | |
694 | } | |
f5963e61 | 695 | |
f5963e61 JL |
696 | /* If we are widening the type, put in an explicit conversion. |
697 | Similarly if we are not changing the width. After this, we know | |
698 | we are truncating EXPR. */ | |
699 | ||
76e616db | 700 | else if (outprec >= inprec) |
4b0d3cbe MM |
701 | { |
702 | enum tree_code code; | |
703 | ||
704 | /* If the precision of the EXPR's type is K bits and the | |
705 | destination mode has more bits, and the sign is changing, | |
706 | it is not safe to use a NOP_EXPR. For example, suppose | |
707 | that EXPR's type is a 3-bit unsigned integer type, the | |
708 | TYPE is a 3-bit signed integer type, and the machine mode | |
709 | for the types is 8-bit QImode. In that case, the | |
710 | conversion necessitates an explicit sign-extension. In | |
711 | the signed-to-unsigned case the high-order bits have to | |
712 | be cleared. */ | |
8df83eae | 713 | if (TYPE_UNSIGNED (type) != TYPE_UNSIGNED (TREE_TYPE (expr)) |
4b0d3cbe | 714 | && (TYPE_PRECISION (TREE_TYPE (expr)) |
69660a70 | 715 | != GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (expr))))) |
4b0d3cbe MM |
716 | code = CONVERT_EXPR; |
717 | else | |
718 | code = NOP_EXPR; | |
719 | ||
269e63b7 | 720 | return maybe_fold_build1_loc (dofold, loc, code, type, expr); |
4b0d3cbe | 721 | } |
76e616db | 722 | |
1c013b45 RK |
723 | /* If TYPE is an enumeral type or a type with a precision less |
724 | than the number of bits in its mode, do the conversion to the | |
725 | type corresponding to its mode, then do a nop conversion | |
726 | to TYPE. */ | |
727 | else if (TREE_CODE (type) == ENUMERAL_TYPE | |
69660a70 | 728 | || outprec != GET_MODE_PRECISION (TYPE_MODE (type))) |
32913637 NS |
729 | { |
730 | expr = convert (lang_hooks.types.type_for_mode | |
731 | (TYPE_MODE (type), TYPE_UNSIGNED (type)), expr); | |
732 | return maybe_fold_build1_loc (dofold, loc, NOP_EXPR, type, expr); | |
733 | } | |
1c013b45 | 734 | |
ab29fdfc RK |
735 | /* Here detect when we can distribute the truncation down past some |
736 | arithmetic. For example, if adding two longs and converting to an | |
737 | int, we can equally well convert both to ints and then add. | |
738 | For the operations handled here, such truncation distribution | |
739 | is always safe. | |
740 | It is desirable in these cases: | |
741 | 1) when truncating down to full-word from a larger size | |
742 | 2) when truncating takes no work. | |
743 | 3) when at least one operand of the arithmetic has been extended | |
744 | (as by C's default conversions). In this case we need two conversions | |
745 | if we do the arithmetic as already requested, so we might as well | |
746 | truncate both and then combine. Perhaps that way we need only one. | |
747 | ||
748 | Note that in general we cannot do the arithmetic in a type | |
749 | shorter than the desired result of conversion, even if the operands | |
750 | are both extended from a shorter type, because they might overflow | |
751 | if combined in that type. The exceptions to this--the times when | |
752 | two narrow values can be combined in their narrow type even to | |
753 | make a wider result--are handled by "shorten" in build_binary_op. */ | |
76e616db | 754 | |
415594bb | 755 | if (dofold) |
c0328be3 | 756 | switch (ex_form) |
d977cb9c | 757 | { |
c0328be3 JM |
758 | case RSHIFT_EXPR: |
759 | /* We can pass truncation down through right shifting | |
760 | when the shift count is a nonpositive constant. */ | |
761 | if (TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST | |
762 | && tree_int_cst_sgn (TREE_OPERAND (expr, 1)) <= 0) | |
d977cb9c RG |
763 | goto trunc1; |
764 | break; | |
d977cb9c | 765 | |
c0328be3 JM |
766 | case LSHIFT_EXPR: |
767 | /* We can pass truncation down through left shifting | |
768 | when the shift count is a nonnegative constant and | |
769 | the target type is unsigned. */ | |
770 | if (TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST | |
771 | && tree_int_cst_sgn (TREE_OPERAND (expr, 1)) >= 0 | |
772 | && TYPE_UNSIGNED (type) | |
773 | && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST) | |
76e616db | 774 | { |
c0328be3 JM |
775 | /* If shift count is less than the width of the truncated type, |
776 | really shift. */ | |
777 | if (tree_int_cst_lt (TREE_OPERAND (expr, 1), TYPE_SIZE (type))) | |
778 | /* In this case, shifting is like multiplication. */ | |
779 | goto trunc1; | |
780 | else | |
76e616db | 781 | { |
c0328be3 JM |
782 | /* If it is >= that width, result is zero. |
783 | Handling this with trunc1 would give the wrong result: | |
784 | (int) ((long long) a << 32) is well defined (as 0) | |
785 | but (int) a << 32 is undefined and would get a | |
786 | warning. */ | |
787 | ||
788 | tree t = build_int_cst (type, 0); | |
789 | ||
790 | /* If the original expression had side-effects, we must | |
791 | preserve it. */ | |
792 | if (TREE_SIDE_EFFECTS (expr)) | |
793 | return build2 (COMPOUND_EXPR, type, expr, t); | |
ceef8ce4 | 794 | else |
c0328be3 | 795 | return t; |
76e616db BK |
796 | } |
797 | } | |
c0328be3 | 798 | break; |
76e616db | 799 | |
c0328be3 JM |
800 | case TRUNC_DIV_EXPR: |
801 | { | |
2d143ba8 RB |
802 | tree arg0 = get_unwidened (TREE_OPERAND (expr, 0), NULL_TREE); |
803 | tree arg1 = get_unwidened (TREE_OPERAND (expr, 1), NULL_TREE); | |
c0328be3 JM |
804 | |
805 | /* Don't distribute unless the output precision is at least as | |
806 | big as the actual inputs and it has the same signedness. */ | |
807 | if (outprec >= TYPE_PRECISION (TREE_TYPE (arg0)) | |
808 | && outprec >= TYPE_PRECISION (TREE_TYPE (arg1)) | |
809 | /* If signedness of arg0 and arg1 don't match, | |
810 | we can't necessarily find a type to compare them in. */ | |
811 | && (TYPE_UNSIGNED (TREE_TYPE (arg0)) | |
812 | == TYPE_UNSIGNED (TREE_TYPE (arg1))) | |
813 | /* Do not change the sign of the division. */ | |
814 | && (TYPE_UNSIGNED (TREE_TYPE (expr)) | |
815 | == TYPE_UNSIGNED (TREE_TYPE (arg0))) | |
816 | /* Either require unsigned division or a division by | |
817 | a constant that is not -1. */ | |
818 | && (TYPE_UNSIGNED (TREE_TYPE (arg0)) | |
819 | || (TREE_CODE (arg1) == INTEGER_CST | |
820 | && !integer_all_onesp (arg1)))) | |
2d143ba8 RB |
821 | { |
822 | tree tem = do_narrow (loc, ex_form, type, arg0, arg1, | |
823 | expr, inprec, outprec, dofold); | |
824 | if (tem) | |
825 | return tem; | |
826 | } | |
c0328be3 JM |
827 | break; |
828 | } | |
76e616db | 829 | |
c0328be3 JM |
830 | case MAX_EXPR: |
831 | case MIN_EXPR: | |
832 | case MULT_EXPR: | |
833 | { | |
834 | tree arg0 = get_unwidened (TREE_OPERAND (expr, 0), type); | |
835 | tree arg1 = get_unwidened (TREE_OPERAND (expr, 1), type); | |
836 | ||
837 | /* Don't distribute unless the output precision is at least as | |
838 | big as the actual inputs. Otherwise, the comparison of the | |
839 | truncated values will be wrong. */ | |
840 | if (outprec >= TYPE_PRECISION (TREE_TYPE (arg0)) | |
841 | && outprec >= TYPE_PRECISION (TREE_TYPE (arg1)) | |
842 | /* If signedness of arg0 and arg1 don't match, | |
843 | we can't necessarily find a type to compare them in. */ | |
844 | && (TYPE_UNSIGNED (TREE_TYPE (arg0)) | |
845 | == TYPE_UNSIGNED (TREE_TYPE (arg1)))) | |
846 | goto trunc1; | |
847 | break; | |
848 | } | |
849 | ||
850 | case PLUS_EXPR: | |
851 | case MINUS_EXPR: | |
852 | case BIT_AND_EXPR: | |
853 | case BIT_IOR_EXPR: | |
854 | case BIT_XOR_EXPR: | |
855 | trunc1: | |
856 | { | |
857 | tree arg0 = get_unwidened (TREE_OPERAND (expr, 0), type); | |
858 | tree arg1 = get_unwidened (TREE_OPERAND (expr, 1), type); | |
859 | ||
860 | /* Do not try to narrow operands of pointer subtraction; | |
861 | that will interfere with other folding. */ | |
862 | if (ex_form == MINUS_EXPR | |
863 | && CONVERT_EXPR_P (arg0) | |
864 | && CONVERT_EXPR_P (arg1) | |
865 | && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg0, 0))) | |
866 | && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1, 0)))) | |
867 | break; | |
868 | ||
869 | if (outprec >= BITS_PER_WORD | |
870 | || TRULY_NOOP_TRUNCATION (outprec, inprec) | |
871 | || inprec > TYPE_PRECISION (TREE_TYPE (arg0)) | |
872 | || inprec > TYPE_PRECISION (TREE_TYPE (arg1))) | |
873 | { | |
2d143ba8 RB |
874 | tree tem = do_narrow (loc, ex_form, type, arg0, arg1, |
875 | expr, inprec, outprec, dofold); | |
876 | if (tem) | |
877 | return tem; | |
c0328be3 JM |
878 | } |
879 | } | |
3767c0fd | 880 | break; |
c0328be3 JM |
881 | |
882 | case NEGATE_EXPR: | |
883 | case BIT_NOT_EXPR: | |
884 | /* This is not correct for ABS_EXPR, | |
885 | since we must test the sign before truncation. */ | |
886 | { | |
887 | /* Do the arithmetic in type TYPEX, | |
888 | then convert result to TYPE. */ | |
889 | tree typex = type; | |
890 | ||
891 | /* Can't do arithmetic in enumeral types | |
892 | so use an integer type that will hold the values. */ | |
893 | if (TREE_CODE (typex) == ENUMERAL_TYPE) | |
894 | typex | |
895 | = lang_hooks.types.type_for_size (TYPE_PRECISION (typex), | |
896 | TYPE_UNSIGNED (typex)); | |
897 | ||
898 | if (!TYPE_UNSIGNED (typex)) | |
899 | typex = unsigned_type_for (typex); | |
900 | return convert (type, | |
901 | fold_build1 (ex_form, typex, | |
902 | convert (typex, | |
903 | TREE_OPERAND (expr, 0)))); | |
904 | } | |
905 | ||
906 | CASE_CONVERT: | |
907 | /* Don't introduce a "can't convert between vector values of | |
908 | different size" error. */ | |
909 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == VECTOR_TYPE | |
910 | && (GET_MODE_SIZE (TYPE_MODE | |
911 | (TREE_TYPE (TREE_OPERAND (expr, 0)))) | |
912 | != GET_MODE_SIZE (TYPE_MODE (type)))) | |
913 | break; | |
914 | /* If truncating after truncating, might as well do all at once. | |
915 | If truncating after extending, we may get rid of wasted work. */ | |
916 | return convert (type, get_unwidened (TREE_OPERAND (expr, 0), type)); | |
917 | ||
918 | case COND_EXPR: | |
919 | /* It is sometimes worthwhile to push the narrowing down through | |
920 | the conditional and never loses. A COND_EXPR may have a throw | |
921 | as one operand, which then has void type. Just leave void | |
922 | operands as they are. */ | |
269e63b7 KT |
923 | return |
924 | fold_build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), | |
925 | VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))) | |
926 | ? TREE_OPERAND (expr, 1) | |
927 | : convert (type, TREE_OPERAND (expr, 1)), | |
928 | VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 2))) | |
929 | ? TREE_OPERAND (expr, 2) | |
930 | : convert (type, TREE_OPERAND (expr, 2))); | |
76e616db | 931 | |
c0328be3 JM |
932 | default: |
933 | break; | |
934 | } | |
76e616db | 935 | |
c53153e7 JH |
936 | /* When parsing long initializers, we might end up with a lot of casts. |
937 | Shortcut this. */ | |
938 | if (TREE_CODE (expr) == INTEGER_CST) | |
939 | return fold_convert (type, expr); | |
0b87eff5 | 940 | return build1 (CONVERT_EXPR, type, expr); |
76e616db | 941 | |
f5963e61 | 942 | case REAL_TYPE: |
f34ebeb2 ML |
943 | if (sanitize_flags_p (SANITIZE_FLOAT_CAST) |
944 | && current_function_decl != NULL_TREE) | |
85a16bf8 MP |
945 | { |
946 | expr = save_expr (expr); | |
6b131d5b | 947 | tree check = ubsan_instrument_float_cast (loc, type, expr); |
85a16bf8 | 948 | expr = build1 (FIX_TRUNC_EXPR, type, expr); |
6b131d5b | 949 | if (check == NULL_TREE) |
85a16bf8 | 950 | return expr; |
269e63b7 KT |
951 | return maybe_fold_build2_loc (dofold, loc, COMPOUND_EXPR, |
952 | TREE_TYPE (expr), check, expr); | |
85a16bf8 MP |
953 | } |
954 | else | |
955 | return build1 (FIX_TRUNC_EXPR, type, expr); | |
76e616db | 956 | |
0f996086 CF |
957 | case FIXED_POINT_TYPE: |
958 | return build1 (FIXED_CONVERT_EXPR, type, expr); | |
959 | ||
f5963e61 | 960 | case COMPLEX_TYPE: |
269e63b7 KT |
961 | expr = maybe_fold_build1_loc (dofold, loc, REALPART_EXPR, |
962 | TREE_TYPE (TREE_TYPE (expr)), expr); | |
963 | return convert (type, expr); | |
0b127821 | 964 | |
0b4565c9 | 965 | case VECTOR_TYPE: |
3a021db2 | 966 | if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) |
0b4565c9 | 967 | { |
b8f75b8c MG |
968 | error ("can%'t convert a vector of type %qT" |
969 | " to type %qT which has different size", | |
970 | TREE_TYPE (expr), type); | |
0b4565c9 BS |
971 | return error_mark_node; |
972 | } | |
4d3c798d | 973 | return build1 (VIEW_CONVERT_EXPR, type, expr); |
0b4565c9 | 974 | |
f5963e61 JL |
975 | default: |
976 | error ("aggregate value used where an integer was expected"); | |
977 | return convert (type, integer_zero_node); | |
978 | } | |
76e616db | 979 | } |
0b127821 | 980 | |
269e63b7 KT |
981 | /* Convert EXPR to some integer (or enum) type TYPE. |
982 | ||
983 | EXPR must be pointer, integer, discrete (enum, char, or bool), float, | |
984 | fixed-point or vector; in other cases error is called. | |
985 | ||
986 | The result of this is always supposed to be a newly created tree node | |
987 | not in use in any existing structure. */ | |
0b127821 RS |
988 | |
989 | tree | |
269e63b7 | 990 | convert_to_integer (tree type, tree expr) |
0b127821 | 991 | { |
269e63b7 KT |
992 | return convert_to_integer_1 (type, expr, true); |
993 | } | |
994 | ||
415594bb JM |
995 | /* A wrapper around convert_to_complex_1 that only folds the |
996 | expression if DOFOLD, or if it is CONSTANT_CLASS_P. */ | |
269e63b7 KT |
997 | |
998 | tree | |
415594bb | 999 | convert_to_integer_maybe_fold (tree type, tree expr, bool dofold) |
269e63b7 | 1000 | { |
415594bb | 1001 | return convert_to_integer_1 (type, expr, dofold || CONSTANT_CLASS_P (expr)); |
269e63b7 KT |
1002 | } |
1003 | ||
1004 | /* Convert EXPR to the complex type TYPE in the usual ways. If FOLD_P is | |
1005 | true, try to fold the expression. */ | |
1006 | ||
1007 | static tree | |
1008 | convert_to_complex_1 (tree type, tree expr, bool fold_p) | |
1009 | { | |
1010 | location_t loc = EXPR_LOCATION (expr); | |
0b127821 | 1011 | tree subtype = TREE_TYPE (type); |
159b3be1 | 1012 | |
f5963e61 | 1013 | switch (TREE_CODE (TREE_TYPE (expr))) |
0b127821 | 1014 | { |
f5963e61 | 1015 | case REAL_TYPE: |
0f996086 | 1016 | case FIXED_POINT_TYPE: |
f5963e61 JL |
1017 | case INTEGER_TYPE: |
1018 | case ENUMERAL_TYPE: | |
1019 | case BOOLEAN_TYPE: | |
3244e67d RS |
1020 | return build2 (COMPLEX_EXPR, type, convert (subtype, expr), |
1021 | convert (subtype, integer_zero_node)); | |
0b127821 | 1022 | |
f5963e61 JL |
1023 | case COMPLEX_TYPE: |
1024 | { | |
1025 | tree elt_type = TREE_TYPE (TREE_TYPE (expr)); | |
1026 | ||
1027 | if (TYPE_MAIN_VARIANT (elt_type) == TYPE_MAIN_VARIANT (subtype)) | |
1028 | return expr; | |
c05eeebc JJ |
1029 | else if (TREE_CODE (expr) == COMPOUND_EXPR) |
1030 | { | |
269e63b7 KT |
1031 | tree t = convert_to_complex_1 (type, TREE_OPERAND (expr, 1), |
1032 | fold_p); | |
c05eeebc JJ |
1033 | if (t == TREE_OPERAND (expr, 1)) |
1034 | return expr; | |
1035 | return build2_loc (EXPR_LOCATION (expr), COMPOUND_EXPR, | |
1036 | TREE_TYPE (t), TREE_OPERAND (expr, 0), t); | |
269e63b7 | 1037 | } |
f5963e61 | 1038 | else if (TREE_CODE (expr) == COMPLEX_EXPR) |
269e63b7 KT |
1039 | return maybe_fold_build2_loc (fold_p, loc, COMPLEX_EXPR, type, |
1040 | convert (subtype, | |
1041 | TREE_OPERAND (expr, 0)), | |
1042 | convert (subtype, | |
1043 | TREE_OPERAND (expr, 1))); | |
f5963e61 JL |
1044 | else |
1045 | { | |
1046 | expr = save_expr (expr); | |
269e63b7 KT |
1047 | tree realp = maybe_fold_build1_loc (fold_p, loc, REALPART_EXPR, |
1048 | TREE_TYPE (TREE_TYPE (expr)), | |
1049 | expr); | |
1050 | tree imagp = maybe_fold_build1_loc (fold_p, loc, IMAGPART_EXPR, | |
1051 | TREE_TYPE (TREE_TYPE (expr)), | |
1052 | expr); | |
1053 | return maybe_fold_build2_loc (fold_p, loc, COMPLEX_EXPR, type, | |
1054 | convert (subtype, realp), | |
1055 | convert (subtype, imagp)); | |
f5963e61 JL |
1056 | } |
1057 | } | |
0b127821 | 1058 | |
f5963e61 JL |
1059 | case POINTER_TYPE: |
1060 | case REFERENCE_TYPE: | |
1061 | error ("pointer value used where a complex was expected"); | |
269e63b7 | 1062 | return convert_to_complex_1 (type, integer_zero_node, fold_p); |
f5963e61 JL |
1063 | |
1064 | default: | |
1065 | error ("aggregate value used where a complex was expected"); | |
269e63b7 | 1066 | return convert_to_complex_1 (type, integer_zero_node, fold_p); |
f5963e61 | 1067 | } |
0b127821 | 1068 | } |
0b4565c9 | 1069 | |
269e63b7 KT |
1070 | /* A wrapper around convert_to_complex_1 that always folds the |
1071 | expression. */ | |
1072 | ||
1073 | tree | |
1074 | convert_to_complex (tree type, tree expr) | |
1075 | { | |
1076 | return convert_to_complex_1 (type, expr, true); | |
1077 | } | |
1078 | ||
1079 | /* A wrapper around convert_to_complex_1 that only folds the | |
415594bb | 1080 | expression if DOFOLD, or if it is CONSTANT_CLASS_P. */ |
269e63b7 KT |
1081 | |
1082 | tree | |
415594bb | 1083 | convert_to_complex_maybe_fold (tree type, tree expr, bool dofold) |
269e63b7 | 1084 | { |
415594bb | 1085 | return convert_to_complex_1 (type, expr, dofold || CONSTANT_CLASS_P (expr)); |
269e63b7 KT |
1086 | } |
1087 | ||
0b4565c9 BS |
1088 | /* Convert EXPR to the vector type TYPE in the usual ways. */ |
1089 | ||
1090 | tree | |
159b3be1 | 1091 | convert_to_vector (tree type, tree expr) |
0b4565c9 | 1092 | { |
0b4565c9 BS |
1093 | switch (TREE_CODE (TREE_TYPE (expr))) |
1094 | { | |
1095 | case INTEGER_TYPE: | |
1096 | case VECTOR_TYPE: | |
3a021db2 | 1097 | if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) |
0b4565c9 | 1098 | { |
b8f75b8c MG |
1099 | error ("can%'t convert a value of type %qT" |
1100 | " to vector type %qT which has different size", | |
1101 | TREE_TYPE (expr), type); | |
0b4565c9 BS |
1102 | return error_mark_node; |
1103 | } | |
4d3c798d | 1104 | return build1 (VIEW_CONVERT_EXPR, type, expr); |
0b4565c9 BS |
1105 | |
1106 | default: | |
d8a07487 | 1107 | error ("can%'t convert value to a vector"); |
273d67e7 | 1108 | return error_mark_node; |
0b4565c9 BS |
1109 | } |
1110 | } | |
0f996086 CF |
1111 | |
1112 | /* Convert EXPR to some fixed-point type TYPE. | |
1113 | ||
1114 | EXPR must be fixed-point, float, integer, or enumeral; | |
1115 | in other cases error is called. */ | |
1116 | ||
1117 | tree | |
1118 | convert_to_fixed (tree type, tree expr) | |
1119 | { | |
1120 | if (integer_zerop (expr)) | |
1121 | { | |
1122 | tree fixed_zero_node = build_fixed (type, FCONST0 (TYPE_MODE (type))); | |
1123 | return fixed_zero_node; | |
1124 | } | |
1125 | else if (integer_onep (expr) && ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type))) | |
1126 | { | |
1127 | tree fixed_one_node = build_fixed (type, FCONST1 (TYPE_MODE (type))); | |
1128 | return fixed_one_node; | |
1129 | } | |
1130 | ||
1131 | switch (TREE_CODE (TREE_TYPE (expr))) | |
1132 | { | |
1133 | case FIXED_POINT_TYPE: | |
1134 | case INTEGER_TYPE: | |
1135 | case ENUMERAL_TYPE: | |
1136 | case BOOLEAN_TYPE: | |
1137 | case REAL_TYPE: | |
1138 | return build1 (FIXED_CONVERT_EXPR, type, expr); | |
1139 | ||
1140 | case COMPLEX_TYPE: | |
1141 | return convert (type, | |
1142 | fold_build1 (REALPART_EXPR, | |
1143 | TREE_TYPE (TREE_TYPE (expr)), expr)); | |
1144 | ||
1145 | default: | |
1146 | error ("aggregate value used where a fixed-point was expected"); | |
1147 | return error_mark_node; | |
1148 | } | |
1149 | } |