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

llvm-svn: 6965
diff --git a/llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll b/llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll
index 341847bc..be8bbfd 100644
--- a/llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll
+++ b/llvm/test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll
@@ -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
-
+}
diff --git a/llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll b/llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll
index 8029456..101ced7 100644
--- a/llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll
+++ b/llvm/test/Regression/Transforms/SCCP/2002-05-02-MissSecondInst.ll
@@ -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
-
+}
diff --git a/llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll b/llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll
index c3c5d70..a957a90 100644
--- a/llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll
+++ b/llvm/test/Regression/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll
@@ -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]
 
diff --git a/llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll b/llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll
index e91c643..85ea1a7 100644
--- a/llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll
+++ b/llvm/test/Regression/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll
@@ -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!
diff --git a/llvm/test/Regression/Transforms/SCCP/basictest.ll b/llvm/test/Regression/Transforms/SCCP/basictest.ll
index 239f375..2ed9d5e 100644
--- a/llvm/test/Regression/Transforms/SCCP/basictest.ll
+++ b/llvm/test/Regression/Transforms/SCCP/basictest.ll
@@ -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
+}
diff --git a/llvm/test/Regression/Transforms/SCCP/sccptest.ll b/llvm/test/Regression/Transforms/SCCP/sccptest.ll
index 20361f7..37f4bc2 100644
--- a/llvm/test/Regression/Transforms/SCCP/sccptest.ll
+++ b/llvm/test/Regression/Transforms/SCCP/sccptest.ll
@@ -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
-
+}