From 7f52921976906112e9022006a1ca47cf80b16bc6 Mon Sep 17 00:00:00 2001 From: Saleem Abdulrasool Date: Thu, 16 Oct 2014 03:27:30 +0000 Subject: 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. llvm-svn: 219899 --- llvm/test/Transforms/TailCallElim/basic.ll | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'llvm/test/Transforms/TailCallElim/basic.ll') diff --git a/llvm/test/Transforms/TailCallElim/basic.ll b/llvm/test/Transforms/TailCallElim/basic.ll index 8e9814b52bb..c7af9af5be7 100644 --- a/llvm/test/Transforms/TailCallElim/basic.ll +++ b/llvm/test/Transforms/TailCallElim/basic.ll @@ -147,7 +147,7 @@ cond_false: ; Don't tail call if a byval arg is captured. define void @test9(i32* byval %a) { ; CHECK-LABEL: define void @test9( -; CHECK: {{^ *}}call void @use( +; CHECK: {{^ *}}tail call void @use( call void @use(i32* %a) ret void } -- cgit v1.2.3