/freebsd-current/contrib/arm-optimized-routines/pl/math/ |
H A D | log1p_2u.c | 34 /* log1p approximation using polynomial on reduced interval. Largest 38 log1p(-0x1.2e1aea97b3e5cp-2) got -0x1.65fb8659a2f9p-2 41 log1p (double x) function 53 /* x == -0 => log1p(x) = -0. 54 x == Inf => log1p(x) = Inf. */ 59 /* x == -1 => log1p(x) = -Inf. */ 65 /* x == +/-NaN => log1p(x) = NaN. */ 68 /* x < -1 => log1p(x) = NaN. 69 x == -Inf => log1p(x) = NaN. */ 75 log1p( [all...] |
H A D | sv_log1pf_1u3.c | 41 svfloat32_t SV_NAME_F1 (log1p) (svfloat32_t x, svbool_t pg) function 50 log1p(x) = log(t) + log(2^k) = log1p(m) + k*log(2). 52 We approximate log1p(m) with a polynomial, then scale by 92 PL_SIG (SV, F, 1, log1p, -0.9, 10.0) 93 PL_TEST_ULP (SV_NAME_F1 (log1p), 0.77) 94 PL_TEST_SYM_INTERVAL (SV_NAME_F1 (log1p), 0, 0x1p-23, 5000) 95 PL_TEST_SYM_INTERVAL (SV_NAME_F1 (log1p), 0x1p-23, 1, 5000) 96 PL_TEST_INTERVAL (SV_NAME_F1 (log1p), 1, inf, 10000) 97 PL_TEST_INTERVAL (SV_NAME_F1 (log1p), [all...] |
H A D | v_log1p_2u5.c | 46 return v_call_f64 (log1p, x, y, special); 49 /* Vector log1p approximation using polynomial on reduced interval. Routine is 50 a modification of the algorithm used in scalar log1p, with no shortcut for 54 VPCS_ATTR float64x2_t V_NAME_D1 (log1p) (float64x2_t x) function 72 log1p(x) = k*log(2) + log1p(f). 76 c << m: at very small x, log1p(x) ~ x, hence: 79 We therefore calculate log1p(x) by k*log2 + log1p(f) + c/m. */ 101 /* Approximate log1p( [all...] |
H A D | sv_log1p_2u5.c | 44 return sv_call_f64 (log1p, x, y, special); 47 /* Vector approximation for log1p using polynomial on reduced interval. Maximum 51 svfloat64_t SV_NAME_D1 (log1p) (svfloat64_t x, svbool_t pg) function 61 log1p(x) = k*log(2) + log1p(f). 65 c << m: at very small x, log1p(x) ~ x, hence: 68 We therefore calculate log1p(x) by k*log2 + log1p(f) + c/m. */ 90 /* Approximate log1p(x) on the reduced input using a polynomial. Because 91 log1p( [all...] |
H A D | acosh_3u.c | 21 log1p (double); 38 0 <= x <= 2: Calculate the result using log1p. For x < 1, acosh(x) is 57 return log1p (xm1 + sqrt (2 * xm1 + xm1 * xm1));
|
H A D | v_log1pf_2u1.c | 61 VPCS_ATTR float32x4_t V_NAME_F1 (log1p) (float32x4_t x) function 81 log1p(x) = log(t) + log(2^k) = log1p(m) + k*log(2). 83 We approximate log1p(m) with a polynomial, then scale by 120 PL_SIG (V, F, 1, log1p, -0.9, 10.0) 121 PL_TEST_ULP (V_NAME_F1 (log1p), 1.53) 122 PL_TEST_EXPECT_FENV (V_NAME_F1 (log1p), WANT_SIMD_EXCEPT) 123 PL_TEST_SYM_INTERVAL (V_NAME_F1 (log1p), 0.0, 0x1p-23, 30000) 124 PL_TEST_SYM_INTERVAL (V_NAME_F1 (log1p), 0x1p-23, 1, 50000) 125 PL_TEST_INTERVAL (V_NAME_F1 (log1p), [all...] |
H A D | log1pf_2u1.c | 52 scheme. Our polynomial approximation for log1p has the form 91 /* |x| < TinyBound => log1p(x) = x. 111 log1p(x) = log(t) + log(2^k) = log1p(m) + k*log(2). 113 We approximate log1p(m) with a polynomial, then scale by 156 PL_SIG (S, F, 1, log1p, -0.9, 10.0)
|
/freebsd-current/lib/msun/src/ |
H A D | e_atanh.c | 19 * atanh(x) = --- * log(1 + -------) = 0.5 * log1p(2 * --------) 23 * atanh(x) = 0.5*log1p(2x+2x*x/(1-x)) 56 t = 0.5*log1p(t+t*x/(one-x)); 58 t = 0.5*log1p((x+x)/(one-x));
|
H A D | s_asinh.c | 20 * := sign(x)*log1p(|x| + x^2/(1 + sqrt(1+x^2))) 51 w =log1p(fabs(x)+t/(one+sqrt(one+t)));
|
H A D | e_acosh.c | 21 * acosh(x) := log1p(t+sqrt(2.0*t+t*t)); where t=x-1. 58 return log1p(t+sqrt(2.0*t+t*t));
|
H A D | s_log1p.c | 12 /* double log1p(double x) 26 * 2. Approximation of log1p(f). 44 * log1p(f) = f - (hfsq - s*(hfsq+R)). 46 * 3. Finally, log1p(x) = k*ln2 + log1p(f). 53 * log1p(x) is NaN with signal if x < -1 (including -INF) ; 54 * log1p(+INF) is +INF; log1p(-1) is -INF with signal; 55 * log1p(NaN) is that NaN with no signal. 68 * algorithm can be used to compute log1p( 98 log1p(double x) function [all...] |
H A D | s_clog.c | 75 return (CMPLX(log1p(ay * ay) / 2, v)); 118 * When |z| is near 1, we subtract 1 and use log1p() and don't 132 * to log1p(). 147 return (CMPLX(log1p(ay2l + t + sh) / 2, v));
|
H A D | catrig.c | 107 * log(A + sqrt(A*A-1)) = log1p((A-1) + sqrt((A-1)*(A+1))) 174 * rx = log1p(Am1 + sqrt(Am1*(A+1))) 188 *rx = log1p(Am1 + sqrt(Am1 * (A + 1))); 199 *rx = log1p((y - 1) + sqrt((y - 1) * (y + 1))); 560 * = log1p(4*x / |z-1|^2) / 4 621 rx = log1p(4 * ax / sum_squares(ax - 1, ay)) / 4;
|
H A D | math.h | 286 double log1p(double);
|
/freebsd-current/contrib/llvm-project/libcxx/include/__math/ |
H A D | logarithms.h | 72 // log1p 74 inline _LIBCPP_HIDE_FROM_ABI float log1p(float __x) _NOEXCEPT { return __builtin_log1pf(__x); } 77 _LIBCPP_HIDE_FROM_ABI double log1p(double __x) _NOEXCEPT { 81 inline _LIBCPP_HIDE_FROM_ABI long double log1p(long double __x) _NOEXCEPT { return __builtin_log1pl(__x); } 84 inline _LIBCPP_HIDE_FROM_ABI double log1p(_A1 __x) _NOEXCEPT {
|
/freebsd-current/lib/msun/tests/ |
H A D | logarithm_test.c | 87 test(log1p, x, result, exceptmask, excepts); \ 173 /* log1p(-0.0) == -0.0 even when rounding upwards */ 215 * On ld128 platforms the log1p() implementation provides less accuracy, 234 test_tol(log1p, tests[i].x - 1, tests[i].logex, 254 test_tol(log1p, 0x0.3333333333333p0, 261 test_tol(log1p, -0x0.3333333333333p0,
|
/freebsd-current/contrib/llvm-project/clang/lib/Headers/ |
H A D | __clang_cuda_math_forward_declares.h | 126 __DEVICE__ double log1p(double); 127 __DEVICE__ float log1p(float); 246 using ::log1p;
|
H A D | __clang_cuda_cmath.h | 280 __CUDA_CLANG_FN_INTEGER_OVERLOAD_1(double, log1p) 410 using ::log1p;
|
H A D | tgmath.h | 938 // log1p 946 __tg_log1p(double __x) {return log1p(__x);} 952 #undef log1p macro 953 #define log1p(__x) __tg_log1p(__tg_promote1((__x))(__x)) macro
|
/freebsd-current/contrib/netbsd-tests/lib/libm/ |
H A D | t_log.c | 236 * log1p(3) 241 atf_tc_set_md_var(tc, "descr", "Test log1p(NaN) == NaN"); 249 ATF_CHECK(isnan(log1p(x)) != 0); 255 atf_tc_set_md_var(tc, "descr", "Test log1p(-Inf) == NaN"); 261 const double y = log1p(x); 265 atf_tc_fail("log1p(-Inf) != NaN"); 272 atf_tc_set_md_var(tc, "descr", "Test log1p(+Inf) == +Inf"); 279 ATF_CHECK(log1p(x) == x); 285 atf_tc_set_md_var(tc, "descr", "Test log1p(-1.0) == -HUGE_VAL"); 290 const double x = log1p( [all...] |
/freebsd-current/include/ |
H A D | tgmath.h | 185 #define log1p(x) __tg_simple(x, log1p) macro
|
/freebsd-current/contrib/llvm-project/libcxx/modules/std.compat/ |
H A D | cmath.inc | 98 using ::log1p;
|
/freebsd-current/contrib/llvm-project/libcxx/include/ |
H A D | math.h | 224 floating_point log1p (arithmetic x); 477 using std::__math::log1p;
|
/freebsd-current/tools/regression/include/tgmath/ |
H A D | tgmath.c | 131 TGMACRO_REAL(log1p) 544 PRINT("log1p", 545 PASS_REAL_ARG_REAL_RET(log1p));
|
/freebsd-current/contrib/arm-optimized-routines/pl/math/include/ |
H A D | mathlib.h | 48 double log1p (double);
|