Lines Matching defs:table
50 * primes - generate a table of primes between two values
80 * Eratosthenes sieve table
83 * odd. If the base of table is 1, table[i] represents 2*i-1. After the
84 * sieve, table[i] == 1 if and only if 2*i-1 is prime.
88 static char table[TABSIZE]; /* Eratosthenes sieve of odd numbers */
213 char *tab_lim; /* the limit to sieve on the table */
214 const uint64_t *p; /* prime table pointer */
277 memcpy(table, &pattern[factor], pattern_size-factor);
281 memcpy(&table[fact_lim], pattern, pattern_size);
284 memcpy(&table[fact_lim], pattern, TABSIZE-fact_lim);
291 tab_lim = &table[TABSIZE]; /* sieve it all */
294 tab_lim = &table[(stop-start)/2]; /* partial sieve */
304 q = &table[(factor-mod)/2];
306 q = &table[mod ? factor-(mod/2) : 0];
318 for (q = table; q < tab_lim; ++q, start+=2) {
Indexes created Wed Oct 15 14:09:57 GMT 2025