Searched refs:log2n (Results 1 – 5 of 5) sorted by relevance
52 mpd_size_t log2n, C, R; in six_step_fnt() local67 log2n = mpd_bsr(n); in six_step_fnt()68 C = ((mpd_size_t)1) << (log2n / 2); /* number of columns */ in six_step_fnt()69 R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */ in six_step_fnt()137 mpd_size_t log2n, C, R; in inv_six_step_fnt() local152 log2n = mpd_bsr(n); in inv_six_step_fnt()153 C = ((mpd_size_t)1) << (log2n / 2); /* number of columns */ in inv_six_step_fnt()154 R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */ in inv_six_step_fnt()
222 int log2n = n.bitLength(); in calculateE() local226 if (log2n < messageBitLength) in calculateE()228 e = e.shiftRight(messageBitLength - log2n); in calculateE()
224 int log2n = n.bitLength(); in calculateE() local228 if (log2n < messageBitLength) in calculateE()230 e = e.shiftRight(messageBitLength - log2n); in calculateE()
25799 … connected components of an undirected graph with $n$ vertices in time $O(log2n)$. An $O(\log_2n)$…