tor-browser

The Tor Browser
git clone https://git.dasho.dev/tor-browser.git
Log | Files | Refs | README | LICENSE

e_hypot.cpp (3239B)


      1 /* @(#)e_hypot.c 1.3 95/01/18 */
      2 /*
      3 * ====================================================
      4 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
      5 *
      6 * Developed at SunSoft, a Sun Microsystems, Inc. business.
      7 * Permission to use, copy, modify, and distribute this
      8 * software is freely granted, provided that this notice 
      9 * is preserved.
     10 * ====================================================
     11 */
     12 
     13 //#include <sys/cdefs.h>
     14 //__FBSDID("$FreeBSD$");
     15 
     16 /* __ieee754_hypot(x,y)
     17 *
     18 * Method :                  
     19 *	If (assume round-to-nearest) z=x*x+y*y 
     20 *	has error less than sqrt(2)/2 ulp, than 
     21 *	sqrt(z) has error less than 1 ulp (exercise).
     22 *
     23 *	So, compute sqrt(x*x+y*y) with some care as 
     24 *	follows to get the error below 1 ulp:
     25 *
     26 *	Assume x>y>0;
     27 *	(if possible, set rounding to round-to-nearest)
     28 *	1. if x > 2y  use
     29 *		x1*x1+(y*y+(x2*(x+x1))) for x*x+y*y
     30 *	where x1 = x with lower 32 bits cleared, x2 = x-x1; else
     31 *	2. if x <= 2y use
     32 *		t1*y1+((x-y)*(x-y)+(t1*y2+t2*y))
     33 *	where t1 = 2x with lower 32 bits cleared, t2 = 2x-t1, 
     34 *	y1= y with lower 32 bits chopped, y2 = y-y1.
     35 *		
     36 *	NOTE: scaling may be necessary if some argument is too 
     37 *	      large or too tiny
     38 *
     39 * Special cases:
     40 *	hypot(x,y) is INF if x or y is +INF or -INF; else
     41 *	hypot(x,y) is NAN if x or y is NAN.
     42 *
     43 * Accuracy:
     44 * 	hypot(x,y) returns sqrt(x^2+y^2) with error less 
     45 * 	than 1 ulps (units in the last place) 
     46 */
     47 
     48 #include <float.h>
     49 #include <math.h>
     50 
     51 #include "math_private.h"
     52 
     53 double
     54 __ieee754_hypot(double x, double y)
     55 {
     56 double a,b,t1,t2,y1,y2,w;
     57 int32_t j,k,ha,hb;
     58 
     59 GET_HIGH_WORD(ha,x);
     60 ha &= 0x7fffffff;
     61 GET_HIGH_WORD(hb,y);
     62 hb &= 0x7fffffff;
     63 if(hb > ha) {a=y;b=x;j=ha; ha=hb;hb=j;} else {a=x;b=y;}
     64 a = fabs(a);
     65 b = fabs(b);
     66 if((ha-hb)>0x3c00000) {return a+b;} /* x/y > 2**60 */
     67 k=0;
     68 if(ha > 0x5f300000) {	/* a>2**500 */
     69    if(ha >= 0x7ff00000) {	/* Inf or NaN */
     70        u_int32_t low;
     71        /* Use original arg order iff result is NaN; quieten sNaNs. */
     72        w = fabsl(x+0.0L)-fabs(y+0);
     73        GET_LOW_WORD(low,a);
     74        if(((ha&0xfffff)|low)==0) w = a;
     75        GET_LOW_WORD(low,b);
     76        if(((hb^0x7ff00000)|low)==0) w = b;
     77        return w;
     78    }
     79    /* scale a and b by 2**-600 */
     80    ha -= 0x25800000; hb -= 0x25800000;	k += 600;
     81    SET_HIGH_WORD(a,ha);
     82    SET_HIGH_WORD(b,hb);
     83 }
     84 if(hb < 0x20b00000) {	/* b < 2**-500 */
     85     if(hb <= 0x000fffff) {	/* subnormal b or 0 */
     86         u_int32_t low;
     87 	GET_LOW_WORD(low,b);
     88 	if((hb|low)==0) return a;
     89 	t1=0;
     90 	SET_HIGH_WORD(t1,0x7fd00000);	/* t1=2^1022 */
     91 	b *= t1;
     92 	a *= t1;
     93 	k -= 1022;
     94     } else {		/* scale a and b by 2^600 */
     95         ha += 0x25800000; 	/* a *= 2^600 */
     96 	hb += 0x25800000;	/* b *= 2^600 */
     97 	k -= 600;
     98 	SET_HIGH_WORD(a,ha);
     99 	SET_HIGH_WORD(b,hb);
    100     }
    101 }
    102    /* medium size a and b */
    103 w = a-b;
    104 if (w>b) {
    105     t1 = 0;
    106     SET_HIGH_WORD(t1,ha);
    107     t2 = a-t1;
    108     w  = sqrt(t1*t1-(b*(-b)-t2*(a+t1)));
    109 } else {
    110     a  = a+a;
    111     y1 = 0;
    112     SET_HIGH_WORD(y1,hb);
    113     y2 = b - y1;
    114     t1 = 0;
    115     SET_HIGH_WORD(t1,ha+0x00100000);
    116     t2 = a - t1;
    117     w  = sqrt(t1*y1-(w*(-w)-(t1*y2+t2*b)));
    118 }
    119 if(k!=0) {
    120     t1 = 0.0;
    121     SET_HIGH_WORD(t1,(1023+k)<<20);
    122     return t1*w;
    123 } else return w;
    124 }