Home
last modified time | relevance | path

Searched refs:ln2 (Results 1 – 25 of 35) sorted by relevance

12

/external/flac/src/libFLAC/ia32/
Dfixed_asm.nasm218 fldln2 ; ST = ln2 total_error_0/data_len 1.0 data_len
219 fmulp st1 ; ST = ln2*total_error_0/data_len 1.0 data_len
220 fyl2x ; ST = log2(ln2*total_error_0/data_len) data_len
221 fstp dword [ebx] ; residual_bits_per_sample[0] = log2(ln2*total_error_0/data_len) ST = data_len
234 fldln2 ; ST = ln2 total_error_1/data_len 1.0 data_len
235 fmulp st1 ; ST = ln2*total_error_1/data_len 1.0 data_len
236 fyl2x ; ST = log2(ln2*total_error_1/data_len) data_len
237 …fstp dword [ebx + 4] ; residual_bits_per_sample[1] = log2(ln2*total_error_1/data_len) ST = dat…
249 fldln2 ; ST = ln2 total_error_2/data_len 1.0 data_len
250 fmulp st1 ; ST = ln2*total_error_2/data_len 1.0 data_len
[all …]
/external/arm-optimized-routines/math/tools/
Dlog2_abs.sollya11 ln2 = evaluate(log(2),0);
12 invln2hi = double(1/ln2 + 0x1p21) - 0x1p21; // round away last 21 bits
13 invln2lo = double(1/ln2 - invln2hi);
16 f = log(1+x)/ln2;
37 //for i from 0 to 60 do { g = g + (-x)^i/(i+1)/ln2; };
Dlog2.sollya11 ln2 = evaluate(log(2),0);
12 invln2hi = double(1/ln2 + 0x1p21) - 0x1p21; // round away last 21 bits
13 invln2lo = double(1/ln2 - invln2hi);
22 f = f/ln2;
/external/llvm-project/libc/AOR_v20.02/math/tools/
Dlog2_abs.sollya12 ln2 = evaluate(log(2),0);
13 invln2hi = double(1/ln2 + 0x1p21) - 0x1p21; // round away last 21 bits
14 invln2lo = double(1/ln2 - invln2hi);
17 f = log(1+x)/ln2;
38 //for i from 0 to 60 do { g = g + (-x)^i/(i+1)/ln2; };
Dlog2.sollya12 ln2 = evaluate(log(2),0);
13 invln2hi = double(1/ln2 + 0x1p21) - 0x1p21; // round away last 21 bits
14 invln2lo = double(1/ln2 - invln2hi);
23 f = f/ln2;
/external/python/cpython2/Modules/
D_math.c22 static const double ln2 = 6.93147180559945286227E-01; variable
59 return log(x)+ln2; /* acosh(huge)=log(2x) */ in _Py_acosh()
100 w = log(absx)+ln2; in _Py_asinh()
/external/python/cpython3/Modules/
D_math.c23 static const double ln2 = 6.93147180559945286227E-01; variable
68 return log(x) + ln2; /* acosh(huge)=log(2x) */ in _Py_acosh()
111 w = log(absx) + ln2; in _Py_asinh()
/external/fdlibm/
De_acosh.c37 ln2 = 6.93147180559945286227e-01; /* 0x3FE62E42, 0xFEFA39EF */ variable
55 return __ieee754_log(x)+ln2; /* acosh(huge)=ieee_log(2x) */
Ds_asinh.c33 ln2 = 6.93147180559945286227e-01, /* 0x3FE62E42, 0xFEFA39EF */ variable
52 w = __ieee754_log(ieee_fabs(x))+ln2;
/external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/
DDfpField.java144 private final Dfp ln2; field in DfpField
217 ln2 = new Dfp(this, ln2String); in DfpField()
235 ln2 = null; in DfpField()
484 return ln2;
/external/llvm-project/libc/AOR_v20.02/math/
Dlogf_data.c30 .ln2 = 0x1.62e42fefa39efp-1,
Dlogf.c23 #define Ln2 __logf_data.ln2
Dmath_config.h324 double ln2; member
/external/arm-optimized-routines/math/
Dlogf_data.c29 .ln2 = 0x1.62e42fefa39efp-1,
Dlogf.c22 #define Ln2 __logf_data.ln2
Dmath_config.h341 double ln2; member
/external/llvm-project/libcxx/test/std/numerics/numbers/
Dillformed.verify.cpp21 int ln2{std::numbers::ln2_v<int>}; variable
Dvalue.pass.cpp46 assert(std::numbers::ln2 == 0x1.62e42fefa39efp-1); in tests()
Dspecialize.pass.cpp50 assert(d6 == std::numbers::ln2); in tests()
Ddefined.pass.cpp21 [[maybe_unused]] const double* dd6{&std::numbers::ln2}; in tests()
/external/oboe/samples/RhythmGame/third_party/glm/detail/
Dfunc_exponential.inl91 //exp2, ln2 = 0.69314718055994530941723212145818f
106 // log2, ln2 = 0.69314718055994530941723212145818f
/external/oboe/samples/RhythmGame/third_party/glm/gtx/
Dfast_exponential.inl112 //fastExp2, ln2 = 0.69314718055994530941723212145818f
125 // fastLog2, ln2 = 0.69314718055994530941723212145818f
/external/llvm-project/libcxx/include/
Dnumbers51 inline constexpr double ln2 = ln2_v<double>;
125 inline constexpr double ln2 = ln2_v<double>;
/external/javassist/src/test/javassist/
DJvstTest2.java26 int ln2 = m1.insertAt(line, "counter++;"); in testInsertAt() local
27 assertEquals(ln, ln2); in testInsertAt()
28 assertEquals(7, ln2); in testInsertAt()
32 ln2 = m1.insertAt(line, "counter++;"); in testInsertAt()
33 assertEquals(ln, ln2); in testInsertAt()
34 assertEquals(8, ln2); in testInsertAt()
/external/iw/
Dscan.c1013 int ln2 = 0; in print_11u_rcon() local
1017 ln2 = len - 2 - ln0 - ln1; in print_11u_rcon()
1045 if (ln2 > 0) { in print_11u_rcon()
1047 if (2 + ln0 + ln1 + ln2 > len) { in print_11u_rcon()
1050 for (idx = 0; idx < ln2; idx++) { in print_11u_rcon()

12