Lines Matching refs:length_
433 : n_(n), K_(K), length_(K + 1), processor_(processor) {
434 storage_ = new digit_t[length_ * n_];
437 for (int i = 0; i < n; i++, ptr += length_) {
440 temp_ = new digit_t[length_ * 2];
469 int length() const { return length_; }
473 const int K_; // Always length_ - 1.
474 const int length_; // Length of each part, in digits.
478 digit_t* temp_; // Temporary storage with size 2 * length_.
494 const size_t part_length_in_bytes = length_ * sizeof(digit_t);
506 DCHECK(length_ >= chunk_size + 1);
536 const size_t part_length_in_bytes = length_ * sizeof(digit_t);
568 length_);
571 length_);
604 length_);
609 length_);
625 for (; j < length_ && zi < Z.len(); j++, zi++) {
628 for (; j < length_; j++) {
661 if (ShouldBeNegative(temp_, length_, k + 1, s)) {
677 DCHECK(i == K_ && K_ == length_ - 1);
678 for (; i < length_ && i < remaining_z; i++) {
689 for (; i < length_ && i < remaining_z; i++) {
692 for (; i < length_; i++) {
729 bool use_fft = length_ >= kFftInnerThreshold && (K_ & 3) == 0;
732 RWDigits result(temp, 2 * length_);
734 Digits A(part_[i], length_);
735 Digits B(other.part_[i], length_);
742 ModFnDoubleWidth(part_[i], result.digits(), length_);
746 SumDiff(part_[i - 1], part_[i], part_[i - 1], part_[i], length_);