/freebsd-current/contrib/one-true-awk/testdir/ |
H A D | t.f.x | 1 $1>0 {print $1, sqrt($1)}
|
H A D | t.j.x | 1 {i=i+sqrt($1); print i,sqrt($1)} 2 END {print sqrt(i),i}
|
/freebsd-current/lib/msun/amd64/ |
H A D | e_sqrt.S | 28 ENTRY(sqrt) 31 END(sqrt)
|
/freebsd-current/lib/msun/i387/ |
H A D | e_sqrt.S | 37 ENTRY(sqrt) 41 END(sqrt)
|
/freebsd-current/libexec/rtld-elf/tests/libpythagoras/ |
H A D | pythagoras.c | 39 return (sqrt(pow(a, 2) + pow(b, 2)));
|
/freebsd-current/contrib/bc/scripts/ |
H A D | sqrt_int_guess.bc | 44 t1 = sqrt(1/(3*i)) 83 t3 = sqrt(5/(3*i)) 91 if (!good) sqrt(-1)
|
H A D | sqrt_frac_guess.bc | 50 t1 = sqrt(1/(3*i)) 119 t3 = sqrt(5/(3*i)) 123 if (!good) sqrt(-1)
|
/freebsd-current/contrib/bc/tests/bc/scripts/ |
H A D | globals.bc | 4 sqrt(-1)
|
/freebsd-current/contrib/ntp/scripts/stats/ |
H A D | loop.awk | 39 loop_time_rms = sqrt(loop_time_rms / loop_count - loop_time * loop_time) 41 loop_freq_rms = sqrt(loop_freq_rms / loop_count - loop_freq * loop_freq)
|
H A D | clock.awk | 318 arb_rms = sqrt(arb_rms / arbn - arb_mean * arb_mean) 319 arb_var = sqrt(arb_var / (2 * (arbn - 1))) 337 ensemble_rms = sqrt(ensemble_rms / ensemble_count - ensemble_mean * ensemble_mean) * 1e9 394 itf_rms = sqrt(itf_rms / itf_count - itf_mean * itf_mean) * 1e9 395 itf_var = sqrt(itf_var / (2 * (itf_count - 1))) 410 etf_rms = sqrt(etf_rms / etf_count - etf_mean * etf_mean) 411 etf_var = sqrt(etf_var / (2 * (etf_count - 1)))
|
H A D | psummary.awk | 79 peer_var[i] = sqrt(peer_var[i] / peer_count[i])
|
H A D | etf.S | 7 std<-sqrt(var(r$residuals))
|
/freebsd-current/contrib/llvm-project/libcxx/include/__math/ |
H A D | roots.h | 24 // sqrt 26 inline _LIBCPP_HIDE_FROM_ABI float sqrt(float __x) _NOEXCEPT { return __builtin_sqrtf(__x); } 29 _LIBCPP_HIDE_FROM_ABI double sqrt(double __x) _NOEXCEPT { 33 inline _LIBCPP_HIDE_FROM_ABI long double sqrt(long double __x) _NOEXCEPT { return __builtin_sqrtl(__x); } 36 inline _LIBCPP_HIDE_FROM_ABI double sqrt(_A1 __x) _NOEXCEPT {
|
/freebsd-current/contrib/arm-optimized-routines/pl/math/ |
H A D | acosh_3u.c | 25 acosh(x) = ln(x + sqrt(x * x - 1)). 27 x >= 2^511: We cannot square x without overflow. For huge x, sqrt(x*x - 1) is 54 return optr_aor_log_f64 (x + sqrt (x * x - 1)); 57 return log1p (xm1 + sqrt (2 * xm1 + xm1 * xm1));
|
/freebsd-current/lib/msun/src/ |
H A D | s_asinh.c | 15 * asinh(x) = sign(x) * log [ |x| + sqrt(x*x+1) ] 19 * := sign(x)*log(2|x|+1/(|x|+sqrt(x*x+1))) if|x|>2, else 20 * := sign(x)*log1p(|x| + x^2/(1 + sqrt(1+x^2))) 48 w = log(2.0*t+one/(sqrt(x*x+one)+t)); 51 w =log1p(fabs(x)+t/(one+sqrt(one+t)));
|
H A D | e_acosh.c | 17 * acosh(x) = log [ x + sqrt(x*x-1) ] 20 * acosh(x) := log(2x-1/(sqrt(x*x-1)+x)) if x>2; else 21 * acosh(x) := log1p(t+sqrt(2.0*t+t*t)); where t=x-1. 55 return log(2.0*x-one/(x+sqrt(t-one))); 58 return log1p(t+sqrt(2.0*t+t*t));
|
H A D | s_csqrtf.c | 75 t = sqrt((a + hypot(a, b)) * 0.5); 78 t = sqrt((-a + hypot(a, b)) * 0.5);
|
H A D | e_sqrt.c | 20 sqrt(double x) function 25 /* sqrt(x) 26 * Return correctly rounded sqrt. 28 * | Use the hardware sqrt if you have one | 35 * sqrt(x) = 2^k * sqrt(y) 37 * Let q = sqrt(y) truncated to i bit after binary point (q = 1), 86 * sqrt(+-0) = +-0 ... exact 87 * sqrt(inf) = inf 88 * sqrt( 98 sqrt(double x) function [all...] |
H A D | s_csqrt.c | 35 /* For avoiding overflow for components >= DBL_MAX / (1 + sqrt(2)). */ 98 t = sqrt((a + hypot(a, b)) * 0.5); 102 t = sqrt((-a + hypot(a, b)) * 0.5);
|
H A D | catrig.c | 47 FOUR_SQRT_MIN = 0x1p-509, /* >= 4 * sqrt(DBL_MIN) */ 48 QUARTER_SQRT_MAX = 0x1p509, /* <= sqrt(DBL_MAX) / 4 */ 55 SQRT_MIN = 0x1p-511; /* >= sqrt(DBL_MIN) */ 92 * casinh(z) = sign(x)*log(A+sqrt(A*A-1)) + I*asin(B) 107 * log(A + sqrt(A*A-1)) = log1p((A-1) + sqrt((A-1)*(A+1))) 110 * asin(B) = atan2(y, sqrt(A*A - y*y)) = atan2(y, sqrt((A+y)*(A-y))) 147 * If B_is_usable is set to 0, sqrt_A2my2 = sqrt(A*A - y*y), and new_y = y. 174 * rx = log1p(Am1 + sqrt(Am [all...] |
H A D | e_acos.c | 20 * acos(x) = pi/2 - (pi/2 - 2asin(sqrt((1-x)/2))) 21 * = 2asin(sqrt((1-x)/2)) 22 * = 2s + 2s*z*R(z) ...z=(1-x)/2, s=sqrt(z) 25 * for f so that f+c ~ sqrt(z). 27 * acos(x) = pi - 2asin(sqrt((1-|x|)/2)) 28 * = pi - 0.5*(s+s*z*R(z)), where z=(1-|x|)/2,s=sqrt(z) 34 * Function needed: sqrt 87 s = sqrt(z); 93 s = sqrt(z);
|
H A D | e_hypot.c | 17 * has error less than sqrt(2)/2 ulp, than 18 * sqrt(z) has error less than 1 ulp (exercise). 20 * So, compute sqrt(x*x+y*y) with some care as 41 * hypot(x,y) returns sqrt(x^2+y^2) with error less 105 w = sqrt(t1*t1-(b*(-b)-t2*(a+t1))); 114 w = sqrt(t1*y1-(w*(-w)-(t1*y2+t2*b)));
|
/freebsd-current/sys/tools/sound/ |
H A D | feeder_eq_mkfilter.awk | 93 A = sqrt(pow(10, gain / 20.0)); 103 alpha = sin(w0) * 0.5 * sqrt(A + ((1.0 / A) * \ 142 b0 = A*((A+1.0)+((A-1.0)*cos(w0))+(2.0*sqrt(A)*alpha)); 144 b2 = A*((A+1.0)+((A-1.0)*cos(w0))-(2.0*sqrt(A)*alpha)); 145 a0 = (A+1.0)-((A-1.0)*cos(w0))+(2.0*sqrt(A)*alpha ); 147 a2 = (A+1.0)-((A-1.0)*cos(w0))-(2.0*sqrt(A)*alpha ); 176 b0 = A*((A+1.0)-((A-1.0)*cos(w0))+(2.0*sqrt(A)*alpha)); 178 b2 = A*((A+1.0)-((A-1.0)*cos(w0))-(2.0*sqrt(A)*alpha)); 179 a0 = (A+1.0)+((A-1.0)*cos(w0))+(2.0*sqrt(A)*alpha ); 181 a2 = (A+1.0)+((A-1.0)*cos(w0))-(2.0*sqrt( [all...] |
/freebsd-current/contrib/netbsd-tests/lib/libm/ |
H A D | t_sqrt.c | 40 * sqrt(3) 45 atf_tc_set_md_var(tc, "descr", "Test sqrt(NaN) == NaN"); 53 ATF_CHECK(isnan(sqrt(x)) != 0); 59 atf_tc_set_md_var(tc, "descr", "Test sqrt(3) vs. pow(3)"); 69 double x_sqrt = sqrt(x[i]); 80 atf_tc_fail_nonfatal("sqrt(%.17g) = %.17g != " 90 atf_tc_set_md_var(tc, "descr", "Test sqrt(-Inf) == NaN"); 96 double y = sqrt(x); 104 atf_tc_set_md_var(tc, "descr", "Test sqrt(+Inf) == +Inf"); 110 double y = sqrt( [all...] |
/freebsd-current/contrib/bc/vs/tests/ |
H A D | tests_dc.bat | 33 sqrt
|