test/CodeGen/R600: Add some basic tests v6

[oota-llvm.git] / test / Transforms / SimplifyCFG / PhiEliminate.ll

diff --git a/test/Transforms/SimplifyCFG/PhiEliminate.ll b/test/Transforms/SimplifyCFG/PhiEliminate.ll
index 9411b33f7b38652ff16944ce2af0b61a6ceabf80..d5ce9a7e6bc842a0c2928e6660616d5c338a0fce 100644 (file)
--- a/test/Transforms/SimplifyCFG/PhiEliminate.ll
+++ b/test/Transforms/SimplifyCFG/PhiEliminate.ll
@@ -3,35 +3,25 @@
 ; nodes away allows the branches to be eliminated, performing a simple form of
 ; 'if conversion'.
 
-; RUN: llvm-upgrade < %s | llvm-as | opt -simplifycfg | llvm-dis > %t.xform
-; RUN: not grep phi %t.xform && grep ret %t.xform
+; RUN: opt < %s -simplifycfg -S > %t.xform
+; RUN:   not grep phi %t.xform 
+; RUN:   grep ret %t.xform
 
-declare void %use(bool)
-declare void %use(int)
+declare void @use(i1)
 
+declare void @use.upgrd.1(i32)
 
-void %test2(bool %c, bool %d, int %V, int %V2) {
-       br bool %d, label %X, label %F
-X:
-       br bool %c, label %T, label %F
-T:
-       br label %F
-F:
-       %B1 = phi bool [true, %0], [false, %T], [false, %X]
-       %I7 = phi int  [%V, %0], [%V2, %T], [%V2, %X]
-       call void %use(bool %B1)
-       call void %use(int  %I7)
-       ret void
-}
 
-void %test(bool %c, int %V, int %V2) {
-       br bool %c, label %T, label %F
-T:
-       br label %F
-F:
-       %B1 = phi bool [true, %0], [false, %T]
-       %I6 = phi int  [%V, %0], [0, %T]
-       call void %use(bool %B1)
-       call void %use(int  %I6)
-       ret void
+define void @test(i1 %c, i32 %V, i32 %V2) {
+; <label>:0
+        br i1 %c, label %T, label %F
+T:              ; preds = %0
+        br label %F
+F:              ; preds = %T, %0
+        %B1 = phi i1 [ true, %0 ], [ false, %T ]                ; <i1> [#uses=1]
+        %I6 = phi i32 [ %V, %0 ], [ 0, %T ]             ; <i32> [#uses=1]
+        call void @use( i1 %B1 )
+        call void @use.upgrd.1( i32 %I6 )
+        ret void
 }
+