Lines Matching refs:pri
148 unsigned short pri;
154 pri = pr[j];
155 if(pri > sievelim) break;
158 rem = idivg(pri, t1);
231 { int cnt, j, k, pri, found = 0;
236 pri = pr[j];
237 if((pri > lim) || (j == NUM_PRIMES-1) || (abort && (j % 100 == 99))) {
248 if(pri > lim) break;
250 if(pri < 19) { cnt = 20-pri; /* Smaller primes get higher powers. */
251 } else if(pri < 100) {
256 powermod(fact, pri, N);
281 { unsigned int pri, q;
299 pri = pr[j];
302 if(primeq(q)) pri = q;
306 if(pri > B) break;
307 if(pri < 19) { cnt = 20-pri;
308 } else if(pri < 100) {
312 ell_mul_int_brent(pt1, pri, An, Ad, N);