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 ac746e262704fa0a99fd2c5ce898ffa4917ba4b0..db527fefa976b090c6907e29d98565ac1d965095 100644 (file)
--- a/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll
+++ b/test/Analysis/ScalarEvolution/2008-11-18-Stride1.ll
@@ -1,5 +1,9 @@
-; RUN: llvm-as < %s | opt -analyze -scalar-evolution |& grep {/u 3}
-; XFAIL: *
+; 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
+; be teaching it how to use a more elaborate trip count computation.
 
 define i32 @f(i32 %x) nounwind readnone {
 entry: