Searched refs:log2n (Results 1 – 4 of 4) sorted by relevance
12 s32 log2n = -1; in log_2_n_round_up() local16 log2n++; in log_2_n_round_up()21 return log2n + 1; /* not power of 2 - round up */ in log_2_n_round_up()23 return log2n; /* power of 2 */ in log_2_n_round_up()28 s32 log2n = -1; in log_2_n_round_down() local32 log2n++; in log_2_n_round_down()36 return log2n; in log_2_n_round_down()
50 mpd_size_t log2n, C, R; in six_step_fnt() local65 log2n = mpd_bsr(n); in six_step_fnt()66 C = ((mpd_size_t)1) << (log2n / 2); /* number of columns */ in six_step_fnt()67 R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */ in six_step_fnt()135 mpd_size_t log2n, C, R; in inv_six_step_fnt() local150 log2n = mpd_bsr(n); in inv_six_step_fnt()151 C = ((mpd_size_t)1) << (log2n / 2); /* number of columns */ in inv_six_step_fnt()152 R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */ in inv_six_step_fnt()
221 int log2n = n.bitLength(); in calculateE() local225 if (log2n < messageBitLength) in calculateE()227 e = e.shiftRight(messageBitLength - log2n); in calculateE()
223 int log2n = n.bitLength(); in calculateE() local227 if (log2n < messageBitLength) in calculateE()229 e = e.shiftRight(messageBitLength - log2n); in calculateE()