Slightly reformat LDA tests to ease grepping.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77398 91177308-0d34-0410-b5e6-96231b3b80d8

5 files changed, 21 insertions, 21 deletions

diff --git a/test/Analysis/LoopDependenceAnalysis/alias.ll b/test/Analysis/LoopDependenceAnalysis/alias.ll
index 6c613269bd..b6a5a4fc37 100644
--- a/test/Analysis/LoopDependenceAnalysis/alias.ll
+++ b/test/Analysis/LoopDependenceAnalysis/alias.ll
@@ -1,6 +1,6 @@
 ; RUN: llvm-as < %s | opt -disable-output -analyze -lda | FileCheck %s
 
-; x[5] = x[6] // with x being a pointer passed as argument
+;; x[5] = x[6] // with x being a pointer passed as argument
 
 define void @f1(i32* nocapture %xptr) nounwind {
 entry:
@@ -21,7 +21,7 @@ for.end:
   ret void
 }
 
-; x[5] = x[6] // with x being an array on the stack
+;; x[5] = x[6] // with x being an array on the stack
 
 define void @foo(...) nounwind {
 entry:
diff --git a/test/Analysis/LoopDependenceAnalysis/siv-strong.ll b/test/Analysis/LoopDependenceAnalysis/siv-strong.ll
index 9536645e4c..c4e0476442 100644
--- a/test/Analysis/LoopDependenceAnalysis/siv-strong.ll
+++ b/test/Analysis/LoopDependenceAnalysis/siv-strong.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[i] + y[i]
+;; for (i = 0; i < 256; i++)
+;;   x[i] = x[i] + y[i]
 
 define void @f1(...) nounwind {
 entry:
@@ -28,8 +28,8 @@ for.end:
   ret void
 }
 
-; for (i = 0; i < 256; i++)
-;   x[i+1] = x[i] + y[i]
+;; for (i = 0; i < 256; i++)
+;;   x[i+1] = x[i] + y[i]
 
 define void @f2(...) nounwind {
 entry:
@@ -54,8 +54,8 @@ for.end:
   ret void
 }
 
-; for (i = 0; i < 10; i++)
-;   x[i+20] = x[i] + y[i]
+;; for (i = 0; i < 10; i++)
+;;   x[i+20] = x[i] + y[i]
 
 define void @f3(...) nounwind {
 entry:
diff --git a/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll b/test/Analysis/LoopDependenceAnalysis/siv-weak-crossing.ll
index eff3644d90..9b3d5784ba 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 @@ for.end:
   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 @@ for.end:
   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:
diff --git a/test/Analysis/LoopDependenceAnalysis/siv-weak-zero.ll b/test/Analysis/LoopDependenceAnalysis/siv-weak-zero.ll
index 12c90ba4cb..72fc2db375 100644
--- a/test/Analysis/LoopDependenceAnalysis/siv-weak-zero.ll
+++ b/test/Analysis/LoopDependenceAnalysis/siv-weak-zero.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[42] + y[i]
+;; for (i = 0; i < 256; i++)
+;;   x[i] = x[42] + y[i]
 
 define void @f1(...) nounwind {
 entry:
@@ -29,8 +29,8 @@ for.end:
   ret void
 }
 
-; for (i = 0; i < 250; i++)
-;   x[i] = x[255] + y[i]
+;; for (i = 0; i < 250; i++)
+;;   x[i] = x[255] + y[i]
 
 define void @f2(...) nounwind {
 entry:
diff --git a/test/Analysis/LoopDependenceAnalysis/ziv.ll b/test/Analysis/LoopDependenceAnalysis/ziv.ll
index b099a57ae7..21f9f3882a 100644
--- a/test/Analysis/LoopDependenceAnalysis/ziv.ll
+++ b/test/Analysis/LoopDependenceAnalysis/ziv.ll
@@ -2,7 +2,7 @@
 
 @x = common global [256 x i32] zeroinitializer, align 4
 
-; x[5] = x[6]
+;; x[5] = x[6]
 
 define void @f1(...) nounwind {
 entry:
@@ -21,7 +21,7 @@ for.end:
   ret void
 }
 
-; x[c] = x[c+1] // with c being a loop-invariant constant
+;; x[c] = x[c+1] // with c being a loop-invariant constant
 
 define void @f2(i64 %c0) nounwind {
 entry: