• Home
  • Raw
  • Download

Lines Matching refs:used_digits_

48     : bigits_(bigits_buffer_, kBigitCapacity), used_digits_(0), exponent_(0) {  in Bignum()
69 used_digits_ = 1; in AssignUInt16()
85 used_digits_ = needed_bigits; in AssignUInt64()
92 for (int i = 0; i < other.used_digits_; ++i) { in AssignBignum()
96 for (int i = other.used_digits_; i < used_digits_; ++i) { in AssignBignum()
99 used_digits_ = other.used_digits_; in AssignBignum()
160 used_digits_ = needed_bigits - 1; in AssignHexString()
168 bigits_[used_digits_] = most_significant_bigit; in AssignHexString()
169 used_digits_++; in AssignHexString()
207 for (int i = 0; i < other.used_digits_; ++i) { in AddBignum()
220 used_digits_ = Max(bigit_pos, used_digits_); in AddBignum()
236 for (i = 0; i < other.used_digits_; ++i) { in SubtractBignum()
253 if (used_digits_ == 0) return; in ShiftLeft()
256 EnsureCapacity(used_digits_ + 1); in ShiftLeft()
267 if (used_digits_ == 0) return; in MultiplyByUInt32()
273 for (int i = 0; i < used_digits_; ++i) { in MultiplyByUInt32()
279 EnsureCapacity(used_digits_ + 1); in MultiplyByUInt32()
280 bigits_[used_digits_] = carry & kBigitMask; in MultiplyByUInt32()
281 used_digits_++; in MultiplyByUInt32()
297 for (int i = 0; i < used_digits_; ++i) { in MultiplyByUInt64()
306 EnsureCapacity(used_digits_ + 1); in MultiplyByUInt64()
307 bigits_[used_digits_] = carry & kBigitMask; in MultiplyByUInt64()
308 used_digits_++; in MultiplyByUInt64()
335 if (used_digits_ == 0) return; in MultiplyByPowerOfTen()
356 int product_length = 2 * used_digits_; in Square()
371 if ((1 << (2 * (kChunkSize - kBigitSize))) <= used_digits_) { in Square()
376 int copy_offset = used_digits_; in Square()
377 for (int i = 0; i < used_digits_; ++i) { in Square()
381 for (int i = 0; i < used_digits_; ++i) { in Square()
397 for (int i = used_digits_; i < product_length; ++i) { in Square()
398 int bigit_index1 = used_digits_ - 1; in Square()
402 while (bigit_index2 < used_digits_) { in Square()
420 used_digits_ = product_length; in Square()
503 ASSERT(other.used_digits_ > 0); in DivideModuloIntBignum()
521 ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16)); in DivideModuloIntBignum()
522 ASSERT(bigits_[used_digits_ - 1] < 0x10000); in DivideModuloIntBignum()
525 result += static_cast<uint16_t>(bigits_[used_digits_ - 1]); in DivideModuloIntBignum()
526 SubtractTimes(other, bigits_[used_digits_ - 1]); in DivideModuloIntBignum()
534 Chunk this_bigit = bigits_[used_digits_ - 1]; in DivideModuloIntBignum()
535 Chunk other_bigit = other.bigits_[other.used_digits_ - 1]; in DivideModuloIntBignum()
537 if (other.used_digits_ == 1) { in DivideModuloIntBignum()
540 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; in DivideModuloIntBignum()
591 if (used_digits_ == 0) { in ToHexString()
599 SizeInHexChars(bigits_[used_digits_ - 1]) + 1; in ToHexString()
608 for (int i = 0; i < used_digits_ - 1; ++i) { in ToHexString()
616 Chunk most_significant_bigit = bigits_[used_digits_ - 1]; in ToHexString()
688 while (used_digits_ > 0 && bigits_[used_digits_ - 1] == 0) { in Clamp()
689 used_digits_--; in Clamp()
691 if (used_digits_ == 0) { in Clamp()
699 return used_digits_ == 0 || bigits_[used_digits_ - 1] != 0; in IsClamped()
704 for (int i = 0; i < used_digits_; ++i) { in Zero()
707 used_digits_ = 0; in Zero()
721 EnsureCapacity(used_digits_ + zero_digits); in Align()
722 for (int i = used_digits_ - 1; i >= 0; --i) { in Align()
728 used_digits_ += zero_digits; in Align()
730 ASSERT(used_digits_ >= 0); in Align()
740 for (int i = 0; i < used_digits_; ++i) { in BigitsShiftLeft()
746 bigits_[used_digits_] = carry; in BigitsShiftLeft()
747 used_digits_++; in BigitsShiftLeft()
762 for (int i = 0; i < other.used_digits_; ++i) { in SubtractTimes()
770 for (int i = other.used_digits_ + exponent_diff; i < used_digits_; ++i) { in SubtractTimes()