🚀 go-pugleaf

In article <28200008@ccvaxa> aglew@ccvaxa.UUCP writes:
>Unless registers are actually only bound at link time.
>NOPping out the register save instructions would be trivial,
>and not cost too much.
>I read a paper that seemed to imply that Cray was attempting something
>similar. Has anything more come of this?
>
>Andy "Krazy" Glew. Gould CSD-Urbana.    USEnet:  ihnp4!uiucdcs!ccvaxa!aglew
>1101 E. University, Urbana, IL 61801    ARPAnet: aglew@gswd-vms.arpa

Re:  Binding/allocating registers at link time.  See a *very* good paper
by Wall in the Summer SIGPLAN conference on Compiler Construction.  This
paper describes a method to get the performance benefit of a stack-cache
style register file (e.g. Berekely register windows) from a fixed set
of registers (e.g. almost anything else).  This work was done for the DEC
Titan RISC machine with excellent results (but hey, the machine has 64
registers).

    bcase
---------
Keep watching this space!