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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
/***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
*
* This software is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at https://curl.se/docs/copyright.html.
*
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
* copies of the Software, and permit persons to whom the Software is
* furnished to do so, under the terms of the COPYING file.
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
* SPDX-License-Identifier: curl
*
***************************************************************************/
#include "curl_setup.h"
#include <curl/curl.h>
#include "uint-hash.h"
#include "curl_memory.h"
/* The last #include file should be: */
#include "memdebug.h"
/* random patterns for API verification */
#ifdef DEBUGBUILD
#define CURL_UINTHASHINIT 0x7117e779
#endif
static unsigned int uint_hash_hash(unsigned int id, unsigned int slots)
{
return (id % slots);
}
struct uint_hash_entry {
struct uint_hash_entry *next;
void *value;
unsigned int id;
};
void Curl_uint_hash_init(struct uint_hash *h,
unsigned int slots,
Curl_uint_hash_dtor *dtor)
{
DEBUGASSERT(h);
DEBUGASSERT(slots);
h->table = NULL;
h->dtor = dtor;
h->size = 0;
h->slots = slots;
#ifdef DEBUGBUILD
h->init = CURL_UINTHASHINIT;
#endif
}
static struct uint_hash_entry *uint_hash_mk_entry(unsigned int id, void *value)
{
struct uint_hash_entry *e;
/* allocate the struct for the hash entry */
e = malloc(sizeof(*e));
if(e) {
e->id = id;
e->next = NULL;
e->value = value;
}
return e;
}
static void uint_hash_entry_clear(struct uint_hash *h,
struct uint_hash_entry *e)
{
DEBUGASSERT(h);
DEBUGASSERT(e);
if(e->value) {
if(h->dtor)
h->dtor(e->id, e->value);
e->value = NULL;
}
}
static void uint_hash_entry_destroy(struct uint_hash *h,
struct uint_hash_entry *e)
{
uint_hash_entry_clear(h, e);
free(e);
}
static void uint_hash_entry_unlink(struct uint_hash *h,
struct uint_hash_entry **he_anchor,
struct uint_hash_entry *he)
{
*he_anchor = he->next;
--h->size;
}
static void uint_hash_elem_link(struct uint_hash *h,
struct uint_hash_entry **he_anchor,
struct uint_hash_entry *he)
{
he->next = *he_anchor;
*he_anchor = he;
++h->size;
}
#define CURL_UINT_HASH_SLOT(h,id) h->table[uint_hash_hash(id, h->slots)]
#define CURL_UINT_HASH_SLOT_ADDR(h,id) &CURL_UINT_HASH_SLOT(h,id)
bool Curl_uint_hash_set(struct uint_hash *h, unsigned int id, void *value)
{
struct uint_hash_entry *he, **slot;
DEBUGASSERT(h);
DEBUGASSERT(h->slots);
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
if(!h->table) {
h->table = calloc(h->slots, sizeof(*he));
if(!h->table)
return FALSE; /* OOM */
}
slot = CURL_UINT_HASH_SLOT_ADDR(h, id);
for(he = *slot; he; he = he->next) {
if(he->id == id) {
/* existing key entry, overwrite by clearing old pointer */
uint_hash_entry_clear(h, he);
he->value = value;
return TRUE;
}
}
he = uint_hash_mk_entry(id, value);
if(!he)
return FALSE; /* OOM */
uint_hash_elem_link(h, slot, he);
return TRUE;
}
bool Curl_uint_hash_remove(struct uint_hash *h, unsigned int id)
{
DEBUGASSERT(h);
DEBUGASSERT(h->slots);
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
if(h->table) {
struct uint_hash_entry *he, **he_anchor;
he_anchor = CURL_UINT_HASH_SLOT_ADDR(h, id);
while(*he_anchor) {
he = *he_anchor;
if(id == he->id) {
uint_hash_entry_unlink(h, he_anchor, he);
uint_hash_entry_destroy(h, he);
return TRUE;
}
he_anchor = &he->next;
}
}
return FALSE;
}
void *Curl_uint_hash_get(struct uint_hash *h, unsigned int id)
{
DEBUGASSERT(h);
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
if(h->table) {
struct uint_hash_entry *he;
DEBUGASSERT(h->slots);
he = CURL_UINT_HASH_SLOT(h, id);
while(he) {
if(id == he->id) {
return he->value;
}
he = he->next;
}
}
return NULL;
}
static void uint_hash_clear(struct uint_hash *h)
{
if(h && h->table) {
struct uint_hash_entry *he, **he_anchor;
size_t i;
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
for(i = 0; i < h->slots; ++i) {
he_anchor = &h->table[i];
while(*he_anchor) {
he = *he_anchor;
uint_hash_entry_unlink(h, he_anchor, he);
uint_hash_entry_destroy(h, he);
}
}
}
}
void Curl_uint_hash_clear(struct uint_hash *h)
{
uint_hash_clear(h);
}
void Curl_uint_hash_destroy(struct uint_hash *h)
{
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
if(h->table) {
uint_hash_clear(h);
Curl_safefree(h->table);
}
DEBUGASSERT(h->size == 0);
h->slots = 0;
}
unsigned int Curl_uint_hash_count(struct uint_hash *h)
{
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
return h->size;
}
void Curl_uint_hash_visit(struct uint_hash *h,
Curl_uint_hash_visit_cb *cb,
void *user_data)
{
if(h && h->table && cb) {
struct uint_hash_entry *he;
size_t i;
DEBUGASSERT(h->init == CURL_UINTHASHINIT);
for(i = 0; i < h->slots; ++i) {
for(he = h->table[i]; he; he = he->next) {
if(!cb(he->id, he->value, user_data))
return;
}
}
}
}
|
