HASHSIZE
#define INOHASH(val) (val % HASHSIZE)
static struct inotab *inotab[HASHSIZE];
hash_node_t *hash_table[HASHSIZE];
index = index % HASHSIZE;
n %= HASHSIZE;
static struct syment *hashtab[HASHSIZE];
static long hashsize = HASHSIZE;
static cachenode_t *names[HASHSIZE];
static cachenode_t *groups[HASHSIZE];
static cachenode_t *uids[HASHSIZE];
static cachenode_t *gids[HASHSIZE];
for (c = table[h & (HASHSIZE - 1)]; c != NULL; c = c->next) {
for (c = table[h & (HASHSIZE - 1)]; c != NULL; c = c->next) {
c->next = table[signature & (HASHSIZE - 1)];
table[signature & (HASHSIZE - 1)] = c;
#ifndef HASHSIZE
t->hsize = HASHSIZE; /* no need to store---it's memory-only */
t->hsize = HASHSIZE; /* no need to store---it's memory-only */
for (entry = 0; entry < HASHSIZE; ++entry)
#define HASHKEY(pgno) ((pgno - 1) % HASHSIZE)
CIRCLEQ_HEAD(_hqh, _bkt) hqh[HASHSIZE];
if (init_cache(&grnam_cache, HASHSIZE, BSZ,
if (init_cache(&pwnam_cache, HASHSIZE, BSZ,
if (init_cache(&grgid_cache, HASHSIZE, BSZ,
if (init_cache(&pwuid_cache, HASHSIZE, BSZ,
for (i = 0; i < HASHSIZE; i++) {
for (Lp = &P->hashtab[lwpid % (HASHSIZE - 1)];
(P->hashtab = calloc(HASHSIZE, sizeof (struct ps_lwphandle *)))
uint32_t rm_key[HASHSIZE/BYTES_IN_WORD]; /* FIPS XKEY */
uint32_t rm_seed[HASHSIZE/BYTES_IN_WORD]; /* seed for rekey */
uint32_t rm_previous[HASHSIZE/BYTES_IN_WORD]; /* prev random */
uint32_t tempout[HASHSIZE/BYTES_IN_WORD];
uint32_t seed[HASHSIZE/BYTES_IN_WORD];
nblock = howmany(len, HASHSIZE);
for (i = 0; i < HASHSIZE; i++) {
bcopy(rmp->rm_mag.rm_seed, seed, HASHSIZE);
if (bytes >= HASHSIZE) {
size = HASHSIZE;
size = min(bytes, HASHSIZE);
for (i = 0; i < HASHSIZE/BYTES_IN_WORD; i++) {
if (i == HASHSIZE/BYTES_IN_WORD) {
HASHSIZE);
bzero(seed, HASHSIZE);
bzero(tempout, HASHSIZE);
rndbuf_len = roundup(rndbuf_len, HASHSIZE);
uint8_t discard_buf[HASHSIZE];
(void) swrand_get_entropy((uint8_t *)swrand_XKEY, HASHSIZE, B_TRUE);
bcopy(swrand_XKEY, previous_bytes, HASHSIZE);
uint8_t digest[HASHSIZE], *pool;
uint32_t tempout[HASHSIZE/BYTES_IN_WORD];
bytes = min(HASHSIZE, len);
for (i = 0; i < HASHSIZE; i++) {
if (len >= HASHSIZE) {
size = HASHSIZE;
size = min(bytes, HASHSIZE);
for (i = 0; i < HASHSIZE/BYTES_IN_WORD; i++) {
if (i == HASHSIZE/BYTES_IN_WORD) {
bcopy(tempout, previous_bytes, HASHSIZE);
if (len < HASHSIZE) {
leftover_bytes = HASHSIZE - bytes;
bzero(digest, HASHSIZE);
bzero(tempout, HASHSIZE);
uint8_t digest[HASHSIZE];
for (i = 0; i < RNDPOOLSIZE/HASHSIZE + 1; i++) {
k = (start + HASHSIZE) & (RNDPOOLSIZE - 1);
for (j = 0; j < HASHSIZE; j++) {
start = (start + HASHSIZE) & (RNDPOOLSIZE - 1);
uint8_t digest[HASHSIZE];
swrand_add_bytes(digest, HASHSIZE);
static uint8_t leftover[HASHSIZE]; /* leftover output */
static uint32_t previous_bytes[HASHSIZE/BYTES_IN_WORD]; /* prev random bytes */
uint8_t random_bytes[2 * HASHSIZE];