[LLVMdev] Possible bug in ExpandShiftWithUnknownAmountBit
javier at jmartinez.org
Sat Dec 5 00:29:55 PST 2009
Maybe I'm beating a dead horse but I wanted to see if understood correctly
your optimization to avoid doing a subtraction.
The way I understand it the idea is to mask out the high bits of Amt which
in some cases is equivalent to subtracting a value from Amt. The cases
where this holds is when the value subtracted from Amt is a power of two.
This value is half the original register size. For 64-bit integers 32 is
subtracted from Amt which is equivalent to masking out the top 59 bits
leaving the bottom 5. For a 40-bit operation decomposed using two 20-bit
registers I don't know if a mask that can be ANDed to subtract 20 from Amt.
It's no biggie. I'm just curious as to why you thought that the register
size didn't matter. I's always good to learn something new :)
On Sat, 05 Dec 2009 08:30:59 +0100, Duncan Sands <baldrick at free.fr> wrote:
> Hi Javier,
>> I don't know if the optimization would help us much. Our architecture
>> performs integer shifts and subtractions at the same speed. I think the
>> optimization is limited to the case where NVBits is a power of two.
> it is irrelevant whether it is a power of two or not. Anyway, since you
> are the only user, and this is not helpful for you, I guess we can forget
> it :)
>> In your previous email you mentioned some comments added to check-in
>> In our architecture shifting by 0 doesn't cause any problems but the
>> comment might be valid for others.
> Actually it's the shifting by 32 (if NVBits is 32) which is a problem.
> If Amt is zero then a shift by 32 is generated at commented line.
More information about the llvm-dev