HomeSort by: relevance | last modified time | path
    Searched refs:nprime (Results 1 - 3 of 3) sorted by relevancy

  /src/external/lgpl3/gmp/dist/mpn/generic/
mul_fft.c 667 /* store in A[0..nprime] the first M bits from {n, nl},
668 in A[nprime+1..] the following M bits, ...
670 T must have space for at least (nprime + 1) limbs.
674 mpn_mul_fft_decompose (mp_ptr A, mp_ptr *Ap, mp_size_t K, mp_size_t nprime,
732 /* store the next M bits of n into A[0..nprime] */
738 MPN_ZERO (T + j, nprime + 1 - j);
740 mpn_fft_mul_2exp_modF (A, T, i * Mp, nprime);
743 MPN_ZERO (A, nprime + 1);
744 A += nprime + 1;
753 T must have space for 2 * (nprime + 1) limbs
864 mp_size_t N, Nprime, nprime, M, Mp, l; local
    [all...]
  /src/external/lgpl3/gmp/dist/tune/
tuneup.c 854 mp_bitcnt_t N, Nprime, nprime, M; local
861 Nprime = (1 + (2 * M + k + 2) / maxLK) * maxLK;
862 nprime = Nprime / GMP_NUMB_BITS;
863 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD))
868 K2 = 1L << mpn_fft_best_k (nprime, sqr);
869 if ((nprime & (K2 - 1)) == 0)
871 nprime = (nprime + K2 - 1) & -K2
    [all...]
  /src/external/lgpl3/gmp/dist/tests/mpz/
t-jac.c 750 ref_jacobi (mpz_srcptr a, mpz_srcptr b, unsigned nprime,
756 for (i = 0, res = 1; i < nprime; i++)

Completed in 47 milliseconds