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: {
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:
; 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
+}