--- Comment #5 from eres at il dot ibm dot com 2007-06-01 06:24 ---
(In reply to comment #3)
> > *** This bug has been marked as a duplicate of 28684 ***
> Related, but a different issue.
I Agree. Bug 28684 mainly deals with the need to redefine
-funsafe-math-optimizations as IEEE com
--- Comment #4 from dominiq at lps dot ens dot fr 2007-05-31 21:34 ---
> Note we do expand anint in this optimal way already (for x86 and SSE math).
I forgot to mention PPC (see comment #3) for which the implementation of
anint(x) and friends (mod(x), modulo(x)) are quite bad compared
--- Comment #3 from dominiq at lps dot ens dot fr 2007-05-31 21:31 ---
> This behavior with -ffast-math is expected and is hoped for.
Yes indeed: I said I would like to see it at some level of -On.
> That is PR 323.
If I understood correctly the PR, it deals with side effects to do th
--- Comment #2 from rguenth at gcc dot gnu dot org 2007-05-31 21:18 ---
Note we do expand anint in this optimal way already (for x86 and SSE math).
Note
that we don't have infrastructure to obey paranthesis but only to not do
re-association at all.
--
http://gcc.gnu.org/bugzilla/sh
--- Comment #1 from pinskia at gcc dot gnu dot org 2007-05-31 20:55 ---
This behavior with -ffast-math is expected and is hoped for.
>'a' and 'b' are not equal, but differ only by the round-off error.
That is PR 323.
*** This bug has been marked as a duplicate of 28684 ***
--
pinsk
