summaryrefslogtreecommitdiff
path: root/lib/ppc/gcc_qsub.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/ppc/gcc_qsub.c')
-rw-r--r--lib/ppc/gcc_qsub.c40
1 files changed, 21 insertions, 19 deletions
diff --git a/lib/ppc/gcc_qsub.c b/lib/ppc/gcc_qsub.c
index f77deaa4f..4f1f7ac70 100644
--- a/lib/ppc/gcc_qsub.c
+++ b/lib/ppc/gcc_qsub.c
@@ -1,9 +1,11 @@
-// This file is distributed under the University of Illinois Open Source
-// License. See LICENSE.TXT for details.
+/* This file is distributed under the University of Illinois Open Source
+ * License. See LICENSE.TXT for details.
+ */
-// long double __gcc_qsub(long double x, long double y);
-// This file implements the PowerPC 128-bit double-double add operation.
-// This implementation is shamelessly cribbed from Apple's DDRT, circa 1993(!)
+/* long double __gcc_qsub(long double x, long double y);
+ * This file implements the PowerPC 128-bit double-double add operation.
+ * This implementation is shamelessly cribbed from Apple's DDRT, circa 1993(!)
+ */
#include "DD.h"
@@ -13,33 +15,33 @@ long double __gcc_qsub(long double x, long double y)
DD dst = { .ld = x }, src = { .ld = y };
- register double A = dst.hi, a = dst.lo,
- B = -src.hi, b = -src.lo;
+ register double A = dst.s.hi, a = dst.s.lo,
+ B = -src.s.hi, b = -src.s.lo;
- // If both operands are zero:
+ /* If both operands are zero: */
if ((A == 0.0) && (B == 0.0)) {
- dst.hi = A + B;
- dst.lo = 0.0;
+ dst.s.hi = A + B;
+ dst.s.lo = 0.0;
return dst.ld;
}
- // If either operand is NaN or infinity:
+ /* If either operand is NaN or infinity: */
const doublebits abits = { .d = A };
const doublebits bbits = { .d = B };
if ((((uint32_t)(abits.x >> 32) & infinityHi) == infinityHi) ||
(((uint32_t)(bbits.x >> 32) & infinityHi) == infinityHi)) {
- dst.hi = A + B;
- dst.lo = 0.0;
+ dst.s.hi = A + B;
+ dst.s.lo = 0.0;
return dst.ld;
}
- // If the computation overflows:
- // This may be playing things a little bit fast and loose, but it will do for a start.
+ /* If the computation overflows: */
+ /* This may be playing things a little bit fast and loose, but it will do for a start. */
const double testForOverflow = A + (B + (a + b));
const doublebits testbits = { .d = testForOverflow };
if (((uint32_t)(testbits.x >> 32) & infinityHi) == infinityHi) {
- dst.hi = testForOverflow;
- dst.lo = 0.0;
+ dst.s.hi = testForOverflow;
+ dst.s.lo = 0.0;
return dst.ld;
}
@@ -67,8 +69,8 @@ long double __gcc_qsub(long double x, long double y)
else
w = T + Y;
- dst.hi = Y = W + w;
- dst.lo = (W - Y) + w;
+ dst.s.hi = Y = W + w;
+ dst.s.lo = (W - Y) + w;
return dst.ld;
}