[PATCH][BZ #3268] Additional fma tests
Steven Munroe
munroesj@us.ibm.com
Tue Apr 3 19:53:00 GMT 2007
Previous soft-fp work exposed a general lack of correct Fused Multiply Add (fma) implemetations for platforms that don't implement fma in hardware (soft-fp or hard-fp that doesn't implement fma).
This patch updates libm-test.inc to actually test for the full percision of fma. IEEE-754r states:
2 Definitions
"fused multiply-add: The operation fma(x,y,z) computes (x � )+z as if with unbounded range and precision, rounding only once to the destination format; see subclause 5.1. "
5.1 Arithmetic
"The operation fma(x,y,z) computes (x�)+z as if with unbounded range and precision, rounding only once to the destination format. No underflow, overflow, or inexact exception (subclause 7) can arise due to the multiply, but only due to the add; and so fused multiply-add differs from a multiply operation followed by an add operation."
This patch has been updated and verified on powerpc32 with todays CVS.
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: soft-fp-fma-test-20070320.txt
URL: <http://sourceware.org/pipermail/libc-alpha/attachments/20070403/3a8faca7/attachment.txt>
More information about the Libc-alpha
mailing list