File Manager

003 File Manager

Current Path: /usr/src/lib/msun/src

📁 ..
📄 catrig.c(18.56 KB)
📄 catrigf.c(9.27 KB)
📄 catrigl.c(10.37 KB)
📄 e_acos.c(3.38 KB)
📄 e_acosf.c(1.99 KB)
📄 e_acosh.c(1.63 KB)
📄 e_acoshf.c(1.27 KB)
📄 e_acoshl.c(2.19 KB)
📄 e_acosl.c(2.16 KB)
📄 e_asin.c(3.55 KB)
📄 e_asinf.c(1.58 KB)
📄 e_asinl.c(1.85 KB)
📄 e_atan2.c(3.74 KB)
📄 e_atan2f.c(2.63 KB)
📄 e_atan2l.c(3.42 KB)
📄 e_atanh.c(1.64 KB)
📄 e_atanhf.c(1.12 KB)
📄 e_atanhl.c(1.76 KB)
📄 e_cosh.c(2.21 KB)
📄 e_coshf.c(1.45 KB)
📄 e_coshl.c(4 KB)
📄 e_exp.c(5.07 KB)
📄 e_expf.c(2.7 KB)
📄 e_fmod.c(3.34 KB)
📄 e_fmodf.c(2.59 KB)
📄 e_fmodl.c(3.77 KB)
📄 e_gamma.c(725 B)
📄 e_gamma_r.c(801 B)
📄 e_gammaf.c(814 B)
📄 e_gammaf_r.c(890 B)
📄 e_hypot.c(3.22 KB)
📄 e_hypotf.c(2.15 KB)
📄 e_hypotl.c(3.16 KB)
📄 e_j0.c(14.39 KB)
📄 e_j0f.c(10.31 KB)
📄 e_j1.c(14.12 KB)
📄 e_j1f.c(9.98 KB)
📄 e_jn.c(7.08 KB)
📄 e_jnf.c(4.75 KB)
📄 e_lgamma.c(819 B)
📄 e_lgamma_r.c(10.7 KB)
📄 e_lgammaf.c(820 B)
📄 e_lgammaf_r.c(5.82 KB)
📄 e_lgammal.c(599 B)
📄 e_log.c(4.42 KB)
📄 e_log10.c(2.5 KB)
📄 e_log10f.c(1.93 KB)
📄 e_log2.c(3.64 KB)
📄 e_log2f.c(2.37 KB)
📄 e_logf.c(2.36 KB)
📄 e_pow.c(9.84 KB)
📄 e_powf.c(7.34 KB)
📄 e_rem_pio2.c(4.7 KB)
📄 e_rem_pio2f.c(1.96 KB)
📄 e_remainder.c(1.75 KB)
📄 e_remainderf.c(1.41 KB)
📄 e_remainderl.c(1.55 KB)
📄 e_scalb.c(1.07 KB)
📄 e_scalbf.c(1.06 KB)
📄 e_sinh.c(2.03 KB)
📄 e_sinhf.c(1.43 KB)
📄 e_sinhl.c(4.12 KB)
📄 e_sqrt.c(14.12 KB)
📄 e_sqrtf.c(1.91 KB)
📄 e_sqrtl.c(4.28 KB)
📄 fenv-softfloat.h(4.96 KB)
📄 imprecise.c(2.08 KB)
📄 k_cos.c(2.75 KB)
📄 k_cosf.c(1.23 KB)
📄 k_exp.c(3.55 KB)
📄 k_expf.c(2.67 KB)
📄 k_log.h(3.34 KB)
📄 k_logf.h(992 B)
📄 k_rem_pio2.c(15.51 KB)
📄 k_sin.c(2.27 KB)
📄 k_sincos.h(1.7 KB)
📄 k_sincosf.h(1.38 KB)
📄 k_sincosl.h(4.82 KB)
📄 k_sinf.c(1.21 KB)
📄 k_tan.c(3.93 KB)
📄 k_tanf.c(1.97 KB)
📄 math.h(13.92 KB)
📄 math_private.h(24.72 KB)
📄 s_asinh.c(1.64 KB)
📄 s_asinhf.c(1.32 KB)
📄 s_asinhl.c(2.41 KB)
📄 s_atan.c(4.08 KB)
📄 s_atanf.c(2.42 KB)
📄 s_atanl.c(2.32 KB)
📄 s_carg.c(1.55 KB)
📄 s_cargf.c(1.55 KB)
📄 s_cargl.c(1.57 KB)
📄 s_cbrt.c(4.03 KB)
📄 s_cbrtf.c(1.85 KB)
📄 s_cbrtl.c(3.34 KB)
📄 s_ccosh.c(5.01 KB)
📄 s_ccoshf.c(3.08 KB)
📄 s_ceil.c(1.73 KB)
📄 s_ceilf.c(1.24 KB)
📄 s_ceill.c(2.38 KB)
📄 s_cexp.c(2.88 KB)
📄 s_cexpf.c(2.85 KB)
📄 s_cimag.c(1.53 KB)
📄 s_cimagf.c(1.53 KB)
📄 s_cimagl.c(1.55 KB)
📄 s_clog.c(5.06 KB)
📄 s_clogf.c(5.01 KB)
📄 s_clogl.c(5.49 KB)
📄 s_conj.c(1.51 KB)
📄 s_conjf.c(1.52 KB)
📄 s_conjl.c(1.53 KB)
📄 s_copysign.c(808 B)
📄 s_copysignf.c(905 B)
📄 s_copysignl.c(1.57 KB)
📄 s_cos.c(2.19 KB)
📄 s_cosf.c(2.2 KB)
📄 s_cosl.c(2.55 KB)
📄 s_cpow.c(1.8 KB)
📄 s_cpowf.c(1.79 KB)
📄 s_cpowl.c(1.83 KB)
📄 s_cproj.c(1.74 KB)
📄 s_cprojf.c(1.66 KB)
📄 s_cprojl.c(1.68 KB)
📄 s_creal.c(1.45 KB)
📄 s_crealf.c(1.45 KB)
📄 s_creall.c(1.46 KB)
📄 s_csinh.c(5.01 KB)
📄 s_csinhf.c(3.06 KB)
📄 s_csqrt.c(3.29 KB)
📄 s_csqrtf.c(2.65 KB)
📄 s_csqrtl.c(3.78 KB)
📄 s_ctanh.c(4.32 KB)
📄 s_ctanhf.c(2.45 KB)
📄 s_erf.c(11 KB)
📄 s_erff.c(5.11 KB)
📄 s_exp2.c(14.03 KB)
📄 s_exp2f.c(4.14 KB)
📄 s_expm1.c(7.18 KB)
📄 s_expm1f.c(3.41 KB)
📄 s_fabs.c(677 B)
📄 s_fabsf.c(765 B)
📄 s_fabsl.c(1.68 KB)
📄 s_fdim.c(1.7 KB)
📄 s_finite.c(700 B)
📄 s_finitef.c(796 B)
📄 s_floor.c(1.74 KB)
📄 s_floorf.c(1.41 KB)
📄 s_floorl.c(2.38 KB)
📄 s_fma.c(7.92 KB)
📄 s_fmaf.c(2.57 KB)
📄 s_fmal.c(7.38 KB)
📄 s_fmax.c(2.01 KB)
📄 s_fmaxf.c(1.88 KB)
📄 s_fmaxl.c(1.98 KB)
📄 s_fmin.c(2.01 KB)
📄 s_fminf.c(1.88 KB)
📄 s_fminl.c(1.98 KB)
📄 s_frexp.c(1.31 KB)
📄 s_frexpf.c(1.02 KB)
📄 s_frexpl.c(2 KB)
📄 s_ilogb.c(1.14 KB)
📄 s_ilogbf.c(976 B)
📄 s_ilogbl.c(1.21 KB)
📄 s_isfinite.c(1.72 KB)
📄 s_isnan.c(2.1 KB)
📄 s_isnormal.c(1.78 KB)
📄 s_llrint.c(156 B)
📄 s_llrintf.c(157 B)
📄 s_llrintl.c(163 B)
📄 s_llround.c(215 B)
📄 s_llroundf.c(216 B)
📄 s_llroundl.c(222 B)
📄 s_log1p.c(5.6 KB)
📄 s_log1pf.c(3.14 KB)
📄 s_logb.c(1.13 KB)
📄 s_logbf.c(1023 B)
📄 s_logbl.c(1.24 KB)
📄 s_lrint.c(2.1 KB)
📄 s_lrintf.c(151 B)
📄 s_lrintl.c(157 B)
📄 s_lround.c(2.45 KB)
📄 s_lroundf.c(208 B)
📄 s_lroundl.c(214 B)
📄 s_modf.c(1.88 KB)
📄 s_modff.c(1.39 KB)
📄 s_modfl.c(3.41 KB)
📄 s_nan.c(3.32 KB)
📄 s_nearbyint.c(2.29 KB)
📄 s_nextafter.c(2.03 KB)
📄 s_nextafterf.c(1.61 KB)
📄 s_nextafterl.c(2.02 KB)
📄 s_nexttoward.c(1.75 KB)
📄 s_nexttowardf.c(1.42 KB)
📄 s_remquo.c(3.86 KB)
📄 s_remquof.c(3.02 KB)
📄 s_remquol.c(4.42 KB)
📄 s_rint.c(2.33 KB)
📄 s_rintf.c(1.22 KB)
📄 s_rintl.c(2.77 KB)
📄 s_round.c(1.83 KB)
📄 s_roundf.c(1.74 KB)
📄 s_roundl.c(1.84 KB)
📄 s_scalbln.c(1.82 KB)
📄 s_scalbn.c(1.9 KB)
📄 s_scalbnf.c(1.67 KB)
📄 s_scalbnl.c(1.9 KB)
📄 s_signbit.c(1.7 KB)
📄 s_signgam.c(61 B)
📄 s_significand.c(727 B)
📄 s_significandf.c(691 B)
📄 s_sin.c(2.18 KB)
📄 s_sincos.c(1.6 KB)
📄 s_sincosf.c(2.57 KB)
📄 s_sincosl.c(2.67 KB)
📄 s_sinf.c(2.18 KB)
📄 s_sinl.c(2.49 KB)
📄 s_tan.c(2.02 KB)
📄 s_tanf.c(1.97 KB)
📄 s_tanh.c(2.02 KB)
📄 s_tanhf.c(1.39 KB)
📄 s_tanhl.c(5.09 KB)
📄 s_tanl.c(2.6 KB)
📄 s_tgammaf.c(1.75 KB)
📄 s_trunc.c(1.5 KB)
📄 s_truncf.c(1.21 KB)
📄 s_truncl.c(1.61 KB)
📄 w_cabs.c(365 B)
📄 w_cabsf.c(350 B)
📄 w_cabsl.c(357 B)
📄 w_drem.c(211 B)
📄 w_dremf.c(254 B)

