1/* Copyright (c) 2013, Vsevolod Stakhov
2 * All rights reserved.
3 *
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.
11 *
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.
22 */
23
24#include "ucl_hash.h"
25#include "utlist.h"
26
27ucl_hash_t*
28ucl_hash_create (void)
29{
30	ucl_hash_t *new;
31
32	new = UCL_ALLOC (sizeof (ucl_hash_t));
33	if (new != NULL) {
34		new->buckets = NULL;
35	}
36	return new;
37}
38
39void ucl_hash_destroy (ucl_hash_t* hashlin, ucl_hash_free_func *func)
40{
41	ucl_hash_node_t *elt, *tmp;
42
43	HASH_ITER (hh, hashlin->buckets, elt, tmp) {
44		HASH_DELETE (hh, hashlin->buckets, elt);
45		if (func) {
46			func (elt->data);
47		}
48		UCL_FREE (sizeof (ucl_hash_node_t), elt);
49	}
50	UCL_FREE (sizeof (ucl_hash_t), hashlin);
51}
52
53void
54ucl_hash_insert (ucl_hash_t* hashlin, ucl_object_t *obj, const char *key, unsigned keylen)
55{
56	ucl_hash_node_t *node;
57
58	node = UCL_ALLOC (sizeof (ucl_hash_node_t));
59	node->data = obj;
60	HASH_ADD_KEYPTR (hh, hashlin->buckets, key, keylen, node);
61}
62
63void*
64ucl_hash_iterate (ucl_hash_t *hashlin, ucl_hash_iter_t *iter)
65{
66	ucl_hash_node_t *elt = *iter;
67
68	if (elt == NULL) {
69		if (hashlin == NULL || hashlin->buckets == NULL) {
70			return NULL;
71		}
72		elt = hashlin->buckets;
73		if (elt == NULL) {
74			return NULL;
75		}
76	}
77	else if (elt == hashlin->buckets) {
78		return NULL;
79	}
80
81	*iter = elt->hh.next ? elt->hh.next : hashlin->buckets;
82	return elt->data;
83}
84
85bool
86ucl_hash_iter_has_next (ucl_hash_iter_t iter)
87{
88	ucl_hash_node_t *elt = iter;
89
90	return (elt == NULL || elt->hh.prev != NULL);
91}
92
93
94ucl_object_t*
95ucl_hash_search (ucl_hash_t* hashlin, const char *key, unsigned keylen)
96{
97	ucl_hash_node_t *found;
98
99	if (hashlin == NULL) {
100		return NULL;
101	}
102	HASH_FIND (hh, hashlin->buckets, key, keylen, found);
103
104	if (found) {
105		return found->data;
106	}
107	return NULL;
108}
109
110void
111ucl_hash_delete (ucl_hash_t* hashlin, ucl_object_t *obj)
112{
113	ucl_hash_node_t *found;
114
115	HASH_FIND (hh, hashlin->buckets, obj->key, obj->keylen, found);
116
117	if (found) {
118		HASH_DELETE (hh, hashlin->buckets, found);
119	}
120}
121