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: e_jn.c

/* @(#)e_jn.c 1.4 95/01/18 */
/*
 * ====================================================
 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
 *
 * Developed at SunSoft, 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$");

/*
 * __ieee754_jn(n, x), __ieee754_yn(n, x)
 * floating point Bessel's function of the 1st and 2nd kind
 * of order n
 *
 * Special cases:
 *	y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
 *	y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
 * Note 2. About jn(n,x), yn(n,x)
 *	For n=0, j0(x) is called,
 *	for n=1, j1(x) is called,
 *	for n<x, forward recursion us used starting
 *	from values of j0(x) and j1(x).
 *	for n>x, a continued fraction approximation to
 *	j(n,x)/j(n-1,x) is evaluated and then backward
 *	recursion is used starting from a supposed value
 *	for j(n,x). The resulting value of j(0,x) is
 *	compared with the actual value to correct the
 *	supposed value of j(n,x).
 *
 *	yn(n,x) is similar in all respects, except
 *	that forward recursion is used for all
 *	values of n>1.
 */

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

static const volatile double vone = 1, vzero = 0;

static const double
invsqrtpi=  5.64189583547756279280e-01, /* 0x3FE20DD7, 0x50429B6D */
two   =  2.00000000000000000000e+00, /* 0x40000000, 0x00000000 */
one   =  1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */

static const double zero  =  0.00000000000000000000e+00;

double
__ieee754_jn(int n, double x)
{
	int32_t i,hx,ix,lx, sgn;
	double a, b, c, s, temp, di;
	double z, w;

/* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x)
     * Thus, J(-n,x) = J(n,-x)
     */
	EXTRACT_WORDS(hx,lx,x);
	ix = 0x7fffffff&hx;
    /* if J(n,NaN) is NaN */
	if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
	if(n<0){
		n = -n;
		x = -x;
		hx ^= 0x80000000;
	}
	if(n==0) return(__ieee754_j0(x));
	if(n==1) return(__ieee754_j1(x));
	sgn = (n&1)&(hx>>31);	/* even n -- 0, odd n -- sign(x) */
	x = fabs(x);
	if((ix|lx)==0||ix>=0x7ff00000) 	/* if x is 0 or inf */
	    b = zero;
	else if((double)n<=x) {
		/* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */
	    if(ix>=0x52D00000) { /* x > 2**302 */
    /* (x >> n**2)
     *	    Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
     *	    Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
     *	    Let s=sin(x), c=cos(x),
     *		xn=x-(2n+1)*pi/4, sqt2 = sqrt(2), then
     *
     *		   n	sin(xn)*sqt2	cos(xn)*sqt2
     *		----------------------------------
     *		   0	 s-c		 c+s
     *		   1	-s-c 		-c+s
     *		   2	-s+c		-c-s
     *		   3	 s+c		 c-s
     */
		sincos(x, &s, &c);
		switch(n&3) {
		    case 0: temp =  c+s; break;
		    case 1: temp = -c+s; break;
		    case 2: temp = -c-s; break;
		    case 3: temp =  c-s; break;
		}
		b = invsqrtpi*temp/sqrt(x);
	    } else {
	        a = __ieee754_j0(x);
	        b = __ieee754_j1(x);
	        for(i=1;i<n;i++){
		    temp = b;
		    b = b*((double)(i+i)/x) - a; /* avoid underflow */
		    a = temp;
	        }
	    }
	} else {
	    if(ix<0x3e100000) {	/* x < 2**-29 */
    /* x is tiny, return the first Taylor expansion of J(n,x)
     * J(n,x) = 1/n!*(x/2)^n  - ...
     */
		if(n>33)	/* underflow */
		    b = zero;
		else {
		    temp = x*0.5; b = temp;
		    for (a=one,i=2;i<=n;i++) {
			a *= (double)i;		/* a = n! */
			b *= temp;		/* b = (x/2)^n */
		    }
		    b = b/a;
		}
	    } else {
		/* use backward recurrence */
		/* 			x      x^2      x^2
		 *  J(n,x)/J(n-1,x) =  ----   ------   ------   .....
		 *			2n  - 2(n+1) - 2(n+2)
		 *
		 * 			1      1        1
		 *  (for large x)   =  ----  ------   ------   .....
		 *			2n   2(n+1)   2(n+2)
		 *			-- - ------ - ------ -
		 *			 x     x         x
		 *
		 * Let w = 2n/x and h=2/x, then the above quotient
		 * is equal to the continued fraction:
		 *		    1
		 *	= -----------------------
		 *		       1
		 *	   w - -----------------
		 *			  1
		 * 	        w+h - ---------
		 *		       w+2h - ...
		 *
		 * To determine how many terms needed, let
		 * Q(0) = w, Q(1) = w(w+h) - 1,
		 * Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
		 * When Q(k) > 1e4	good for single
		 * When Q(k) > 1e9	good for double
		 * When Q(k) > 1e17	good for quadruple
		 */
	    /* determine k */
		double t,v;
		double q0,q1,h,tmp; int32_t k,m;
		w  = (n+n)/(double)x; h = 2.0/(double)x;
		q0 = w;  z = w+h; q1 = w*z - 1.0; k=1;
		while(q1<1.0e9) {
			k += 1; z += h;
			tmp = z*q1 - q0;
			q0 = q1;
			q1 = tmp;
		}
		m = n+n;
		for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
		a = t;
		b = one;
		/*  estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n)
		 *  Hence, if n*(log(2n/x)) > ...
		 *  single 8.8722839355e+01
		 *  double 7.09782712893383973096e+02
		 *  long double 1.1356523406294143949491931077970765006170e+04
		 *  then recurrent value may overflow and the result is
		 *  likely underflow to zero
		 */
		tmp = n;
		v = two/x;
		tmp = tmp*__ieee754_log(fabs(v*tmp));
		if(tmp<7.09782712893383973096e+02) {
	    	    for(i=n-1,di=(double)(i+i);i>0;i--){
		        temp = b;
			b *= di;
			b  = b/x - a;
		        a = temp;
			di -= two;
	     	    }
		} else {
	    	    for(i=n-1,di=(double)(i+i);i>0;i--){
		        temp = b;
			b *= di;
			b  = b/x - a;
		        a = temp;
			di -= two;
		    /* scale b to avoid spurious overflow */
			if(b>1e100) {
			    a /= b;
			    t /= b;
			    b  = one;
			}
	     	    }
		}
		z = __ieee754_j0(x);
		w = __ieee754_j1(x);
		if (fabs(z) >= fabs(w))
		    b = (t*z/b);
		else
		    b = (t*w/a);
	    }
	}
	if(sgn==1) return -b; else return b;
}

