Path: utzoo!attcan!uunet!snorkelwacker!mit-eddie!uw-beaver!uw-june!pardo
From: pardo@cs.washington.edu (David Keppel)
Newsgroups: comp.sys.m88k
Subject: Register allocation is hard
Message-ID: <9898@june.cs.washington.edu>
Date: 21 Nov 89 07:00:00 GMT
Reply-To: pardo@june.cs.washington.edu (David Keppel)
Organization: University of Washington, Computer Science, Seattle
Lines: 11

>[All registers should be available at all points in the program
> (Wish I'd said that -- Oh, I did !-)]

A handy reminder: known methods for ``good'' register allocation are
NP-complete.  I think that they're exponential in the number of
statements that are being looked at...

	;-D on  ( `NP': means `no problem', right? )  Pardo
-- 
		    pardo@cs.washington.edu
    {rutgers,cornell,ucsd,ubc-cs,tektronix}!uw-beaver!june!pardo