Home
last modified time | relevance | path

Searched refs:nprime (Results 1 – 3 of 3) sorted by relevance

/netbsd/src/external/lgpl3/gmp/dist/mpn/generic/
Dmul_fft.c674 mpn_mul_fft_decompose (mp_ptr A, mp_ptr *Ap, mp_size_t K, mp_size_t nprime, in mpn_mul_fft_decompose() argument
738 MPN_ZERO (T + j, nprime + 1 - j); in mpn_mul_fft_decompose()
740 mpn_fft_mul_2exp_modF (A, T, i * Mp, nprime); in mpn_mul_fft_decompose()
743 MPN_ZERO (A, nprime + 1); in mpn_mul_fft_decompose()
744 A += nprime + 1; in mpn_mul_fft_decompose()
759 mp_size_t nprime, mp_size_t l, mp_size_t Mp, in mpn_mul_fft_internal() argument
769 mpn_fft_fft (Ap, K, fft_l + k, 2 * Mp, nprime, 1, T); in mpn_mul_fft_internal()
771 mpn_fft_fft (Bp, K, fft_l + k, 2 * Mp, nprime, 1, T); in mpn_mul_fft_internal()
774 mpn_fft_mul_modF_K (Ap, sqr ? Ap : Bp, nprime, K); in mpn_mul_fft_internal()
777 mpn_fft_fftinv (Ap, K, 2 * Mp, nprime, T); in mpn_mul_fft_internal()
[all …]
/netbsd/src/external/lgpl3/gmp/dist/tune/
Dtuneup.c854 mp_bitcnt_t N, Nprime, nprime, M; in fftfill() local
862 nprime = Nprime / GMP_NUMB_BITS; in fftfill()
863 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) in fftfill()
868 K2 = 1L << mpn_fft_best_k (nprime, sqr); in fftfill()
869 if ((nprime & (K2 - 1)) == 0) in fftfill()
871 nprime = (nprime + K2 - 1) & -K2; in fftfill()
872 Nprime = nprime * GMP_LIMB_BITS; in fftfill()
875 ASSERT_ALWAYS (nprime < pl); in fftfill()
/netbsd/src/external/lgpl3/gmp/dist/tests/mpz/
Dt-jac.c750 ref_jacobi (mpz_srcptr a, mpz_srcptr b, unsigned nprime, in ref_jacobi() argument
756 for (i = 0, res = 1; i < nprime; i++) in ref_jacobi()