mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
582475344b
Summary: In some specific scenarios with well understood operand bundle types (like `"deopt"`) it may be possible to go ahead and convert recursion to iteration, but TailRecursionElimination does not have that logic today so avoid doing the right thing for now. I need some input on whether `"funclet"` operand bundles should also block tail recursion elimination. If not, I'll allow TRE across calls with `"funclet"` operand bundles and add a test case. Reviewers: rnk, majnemer, nlewycky, ahatanak Subscribers: mcrosier, llvm-commits Differential Revision: https://reviews.llvm.org/D26270 llvm-svn: 286147
58 lines
1.0 KiB
LLVM
58 lines
1.0 KiB
LLVM
; RUN: opt < %s -tailcallelim -S | FileCheck %s
|
|
|
|
define i32 @f_1(i32 %x) {
|
|
; CHECK-LABEL: @f_1(
|
|
wentry:
|
|
%cond = icmp ugt i32 %x, 0
|
|
br i1 %cond, label %return, label %body
|
|
|
|
body:
|
|
; CHECK: body:
|
|
; CHECK: call i32 @f_1(i32 %y) [ "deopt"() ]
|
|
%y = add i32 %x, 1
|
|
%tmp = call i32 @f_1(i32 %y) [ "deopt"() ]
|
|
ret i32 0
|
|
|
|
return:
|
|
ret i32 1
|
|
}
|
|
|
|
define i32 @f_2(i32 %x) {
|
|
; CHECK-LABEL: @f_2
|
|
|
|
entry:
|
|
%cond = icmp ugt i32 %x, 0
|
|
br i1 %cond, label %return, label %body
|
|
|
|
body:
|
|
; CHECK: body:
|
|
; CHECK: call i32 @f_2(i32 %y) [ "unknown"() ]
|
|
%y = add i32 %x, 1
|
|
%tmp = call i32 @f_2(i32 %y) [ "unknown"() ]
|
|
ret i32 0
|
|
|
|
return:
|
|
ret i32 1
|
|
}
|
|
|
|
declare void @func()
|
|
|
|
define void @f_3(i1 %B) personality i8 42 {
|
|
; CHECK-LABEL: @f_3(
|
|
entry:
|
|
invoke void @func()
|
|
to label %exit unwind label %merge
|
|
merge:
|
|
%cs1 = catchswitch within none [label %catch] unwind to caller
|
|
|
|
catch:
|
|
; CHECK: catch:
|
|
; CHECK: call void @f_3(i1 %B) [ "funclet"(token %cp) ]
|
|
%cp = catchpad within %cs1 []
|
|
call void @f_3(i1 %B) [ "funclet"(token %cp) ]
|
|
ret void
|
|
|
|
exit:
|
|
ret void
|
|
}
|