This is the mail archive of the
mailing list for the GCC project.
Re: Draft "Unsafe fp optimizations" project description.
- To: dewar at gnat dot com
- Subject: Re: Draft "Unsafe fp optimizations" project description.
- From: Joern Rennecke <amylaar at redhat dot com>
- Date: Mon, 6 Aug 2001 15:38:43 +0100 (BST)
- Cc: toon at moene dot indiv dot nluug dot nl, gcc at gcc dot gnu dot org, ross dot s at ihug dot co dot nz
> My real point here was not so much to get an accurate statement of how
> often this could cause trouble, but rather to avoid a statement that I
> thought was far too pessimistic and scary :-)
I think we should describe it in terms of safe value ranges. E.g. if
you use only half the exponent range (which is like having one less
exponent bits), you are safe from overflows for transformations like
a/b/c -> a/(b*c)
Of course, higher order transformations eat more exponent bits.