Re: Pitfalls in interference graph ?

On Mon, 2007-10-01 at 15:46 +0100, Jeremy Wright wrote:
> FPR vs GPR is an interesting issue. Muchnick, in "Advanced Compiler
> Design and Implementation" recommends combining FPR and GPR
> allocation. There are cases, such as copying large well aligned blocks
> of memory, where one can use an FPR or GPR. Cooper, Harvey, and
> Torczon (all from Rice, as Preston Briggs) in "How to Build an
> Interference Graph" prefer to treat them separately.


What Muchnick recommends and what Cooper et al. recommends are
solutions to two different problems. Muchnick is concerned with
whether we should allocate registers of different types separately or
at the same time. What Cooper et al. are concerned with is how we
represent the interference information in the interference graph (ie,
do we store all the interferences for all of the register/pseudo types
in one big interference graph or do we partition them into separate
interference graphs, one for each register type).


So you can still allocate FPR and GPR registers at the same time as
recommended by Muchnick while using separate interference graphs for
FPRs and GPRs as recommended by Cooper et al. On the other hand, if
you want, you can also allocate FPRs and GPRs separately while using a
combined interference graph. Both issues are just two of the
implementation details up to the compiler designer.


<disclaimer>
I'm not actually arguing for or against either Muchnick's or Cooper et al.'s
recommendations. I'm just trying to show they're not mutually exclusive.
</disclaimer>




Peter
--
Peter Bergner
Linux on Power Toolchain
IBM Linux Technology Center

Return to the comp.compilers page.
Search the comp.compilers archives again.