HomeSort by: relevance | last modified time | path
    Searched refs:hashval (Results 1 - 25 of 75) sorted by relevancy

1 2 3

  /src/lib/libc/citrus/
citrus_hash.h 44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
45 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
48 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) { \
citrus_db.c 104 uint32_t hashval, num_entries; local
120 hashval = dl->dl_hashval;
125 hashval =
129 hashval * _CITRUS_DB_ENTRY_SIZE;
131 dl->dl_hashval = hashval;
153 if (be32toh(dex->dex_hash_value) != hashval)
citrus_mapper.c 326 int hashval; local
331 hashval = hash_func(mapname);
333 hashval);
362 _CITRUS_HASH_INSERT(&ma->ma_cache, cm, cm_entry, hashval);
citrus_iconv.c 263 int hashval; local
272 hashval = hash_func(convname);
274 convname, hashval);
291 _CITRUS_HASH_INSERT(&shared_pool, ci, ci_hash_entry, hashval);
  /src/games/battlestar/
parse.c 65 int hashval = 0; local
68 hashval += *s++;
69 hashval *= HASHMUL;
70 hashval &= HASHMASK;
72 return hashval;
89 int hashval; local
92 hashval = hash(wp->string);
93 wp->next = hashtab[hashval];
94 hashtab[hashval] = wp;
  /src/external/zlib/pigz/dist/zopfli/
