libkern/kxld/kxld_dict.c

61     const void *key;
70 static kern_return_t get_locate_index(const KXLDDict *dict, const void *key,
72 static kern_return_t get_insert_index(const KXLDDict *dict, const void *key,
165 kxld_dict_find(const KXLDDict *dict, const void *key)
172     check(key);
174     rval = get_locate_index(dict, key, &idx);
191 get_locate_index(const KXLDDict *dict, const void *key, u_int *_idx)
197     base = idx = dict->hash(dict, key);
199     /* Iterate until we match the key, wrap, or hit an empty bucket */
201     while (!dict->cmp(entry->key, key)) {
222 kxld_dict_insert(KXLDDict *dict, const void *key, void *value)
229     check(key);
244     rval = get_insert_index(dict, key, &idx);
247     /* Insert the new key-value pair into the bucket, but only count it as a
253         entry->key = key;
296             rval = kxld_dict_insert(dict, entry->key, entry->value);
314 get_insert_index(const KXLDDict *dict, const void *key, u_int *r_index)
320     base = idx = dict->hash(dict, key);
323      * bucket, or a key match.
326     while (entry->state == USED && !dict->cmp(entry->key, key)) {
342 kxld_dict_remove(KXLDDict *dict, const void *key, void **value)
349     check(key);
352     rval = get_locate_index(dict, key, &idx);
364     entry->key = NULL;
373 kxld_dict_iterator_get_next(KXLDDictIterator *iter, const void **key,
379     check(key);
382     *key = NULL;
389             *key = entry->key;
413     const char *key = _key;
420     while ((c = *key++)) {
431     uint32_t key = *(const uint32_t *) _key;
435     return (u_int) (key % dict->buckets.nitems);
441     kxld_addr_t key = *(const kxld_addr_t *) _key;
445     return (u_int) (key % dict->buckets.nitems);