[BACK]Return to primes.h CVS log [TXT][DIR] Up to [cvs.NetBSD.org] / src / games / primes

Annotation of src/games/primes/primes.h, Revision 1.7

1.7     ! christos    1: /*     $NetBSD: primes.h,v 1.6 2014/10/02 21:36:37 ast Exp $   */
1.4       cgd         2:
1.1       cgd         3: /*
1.4       cgd         4:  * Copyright (c) 1989, 1993
                      5:  *     The Regents of the University of California.  All rights reserved.
1.1       cgd         6:  *
                      7:  * This code is derived from software contributed to Berkeley by
                      8:  * Landon Curt Noll.
                      9:  *
                     10:  * Redistribution and use in source and binary forms, with or without
                     11:  * modification, are permitted provided that the following conditions
                     12:  * are met:
                     13:  * 1. Redistributions of source code must retain the above copyright
                     14:  *    notice, this list of conditions and the following disclaimer.
                     15:  * 2. Redistributions in binary form must reproduce the above copyright
                     16:  *    notice, this list of conditions and the following disclaimer in the
                     17:  *    documentation and/or other materials provided with the distribution.
1.5       agc        18:  * 3. Neither the name of the University nor the names of its contributors
1.1       cgd        19:  *    may be used to endorse or promote products derived from this software
                     20:  *    without specific prior written permission.
                     21:  *
                     22:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
                     23:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
                     24:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
                     25:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
                     26:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
                     27:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
                     28:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
                     29:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
                     30:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
                     31:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
                     32:  * SUCH DAMAGE.
                     33:  *
1.4       cgd        34:  *     @(#)primes.h    8.2 (Berkeley) 3/1/94
1.1       cgd        35:  */
                     36:
                     37: /*
                     38:  * primes - generate a table of primes between two values
                     39:  *
1.6       ast        40:  * By Landon Curt Noll, http://www.isthe.com/chongo/index.html /\oo/\
1.1       cgd        41:  *
                     42:  */
                     43:
1.6       ast        44: #include <stdint.h>
1.1       cgd        45:
1.4       cgd        46: /* bytes in sieve table (must be > 3*5*7*11) */
                     47: #define        TABSIZE         256*1024
1.6       ast        48:
                     49: /*
                     50:  * prime[i] is the (i-1)th prime.
                     51:  *
                     52:  * We are able to sieve 2^32-1 because this byte table yields all primes
                     53:  * up to 65537 and 65537^2 > 2^32-1.
                     54:  */
                     55:
                     56: extern const uint64_t prime[];         /* must be >=32 bit unsigned values */
                     57: extern const uint64_t *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:  */
                     67: extern const char pattern[];
                     68: extern const size_t pattern_size;      /* length of pattern array */
                     69:
                     70: /* Test for primality using strong pseudoprime tests. */
                     71: int isprime(uint64_t);

CVSweb <webmaster@jp.NetBSD.org>