12     : bigits_(bigits_buffer_, kBigitCapacity), used_digits_(0), exponent_(0) {  in Bignum()
14     bigits_[i] = 0;  in Bignum()
32   bigits_[0] = value;  in AssignUInt16()
46     bigits_[i] = static_cast<Chunk>(value & kBigitMask);  in AssignUInt64()
57     bigits_[i] = other.bigits_[i];  in AssignBignum()
61     bigits_[i] = 0;  in AssignBignum()
124     bigits_[i] = current_bigit;  in AssignHexString()
134     bigits_[used_digits_] = most_significant_bigit;  in AssignHexString()
174     Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;  in AddBignum()
175     bigits_[bigit_pos] = sum & kBigitMask;  in AddBignum()
181     Chunk sum = bigits_[bigit_pos] + carry;  in AddBignum()
182     bigits_[bigit_pos] = sum & kBigitMask;  in AddBignum()
204     Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow;  in SubtractBignum()
205     bigits_[i + offset] = difference & kBigitMask;  in SubtractBignum()
209     Chunk difference = bigits_[i + offset] - borrow;  in SubtractBignum()
210     bigits_[i + offset] = difference & kBigitMask;  in SubtractBignum()
240     DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;  in MultiplyByUInt32()
241     bigits_[i] = static_cast<Chunk>(product & kBigitMask);  in MultiplyByUInt32()
246     bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);  in MultiplyByUInt32()
264     uint64_t product_low = low * bigits_[i];  in MultiplyByUInt64()
265     uint64_t product_high = high * bigits_[i];  in MultiplyByUInt64()
267     bigits_[i] = static_cast<Chunk>(tmp & kBigitMask);  in MultiplyByUInt64()
273     bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);  in MultiplyByUInt64()
344     bigits_[copy_offset + i] = bigits_[i];  in Square()
354       Chunk chunk1 = bigits_[copy_offset + bigit_index1];  in Square()
355       Chunk chunk2 = bigits_[copy_offset + bigit_index2];  in Square()
360     bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask;  in Square()
369       Chunk chunk1 = bigits_[copy_offset + bigit_index1];  in Square()
370       Chunk chunk2 = bigits_[copy_offset + bigit_index2];  in Square()
378     bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask;  in Square()
487     DCHECK(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16));  in DivideModuloIntBignum()
490     result += bigits_[used_digits_ - 1];  in DivideModuloIntBignum()
491     SubtractTimes(other, bigits_[used_digits_ - 1]);  in DivideModuloIntBignum()
499   Chunk this_bigit = bigits_[used_digits_ - 1];  in DivideModuloIntBignum()
500   Chunk other_bigit = other.bigits_[other.used_digits_ - 1];  in DivideModuloIntBignum()
505     bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;  in DivideModuloIntBignum()
555       SizeInHexChars(bigits_[used_digits_ - 1]) + 1;  in ToHexString()
565     Chunk current_bigit = bigits_[i];  in ToHexString()
572   Chunk most_significant_bigit = bigits_[used_digits_ - 1];  in ToHexString()
584   return bigits_[index - exponent_];  in BigitAt()
644   while (used_digits_ > 0 && bigits_[used_digits_ - 1] == 0) {  in Clamp()
655   return used_digits_ == 0 || bigits_[used_digits_ - 1] != 0;  in IsClamped()
661     bigits_[i] = 0;  in Zero()
679       bigits_[i + zero_digits] = bigits_[i];  in Align()
682       bigits_[i] = 0;  in Align()
697     Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount);  in BigitsShiftLeft()
698     bigits_[i] = ((bigits_[i] << shift_amount) + carry) & kBigitMask;  in BigitsShiftLeft()
702     bigits_[used_digits_] = carry;  in BigitsShiftLeft()
726     DoubleChunk product = static_cast<DoubleChunk>(factor) * other.bigits_[i];  in SubtractTimes()
729         bigits_[i + exponent_diff] - static_cast<Chunk>(remove & kBigitMask);  in SubtractTimes()
730     bigits_[i + exponent_diff] = difference & kBigitMask;  in SubtractTimes()
736     Chunk difference = bigits_[i] - borrow;  in SubtractTimes()
737     bigits_[i] = difference & kBigitMask;  in SubtractTimes()