d/freebsd-dev
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Define NPRIMES in terms of the number of elements in 'primes' (as opposed

Browse Source 
to hardcoding it).
This commit is contained in:
Alexander Langer 1997-05-28 00:47:27 +00:00
parent c21701d99b
commit b7564dc0b0
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=26205
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sys/kern/kern_subr.c
View File

@ -36,7 +36,7 @@
* SUCH DAMAGE.
*
* @(#)kern_subr.c 8.3 (Berkeley) 1/21/94
* $Id$
* $Id: kern_subr.c,v 1.10 1997/02/22 09:39:11 peter Exp $
*/
#include <sys/param.h>
@ -218,10 +218,10 @@ hashinit(elements, type, hashmask)
return (hashtbl);
}
#define NPRIMES 27
static int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, 2039,
2557, 3067, 3583, 4093, 4603, 5119, 5623, 6143, 6653,
7159, 7673, 8191, 12281, 16381, 24571, 32749 };
#define NPRIMES (sizeof(primes) / sizeof(primes[0]))
/*
* General routine to allocate a prime number sized hash table.