Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Multiply by a constant --> shift-and-adds algorithm? Vincent.Lefevre@ens-lyon.fr (Vincent Lefevre) (1997-11-07) |
| Re: Multiply by a constant --> shift-and-adds algorithm? cdg@nullstone.com (Christopher Glaeser) (1997-11-13) |
| Re: Multiply by a constant --> shift-and-adds algorithm? ssolyanik@icdc.com (Sergey Solyanik) (1997-11-14) |
| Re: Multiply by a constant --> shift-and-adds algorithm? cdg@nullstone.com (Christopher Glaeser) (1997-11-18) |
| const_int * (int / const_int) by shift adds? cef@geodesic.com (Charles Fiterman) (1997-11-20) |
| Re: const_int * (int / const_int) by shift adds? Robert.Harley@inria.fr (1997-11-23) |
| From: | Charles Fiterman <cef@geodesic.com> |
| Newsgroups: | comp.compilers |
| Date: | 20 Nov 1997 22:35:52 -0500 |
| Organization: | Geodesic Systems |
| References: | 97-11-038 97-11-078 97-11-086 97-11-104 |
| Keywords: | question, optimize |
I need pointers to super compiler info. A super compiler is a
compiler that produces truly optimal code for very simple constructs
like 5 * (i / 5).
In fact I have a very hot piece of code, the scan loop of a
conservative collector that would justify a year of supercompiler time
... easy. And a key part is given a pointer into a page of same sized
objects which object is it pointing at.
[I believe they're more commonly called superoptimizers, and the few that I've
heard of worked by exhaustively enumerating possible code sequences and doing
symbolic execution to see if they got the right answer. -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.