Re: A question about subsumption in register allocators

preston@ariel.rice.edu (Preston Briggs)
Fri, 12 Apr 91 19:03:07 GMT

          From comp.compilers

Related articles
A question about subsumption in register allocators johnsson@cs.chalmers.se (Thomas Johnsson) (1991-04-08)
Re: A question about subsumption in register allocators preston@ariel.rice.edu (1991-04-12)
| List of all articles for this month |

Newsgroups: comp.compilers
From: preston@ariel.rice.edu (Preston Briggs)
Keywords: optimize, registers question
Organization: Rice University, Houston
References: <9104081234.AA00418@birk.cs.chalmers.se>
Date: Fri, 12 Apr 91 19:03:07 GMT

Thomas Johnsson <johnsson@cs.chalmers.se> writes:
>Before the actual coloring, subsumption is normally done, to remove
>unnecessary copy operations, and to make the graph to be coloured
>smaller.
>
>Now the question is: What do register allocators out there do if there
>is more than one way of doing the subsumption, and they are mutually
>incompatible?


One of two things:


Start at the top of the routine and head toward the bottom,
coalescing as you go.


or


Find the loop structure (need for spill costs anyway)
and examine the most deeply nested loops first.


There's very little cost difference between the two.
I don't know about the payoff.


Preston Briggs
--


Post a followup to this message

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