The BLX instruction is encoded differently than the BL, because why not? In

[oota-llvm.git] / test / Analysis / ScalarEvolution / 2008-11-18-Stride1.ll

diff --git a/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll b/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll
index 9dda78b21f7d123ae7d459bb6110b96eb52ae9f6..db527fefa976b090c6907e29d98565ac1d965095 100644 (file)
--- a/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll
+++ b/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll
@@ -1,5 +1,5 @@
-; RUN: opt < %s -analyze -scalar-evolution -disable-output \
-; RUN:  | grep {Loop bb: Unpredictable backedge-taken count\\.}
+; RUN: opt < %s -analyze -scalar-evolution \
+; RUN:  | grep {Loop %bb: Unpredictable backedge-taken count\\.}
 
 ; ScalarEvolution can't compute a trip count because it doesn't know if
 ; dividing by the stride will have a remainder. This could theoretically