Add a test case to make sure that constant folding of the bit counting
authorReid Spencer <rspencer@reidspencer.com>
Mon, 2 Apr 2007 01:45:31 +0000 (01:45 +0000)
committerReid Spencer <rspencer@reidspencer.com>
Mon, 2 Apr 2007 01:45:31 +0000 (01:45 +0000)
intrinsics works.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@35577 91177308-0d34-0410-b5e6-96231b3b80d8

test/Transforms/InstCombine/bitcount.ll [new file with mode: 0644]

diff --git a/test/Transforms/InstCombine/bitcount.ll b/test/Transforms/InstCombine/bitcount.ll
new file mode 100644 (file)
index 0000000..bb85110
--- /dev/null
@@ -0,0 +1,16 @@
+; Tests to make sure bit counts of constants are folded
+; RUN: llvm-as < %s | opt -instcombine | llvm-dis -o /dev/null -f && 
+; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep 'llvm.ct'
+
+declare i32 @llvm.ctpop.i31(i31 %val) 
+declare i32 @llvm.cttz.i32(i32 %val) 
+declare i32 @llvm.ctlz.i33(i33 %val) 
+
+define i32 %test(i32 %A) {
+  %c1 = i32 call @llvm.ctpop(i31 12415124)
+  %c2 = i32 call @llvm.cttz(i32 87359874)
+  %c3 = i32 call @llvm.ctlz(i33 87359874)
+  %r1 = add i32 %c1, %c2
+  %r2 = add i32 %r1, %c3
+  ret i32 %r2
+}