Lines Matching refs:half
460 void FFT_Recurse(int start, int half, int omega, digit_t* temp);
527 // This version of Start is optimized for the case where ~half of the
566 int half = len / 2;
567 SumDiff(part_[start], part_[start + half], part_[start], part_[start + half],
569 for (int k = 1; k < half; k++) {
570 SumDiff(part_[start + k], temp, part_[start + k], part_[start + half + k],
573 ShiftModFn(part_[start + half + k], temp, w, K_);
575 FFT_Recurse(start, half, omega, temp);
579 void FFTContainer::FFT_Recurse(int start, int half, int omega, digit_t* temp) {
580 if (half > 1) {
581 FFT_ReturnShuffledThreadsafe(start, half, 2 * omega, temp);
582 FFT_ReturnShuffledThreadsafe(start + half, half, 2 * omega, temp);
596 int half = len / 2;
597 // Don't recurse for half == 2, as PointwiseMultiply already performed
599 if (half > 2) {
600 BackwardFFT_Threadsafe(start, half, 2 * omega, temp);
601 BackwardFFT_Threadsafe(start + half, half, 2 * omega, temp);
603 SumDiff(part_[start], part_[start + half], part_[start], part_[start + half],
605 for (int k = 1; k < half; k++) {
607 ShiftModFn(temp, part_[start + half + k], w, K_);
608 SumDiff(part_[start + k], part_[start + half + k], part_[start + k], temp,