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

llvm-svn: 6965

llvm/test/Regression/Analysis/DSGraph/gcsetest.ll

@@ -1,10 +1,7 @@
 ; Test that GCSE uses ds-aa to do alias analysis, which is capable of 
 ; disambiguating some cases.
 
-; RUN: if as < %s | opt -ds-aa -load-vn -gcse -instcombine -dce | dis | grep ELIM
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -ds-aa -load-vn -gcse -instcombine -dce | dis | not grep ELIM
 
 %intpair = type {int*, int*}
 implementation

llvm/test/Regression/Assembler/2002-04-29-NameBinding.llx

@@ -4,10 +4,7 @@
 ; Check by running globaldce, which will remove the constant if there are
 ; no references to it!
 ; 
-; RUN: if as < %s | opt -globaldce | dis | grep constant
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -globaldce | dis | grep-not constant
 ;
 	
 %v1 = internal constant int 5
@@ -15,7 +12,6 @@
 implementation
 
 int "createtask"()
-begin
 	%v1 = alloca int           ;; Alloca should have one use!
 	%reg112 = load int* %v1    ;; This load should not use the global!
 	ret int %reg112

llvm/test/Regression/Assembler/ConstantExprFoldCast.llx

@@ -1,9 +1,6 @@
 ; This test checks to make sure that constant exprs fold in some simple situations
 
-; RUN: if as < %s | dis | grep cast
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | dis | grep-not cast
 
 %A = global int* cast (sbyte* null to int*)  ; Cast null -> fold
 %B = global int** cast (int** %A to int**)   ; Cast to same type -> fold

llvm/test/Regression/Linker/2003-05-31-LinkerRename.ll

@@ -5,10 +5,7 @@
 
 ; RUN: echo "implementation internal int %foo() { ret int 7 }" | as > Output/%s.1.bc
 ; RUN: as < %s > Output/%s.2.bc
-; RUN: if link Output/%s.[12].bc | dis | grep 'internal' | grep '%foo('
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: link Output/%s.[12].bc | dis | grep 'internal' | grep-not '%foo('
 
 implementation
 declare int %foo() 

