1 /* IEEE754 floating point arithmetic
2 * double precision square root
5 * MIPS floating point support
6 * Copyright (C) 1994-2000 Algorithmics Ltd.
8 * ########################################################################
10 * This program is free software; you can distribute it and/or modify it
11 * under the terms of the GNU General Public License (Version 2) as
12 * published by the Free Software Foundation.
14 * This program is distributed in the hope it will be useful, but WITHOUT
15 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 59 Temple Place - Suite 330, Boston MA 02111-1307, USA.
23 * ########################################################################
27 #include "ieee754dp.h"
29 static const unsigned table
[] = {
30 0, 1204, 3062, 5746, 9193, 13348, 18162, 23592,
31 29598, 36145, 43202, 50740, 58733, 67158, 75992,
32 85215, 83599, 71378, 60428, 50647, 41945, 34246,
33 27478, 21581, 16499, 12183, 8588, 5674, 3403,
37 ieee754dp
ieee754dp_sqrt(ieee754dp x
)
39 struct _ieee754_csr oldcsr
;
48 /* x == INF or NAN? */
50 case IEEE754_CLASS_QNAN
:
52 return ieee754dp_nanxcpt(x
, "sqrt");
53 case IEEE754_CLASS_SNAN
:
54 SETCX(IEEE754_INVALID_OPERATION
);
55 return ieee754dp_nanxcpt(ieee754dp_indef(), "sqrt");
56 case IEEE754_CLASS_ZERO
:
59 case IEEE754_CLASS_INF
:
61 /* sqrt(-Inf) = Nan */
62 SETCX(IEEE754_INVALID_OPERATION
);
63 return ieee754dp_nanxcpt(ieee754dp_indef(), "sqrt");
65 /* sqrt(+Inf) = Inf */
67 case IEEE754_CLASS_DNORM
:
70 case IEEE754_CLASS_NORM
:
73 SETCX(IEEE754_INVALID_OPERATION
);
74 return ieee754dp_nanxcpt(ieee754dp_indef(), "sqrt");
79 /* save old csr; switch off INX enable & flag; set RN rounding */
81 ieee754_csr
.mx
&= ~IEEE754_INEXACT
;
82 ieee754_csr
.sx
&= ~IEEE754_INEXACT
;
83 ieee754_csr
.rm
= IEEE754_RN
;
85 /* adjust exponent to prevent overflow */
87 if (xe
> 512) { /* x > 2**-512? */
88 xe
-= 512; /* x = x / 2**512 */
90 } else if (xe
< -512) { /* x < 2**-512? */
91 xe
+= 512; /* x = x * 2**512 */
95 y
= x
= builddp(0, xe
+ DP_EBIAS
, xm
& ~DP_HIDDEN_BIT
);
97 /* magic initial approximation to almost 8 sig. bits */
99 yh
= (yh
>> 1) + 0x1ff80000;
100 yh
= yh
- table
[(yh
>> 15) & 31];
101 y
.bits
= ((u64
) yh
<< 32) | (y
.bits
& 0xffffffff);
103 /* Heron's rule once with correction to improve to ~18 sig. bits */
104 /* t=x/y; y=y+t; py[n0]=py[n0]-0x00100006; py[n1]=0; */
105 t
= ieee754dp_div(x
, y
);
106 y
= ieee754dp_add(y
, t
);
107 y
.bits
-= 0x0010000600000000LL
;
108 y
.bits
&= 0xffffffff00000000LL
;
110 /* triple to almost 56 sig. bits: y ~= sqrt(x) to within 1 ulp */
111 /* t=y*y; z=t; pt[n0]+=0x00100000; t+=z; z=(x-z)*y; */
112 z
= t
= ieee754dp_mul(y
, y
);
113 t
.parts
.bexp
+= 0x001;
114 t
= ieee754dp_add(t
, z
);
115 z
= ieee754dp_mul(ieee754dp_sub(x
, z
), y
);
117 /* t=z/(t+x) ; pt[n0]+=0x00100000; y+=t; */
118 t
= ieee754dp_div(z
, ieee754dp_add(t
, x
));
119 t
.parts
.bexp
+= 0x001;
120 y
= ieee754dp_add(y
, t
);
122 /* twiddle last bit to force y correctly rounded */
124 /* set RZ, clear INEX flag */
125 ieee754_csr
.rm
= IEEE754_RZ
;
126 ieee754_csr
.sx
&= ~IEEE754_INEXACT
;
128 /* t=x/y; ...chopped quotient, possibly inexact */
129 t
= ieee754dp_div(x
, y
);
131 if (ieee754_csr
.sx
& IEEE754_INEXACT
|| t
.bits
!= y
.bits
) {
133 if (!(ieee754_csr
.sx
& IEEE754_INEXACT
))
137 /* add inexact to result status */
138 oldcsr
.cx
|= IEEE754_INEXACT
;
139 oldcsr
.sx
|= IEEE754_INEXACT
;
150 /* y=y+t; ...chopped sum */
151 y
= ieee754dp_add(y
, t
);
153 /* adjust scalx for correctly rounded sqrt(x) */
157 /* py[n0]=py[n0]+scalx; ...scale back y */
158 y
.parts
.bexp
+= scalx
;
160 /* restore rounding mode, possibly set inexact */
161 ieee754_csr
= oldcsr
;