From: | glen herrmannsfeldt <gah@ugcs.caltech.edu> |
Newsgroups: | comp.compilers |
Date: | Sat, 12 Mar 2011 01:38:43 +0000 (UTC) |
Organization: | A noiseless patient Spider |
References: | 11-03-032 11-03-034 |
Keywords: | design, optimize |
Posted-Date: | 12 Mar 2011 23:20:21 EST |
Robert A Duff <bobduff@shell01.theworld.com> wrote:
(snip)
>>...I'm thinking that at least a limited form must be
>> possible in order to do any sort of inter-procedural register
>> allocation.
> I don't see how inter-procedural register allocation is relevant.
Last I remember hearing about that was in the Cray-1 days.
The Cray machines had vector registers, which it would have
been nice to avoid saving so often.
Since Cray machines were often programmed in Fortran, in the
days before Fortran had recursion, it might not have been so hard.
I believe the idea was that the register addresses would be
resolved at link time, as is done with address relocation.
PURE helps in optimization and parallelization, but it isn't
so obvious in the case of register allocation.
-- glen
Return to the
comp.compilers page.
Search the
comp.compilers archives again.