On Fri, Jun 03, 2005 at 05:30:51PM +0530, Dheeraj Kumar Arora wrote: > I m interseted in one of LLVM project > "Implement well-known optimizations in PIR compiler (SSA -> > register allocation)" > Can Any send me the details?
I'm not an expert with with PIR or SSA, but I'm aware of LLVM's JIT subsystem, which can manage register allocation from an SSA representation. It was previously known as Jello -- see http://llvm.cs.uiuc.edu/ProjectsWithLLVM/#jello for a 2002 paper that discusses this topic. Also maybe of interest is ANF (A-normal form), a functional-flavoured representation closely related (and indeed translatable from) SSA. Sabry, Felleisen et al gave a useful overview in "The Essence of Compiling with Continuations (Retrospective)", available at http://www.ccs.neu.edu/scheme/pubs/. A translator from SSA to ANF is given in http://www.jantar.org/papers/ssa-lambda/. I'd be very happy to work with a ANF/SSA->PIR/PASM toolkit and provide feedback from the side of a compiler writer. Thanks, /Autrijus/
pgpH2EggOGGo8.pgp
Description: PGP signature
