[LLVMdev] question about tail call elimination pass ..

[Chris Lattner]

On Aug 3, 2008, at 8:45 AM, kumar wrote:

> Hi,
>
> createTailCallEliminationPass() is able to turn recursive
> functions into loops when the functions are written
> in tail recursive form. However, I'm unable to get it
> to convert mutually recursive functions to run without
> a growing stack.

...

> doesn't get to run in constant stack space.
> Is that possible with llvm?
>
Sure, just run the function inliner pass first before the tail  
recursion elimination pass.

-Chris
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080803/d42fb277/attachment.html>