Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!elroy.jpl.nasa.gov!decwrl!world!iecc!compilers-sender
From: johnsson@cs.chalmers.se (Thomas Johnsson)
Newsgroups: comp.compilers
Subject: A question about subsumption in register allocators
Keywords: optimize, registers question
Message-ID: <9104081234.AA00418@birk.cs.chalmers.se>
Date: 8 Apr 91 12:34:39 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: Thomas Johnsson <johnsson@cs.chalmers.se>
Organization: Compilers Central
Lines: 30
Approved: compilers@iecc.cambridge.ma.us

A have a question about the use of register subsumtion in practical
graph coloring register allocators.

Before the actual coloring, subsumption is normally done, to remove
unnecessary copy operations, and to make the graph to be coloured
smaller.

No 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?

	{ define a }
	if ... then
		x := a
		 ...
	else
		y := a
		 ...
	fi
	{ use x, y }

Assuming there is no conflict between x and a, or y and a, but there
is a conflict between x and y, then we have a choice in merging either x
and a, or y and a.
So how do register allocators out there make the choice?

-- Thomas Johnsson
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.