Lines Matching defs:factors
48 Accumulate chunks of factors first limb-by-limb (using one of mul0-mul8)
50 accumulates divisor factors, the 2nd inner loop accumulates exactly the same
51 number of dividend factors. We avoid accumulating more for the divisor,
52 even with its smaller factors, since we else cannot guarantee divisibility.
69 stored into a limb, perhaps.) The table should take the removed factors of
82 /* Multiply-into-limb functions. These remove factors of 2 on-the-fly. FIXME:
84 that then, shifting just adds some overhead. (We remove factors from the
173 /* Number of factors-of-2 removed by the corresponding mulN function. */
188 /* 1 to 8 factors per iteration */
192 /* 1 to 7 factors per iteration */
248 kp[0] = jjj; /* store new factors */
256 j += kmax; /* number of factors used */
259 cy = mpn_mul_1 (kp, kp, kn, jjj); /* accumulate new factors */
271 i += nmaxnow; /* number of factors used */
274 cy = mpn_mul_1 (np, np, nn, iii); /* accumulate new factors */
293 j += kmax; /* number of factors used */
298 /* Put back the right number of factors of 2. */
350 i += nmax; /* number of factors used */
357 i += nmax; /* number of factors used */
359 cy = mpn_mul_1 (rp, rp, rn, iii); /* accumulate new factors */
593 mp_limb_t *sieve, *factors, count;
605 factors = TMP_ALLOC_LIMBS (count / log_n_max (n) + 1);
618 COUNT_A_PRIME (3, n, k, prod, max_prod, factors, j);
620 /* Accumulate prime factors from 5 to n/2 */
629 COUNT_A_PRIME (prime, n, k, prod, max_prod, factors, j);
636 SH_COUNT_A_PRIME (prime, n, k, prod, max_prod, factors, j);
646 FACTOR_LIST_STORE (prime, prod, max_prod, factors, j);
651 factors[j++] = prod;
652 mpz_prodlimbs (r, factors, j);
Indexes created Sun Mar 01 05:31:48 UTC 2026