Re: GNAT Optimization of Constant Expressions

[David Smith <david.smith@gmail.com>]

Thanks for the interesting discussion.  I always learn so much on this
group.

> Can you please post your C equivalent.

Of course:

#include <stdio.h>
#include <math.h>

int
main()
{
   const int N = 10000;
   int i, j;
   double x[N], y[N], z[N];
   //const double sinx = sin(0.5);
   //const double siny = sin(2.0*0.5);
   //const double sinz = sin(3.0*0.5);
   //const double logx = log(0.5);
   //const double logy = log(2.0*0.5);
   //const double logz = log(3.0*0.5);
   //const double sqrtx = sqrt(0.5);
   //const double sqrty = sqrt(2.0*0.5);
   //const double sqrtz = sqrt(3.0*0.5);

   for (j=1; j<=10000; ++j)
      for (i=0; i<N; ++i)
      {
         x[i] += j + sin(0.5)/1.5 + log(0.5)/2.5 +
                 sqrt(0.5)/3.3 ;
         y[i] += j + log(2.0*0.5)/1.5 + sqrt(2.0*0.5)/2.5 +
                 sin(2.0*0.5)/3.3 ;
         z[i] += j + sqrt(3.0*0.5)/1.5 + sin(3.0*0.5)/2.5 +
                 log(3.0*0.5)/3.3 ;
      }

   printf("%g %g %g\n", x[N-1], y[N-1], z[N-1]);

   return 0;
}