-
Notifications
You must be signed in to change notification settings - Fork 16
/
Map.c
342 lines (259 loc) · 7 KB
/
Map.c
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
/*
* Copyright (c) 2010-2011 Kevin M. Bowling, <kevin.bowling@kev009.com>, USA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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 BY THE AUTHOR "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 THE 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 <craftd/Map.h>
CDMap*
CD_CreateMap (void)
{
CDMap* self = CD_malloc(sizeof(CDMap));
self->raw = kh_init(cdMap);
assert(self->raw);
if (pthread_rwlock_init(&self->lock, NULL) != 0) {
CD_abort("pthread rwlock failed to initialize");
}
return self;
}
CDMap*
CD_CloneMap (CDMap* self)
{
CDMap* cloned = CD_CreateMap();
assert(self);
CD_MAP_FOREACH(self, it) {
CD_MapPut(cloned, CD_MapIteratorKey(it), CD_MapIteratorValue(it));
}
return cloned;
}
void
CD_DestroyMap (CDMap* self)
{
assert(self);
kh_destroy(cdMap, self->raw);
pthread_rwlock_destroy(&self->lock);
CD_free(self);
}
size_t
CD_MapLength (CDMap* self)
{
size_t result;
assert(self);
pthread_rwlock_rdlock(&self->lock);
result = kh_size(self->raw);
pthread_rwlock_unlock(&self->lock);
return result;
}
CDMapIterator
CD_MapBegin (CDMap* self)
{
CDMapIterator it;
assert(self);
pthread_rwlock_rdlock(&self->lock);
it.raw = kh_end(self->raw);
it.parent = self;
if (!kh_exist(self->raw, it.raw)) {
it = CD_MapNext(it);
}
pthread_rwlock_unlock(&self->lock);
return it;
}
CDMapIterator
CD_MapEnd (CDMap* self)
{
CDMapIterator it;
assert(self);
pthread_rwlock_rdlock(&self->lock);
it.raw = kh_begin(self->raw) - 1;
it.parent = self;
pthread_rwlock_unlock(&self->lock);
return it;
}
CDMapIterator
CD_MapNext (CDMapIterator it)
{
if (it.raw == kh_begin(it.parent->raw)) {
return CD_MapEnd(it.parent);
}
it.raw--;
pthread_rwlock_rdlock(&it.parent->lock);
for (; it.raw != kh_begin(it.parent->raw) && !kh_exist(it.parent->raw, it.raw); it.raw--) {
continue;
}
if (!kh_exist(it.parent->raw, it.raw)) {
it = CD_MapEnd(it.parent);
}
pthread_rwlock_unlock(&it.parent->lock);
return it;
}
CDMapIterator
CD_MapPrevious (CDMapIterator it)
{
if (it.raw == kh_end(it.parent->raw)) {
return CD_MapBegin(it.parent);
}
it.raw++;
pthread_rwlock_rdlock(&it.parent->lock);
for (; it.raw != kh_end(it.parent->raw) && !kh_exist(it.parent->raw, it.raw); it.raw++) {
continue;
}
if (!kh_exist(it.parent->raw, it.raw)) {
it = CD_MapBegin(it.parent);
}
pthread_rwlock_unlock(&it.parent->lock);
return it;
}
bool
CD_MapIteratorIsEqual (CDMapIterator a, CDMapIterator b)
{
return a.raw == b.raw && a.parent == b.parent;
}
CDMapId
CD_MapIteratorKey (CDMapIterator it)
{
CDMapId result = 0;
pthread_rwlock_rdlock(&it.parent->lock);
result = kh_key(it.parent->raw, it.raw);
pthread_rwlock_unlock(&it.parent->lock);
return result;
}
CDPointer
CD_MapIteratorValue (CDMapIterator it)
{
CDPointer result = CDNull;
pthread_rwlock_rdlock(&it.parent->lock);
result = kh_value(it.parent->raw, it.raw);
pthread_rwlock_unlock(&it.parent->lock);
return result;
}
bool
CD_MapIteratorValid (CDMapIterator it)
{
bool result = false;
pthread_rwlock_rdlock(&it.parent->lock);
result = kh_exist(it.parent->raw, it.raw);
pthread_rwlock_unlock(&it.parent->lock);
return result;
}
bool
CD_MapHasKey (CDMap* self, CDMapId id)
{
bool result = false;
pthread_rwlock_rdlock(&self->lock);
khiter_t it = kh_get(cdMap, self->raw, id);
if (it != kh_end(self->raw)) {
result = kh_exist(self->raw, it);
}
pthread_rwlock_unlock(&self->lock);
return result;
}
CDPointer
CD_MapGet (CDMap* self, CDMapId id)
{
CDPointer result = (CDPointer) NULL;
khiter_t it;
assert(self);
pthread_rwlock_rdlock(&self->lock);
it = kh_get(cdMap, self->raw, id);
if (it != kh_end(self->raw) && kh_exist(self->raw, it)) {
result = kh_value(self->raw, it);
}
pthread_rwlock_unlock(&self->lock);
return result;
}
CDPointer
CD_MapPut (CDMap* self, CDMapId id, CDPointer data)
{
CDPointer old = (CDPointer) NULL;
khiter_t it;
int ret;
assert(self);
pthread_rwlock_wrlock(&self->lock);
it = kh_get(cdMap, self->raw, id);
if (it != kh_end(self->raw) && kh_exist(self->raw, it)) {
old = kh_value(self->raw, it);
}
else {
it = kh_put(cdMap, self->raw, id, &ret);
}
kh_value(self->raw, it) = data;
pthread_rwlock_unlock(&self->lock);
return old;
}
CDPointer
CD_MapDelete (CDMap* self, CDMapId id)
{
CDPointer old = (CDPointer) NULL;
khiter_t it;
assert(self);
pthread_rwlock_wrlock(&self->lock);
it = kh_get(cdMap, self->raw, id);
if (it != kh_end(self->raw) && kh_exist(self->raw, it)) {
old = kh_value(self->raw, it);
}
kh_del(cdMap, self->raw, it);
pthread_rwlock_unlock(&self->lock);
return old;
}
CDPointer
CD_MapFirst (CDMap* self)
{
return CD_MapIteratorValue(CD_MapBegin(self));
}
CDPointer
CD_MapLast (CDMap* self)
{
return CD_MapIteratorValue(CD_MapPrevious(CD_MapEnd(self)));
}
CDPointer*
CD_MapClear (CDMap* self)
{
CDPointer* result = CD_malloc(sizeof(CDPointer) * (CD_MapLength(self) + 1));
size_t i = 0;
khiter_t it;
assert(self);
pthread_rwlock_wrlock(&self->lock);
for (it = kh_begin(self->raw); it != kh_end(self->raw); it++) {
if (kh_exist(self->raw, it)) {
result[i++] = kh_value(self->raw, it);
}
}
result[i] = CDNull;
kh_clear(cdMap, self->raw);
pthread_rwlock_unlock(&self->lock);
return result;
}
bool
CD_MapStartIterating (CDMap* self)
{
assert(self);
pthread_rwlock_rdlock(&self->lock);
return true;
}
bool
CD_MapStopIterating (CDMap* self, bool stop)
{
assert(self);
if (!stop) {
pthread_rwlock_unlock(&self->lock);
}
return stop;
}