Lines Matching defs:len
24 // and deduced from the length {len} of the digits array.
27 void ModFn_Helper(digit_t* x, int len, signed_digit_t high) {
30 x[len - 1] = 0;
31 for (int i = 0; i < len; i++) {
37 x[len - 1] = 0;
38 for (int i = 0; i < len; i++) {
47 void ModFn(digit_t* x, int len) {
48 int K = len - 1;
51 ModFn_Helper(x, len, high);
55 ModFn_Helper(x, len, high);
57 if (high == -1) ModFn_Helper(x, len, high);
63 // {len} is length of {dest}; {src} is twice as long.
64 void ModFnDoubleWidth(digit_t* dest, const digit_t* src, int len) {
65 int K = len - 1;
72 ModFn(dest, len);
79 int len) {
82 for (int i = 0; i < len; i++) {
89 ModFn(sum, len);
90 ModFn(diff, len);
458 void FFT_ReturnShuffledThreadsafe(int start, int len, int omega,
462 void BackwardFFT(int start, int len, int omega);
463 void BackwardFFT_Threadsafe(int start, int len, int omega, digit_t* temp);
492 int len = X.len();
497 for (; i < n_ && len > 0; i++, current_theta += theta) {
498 chunk_size = std::min(chunk_size, len);
499 // For invocations via MultiplyFFT_Inner, X.len() == n_ * chunk_size + 1,
504 if (i == n_ - 1 && len == chunk_size + 1) {
518 len -= chunk_size;
520 DCHECK(len == 0);
530 int len = X.len();
531 if (len > n_ * chunk_size / 2) {
542 len -= chunk_size;
544 for (; i < nhalf && len > 0; i++) {
545 chunk_size = std::min(chunk_size, len);
550 len -= chunk_size;
563 void FFTContainer::FFT_ReturnShuffledThreadsafe(int start, int len, int omega,
565 DCHECK((len & 1) == 0); // {len} must be even.
566 int half = len / 2;
589 void FFTContainer::BackwardFFT(int start, int len, int omega) {
590 BackwardFFT_Threadsafe(start, len, omega, temp_);
593 void FFTContainer::BackwardFFT_Threadsafe(int start, int len, int omega,
595 DCHECK((len & 1) == 0); // {len} must be even.
596 int half = len / 2;
606 int w = omega * (len - k);
625 for (; j < length_ && zi < Z.len(); j++, zi++) {
632 DCHECK(zi < Z.len());
660 int remaining_z = Z.len() - z_index;
770 int m = GetParameters(X.len() + Y.len(), ¶ms);