Lines Matching refs:kBigitSize
63 ASSERT(kBigitSize >= BitSize(value));
79 int needed_bigits = kUInt64Size / kBigitSize + 1;
83 value = value >> kBigitSize;
149 int needed_bigits = length * 4 / kBigitSize + 1;
155 for (int j = 0; j < kBigitSize / 4; j++) {
210 carry = sum >> kBigitSize;
217 carry = sum >> kBigitSize;
254 exponent_ += shift_amount / kBigitSize;
255 int local_shift = shift_amount % kBigitSize;
269 // The product of a bigit with the factor is of size kBigitSize + 32.
271 ASSERT(kDoubleChunkSize >= kBigitSize + 32 + 1);
276 carry = (product >> kBigitSize);
282 carry >>= kBigitSize;
293 ASSERT(kBigitSize < 32);
302 carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
303 (product_high << (32 - kBigitSize));
309 carry >>= kBigitSize;
371 if ((1 << (2 * (kChunkSize - kBigitSize))) <= used_digits_) {
395 accumulator >>= kBigitSize;
413 accumulator >>= kBigitSize;
450 EnsureCapacity(final_size / kBigitSize + 2);
521 ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16));
588 ASSERT(kBigitSize % 4 == 0);
589 const int kHexCharsPerBigit = kBigitSize / 4;
679 borrow <<= kBigitSize;
737 ASSERT(shift_amount < kBigitSize);
741 Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount);
768 (remove >> kBigitSize));
