X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=test%2FAssembler%2F2002-08-22-DominanceProblem.ll;h=504861030d96840970352391fe06d9f968829e35;hb=10c4265675595f84ce1ea4d53da342bc7b1add1a;hp=ed8c704b115363091e917c2c1778d56221d72951;hpb=c642435f52fe9f35865efcab60705d390a302ac8;p=oota-llvm.git

diff --git a/test/Assembler/2002-08-22-DominanceProblem.ll b/test/Assembler/2002-08-22-DominanceProblem.ll
index ed8c704b115..504861030d9 100644
--- a/test/Assembler/2002-08-22-DominanceProblem.ll
+++ b/test/Assembler/2002-08-22-DominanceProblem.ll
@@ -1,13 +1,18 @@
+; RUN: llvm-as %s -o /dev/null
+; RUN: verify-uselistorder %s
+
 ; Dominance relationships is not calculated correctly for unreachable blocks,
 ; which causes the verifier to barf on this input.
 
-int %test(bool %b) {
-BB0:  ret int 7                                 ; Loop is unreachable
+define i32 @test(i1 %b) {
+BB0:
+        ret i32 7 ; Loop is unreachable
+
+Loop:           ; preds = %L2, %Loop
+        %B = phi i32 [ %B, %L2 ], [ %B, %Loop ]         ;PHI has same value always. 
+        br i1 %b, label %L2, label %Loop
 
-Loop:
-        %B = phi int [%B, %L2], [%B, %Loop]     ; PHI has same value always.
-        br bool %b, label %L2, label %Loop
-L2:
+L2:             ; preds = %Loop
         br label %Loop
 }