Searched refs:HASHSIZE (Results 1 – 12 of 12) sorted by relevance
47 #define HASHSIZE 128 macro48 #define HASHKEY(pgno) ((pgno - 1 + HASHSIZE) % HASHSIZE)66 TAILQ_HEAD(_hqh, _bkt) hqh[HASHSIZE];
36 #define HASHSIZE (1 << HASHSHIFT) macro40 & (HASHSIZE - 1)))50 static struct sleepqueue_chain sc_table[HASHSIZE];57 for (i = 0; i < HASHSIZE; ++i) { in _sleepq_init()
141 #define HASHSIZE 16 /* Dont change this without changing HASH() */ macro153 struct filterhead hashtable[HASHSIZE];184 for (i = 0; i < HASHSIZE; i++) { in ng_etf_constructor()457 for (i = 0; i < HASHSIZE; i++) { in ng_etf_disconnect()
132 #define HASHSIZE 1009 macro133 static struct sock *sockhash[HASHSIZE];437 HASHSIZE); in gather_sctp()565 HASHSIZE); in gather_sctp()731 hash = (int)((uintptr_t)sock->socket % HASHSIZE); in gather_inet()826 hash = (int)((uintptr_t)sock->socket % HASHSIZE); in gather_unix()1075 for (hash = 0; hash < HASHSIZE; ++hash) { in displaysock()1221 hash = (int)((uintptr_t)xf->xf_data % HASHSIZE); in display()1247 for (hash = 0; hash < HASHSIZE; hash++) { in display()
99 struct blkhd sc_blkhash[HASHSIZE];100 struct inohd sc_inohash[HASHSIZE];109 static LIST_HEAD(cghd, suj_cg) cghash[HASHSIZE];1495 for (i = 0; i < HASHSIZE; i++) in cg_build()1510 for (i = 0; i < HASHSIZE; i++) { in cg_trunc()1530 for (i = 0; i < HASHSIZE; i++) { in cg_adj_blk()1549 for (i = 0; i < HASHSIZE; i++) in cg_check_blk()1564 for (i = 0; i < HASHSIZE; i++) in cg_check_ino()1575 for (i = 0; i < HASHSIZE; i++) in cg_apply()2440 for (i = 0; i < HASHSIZE; i++) in initsuj()
147 #define HASHSIZE 2048 macro148 #define HASH(x) ((x * 2654435761) & (HASHSIZE - 1))
83 static LIST_HEAD(bufhash, bufarea) bufhashhd[HASHSIZE]; /* buffer hash list */194 for (i = 0; i < HASHSIZE; i++) in bufinit()
70 #define HASHSIZE 1000 macro71 #define INOHASH(val) (val % HASHSIZE)78 static struct inotab *inotab[HASHSIZE];
680 #if !defined HASHSIZE /* Default size of hash table. For most uniform */681 #define HASHSIZE 241 /* performance, use a prime number! */ macro
116 pSys->dp = dictCreateHashed((unsigned)nDictCells, HASHSIZE); in ficlInitSystemEx()
88 for (entry = 0; entry < HASHSIZE; ++entry) in mpool_open()
194075 #define HASHSIZE 97194143 RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */194569 return ((unsigned)iNode) % HASHSIZE;