HASHSIZE
for (entry = 0; entry < HASHSIZE; ++entry)
#define HASHKEY(pgno) ((pgno - 1) % HASHSIZE)
TAILQ_HEAD(_hqh, _bkt) hqh[HASHSIZE];
#define HASHKEY(pgno) ((pgno - 1 + HASHSIZE) % HASHSIZE)
TAILQ_HEAD(_hqh, _bkt) hqh[HASHSIZE];
for (entry = 0; entry < HASHSIZE; ++entry)
& (HASHSIZE - 1)))
static struct sleepqueue_chain sc_table[HASHSIZE];
for (i = 0; i < HASHSIZE; ++i) {
#define HASH(x) ((x * 2654435761) & (HASHSIZE - 1))
for (i = 0; i < HASHSIZE; i++)
static LIST_HEAD(bufhash, bufarea) bufhashhd[HASHSIZE]; /* buffer hash list */
static LIST_HEAD(cghd, suj_cg) cghash[HASHSIZE];
for (i = 0; i < HASHSIZE; i++)
for (i = 0; i < HASHSIZE; i++) {
for (i = 0; i < HASHSIZE; i++) {
for (i = 0; i < HASHSIZE; i++)
for (i = 0; i < HASHSIZE; i++)
for (i = 0; i < HASHSIZE; i++)
for (i = 0; i < HASHSIZE; i++)
struct blkhd sc_blkhash[HASHSIZE];
struct inohd sc_inohash[HASHSIZE];
#define INOHASH(val) (val % HASHSIZE)
static struct inotab *inotab[HASHSIZE];
pSys->dp = dictCreateHashed((unsigned)nDictCells, HASHSIZE);
#if !defined HASHSIZE /* Default size of hash table. For most uniform */
struct filterhead hashtable[HASHSIZE];
for (i = 0; i < HASHSIZE; i++) {
for (i = 0; i < HASHSIZE; i++) {