1 /* Compute x^2 + y^2 - 1, without large cancellation error.
2 Copyright (C) 2012 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <http://www.gnu.org/licenses/>. */
19 #include "quadmath-imp.h"
22 /* Calculate X + Y exactly and store the result in *HI + *LO. It is
23 given that |X| >= |Y| and the values are small enough that no
27 add_split (__float128
*hi
, __float128
*lo
, __float128 x
, __float128 y
)
29 /* Apply Dekker's algorithm. */
34 /* Calculate X * Y exactly and store the result in *HI + *LO. It is
35 given that the values are small enough that no overflow occurs and
36 large enough (or zero) that no underflow occurs. */
39 mul_split (__float128
*hi
, __float128
*lo
, __float128 x
, __float128 y
)
41 /* Fast built-in fused multiply-add. */
43 *lo
= fmaq (x
, y
, -*hi
);
46 /* Compare absolute values of floating-point values pointed to by P
50 compare (const void *p
, const void *q
)
52 __float128 pld
= fabsq (*(const __float128
*) p
);
53 __float128 qld
= fabsq (*(const __float128
*) q
);
62 /* Return X^2 + Y^2 - 1, computed without large cancellation error.
63 It is given that 1 > X >= Y >= epsilon / 2, and that either X >=
67 __quadmath_x2y2m1q (__float128 x
, __float128 y
)
72 /* FIXME: SET_RESTORE_ROUNDL (FE_TONEAREST); */
73 mul_split (&vals
[1], &vals
[0], x
, x
);
74 mul_split (&vals
[3], &vals
[2], y
, y
);
82 qsort (vals
, 4, sizeof (__float128
), compare
);
83 /* Add up the values so that each element of VALS has absolute value
84 at most equal to the last set bit of the next nonzero
86 for (i
= 0; i
<= 2; i
++)
88 add_split (&vals
[i
+ 1], &vals
[i
], vals
[i
+ 1], vals
[i
]);
89 qsort (vals
+ i
+ 1, 3 - i
, sizeof (__float128
), compare
);
91 /* Now any error from this addition will be small. */
92 return vals
[3] + vals
[2] + vals
[1] + vals
[0];