4
* Copyright (c) 1998, 2001, Oracle and/or its affiliates. All rights reserved.
5
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
7
* This code is free software; you can redistribute it and/or modify it
8
* under the terms of the GNU General Public License version 2 only, as
9
* published by the Free Software Foundation. Oracle designates this
10
* particular file as subject to the "Classpath" exception as provided
11
* by Oracle in the LICENSE file that accompanied this code.
13
* This code is distributed in the hope that it will be useful, but WITHOUT
14
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16
* version 2 for more details (a copy is included in the LICENSE file that
17
* accompanied this code).
19
* You should have received a copy of the GNU General Public License version
20
* 2 along with this work; if not, write to the Free Software Foundation,
21
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
23
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
24
* or visit www.oracle.com if you need additional information or have any
28
/* __ieee754_hypot(x,y)
31
* If (assume round-to-nearest) z=x*x+y*y
32
* has error less than sqrt(2)/2 ulp, than
33
* sqrt(z) has error less than 1 ulp (exercise).
35
* So, compute sqrt(x*x+y*y) with some care as
36
* follows to get the error below 1 ulp:
39
* (if possible, set rounding to round-to-nearest)
41
* x1*x1+(y*y+(x2*(x+x1))) for x*x+y*y
42
* where x1 = x with lower 32 bits cleared, x2 = x-x1; else
44
* t1*y1+((x-y)*(x-y)+(t1*y2+t2*y))
45
* where t1 = 2x with lower 32 bits cleared, t2 = 2x-t1,
46
* y1= y with lower 32 bits chopped, y2 = y-y1.
48
* NOTE: scaling may be necessary if some argument is too
52
* hypot(x,y) is INF if x or y is +INF or -INF; else
53
* hypot(x,y) is NAN if x or y is NAN.
56
* hypot(x,y) returns sqrt(x^2+y^2) with error less
57
* than 1 ulps (units in the last place)
60
static partial class fdlibm
63
double __ieee754_hypot(double x, double y)
65
double a=x,b=y,t1,t2,y1,y2,w;
68
ha = __HI(x)&0x7fffffff; /* high word of x */
69
hb = __HI(y)&0x7fffffff; /* high word of y */
70
if(hb > ha) {a=y;b=x;j=ha; ha=hb;hb=j;} else {a=x;b=y;}
71
a = __HI(a, ha); /* a <- |a| */
72
b = __HI(b, hb); /* b <- |b| */
73
if((ha-hb)>0x3c00000) {return a+b;} /* x/y > 2**60 */
75
if(ha > 0x5f300000) { /* a>2**500 */
76
if(ha >= 0x7ff00000) { /* Inf or NaN */
77
w = a+b; /* for sNaN */
78
if(((ha&0xfffff)|__LO(a))==0) w = a;
79
if(((hb^0x7ff00000)|__LO(b))==0) w = b;
82
/* scale a and b by 2**-600 */
83
ha -= 0x25800000; hb -= 0x25800000; k += 600;
87
if(hb < 0x20b00000) { /* b < 2**-500 */
88
if(hb <= 0x000fffff) { /* subnormal b or 0 */
89
if((hb|(__LO(b)))==0) return a;
91
t1 = __HI(t1, 0x7fd00000); /* t1=2^1022 */
95
} else { /* scale a and b by 2^600 */
96
ha += 0x25800000; /* a *= 2^600 */
97
hb += 0x25800000; /* b *= 2^600 */
103
/* medium size a and b */
109
w = sqrt(t1*t1-(b*(-b)-t2*(a+t1)));
116
t1 = __HI(t1, ha+0x00100000);
118
w = sqrt(t1*y1-(w*(-w)-(t1*y2+t2*b)));
122
t1 = __HI(t1, __HI(t1) + (k<<20));