Change tests from "opt %s" to "opt < %s" so that opt doesn't see the

input filename so that opt doesn't print the input filename in the
output so that grep lines in the tests don't unintentionally match
strings in the input filename.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81537 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman
2009-09-11 18:01:28 +00:00
parent 597f9797fd
commit f2f6ce65b7
1273 changed files with 1366 additions and 1366 deletions

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
define void @try_swap() {
entry:

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
define i32 @image_to_texture(i32 %indvar454) {
loopentry.1.outer:

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
define void @main() {
entry:

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64"

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep ugt
; RUN: opt < %s -loop-reduce -S | grep ugt
; PR2535
@.str = internal constant [4 x i8] c"%d\0A\00"

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep add | count 2
; RUN: opt < %s -loop-reduce -S | grep add | count 2
; PR 2662
@g_3 = common global i16 0 ; <i16*> [#uses=2]
@"\01LC" = internal constant [4 x i8] c"%d\0A\00" ; <[4 x i8]*> [#uses=1]

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep "phi double" | count 1
; RUN: opt < %s -loop-reduce -S | grep "phi double" | count 1
define void @foobar(i32 %n) nounwind {
entry:

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep phi | count 2
; RUN: opt < %s -loop-reduce -S | grep phi | count 2
; PR 2779
@g_19 = common global i32 0 ; <i32*> [#uses=3]
@"\01LC" = internal constant [4 x i8] c"%d\0A\00" ; <[4 x i8]*> [#uses=1]

View File

@ -1,5 +1,5 @@
; RUN: opt %s -loop-reduce -S | grep phi | count 1
; RUN: opt %s -loop-reduce -S | grep mul | count 1
; RUN: opt < %s -loop-reduce -S | grep phi | count 1
; RUN: opt < %s -loop-reduce -S | grep mul | count 1
; ModuleID = '<stdin>'
; Make sure examining a fuller expression outside the loop doesn't cause us to create a second
; IV of stride %3.

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S \
; RUN: opt < %s -loop-reduce -S \
; RUN: | grep {getelementptr.*%lsr.iv.*%lsr.iv.*<i32\\*>}
; The multiply in bb2 must not be reduced to an add, as the sext causes the
; %1 argument to become negative after a while.

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
; Test to make sure that loop-reduce never crashes on IV's
; with different types but identical strides.

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: not grep {bitcast i32 1 to i32}
; END.
; The setlt wants to use a value that is incremented one more than the dominant

View File

@ -1,5 +1,5 @@
; Check that this test makes INDVAR and related stuff dead.
; RUN: opt %s -loop-reduce -S | grep phi | count 2
; RUN: opt < %s -loop-reduce -S | grep phi | count 2
declare i1 @pred()

View File

@ -1,7 +1,7 @@
; Don't reduce the byte access to P[i], at least not on targets that
; support an efficient 'mem[r1+r2]' addressing mode.
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
declare i1 @pred(i32)

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S \
; RUN: opt < %s -loop-reduce -S \
; RUN: | grep {icmp eq i2 %lsr.iv.next, %xmp4344}
; Don't reverse the iteration if the rhs of the compare is defined

View File

@ -1,5 +1,5 @@
; Check that the index of 'P[outer]' is pulled out of the loop.
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: not grep {getelementptr.*%outer.*%INDVAR}
declare i1 @pred()

View File

@ -1,5 +1,5 @@
; Check that the index of 'P[outer]' is pulled out of the loop.
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: not grep {getelementptr.*%outer.*%INDVAR}
declare i1 @pred()

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | not grep mul
; RUN: opt < %s -loop-reduce -S | not grep mul
; Make sure we don't get a multiply by 6 in this loop.

View File

@ -1,7 +1,7 @@
; Check that this test makes INDVAR and related stuff dead, because P[indvar]
; gets reduced, making INDVAR dead.
; RUN: opt %s -loop-reduce -S | not grep INDVAR
; RUN: opt < %s -loop-reduce -S | not grep INDVAR
declare i1 @pred()

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
; LSR should not crash on this.
define fastcc void @loadloop() {

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt < %s -loop-reduce -disable-output
; PR 2537
define void @a() {

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep {phi\\>} | count 10
; RUN: opt < %s -loop-reduce -S | grep {phi\\>} | count 10
; PR2570
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32"

View File

@ -1,5 +1,5 @@
; RUN: opt %s -loop-reduce -disable-output
; RUN: opt %s -analyze -scalar-evolution -disable-output
; RUN: opt < %s -loop-reduce -disable-output
; RUN: opt < %s -analyze -scalar-evolution -disable-output
; PR 3086
%struct.Cls = type { i32, i8, [2 x %struct.Cls*], [2 x %struct.Lit*] }

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis
; RUN: opt < %s -loop-reduce | llvm-dis
; PR3399
@g_53 = external global i32 ; <i32*> [#uses=1]

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis
; RUN: opt < %s -loop-reduce | llvm-dis
; PR3571
target triple = "i386-mingw32"

View File

@ -1,4 +1,4 @@
; RUN: opt %s -analyze -iv-users -disable-output | grep {Stride i64 {3,+,2}<loop>:}
; RUN: opt < %s -analyze -iv-users -disable-output | grep {Stride i64 {3,+,2}<loop>:}
; The value of %r is dependent on a polynomial iteration expression.

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep phi | count 1
; RUN: opt < %s -loop-reduce -S | grep phi | count 1
; This should only result in one PHI node!

View File

@ -1,5 +1,5 @@
; Check that this test makes INDVAR and related stuff dead.
; RUN: opt %s -loop-reduce -S | not grep INDVAR
; RUN: opt < %s -loop-reduce -S | not grep INDVAR
declare i1 @pred()

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep mul | count 1
; RUN: opt < %s -loop-reduce -S | grep mul | count 1
; LSR should not make two copies of the Q*L expression in the preheader!
define i8 @test(i8* %A, i8* %B, i32 %L, i32 %Q, i32 %N.s) {

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | grep phi | count 1
; RUN: opt < %s -loop-reduce -S | grep phi | count 1
; This testcase should have ONE stride 18 indvar, the other use should have a
; loop invariant value (B) added to it inside of the loop, instead of having

View File

@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: grep {add i32 %lsr.iv.next, 1}
;
; Make sure that the use of the IV outside of the loop (the store) uses the

View File

@ -1,9 +1,9 @@
; Base should not be i*3, it should be i*2.
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: not grep {mul.*%i, 3}
; Indvar should not start at zero:
; RUN: opt %s -loop-reduce -S | \
; RUN: opt < %s -loop-reduce -S | \
; RUN: not grep {phi i32 .* 0}
; END.

View File

@ -1,5 +1,5 @@
; Check that variable strides are reduced to adds instead of multiplies.
; RUN: opt %s -loop-reduce -S | not grep mul
; RUN: opt < %s -loop-reduce -S | not grep mul
declare i1 @pred(i32)