Lines Matching defs:bits_shift
95 int bits_shift, int K) {
113 if (bits_shift == 0) {
126 input[K - digit_shift - 1] >> (kDigitBits - bits_shift);
129 digit_t summand = (d << bits_shift) | input_carry;
131 input_carry = d >> (kDigitBits - bits_shift);
136 digit_t iK_part = (d << bits_shift) | input_carry;
137 digit_t iK_carry = d >> (kDigitBits - bits_shift);
143 digit_t i0_part = d << bits_shift;
145 input_carry = d >> (kDigitBits - bits_shift);
148 digit_t subtrahend = (d << bits_shift) | input_carry;
151 input_carry = d >> (kDigitBits - bits_shift);
156 digit_t subtrahend = (d << bits_shift) | input_carry;
158 input_carry = d >> (kDigitBits - bits_shift);
190 int bits_shift = power_of_two % kDigitBits;
196 return ShiftModFn_Large(result, input, digit_shift, bits_shift, K);
199 if (bits_shift == 0) {
228 // Same flow as before, but taking bits_shift != 0 into account.
236 result[i + digit_shift] = (d << bits_shift) | carry;
237 carry = d >> (kDigitBits - bits_shift);
250 digit_sub2(0, (d << bits_shift) | carry, borrow, &borrow);
251 carry = d >> (kDigitBits - bits_shift);
267 result[digit_shift], (d << bits_shift) | carry, borrow, &borrow);
269 DCHECK((d >> (kDigitBits - bits_shift)) == 0);