RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-01-31 17:42:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

move these xfailed tests to lib/Target/README.txt

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36805 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-05-05 22:28:33 +00:00
parent 514630f41f
commit 581f84f4cb
2 changed files with 0 additions and 97 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

66
test/Transforms/Reassociate/backwards.ll
View File

@ -1,66 +0,0 @@
; RUN: llvm-as < %s | opt -reassociate -dce -gcse | llvm-dis | grep add | wc -l | grep 8
; This test corresponds to GCC PR16157. Reassociate should arrange for 4 additions to be
; left in each function.
; We currently don't implement this. This would require looking globally to
; find out which expressions are available, which we currently do not do.
; XFAIL: *
%a4 = external global int
%a3 = external global int
%a2 = external global int
%a1 = external global int
%a0 = external global int
%b4 = external global int
%b3 = external global int
%b2 = external global int
%b1 = external global int
implementation ; Functions:
void %test1() {
%tmp.0 = load int* %a4 ; <int> [#uses=1]
%tmp.1 = load int* %a3 ; <int> [#uses=2]
%tmp.2 = add int %tmp.0, %tmp.1 ; <int> [#uses=1]
%tmp.3 = load int* %a2 ; <int> [#uses=3]
%tmp.4 = add int %tmp.2, %tmp.3 ; <int> [#uses=1]
%tmp.5 = load int* %a1 ; <int> [#uses=4]
%tmp.6 = add int %tmp.4, %tmp.5 ; <int> [#uses=1]
%tmp.7 = load int* %a0 ; <int> [#uses=4]
%tmp.8 = add int %tmp.6, %tmp.7 ; <int> [#uses=1]
store int %tmp.8, int* %a4
%tmp.11 = add int %tmp.1, %tmp.3 ; <int> [#uses=1]
%tmp.13 = add int %tmp.11, %tmp.5 ; <int> [#uses=1]
%tmp.15 = add int %tmp.13, %tmp.7 ; <int> [#uses=1]
store int %tmp.15, int* %a3
%tmp.18 = add int %tmp.3, %tmp.5 ; <int> [#uses=1]
%tmp.20 = add int %tmp.18, %tmp.7 ; <int> [#uses=1]
store int %tmp.20, int* %a2
%tmp.23 = add int %tmp.5, %tmp.7 ; <int> [#uses=1]
store int %tmp.23, int* %a1
ret void
}
void %test2() {
%tmp.0 = load int* %a4 ; <int> [#uses=1]
%tmp.1 = load int* %a3 ; <int> [#uses=2]
%tmp.2 = add int %tmp.0, %tmp.1 ; <int> [#uses=1]
%tmp.3 = load int* %a2 ; <int> [#uses=3]
%tmp.4 = add int %tmp.2, %tmp.3 ; <int> [#uses=1]
%tmp.5 = load int* %a1 ; <int> [#uses=4]
%tmp.6 = add int %tmp.4, %tmp.5 ; <int> [#uses=1]
%tmp.7 = load int* %a0 ; <int> [#uses=4]
%tmp.8 = add int %tmp.6, %tmp.7 ; <int> [#uses=1]
store int %tmp.8, int* %b4
%tmp.11 = add int %tmp.1, %tmp.3 ; <int> [#uses=1]
%tmp.13 = add int %tmp.11, %tmp.5 ; <int> [#uses=1]
%tmp.15 = add int %tmp.13, %tmp.7 ; <int> [#uses=1]
store int %tmp.15, int* %b3
%tmp.18 = add int %tmp.3, %tmp.5 ; <int> [#uses=1]
%tmp.20 = add int %tmp.18, %tmp.7 ; <int> [#uses=1]
store int %tmp.20, int* %b2
%tmp.23 = add int %tmp.5, %tmp.7 ; <int> [#uses=1]
store int %tmp.23, int* %b1
ret void
}

31
test/Transforms/TailCallElim/tail_call_with_branch.ll
View File

@ -1,31 +0,0 @@
; This testcase is due to tail-duplication not wanting to copy the return
; instruction into the terminating blocks because there was other code
; optimized out of the function after the taildup happened.
; XFAIL: *
; RUN: llvm-upgrade < %s | llvm-as | opt -tailcallelim | llvm-dis | not grep call
int %t4(int %a) {
entry:
%tmp.1 = and int %a, 1
%tmp.2 = cast int %tmp.1 to bool
br bool %tmp.2, label %then.0, label %else.0
then.0:
%tmp.5 = add int %a, -1
%tmp.3 = call int %t4( int %tmp.5 )
br label %return
else.0:
%tmp.7 = setne int %a, 0
br bool %tmp.7, label %then.1, label %return
then.1:
%tmp.11 = add int %a, -2
%tmp.9 = call int %t4( int %tmp.11 )
br label %return
return:
%result.0 = phi int [ 0, %else.0 ], [ %tmp.3, %then.0 ], [ %tmp.9, %then.1 ]
ret int %result.0
}