primes.h revision 104720
12490Sjkh/* 22490Sjkh * Copyright (c) 1989, 1993 32490Sjkh * The Regents of the University of California. All rights reserved. 42490Sjkh * 52490Sjkh * This code is derived from software contributed to Berkeley by 62490Sjkh * Landon Curt Noll. 72490Sjkh * 82490Sjkh * Redistribution and use in source and binary forms, with or without 92490Sjkh * modification, are permitted provided that the following conditions 102490Sjkh * are met: 112490Sjkh * 1. Redistributions of source code must retain the above copyright 122490Sjkh * notice, this list of conditions and the following disclaimer. 132490Sjkh * 2. Redistributions in binary form must reproduce the above copyright 142490Sjkh * notice, this list of conditions and the following disclaimer in the 152490Sjkh * documentation and/or other materials provided with the distribution. 162490Sjkh * 3. All advertising materials mentioning features or use of this software 172490Sjkh * must display the following acknowledgement: 182490Sjkh * This product includes software developed by the University of 192490Sjkh * California, Berkeley and its contributors. 202490Sjkh * 4. Neither the name of the University nor the names of its contributors 212490Sjkh * may be used to endorse or promote products derived from this software 222490Sjkh * without specific prior written permission. 232490Sjkh * 242490Sjkh * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 252490Sjkh * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 262490Sjkh * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 272490Sjkh * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 282490Sjkh * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 292490Sjkh * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 302490Sjkh * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 312490Sjkh * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 322490Sjkh * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 332490Sjkh * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 342490Sjkh * SUCH DAMAGE. 352490Sjkh * 362490Sjkh * @(#)primes.h 8.2 (Berkeley) 3/1/94 37104720Sfanf * $FreeBSD: head/games/primes/primes.h 104720 2002-10-09 19:38:55Z fanf $ 382490Sjkh */ 392490Sjkh 402490Sjkh/* 412490Sjkh * primes - generate a table of primes between two values 422490Sjkh * 432490Sjkh * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo 442490Sjkh * 452490Sjkh * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 462490Sjkh */ 472490Sjkh 482490Sjkh/* ubig is the type that holds a large unsigned value */ 492490Sjkhtypedef unsigned long ubig; /* must be >=32 bit unsigned value */ 502490Sjkh#define BIG ULONG_MAX /* largest value will sieve */ 512490Sjkh 522490Sjkh/* bytes in sieve table (must be > 3*5*7*11) */ 532490Sjkh#define TABSIZE 256*1024 54104720Sfanf 55104720Sfanf/* 56104720Sfanf * prime[i] is the (i-1)th prime. 57104720Sfanf * 58104720Sfanf * We are able to sieve 2^32-1 because this byte table yields all primes 59104720Sfanf * up to 65537 and 65537^2 > 2^32-1. 60104720Sfanf */ 61104720Sfanfextern const ubig prime[]; 62104720Sfanfextern const ubig *const pr_limit; /* largest prime in the prime array */ 63104720Sfanf 64104720Sfanf/* 65104720Sfanf * To avoid excessive sieves for small factors, we use the table below to 66104720Sfanf * setup our sieve blocks. Each element represents a odd number starting 67104720Sfanf * with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13. 68104720Sfanf */ 69104720Sfanfextern const char pattern[]; 70104720Sfanfextern const size_t pattern_size; /* length of pattern array */ 71