Searched refs:nprime (Results 1 - 2 of 2) sorted by relevance
/haiku-buildtools/gcc/gmp/mpn/generic/ |
H A D | mul_fft.c | 621 /* store in A[0..nprime] the first M bits from {n, nl}, 622 in A[nprime+1..] the following M bits, ... 624 T must have space for at least (nprime + 1) limbs. 628 mpn_mul_fft_decompose (mp_ptr A, mp_ptr *Ap, int K, int nprime, mp_srcptr n, argument 685 /* store the next M bits of n into A[0..nprime] */ 691 MPN_ZERO (T + j, nprime + 1 - j); 693 mpn_fft_mul_2exp_modF (A, T, i * Mp, nprime); 696 MPN_ZERO (A, nprime + 1); 697 A += nprime + 1; 706 T must have space for 2 * (nprime 710 mpn_mul_fft_internal(mp_ptr op, mp_size_t pl, int k, mp_ptr *Ap, mp_ptr *Bp, mp_ptr A, mp_ptr B, mp_size_t nprime, mp_size_t l, mp_size_t Mp, int **fft_l, mp_ptr T, int sqr) argument 816 mp_size_t N, Nprime, nprime, M, Mp, l; local [all...] |
/haiku-buildtools/gcc/gmp/tune/ |
H A D | tuneup.c | 742 mp_bitcnt_t N, Nprime, nprime, M; local 750 nprime = Nprime / GMP_NUMB_BITS; 751 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) 756 K2 = 1L << mpn_fft_best_k (nprime, sqr); 757 if ((nprime & (K2 - 1)) == 0) 759 nprime = (nprime + K2 - 1) & -K2; 760 Nprime = nprime * GMP_LIMB_BITS; 763 ASSERT_ALWAYS (nprime < pl);
|
Completed in 99 milliseconds