Lines Matching defs:K2
400 mp_size_t j, K2 = K >> 1;
403 mpn_fft_fft (Ap, K2, ll-1, 2 * omega, n, inc * 2, tp);
404 mpn_fft_fft (Ap+inc, K2, ll-1, 2 * omega, n, inc * 2, tp);
407 for (j = 0; j < K2; j++, lk += 2, Ap += 2 * inc)
466 mp_size_t K2, nprime2, Nprime2, M2, maxLK, l, Mp2;
472 K2 = (mp_size_t) 1 << k;
473 ASSERT_ALWAYS((n & (K2 - 1)) == 0);
474 maxLK = (K2 > GMP_NUMB_BITS) ? K2 : GMP_NUMB_BITS;
499 Ap = TMP_BALLOC_MP_PTRS (K2);
500 Bp = TMP_BALLOC_MP_PTRS (K2);
515 n, K2, nprime2, nprime2, 2.0*(double)n/nprime2/K2));
523 mpn_mul_fft_decompose (A, Ap, K2, nprime2, *ap, (l << k) + 1, l, Mp2, T);
525 mpn_mul_fft_decompose (B, Bp, K2, nprime2, *bp, (l << k) + 1, l, Mp2, T);
595 mp_size_t j, K2 = K >> 1;
597 mpn_fft_fftinv (Ap, K2, 2 * omega, n, tp);
598 mpn_fft_fftinv (Ap + K2, K2, 2 * omega, n, tp);
601 for (j = 0; j < K2; j++, Ap++)
603 /* Ap[K2] <- Ap[0] + Ap[K2] * 2^((j + K2) * omega)
604 Ap[0] <- Ap[0] + Ap[K2] * 2^(j * omega) */
605 mpn_fft_mul_2exp_modF (tp, Ap[K2], j * omega, n);
607 mpn_fft_add_sub_modF (Ap[0], Ap[K2], tp, n);
609 mpn_fft_sub_modF (Ap[K2], Ap[0], tp, n);
898 mp_size_t K2;
901 K2 = (mp_size_t) 1 << mpn_fft_best_k (nprime, sqr);
902 if ((nprime & (K2 - 1)) == 0)
904 nprime = (nprime + K2 - 1) & -K2;
906 /* warning: since nprime changed, K2 may change too! */
951 int k2, k3;
957 We must have pl3 = 3/2 * pl2, with pl2 a multiple of 2^k2, and
958 pl3 a multiple of 2^k3. Since k3 >= k2, both are multiples of 2^k2,
959 and pl2 must be an even multiple of 2^k2. Thus (pl2,pl3) =
960 (2*j*2^k2,3*j*2^k2), which works for 3*j <= pl/2^k2 <= 5*j.
970 k2 = mpn_fft_best_k (pl2, sqr); /* best fft size for pl2 limbs */
971 pl2 = mpn_fft_next_size (pl2, k2);
979 nl, ml, pl2, pl3, k2));
985 cc = mpn_mul_fft (pad_op, pl2, n, nl, m, ml, k2); /* lambda */
Indexes created Sat Feb 28 05:31:39 UTC 2026