summaryrefslogtreecommitdiff
path: root/test/Transforms/InstCombine/compare-signs.ll
diff options
context:
space:
mode:
authorNick Lewycky <nicholas@mxc.ca>2009-12-05 05:00:00 +0000
committerNick Lewycky <nicholas@mxc.ca>2009-12-05 05:00:00 +0000
commit83e8ec73e1487926d6eb6d330bb869f173c8fcf1 (patch)
treef72a86f5409c5766d784bdb4acd2aab4989b5c91 /test/Transforms/InstCombine/compare-signs.ll
parent6c7e8a02d81be9b66a8cfc6f8b6f20d48088d915 (diff)
downloadllvm-83e8ec73e1487926d6eb6d330bb869f173c8fcf1.tar.gz
llvm-83e8ec73e1487926d6eb6d330bb869f173c8fcf1.tar.bz2
llvm-83e8ec73e1487926d6eb6d330bb869f173c8fcf1.tar.xz
Generalize this optimization to work on equality comparisons between any two
integers that are constant except for a single bit (the same n-th bit in each). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@90646 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Transforms/InstCombine/compare-signs.ll')
-rw-r--r--test/Transforms/InstCombine/compare-signs.ll36
1 files changed, 33 insertions, 3 deletions
diff --git a/test/Transforms/InstCombine/compare-signs.ll b/test/Transforms/InstCombine/compare-signs.ll
index ba638ba36f..b1c52e3131 100644
--- a/test/Transforms/InstCombine/compare-signs.ll
+++ b/test/Transforms/InstCombine/compare-signs.ll
@@ -2,7 +2,7 @@
; PR5438
; TODO: This should also optimize down.
-;define i32 @bar(i32 %a, i32 %b) nounwind readnone {
+;define i32 @test1(i32 %a, i32 %b) nounwind readnone {
;entry:
; %0 = icmp sgt i32 %a, -1 ; <i1> [#uses=1]
; %1 = icmp slt i32 %b, 0 ; <i1> [#uses=1]
@@ -11,8 +11,18 @@
; ret i32 %3
;}
-define i32 @qaz(i32 %a, i32 %b) nounwind readnone {
-; CHECK: @qaz
+; TODO: This optimizes partially but not all the way.
+;define i32 @test2(i32 %a, i32 %b) nounwind readnone {
+;entry:
+; %0 = and i32 %a, 8 ;<i32> [#uses=1]
+; %1 = and i32 %b, 8 ;<i32> [#uses=1]
+; %2 = icmp eq i32 %0, %1 ;<i1> [#uses=1]
+; %3 = zext i1 %2 to i32 ;<i32> [#uses=1]
+; ret i32 %3
+;}
+
+define i32 @test3(i32 %a, i32 %b) nounwind readnone {
+; CHECK: @test3
entry:
; CHECK: xor i32 %a, %b
; CHECK; lshr i32 %0, 31
@@ -26,3 +36,23 @@ entry:
; CHECK-NOT: zext
; CHECK: ret i32 %2
}
+
+; Variation on @test3: checking the 2nd bit in a situation where the 5th bit
+; is one, not zero.
+define i32 @test3i(i32 %a, i32 %b) nounwind readnone {
+; CHECK: @test3i
+entry:
+; CHECK: xor i32 %a, %b
+; CHECK; lshr i32 %0, 31
+; CHECK: xor i32 %1, 1
+ %0 = lshr i32 %a, 29 ; <i32> [#uses=1]
+ %1 = lshr i32 %b, 29 ; <i32> [#uses=1]
+ %2 = or i32 %0, 35
+ %3 = or i32 %1, 35
+ %4 = icmp eq i32 %2, %3 ; <i1> [#uses=1]
+ %5 = zext i1 %4 to i32 ; <i32> [#uses=1]
+ ret i32 %5
+; CHECK-NOT: icmp
+; CHECK-NOT: zext
+; CHECK: ret i32 %2
+}