Guaranteed Optimization
Knud Sørensen
12tkvvb02 at sneakemail.com
Mon Nov 13 01:04:00 PST 2006
I think it is possible to systematic search
for cases where dmd don't make optimal code.
How this could be done is described at
http://www.oonumerics.org/lunar/
The idea is that one start with a simples program
main()
{
return(0);
}
Then one deoptimize it through one or more deoptimizing steps, example:
main()
{
int i=0;
if (false)
{
int i=10;
}
return(i)
}
At last one run the deoptimized program through the compiler and
compere the result to the result of the start program.
Now we just need someone to write a deoptimizer for D.
More information about the Digitalmars-d
mailing list