41  *	primes [-h] [start [stop]]
43  *	Print primes >= start and < stop.  If stop is omitted,
45  *	start is omitted, start is read from standard input.
85 	ubig start;		/* where to start generating */  in main()  local
106 	start = 0;  in main()
117 		/* Start and stop supplied on the command line. */  in main()
122 		start = strtoumax(argv[0], &p, 0);  in main()
136 		/* Start on the command line. */  in main()
141 		start = strtoumax(argv[0], &p, 0);  in main()
148 		start = read_num_buf();  in main()
154 	if (start > stop)  in main()
155 		errx(1, "start value must be less than stop value.");  in main()
156 	primes(start, stop);  in main()
192  * primes - sieve and print primes from start up to and but not including stop
195 primes(ubig start, ubig stop)  in primes()  argument
209 	if (start < 3) {  in primes()
210 		start = (ubig)2;  in primes()
215 	if (stop <= start) {  in primes()
222 	if (start != 2 && (start&0x1) == 0) {  in primes()
223 		++start;  in primes()
232 	if (start <= *pr_limit) {  in primes()
233 		/* skip primes up to the start value */  in primes()
236 			if (factor >= start) {  in primes()
244 		start = *pr_limit+2;  in primes()
251 	while (start < stop) {  in primes()
256 		factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */  in primes()
270 		if (stop-start > TABSIZE+TABSIZE) {  in primes()
272 			fact_lim = sqrt(start+1.0+TABSIZE+TABSIZE);  in primes()
274 			tab_lim = &table[(stop-start)/2]; /* partial sieve */  in primes()
282 			mod = start%factor;  in primes()
298 		for (q = table; q < tab_lim; ++q, start+=2) {  in primes()
300 				if (start > SIEVEMAX) {  in primes()
301 					if (!isprime(start))  in primes()
304 				printf(hflag ? "%" PRIx64 "\n" : "%" PRIu64 "\n", start);  in primes()
313 	fprintf(stderr, "usage: primes [-h] [start [stop]]\n");  in usage()