Lines Matching defs:bits
181 // If bits_shift is non-zero, it frees up bits, preventing overflow.
183 // Overflow cannot happen if the most significant digit has unset bits.
223 // Z := (least significant n bits of X).
226 int bits = n % kDigitBits;
232 // The MSD might contain extra bits that we don't want.
234 if (bits != 0) {
235 int drop = kDigitBits - bits;
241 // Z := 2**n - (least significant n bits of X).
244 int bits = n % kDigitBits;
254 // The MSD might contain extra bits that we don't want.
256 if (bits == 0) {
259 int drop = kDigitBits - bits;
261 digit_t minuend_msd = static_cast<digit_t>(1) << bits;
264 // If all subtracted bits were zero, we have to get rid of the
275 // Generally: decide based on number of digits, and bits in the top digit.
315 // Scan for the special case (see above): if all bits below the (n-1)th