double
__ieee754_yn(int n, double x)
{
	int32_t i,hx,ix,lx;
	int32_t sign;
	double a, b, c, s, temp;

EXTRACT_WORDS(hx,lx,x);
	ix = 0x7fffffff&hx;
	/* yn(n,NaN) = NaN */
	if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
	/* yn(n,+-0) = -inf and raise divide-by-zero exception. */
	if((ix|lx)==0) return -one/vzero;
	/* yn(n,x<0) = NaN and raise invalid exception. */
	if(hx<0) return vzero/vzero;
	sign = 1;
	if(n<0){
		n = -n;
		sign = 1 - ((n&1)<<1);
	}
	if(n==0) return(__ieee754_y0(x));
	if(n==1) return(sign*__ieee754_y1(x));
	if(ix==0x7ff00000) return zero;
	if(ix>=0x52D00000) { /* x > 2**302 */
    /* (x >> n**2)
     *	    Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
     *	    Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
     *	    Let s=sin(x), c=cos(x),
     *		xn=x-(2n+1)*pi/4, sqt2 = sqrt(2), then
     *
     *		   n	sin(xn)*sqt2	cos(xn)*sqt2
     *		----------------------------------
     *		   0	 s-c		 c+s
     *		   1	-s-c 		-c+s
     *		   2	-s+c		-c-s
     *		   3	 s+c		 c-s
     */
		sincos(x, &s, &c);
		switch(n&3) {
		    case 0: temp =  s-c; break;
		    case 1: temp = -s-c; break;
		    case 2: temp = -s+c; break;
		    case 3: temp =  s+c; break;
		}
		b = invsqrtpi*temp/sqrt(x);
	} else {
	    u_int32_t high;
	    a = __ieee754_y0(x);
	    b = __ieee754_y1(x);
	/* quit if b is -inf */
	    GET_HIGH_WORD(high,b);
	    for(i=1;i<n&&high!=0xfff00000;i++){
		temp = b;
		b = ((double)(i+i)/x)*b - a;
		GET_HIGH_WORD(high,b);
		a = temp;
	    }
	}
	if(sign>0) return b; else return -b;
}

003 File Manager

Editing: e_jn.c

Upload File

Create Folder