Home
last modified time | relevance | path

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

/freebsd/sys/contrib/openzfs/module/lua/
H A Dlobject.c51 static const lu_byte log_2[256] = { in luaO_ceillog2() local
64 return l + log_2[x]; in luaO_ceillog2()
/freebsd/contrib/lua/src/
H A Dlobject.c36 static const lu_byte log_2[256] = { /* log_2[i] = ceil(log2(i - 1)) */ in luaO_ceillog2() local
49 return l + log_2[x]; in luaO_ceillog2()
/freebsd/crypto/openssl/crypto/rsa/
H A Drsa_lib.c226 static const unsigned int log_2 = 0x02c5c8; /* scale * log(2) */ variable
364 x = n * (uint64_t)log_2; in ossl_ifc_ffc_compute_security_bits()
367 / log_2); in ossl_ifc_ffc_compute_security_bits()
/freebsd/sys/contrib/alpine-hal/
H A Dal_hal_udma_regs_s2m.h119 uint32_t log_2; member
H A Dal_hal_udma_debug.c96 AL_UDMA_PRINT_REG(udma, " ", "\n", m2s, m2s, log_2); in al_udma_regs_m2s_general_print()
266 AL_UDMA_PRINT_REG(udma, " ", "\n", s2m, s2m, log_2); in al_udma_regs_s2m_general_print()
H A Dal_hal_udma_regs_m2s.h117 uint32_t log_2; member
/freebsd/contrib/bc/manuals/
H A 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
/freebsd/contrib/llvm-project/llvm/lib/Target/Lanai/
H A DLanaiInstrInfo.td253 def LOG2 : InstLanai<(outs), (ins), "log_2", []>;
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.in2614 …abstract = "The average asymptotic number of comparisons needed is shown to be $! n log_2 (n)$…