• Home
  • Raw
  • Download

Lines Matching refs:used_digits_

37     : bigits_(bigits_buffer_, kBigitCapacity), used_digits_(0), exponent_(0) {  in Bignum()
57 used_digits_ = 1; in AssignUInt16()
73 used_digits_ = needed_bigits; in AssignUInt64()
80 for (int i = 0; i < other.used_digits_; ++i) { in AssignBignum()
84 for (int i = other.used_digits_; i < used_digits_; ++i) { in AssignBignum()
87 used_digits_ = other.used_digits_; in AssignBignum()
149 used_digits_ = needed_bigits - 1; in AssignHexString()
157 bigits_[used_digits_] = most_significant_bigit; in AssignHexString()
158 used_digits_++; in AssignHexString()
196 for (int i = 0; i < other.used_digits_; ++i) { in AddBignum()
209 used_digits_ = Max(bigit_pos, used_digits_); in AddBignum()
225 for (i = 0; i < other.used_digits_; ++i) { in SubtractBignum()
242 if (used_digits_ == 0) return; in ShiftLeft()
245 EnsureCapacity(used_digits_ + 1); in ShiftLeft()
256 if (used_digits_ == 0) return; in MultiplyByUInt32()
262 for (int i = 0; i < used_digits_; ++i) { in MultiplyByUInt32()
268 EnsureCapacity(used_digits_ + 1); in MultiplyByUInt32()
269 bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask); in MultiplyByUInt32()
270 used_digits_++; in MultiplyByUInt32()
286 for (int i = 0; i < used_digits_; ++i) { in MultiplyByUInt64()
295 EnsureCapacity(used_digits_ + 1); in MultiplyByUInt64()
296 bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask); in MultiplyByUInt64()
297 used_digits_++; in MultiplyByUInt64()
324 if (used_digits_ == 0) return; in MultiplyByPowerOfTen()
345 int product_length = 2 * used_digits_; in Square()
360 if ((1 << (2 * (kChunkSize - kBigitSize))) <= used_digits_) { in Square()
365 int copy_offset = used_digits_; in Square()
366 for (int i = 0; i < used_digits_; ++i) { in Square()
370 for (int i = 0; i < used_digits_; ++i) { in Square()
386 for (int i = used_digits_; i < product_length; ++i) { in Square()
387 int bigit_index1 = used_digits_ - 1; in Square()
391 while (bigit_index2 < used_digits_) { in Square()
409 used_digits_ = product_length; in Square()
492 ASSERT(other.used_digits_ > 0); in DivideModuloIntBignum()
510 ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16)); in DivideModuloIntBignum()
513 result += bigits_[used_digits_ - 1]; in DivideModuloIntBignum()
514 SubtractTimes(other, bigits_[used_digits_ - 1]); in DivideModuloIntBignum()
522 Chunk this_bigit = bigits_[used_digits_ - 1]; in DivideModuloIntBignum()
523 Chunk other_bigit = other.bigits_[other.used_digits_ - 1]; in DivideModuloIntBignum()
525 if (other.used_digits_ == 1) { in DivideModuloIntBignum()
528 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; in DivideModuloIntBignum()
577 if (used_digits_ == 0) { in ToHexString()
585 SizeInHexChars(bigits_[used_digits_ - 1]) + 1; in ToHexString()
594 for (int i = 0; i < used_digits_ - 1; ++i) { in ToHexString()
602 Chunk most_significant_bigit = bigits_[used_digits_ - 1]; in ToHexString()
674 while (used_digits_ > 0 && bigits_[used_digits_ - 1] == 0) { in Clamp()
675 used_digits_--; in Clamp()
677 if (used_digits_ == 0) { in Clamp()
685 return used_digits_ == 0 || bigits_[used_digits_ - 1] != 0; in IsClamped()
690 for (int i = 0; i < used_digits_; ++i) { in Zero()
693 used_digits_ = 0; in Zero()
707 EnsureCapacity(used_digits_ + zero_digits); in Align()
708 for (int i = used_digits_ - 1; i >= 0; --i) { in Align()
714 used_digits_ += zero_digits; in Align()
716 ASSERT(used_digits_ >= 0); in Align()
726 for (int i = 0; i < used_digits_; ++i) { in BigitsShiftLeft()
732 bigits_[used_digits_] = carry; in BigitsShiftLeft()
733 used_digits_++; in BigitsShiftLeft()
748 for (int i = 0; i < other.used_digits_; ++i) { in SubtractTimes()
757 for (int i = other.used_digits_ + exponent_diff; i < used_digits_; ++i) { in SubtractTimes()