Lines Matching refs:keylen
45 size_t keylen;
120 compute_hashval (const void *key, size_t keylen)
129 hval = keylen;
130 while (cnt < keylen)
148 const void *key, size_t keylen,
162 if (table[idx].used == hval && table[idx].keylen == keylen
163 && memcmp (table[idx].key, key, keylen) == 0)
177 if (table[idx].used == hval && table[idx].keylen == keylen
178 && memcmp (table[idx].key, key, keylen) == 0)
190 hash_find_entry (hash_table *htab, const void *key, size_t keylen,
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen));
209 const void *key, size_t keylen,
216 table[idx].keylen = keylen;
251 insert_entry_2 (htab, table[idx].key, table[idx].keylen,
253 lookup (htab, table[idx].key, table[idx].keylen,
267 const void *key, size_t keylen,
270 unsigned long int hval = compute_hashval (key, keylen);
272 size_t idx = lookup (htab, key, keylen, hval);
280 void *keycopy = obstack_copy (&htab->mem_pool, key, keylen);
281 insert_entry_2 (htab, keycopy, keylen, hval, idx, data);
294 const void *key, size_t keylen,
297 unsigned long int hval = compute_hashval (key, keylen);
299 size_t idx = lookup (htab, key, keylen, hval);
310 void *keycopy = obstack_copy (&htab->mem_pool, key, keylen);
311 insert_entry_2 (htab, keycopy, keylen, hval, idx, data);
325 hash_iterate (hash_table *htab, void **ptr, const void **key, size_t *keylen,
346 *keylen = curr->keylen;
359 const void **key, size_t *keylen,
380 *keylen = curr->keylen;