Teach TailRecursionElimination to consider 'nocapture' when deciding whether

[oota-llvm.git] / test / Transforms / TailCallElim / ackermann.ll

diff --git a/test/Transforms/TailCallElim/ackermann.ll b/test/Transforms/TailCallElim/ackermann.ll
index dd6e2769f18a062d8c6b08e4a8ee6dea4ca098db..5b5dbcc225c1e037b6a5a3f81f0fc9c09eb81c17 100644 (file)
--- a/test/Transforms/TailCallElim/ackermann.ll
+++ b/test/Transforms/TailCallElim/ackermann.ll
@@ -1,30 +1,25 @@
 ; This function contains two tail calls, which should be eliminated
-; RUN: llvm-upgrade < %s | llvm-as | \
-; RUN:   opt -tailcallelim -stats -disable-output |& grep {2 tailcallelim}
+; RUN: opt < %s -tailcallelim -stats -disable-output 2>&1 | grep "2 tailcallelim"
 
-int %Ack(int %M.1, int %N.1) {
+define i32 @Ack(i32 %M.1, i32 %N.1) {
 entry:
-        %tmp.1 = seteq int %M.1, 0              ; <bool> [#uses=1]
-        br bool %tmp.1, label %then.0, label %endif.0
-
-then.0:
-        %tmp.4 = add int %N.1, 1                ; <int> [#uses=1]
-        ret int %tmp.4
-
-endif.0:
-        %tmp.6 = seteq int %N.1, 0              ; <bool> [#uses=1]
-        br bool %tmp.6, label %then.1, label %endif.1
-
-then.1:
-        %tmp.10 = add int %M.1, -1              ; <int> [#uses=1]
-        %tmp.8 = call int %Ack( int %tmp.10, int 1 )            ; <int> [#uses=1]
-        ret int %tmp.8
-
-endif.1:
-        %tmp.13 = add int %M.1, -1              ; <int> [#uses=1]
-        %tmp.17 = add int %N.1, -1              ; <int> [#uses=1]
-        %tmp.14 = call int %Ack( int %M.1, int %tmp.17 )                ; <int> [#uses=1]
-        %tmp.11 = call int %Ack( int %tmp.13, int %tmp.14 )             ; <int> [#uses=1]
-        ret int %tmp.11
+       %tmp.1 = icmp eq i32 %M.1, 0            ; <i1> [#uses=1]
+       br i1 %tmp.1, label %then.0, label %endif.0
+then.0:                ; preds = %entry
+       %tmp.4 = add i32 %N.1, 1                ; <i32> [#uses=1]
+       ret i32 %tmp.4
+endif.0:               ; preds = %entry
+       %tmp.6 = icmp eq i32 %N.1, 0            ; <i1> [#uses=1]
+       br i1 %tmp.6, label %then.1, label %endif.1
+then.1:                ; preds = %endif.0
+       %tmp.10 = add i32 %M.1, -1              ; <i32> [#uses=1]
+       %tmp.8 = call i32 @Ack( i32 %tmp.10, i32 1 )            ; <i32> [#uses=1]
+       ret i32 %tmp.8
+endif.1:               ; preds = %endif.0
+       %tmp.13 = add i32 %M.1, -1              ; <i32> [#uses=1]
+       %tmp.17 = add i32 %N.1, -1              ; <i32> [#uses=1]
+       %tmp.14 = call i32 @Ack( i32 %M.1, i32 %tmp.17 )                ; <i32> [#uses=1]
+       %tmp.11 = call i32 @Ack( i32 %tmp.13, i32 %tmp.14 )             ; <i32> [#uses=1]
+       ret i32 %tmp.11
 }