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/*
34 * primes - generate a table of primes between two values
35 *
36 * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
37 *
38 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
39 */
40
41#include <stdint.h>
42
43/* ubig is the type that holds a large unsigned value */
44typedef uint64_t ubig;			/* must be >=32 bit unsigned value */
45#define	BIG		ULONG_MAX	/* largest value will sieve */
46
47/* bytes in sieve table (must be > 3*5*7*11) */
48#define	TABSIZE		256*1024
49
50/*
51 * prime[i] is the (i-1)th prime.
52 *
53 * We are able to sieve 2^32-1 because this byte table yields all primes
54 * up to 65537 and 65537^2 > 2^32-1.
55 */
56extern const ubig prime[];
57extern const ubig *const pr_limit;	/* largest prime in the prime array */
58
59/* Maximum size sieving alone can handle. */
60#define	SIEVEMAX 4295098368ULL
61
62/*
63 * To avoid excessive sieves for small factors, we use the table below to
64 * setup our sieve blocks.  Each element represents an odd number starting
65 * with 1.  All non-zero elements are factors of 3, 5, 7, 11 and 13.
66 */
67extern const char pattern[];
68extern const size_t pattern_size;	/* length of pattern array */
69
70/* Test for primality using strong pseudoprime tests. */
71int isprime(ubig);
72