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 -reassociate -instcombine -constprop -dce | dis | not grep add
; RUN: llvm-as < %s | opt -reassociate -instcombine -constprop -dce | llvm-dis | not grep add
int %test(int %A) {
%X = add int %A, 1

View File

@@ -1,4 +1,4 @@
; RUN: as < %s | opt -reassociate -instcombine -constprop -die | dis | not grep 5
; RUN: llvm-as < %s | opt -reassociate -instcombine -constprop -die | llvm-dis | not grep 5
int %test(int %A, int %B) {
%W = add int %B, -5

View File

@@ -1,6 +1,6 @@
; With sub reassociation, constant folding can eliminate all of the constants.
;
; RUN: as < %s | opt -reassociate -constprop -instcombine -dce | dis | not grep add
; RUN: llvm-as < %s | opt -reassociate -constprop -instcombine -dce | llvm-dis | not grep add
int %test(int %A, int %B) {
%W = add int 5, %B

View File

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

View File

@@ -1,6 +1,6 @@
; The reassociate pass is not preserving dominance properties correctly
;
; RUN: as < %s | opt -reassociate
; RUN: llvm-as < %s | opt -reassociate
int %compute_dist(int %i, int %j) {
%reg119 = sub int %j, %i

View File

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

View File

@@ -1,6 +1,6 @@
; With reassociation, constant folding can eliminate the 12 and -12 constants.
;
; RUN: as < %s | opt -reassociate -constprop -instcombine -die | dis | not grep add
; RUN: llvm-as < %s | opt -reassociate -constprop -instcombine -die | llvm-dis | not grep add
int %test(int %arg) {
%tmp1 = sub int -12, %arg

View File

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

View File

@@ -12,7 +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: as < %s | opt -reassociate | dis | grep 115 | not grep 117
; RUN: llvm-as < %s | opt -reassociate | llvm-dis | grep 115 | not grep 117
%.LC0 = internal global [4 x sbyte] c"%d\0A\00" ; <[4 x sbyte]*> [#uses=1]

View File

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

View File

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