Re: Detailed algorithms on inline optimization

Robert A Duff <bobduff@shell01.TheWorld.com> wrote in
> You can inline recursive calls if you limit the depth.
>
> [True. Does anyone do that, inline the first few times though and then
> punt to the normal routine? -John]


Recent versions of gcc do pretty well. Its instructive to look at what it
does for a naive fibonacci function:


unsigned fib(unsigned n) { return n < 2 ? n : fib(n-2) + fib(n-1); }


Gcc 4.3 with -O3 will turn this into a loop via tail-recursion elimination of
one of the recursive calls, and then inline the other call several times,
ending up with 8 nested loops...


         -chris

Return to the comp.compilers page.
Search the comp.compilers archives again.