Register Allocation

Ashish Ashtekar <ashish@usl.edu>
2 Apr 1996 23:45:53 -0500

          From comp.compilers
Related articles
[28 earlier articles]
Re: Register Allocation wendyt@cs.washington.edu (1990-02-26)
Re: Register Allocation Moss@cs.umass.edu (1990-02-25)
Re: Register Allocation dds@cc.ic.ac.uk (1990-02-27)
Register Allocation nandu@jupiter.cs.clemson.edu (1993-03-31)
Register Allocation rajiv@polya.ece.wisc.edu (1993-08-31)
Re: Register Allocation preston@dawn.cs.rice.edu (1993-09-06)
Register Allocation ashish@usl.edu (Ashish Ashtekar) (1996-04-02)
| List of all articles for this month |
From: Ashish Ashtekar <ashish@usl.edu>
Newsgroups: comp.compilers
Date: 2 Apr 1996 23:45:53 -0500
Organization: Center for Advanced Computer Studies
Keywords: registers, optimize, comment

I am writing the rear end of a compiler. I am looking for a effective
and easy register allocation strategy. My IR is in the form of
tuples. Specifically, I am looking for a register alloc strategy which
does not use "costing" (as some books suggest). Right now I am using a
ad hoc strategy, but I am not sure whether it's going to work.


- Ashish.
--
*********************************************************************
Ashish Ashtekar


email :- WWW :-
----- ---
1. ashish@usl.edu http ://www.cacs.usl.edu/~aaa7468
2. aaa7468@cacs.usl.edu
[The traditional approach is to treat the registers as a stack, which doesn't
generate fabulous code but is pretty easy. -John]
--

Post a followup to this message

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