On Fri, 8 Dec 2023, Jakub Jelinek wrote:
> Hi!
>
> Before bitint lowering, the IL has:
> b.0_1 = b;
> _2 = -b.0_1;
> _3 = (unsigned _BitInt(512)) _2;
> a.1_4 = a;
> a.2_5 = (unsigned _BitInt(512)) a.1_4;
> _6 = _3 * a.2_5;
> on the first function. Now, gimple_lower_bitint has an
Hi!
Before bitint lowering, the IL has:
b.0_1 = b;
_2 = -b.0_1;
_3 = (unsigned _BitInt(512)) _2;
a.1_4 = a;
a.2_5 = (unsigned _BitInt(512)) a.1_4;
_6 = _3 * a.2_5;
on the first function. Now, gimple_lower_bitint has an optimization
(when not -O0) that it avoids assigning underlying