burkhard@software.org (Neil Burkhard) (11/14/90)
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?
Neil Burkhard
Software Productivity Consortium
2214 Rock Hill Road
Herndon, VA 22070
e-mail: burkhard@software.org
--
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!esegue!compilers. Meta-mail to compilers-request.mike@vlsivie.tuwien.ac.at (Michael K. Gschwind) (11/16/90)
In article <m0iZO6T-46Nli6C@olive.software.org> burkhard@software.org (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 ftp archive. 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. bye, mike Michael K. Gschwind, Institute for VLSI-Design, Vienna University of Technology mike@vlsivie.tuwien.ac.at mike@vlsivie.uucp e182202@awituw01.bitnet Voice: (++43).1.58801 8144 Fax: (++43).1.569697 -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.