1 /* 2 * Copyright (c) 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Landon Curt Noll. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 #ifndef lint 34 static const char copyright[] = 35 "@(#) Copyright (c) 1989, 1993\n\ 36 The Regents of the University of California. All rights reserved.\n"; 37 #endif /* not lint */ 38 39 #ifndef lint 40 #if 0 41 static char sccsid[] = "@(#)primes.c 8.5 (Berkeley) 5/10/95"; 42 #endif 43 static const char rcsid[] = 44 "$FreeBSD$"; 45 #endif /* not lint */ 46 47 /* 48 * primes - generate a table of primes between two values 49 * 50 * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo 51 * 52 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 53 * 54 * usage: 55 * primes [-h] [start [stop]] 56 * 57 * Print primes >= start and < stop. If stop is omitted, 58 * the value 4294967295 (2^32-1) is assumed. If start is 59 * omitted, start is read from standard input. 60 * 61 * validation check: there are 664579 primes between 0 and 10^7 62 */ 63 64 #include <sys/capsicum.h> 65 #include <ctype.h> 66 #include <err.h> 67 #include <errno.h> 68 #include <inttypes.h> 69 #include <limits.h> 70 #include <math.h> 71 #include <stdio.h> 72 #include <stdlib.h> 73 #include <string.h> 74 #include <nl_types.h> 75 #include <unistd.h> 76 77 #include "primes.h" 78 79 /* 80 * Eratosthenes sieve table 81 * 82 * We only sieve the odd numbers. The base of our sieve windows are always 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. 85 * 86 * We make TABSIZE large to reduce the overhead of inner loop setup. 87 */ 88 static char table[TABSIZE]; /* Eratosthenes sieve of odd numbers */ 89 90 static int hflag; 91 92 static void primes(ubig, ubig); 93 static ubig read_num_buf(void); 94 static void usage(void); 95 96 int 97 main(int argc, char *argv[]) 98 { 99 ubig start; /* where to start generating */ 100 ubig stop; /* don't generate at or above this value */ 101 int ch; 102 char *p; 103 104 /* Cache NLS data, for strerror, for err(3), before cap_enter. */ 105 (void)catopen("libc", NL_CAT_LOCALE); 106 107 if (cap_enter() < 0 && errno != ENOSYS) 108 err(1, "cap_enter"); 109 110 while ((ch = getopt(argc, argv, "h")) != -1) 111 switch (ch) { 112 case 'h': 113 hflag++; 114 break; 115 case '?': 116 default: 117 usage(); 118 } 119 argc -= optind; 120 argv += optind; 121 122 start = 0; 123 stop = (uint64_t)(-1); 124 125 /* 126 * Convert low and high args. Strtoumax(3) sets errno to 127 * ERANGE if the number is too large, but, if there's 128 * a leading minus sign it returns the negation of the 129 * result of the conversion, which we'd rather disallow. 130 */ 131 switch (argc) { 132 case 2: 133 /* Start and stop supplied on the command line. */ 134 if (argv[0][0] == '-' || argv[1][0] == '-') 135 errx(1, "negative numbers aren't permitted."); 136 137 errno = 0; 138 start = strtoumax(argv[0], &p, 0); 139 if (errno) 140 err(1, "%s", argv[0]); 141 if (*p != '\0') 142 errx(1, "%s: illegal numeric format.", argv[0]); 143 144 errno = 0; 145 stop = strtoumax(argv[1], &p, 0); 146 if (errno) 147 err(1, "%s", argv[1]); 148 if (*p != '\0') 149 errx(1, "%s: illegal numeric format.", argv[1]); 150 break; 151 case 1: 152 /* Start on the command line. */ 153 if (argv[0][0] == '-') 154 errx(1, "negative numbers aren't permitted."); 155 156 errno = 0; 157 start = strtoumax(argv[0], &p, 0); 158 if (errno) 159 err(1, "%s", argv[0]); 160 if (*p != '\0') 161 errx(1, "%s: illegal numeric format.", argv[0]); 162 break; 163 case 0: 164 start = read_num_buf(); 165 break; 166 default: 167 usage(); 168 } 169 170 if (start > stop) 171 errx(1, "start value must be less than stop value."); 172 primes(start, stop); 173 return (0); 174 } 175 176 /* 177 * read_num_buf -- 178 * This routine returns a number n, where 0 <= n && n <= BIG. 179 */ 180 static ubig 181 read_num_buf(void) 182 { 183 ubig val; 184 char *p, buf[LINE_MAX]; /* > max number of digits. */ 185 186 for (;;) { 187 if (fgets(buf, sizeof(buf), stdin) == NULL) { 188 if (ferror(stdin)) 189 err(1, "stdin"); 190 exit(0); 191 } 192 for (p = buf; isblank(*p); ++p); 193 if (*p == '\n' || *p == '\0') 194 continue; 195 if (*p == '-') 196 errx(1, "negative numbers aren't permitted."); 197 errno = 0; 198 val = strtoumax(buf, &p, 0); 199 if (errno) 200 err(1, "%s", buf); 201 if (*p != '\n') 202 errx(1, "%s: illegal numeric format.", buf); 203 return (val); 204 } 205 } 206 207 /* 208 * primes - sieve and print primes from start up to and but not including stop 209 */ 210 static void 211 primes(ubig start, ubig stop) 212 { 213 char *q; /* sieve spot */ 214 ubig factor; /* index and factor */ 215 char *tab_lim; /* the limit to sieve on the table */ 216 const ubig *p; /* prime table pointer */ 217 ubig fact_lim; /* highest prime for current block */ 218 ubig mod; /* temp storage for mod */ 219 220 /* 221 * A number of systems can not convert double values into unsigned 222 * longs when the values are larger than the largest signed value. 223 * We don't have this problem, so we can go all the way to BIG. 224 */ 225 if (start < 3) { 226 start = (ubig)2; 227 } 228 if (stop < 3) { 229 stop = (ubig)2; 230 } 231 if (stop <= start) { 232 return; 233 } 234 235 /* 236 * be sure that the values are odd, or 2 237 */ 238 if (start != 2 && (start&0x1) == 0) { 239 ++start; 240 } 241 if (stop != 2 && (stop&0x1) == 0) { 242 ++stop; 243 } 244 245 /* 246 * quick list of primes <= pr_limit 247 */ 248 if (start <= *pr_limit) { 249 /* skip primes up to the start value */ 250 for (p = &prime[0], factor = prime[0]; 251 factor < stop && p <= pr_limit; factor = *(++p)) { 252 if (factor >= start) { 253 printf(hflag ? "%" PRIx64 "\n" : "%" PRIu64 "\n", factor); 254 } 255 } 256 /* return early if we are done */ 257 if (p <= pr_limit) { 258 return; 259 } 260 start = *pr_limit+2; 261 } 262 263 /* 264 * we shall sieve a bytemap window, note primes and move the window 265 * upward until we pass the stop point 266 */ 267 while (start < stop) { 268 /* 269 * factor out 3, 5, 7, 11 and 13 270 */ 271 /* initial pattern copy */ 272 factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */ 273 memcpy(table, &pattern[factor], pattern_size-factor); 274 /* main block pattern copies */ 275 for (fact_lim=pattern_size-factor; 276 fact_lim+pattern_size<=TABSIZE; fact_lim+=pattern_size) { 277 memcpy(&table[fact_lim], pattern, pattern_size); 278 } 279 /* final block pattern copy */ 280 memcpy(&table[fact_lim], pattern, TABSIZE-fact_lim); 281 282 /* 283 * sieve for primes 17 and higher 284 */ 285 /* note highest useful factor and sieve spot */ 286 if (stop-start > TABSIZE+TABSIZE) { 287 tab_lim = &table[TABSIZE]; /* sieve it all */ 288 fact_lim = sqrt(start+1.0+TABSIZE+TABSIZE); 289 } else { 290 tab_lim = &table[(stop-start)/2]; /* partial sieve */ 291 fact_lim = sqrt(stop+1.0); 292 } 293 /* sieve for factors >= 17 */ 294 factor = 17; /* 17 is first prime to use */ 295 p = &prime[7]; /* 19 is next prime, pi(19)=7 */ 296 do { 297 /* determine the factor's initial sieve point */ 298 mod = start%factor; 299 if (mod & 0x1) { 300 q = &table[(factor-mod)/2]; 301 } else { 302 q = &table[mod ? factor-(mod/2) : 0]; 303 } 304 /* sive for our current factor */ 305 for ( ; q < tab_lim; q += factor) { 306 *q = '\0'; /* sieve out a spot */ 307 } 308 factor = *p++; 309 } while (factor <= fact_lim); 310 311 /* 312 * print generated primes 313 */ 314 for (q = table; q < tab_lim; ++q, start+=2) { 315 if (*q) { 316 if (start > SIEVEMAX) { 317 if (!isprime(start)) 318 continue; 319 } 320 printf(hflag ? "%" PRIx64 "\n" : "%" PRIu64 "\n", start); 321 } 322 } 323 } 324 } 325 326 static void 327 usage(void) 328 { 329 fprintf(stderr, "usage: primes [-h] [start [stop]]\n"); 330 exit(1); 331 } 332