Re: Inlining functions with loops

John Levine writes:
> [It's pretty common to optimize out tail recursion, but I'd be quite surprised
> if anyone tried to optimize a bushy recursion like this one. -John]


Some compilers will inline small recursive functions to eight or ten levels.
For example, the function move_tower() in the hanoi benchmark looks like:


move_tower();
move_disk();
move_tower();


Compilers that perform both tail recursion and "bushy" inlining get about
10% better performance than compilers that only perform tail recursion, and
get significantly better performance than compilers that don't perform either.


Of course, the increase in code size for that region is significant, and is
not practical in some situations.


Regards,
Christopher Glaeser
Nullstone Corporation
--

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