Whoops, forgot to check this in. :)

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

diff --git a/test/Transforms/TailCallElim/accum_recursion_constant_arg.ll b/test/Transforms/TailCallElim/accum_recursion_constant_arg.ll
new file mode 100644 (file)
index 0000000..6bc6469
--- /dev/null
+++ b/test/Transforms/TailCallElim/accum_recursion_constant_arg.ll
@@ -0,0 +1,22 @@
+; This is a more aggressive form of accumulator recursion insertion, which 
+; requires noticing that X doesn't change as we perform the tailcall.  Thanks
+; go out to the anonymous users of the demo script for "suggesting" 
+; optimizations that should be done.  :)
+
+; RUN: llvm-as < %s | opt -tailcallelim | llvm-dis | not grep call
+
+int %mul(int %x, int %y) {
+entry:
+        %tmp.1 = seteq int %y, 0
+        br bool %tmp.1, label %return, label %endif
+
+endif:
+        %tmp.8 = add int %y, -1
+        %tmp.5 = call int %mul( int %x, int %tmp.8 )
+        %tmp.9 = add int %tmp.5, %x
+        ret int %tmp.9
+
+return:
+        ret int %x
+}
+