RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-03-07 11:59:09 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[DemandedBits] Add support for funnel shifts

Browse Source 
Add support for funnel shifts to the DemandedBits analysis. The
demanded bits of the first two operands can be determined if the
shift amount is constant. The demanded bits of the third operand
(shift amount) can be determined if the bitwidth is a power of two.

This is basically the same functionality as implemented in D54869
and D54478, but for DemandedBits rather than InstCombine.

Differential Revision: https://reviews.llvm.org/D54876

llvm-svn: 347561
This commit is contained in:
Nikita Popov 2018-11-26 15:36:57 +00:00
parent 038df3f411
commit 374de7d026
2 changed files with 100 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lib/Analysis/DemandedBits.cpp
View File

@ -142,6 +142,27 @@ void DemandedBits::determineLiveOperandBits(
std::min(BitWidth, Known.countMaxTrailingZeros()+1));
}
break;
case Intrinsic::fshl:
case Intrinsic::fshr:
if (OperandNo == 2) {
// Shift amount is modulo the bitwidth. For powers of two we have
// SA % BW == SA & (BW - 1).
if (isPowerOf2_32(BitWidth))
AB = BitWidth - 1;
} else if (auto *SA = dyn_cast<ConstantInt>(II->getOperand(2))) {
// TODO: Support vectors.
// Normalize to funnel shift left. APInt shifts of BitWidth are well-
// defined, so no need to special-case zero shifts here.
uint64_t ShiftAmt = SA->getValue().urem(BitWidth);
if (II->getIntrinsicID() == Intrinsic::fshr)
ShiftAmt = BitWidth - ShiftAmt;
if (OperandNo == 0)
AB = AOut.lshr(ShiftAmt);
else if (OperandNo == 1)
AB = AOut.shl(BitWidth - ShiftAmt);
}
break;
}
break;
case Instruction::Add:

79
test/Analysis/DemandedBits/intrinsics.ll
View File

@ -23,3 +23,82 @@ define i8 @test_bitreverse(i32 %x) {
}
declare i32 @llvm.bitreverse.i32(i32)
; Funnel shifts
declare i32 @llvm.fshl.i32(i32, i32, i32)
declare i33 @llvm.fshr.i33(i33, i33, i33)
; CHECK-DAG: DemandedBits: 0xff for %x2 = or i32 %x, 1
; CHECK-DAG: DemandedBits: 0xff000000 for %y2 = or i32 %y, 1
; CHECK-DAG: DemandedBits: 0xffff for %z = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 8)
; CHECK-DAG: DemandedBits: 0xffffffff for %r = and i32 %z, 65535
define i32 @test_fshl(i32 %x, i32 %y) {
%x2 = or i32 %x, 1
%y2 = or i32 %y, 1
%z = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 8)
%r = and i32 %z, 65535
ret i32 %r
}
; CHECK-DAG: DemandedBits: 0xff for %x2 = or i33 %x, 1
; CHECK-DAG: DemandedBits: 0x1fe000000 for %y2 = or i33 %y, 1
; CHECK-DAG: DemandedBits: 0xffff for %z = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 25)
; CHECK-DAG: DemandedBits: 0x1ffffffff for %r = and i33 %z, 65535
define i33 @test_fshr(i33 %x, i33 %y) {
%x2 = or i33 %x, 1
%y2 = or i33 %y, 1
%z = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 25)
%r = and i33 %z, 65535
ret i33 %r
}
; CHECK-DAG: DemandedBits: 0xffff for %x2 = or i32 %x, 1
; CHECK-DAG: DemandedBits: 0x0 for %y2 = or i32 %y, 1
; CHECK-DAG: DemandedBits: 0xffff for %z = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 0)
; CHECK-DAG: DemandedBits: 0xffffffff for %r = and i32 %z, 65535
define i32 @test_fshl_zero_shift(i32 %x, i32 %y) {
%x2 = or i32 %x, 1
%y2 = or i32 %y, 1
%z = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 0)
%r = and i32 %z, 65535
ret i32 %r
}
; CHECK-DAG: DemandedBits: 0x0 for %x2 = or i33 %x, 1
; CHECK-DAG: DemandedBits: 0xffff for %y2 = or i33 %y, 1
; CHECK-DAG: DemandedBits: 0xffff for %z = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 33)
; CHECK-DAG: DemandedBits: 0x1ffffffff for %r = and i33 %z, 65535
define i33 @test_fshr_full_shift(i33 %x, i33 %y) {
%x2 = or i33 %x, 1
%y2 = or i33 %y, 1
%z = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 33)
%r = and i33 %z, 65535
ret i33 %r
}
; CHECK-DAG: DemandedBits: 0xffffffff for %x2 = or i32 %x, 1
; CHECK-DAG: DemandedBits: 0xffffffff for %y2 = or i32 %y, 1
; CHECK-DAG: DemandedBits: 0x1f for %z2 = or i32 %z, 1
; CHECK-DAG: DemandedBits: 0xffff for %f = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 %z2)
; CHECK-DAG: DemandedBits: 0xffffffff for %r = and i32 %f, 65535
define i32 @test_fshl_pow2_bitwidth(i32 %x, i32 %y, i32 %z) {
%x2 = or i32 %x, 1
%y2 = or i32 %y, 1
%z2 = or i32 %z, 1
%f = call i32 @llvm.fshl.i32(i32 %x2, i32 %y2, i32 %z2)
%r = and i32 %f, 65535
ret i32 %r
}
; CHECK-DAG: DemandedBits: 0x1ffffffff for %x2 = or i33 %x, 1
; CHECK-DAG: DemandedBits: 0x1ffffffff for %y2 = or i33 %y, 1
; CHECK-DAG: DemandedBits: 0x1ffffffff for %z2 = or i33 %z, 1
; CHECK-DAG: DemandedBits: 0xffff for %f = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 %z2)
; CHECK-DAG: DemandedBits: 0x1ffffffff for %r = and i33 %f, 65535
define i33 @test_fshr_non_pow2_bitwidth(i33 %x, i33 %y, i33 %z) {
%x2 = or i33 %x, 1
%y2 = or i33 %y, 1
%z2 = or i33 %z, 1
%f = call i33 @llvm.fshr.i33(i33 %x2, i33 %y2, i33 %z2)
%r = and i33 %f, 65535
ret i33 %r
}