summaryrefslogtreecommitdiffstats
path: root/compiler-rt/lib/builtins/ppc/gcc_qsub.c
diff options
context:
space:
mode:
Diffstat (limited to 'compiler-rt/lib/builtins/ppc/gcc_qsub.c')
-rw-r--r--compiler-rt/lib/builtins/ppc/gcc_qsub.c24
1 files changed, 11 insertions, 13 deletions
diff --git a/compiler-rt/lib/builtins/ppc/gcc_qsub.c b/compiler-rt/lib/builtins/ppc/gcc_qsub.c
index 98d20747bf5..ac08120be0b 100644
--- a/compiler-rt/lib/builtins/ppc/gcc_qsub.c
+++ b/compiler-rt/lib/builtins/ppc/gcc_qsub.c
@@ -1,12 +1,10 @@
-/* Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
- * See https://llvm.org/LICENSE.txt for license information.
- * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
- */
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
-/* 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"
@@ -17,14 +15,14 @@ long double __gcc_qsub(long double x, long double y) {
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.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) ||
@@ -34,9 +32,9 @@ long double __gcc_qsub(long double x, long double y) {
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) {
OpenPOWER on IntegriCloud