Editing: s_expm1.c

/* @(#)s_expm1.c 5.1 93/09/24 */
/*
 * ====================================================
 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
 *
 * Developed at SunPro, a Sun Microsystems, Inc. business.
 * Permission to use, copy, modify, and distribute this
 * software is freely granted, provided that this notice
 * is preserved.
 * ====================================================
 */

#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

/* expm1(x)
 * Returns exp(x)-1, the exponential of x minus 1.
 *
 * Method
 *   1. Argument reduction:
 *	Given x, find r and integer k such that
 *
 *               x = k*ln2 + r,  |r| <= 0.5*ln2 ~ 0.34658
 *
 *      Here a correction term c will be computed to compensate
 *	the error in r when rounded to a floating-point number.
 *
 *   2. Approximating expm1(r) by a special rational function on
 *	the interval [0,0.34658]:
 *	Since
 *	    r*(exp(r)+1)/(exp(r)-1) = 2+ r^2/6 - r^4/360 + ...
 *	we define R1(r*r) by
 *	    r*(exp(r)+1)/(exp(r)-1) = 2+ r^2/6 * R1(r*r)
 *	That is,
 *	    R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r)
 *		     = 6/r * ( 1 + 2.0*(1/(exp(r)-1) - 1/r))
 *		     = 1 - r^2/60 + r^4/2520 - r^6/100800 + ...
 *      We use a special Reme algorithm on [0,0.347] to generate
 * 	a polynomial of degree 5 in r*r to approximate R1. The
 *	maximum error of this polynomial approximation is bounded
 *	by 2**-61. In other words,
 *	    R1(z) ~ 1.0 + Q1*z + Q2*z**2 + Q3*z**3 + Q4*z**4 + Q5*z**5
 *	where 	Q1  =  -1.6666666666666567384E-2,
 * 		Q2  =   3.9682539681370365873E-4,
 * 		Q3  =  -9.9206344733435987357E-6,
 * 		Q4  =   2.5051361420808517002E-7,
 * 		Q5  =  -6.2843505682382617102E-9;
 *		z   =  r*r,
 *	with error bounded by
 *	    |                  5           |     -61
 *	    | 1.0+Q1*z+...+Q5*z   -  R1(z) | <= 2
 *	    |                              |
 *
 *	expm1(r) = exp(r)-1 is then computed by the following
 * 	specific way which minimize the accumulation rounding error:
 *			       2     3
 *			      r     r    [ 3 - (R1 + R1*r/2)  ]
 *	      expm1(r) = r + --- + --- * [--------------------]
 *		              2     2    [ 6 - r*(3 - R1*r/2) ]
 *
 *	To compensate the error in the argument reduction, we use
 *		expm1(r+c) = expm1(r) + c + expm1(r)*c
 *			   ~ expm1(r) + c + r*c
 *	Thus c+r*c will be added in as the correction terms for
 *	expm1(r+c). Now rearrange the term to avoid optimization
 * 	screw up:
 *		        (      2                                    2 )
 *		        ({  ( r    [ R1 -  (3 - R1*r/2) ]  )  }    r  )
 *	 expm1(r+c)~r - ({r*(--- * [--------------------]-c)-c} - --- )
 *	                ({  ( 2    [ 6 - r*(3 - R1*r/2) ]  )  }    2  )
 *                      (                                             )
 *
 *		   = r - E
 *   3. Scale back to obtain expm1(x):
 *	From step 1, we have
 *	   expm1(x) = either 2^k*[expm1(r)+1] - 1
 *		    = or     2^k*[expm1(r) + (1-2^-k)]
 *   4. Implementation notes:
 *	(A). To save one multiplication, we scale the coefficient Qi
 *	     to Qi*2^i, and replace z by (x^2)/2.
 *	(B). To achieve maximum accuracy, we compute expm1(x) by
 *	  (i)   if x < -56*ln2, return -1.0, (raise inexact if x!=inf)
 *	  (ii)  if k=0, return r-E
 *	  (iii) if k=-1, return 0.5*(r-E)-0.5
 *        (iv)	if k=1 if r < -0.25, return 2*((r+0.5)- E)
 *	       	       else	     return  1.0+2.0*(r-E);
 *	  (v)   if (k<-2||k>56) return 2^k(1-(E-r)) - 1 (or exp(x)-1)
 *	  (vi)  if k <= 20, return 2^k((1-2^-k)-(E-r)), else
 *	  (vii) return 2^k(1-((E+2^-k)-r))
 *
 * Special cases:
 *	expm1(INF) is INF, expm1(NaN) is NaN;
 *	expm1(-INF) is -1, and
 *	for finite argument, only expm1(0)=0 is exact.
 *
 * Accuracy:
 *	according to an error analysis, the error is always less than
 *	1 ulp (unit in the last place).
 *
 * Misc. info.
 *	For IEEE double
 *	    if x >  7.09782712893383973096e+02 then expm1(x) overflow
 *
 * Constants:
 * The hexadecimal values are the intended ones for the following
 * constants. The decimal values may be used, provided that the
 * compiler will convert from decimal to binary accurately enough
 * to produce the hexadecimal values shown.
 */

