Polyhedron tests on Intel Darwin8/9

[Andrew Pinski]

On 11/23/07, Dominique Dhumieres <dominiq@lps.ens.fr> wrote:
> with a fmadds corresponding to 's = s + a1*b1'.
> So even at -O3 the gcc optimizer is unable to see that
> a1*b1 is always zero, even if b1 is a constant (in this case
> a "perfectly" optimized code would reduce to
>
> print *, 0.0
>
> and this is not the case.

Most likely because GCC does not do VRP for floating point values.
a*0.0 still takes the sign of a so the result is not always 0 but can
also be -0.0.  Likewise for 0.0 + b.


Thanks,
Andrew Pinski