Home
last modified time | relevance | path

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

/freebsd/contrib/libucl/src/
H A Ducl_hash.c270 hashlin->hash; in ucl_hash_destroy()
287 hashlin->hash; in ucl_hash_destroy()
292 hashlin->hash; in ucl_hash_destroy()
297 UCL_FREE (sizeof (*hashlin), hashlin); in ucl_hash_destroy()
314 hashlin->hash; in ucl_hash_insert()
325 hashlin->hash; in ucl_hash_insert()
354 hashlin->hash; in ucl_hash_replace()
487 hashlin->hash; in ucl_hash_delete()
505 hashlin->hash; in ucl_hash_delete()
622 qsort (hashlin->ar.a, hashlin->ar.n, sizeof (ucl_object_t *), in ucl_hash_sort()
[all …]
H A Ducl_hash.h54 void ucl_hash_destroy (ucl_hash_t* hashlin, ucl_hash_free_func func);
60 bool ucl_hash_insert (ucl_hash_t* hashlin, const ucl_object_t *obj, const char *key,
66 void ucl_hash_replace (ucl_hash_t* hashlin, const ucl_object_t *old,
72 void ucl_hash_delete (ucl_hash_t* hashlin, const ucl_object_t *obj);
77 const ucl_object_t* ucl_hash_search (ucl_hash_t* hashlin, const char *key,
88 const void* ucl_hash_iterate2 (ucl_hash_t *hashlin, ucl_hash_iter_t *iter, int *ep);
98 bool ucl_hash_iter_has_next (ucl_hash_t *hashlin, ucl_hash_iter_t iter);
105 bool ucl_hash_reserve (ucl_hash_t *hashlin, size_t sz);
107 void ucl_hash_sort (ucl_hash_t *hashlin, enum ucl_object_keys_sort_flags fl);
H A Ducl_internal.h462 ucl_hash_search_obj (ucl_hash_t* hashlin, ucl_object_t *obj) in ucl_hash_search_obj() argument
464 return (const ucl_object_t *)ucl_hash_search (hashlin, obj->key, obj->keylen); in ucl_hash_search_obj()
467 static inline ucl_hash_t * ucl_hash_insert_object (ucl_hash_t *hashlin,
472 ucl_hash_insert_object (ucl_hash_t *hashlin, in ucl_hash_insert_object() argument
478 if (hashlin == NULL) { in ucl_hash_insert_object()
484 nhp = hashlin; in ucl_hash_insert_object()
487 if (nhp != hashlin) { in ucl_hash_insert_object()