Skip to content

[InstCombine] Generate better code for std::bit_floor from libstdc++ #144842

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
77 changes: 77 additions & 0 deletions llvm/lib/Transforms/InstCombine/InstCombineSelect.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -3911,6 +3911,80 @@ static Value *foldSelectBitTest(SelectInst &Sel, Value *CondVal, Value *TrueVal,
return nullptr;
}

// Transform:
//
// 1 << (C - ctlz(X >> 1))
//
// into
//
// (1 << (C - 1)) >> ctlz(X)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Could you update this comment with the mask?

Maybe you can even mention that the mask is free on many machines.

//
// The caller must guarantee that X is nonzero.
//
// TODO: Relax the requirement that X be nonzero. We just need to require X to
// be nonzero or the second argument of CTLZ to be true (that is, returning
// poison on zero).
static Instruction *foldBitFloorNonzero(Value *N, Value *X,
InstCombiner::BuilderTy &Builder) {
Type *NType = N->getType();
unsigned BitWidth = NType->getScalarSizeInBits();

// Match C - ctlz(X >> 1), where C is in (0, BitWidth].
// TODO: Handle C in [0, BitWidth] (with 0 included in the range), in which
// case 1 << C - ctlz(X >> 1) is equivalent to
// (1 << ((C - 1) & (BitWidth - 1))) >> ctlz(X).
const APInt *C = nullptr;
Value *CTLZ;
if (!match(N, m_OneUse(m_Shl(m_One(),
m_OneUse(m_Sub(m_APInt(C), m_Value(CTLZ)))))) ||
!(C->ugt(0) && C->ule(BitWidth)) ||
!match(CTLZ, m_OneUse(m_Intrinsic<Intrinsic::ctlz>(
m_OneUse(m_LShr(m_Specific(X), m_One())), m_Zero()))))
return nullptr;

APInt ShiftedBit = APInt::getOneBitSet(BitWidth, C->getZExtValue() - 1);

Value *NewCTLZ =
Builder.CreateIntrinsic(Intrinsic::ctlz, {CTLZ->getType()},
{X, cast<Instruction>(CTLZ)->getOperand(1)});
Value *Masked =
Builder.CreateAnd(NewCTLZ, ConstantInt::get(NType, BitWidth - 1));
auto *Shift = cast<Instruction>(
Builder.CreateLShr(ConstantInt::get(NType, ShiftedBit), Masked));
Shift->setIsExact();
return Shift;
}

// Transform:
//
// X == 0 ? 0 : (1 << (C1 - ctlz(X >> 1)))
//
// into
//
// X == 0 ? 0 : (C2 >> ctlz(X))
//
// where C2 is computed by foldBitFloorNonzero based on C1. The caller is
// responsible for replacing one of the select operands.
static Instruction *foldBitFloor(SelectInst &SI,
InstCombiner::BuilderTy &Builder) {
Value *TrueVal = SI.getTrueValue();
Value *FalseVal = SI.getFalseValue();

CmpPredicate Pred;
Value *Cond0;
if (!match(SI.getCondition(), m_ICmp(Pred, m_Value(Cond0), m_Zero())) ||
!ICmpInst::isEquality(Pred))
return nullptr;

if (Pred == ICmpInst::ICMP_NE)
std::swap(TrueVal, FalseVal);

if (!match(TrueVal, m_Zero()))
return nullptr;

return foldBitFloorNonzero(FalseVal, Cond0, Builder);
}