#include <float.h>

#include "math.h"
#include "math_private.h"

static const double
one		= 1.0,
tiny		= 1.0e-300,
o_threshold	= 7.09782712893383973096e+02,/* 0x40862E42, 0xFEFA39EF */
ln2_hi		= 6.93147180369123816490e-01,/* 0x3fe62e42, 0xfee00000 */
ln2_lo		= 1.90821492927058770002e-10,/* 0x3dea39ef, 0x35793c76 */
invln2		= 1.44269504088896338700e+00,/* 0x3ff71547, 0x652b82fe */
/* Scaled Q's: Qn_here = 2**n * Qn_above, for R(2*z) where z = hxs = x*x/2: */
Q1  =  -3.33333333333331316428e-02, /* BFA11111 111110F4 */
Q2  =   1.58730158725481460165e-03, /* 3F5A01A0 19FE5585 */
Q3  =  -7.93650757867487942473e-05, /* BF14CE19 9EAADBB7 */
Q4  =   4.00821782732936239552e-06, /* 3ED0CFCA 86E65239 */
Q5  =  -2.01099218183624371326e-07; /* BE8AFDB7 6E09C32D */

static volatile double huge = 1.0e+300;

double
expm1(double x)
{
	double y,hi,lo,c,t,e,hxs,hfx,r1,twopk;
	int32_t k,xsb;
	u_int32_t hx;

GET_HIGH_WORD(hx,x);
	xsb = hx&0x80000000;		/* sign bit of x */
	hx &= 0x7fffffff;		/* high word of |x| */

/* filter out huge and non-finite argument */
	if(hx >= 0x4043687A) {			/* if |x|>=56*ln2 */
	    if(hx >= 0x40862E42) {		/* if |x|>=709.78... */
                if(hx>=0x7ff00000) {
		    u_int32_t low;
		    GET_LOW_WORD(low,x);
		    if(((hx&0xfffff)|low)!=0)
		         return x+x; 	 /* NaN */
		    else return (xsb==0)? x:-1.0;/* exp(+-inf)={inf,-1} */
	        }
	        if(x > o_threshold) return huge*huge; /* overflow */
	    }
	    if(xsb!=0) { /* x < -56*ln2, return -1.0 with inexact */
		if(x+tiny<0.0)		/* raise inexact */
		return tiny-one;	/* return -1 */
	    }
	}

/* argument reduction */
	if(hx > 0x3fd62e42) {		/* if  |x| > 0.5 ln2 */
	    if(hx < 0x3FF0A2B2) {	/* and |x| < 1.5 ln2 */
		if(xsb==0)
		    {hi = x - ln2_hi; lo =  ln2_lo;  k =  1;}
		else
		    {hi = x + ln2_hi; lo = -ln2_lo;  k = -1;}
	    } else {
		k  = invln2*x+((xsb==0)?0.5:-0.5);
		t  = k;
		hi = x - t*ln2_hi;	/* t*ln2_hi is exact here */
		lo = t*ln2_lo;
	    }
	    STRICT_ASSIGN(double, x, hi - lo);
	    c  = (hi-x)-lo;
	}
	else if(hx < 0x3c900000) {  	/* when |x|<2**-54, return x */
	    t = huge+x;	/* return x with inexact flags when x!=0 */
	    return x - (t-(huge+x));
	}
	else k = 0;

/* x is now in primary range */
	hfx = 0.5*x;
	hxs = x*hfx;
	r1 = one+hxs*(Q1+hxs*(Q2+hxs*(Q3+hxs*(Q4+hxs*Q5))));
	t  = 3.0-r1*hfx;
	e  = hxs*((r1-t)/(6.0 - x*t));
	if(k==0) return x - (x*e-hxs);		/* c is 0 */
	else {
	    INSERT_WORDS(twopk,((u_int32_t)(0x3ff+k))<<20,0);	/* 2^k */
	    e  = (x*(e-c)-c);
	    e -= hxs;
	    if(k== -1) return 0.5*(x-e)-0.5;
	    if(k==1) {
	       	if(x < -0.25) return -2.0*(e-(x+0.5));
	       	else 	      return  one+2.0*(x-e);
	    }
	    if (k <= -2 || k>56) {   /* suffice to return exp(x)-1 */
	        y = one-(e-x);
		if (k == 1024) y = y*2.0*0x1p1023;
		else y = y*twopk;
	        return y-one;
	    }
	    t = one;
	    if(k<20) {
	        SET_HIGH_WORD(t,0x3ff00000 - (0x200000>>k));  /* t=1-2^-k */
	       	y = t-(e-x);
		y = y*twopk;
	   } else {
		SET_HIGH_WORD(t,((0x3ff-k)<<20));	/* 2^-k */
	       	y = x-(e+t);
	       	y += one;
		y = y*twopk;
	    }
	}
	return y;
}

#if (LDBL_MANT_DIG == 53)
__weak_reference(expm1, expm1l);
#endif

003 File Manager

Editing: s_expm1.c

Upload File

Create Folder