Beefy Boxes and Bandwidth Generously Provided by pair Networks Joe
We don't bite newbies here... much

Re^2: Exploring IEEE754 floating point bit patterns.

by BrowserUk (Pope)
on Jul 29, 2012 at 06:46 UTC ( #984270=note: print w/ replies, xml ) Need Help??

in reply to Re: Exploring IEEE754 floating point bit patterns.
in thread Exploring IEEE754 floating point bit patterns.

Actually, make that 10 separate symbols, as the 5 nan symbols that appear in the output of BrowserUk's qnan.c, under some circumstances, will be suffixed with '0' ('00' in the case of -1.#IND).I wonder why so many symbols are needed ?

The suffixing of zeros to the symbols is just an artifact of using "%f" printf format, which implicitly is equivalent to "%.6f" and therefore requires that the fractional part be padded with trailing zeros to 6 places.

If you adjust the template, you can see this. (The printf from your code above + output):

printf("%f %f\n", inf / inf, -(inf / inf)); // -1.#IND00 -1. +#IND00 printf("%.4f %.4f\n", inf / inf, -(inf / inf)); // -1.#IND -1.#I +ND printf("%.10f %.10f\n", inf / inf, -(inf / inf)); // -1.#IND000000 + -1.#IND000000

I've found %g more useful:

printf("%g %g\n", inf / inf, -(inf / inf)); // -1.#IND -1.#IN +D
It's also interesting that,of my Microsoft compilers (6.0, 7.0 and 8.0), none of them produce the same output as BrowserUk's 9.0 compiler.

The changes are (roughly) in line with the timing of the compiler releases relative to the requirements of the various ANSI C standards C89/C90/C99/C11; and as affected by the updates to the IEEE754 (1987) standard and its revision in 2004. (Roughly:)

For that program, my 8.0 MS compiler outputs: -1.#IND00 -1.#IND00 but my gcc-4.5.2 produces: -1.#IND00 1.#QNAN0 Which one is doing it correctly ?

You'll hate this answer. Effectively, they both are!.

The problem is, the computer scientists and the mathematicians can't agree on a single Function definition with respect to FP math.

The problem is two-fold:

  1. FP math isn't like real math (Real in the mathematical sense).

    Eg. FP is not always associative:

    print +( 10.0**20 + 1 ) - 10.0**20;; 0 print +( 10.0**20 - 10.0**20 ) + 1;; 1
  2. Mathematicians have conventions for the results of some operations that don't quite work arithmetically.

    Eg. infinity**0 == 1!

    These allow their operations on the continuous Real domain to avoid singularity points

You pays your money and makes your choice.

What operations will result in a signalling nan ?

From what I've been able to discover, none of them! (At least as far as MSC v9 is concerned.)

The problem here is that the IEEE-754 allows for traps, but doesn't require them. See Signaling NaNs

My take on what I see coming out of my attempts to produce NaNs with MSC(v9), is that they settled on using -1.#IND as the result of any math operation that is (for want of a better phrase) 'not well defined'. eg. sqrt( -1 ), 0/0; fmod( 1, 0 ) etc.

In the absence of evidence, opinion is indistinguishable from prejudice.

The start of some sanity?

Comment on Re^2: Exploring IEEE754 floating point bit patterns.
Select or Download Code
Re^3: Exploring IEEE754 floating point bit patterns.
by syphilis (Canon) on Jul 30, 2012 at 00:20 UTC
    BrowserUk, many thanks for this thread.
    I'm currently trying to make sense of what happens wrt a PDL test script (t/pdl_from_string.t) on MS Windows, and this has helped enormously.

    I now have a clear view of what needs to be done.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://984270]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
As of 2013-12-20 16:43 GMT
Find Nodes?
    Voting Booth?

    How do you parse XML?

    Results (430 votes), past polls