2 * IBM Accurate Mathematical Library
3 * written by International Business Machines Corp.
4 * Copyright (C) 2001, 2011 Free Software Foundation
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU Lesser General Public License as published by
8 * the Free Software Foundation; either version 2.1 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
19 /*********************************************************************/
20 /* MODULE_NAME: uroot.c */
24 /* FILES NEEDED: dla.h endian.h mydefs.h uroot.h */
27 /* An ultimate sqrt routine. Given an IEEE double machine number x */
28 /* it computes the correctly rounded (to nearest) value of square */
30 /* Assumption: Machine arithmetic operations are performed in */
31 /* round to nearest mode of IEEE 754 standard. */
33 /*********************************************************************/
40 #include <math_private.h>
42 /*********************************************************************/
43 /* An ultimate sqrt routine. Given an IEEE double machine number x */
44 /* it computes the correctly rounded (to nearest) value of square */
46 /*********************************************************************/
47 double __ieee754_sqrt(double x
) {
50 rt0
= 9.99999999859990725855365213134618E-01,
51 rt1
= 4.99999999495955425917856814202739E-01,
52 rt2
= 3.75017500867345182581453026130850E-01,
53 rt3
= 3.12523626554518656309172508769531E-01;
54 static const double big
= 134217728.0;
55 double y
,t
,del
,res
,res1
,hy
,z
,zz
,p
,hx
,tx
,ty
,s
;
61 a
.i
[HIGH_HALF
]=(k
&0x001fffff)|0x3fe00000;
62 t
=inroot
[(k
&0x001fffff)>>14];
64 /*----------------- 2^-1022 <= | x |< 2^1024 -----------------*/
65 if (k
>0x000fffff && k
<0x7ff00000) {
67 t
=t
*(rt0
+y
*(rt1
+y
*(rt2
+y
*rt3
)));
68 c
.i
[HIGH_HALF
]=0x20000000+((k
&0x7fe00000)>>1);
71 del
=0.5*t
*((s
-hy
*hy
)-(y
-hy
)*(y
+hy
));
73 if (res
== (res
+1.002*((y
-res
)+del
))) return res
*c
.x
;
75 res1
=res
+1.5*((y
-res
)+del
);
76 EMULV(res
,res1
,z
,zz
,p
,hx
,tx
,hy
,ty
); /* (z+zz)=res*res1 */
77 return ((((z
-s
)+zz
)<0)?max(res
,res1
):min(res
,res1
))*c
.x
;
81 if ((k
& 0x7ff00000) == 0x7ff00000)
82 return x
*x
+x
; /* sqrt(NaN)=NaN, sqrt(+inf)=+inf, sqrt(-inf)=sNaN */
83 if (x
==0) return x
; /* sqrt(+0)=+0, sqrt(-0)=-0 */
84 if (k
<0) return (x
-x
)/(x
-x
); /* sqrt(-ve)=sNaN */
85 return tm256
.x
*__ieee754_sqrt(x
*t512
.x
);
88 strong_alias (__ieee754_sqrt
, __sqrt_finite
)