Lines Matching defs:bits
21 * Only one instruction in a pair may be a shift (by more than 3 bits),
23 * to 3 bits) may be paired arbitrarily.
68 * you can see the non-zero bits are divided into several well-separated
76 * Using just two large blocks, 0xC3910C8D << 31 in the high bits,
77 * and 0xB583EB in the low bits, produces as good an algorithm as any,
80 * The high bits are a larger number and more work to compute, as well
81 * as needing one extra cycle to shift left 31 bits before the final
82 * addition, so they are the critical path for scheduling. The low bits
118 hash_64(u64 a, unsigned int bits)
126 if (!__builtin_constant_p(bits))
127 asm("" : "=q" (bits) : "0" (64 - bits));
129 bits = 64 - bits;
141 return a >> bits;