Lines Matching refs:divisor_
333 : char_count_(base_char_count), divisor_(1) {
334 divisor_[0] = base_divisor;
339 divisor_(next->divisor_.len() * 2) {
344 leading_zero_shift_ = CountLeadingZeros(divisor_.msd());
345 LeftShift(divisor_, divisor_, leading_zero_shift_);
353 ScratchDigits divisor_;
374 while (BitLength(level->divisor_) * 2 - 1 <= target_bit_length) {
377 processor->Multiply(level->divisor_, prev->divisor_, prev->divisor_);
382 level->divisor_.Normalize();
398 int inverse_len = divisor_.len();
400 inverse_len = dividend_length - divisor_.len();
401 DCHECK(inverse_len <= divisor_.len());
408 Digits input(divisor_, divisor_.len() - inverse_len, inverse_len);
416 int inverse_len = dividend_length - divisor_.len();
461 if (normalized.len() < level->divisor_.len()) {
474 int comparison = Compare(chunk, level->divisor_);
501 ScratchDigits right(level->divisor_.len() + 1);
503 ScratchDigits left(chunk.len() - level->divisor_.len() + 1);
506 int inverse_len = chunk.len() - level->divisor_.len();
508 processor_->DivideSchoolbook(left, right, chunk, level->divisor_);
509 } else if (level->divisor_.len() == 1) {
510 processor_->DivideSingle(left, right.digits(), chunk, level->divisor_[0]);
521 processor_->DivideBarrett(left, right, chunk, level->divisor_, inverse,
529 DCHECK(left_test.len() <= level->divisor_.len());