Searched refs:pl3 (Results 1 - 1 of 1) sorted by relevance
| /netbsd-current/external/lgpl3/gmp/dist/mpn/generic/ |
| H A D | mul_fft.c | 949 mp_size_t pl, pl2, pl3, l; local
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) =
972 pl3 = 3 * pl2 / 2; /* since k>=FFT_FIRST_K=4, pl2 is a multiple of 2^4,
974 k3 = mpn_fft_best_k (pl3, sqr);
976 while (mpn_fft_next_size (pl3, k3) != pl3);
978 TRACE (printf ("mpn_mul_fft_full nl=%ld ml=%ld -> pl2=%ld pl3=%ld k=%d\n",
979 nl, ml, pl2, pl3, k
[all...] |
Completed in 181 milliseconds