[X86] Merge X86VPermt2Fp and X86VPermt2Int back together by weakening them just enoug...

[oota-llvm.git] / test / Other / 2002-02-24-InlineBrokePHINodes.ll

diff --git a/test/Other/2002-02-24-InlineBrokePHINodes.ll b/test/Other/2002-02-24-InlineBrokePHINodes.ll
index 1088205cdcc86eeb067b77dff7f3a4b8b785654e..db26942096d4554f4edf6cc1c1fe895db6df6acc 100644 (file)
--- a/test/Other/2002-02-24-InlineBrokePHINodes.ll
+++ b/test/Other/2002-02-24-InlineBrokePHINodes.ll
@@ -1,26 +1,23 @@
-; Inlining used to break PHI nodes.  This tests that they are correctly updated 
+; Inlining used to break PHI nodes.  This tests that they are correctly updated
 ; when a node is split around the call instruction.  The verifier caught the error.
 ;
-; RUN: llvm-as < %s | opt -inline
+; RUN: opt < %s -inline
 ;
-implementation
 
-ulong "test"(ulong %X)
-begin
-       ret ulong %X
-end
+define i64 @test(i64 %X) {
+       ret i64 %X
+}
 
-ulong "fib"(ulong %n)
-begin
-  %T = setlt ulong %n, 2       ; {bool}:0
-  br bool %T, label %BaseCase, label %RecurseCase
+define i64 @fib(i64 %n) {
+; <label>:0
+       %T = icmp ult i64 %n, 2         ; <i1> [#uses=1]
+       br i1 %T, label %BaseCase, label %RecurseCase
 
-RecurseCase:
-  %result = call ulong %test(ulong %n)
-  br label %BaseCase
-
-BaseCase:
-  %X = phi ulong [1, %0], [2, %RecurseCase]
-  ret ulong %X
-end
+RecurseCase:           ; preds = %0
+       %result = call i64 @test( i64 %n )              ; <i64> [#uses=0]
+       br label %BaseCase
 
+BaseCase:              ; preds = %RecurseCase, %0
+       %X = phi i64 [ 1, %0 ], [ 2, %RecurseCase ]             ; <i64> [#uses=1]
+       ret i64 %X
+}