RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-25 12:50:00 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Whoops, forgot to check this in. :)

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10334 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-12-08 23:41:09 +00:00
parent cf2f89251d
commit 6c3a21a368
1 changed files with 22 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
test/Transforms/TailCallElim/accum_recursion_constant_arg.ll Normal file
View File

@ -0,0 +1,22 @@
; This is a more aggressive form of accumulator recursion insertion, which
; requires noticing that X doesn't change as we perform the tailcall. Thanks
; go out to the anonymous users of the demo script for "suggesting"
; optimizations that should be done. :)
; RUN: llvm-as < %s | opt -tailcallelim | llvm-dis | not grep call
int %mul(int %x, int %y) {
entry:
%tmp.1 = seteq int %y, 0
br bool %tmp.1, label %return, label %endif
endif:
%tmp.8 = add int %y, -1
%tmp.5 = call int %mul( int %x, int %tmp.8 )
%tmp.9 = add int %tmp.5, %x
ret int %tmp.9
return:
ret int %x
}