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

  /src/include/
mpool.h 47 #define HASHSIZE 128
48 #define HASHKEY(pgno) ((pgno - 1) % HASHSIZE)
66 TAILQ_HEAD(_hqh, _bkt) hqh[HASHSIZE];
  /src/external/gpl2/xcvs/dist/src/
hash.h 17 #define HASHSIZE 151
46 Node *hasharray[HASHSIZE];
hash.c 46 return h % HASHSIZE;
67 for (i = 0; i < HASHSIZE; i++)
113 for (i = 0; i < HASHSIZE; i++)
575 (void) printf("List at %p: list = %p, HASHSIZE = %d, next = %p\n",
576 (void *) list, (void *) list->list, HASHSIZE, (void *) list->next);
578 (void) printf("List at 0x%lx: list = 0x%lx, HASHSIZE = %d, next = 0x%lx\n",
579 (unsigned long) list, (unsigned long) list->list, HASHSIZE,
  /src/games/battlestar/
parse.c 43 #define HASHSIZE 256
45 #define HASHMASK (HASHSIZE - 1)
51 static struct wlist *hashtab[HASHSIZE];
  /src/usr.bin/rdist/
lookup.c 54 static struct syment *hashtab[HASHSIZE];
138 n %= HASHSIZE;
defs.h 78 #define HASHSIZE 1021
  /src/external/gpl3/gdb.old/dist/gdb/
stabsread.h 29 #define HASHSIZE 127 /* Size of things hashed via
64 extern struct symbol *global_sym_chain[HASHSIZE];
stabsread.c 60 struct symbol *global_sym_chain[HASHSIZE];
7003 for (hash = 0; hash < HASHSIZE; hash++)
7008 if (hash >= HASHSIZE)
7086 for (hash = 0; hash < HASHSIZE; hash++)
7204 return fast_hash (name, strlen (name)) % HASHSIZE;
coffread.c 127 static struct symbol *opaque_type_chain[HASHSIZE];
  /src/external/gpl3/gdb/dist/gdb/
stabsread.h 29 #define HASHSIZE 127 /* Size of things hashed via
64 extern struct symbol *global_sym_chain[HASHSIZE];
stabsread.c 60 struct symbol *global_sym_chain[HASHSIZE];
7006 for (hash = 0; hash < HASHSIZE; hash++)
7011 if (hash >= HASHSIZE)
7089 for (hash = 0; hash < HASHSIZE; hash++)
7207 return fast_hash (name, strlen (name)) % HASHSIZE;
coffread.c 127 static struct symbol *opaque_type_chain[HASHSIZE];
  /src/external/mpl/bind/dist/lib/isc/
hashmap.c 65 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
178 .hashmask = HASHSIZE(bits) - 1,
179 .size = HASHSIZE(bits),
393 size_t newsize = HASHSIZE(newbits);
397 newsize = HASHSIZE(newbits);
489 size_t threshold = APPROX_90_PERCENT(HASHSIZE(bits));
499 size_t threshold = APPROX_20_PERCENT(HASHSIZE(bits));
ht.c 43 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
129 while (newcount >= HASHSIZE(newbits) && newbits <= HT_MAX_BITS) {
213 ht->size[idx] = HASHSIZE(ht->hashbits[idx]);
  /src/usr.bin/sockstat/
sockstat.c 95 #define HASHSIZE 1009
96 struct socklist sockhash[HASHSIZE];
401 hash = (int)(kp[i].ki_sockaddr % HASHSIZE);
465 hash = (int)(f->ki_fdata % HASHSIZE);
  /src/sbin/restore/
dirs.c 72 #define HASHSIZE 1000
73 #define INOHASH(val) (val % HASHSIZE)
80 static struct inotab *inotab[HASHSIZE];
  /src/usr.bin/tsort/
tsort.c 80 #define HASHSIZE 53 /* doesn't need to be big */
  /src/external/mpl/dhcp/bind/dist/lib/isc/
ht.c 42 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
169 while (newcount >= HASHSIZE(newbits) && newbits <= HT_MAX_BITS) {
254 ht->size[idx] = HASHSIZE(ht->hashbits[idx]);
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rbt.c 80 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
1081 size_t size = HASHSIZE(rbt->hashbits) * sizeof(dns_rbtnode_t *);
2378 size = HASHSIZE(rbt->hashbits) * sizeof(dns_rbtnode_t *);
2389 while (newcount >= HASHSIZE(newbits) && newbits < RBT_HASH_MAX_BITS) {
2410 oldsize = HASHSIZE(oldbits);
2414 newsize = HASHSIZE(rbt->hashbits);
2449 if (rbt->nodecount >= (HASHSIZE(rbt->hashbits) * RBT_HASH_OVERCOMMIT)) {
rbtdb.c 359 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
1346 size = HASHSIZE(version->glue_table_bits) *
8167 hashsize(dns_db_t *db) { function
8620 hashsize,
8672 hashsize,
10095 for (i = 0; i < HASHSIZE(version->glue_table_bits); i++) {
10111 size = HASHSIZE(version->glue_table_bits) *
10123 while (newcount >= HASHSIZE(newbits) &&
10142 oldcount = HASHSIZE(oldbits);
10146 newsize = HASHSIZE(newbits) * sizeof(version->glue_table[0])
    [all...]
zone.c 18465 #define HASHSIZE(bits) (UINT64_C(1) << (bits))
18475 while (count >= HASHSIZE(newbits) && newbits < KEYMGMT_BITS_MAX) {
18484 while (count <= HASHSIZE(newbits) && newbits > KEYMGMT_BITS_MIN) {
18501 size = HASHSIZE(mgmt->bits);
18518 size = HASHSIZE(mgmt->bits);
18544 size = HASHSIZE(bits);
18570 newsize = HASHSIZE(newbits);
  /src/lib/libc/db/mpool/
mpool.c 98 for (entry = 0; entry < HASHSIZE; ++entry)
  /src/usr.bin/m4/
main.c 64 ndptr hashtab[HASHSIZE]; /* hash table for macros etc. */
219 { "hashsize", required_argument, 0, 'H' },
  /src/external/public-domain/sqlite/dist/
sqlite3.c     [all...]

Completed in 230 milliseconds