tail call optimization


Also found in: Acronyms.

tail call optimization

References in periodicals archive ?
At the level of executable code, this assumption can be violated in two ways.(2) The first involves escaping branches--ordinary (i.e., non-function-call) jumps from one function into another--that arise either due to tail call optimization, or because of code sharing in hand-written assembly code (such as is found in, for example, some numerical libraries).
bsr fl, Restore /* call function that restores registers */ sp = sp + k /* deallocate stack frame */ ret (ra) /* return */ If we could somehow move the instruction for deallocating the stack frame into the function that restores saved registers, there would be no need to return to the function f whose epilog we are abstracting: control could return directly to f's caller (in effect realizing tail call optimization).