xref: /csrg-svn/games/primes/primes.h (revision 66292)
139968Sbostic /*
260833Sbostic  * Copyright (c) 1989, 1993
360833Sbostic  *	The Regents of the University of California.  All rights reserved.
439968Sbostic  *
539968Sbostic  * This code is derived from software contributed to Berkeley by
639968Sbostic  * Landon Curt Noll.
739968Sbostic  *
842587Sbostic  * %sccs.include.redist.c%
939968Sbostic  *
10*66292Sbostic  *	@(#)primes.h	8.2 (Berkeley) 03/01/94
1139968Sbostic  */
1239968Sbostic 
1339968Sbostic /*
1439968Sbostic  * primes - generate a table of primes between two values
1539968Sbostic  *
16*66292Sbostic  * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
1739968Sbostic  *
18*66292Sbostic  * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
1939968Sbostic  */
2039968Sbostic 
2139968Sbostic /* ubig is the type that holds a large unsigned value */
22*66292Sbostic typedef unsigned long ubig;		/* must be >=32 bit unsigned value */
23*66292Sbostic #define	BIG		ULONG_MAX	/* largest value will sieve */
2439968Sbostic 
25*66292Sbostic /* bytes in sieve table (must be > 3*5*7*11) */
26*66292Sbostic #define	TABSIZE		256*1024
27