Lines Matching +full:32 +full:k
10 * For any k, we have (here, all division is exact; not C-style rounding):
11 * floor(ceil(2^k / d) * n / 2^k) = floor((2^k + r) / d * n / 2^k), where
12 * r = (-2^k) mod d.
15 * ... = floor(2^k / d * n / 2^k + r / d * n / 2^k)
16 * = floor(n / d + (r / d) * (n / 2^k)).
20 * ... = n / d + floor((r / d) * (n / 2^k))
23 * (r / d) * (n / 2^k) < 1.
26 * n / 2 ^ k < 1 by setting k = 32. This gets us a value of magic that works.
35 * (we would want magic = 2^32 exactly). This would mess with code gen in div_init()
36 * on 32-bit machines. in div_init()
40 uint64_t two_to_k = ((uint64_t)1 << 32); in div_init()
44 * We want magic = ceil(2^k / d), but C gives us floor. We have to in div_init()