games/factor/factor.c

158

const ubig *fact; /* The factor found. */

games/factor/factor.c

208

ubig factor;

games/factor/factor.c

210

const ubig *p;

games/factor/factor.c

211

ubig fact_lim, mod;

games/factor/factor.c

262

} while ((factor=(ubig)(*(p++))) <= fact_lim);

games/factor/factor.c

71

extern const ubig prime[];

games/factor/factor.c

72

extern const ubig *pr_limit; /* largest prime in the prime array */

games/primes/pr_tbl.c

51

const ubig prime[] = {

games/primes/pr_tbl.c

543

const ubig *pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];

games/primes/primes.c

100

ubig stop; /* don't generate at or above this value */

games/primes/primes.c

146

ubig

games/primes/primes.c

150

ubig val;

games/primes/primes.c

177

primes(ubig start, ubig stop)

games/primes/primes.c

180

ubig factor; /* index and factor */

games/primes/primes.c

182

const ubig *p; /* prime table pointer */

games/primes/primes.c

183

ubig fact_lim; /* highest prime for current block */

games/primes/primes.c

184

ubig mod;

games/primes/primes.c

192

start = (ubig)2;

games/primes/primes.c

195

stop = (ubig)2;

games/primes/primes.c

274

} while ((factor=(ubig)(*(p++))) <= fact_lim);

games/primes/primes.c

80

extern const ubig prime[];

games/primes/primes.c

81

extern const ubig *pr_limit; /* largest prime in the prime array */

games/primes/primes.c

91

void primes(ubig, ubig);

games/primes/primes.c

92

ubig read_num_buf(void);

games/primes/primes.c

99

ubig start; /* where to start generating */