Simplify negated bit test

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@170020 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Majnemer 2012-12-12 20:48:54 +00:00
parent 8ceb8b764f
commit 63522b1998
2 changed files with 44 additions and 0 deletions

View File

@ -2034,6 +2034,15 @@ Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
CI->countTrailingZeros()));
}
// Turn x&~y == 0 into x&y != 0 if x is a power of 2.
Value *X = 0, *Y = 0;
if (match(Op0, m_And(m_Value(X), m_Not(m_Value(Y)))) &&
match(Op1, m_Zero()) && isPowerOfTwo(X, TD)) {
return new ICmpInst(ICmpInst::ICMP_NE,
Builder->CreateAnd(X, Y),
Op1);
}
break;
}
case ICmpInst::ICMP_NE: {
@ -2071,6 +2080,15 @@ Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
CI->countTrailingZeros()));
}
// Turn x&~y != 0 into x&y == 0 if x is a power of 2.
Value *X = 0, *Y = 0;
if (match(Op0, m_And(m_Value(X), m_Not(m_Value(Y)))) &&
match(Op1, m_Zero()) && isPowerOfTwo(X, TD)) {
return new ICmpInst(ICmpInst::ICMP_EQ,
Builder->CreateAnd(X, Y),
Op1);
}
break;
}
case ICmpInst::ICMP_ULT:

View File

@ -677,3 +677,29 @@ define i1 @test66(i64 %A, i64 %B) {
; CHECK-NEXT: ret i1 true
ret i1 %cmp
}
define i1 @test67(i32 %A, i32 %B) {
%neg = xor i32 %A, -1
%shl = shl i32 1, %B
%and = and i32 %shl, %neg
%cmp = icmp ne i32 %and, 0
; CHECK: @test67
; CHECK-NEXT: %shl = shl i32 1, %B
; CHECK-NEXT: %1 = and i32 %shl, %A
; CHECK-NEXT: %cmp = icmp eq i32 %1, 0
; CHECK-NEXT: ret i1 %cmp
ret i1 %cmp
}
define i1 @test68(i32 %A, i32 %B) {
%neg = xor i32 %A, -1
%shl = shl i32 1, %B
%and = and i32 %shl, %neg
%cmp = icmp eq i32 %and, 0
; CHECK: @test68
; CHECK-NEXT: %shl = shl i32 1, %B
; CHECK-NEXT: %1 = and i32 %shl, %A
; CHECK-NEXT: %cmp = icmp ne i32 %1, 0
; CHECK-NEXT: ret i1 %cmp
ret i1 %cmp
}