llvm-6502/test/Transforms/Inline/byval-tail-call.ll
Saleem Abdulrasool ebe6584c32 TRE: make TRE a bit more aggressive
Make tail recursion elimination a bit more aggressive.  This allows us to get
tail recursion on functions that are just branches to a different function.  The
fact that the function takes a byval argument does not restrict it from being
optimised into just a tail call.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@219899 91177308-0d34-0410-b5e6-96231b3b80d8
2014-10-16 03:27:30 +00:00

40 lines
1.0 KiB
LLVM

; RUN: opt < %s -tailcallelim -inline -instcombine -dse -S | FileCheck %s
; PR7272
; Calls that capture byval parameters cannot be marked as tail calls. Other
; tails that don't capture byval parameters can still be tail calls.
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32-n8:16:32"
target triple = "i386-pc-linux-gnu"
declare void @ext(i32*)
define void @bar(i32* byval %x) {
call void @ext(i32* %x)
ret void
}
define void @foo(i32* %x) {
; CHECK-LABEL: define void @foo(
; CHECK: llvm.lifetime.start
; CHECK: store i32 %2, i32* %x
call void @bar(i32* byval %x)
ret void
}
define internal void @qux(i32* byval %x) {
call void @ext(i32* %x)
tail call void @ext(i32* null)
ret void
}
define void @frob(i32* %x) {
; CHECK-LABEL: define void @frob(
; CHECK: alloca i32
; CHECK: {{^ *}}tail call void @ext(
; CHECK: tail call void @ext(i32* null)
; CHECK: ret void
tail call void @qux(i32* byval %x)
ret void
}