llvm/test/Regression/Transforms/ADCE/2003-06-24-BasicFunctionality.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -adce -simplifycfg | dis | grep then:
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -adce -simplifycfg | dis | not grep then:
 
 void %dead_test8(int* %data.1, int %idx.1) {
 entry:		; No predecessors!

llvm/test/Regression/Transforms/ADCE/adcetest.ll

@@ -1,10 +1,7 @@
 ; This is the test case taken from Appel's book that illustrates a hard case
 ; that SCCP gets right, and when followed by ADCE, is completely eliminated
 ;
-; RUN: if as < %s | opt -sccp -adce -simplifycfg | dis | grep br
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -sccp -adce -simplifycfg | dis | not grep br
 
 int "test function"(int %i0, int %j0) {
 BB1:

llvm/test/Regression/Transforms/BasicAA/featuretest.ll

@@ -1,10 +1,7 @@
 ; This testcase tests for various features the basicaa test should be able to 
 ; determine, as noted in the comments.
 
-; RUN: if as < %s | opt -basicaa -load-vn -gcse -instcombine -dce | dis | grep REMOVE
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -basicaa -load-vn -gcse -instcombine -dce | dis | not grep REMOVE
 
 %Global = external global { int }
 

llvm/test/Regression/Transforms/BasicAA/gcsetest.ll

@@ -2,10 +2,7 @@
 ; disambiguating some obvious cases.  All loads should be removable in 
 ; this testcase.
 
-; RUN: if as < %s | opt -basicaa -load-vn -gcse -instcombine -dce | dis | grep load
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -basicaa -load-vn -gcse -instcombine -dce | dis | not grep load
 
 %A = global int 7
 %B = global int 8

llvm/test/Regression/Transforms/BasicAA/licmtest.ll

@@ -3,10 +3,7 @@
 ; two pointers, then the load should be hoisted, and the store sunk.  Thus
 ; the loop becomes empty and can be deleted by ADCE. 
 
-; RUN: if as < %s | opt -basicaa -licm --adce | dis | grep Loop
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -basicaa -licm --adce | dis | not grep Loop
 
 %A = global int 7
 %B = global int 8

llvm/test/Regression/Transforms/ConstProp/2002-05-03-NotOperator.ll

@@ -4,10 +4,7 @@
 
 ; Fix #2: The unary not instruction now no longer exists. Change to xor.
 
-; RUN: if as < %s | opt -constprop | dis | grep 'int 0'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop | dis | not grep 'int 0'
 
 int "test1"() {
 	%R = xor int 123, -1

llvm/test/Regression/Transforms/ConstProp/2002-09-03-SetCC-Bools.ll

@@ -1,9 +1,6 @@
 ; SetCC on boolean values was not implemented!
 
-; RUN: if as < %s | opt -constprop -die | dis | grep 'set'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | dis | not grep 'set'
 
 bool "test1"() {
 	%A = setle bool true, false

llvm/test/Regression/Transforms/ConstProp/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 -constprop -die | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | 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 @@ BB2:
 BB3:
 	%Ret = phi int [%Val, %BB1], [1, %BB2]
 	ret int %Ret
-end
+}

llvm/test/Regression/Transforms/ConstProp/logicaltest.ll

@@ -1,9 +1,6 @@
 ; Ensure constant propogation of logical instructions is working correctly.
 
-; RUN: if as < %s | opt -constprop -die | dis | ggrep -E 'and|or|xor'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | dis | not ggrep -E 'and|or|xor'
 
 
 int  "test1"() { %R = and int 4,1234          ret int  %R }

llvm/test/Regression/Transforms/ConstProp/nottest.ll

@@ -1,9 +1,6 @@
 ; Ensure constant propogation of 'not' instructions is working correctly.
 
-; RUN: if as < %s | opt -constprop -die | dis | grep xor
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | dis | not grep xor
 
 int "test1"() {
 	%R = xor int 4, -1

llvm/test/Regression/Transforms/ConstProp/phi.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 -constprop -die | dis | grep phi
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | dis | not grep phi
 
-int "test"(bool %B)
-begin
+int %test(bool %B) {
 BB0:
 	br bool %B, label %BB1, label %BB3
 BB1:
@@ -15,4 +11,4 @@ BB1:
 BB3:
 	%Ret = phi int [1, %BB0], [1, %BB1]
 	ret int %Ret
-end
+}

llvm/test/Regression/Transforms/ConstProp/remtest.ll

@@ -1,26 +1,23 @@
-; Ensure constant propogation of remainder instructions is working correctly.
+; Ensure constant propagation of remainder instructions is working correctly.
 
-; RUN: if as < %s | opt -constprop -die | dis | grep rem
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -constprop -die | dis | not grep rem
 
-int "test1"() {
+int %test1() {
 	%R = rem int 4, 3
 	ret int %R
 }
 
-int "test2"() {
+int %test2() {
 	%R = rem int 123, -23
 	ret int %R
 }
 
-float "test3"() {
+float %test3() {
 	%R = rem float 12.45, 123.213
 	ret float %R
 }
 
-double "test4"() {
+double %test4() {
 	%R = rem double 312.20213123, 12.3333412
 	ret double %R
 }

llvm/test/Regression/Transforms/CorrelatedExprs/2002-10-03-PHIPropogate.ll

@@ -12,10 +12,7 @@
 ;   }
 ; }
 ;
-; RUN: if as < %s | opt -cee -simplifycfg | dis | grep bb3
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -simplifycfg | dis | not grep bb3
 
 implementation
 declare void %bar()

llvm/test/Regression/Transforms/CorrelatedExprs/basictest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -cee -constprop -instcombine -dce | dis | grep 'REMOVE'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -constprop -instcombine -dce | dis | not grep 'REMOVE'
 
 int %test1(int %A) {
 	%cond = seteq int %A, 40

llvm/test/Regression/Transforms/CorrelatedExprs/branchtest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -cee -simplifycfg | dis | grep 'REMOVE'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -simplifycfg | dis | not grep 'REMOVE'
 
 implementation
 

llvm/test/Regression/Transforms/CorrelatedExprs/looptest.ll

@@ -11,10 +11,7 @@
 ;
 ; Note that this is a "feature" test, not a correctness test.
 ;
-; RUN: if as < %s | opt -cee -simplifycfg | dis | grep cond213
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -simplifycfg | dis | not grep cond213
 ;
 implementation   ; Functions:
 

llvm/test/Regression/Transforms/CorrelatedExprs/nullpointer.ll

@@ -1,10 +1,7 @@
 ; a load or store of a pointer indicates that the pointer is not null.
 ; Any succeeding uses of the pointer should get this info
 
-; RUN: if as < %s | opt -cee -instcombine -simplifycfg | dis | grep br
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -instcombine -simplifycfg | dis | not grep br
 
 implementation   ; Functions:
 

llvm/test/Regression/Transforms/CorrelatedExprs/whet.ll

@@ -11,10 +11,7 @@
 ;
 ; This should eliminate all BB's except BB0, BB9, BB10
 ;
-; RUN: if as < %s | opt -cee -instcombine -simplifycfg | dis | grep 'bb[2-8]'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -cee -instcombine -simplifycfg | dis | not grep 'bb[2-8]'
 
 implementation   ; Functions:
 

llvm/test/Regression/Transforms/DeadArgElim/basictest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -deadargelim | dis | grep DEADARG
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -deadargelim | dis | not grep DEADARG
 
 implementation
 

llvm/test/Regression/Transforms/FunctionResolve/2002-08-19-ResolveGlobalVars.ll

@@ -1,16 +1,7 @@
 ; Test that: extern int X[]  and int X[] = { 1, 2, 3, 4 } are resolved 
 ; correctly.
 ;
-; RUN: if as < %s | opt -funcresolve > /dev/null
-; RUN: then echo "opt ok"
-; RUN: else exit 1   # Make sure opt doesn't abort!
-; RUN: fi
-;
-; RUN: if as < %s | opt -funcresolve | dis | grep external
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
-;
+; RUN: as < %s | opt -funcresolve | dis | not grep external
 
 %X = external global [0 x int]
 %X = global [4 x int] [ int 1, int 2, int 3, int 4 ]

llvm/test/Regression/Transforms/FunctionResolve/2002-08-19-ResolveGlobalVarsEasier.ll

@@ -1,10 +1,7 @@
 ; Test that: extern int X[]  and int X[] = { 1, 2, 3, 4 } are resolved 
 ; correctly.  This doesn't have constantexprs
 ;
-; RUN: if as < %s | opt -funcresolve | dis | grep external
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve | dis | not grep external
 ;
 
 %X = external global [0 x int]

llvm/test/Regression/Transforms/FunctionResolve/2002-11-07-RetMismatch.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -funcresolve -funcresolve | dis | grep declare
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -funcresolve | dis | not grep declare
 
 declare void %qsortg(sbyte*, int, int)
 

llvm/test/Regression/Transforms/FunctionResolve/2002-11-09-ExternFn.ll

@@ -1,12 +1,5 @@
-; RUN: if as < %s | opt -funcresolve > /dev/null
-; RUN: then echo "opt ok"
-; RUN: else exit 1   # Make sure opt doesn't abort!
-; RUN: fi
 ;
-; RUN: if as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -instcombine | dis | not grep '\.\.\.'
 
 declare int %foo(...)
 declare int %foo(int)

llvm/test/Regression/Transforms/FunctionResolve/2003-04-18-ForwardDeclGlobal.ll

@@ -1,7 +1,5 @@
-; RUN: if as < %s | opt -funcresolve -disable-output 2>&1 | grep WARNING
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -disable-output 2>&1 | not grep WARNING
+
 %__popcount_tab = external constant [0 x ubyte]
 %__popcount_tab = constant [4 x ubyte] c"\00\01\01\02"
 

llvm/test/Regression/Transforms/FunctionResolve/2003-05-31-AllInternalDecls.ll

@@ -1,9 +1,6 @@
 ; This testcase should not cause a warning!
 
-; RUN: if (as < %s | opt -funcresolve -disable-output) 2>&1 | grep 'WARNING'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: (as < %s | opt -funcresolve -disable-output) 2>&1 | not grep 'WARNING'
 
 %X = internal global float 1.0
 %X = internal global int 1

llvm/test/Regression/Transforms/FunctionResolve/2003-05-31-FuncPointerResolve.ll

@@ -1,7 +1,5 @@
-; RUN: if as < %s | opt -funcresolve | dis | grep declare
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve | dis | not grep declare
+
 %Table = constant int(...)* %foo
 
 %Table2 = constant [1 x int(...)* ] [ int(...)* %foo ]

llvm/test/Regression/Transforms/FunctionResolve/2003-05-31-InternalDecl.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -funcresolve | dis | grep declare
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve | dis | not grep declare
 
 declare void %test(...)
 

llvm/test/Regression/Transforms/FunctionResolve/basictest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | grep call
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | not grep call
 
 declare int %foo(...)
 

llvm/test/Regression/Transforms/FunctionResolve/retmismatch1.ll

@@ -1,14 +1,6 @@
 ; This shows where the function is called with the prototype indicating a
 ; return type exists, but it really doesn't.
-; RUN: if as < %s | opt -funcresolve > /dev/null
-; RUN: then echo "opt ok"
-; RUN: else exit 1   # Make sure opt doesn't abort!
-; RUN: fi
-;
-; RUN: if as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | grep call
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | not grep call
 
 declare int %foo(...)
 

llvm/test/Regression/Transforms/FunctionResolve/retmismatch2.ll

@@ -1,15 +1,7 @@
 ; This shows where the function is called with the prototype indicating a
 ; return type doesn't exists, but it really does.
 ;
-; RUN: if as < %s | opt -funcresolve > /dev/null
-; RUN: then echo "opt ok"
-; RUN: else exit 1   # Make sure opt doesn't abort!
-; RUN: fi
-;
-; RUN: if as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | grep call
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -funcresolve -instcombine | dis | grep '\.\.\.' | not grep call
 
 declare void %foo(...)
 

llvm/test/Regression/Transforms/GCSE/2002-05-14-OperandSwap.ll

@@ -1,10 +1,7 @@
 ; This entire chain of computation should be optimized away, but
 ; wasn't because the two multiplies were not detected as being identical.
 ;
-; RUN: if as < %s  | opt -gcse -instcombine -dce | dis | grep sub
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s  | opt -gcse -instcombine -dce | dis | not grep sub
 
 implementation   ; Functions:
 

llvm/test/Regression/Transforms/GCSE/2003-06-13-LoadStoreEliminate.ll

@@ -1,10 +1,7 @@
 ; This testcase shows a bug where an common subexpression exists, but there
 ; is no shared dominator block that the expression can be hoisted out to.
 ;
-; RUN: if as < %s | opt -load-vn -gcse | dis | grep load
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -load-vn -gcse | dis | not grep load
 
 int %test(int* %P) {
 	store int 5, int* %P

llvm/test/Regression/Transforms/GCSE/RLE-Eliminate.ll

@@ -1,10 +1,7 @@
 ; This testcase ensures that redundant loads are eliminated when they should 
 ; be.  All RL variables (redundant loads) should be eliminated.
 ;
-; RUN: if as < %s | opt -load-vn -gcse | dis | grep %RL
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -load-vn -gcse | dis | not grep %RL
 ;
 int "test1"(int* %P) {
 	%A = load int* %P

llvm/test/Regression/Transforms/GlobalDCE/2002-08-17-FunctionDGE.ll

@@ -1,10 +1,7 @@
 ; Make sure that functions are removed successfully if they are referred to by
 ; a global that is dead.  Make sure any globals they refer to die as well.
 
-; RUN: if as < %s | opt -globaldce | dis | grep foo
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -globaldce | dis | not grep foo
 
 %b = internal global int ()* %foo   ;; Unused, kills %foo
 

llvm/test/Regression/Transforms/GlobalDCE/2002-08-17-WorkListTest.ll

@@ -1,10 +1,7 @@
 ; This testcase tests that a worklist is being used, and that globals can be 
 ; removed if they are the subject of a constexpr and ConstantPointerRef
 
-; RUN: if as < %s | opt -globaldce | dis | grep global
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -globaldce | dis | not grep global
 
 %t0 = internal global [4 x sbyte] c"foo\00"
 %t1 = internal global [4 x sbyte] c"bar\00"

llvm/test/Regression/Transforms/GlobalDCE/basicvariabletest.ll

@@ -1,8 +1,4 @@
-; RUN: if as < %s | opt -globaldce | dis | grep global
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
-
+; RUN: as < %s | opt -globaldce | dis | not grep global
 
 %X = uninitialized global int
 %Y = internal global int 7

llvm/test/Regression/Transforms/LICM/2003-02-27-PreheaderProblem.ll

@@ -3,10 +3,7 @@
 ; happens because preheader insertion doesn't insert a preheader for this
 ; case... bad.
 
-; RUN: if as < %s | opt -licm -adce -simplifycfg | dis | grep 'br '
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -licm -adce -simplifycfg | dis | not grep 'br '
 
 int %main(int %argc) {
         br label %bb5

llvm/test/Regression/Transforms/Mem2Reg/2003-06-26-IterativePromote.ll

@@ -1,8 +1,5 @@
 ; Promoting some values allows promotion of other values.
-; RUN: if as < %s | opt -mem2reg | dis | grep alloca
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -mem2reg | dis | not grep alloca
 
 int %test2() {
         %result = alloca int             ; ty=int*

llvm/test/Regression/Transforms/Mem2Reg/DifferingTypes.ll

@@ -2,10 +2,7 @@
 ; generated code should perform the appropriate masking operations required 
 ; depending on the endianness of the target...
 
-; RUN: if as < %s | opt -mem2reg | dis | grep 'alloca'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -mem2reg | dis | not grep 'alloca'
 
 implementation
 

llvm/test/Regression/Transforms/Mem2Reg/PromoteMemToRegister.ll

@@ -1,8 +1,5 @@
 ; Simple sanity check testcase.  Both alloca's should be eliminated.
-; RUN: if as < %s | opt -mem2reg | dis | grep 'alloca'
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -mem2reg | dis | not grep 'alloca'
 
 implementation
 

llvm/test/Regression/Transforms/PiNodeInserter/substitutetest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -pinodes -instcombine -die | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -pinodes -instcombine -die | dis | not grep add
 
 int "test"(int %i, int %j) {
 	%c = seteq int %i, 0

llvm/test/Regression/Transforms/Reassociate/2002-05-15-AgressiveSubMove.ll

@@ -1,9 +1,6 @@
-; RUN: if as < %s | opt -reassociate -instcombine -constprop -dce | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -instcombine -constprop -dce | dis | not grep add
 
-int "test"(int %A) {
+int %test(int %A) {
 	%X = add int %A, 1
 	%Y = add int %A, 1
 	%r = sub int %X, %Y

llvm/test/Regression/Transforms/Reassociate/2002-05-15-MissedTree.ll

@@ -1,9 +1,6 @@
-; RUN: if as < %s | opt -reassociate -instcombine -constprop -die | dis | grep 5
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -instcombine -constprop -die | dis | not grep 5
 
-int "test"(int %A, int %B) {
+int %test(int %A, int %B) {
         %W = add int %B, -5
         %Y = add int %A, 5
         %Z = add int %W, %Y

llvm/test/Regression/Transforms/Reassociate/2002-05-15-SubReassociate.ll

@@ -1,11 +1,8 @@
 ; With sub reassociation, constant folding can eliminate all of the constants.
 ;
-; RUN: if as < %s | opt -reassociate -constprop -instcombine -dce | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -instcombine -dce | dis | not grep add
 
-int "test"(int %A, int %B) {
+int %test(int %A, int %B) {
 	%W = add int 5, %B
 	%X = add int -7, %A
 	%Y = sub int %X, %W

llvm/test/Regression/Transforms/Reassociate/2002-05-15-SubReassociate2.ll

@@ -1,9 +1,6 @@
 ; With sub reassociation, constant folding can eliminate the two 12 constants.
 ;
-; RUN: if as < %s | opt -reassociate -constprop -dce | dis | grep 12
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -dce | dis | not grep 12
 
 int "test"(int %A, int %B, int %C, int %D) {
 	%M = add int %A, 12

llvm/test/Regression/Transforms/Reassociate/basictest.ll

@@ -1,11 +1,8 @@
 ; With reassociation, constant folding can eliminate the 12 and -12 constants.
 ;
-; RUN: if as < %s | opt -reassociate -constprop -instcombine -die | dis | grep add
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -instcombine -die | dis | not grep add
 
-int "test"(int %arg) {
+int %test(int %arg) {
 	%tmp1 = sub int -12, %arg
 	%tmp2 = add int %tmp1, 12
 	ret int %tmp2

llvm/test/Regression/Transforms/Reassociate/basictest2.ll

@@ -1,9 +1,6 @@
 ; With reassociation, constant folding can eliminate the +/- 30 constants.
 ;
-; RUN: if as < %s | opt -reassociate -constprop -instcombine -die | dis | grep 30
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -instcombine -die | dis | not grep 30
 
 int "test"(int %reg109, int %reg1111) {
         %reg115 = add int %reg109, -30           ; <int> [#uses=1]

llvm/test/Regression/Transforms/Reassociate/looptest.ll

@@ -12,10 +12,7 @@
 ; In this case, we want to reassociate the specified expr so that i+j can be
 ; hoisted out of the inner most loop.
 ;
-; RUN: if as < %s | opt -reassociate | dis | grep 115 | grep 117
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate | dis | grep 115 | not grep 117
 
 %.LC0 = internal global [4 x sbyte] c"%d\0A\00"		; <[4 x sbyte]*> [#uses=1]
 

llvm/test/Regression/Transforms/Reassociate/otherops.ll

@@ -1,9 +1,6 @@
 ; Reassociation should apply to Add, Mul, And, Or, & Xor
 ;
-; RUN: if as < %s | opt -reassociate -constprop -instcombine -die | dis | grep 12
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -instcombine -die | dis | not grep 12
 
 int "test_mul"(int %arg) {
         %tmp1 = mul int 12, %arg

llvm/test/Regression/Transforms/Reassociate/subtest.ll

@@ -1,9 +1,6 @@
 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
 ;
-; RUN: if as < %s | opt -reassociate -constprop -instcombine -die | dis | grep 12
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -reassociate -constprop -instcombine -die | dis | not grep 12
 
 int "test"(int %A, int %B) {
 	%X = add int -12, %A

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 @@ bb2:
 
 bb3:
 	ret int * %A
-end
-
+}

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
-
+}

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]
 

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!

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 @@ BB2:
 BB3:
 	%Ret = phi int [%Val, %BB1], [1, %BB2]
 	ret int %Ret
-end
+}

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 @@ BB7:
 	%j4 = phi int [1, %BB5], [%k2, %BB6]
 	%k4 = phi int [%k3, %BB5], [%k5, %BB6]
 	br label %BB2
-end
-
+}

llvm/test/Regression/Transforms/ScalarRepl/arraytest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -scalarrepl -mem2reg | dis | grep alloca
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -scalarrepl -mem2reg | dis | not grep alloca
 
 int %test() {
   %X = alloca [ 4 x int ]

llvm/test/Regression/Transforms/ScalarRepl/basictest.ll

@@ -1,7 +1,4 @@
-; RUN: if as < %s | opt -scalarrepl -mem2reg | dis | grep alloca
-; RUN: then exit 1
-; RUN: else exit 0
-; RUN: fi
+; RUN: as < %s | opt -scalarrepl -mem2reg | dis | not grep alloca
 
 int %test() {
   %X = alloca { int, float }