ubig
const ubig *fact; /* The factor found. */
typedef ubig BIGNUM;
const ubig prime[] = {
const ubig *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
static 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; /* temp storage for mod */
start = (ubig)2;
stop = (ubig)2;
static void primes(ubig, ubig);
static ubig read_num_buf(void);
ubig start; /* where to start generating */
ubig stop; /* don't generate at or above this value */
extern const ubig prime[];
extern const ubig *const pr_limit; /* largest prime in the prime array */
int isprime(ubig);
isprime(ubig _n)