games/primes/primes.h

   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. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  *
  36  *      @(#)primes.h    8.2 (Berkeley) 3/1/94
  37  * $FreeBSD: src/games/primes/primes.h,v 1.1.1.1.14.1 2002/10/23 14:59:14 fanf Exp $
  38  * $DragonFly: src/games/primes/primes.h,v 1.2 2003/06/17 04:25:24 dillon Exp $
  39  */
  40
  41 /*
  42  * primes - generate a table of primes between two values
  43  *
  44  * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
  45  *
  46  * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
  47  */
  48
  49 /* ubig is the type that holds a large unsigned value */
  50 typedef unsigned long ubig;             /* must be >=32 bit unsigned value */
  51 #define BIG             ULONG_MAX       /* largest value will sieve */
  52
  53 /* bytes in sieve table (must be > 3*5*7*11) */
  54 #define TABSIZE         256*1024
  55
  56 /*
  57  * prime[i] is the (i-1)th prime.
  58  *
  59  * We are able to sieve 2^32-1 because this byte table yields all primes
  60  * up to 65537 and 65537^2 > 2^32-1.
  61  */
  62 extern const ubig prime[];
  63 extern const ubig *const pr_limit;      /* largest prime in the prime array */
  64
  65 /*
  66  * To avoid excessive sieves for small factors, we use the table below to
  67  * setup our sieve blocks.  Each element represents a odd number starting
  68  * with 1.  All non-zero elements are factors of 3, 5, 7, 11 and 13.
  69  */
  70 extern const char pattern[];
  71 extern const size_t pattern_size;       /* length of pattern array */