|gardens point / lcc hybrid available firstname.lastname@example.org (Prof John Gough) (1997-11-07)|
|From:||Prof John Gough <email@example.com>|
|Date:||7 Nov 1997 00:46:36 -0500|
|Keywords:||C, lcc, analysis|
"gardens point C" is a hybrid of lcc and the gardens point backends.
A tree-walker traverses lcc's data structures emitting the "DCode" IR as
used by the gardens point compilers. This is a abstract stack machine form
similar to UCODE.
The dgen backends which are being made available are for Intel-386, and
use bottom up tree rewriting, SSA global common subexpression elimination
and graph coloring register allocators. We may make the SPARC and other
backends available later.
Here is what you get---
ftp.fit.qut.edu.au in directory /pub/gpc
gpc.README more description
gpc.tar.gz v3.4 sources + modified files config.h, gen.c
gzip binaries for our backends for intel/386
for: FreeBSD, Linux/a.out, Linux/ELF, Cygnus/Win32
dcode320.ps.gz latest reference document for the IR used (for
those who are interested in how it all works)
The readme talks more about the backends, and includes some SPECINT92
figures for FreeBSD. Anyone out there that uses our Modula2 or Oberon2
compilers still needs to download dgen, since these dgen versions have
been modified to make them work with the irreducible flowgraphs which
programs with goto's can create.
K John Gough Internet: firstname.lastname@example.org
Dean of Information Technology VOX: +61 7 3864-2781
Queensland University of Tech. Fax: +61 7 3864-1507
Automata _--_|\ Faculty of Information Technology
rules OK / QUT Queensland University of Technology
\_.--._/ Box 2434 Brisbane 4001 AUSTRALIA
v Phone: +61 7 3864-2111
Return to the
Search the comp.compilers archives again.