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
|
#include <stdlib.h>
#include <inttypes.h>
#include "hashtable.h"
struct _htbl {
int (*eq)(const void *, const void *);
uint32_t (*hash)(const void *);
struct _any **buckets;
size_t buckcnt;
size_t size;
size_t keyoff;
size_t chainoff;
};
#define KEYP(tbl, o) ((void *)(o) + (tbl)->keyoff)
#define CHAINP(tbl, o) *(struct _any **)((void *)(o) + (tbl)->chainoff)
struct _htbl *
_htbl_create(int (*eq)(const void *, const void *),
uint32_t (*hash)(const void *), size_t keyoff, size_t chainoff)
{
struct _htbl *tbl = calloc(1, sizeof(*tbl));
if (tbl == NULL)
return NULL;
tbl->size = 0;
tbl->buckcnt = 1;
tbl->keyoff = keyoff;
tbl->chainoff = chainoff;
tbl->hash = hash;
tbl->eq = eq;
tbl->buckets = calloc(tbl->buckcnt, sizeof(*tbl->buckets));
if (tbl->buckets == NULL) {
free(tbl);
return NULL;
}
return tbl;
}
void
_htbl_free(struct _htbl *tbl)
{
free(tbl->buckets);
free(tbl);
}
static struct _any *
bucket_rev(struct _htbl *tbl, struct _any *p, struct _any *n)
{
while (n != NULL) {
struct _any *s = CHAINP(tbl, n);
CHAINP(tbl, n) = p;
p = n;
n = s;
}
return p;
}
static void
bucket_insert(struct _htbl *tbl, struct _any *o)
{
size_t bi = tbl->hash(KEYP(tbl, o)) % tbl->buckcnt;
CHAINP(tbl, o) = tbl->buckets[bi];
tbl->buckets[bi] = o;
}
static void
_htbl_grow(struct _htbl *tbl)
{
size_t ncnt = 2 * tbl->buckcnt + 1;
size_t ocnt = tbl->buckcnt;
struct _any **obuckets = tbl->buckets;
struct _any **nbuckets = calloc(ncnt, sizeof(*nbuckets));
if (nbuckets == NULL)
return;
tbl->buckcnt = ncnt;
tbl->buckets = nbuckets;
for (size_t i = 0; i < ocnt; i++) {
struct _any *o = bucket_rev(tbl, NULL, obuckets[i]);
while (o != NULL) {
struct _any *s = CHAINP(tbl, o);
bucket_insert(tbl, o);
o = s;
}
}
free(obuckets);
}
void
_htbl_insert(struct _htbl *tbl, struct _any *o)
{
bucket_insert(tbl, o);
tbl->size++;
if (tbl->size > tbl->buckcnt * 4 / 5)
_htbl_grow(tbl);
}
struct _any *
_htbl_find(struct _htbl *tbl, const void *key)
{
struct _any *ret;
size_t bi = tbl->hash(key) % tbl->buckcnt;
for (ret = tbl->buckets[bi]; ret != NULL; ret = CHAINP(tbl, ret))
if (tbl->eq(KEYP(tbl, ret), key))
return ret;
return NULL;
}
struct _any *
_htbl_remove(struct _htbl *tbl, const void *key)
{
size_t bi = tbl->hash(key) % tbl->buckcnt;
struct _any *p = NULL, *o = tbl->buckets[bi];
while (o != NULL && !tbl->eq(KEYP(tbl, o), key)) {
p = o;
o = CHAINP(tbl, o);
}
if (o != NULL) {
if (p == NULL)
tbl->buckets[bi] = CHAINP(tbl, o);
else
CHAINP(tbl, p) = CHAINP(tbl, o);
tbl->size--;
}
return o;
}
void
_htbl_tov(struct _htbl *tbl, struct _any **v)
{
size_t vi = 0;
size_t bi = 0;
struct _any *o = tbl->buckets[bi];
while (vi < tbl->size) {
while (o == NULL) {
bi++;
o = tbl->buckets[bi];
}
v[vi] = o;
vi++;
o = CHAINP(tbl, o);
}
}
size_t
_htbl_size(struct _htbl *tbl)
{
return tbl->size;
}
void
_htbl_iter_init(struct _htbl *tbl, struct htbl_iter *it)
{
it->tbl = tbl;
it->bi = 0;
it->cnt = 0;
it->obj = NULL;
}
struct _any *
_htbl_iter_next(struct htbl_iter *it)
{
if (it->cnt == it->tbl->size)
return NULL;
it->obj = it->cnt == 0 ?
it->tbl->buckets[it->bi] : CHAINP(it->tbl, it->obj);
while (it->obj == NULL) {
it->bi++;
it->obj = it->tbl->buckets[it->bi];
}
it->cnt++;
return it->obj;
}
|