Slightly reformat LDA tests to ease grepping.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77398 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll b/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll
index eff3644..9b3d578 100644
--- a/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll
+++ b/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll
@@ -3,8 +3,8 @@
@x = common global [256 x i32] zeroinitializer, align 4
@y = common global [256 x i32] zeroinitializer, align 4
-; for (i = 0; i < 256; i++)
-; x[i] = x[256 - i] + y[i]
+;; for (i = 0; i < 256; i++)
+;; x[i] = x[256 - i] + y[i]
define void @f1(...) nounwind {
entry:
@@ -30,9 +30,9 @@
ret void
}
-; // the same example, using more realistic IR
-; for (i = 0; i < 256; i++)
-; x[i] = x[256 - i] + y[i]
+;; // the same example, using more realistic IR
+;; for (i = 0; i < 256; i++)
+;; x[i] = x[256 - i] + y[i]
define void @f2(...) nounwind {
entry:
@@ -58,8 +58,8 @@
ret void
}
-; for (i = 0; i < 100; i++)
-; x[i] = x[256 - i] + y[i]
+;; for (i = 0; i < 100; i++)
+;; x[i] = x[256 - i] + y[i]
define void @f3(...) nounwind {
entry: