Revert r101471. For tight recursive functions which have multiple

[oota-llvm.git] / test / Transforms / Inline / alloca_test.ll

diff --git a/test/Transforms/Inline/alloca_test.ll b/test/Transforms/Inline/alloca_test.ll
index cb90b8ca834e7c7019cd0189cf00fe2697a4e0ce..e5791d5d25538e445941fe6005086cf7944079bf 100644 (file)
--- a/test/Transforms/Inline/alloca_test.ll
+++ b/test/Transforms/Inline/alloca_test.ll
@@ -1,19 +1,23 @@
 ; This test ensures that alloca instructions in the entry block for an inlined
 ; function are moved to the top of the function they are inlined into.
 ;
-; RUN: llvm-as < %s | opt -inline | llvm-dis | grep -C1 alloca | grep Entry:
+; RUN: opt -S -inline %s | FileCheck %s
 
-int %func(int %i) {
-       %X = alloca int 
-       ret int %i
+define i32 @func(i32 %i) {
+        %X = alloca i32         ; <i32*> [#uses=1]
+        store i32 %i, i32* %X
+        ret i32 %i
 }
 
-declare void %bar()
+declare void @bar()
 
-int %main(int %argc) {
+define i32 @main(i32 %argc) {
 Entry:
-       call void %bar()
-       %X = call int %func(int 7)
-       %Y = add int %X, %argc
-       ret int %Y
+; CHECK: Entry
+; CHECK-NEXT: alloca
+        call void @bar( )
+        %X = call i32 @func( i32 7 )            ; <i32> [#uses=1]
+        %Y = add i32 %X, %argc          ; <i32> [#uses=1]
+        ret i32 %Y
 }
+