games/primes/primes.h

1.7  christos /*	$NetBSD: primes.h,v 1.7 2018/02/03 15:40:29 christos Exp $	*/
1.4       cgd
1.1       cgd /*
1.4       cgd  * Copyright (c) 1989, 1993
1.4       cgd  *	The Regents of the University of California.  All rights reserved.
1.1       cgd  *
1.1       cgd  * This code is derived from software contributed to Berkeley by
1.1       cgd  * Landon Curt Noll.
1.1       cgd  *
1.1       cgd  * Redistribution and use in source and binary forms, with or without
1.1       cgd  * modification, are permitted provided that the following conditions
1.1       cgd  * are met:
1.1       cgd  * 1. Redistributions of source code must retain the above copyright
1.1       cgd  *    notice, this list of conditions and the following disclaimer.
1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
1.1       cgd  *    documentation and/or other materials provided with the distribution.
1.5       agc  * 3. Neither the name of the University nor the names of its contributors
1.1       cgd  *    may be used to endorse or promote products derived from this software
1.1       cgd  *    without specific prior written permission.
1.1       cgd  *
1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1.1       cgd  * SUCH DAMAGE.
1.1       cgd  *
1.4       cgd  *	@(#)primes.h	8.2 (Berkeley) 3/1/94
1.1       cgd  */
1.1       cgd
1.1       cgd /*
1.1       cgd  * primes - generate a table of primes between two values
1.1       cgd  *
1.6       ast  * By Landon Curt Noll, http://www.isthe.com/chongo/index.html /\oo/\
1.1       cgd  *
1.1       cgd  */
1.1       cgd
1.6       ast #include <stdint.h>
1.1       cgd
1.4       cgd /* bytes in sieve table (must be > 3*5*7*11) */
1.4       cgd #define	TABSIZE		256*1024
1.6       ast
1.6       ast /*
1.6       ast  * prime[i] is the (i-1)th prime.
1.6       ast  *
1.6       ast  * We are able to sieve 2^32-1 because this byte table yields all primes
1.6       ast  * up to 65537 and 65537^2 > 2^32-1.
1.6       ast  */
1.6       ast
1.6       ast extern const uint64_t prime[];		/* must be >=32 bit unsigned values */
1.6       ast extern const uint64_t *const pr_limit;	/* largest prime in the prime array */
1.6       ast
1.6       ast /* Maximum size sieving alone can handle. */
1.6       ast #define	SIEVEMAX 4295098368ULL
1.6       ast
1.6       ast /*
1.6       ast  * To avoid excessive sieves for small factors, we use the table below to
1.6       ast  * setup our sieve blocks.  Each element represents an odd number starting
1.6       ast  * with 1.  All non-zero elements are factors of 3, 5, 7, 11 and 13.
1.6       ast  */
1.6       ast extern const char pattern[];
1.6       ast extern const size_t pattern_size;	/* length of pattern array */
1.6       ast
1.6       ast /* Test for primality using strong pseudoprime tests. */
1.6       ast int isprime(uint64_t);