mirrors/BSDGames
1
0
Fork 0
mirror of https://github.com/vattam/BSDGames.git synced 2025-12-21 03:14:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

copy in from cvs; cvs2svn fucked up big time

Browse Source 
git-svn-id: file:///srv/svn/joey/trunk/src/packages/bsdgames@9775 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
joey
2003-12-19 19:12:08 +00:00
parent 351c8ca204
commit 51eabc017b
310 changed files with 7852 additions and 5005 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
primes/primes.c
View File

@@ -1,4 +1,4 @@
/* $NetBSD: primes.c,v 1.8 1998/09/13 15:27:29 hubertf Exp $ */
/* $NetBSD: primes.c,v 1.10 2001/01/20 15:06:35 itojun Exp $ */
/*
* Copyright (c) 1989, 1993
@@ -46,7 +46,7 @@ __COPYRIGHT("@(#) Copyright (c) 1989, 1993\n\
#if 0
static char sccsid[] = "@(#)primes.c 8.5 (Berkeley) 5/10/95";
#else
__RCSID("$NetBSD: primes.c,v 1.8 1998/09/13 15:27:29 hubertf Exp $");
__RCSID("$NetBSD: primes.c,v 1.10 2001/01/20 15:06:35 itojun Exp $");
#endif
#endif /* not lint */
@@ -232,6 +232,7 @@ primes(start, stop)
char *tab_lim; /* the limit to sieve on the table */
const ubig *p; /* prime table pointer */
ubig fact_lim; /* highest prime for current block */
ubig mod; /* temp storage for mod */
/*
* A number of systems can not convert double values into unsigned
@@ -312,11 +313,11 @@ primes(start, stop)
p = &prime[7]; /* 19 is next prime, pi(19)=7 */
do {
/* determine the factor's initial sieve point */
q = (char *)(start%factor); /* temp storage for mod */
if ((long)q & 0x1) {
q = &table[(factor-(long)q)/2];
mod = start%factor;
if (mod & 0x1) {
q = &table[(factor-mod)/2];
} else {
q = &table[q ? factor-((long)q/2) : 0];
q = &table[mod ? factor-(mod/2) : 0];
}
/* sive for our current factor */
for ( ; q < tab_lim; q += factor) {