|RTL references wanted firstname.lastname@example.org (1990-11-15)|
|Re: RTL references wanted email@example.com (1990-11-16)|
|From:||firstname.lastname@example.org (Michael K. Gschwind)|
|Keywords:||GCC, RTL, optimize|
|Organization:||Vienna University of Technology|
|Date:||16 Nov 90 09:23:21 GMT|
In article <m0iZO6T-46Nli6C@olive.software.org> email@example.com (Neil Burkhard) writes:
>I've noticed some recent postings in comp.compilers about an RTL
>representation used by the GNU compilers. I'm interested in reading up on
>this. Is there a reference anybody can suggest?
The GNU cc manual is distributed with the source as a tex source file.
You may want to get the distribution from prep.ai.mit.edu or some other
The idea of using RTL came from the U. of Arizona Portable Optimizer,
written by Jack Davidson and Christopher Fraser. This is described in
"Register Allocation and Exhaustive Peephole Optimization",
Software Practice and Experience 14 (9), Sept. 1984, pp. 857-866
There is another paper providing a quick overview of RTL (~ 2-3 pages)
in Michael Tiemann, "The GNU instruction scheduler"
(course report from Stanford, I can't remember the number :-( )
You also may want to read what the Dragon book says about code generator
generators, there are many parallels, but where they use trees as
intermediate representation, GNU uses lists.
Michael K. Gschwind, Institute for VLSI-Design, Vienna University of Technology
Voice: (++43).1.58801 8144
Return to the
Search the comp.compilers archives again.