003 File Manager
Current Path:
/usr/src/lib/msun/src
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_clogl.c
/*- * Copyright (c) 2013 Bruce D. Evans * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice unmodified, this list of conditions, and the following * disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include <sys/cdefs.h> __FBSDID("$FreeBSD$"); #include <complex.h> #include <float.h> #ifdef __i386__ #include <ieeefp.h> #endif #include "fpmath.h" #include "math.h" #include "math_private.h" #define MANT_DIG LDBL_MANT_DIG #define MAX_EXP LDBL_MAX_EXP #define MIN_EXP LDBL_MIN_EXP static const double ln2_hi = 6.9314718055829871e-1; /* 0x162e42fefa0000.0p-53 */ #if LDBL_MANT_DIG == 64 #define MULT_REDUX 0x1p32 /* exponent MANT_DIG / 2 rounded up */ static const double ln2l_lo = 1.6465949582897082e-12; /* 0x1cf79abc9e3b3a.0p-92 */ #elif LDBL_MANT_DIG == 113 #define MULT_REDUX 0x1p57 static const long double ln2l_lo = 1.64659495828970812809844307550013433e-12L; /* 0x1cf79abc9e3b39803f2f6af40f343.0p-152L */ #else #error "Unsupported long double format" #endif long double complex clogl(long double complex z) { long double ax, ax2h, ax2l, axh, axl, ay, ay2h, ay2l, ayh, ayl; long double sh, sl, t; long double x, y, v; uint16_t hax, hay; int kx, ky; ENTERIT(long double complex); x = creall(z); y = cimagl(z); v = atan2l(y, x); ax = fabsl(x); ay = fabsl(y); if (ax < ay) { t = ax; ax = ay; ay = t; } GET_LDBL_EXPSIGN(hax, ax); kx = hax - 16383; GET_LDBL_EXPSIGN(hay, ay); ky = hay - 16383; /* Handle NaNs and Infs using the general formula. */ if (kx == MAX_EXP || ky == MAX_EXP) RETURNI(CMPLXL(logl(hypotl(x, y)), v)); /* Avoid spurious underflow, and reduce inaccuracies when ax is 1. */ if (ax == 1) { if (ky < (MIN_EXP - 1) / 2) RETURNI(CMPLXL((ay / 2) * ay, v)); RETURNI(CMPLXL(log1pl(ay * ay) / 2, v)); } /* Avoid underflow when ax is not small. Also handle zero args. */ if (kx - ky > MANT_DIG || ay == 0) RETURNI(CMPLXL(logl(ax), v)); /* Avoid overflow. */ if (kx >= MAX_EXP - 1) RETURNI(CMPLXL(logl(hypotl(x * 0x1p-16382L, y * 0x1p-16382L)) + (MAX_EXP - 2) * ln2l_lo + (MAX_EXP - 2) * ln2_hi, v)); if (kx >= (MAX_EXP - 1) / 2) RETURNI(CMPLXL(logl(hypotl(x, y)), v)); /* Reduce inaccuracies and avoid underflow when ax is denormal. */ if (kx <= MIN_EXP - 2) RETURNI(CMPLXL(logl(hypotl(x * 0x1p16383L, y * 0x1p16383L)) + (MIN_EXP - 2) * ln2l_lo + (MIN_EXP - 2) * ln2_hi, v)); /* Avoid remaining underflows (when ax is small but not denormal). */ if (ky < (MIN_EXP - 1) / 2 + MANT_DIG) RETURNI(CMPLXL(logl(hypotl(x, y)), v)); /* Calculate ax*ax and ay*ay exactly using Dekker's algorithm. */ t = (long double)(ax * (MULT_REDUX + 1)); axh = (long double)(ax - t) + t; axl = ax - axh; ax2h = ax * ax; ax2l = axh * axh - ax2h + 2 * axh * axl + axl * axl; t = (long double)(ay * (MULT_REDUX + 1)); ayh = (long double)(ay - t) + t; ayl = ay - ayh; ay2h = ay * ay; ay2l = ayh * ayh - ay2h + 2 * ayh * ayl + ayl * ayl; /* * When log(|z|) is far from 1, accuracy in calculating the sum * of the squares is not very important since log() reduces * inaccuracies. We depended on this to use the general * formula when log(|z|) is very far from 1. When log(|z|) is * moderately far from 1, we go through the extra-precision * calculations to reduce branches and gain a little accuracy. * * When |z| is near 1, we subtract 1 and use log1p() and don't * leave it to log() to subtract 1, since we gain at least 1 bit * of accuracy in this way. * * When |z| is very near 1, subtracting 1 can cancel almost * 3*MANT_DIG bits. We arrange that subtracting 1 is exact in * doubled precision, and then do the rest of the calculation * in sloppy doubled precision. Although large cancellations * often lose lots of accuracy, here the final result is exact * in doubled precision if the large calculation occurs (because * then it is exact in tripled precision and the cancellation * removes enough bits to fit in doubled precision). Thus the * result is accurate in sloppy doubled precision, and the only * significant loss of accuracy is when it is summed and passed * to log1p(). */ sh = ax2h; sl = ay2h; _2sumF(sh, sl); if (sh < 0.5 || sh >= 3) RETURNI(CMPLXL(logl(ay2l + ax2l + sl + sh) / 2, v)); sh -= 1; _2sum(sh, sl); _2sum(ax2l, ay2l); /* Briggs-Kahan algorithm (except we discard the final low term): */ _2sum(sh, ax2l); _2sum(sl, ay2l); t = ax2l + sl; _2sumF(sh, t); RETURNI(CMPLXL(log1pl(ay2l + t + sh) / 2, v)); }
Upload File
Create Folder