Slightly reformat LDA tests to ease grepping.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77398 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andreas Bolka 2009-07-28 23:40:40 +00:00
parent 7aaad71722
commit 7b43f5cdd1
5 changed files with 21 additions and 21 deletions

View File

@ -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:

View File

@ -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:

View File

@ -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:

View File

@ -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:

View File

@ -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: