[llvm-commits] CVS: llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll 2002-05-02-MissSecondInst.ll 2002-08-30-GetElementPtrTest.ll 2003-06-24-OverdefinedPHIValue.ll basictest.ll sccptest.ll

[Chris Lattner]

Changes in directory llvm/test/Regression/Transforms/SCCP:

2002-05-02-EdgeFailure.ll updated: 1.1 -> 1.2
2002-05-02-MissSecondInst.ll updated: 1.1 -> 1.2
2002-08-30-GetElementPtrTest.ll updated: 1.1 -> 1.2
2003-06-24-OverdefinedPHIValue.ll updated: 1.1 -> 1.2
basictest.ll updated: 1.1 -> 1.2
sccptest.ll updated: 1.3 -> 1.4

---
Log message:

Remove explicit control flow through the use of the 'not' script



---
Diffs of the changes:

Index: llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll
diff -u llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll:1.1 llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll:1.2
--- llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll:1.1	Thu May  2 15:41:39 2002
+++ llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll	Sat Jun 28 18:23:33 2003
@@ -5,13 +5,9 @@
 ; real benchmark (mst from Olden benchmark, MakeGraph function).  When SCCP is
 ; fixed, this should be eliminated by a single SCCP application.
 ;
-; RUN: if as < %s | opt -sccp | dis | grep loop
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp | dis | not grep loop
 
-int *"test"()
-begin
+int* %test() {
 bb1:
 	%A = malloc int
 	br label %bb2
@@ -24,5 +20,4 @@
 
 bb3:
 	ret int * %A
-end
-
+}


Index: llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll
diff -u llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll:1.1 llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll:1.2
--- llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll:1.1	Thu May  2 15:18:36 2002
+++ llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll	Sat Jun 28 18:23:33 2003
@@ -1,12 +1,7 @@
-; RUN: if as < %s | opt -sccp | dis | grep sub
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp | dis | not grep sub
 
-void "test3"(int, int)
-begin
+void %test3(int, int) {
 	add int 0, 0
         sub int 0, 4
         ret void
-end
-
+}


Index: llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll
diff -u llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll:1.1 llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll:1.2
--- llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll:1.1	Fri Aug 30 18:22:15 2002
+++ llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll	Sat Jun 28 18:23:33 2003
@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -sccp | dis | grep '%X'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp | dis | not grep '%X'
 
 %G = uninitialized global [40x int]
 


Index: llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll
diff -u llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll:1.1 llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll:1.2
--- llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll:1.1	Tue Jun 24 15:29:36 2003
+++ llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll	Sat Jun 28 18:23:33 2003
@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -sccp -simplifycfg | dis | grep then:
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp -simplifycfg | dis | not grep then:
 
 void %cprop_test11(int* %data.1) {
 entry:		; No predecessors!


Index: llvm/test/Regression/Transforms/SCCP/basictest.ll
diff -u llvm/test/Regression/Transforms/SCCP/basictest.ll:1.1 llvm/test/Regression/Transforms/SCCP/basictest.ll:1.2
--- llvm/test/Regression/Transforms/SCCP/basictest.ll:1.1	Thu May  2 15:41:39 2002
+++ llvm/test/Regression/Transforms/SCCP/basictest.ll	Sat Jun 28 18:23:33 2003
@@ -1,13 +1,9 @@
 ; This is a basic sanity check for constant propogation.  The add instruction 
 ; should be eliminated.
 
-; RUN: if as < %s | opt -sccp | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp | dis | not grep add
 
-int "test"(bool %B)
-begin
+int %test(bool %B) {
 	br bool %B, label %BB1, label %BB2
 BB1:
 	%Val = add int 0, 0
@@ -17,4 +13,4 @@
 BB3:
 	%Ret = phi int [%Val, %BB1], [1, %BB2]
 	ret int %Ret
-end
+}


Index: llvm/test/Regression/Transforms/SCCP/sccptest.ll
diff -u llvm/test/Regression/Transforms/SCCP/sccptest.ll:1.3 llvm/test/Regression/Transforms/SCCP/sccptest.ll:1.4
--- llvm/test/Regression/Transforms/SCCP/sccptest.ll:1.3	Wed May 22 10:49:14 2002
+++ llvm/test/Regression/Transforms/SCCP/sccptest.ll	Sat Jun 28 18:23:33 2003
@@ -1,13 +1,9 @@
 ; This is the test case taken from appel's book that illustrates a hard case
 ; that SCCP gets right. BB3 should be completely eliminated.
 ;
-; RUN: if as < %s | opt -sccp -constprop -dce -cfgsimplify | dis | grep BB3
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp -constprop -dce -cfgsimplify | dis | not grep BB3
 
-int "test function"(int %i0, int %j0)
-begin
+int %test function(int %i0, int %j0) {
 BB1:
 	br label %BB2
 BB2:
@@ -35,5 +31,4 @@
 	%j4 = phi int [1, %BB5], [%k2, %BB6]
 	%k4 = phi int [%k3, %BB5], [%k5, %BB6]
 	br label %BB2
-end
-
+}