HomeSort by: relevance | last modified time | path
    Searched refs:hashsize (Results 1 - 16 of 16) sorted by relevancy

  /src/lib/libc/citrus/
citrus_hash.c 47 _citrus_string_hash_func(const char *key, int hashsize)
53 return (int)(_db_hash_std(NULL, &r) % (uint32_t)hashsize);
citrus_hash.h 33 #define _CITRUS_HASH_HEAD(headname, type, hashsize) \
35 LIST_HEAD(, type) chh_table[hashsize]; \
37 #define _CITRUS_HASH_INIT(head, hashsize) \
40 for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++) \
  /src/sys/coda/
coda_io.h 59 struct coda_resize { int hashsize, heapsize; }; member in struct:coda_resize
coda_namecache.c 671 coda_nc_resize(int hashsize, int heapsize, enum dc_status dcstat)
673 if ((hashsize % 2) || (heapsize % 2)) { /* Illegal hash or cache sizes */
685 coda_nc_hashsize = hashsize;
coda_psdev.c 400 return(coda_nc_resize(data->hashsize, data->heapsize, IS_DOWNCALL));
  /src/sys/opencrypto/
xform.c 206 .hashsize = 0,
215 .hashsize = 16,
224 .hashsize = 20,
233 .hashsize = 20,
242 .hashsize = 16,
251 .hashsize = 20,
260 .hashsize = 20,
269 .hashsize = 16,
278 .hashsize = 20,
287 .hashsize = 16
    [all...]
xform.h 34 u_int16_t hashsize; member in struct:auth_hash
cryptosoft.c 519 axf->Update(&ctx, aalg, axf->auth_hash->hashsize);
  /src/sys/kern/
subr_hash.c 93 u_long hashsize, i; local in function:hashinit
103 hashsize = 1UL << (ilog2(elements - 1) + 1);
106 p = kmem_alloc(hashsize * esize, waitok ? KM_SLEEP : KM_NOSLEEP);
113 for (i = 0; i < hashsize; i++)
118 for (i = 0; i < hashsize; i++)
123 for (i = 0; i < hashsize; i++)
128 for (i = 0; i < hashsize; i++)
132 *hashmask = hashsize - 1;
sys_aio.c 1357 aiocbp_init(struct aiosp *aiosp, u_int hashsize)
1359 if (!powerof2(hashsize)) {
1363 aiosp->aio_hash = kmem_zalloc(hashsize * sizeof(*aiosp->aio_hash),
1366 aiosp->aio_hash_mask = hashsize - 1;
1367 aiosp->aio_hash_size = hashsize;
1371 for (size_t i = 0; i < hashsize; i++) {
vfs_wapbl.c 2778 unsigned long i, hashsize; local in function:wapbl_blkhash_init
2780 for (hashsize = 1; hashsize < size; hashsize <<= 1)
2782 wr->wr_blkhash = wapbl_alloc(hashsize *
2784 for (i = 0; i < hashsize; i++)
2786 wr->wr_blkhashmask = hashsize - 1;
  /src/sys/net/npf/
lpm.c 86 unsigned hashsize; member in struct:__anonb46cf3be0108
114 if (!hmap->hashsize) {
118 for (unsigned i = 0; i < hmap->hashsize; i++) {
133 kmem_free(hmap->bucket, hmap->hashsize * sizeof(lpm_ent_t *));
135 hmap->hashsize = 0;
173 unsigned hashsize; local in function:hashmap_rehash
175 for (hashsize = 1; hashsize < size; hashsize <<= 1) {
178 bucket = kmem_zalloc(hashsize * sizeof(lpm_ent_t *), flags)
    [all...]
  /src/usr.bin/vmstat/
vmstat.c 1907 int hashsize; /* nlist index for hash size */ member in struct:kernel_hash
1943 u_long hashsize, i; local in function:dohashstat
1957 if (hashnl[curhash->hashsize].n_value == 0 ||
1961 hashnl[curhash->hashsize].n_name + 1,
1969 if (strcmp(hashnl[curhash->hashsize].n_name + 1,
1971 hashnl[curhash->hashsize].n_value != 0 &&
1989 if (hashnl[curhash->hashsize].n_value == 0 ||
1993 strcmp(hashnl[curhash->hashsize].n_name + 1, hashname))
2009 deref_kptr((void *)hashnl[curhash->hashsize].n_value,
2010 &hashsize, sizeof(hashsize)
    [all...]
  /src/lib/libintl/
gettext.c 387 calc_collision_step(uint32_t hashval, uint32_t hashsize)
389 _DIAGASSERT(hashsize>2);
390 return (hashval % (hashsize - 2)) + 1;
397 calc_next_index(uint32_t curidx, uint32_t hashsize, uint32_t step)
399 return curidx+step - (curidx >= hashsize-step ? hashsize : 0);
  /src/sys/uvm/
uvm_pdpolicy_clockpro.c 361 static size_t hashsize = 1; variable in typeref:typename:size_t
430 oldsz = hashsize;
432 hashsize = sz;
445 return &buckets[hash % hashsize];
  /src/sys/dev/ic/
tulip.c 2553 uint32_t hash, hashsize; local in function:tlp_filter_setup
2576 hashsize = TULIP_PNICII_HASHSIZE;
2580 hashsize = TULIP_MCHASHSIZE;
2687 hash = tlp_mchash(enm->enm_addrlo, hashsize);
2695 hash = tlp_mchash(etherbroadcastaddr, hashsize);
2701 hash = tlp_mchash(enaddr, hashsize);

Completed in 30 milliseconds