Home
last modified time | relevance | path

Searched refs:log_2 (Results 1 – 14 of 14) sorted by relevance

/external/webp/src/dsp/
Dlossless_enc_mips32.c67 double log_2; in FastLog2Slow_MIPS32() local
81 log_2 = kLog2Table[temp] + log_cnt; in FastLog2Slow_MIPS32()
87 log_2 += (double)correction / v; in FastLog2Slow_MIPS32()
89 return (float)log_2; in FastLog2Slow_MIPS32()
Dlossless_enc.c361 double log_2; in FastLog2Slow_C() local
367 log_2 = kLog2Table[v] + log_cnt; in FastLog2Slow_C()
372 log_2 += (double)correction / orig_v; in FastLog2Slow_C()
374 return (float)log_2; in FastLog2Slow_C()
/external/bc/manuals/
Dalgorithms.md22 this `bc`, is superlinear but subpolynomial (bounded by `O(n^log_2(3))`).
53 complexity of `O(n^(2*log_2(3)))` (best case) and `O(n^3)` (worst case).
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
/external/llvm/test/MC/COFF/
Dcomm-align.s7 # - that the alignment is represented as a log_2 of the alignment
/external/swiftshader/third_party/llvm-7.0/llvm/test/MC/COFF/
Dcomm-align.s7 # - that the alignment is represented as a log_2 of the alignment
/external/lua/src/
Dlobject.c66 static const lu_byte log_2[256] = { /* log_2[i] = ceil(log2(i - 1)) */ in luaO_ceillog2() local
79 return l + log_2[x]; in luaO_ceillog2()
/external/angle/extensions/
DEXT_texture_storage.txt217 is generated. If <levels> is greater than floor(log_2(width)) + 1
269 floor(log_2(width)) + 1
271 than floor(log_2(max(width, height))) + 1
309 floor(log_2(max(width, height, depth))) + 1
312 floor(log_2(max(width, height))) + 1
366 otherwise p = floor(log_2(maxsize)) + level_base. All arrays from
605 floor(log_2(width)) + 1
607 floor(log_2(max(width, height))) + 1
609 floor(log_2(max(width, height, depth))) + 1
/external/swiftshader/third_party/subzero/src/
DIceTypes.def36 /* enum value, log_2(size), align, # elts, element type, */ \
/external/tensorflow/tensorflow/lite/kernels/internal/
Dcommon.h334 const FixedPoint0 log_2 = GEMMLOWP_CHECKED_FIXEDPOINT_CONSTANT( in log_x_for_x_greater_than_or_equal_to_1_impl() local
399 return gemmlowp::Rescale<OutputIntegerBits>(z_pow_2_adj * log_2 + in log_x_for_x_greater_than_or_equal_to_1_impl()
/external/libhevc/encoder/
Dihevce_decomp_pre_intra_pass.c831 float log_2 = (float)(((u.x >> 23) & 255) - 128); in fast_log2() local
835 log_2 += ((-1.0f / 3) * u.val + 2) * u.val - 2.0f / 3; in fast_log2()
836 return log_2; in fast_log2()
/external/mesa3d/docs/gallium/
Dtgsi.rst132 dst.x &= \lfloor\log_2{|src.x|}\rfloor \\
133 dst.y &= \frac{|src.x|}{2^{\lfloor\log_2{|src.x|}\rfloor}} \\
134 dst.z &= \log_2{|src.x|} \\
342 dst = \log_2{src.x}
2979 :math:`\log_2{x}` Logarithm of `x`, base 2.
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Lanai/
DLanaiInstrInfo.td254 def LOG2 : InstLanai<(outs), (ins), "log_2", []>;
/external/llvm/lib/Target/Lanai/
DLanaiInstrInfo.td256 def LOG2 : InstLanai<(outs), (ins), "log_2", []>;
/external/one-true-awk/testdir/
Dfunstack.in2614 …abstract = "The average asymptotic number of comparisons needed is shown to be $! n log_2 (n)$…