Home | History | Annotate | Download | only in primes

Lines Matching defs:factor

212 	uint64_t factor;	/* index and factor */
249 		for (p = &prime[0], factor = prime[0];
250 		    factor < stop && p <= pr_limit; factor = *(++p)) {
251 			if (factor >= start) {
252 				printf(hflag ? "%" PRIx64 : "%" PRIu64, factor);
254 					printf(" (%" PRIu64 ")", factor - prev);
258 			prev = factor;
273 		 * factor out 3, 5, 7, 11 and 13
276 		factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */
277 		memcpy(table, &pattern[factor], pattern_size-factor);
279 		for (fact_lim=pattern_size-factor;
289 		/* note highest useful factor and sieve spot */
298 		factor = 17;	/* 17 is first prime to use */
301 			/* determine the factor's initial sieve point */
302 			mod = start%factor;
304 				q = &table[(factor-mod)/2];
306 				q = &table[mod ? factor-(mod/2) : 0];
308 			/* sieve for our current factor */
309 			for ( ; q < tab_lim; q += factor) {
312 			factor = *p++;
313 		} while (factor <= fact_lim);