hash.h 32 int* hashval; /* Index to hash value at this index. */ member in struct:ZopfliHash
hash.c 35 h->hashval = (int*)malloc(sizeof(*h->hashval) * window_size);
41 h->hashval[i] = -1;
69 free(h->hashval);
100 h->hashval[hpos] = h->val;
101 if (h->head[h->val] != -1 && h->hashval[h->head[h->val]] == h->val) {
  /src/external/mpl/bind/dist/lib/isc/include/isc/
hashmap.h 58 * \li 'hashval' is a precomputed hash value of 'key'
66 isc_hashmap_add(isc_hashmap_t *hashmap, const uint32_t hashval,
78 * \li 'hashval' is a precomputed hash value of 'key'
86 isc_hashmap_find(const isc_hashmap_t *hashmap, const uint32_t hashval,
94 * \li 'hashval' is a precomputed hash value of 'key'
102 isc_hashmap_delete(isc_hashmap_t *hashmap, const uint32_t hashval,
  /src/external/mpl/bind/dist/lib/isc/
ht.c 48 uint32_t hashval; member in struct:isc_ht_node
74 const uint32_t keysize, const uint32_t hashval, const uint8_t idx);
77 const uint32_t hashval, const uint8_t idx, void *value);
80 const uint32_t hashval, const uint8_t idx);
100 isc__ht_node_match(isc_ht_node_t *node, const uint32_t hashval,
102 return node->hashval == hashval && node->keysize == keysize &&
184 uint32_t hash = hash_32(node->hashval,
287 const uint32_t hashval, const uint8_t idx, void *value) {
291 hash = hash_32(hashval, ht->hashbits[idx])
310 uint32_t hashval; local
366 uint32_t hashval; local
416 uint32_t hashval; local
    [all...]
hashmap.c 74 uint32_t hashval; member in struct:hashmap_node
104 hashmap_add(isc_hashmap_t *hashmap, const uint32_t hashval,
136 hashmap_node_init(hashmap_node_t *node, const uint32_t hashval,
140 .hashval = hashval,
155 node->hashval, hashmap->tables[idx].hashbits);
159 ", hash = %" PRIu32 ", hashval = %" PRIu32
162 node->hashval, node->psl, (char *)node->key);
253 hashmap_find(const isc_hashmap_t *hashmap, const uint32_t hashval,
263 hash = isc_hash_bits32(hashval, hashmap->tables[idx].hashbits)
    [all...]
  /src/external/bsd/flex/dist/src/
sym.c 163 int hashval; local
166 hashval = 0;
170 hashval = (hashval << 1) + (unsigned char) str[locstr++];
171 hashval %= hash_size;
174 return hashval;
dfa.c 227 * hashval is the hash value for the dfa corresponding to the state set.
233 int numstates = *ns_addr, nacc, hashval, transsym, nfaccnum; local
273 hashval += state; \
290 nacc = stkend = hashval = 0;
301 hashval += ns;
336 *hv_addr = hashval;
375 int sym, hashval, numstates, dsize; local
572 &hashval);
574 if (snstods (nset, numstates, accset, nacc, hashval, &ds)) {
625 &hashval);
    [all...]
  /src/external/mpl/bind/dist/tests/isc/
hashmap_test.c 43 uint32_t hashval; member in struct:test_node
90 nodes[i].hashval = isc_hash32(nodes[i].key, 16, true);
97 long_nodes[i].hashval = isc_hash32(
105 upper_nodes[i].hashval = isc_hash32(upper_nodes[i].key, 16,
112 result = isc_hashmap_add(hashmap, nodes[i].hashval, nodes_match,
121 result = isc_hashmap_find(hashmap, nodes[i].hashval,
130 result = isc_hashmap_add(hashmap, nodes[i].hashval, nodes_match,
138 result = isc_hashmap_add(hashmap, long_nodes[i].hashval,
147 result = isc_hashmap_find(hashmap, upper_nodes[i].hashval,
156 result = isc_hashmap_find(hashmap, long_nodes[i].hashval,
409 uint32_t hashval; local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/isc/
ht.c 47 uint32_t hashval; member in struct:isc_ht_node
73 const uint32_t keysize, const uint32_t hashval, const uint8_t idx);
76 const uint32_t hashval, const uint8_t idx, void *value);
79 const uint32_t hashval, const uint8_t idx);
141 isc__ht_node_match(isc_ht_node_t *node, const uint32_t hashval,
143 return (node->hashval == hashval && node->keysize == keysize &&
224 uint32_t hash = hash_32(node->hashval,
330 const uint32_t hashval, const uint8_t idx, void *value) {
334 hash = hash_32(hashval, ht->hashbits[idx])
353 uint32_t hashval; local
409 uint32_t hashval; local
461 uint32_t hashval; local
    [all...]
  /src/bin/csh/
exec.c 115 int i, hashval, hashval1; local
119 hashval = 0;
207 hashval = hashname(*av);
218 hashval1 = hash(hashval, i);
446 int hashval, i; local
469 hashval = hash(hashname(str2short(dp->d_name)), i);
470 bis(xhash, hashval);
511 int hashval, hashval1, i; local
514 hashval = 0;
524 hashval = hashname(name)
    [all...]
  /src/sys/dev/raidframe/
rf_stripelocks.c 262 int hashval = HASH_STRIPEID(stripeID); local
272 Dprintf8("[%d] Trying to acquire stripe lock table 0x%lx SID %ld type %c range %ld-%ld, range2 %ld-%ld hashval %d\n",
275 Dprintf3("[%d] lock %ld hashval %d\n", tid, stripeID, hashval);
285 rf_lock_mutex2(lockTable[hashval].mutex);
286 for (lockDesc = lockTable[hashval].descList; lockDesc;
295 lockDesc->next = lockTable[hashval].descList;
296 lockTable[hashval].descList = lockDesc;
358 Dprintf6("[%d] conflict: lock %ld %c %ld-%ld hashval=%d not granted\n",
360 hashval);
384 int hashval = HASH_STRIPEID(stripeID); local
    [all...]
  /src/external/bsd/elftoolchain/dist/common/
uthash.h 156 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
161 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
162 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
163 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \
247 #define HASH_REPLACE_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,replaced,cmpfcn) \
250 HASH_FIND_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, replaced); \
254 HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, &((add)->fieldname), keylen_in, hashval, add, cmpfcn); \
257 #define HASH_REPLACE_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add,replaced) \
260 HASH_FIND_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, replaced); \
264 HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, add);
    [all...]
  /src/lib/libc/stdlib/
hcreate.c 203 uint32_t hashval; local
214 hashval = (*__default_hash)(item.key, len);
216 chain = &table[hashval & (head->size - 1)];
  /src/bin/sh/
alias.c 316 unsigned int hashval; local
318 hashval = *(const unsigned char *)p << 4;
320 hashval += *p++;
321 return &atab[hashval % ATABSIZE];
  /src/external/gpl2/xcvs/dist/src/
hash.c 282 int hashval; local
285 hashval = hashp (p->key);
286 if (list->hasharray[hashval] == NULL) /* make a header for list? */
290 list->hasharray[hashval] = q->hashnext = q->hashprev = q;
294 for (q = list->hasharray[hashval]->hashnext;
295 q != list->hasharray[hashval]; q = q->hashnext)
300 q = list->hasharray[hashval];
  /src/external/mpl/bind/dist/lib/dns/
badcache.c 152 bcentry_lookup(struct cds_lfht *ht, uint32_t hashval, dns__bckey_t *key) {
155 cds_lfht_lookup(ht, hashval, bcentry_match, key, &iter);
275 uint32_t hashval = bcentry_hash(&key); local
281 ht_node = cds_lfht_add_unique(ht, hashval, bcentry_match, &key,
314 uint32_t hashval = bcentry_hash(&key); local
316 dns_bcentry_t *found = bcentry_lookup(ht, hashval, &key);
  /src/external/mpl/dhcp/bind/dist/lib/dns/
badcache.c 63 unsigned int hashval; member in struct:dns_bcentry
194 bad->next = newtable[bad->hashval % newsize];
195 newtable[bad->hashval % newsize] = bad;
216 unsigned int hashval, hash; local
232 hashval = dns_name_hash(name, false);
233 hash = hashval % bc->size;
263 bad->hashval = hashval;
  /src/libexec/ld.elf_so/
symbol.c 331 const Elf32_Word *hashval; local
354 hashval = &obj->chains_gnu[bucket];
356 if (((*hashval ^ hash) >> 1) == 0) {
357 symnum = hashval - obj->chains_gnu;
364 } while ((*hashval++ & 1) == 0);
  /src/crypto/external/apache2/openssl/dist/ssl/quic/
quic_lcidm.c 76 unsigned long hashval = 0; local
91 memcpy(&hashval, digest, sizeof(hashval) < sizeof(digest) ? sizeof(hashval) : sizeof(digest));
93 return hashval;
  /src/lib/libintl/
gettext.c 387 calc_collision_step(uint32_t hashval, uint32_t hashsize)
390 return (hashval % (hashsize - 2)) + 1;
483 uint32_t hashval, idx, step; local
485 hashval = __intl_string_hash(str);
486 step = calc_collision_step(hashval, hsize);
487 idx = hashval % hsize;
799 uint32_t idx, hashval, step, strno; local
806 hashval = __intl_string_hash(msgid);
807 step = calc_collision_step(hashval, mohandle->mo.mo_hsize);
808 idx = hashval % mohandle->mo.mo_hsize
    [all...]

Completed in 36 milliseconds

1 2 3