Use the llvm-upgrade program to upgrade llvm assembly.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@32115 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Reid Spencer
2006-12-02 04:23:10 +00:00
parent a50d5962ed
commit 69ccadd753
1199 changed files with 1680 additions and 1674 deletions
@@ -1,7 +1,7 @@
; This testcase exposed a problem with the loop identification pass (LoopInfo).
; Basically, it was incorrectly calculating the loop nesting information.
;
; RUN: llvm-as < %s | opt -loopsimplify
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify
implementation ; Functions:
@@ -2,7 +2,7 @@
; inserted for the "fail" loop, but the exit block of a loop is not updated
; to be the preheader instead of the exit loop itself.
; RUN: llvm-as < %s | opt -loopsimplify
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify
int %re_match_2() {
br label %loopentry.1
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -tailduplicate -instcombine -simplifycfg -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -tailduplicate -instcombine -simplifycfg -licm -disable-output
target endian = little
target pointersize = 32
@@ -4,7 +4,7 @@
;
; This is distilled from a monsterous crafty example.
; RUN: llvm-as < %s | opt -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -licm -disable-output
%G = weak global int 0 ; <int*> [#uses=13]
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify -verify -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify -verify -licm -disable-output
implementation ; Functions:
void %.subst_48() {
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify -licm -disable-output
void %main() {
entry:
br bool false, label %Out, label %loop
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify -licm -disable-output
; This is PR306
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify -disable-output
implementation
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -scalarrepl -loopsimplify -licm -disable-output
; RUN: llvm-upgrade < %s | llvm-as | opt -scalarrepl -loopsimplify -licm -disable-output
implementation ; Functions:
+1 -1
View File
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify
implementation
+1 -1
View File
@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loopsimplify
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify
void %foo(bool %C) {
br bool %C, label %T, label %F
@@ -1,5 +1,5 @@
; Loop Simplify should turn phi nodes like X = phi [X, Y] into just Y, eliminating them.
; RUN: llvm-as < %s | opt -loopsimplify | llvm-dis | grep phi | wc -l | grep 6
; RUN: llvm-upgrade < %s | llvm-as | opt -loopsimplify | llvm-dis | grep phi | wc -l | grep 6
%A = weak global [3000000 x int] zeroinitializer ; <[3000000 x int]*> [#uses=1]
%B = weak global [20000 x int] zeroinitializer ; <[20000 x int]*> [#uses=1]
@@ -2,7 +2,7 @@
; for all loops. This allows the -indvars pass to recognize the %IV
; induction variable in this testcase.
; RUN: llvm-as < %s | opt -indvars | llvm-dis | grep indvar
; RUN: llvm-upgrade < %s | llvm-as | opt -indvars | llvm-dis | grep indvar
int %test(bool %C) {
br label %Loop