|Recursion with register optimised parameters. email@example.com (1997-09-12)|
|Re: Recursion with register optimised parameters. firstname.lastname@example.org (Jonathan Eifrig) (1997-09-15)|
|From:||email@example.com (Craig Main)|
|Date:||12 Sep 1997 21:27:48 -0400|
|Organization:||UUNET Internet Africa|
|Keywords:||code, architecture, comment|
I was wondering how languages (like Delphi) handle recursion when their
parameter passing is optimised to use the registers.
It has been bugging me for some time now. The delphi inline assembler
documentation states that under certain conditions a stack frame is not even
created for a procedure or function.
Recursive programming requires a stack albeit dependent on the type of
Could someone please explain.
My email address is firstname.lastname@example.org.
[In most compilers, leaf procedures which don't need stack variables don't
make a stack frame, other procedures all do. -John]
Return to the
Search the comp.compilers archives again.