ubig
const ubig *fact; /* The factor found. */
ubig factor;
const ubig *p;
ubig fact_lim, mod;
} while ((factor=(ubig)(*(p++))) <= fact_lim);
extern const ubig prime[];
extern const ubig *pr_limit; /* largest prime in the prime array */
const ubig prime[] = {
const ubig *pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
ubig stop; /* don't generate at or above this value */
ubig
ubig val;
primes(ubig start, ubig stop)
ubig factor; /* index and factor */
const ubig *p; /* prime table pointer */
ubig fact_lim; /* highest prime for current block */
ubig mod;
start = (ubig)2;
stop = (ubig)2;
} while ((factor=(ubig)(*(p++))) <= fact_lim);
extern const ubig prime[];
extern const ubig *pr_limit; /* largest prime in the prime array */
void primes(ubig, ubig);
ubig read_num_buf(void);
ubig start; /* where to start generating */