Home
last modified time | relevance | path

Searched refs:keylen (Results 1 – 3 of 3) sorted by relevance

/locale/programs/
A Dsimple-hash.c53 size_t keylen; member
101 size_t idx = lookup (htab, key, keylen, hval); in insert_entry()
110 keylen, hval, idx, data); in insert_entry()
123 table[idx].keylen = keylen; in insert_entry_2()
170 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in find_entry()
184 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in set_entry()
196 size_t *keylen, void **data) in iterate_table() argument
212 *keylen = ((hash_entry *) *ptr)->keylen; in iterate_table()
237 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
238 && memcmp (table[idx].key, key, keylen) == 0) in lookup()
[all …]
A Dsimple-hash.h37 extern int insert_entry (hash_table *htab, const void *key, size_t keylen,
39 extern int find_entry (const hash_table *htab, const void *key, size_t keylen,
41 extern int set_entry (hash_table *htab, const void *key, size_t keylen,
45 const void **key, size_t *keylen, void **data)
48 extern uint32_t compute_hashval (const void *key, size_t keylen)
/locale/
A Dhashval.h25 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
35 hval = keylen; in compute_hashval()
36 while (cnt < keylen) in compute_hashval()

Completed in 7 milliseconds