Use opt -S instead of piping bitcode output through llvm-dis.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81257 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman
2009-09-08 22:34:10 +00:00
parent f316579901
commit 3e054fe9ef
865 changed files with 973 additions and 973 deletions
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | grep ugt
; RUN: opt %s -loop-reduce -S | grep ugt
; PR2535
@.str = internal constant [4 x i8] c"%d\0A\00"
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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]
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | grep "phi double" | count 1
; RUN: opt %s -loop-reduce -S | grep "phi double" | count 1
define void @foobar(i32 %n) nounwind {
entry:
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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]
@@ -1,5 +1,5 @@
; RUN: opt %s -loop-reduce | llvm-dis | grep phi | count 1
; RUN: opt %s -loop-reduce | llvm-dis | 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.
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | grep phi | count 1
; RUN: opt < %s -loop-reduce -S | grep phi | count 1
define void @foo(i32 %n) {
entry:
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | \
; 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
@@ -1,5 +1,5 @@
; Check that this test makes INDVAR and related stuff dead.
; RUN: opt %s -loop-reduce | llvm-dis | grep phi | count 2
; RUN: opt %s -loop-reduce -S | grep phi | count 2
declare i1 @pred()
@@ -1,5 +1,5 @@
; Check that the index of 'P[outer]' is pulled out of the loop.
; RUN: opt %s -loop-reduce | llvm-dis | \
; RUN: opt %s -loop-reduce -S | \
; RUN: not grep {getelementptr.*%outer.*%INDVAR}
declare i1 @pred()
@@ -1,5 +1,5 @@
; Check that the index of 'P[outer]' is pulled out of the loop.
; RUN: opt %s -loop-reduce | llvm-dis | \
; RUN: opt %s -loop-reduce -S | \
; RUN: not grep {getelementptr.*%outer.*%INDVAR}
declare i1 @pred()
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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.
@@ -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 | llvm-dis | not grep INDVAR
; RUN: opt %s -loop-reduce -S | not grep INDVAR
declare i1 @pred()
+1 -1
View File
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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"
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | grep phi | count 1
; RUN: opt %s -loop-reduce -S | grep phi | count 1
; This should only result in one PHI node!
@@ -1,5 +1,5 @@
; Check that this test makes INDVAR and related stuff dead.
; RUN: opt %s -loop-reduce | llvm-dis | not grep INDVAR
; RUN: opt %s -loop-reduce -S | not grep INDVAR
declare i1 @pred()
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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) {
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | 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
@@ -1,4 +1,4 @@
; RUN: opt %s -loop-reduce | llvm-dis | \
; 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
@@ -1,9 +1,9 @@
; Base should not be i*3, it should be i*2.
; RUN: opt %s -loop-reduce | llvm-dis | \
; RUN: opt %s -loop-reduce -S | \
; RUN: not grep {mul.*%i, 3}
; Indvar should not start at zero:
; RUN: opt %s -loop-reduce | llvm-dis | \
; RUN: opt %s -loop-reduce -S | \
; RUN: not grep {phi i32 .* 0}
; END.
@@ -1,5 +1,5 @@
; Check that variable strides are reduced to adds instead of multiplies.
; RUN: opt %s -loop-reduce | llvm-dis | not grep mul
; RUN: opt %s -loop-reduce -S | not grep mul
declare i1 @pred(i32)