[llvm] e99a79f - [InstCombine] Add test for missing assume handling multi-use demanded bits (NFC)

[Nikita Popov via llvm-commits]

Author: Nikita Popov
Date: 2023-05-26T14:59:36+02:00
New Revision: e99a79fbf57ea81ae25aa9efbf6e29441d969c0a

URL: https://github.com/llvm/llvm-project/commit/e99a79fbf57ea81ae25aa9efbf6e29441d969c0a
DIFF: https://github.com/llvm/llvm-project/commit/e99a79fbf57ea81ae25aa9efbf6e29441d969c0a.diff

LOG: [InstCombine] Add test for missing assume handling multi-use demanded bits (NFC)

Works if the assume is on a root value or an operation that does
not support multi-use demanded bits.

Added: 
    

Modified: 
    llvm/test/Transforms/InstCombine/assume.ll

Removed: 
    


################################################################################
diff  --git a/llvm/test/Transforms/InstCombine/assume.ll b/llvm/test/Transforms/InstCombine/assume.ll
index 388bc4998ce0..467ecec60a3f 100644
--- a/llvm/test/Transforms/InstCombine/assume.ll
+++ b/llvm/test/Transforms/InstCombine/assume.ll
@@ -795,6 +795,59 @@ define void @canonicalize_assume(ptr %0) {
   ret void
 }
 
+define void @assume_makes_and_known_assume_on_arg(ptr %p, i32 %x) {
+; CHECK-LABEL: @assume_makes_and_known_assume_on_arg(
+; CHECK-NEXT:    [[AND:%.*]] = and i32 [[X:%.*]], 1
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[AND]], 0
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    store i32 0, ptr [[P:%.*]], align 4
+; CHECK-NEXT:    ret void
+;
+  %and = and i32 %x, 1
+  %cmp = icmp eq i32 %and, 0
+  call void @llvm.assume(i1 %cmp)
+  %and2 = and i32 %x, 1
+  store i32 %and2, ptr %p
+  ret void
+}
+
+define void @assume_makes_and_known_assume_on_mul(ptr %p, i32 %a, i32 %b) {
+; CHECK-LABEL: @assume_makes_and_known_assume_on_mul(
+; CHECK-NEXT:    [[X:%.*]] = mul i32 [[A:%.*]], [[B:%.*]]
+; CHECK-NEXT:    [[AND:%.*]] = and i32 [[X]], 1
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[AND]], 0
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    store i32 0, ptr [[P:%.*]], align 4
+; CHECK-NEXT:    ret void
+;
+  %x = mul i32 %a, %b
+  %and = and i32 %x, 1
+  %cmp = icmp eq i32 %and, 0
+  call void @llvm.assume(i1 %cmp)
+  %and2 = and i32 %x, 1
+  store i32 %and2, ptr %p
+  ret void
+}
+
+define void @assume_makes_and_known_assume_on_bitwise(ptr %p, i32 %a, i32 %b) {
+; CHECK-LABEL: @assume_makes_and_known_assume_on_bitwise(
+; CHECK-NEXT:    [[X:%.*]] = or i32 [[A:%.*]], [[B:%.*]]
+; CHECK-NEXT:    [[AND:%.*]] = and i32 [[X]], 1
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[AND]], 0
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    [[AND2:%.*]] = and i32 [[X]], 1
+; CHECK-NEXT:    store i32 [[AND2]], ptr [[P:%.*]], align 4
+; CHECK-NEXT:    ret void
+;
+  %x = or i32 %a, %b
+  %and = and i32 %x, 1
+  %cmp = icmp eq i32 %and, 0
+  call void @llvm.assume(i1 %cmp)
+  %and2 = and i32 %x, 1
+  store i32 %and2, ptr %p
+  ret void
+}
+
 declare void @llvm.dbg.value(metadata, metadata, metadata)
 
 !llvm.dbg.cu = !{!0}