This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug other/32172] Behavior of -ffast-math
- From: "dominiq at lps dot ens dot fr" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 31 May 2007 21:34:37 -0000
- Subject: [Bug other/32172] Behavior of -ffast-math
- References: <bug-32172-12313@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- 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 to xlf.
> Note that we don't have infrastructure to obey paranthesis
> but only to not do re-association at all.
I am not sure to understand what you mean.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=32172