Leaf routine
A leaf subroutine is a subroutine which cannot in turn call another subroutine. Some compilers can apply special program optimizations to leaf subroutines, such as the use of link registers to avoid having to push the return address on the stack.
The term "leaf" refers to their position as leaf nodes in the call graph of the program.
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (September 2010) |
 | This computer science article is a stub. You can help Wikipedia by expanding it. |