Re: Compiler back-ends [Q]

collberg@cs.aukuni.ac.nz (Christian Collberg)
Sun, 29 Oct 1995 20:56:04 GMT

          From comp.compilers
Related articles
Compiler back-ends [Q] Ben.Sloman@reading.ac.uk (1995-10-21)
Re: Compiler back-ends [Q] cliffc@ami.sps.mot.com (1995-10-23)
Re: Compiler back-ends [Q] pardo@cs.washington.edu (1995-10-25)
Re: Compiler back-ends [Q] jgj@ssd.hcsc.com (1995-10-27)
Re: Compiler back-ends [Q] collberg@cs.aukuni.ac.nz (1995-10-29)
Re: Compiler back-ends [Q] Martin.Jourdan@inria.fr (1995-11-03)
Re: Compiler back-ends [Q] sc@iaxp01.inf.uni-jena.de (Sebastian Schmidt) (1995-11-03)
Re: Compiler back-ends [Q] cliffc@ami.sps.mot.com (1995-11-03)
| List of all articles for this month |
Newsgroups: comp.compilers
From: collberg@cs.aukuni.ac.nz (Christian Collberg)
Keywords: code
Organization: University of Auckland
References: 95-10-099 95-10-114
Date: Sun, 29 Oct 1995 20:56:04 GMT

cliffc@ami.sps.mot.com (Cliff Click) writes:


>Note that this is a _far_ cry from having the entire backend generated
>automatically. It's just instruction selection and some peephole
>opts. Register allocation is an amazing can of worms, and I don't know
>of any machine-generated code techniques being used there.


The BEG back-end generator automatically generates a register
allocator based on a description of the register set (register
names, register classes, double registers, etc). You also get
a choice between a fast/dumb and a slow/smart allocator.


Christian
--
___________________________________________________________________________
Christian Collberg | Email: c_collberg@cs.auckland.ac.nz
Computer Science Dept | Fax: +64-9-373-7453
University of Auckland | Phone: +64-9-373-7599 x 6137
--

Post a followup to this message

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