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
This commit is contained in:
Misha Brukman
2003-09-16 15:29:54 +00:00
parent aad65f6c18
commit e78760e179
251 changed files with 251 additions and 251 deletions

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
implementation

View File

@@ -1,6 +1,6 @@
; It is illegal to remove BB1 because it will mess up the PHI node!
;
; RUN: as < %s | opt -adce | dis | grep BB1
; RUN: llvm-as < %s | opt -adce | llvm-dis | grep BB1
int "test"(bool %C, int %A, int %B) {

View File

@@ -4,7 +4,7 @@
; removed even though there were uses still around. Now the uses are filled
; in with a dummy value before the PHI is deleted.
;
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
%node_t = type { double*, %node_t*, %node_t**, double**, double*, int, int }

View File

@@ -1,6 +1,6 @@
; This testcase is a distilled form of: 2002-05-28-Crash.ll
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
float "test"(int %i) {
%F = cast int %i to float ; This BB is not dead

View File

@@ -11,7 +11,7 @@
; return !s;
;}
;
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
implementation ; Functions:

View File

@@ -3,7 +3,7 @@
; block in this function, it would work fine, but that would be the part we
; have to fix now, wouldn't it....
;
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
void %foo(sbyte* %reg5481) {
%cast611 = cast sbyte* %reg5481 to sbyte** ; <sbyte**> [#uses=1]

View File

@@ -1,6 +1,6 @@
; This testcase was extracted from the gzip SPEC benchmark
;
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
%bk = external global uint ; <uint*> [#uses=2]
%hufts = external global uint ; <uint*> [#uses=1]

View File

@@ -1,5 +1,5 @@
; Testcase reduced from 197.parser by bugpoint
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
implementation ; Functions:
void %conjunction_prune() {

View File

@@ -2,7 +2,7 @@
; entries for it's postdominator. But I think this can only happen when the
; PHI node is dead, so we just avoid patching up dead PHI nodes.
; RUN: as < %s | opt -adce
; RUN: llvm-as < %s | opt -adce
target endian = little
target pointersize = 32

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -disable-output
; RUN: llvm-as < %s | opt -adce -disable-output
%G = external global int*
implementation ; Functions:

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -disable-output
; RUN: llvm-as < %s | opt -adce -disable-output
target endian = little
target pointersize = 32

View File

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

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -disable-output
; RUN: llvm-as < %s | opt -adce -disable-output
implementation ; Functions:

View File

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

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -simplifycfg | dis
; RUN: llvm-as < %s | opt -adce -simplifycfg | llvm-dis
int "Test"(int %A, int %B) {
BB1:

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -simplifycfg | dis
; RUN: llvm-as < %s | opt -adce -simplifycfg | llvm-dis
%FILE = type { int, ubyte*, ubyte*, ubyte, ubyte, uint, uint, uint }
%spec_fd_t = type { int, int, int, ubyte* }

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -adce -simplifycfg | dis
; RUN: llvm-as < %s | opt -adce -simplifycfg | llvm-dis
%FILE = type { int, ubyte*, ubyte*, ubyte, ubyte, uint, uint, uint }
%spec_fd_t = type { int, int, int, ubyte* }