1 /* Copyright (c) 2013, Vsevolod Stakhov
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
6 * * Redistributions of source code must retain the above copyright
7 * notice, this list of conditions and the following disclaimer.
8 * * Redistributions in binary form must reproduce the above copyright
9 * notice, this list of conditions and the following disclaimer in the
10 * documentation and/or other materials provided with the distribution.
12 * THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY
13 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
14 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
15 * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
16 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
17 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
18 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
19 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
20 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
21 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 ucl_hash_create (void)
32 new = UCL_ALLOC (sizeof (ucl_hash_t));
39 void ucl_hash_destroy (ucl_hash_t* hashlin, ucl_hash_free_func *func)
41 ucl_hash_node_t *elt, *tmp;
43 HASH_ITER (hh, hashlin->buckets, elt, tmp) {
44 HASH_DELETE (hh, hashlin->buckets, elt);
48 UCL_FREE (sizeof (ucl_hash_node_t), elt);
50 UCL_FREE (sizeof (ucl_hash_t), hashlin);
54 ucl_hash_insert (ucl_hash_t* hashlin, ucl_object_t *obj, const char *key, unsigned keylen)
56 ucl_hash_node_t *node;
58 node = UCL_ALLOC (sizeof (ucl_hash_node_t));
60 HASH_ADD_KEYPTR (hh, hashlin->buckets, key, keylen, node);
64 ucl_hash_iterate (ucl_hash_t *hashlin, ucl_hash_iter_t *iter)
66 ucl_hash_node_t *elt = *iter;
69 if (hashlin == NULL || hashlin->buckets == NULL) {
72 elt = hashlin->buckets;
77 else if (elt == hashlin->buckets) {
81 *iter = elt->hh.next ? elt->hh.next : hashlin->buckets;
86 ucl_hash_iter_has_next (ucl_hash_iter_t iter)
88 ucl_hash_node_t *elt = iter;
90 return (elt == NULL || elt->hh.prev != NULL);
95 ucl_hash_search (ucl_hash_t* hashlin, const char *key, unsigned keylen)
97 ucl_hash_node_t *found;
99 if (hashlin == NULL) {
102 HASH_FIND (hh, hashlin->buckets, key, keylen, found);
111 ucl_hash_delete (ucl_hash_t* hashlin, ucl_object_t *obj)
113 ucl_hash_node_t *found;
115 HASH_FIND (hh, hashlin->buckets, obj->key, obj->keylen, found);
118 HASH_DELETE (hh, hashlin->buckets, found);