Lines Matching refs:kBigitSize
27 DCHECK_GE(kBigitSize, BitSize(value));
43 int needed_bigits = kUInt64Size / kBigitSize + 1;
47 value = value >> kBigitSize;
115 int needed_bigits = length * 4 / kBigitSize + 1;
121 for (int j = 0; j < kBigitSize / 4; j++) {
176 carry = sum >> kBigitSize;
183 carry = sum >> kBigitSize;
220 exponent_ += shift_amount / kBigitSize;
221 int local_shift = shift_amount % kBigitSize;
235 // The product of a bigit with the factor is of size kBigitSize + 32.
237 DCHECK_GE(kDoubleChunkSize, kBigitSize + 32 + 1);
242 carry = (product >> kBigitSize);
248 carry >>= kBigitSize;
259 DCHECK_LT(kBigitSize, 32);
268 carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
269 (product_high << (32 - kBigitSize));
275 carry >>= kBigitSize;
337 if ((1 << (2 * (kChunkSize - kBigitSize))) <= used_digits_) {
361 accumulator >>= kBigitSize;
379 accumulator >>= kBigitSize;
416 EnsureCapacity(final_size / kBigitSize + 2);
487 DCHECK(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16));
544 DCHECK_EQ(kBigitSize % 4, 0);
545 const int kHexCharsPerBigit = kBigitSize / 4;
635 borrow <<= kBigitSize;
693 DCHECK_LT(shift_amount, kBigitSize);
697 Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount);
732 (remove >> kBigitSize));
