Top Qs
Timeline
Chat
Perspective
Leaf subroutine
Subroutines in computer science From Wikipedia, the free encyclopedia
Remove ads
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.
Remove ads
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads