Annotation of 43BSDReno/games/primes/primes.h, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1989 The Regents of the University of California.
                      3:  * 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 are permitted
                      9:  * provided that: (1) source distributions retain this entire copyright
                     10:  * notice and comment, and (2) distributions including binaries display
                     11:  * the following acknowledgement:  ``This product includes software
                     12:  * developed by the University of California, Berkeley and its contributors''
                     13:  * in the documentation or other materials provided with the distribution
                     14:  * and in all advertising materials mentioning features or use of this
                     15:  * software. Neither the name of the University nor the names of its
                     16:  * contributors may be used to endorse or promote products derived
                     17:  * from this software without specific prior written permission.
                     18:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
                     19:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
                     20:  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     21:  *
                     22:  *     @(#)primes.h    5.2 (Berkeley) 6/1/90
                     23:  */
                     24: 
                     25: /*
                     26:  * primes - generate a table of primes between two values
                     27:  *
                     28:  * By: Landon Curt Noll   [email protected],   ...!{sun,tolsoft}!hoptoad!chongo
                     29:  *
                     30:  *   chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
                     31:  */
                     32: 
                     33: /* ubig is the type that holds a large unsigned value */
                     34: typedef unsigned long ubig;           /* must be >=32 bit unsigned value */
                     35: 
                     36: /*
                     37:  * sieve parameters
                     38:  */
                     39: #define BIG ((ubig)0xffffffff)        /* highest value we will sieve */
                     40: #define SEMIBIG ((ubig)0x7fffffff)    /* highest signed value */
                     41: #define NEG_SEMIBIG ((ubig)0x80000000) /* lowest signed value */
                     42: #define TABSIZE 256*1024 /* bytes in sieve table (must be > 3*5*7*11) */

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.