aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSanjay Patel <spatel@rotateright.com>2020-09-08 09:17:01 -0400
committerSanjay Patel <spatel@rotateright.com>2020-09-08 09:17:42 -0400
commit4964d75d7078b932ac6b17c1990adaa6eada75c1 (patch)
tree766e871ea3fafeca306932e9348b5a268f436842
parente67405141836fcd88183863758eeb42f32e847a6 (diff)
downloadllvm-4964d75d7078b932ac6b17c1990adaa6eada75c1.zip
llvm-4964d75d7078b932ac6b17c1990adaa6eada75c1.tar.gz
llvm-4964d75d7078b932ac6b17c1990adaa6eada75c1.tar.bz2
[InstCombine] add bitwise logic fold tests for D86395; NFC
-rw-r--r--llvm/test/Transforms/InstCombine/xor.ll74
1 files changed, 74 insertions, 0 deletions
diff --git a/llvm/test/Transforms/InstCombine/xor.ll b/llvm/test/Transforms/InstCombine/xor.ll
index 312b0125..ba275a6 100644
--- a/llvm/test/Transforms/InstCombine/xor.ll
+++ b/llvm/test/Transforms/InstCombine/xor.ll
@@ -1171,3 +1171,77 @@ define i8 @not_ashr_wrong_const(i8 %x) {
%r = xor i8 %a, -2
ret i8 %r
}
+
+; (~A & B) ^ A --> (A | B)
+; The division ops are here to thwart complexity-based canonicalization: all ops are binops.
+
+define i32 @test52(i32 %p1, i32 %p2) {
+; CHECK-LABEL: @test52(
+; CHECK-NEXT: [[A:%.*]] = udiv i32 42, [[P1:%.*]]
+; CHECK-NEXT: [[B:%.*]] = udiv i32 42, [[P2:%.*]]
+; CHECK-NEXT: [[O:%.*]] = xor i32 [[A]], -1
+; CHECK-NEXT: [[R:%.*]] = and i32 [[B]], [[O]]
+; CHECK-NEXT: [[Z:%.*]] = xor i32 [[R]], [[A]]
+; CHECK-NEXT: ret i32 [[Z]]
+;
+ %a = udiv i32 42, %p1
+ %b = udiv i32 42, %p2
+ %o = xor i32 %a, -1
+ %r = and i32 %o, %b
+ %z = xor i32 %r, %a
+ ret i32 %z
+}
+
+; (~B & A) ^ B --> (A | B)
+; The division ops are here to thwart complexity-based canonicalization: all ops are binops.
+
+define i32 @test53(i32 %p1, i32 %p2) {
+; CHECK-LABEL: @test53(
+; CHECK-NEXT: [[A:%.*]] = udiv i32 42, [[P1:%.*]]
+; CHECK-NEXT: [[B:%.*]] = udiv i32 42, [[P2:%.*]]
+; CHECK-NEXT: [[O:%.*]] = xor i32 [[B]], -1
+; CHECK-NEXT: [[R:%.*]] = and i32 [[A]], [[O]]
+; CHECK-NEXT: [[Z:%.*]] = xor i32 [[R]], [[B]]
+; CHECK-NEXT: ret i32 [[Z]]
+;
+ %a = udiv i32 42, %p1
+ %b = udiv i32 42, %p2
+ %o = xor i32 %b, -1
+ %r = and i32 %o, %a
+ %z = xor i32 %r, %b
+ ret i32 %z
+}
+
+define i32 @test54(i32 %p1, i32 %p2) {
+; CHECK-LABEL: @test54(
+; CHECK-NEXT: [[A:%.*]] = udiv i32 42, [[P1:%.*]]
+; CHECK-NEXT: [[B:%.*]] = udiv i32 42, [[P2:%.*]]
+; CHECK-NEXT: [[O:%.*]] = xor i32 [[A]], -1
+; CHECK-NEXT: [[R:%.*]] = and i32 [[B]], [[O]]
+; CHECK-NEXT: [[Z:%.*]] = xor i32 [[R]], [[A]]
+; CHECK-NEXT: ret i32 [[Z]]
+;
+ %a = udiv i32 42, %p1
+ %b = udiv i32 42, %p2
+ %o = xor i32 %a, -1
+ %r = and i32 %b, %o
+ %z = xor i32 %r, %a
+ ret i32 %z
+}
+
+define i32 @test55(i32 %p1, i32 %p2) {
+; CHECK-LABEL: @test55(
+; CHECK-NEXT: [[A:%.*]] = udiv i32 42, [[P1:%.*]]
+; CHECK-NEXT: [[B:%.*]] = udiv i32 42, [[P2:%.*]]
+; CHECK-NEXT: [[O:%.*]] = xor i32 [[A]], -1
+; CHECK-NEXT: [[R:%.*]] = and i32 [[B]], [[O]]
+; CHECK-NEXT: [[Z:%.*]] = xor i32 [[A]], [[R]]
+; CHECK-NEXT: ret i32 [[Z]]
+;
+ %a = udiv i32 42, %p1
+ %b = udiv i32 42, %p2
+ %o = xor i32 %a, -1
+ %r = and i32 %o, %b
+ %z = xor i32 %a, %r
+ ret i32 %z
+}