Lines Matching full:bigits_
36 : bigits_(bigits_buffer_, kBigitCapacity), used_digits_(0), exponent_(0) {
38 bigits_[i] = 0;
56 bigits_[0] = value;
70 bigits_[i] = static_cast<Chunk>(value & kBigitMask);
81 bigits_[i] = other.bigits_[i];
85 bigits_[i] = 0;
147 bigits_[i] = current_bigit;
157 bigits_[used_digits_] = most_significant_bigit;
197 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
198 bigits_[bigit_pos] = sum & kBigitMask;
204 Chunk sum = bigits_[bigit_pos] + carry;
205 bigits_[bigit_pos] = sum & kBigitMask;
227 Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow;
228 bigits_[i + offset] = difference & kBigitMask;
232 Chunk difference = bigits_[i + offset] - borrow;
233 bigits_[i + offset] = difference & kBigitMask;
263 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;
264 bigits_[i] = static_cast<Chunk>(product & kBigitMask);
269 bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);
287 uint64_t product_low = low * bigits_[i];
288 uint64_t product_high = high * bigits_[i];
290 bigits_[i] = static_cast<Chunk>(tmp & kBigitMask);
296 bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);
367 bigits_[copy_offset + i] = bigits_[i];
377 Chunk chunk1 = bigits_[copy_offset + bigit_index1];
378 Chunk chunk2 = bigits_[copy_offset + bigit_index2];
383 bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask;
392 Chunk chunk1 = bigits_[copy_offset + bigit_index1];
393 Chunk chunk2 = bigits_[copy_offset + bigit_index2];
398 // The overwritten bigits_[i] will never be read in further loop iterations,
401 bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask;
510 ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16));
513 result += bigits_[used_digits_ - 1];
514 SubtractTimes(other, bigits_[used_digits_ - 1]);
521 // bigits_[used_digits_ - 1] is safe.
522 Chunk this_bigit = bigits_[used_digits_ - 1];
523 Chunk other_bigit = other.bigits_[other.used_digits_ - 1];
528 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;
585 SizeInHexChars(bigits_[used_digits_ - 1]) + 1;
595 Chunk current_bigit = bigits_[i];
602 Chunk most_significant_bigit = bigits_[used_digits_ - 1];
614 return bigits_[index - exponent_];
674 while (used_digits_ > 0 && bigits_[used_digits_ - 1] == 0) {
685 return used_digits_ == 0 || bigits_[used_digits_ - 1] != 0;
691 bigits_[i] = 0;
709 bigits_[i + zero_digits] = bigits_[i];
712 bigits_[i] = 0;
727 Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount);
728 bigits_[i] = ((bigits_[i] << shift_amount) + carry) & kBigitMask;
732 bigits_[used_digits_] = carry;
756 DoubleChunk product = static_cast<DoubleChunk>(factor) * other.bigits_[i];
759 bigits_[i + exponent_diff] - static_cast<Chunk>(remove & kBigitMask);
760 bigits_[i + exponent_diff] = difference & kBigitMask;
766 Chunk difference = bigits_[i] - borrow;
767 bigits_[i] = difference & kBigitMask;
