Renamed as' => llvm-as', dis' => llvm-dis', link' => llvm-link'.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8558 91177308-0d34-0410-b5e6-96231b3b80d8

test/Transforms/SCCP/2002-05-02-EdgeFailure.ll

@@ -5,7 +5,7 @@
 ; real benchmark (mst from Olden benchmark, MakeGraph function).  When SCCP is
 ; fixed, this should be eliminated by a single SCCP application.
 ;
-; RUN: as < %s | opt -sccp | dis | not grep loop
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | not grep loop
 
 int* %test() {
 bb1:

test/Transforms/SCCP/2002-05-02-MissSecondInst.ll

@@ -1,4 +1,4 @@
-; RUN: as < %s | opt -sccp | dis | not grep sub
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | not grep sub
 
 void %test3(int, int) {
 	add int 0, 0

test/Transforms/SCCP/2002-05-20-MissedIncomingValue.ll

@@ -1,7 +1,7 @@
 ; This test shows a case where SCCP is incorrectly eliminating the PHI node
 ; because it thinks it has a constant 0 value, when it really doesn't.
 
-; RUN: as < %s | opt -sccp | dis | grep phi
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | grep phi
 
 int "test"(int %A, bool %c) {
 bb1:

test/Transforms/SCCP/2002-05-21-InvalidSimplify.ll

@@ -2,7 +2,7 @@
 ; this is in fact NOT the case, so the return should still be alive in the code
 ; after sccp and CFG simplification have been performed.
 ;
-; RUN: as < %s | opt -sccp -simplifycfg | dis | grep ret
+; RUN: llvm-as < %s | opt -sccp -simplifycfg | llvm-dis | grep ret
 
 
 void "old_main"() {

test/Transforms/SCCP/2002-08-30-GetElementPtrTest.ll

@@ -1,4 +1,4 @@
-; RUN: as < %s | opt -sccp | dis | not grep '%X'
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | not grep '%X'
 
 %G = uninitialized global [40x int]
 

test/Transforms/SCCP/2003-06-24-OverdefinedPHIValue.ll

@@ -1,4 +1,4 @@
-; RUN: as < %s | opt -sccp -simplifycfg | dis | not grep then:
+; RUN: llvm-as < %s | opt -sccp -simplifycfg | llvm-dis | not grep then:
 
 void %cprop_test11(int* %data.1) {
 entry:		; No predecessors!

test/Transforms/SCCP/2003-08-26-InvokeHandling.ll

@@ -1,5 +1,5 @@
 ; The PHI cannot be eliminated from this testcase, SCCP is mishandling invoke's!
-; RUN: as < %s | opt -sccp | dis | grep phi
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | grep phi
 
 declare void %foo()
 int %test(bool %cond) {

test/Transforms/SCCP/basictest.ll

@@ -1,7 +1,7 @@
 ; This is a basic sanity check for constant propogation.  The add instruction 
 ; should be eliminated.
 
-; RUN: as < %s | opt -sccp | dis | not grep add
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | not grep add
 
 int %test(bool %B) {
 	br bool %B, label %BB1, label %BB2

test/Transforms/SCCP/sccptest.ll

@@ -1,7 +1,7 @@
 ; 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: as < %s | opt -sccp -constprop -dce -cfgsimplify | dis | not grep BB3
+; RUN: llvm-as < %s | opt -sccp -constprop -dce -cfgsimplify | llvm-dis | not grep BB3
 
 int %test function(int %i0, int %j0) {
 BB1: