mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
ea4ee76d88
Reuse the existing KnownBits multiplication code to handle the 'extend + multiply + extract high bits' pattern for multiply-high ops. Noticed while looking at the codegen for D88785 / D98587 - the patch helps division-by-constant expansion code in particular, which suggests that we might have some further KnownBits div/rem cases we could handle - but this was far easier to implement. Differential Revision: https://reviews.llvm.org/D98857 |
||
---|---|---|
.. | ||
add-with-overflow.ll | ||
add.ll | ||
divide-by-constant.ll | ||
imul-neg.ll | ||
imul.ll | ||
lshr.ll | ||
mul64.ll | ||
sdiv-exact.ll | ||
smul-with-overflow.ll | ||
sub-with-overflow.ll | ||
sub.ll | ||
umul-with-overflow.ll |