Instruction *InstCombinerImpl::visitSelectInst(SelectInst &SI) {
Value *CondVal = SI.getCondition();
Value *TrueVal = SI.getTrueValue();
Expand Down Expand Up @@ -4392,6 +4466,9 @@ Instruction *InstCombinerImpl::visitSelectInst(SelectInst &SI) {
if (Instruction *I = foldBitCeil(SI, Builder, *this))
return I;

if (Instruction *I = foldBitFloor(SI, Builder))
return replaceOperand(SI, match(SI.getTrueValue(), m_Zero()) ? 2 : 1, I);

if (Instruction *I = foldSelectToCmp(SI))
return I;

Expand Down
28 changes: 12 additions & 16 deletions llvm/test/Transforms/InstCombine/bit_floor.ll
Original file line number Diff line number Diff line change
Expand Up @@ -4,10 +4,9 @@
define i32 @bit_floor_32(i32 %x) {
; CHECK-LABEL: @bit_floor_32(
; CHECK-NEXT: [[EQ0:%.*]] = icmp eq i32 [[X:%.*]], 0
; CHECK-NEXT: [[LSHR:%.*]] = lshr i32 [[X]], 1
; CHECK-NEXT: [[CTLZ:%.*]] = tail call range(i32 1, 33) i32 @llvm.ctlz.i32(i32 [[LSHR]], i1 false)
; CHECK-NEXT: [[SUB:%.*]] = sub nuw nsw i32 32, [[CTLZ]]
; CHECK-NEXT: [[SHL:%.*]] = shl nuw i32 1, [[SUB]]
; CHECK-NEXT: [[TMP1:%.*]] = call range(i32 0, 33) i32 @llvm.ctlz.i32(i32 [[X]], i1 false)
; CHECK-NEXT: [[TMP2:%.*]] = and i32 [[TMP1]], 31
; CHECK-NEXT: [[SHL:%.*]] = lshr exact i32 -2147483648, [[TMP2]]
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[EQ0]], i32 0, i32 [[SHL]]
; CHECK-NEXT: ret i32 [[SEL]]
;
Expand All @@ -23,10 +22,9 @@ define i32 @bit_floor_32(i32 %x) {
define i64 @bit_floor_64(i64 %x) {
; CHECK-LABEL: @bit_floor_64(
; CHECK-NEXT: [[EQ0:%.*]] = icmp eq i64 [[X:%.*]], 0
; CHECK-NEXT: [[LSHR:%.*]] = lshr i64 [[X]], 1
; CHECK-NEXT: [[CTLZ:%.*]] = tail call range(i64 1, 65) i64 @llvm.ctlz.i64(i64 [[LSHR]], i1 false)
; CHECK-NEXT: [[SUB:%.*]] = sub nuw nsw i64 64, [[CTLZ]]
; CHECK-NEXT: [[SHL:%.*]] = shl nuw i64 1, [[SUB]]
; CHECK-NEXT: [[TMP1:%.*]] = call range(i64 0, 65) i64 @llvm.ctlz.i64(i64 [[X]], i1 false)
; CHECK-NEXT: [[TMP2:%.*]] = and i64 [[TMP1]], 63
; CHECK-NEXT: [[SHL:%.*]] = lshr exact i64 -9223372036854775808, [[TMP2]]
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[EQ0]], i64 0, i64 [[SHL]]
; CHECK-NEXT: ret i64 [[SEL]]
;
Expand All @@ -43,10 +41,9 @@ define i64 @bit_floor_64(i64 %x) {
define i32 @bit_floor_commuted_operands(i32 %x) {
; CHECK-LABEL: @bit_floor_commuted_operands(
; CHECK-NEXT: [[NE0_NOT:%.*]] = icmp eq i32 [[X:%.*]], 0
; CHECK-NEXT: [[LSHR:%.*]] = lshr i32 [[X]], 1
; CHECK-NEXT: [[CTLZ:%.*]] = tail call range(i32 1, 33) i32 @llvm.ctlz.i32(i32 [[LSHR]], i1 false)
; CHECK-NEXT: [[SUB:%.*]] = sub nuw nsw i32 32, [[CTLZ]]
; CHECK-NEXT: [[SHL:%.*]] = shl nuw i32 1, [[SUB]]
; CHECK-NEXT: [[TMP1:%.*]] = call range(i32 0, 33) i32 @llvm.ctlz.i32(i32 [[X]], i1 false)
; CHECK-NEXT: [[TMP2:%.*]] = and i32 [[TMP1]], 31
; CHECK-NEXT: [[SHL:%.*]] = lshr exact i32 -2147483648, [[TMP2]]
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[NE0_NOT]], i32 0, i32 [[SHL]]
; CHECK-NEXT: ret i32 [[SEL]]
;
Expand Down Expand Up @@ -151,10 +148,9 @@ define i32 @bit_floor_shl_used_twice(i32 %x, ptr %p) {
define <4 x i32> @bit_floor_v4i32(<4 x i32> %x) {
; CHECK-LABEL: @bit_floor_v4i32(
; CHECK-NEXT: [[EQ0:%.*]] = icmp eq <4 x i32> [[X:%.*]], zeroinitializer
; CHECK-NEXT: [[LSHR:%.*]] = lshr <4 x i32> [[X]], splat (i32 1)
; CHECK-NEXT: [[CTLZ:%.*]] = tail call range(i32 1, 33) <4 x i32> @llvm.ctlz.v4i32(<4 x i32> [[LSHR]], i1 false)
; CHECK-NEXT: [[SUB:%.*]] = sub nuw nsw <4 x i32> splat (i32 32), [[CTLZ]]
; CHECK-NEXT: [[SHL:%.*]] = shl nuw <4 x i32> splat (i32 1), [[SUB]]
; CHECK-NEXT: [[TMP1:%.*]] = call range(i32 0, 33) <4 x i32> @llvm.ctlz.v4i32(<4 x i32> [[X]], i1 false)
; CHECK-NEXT: [[TMP2:%.*]] = and <4 x i32> [[TMP1]], splat (i32 31)
; CHECK-NEXT: [[SHL:%.*]] = lshr exact <4 x i32> splat (i32 -2147483648), [[TMP2]]
; CHECK-NEXT: [[SEL:%.*]] = select <4 x i1> [[EQ0]], <4 x i32> zeroinitializer, <4 x i32> [[SHL]]
; CHECK-NEXT: ret <4 x i32> [[SEL]]
;
Expand Down
Loading