1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/* Copyright (c) 2013, Vsevolod Stakhov
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "ucl_hash.h"
#include "utlist.h"
ucl_hash_t*
ucl_hash_create (void)
{
ucl_hash_t *new;
new = UCL_ALLOC (sizeof (ucl_hash_t));
if (new != NULL) {
new->buckets = NULL;
}
return new;
}
void ucl_hash_destroy (ucl_hash_t* hashlin, ucl_hash_free_func *func)
{
ucl_hash_node_t *elt, *tmp;
HASH_ITER (hh, hashlin->buckets, elt, tmp) {
HASH_DELETE (hh, hashlin->buckets, elt);
if (func) {
func (elt->data);
}
UCL_FREE (sizeof (ucl_hash_node_t), elt);
}
UCL_FREE (sizeof (ucl_hash_t), hashlin);
}
void
ucl_hash_insert (ucl_hash_t* hashlin, ucl_object_t *obj, const char *key, unsigned keylen)
{
ucl_hash_node_t *node;
node = UCL_ALLOC (sizeof (ucl_hash_node_t));
node->data = obj;
HASH_ADD_KEYPTR (hh, hashlin->buckets, key, keylen, node);
}
void*
ucl_hash_iterate (ucl_hash_t *hashlin, ucl_hash_iter_t *iter)
{
ucl_hash_node_t *elt = *iter;
if (elt == NULL) {
if (hashlin == NULL || hashlin->buckets == NULL) {
return NULL;
}
elt = hashlin->buckets;
if (elt == NULL) {
return NULL;
}
}
else if (elt == hashlin->buckets) {
return NULL;
}
*iter = elt->hh.next ? elt->hh.next : hashlin->buckets;
return elt->data;
}
bool
ucl_hash_iter_has_next (ucl_hash_iter_t iter)
{
ucl_hash_node_t *elt = iter;
return (elt == NULL || elt->hh.prev != NULL);
}
ucl_object_t*
ucl_hash_search (ucl_hash_t* hashlin, const char *key, unsigned keylen)
{
ucl_hash_node_t *found;
if (hashlin == NULL) {
return NULL;
}
HASH_FIND (hh, hashlin->buckets, key, keylen, found);
if (found) {
return found->data;
}
return NULL;
}
void
ucl_hash_delete (ucl_hash_t* hashlin, ucl_object_t *obj)
{
ucl_hash_node_t *found;
HASH_FIND (hh, hashlin->buckets, obj->key, obj->keylen, found);
if (found) {
HASH_DELETE (hh, hashlin->buckets, found);
}
}
|
