🚀 go-pugleaf

In article <1881@homxc.UUCP> dwc@homxc.UUCP writes:
>In some other article someone else writes:
>>If the routine is called many times the cost of saving and
>>restoring registers during the call and return can offset any
>>speed savings thru register usage.
>am i missing something or does the frequency of calls not matter?
I agree that the frequency shouldn't matter.  The real question would
be if any compiler is smart enough to ignore a register declaration if
the resulting code would run slower (eg. if a parameter is only accessed
once, outside of a loop, the compiler would probably be better off to
ignore a register declaration).

>do compilers take the time to keep track of which registers have
>been used and only save the 'dirty' ones or do most call and
>return mechanisms save the entire register set on the stack?
It depends on the architecture and the compiler, the three easy ways
to do it are:
	a) save all registers
	b) have the caller save only the registers it is using
	c) have the callee save only the registers it will use
pdp-11's use "a" since they only have 3 register variables anyway.  Most
68k compilers use "c" since you get about 12 register variables.  I don't
know of anyone who uses "b" but it should be about as efficient as "c".

The method used has a large effect on whether setjmp/longjmp can put the
correct values back into register variables (SYSVID says they may be
unpredictable :-(.
-- 
Jim Prescott	rochester!moscom!jgp