|Looking for the name of an optimization email@example.com (Chris Cox) (2008-03-31)|
|Re: Looking for the name of an optimization firstname.lastname@example.org (Diego Novillo) (2008-03-31)|
|Re: Looking for the name of an optimization cfc@shell01.TheWorld.com (Chris F Clark) (2008-04-02)|
|Re: Looking for the name of an optimization email@example.com (2008-04-13)|
|Date:||Sun, 13 Apr 2008 11:14:00 -0700 (PDT)|
|References:||08-03-123 08-03-124 08-04-010|
|Posted-Date:||13 Apr 2008 22:25:55 EDT|
In Elbrus2000 compiler (Elbrus2000 is a VLIW processor that was
developed by Elbrus company, now bought by Intel) we did this
1. Value Numbering (which we treated as analysis, not optimization)
that does constant folding on the fly and sets constant class of
congruency for "x + y" operation
2. Any kind of optimization that uses help of classes of congruences
(constant substitution, peephole... you name it).
Return to the
Search the comp.compilers archives again.