New testcase for automatic insertion of accumulator variables to eliminate

tail recursion

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

diff --git a/test/Transforms/TailCallElim/accum_recursion.ll b/test/Transforms/TailCallElim/accum_recursion.ll
new file mode 100644 (file)
index 0000000..ceef503
--- /dev/null
+++ b/test/Transforms/TailCallElim/accum_recursion.ll
@@ -0,0 +1,17 @@
+; RUN: llvm-as < %s | opt -tailcallelim | llvm-dis | not grep call
+
+int %factorial(int %x) {
+entry:
+        %tmp.1 = setgt int %x, 0
+        br bool %tmp.1, label %then, label %else
+
+then:
+        %tmp.6 = add int %x, -1
+        %tmp.4 = call int %factorial( int %tmp.6 )
+        %tmp.7 = mul int %tmp.4, %x
+        ret int %tmp.7
+
+else:
+        ret int 1
+}
+