6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-13 09:33:50 +00:00
Code Issues Projects Releases Wiki Activity

merge two tests and convert to filecheck.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@112613 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-08-31 18:05:08 +00:00
parent 421cc4c999
commit f88776c363
2 changed files with 28 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,15 +1,40 @@
; RUN: opt < %s -tailcallelim -S | not grep call
; RUN: opt < %s -tailcallelim -S | FileCheck %s
define i32 @factorial(i32 %x) {
define i32 @test1_factorial(i32 %x) {
entry:
%tmp.1 = icmp sgt i32 %x, 0 ; <i1> [#uses=1]
br i1 %tmp.1, label %then, label %else
then: ; preds = %entry
%tmp.6 = add i32 %x, -1 ; <i32> [#uses=1]
%tmp.4 = call i32 @factorial( i32 %tmp.6 ) ; <i32> [#uses=1]
%tmp.4 = call i32 @test1_factorial( i32 %tmp.6 ) ; <i32> [#uses=1]
%tmp.7 = mul i32 %tmp.4, %x ; <i32> [#uses=1]
ret i32 %tmp.7
else: ; preds = %entry
ret i32 1
}
; CHECK: define i32 @test1_factorial
; CHECK: phi i32
; CHECK-NOT: call i32
; CHECK: else:
; This is a more aggressive form of accumulator recursion insertion, which
; requires noticing that X doesn't change as we perform the tailcall.
define i32 @test2_mul(i32 %x, i32 %y) {
entry:
%tmp.1 = icmp eq i32 %y, 0 ; <i1> [#uses=1]
br i1 %tmp.1, label %return, label %endif
endif: ; preds = %entry
%tmp.8 = add i32 %y, -1 ; <i32> [#uses=1]
%tmp.5 = call i32 @test2_mul( i32 %x, i32 %tmp.8 ) ; <i32> [#uses=1]
%tmp.9 = add i32 %tmp.5, %x ; <i32> [#uses=1]
ret i32 %tmp.9
return: ; preds = %entry
ret i32 %x
}
; CHECK: define i32 @test2_mul
; CHECK: phi i32
; CHECK-NOT: call i32
; CHECK: return:

20
test/Transforms/TailCallElim/accum_recursion_constant_arg.ll
View File

@ -1,20 +0,0 @@
; 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: opt < %s -tailcallelim -S | not grep call
define i32 @mul(i32 %x, i32 %y) {
entry:
%tmp.1 = icmp eq i32 %y, 0 ; <i1> [#uses=1]
br i1 %tmp.1, label %return, label %endif
endif: ; preds = %entry
%tmp.8 = add i32 %y, -1 ; <i32> [#uses=1]
%tmp.5 = call i32 @mul( i32 %x, i32 %tmp.8 ) ; <i32> [#uses=1]
%tmp.9 = add i32 %tmp.5, %x ; <i32> [#uses=1]
ret i32 %tmp.9
return: ; preds = %entry
ret i32 %x
}