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.c256 void ucl_hash_destroy(ucl_hash_t *hashlin, ucl_hash_free_func func) in ucl_hash_destroy() argument
259 if (hashlin == NULL) { in ucl_hash_destroy()
266 hashlin->hash; in ucl_hash_destroy()
282 if (hashlin->caseless) { in ucl_hash_destroy()
284 hashlin->hash; in ucl_hash_destroy()
289 hashlin->hash; in ucl_hash_destroy()
295 DL_FOREACH_SAFE(hashlin->head, cur, tmp) in ucl_hash_destroy()
300 UCL_FREE(sizeof(*hashlin), hashlin); in ucl_hash_destroy()
303 bool ucl_hash_insert(ucl_hash_t *hashlin, const ucl_object_t *obj, in ucl_hash_insert() argument
310 if (hashlin == NULL) { in ucl_hash_insert()
[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.h463 ucl_hash_search_obj(ucl_hash_t *hashlin, ucl_object_t *obj) in ucl_hash_search_obj() argument
465 return (const ucl_object_t *) ucl_hash_search(hashlin, obj->key, obj->keylen); in ucl_hash_search_obj()
468 static inline ucl_hash_t *ucl_hash_insert_object(ucl_hash_t *hashlin,
473 ucl_hash_insert_object(ucl_hash_t *hashlin, in ucl_hash_insert_object() argument
479 if (hashlin == NULL) { in ucl_hash_insert_object()
486 nhp = hashlin; in ucl_hash_insert_object()
489 if (nhp != hashlin) { in ucl_hash_insert_object()