🚀 go-pugleaf

In article <34200001@orstcs.UUCP> nathan@orstcs.UUCP (nathan) writes:
>The problem of returning structures from functions has always
>been one of where to put the structure.  It could easily go on
>stack, except that the calling routine would have to allocate
>space for it; but then if the routine was misdeclared, local
>variables of the caller could get trashed.  (In C, this was
>something to worry about.)  Steve Johnson, author of "pcc",
>"resolved" this by reserving a static structure for the
>routine, and returning a pointer to it.
>	Nathan C. Myers
>	{hplabs!hp-pcd | tektronix}!orstcs!nathan OR  nathan@oregon-state

You don't need to put the structure on the stack to get reentrancy.
Think of this return value as like a number in a register, just too
large to fit in the one or two registers normally allowed for return
values.  All you need is a virtual register: an agreed-upon place in
memory (static) which all interrupt paths are bound to save and restore
just like the real registers.  Most linkers have the ability to allocate
such a data object with the maximum size of any reference.  If the linker
will not provide the size of that object, however, you may need to create
a convention such as putting the size of the current value in another
known variable.