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
|
#include <stdlib.h>
#include <string.h>
#include "types.h"
void
array_init(struct array *array)
{
memset(array, 0, sizeof *array);
}
void
array_release(struct array *array)
{
free(array->data);
}
void *
array_add(struct array *array, int size)
{
int alloc;
void *data, *p;
if (array->alloc > 0)
alloc = array->alloc;
else
alloc = 16;
while (alloc < array->size + size)
alloc *= 2;
if (array->alloc < alloc) {
data = realloc(array->data, alloc);
if (data == NULL)
return 0;
array->data = data;
array->alloc = alloc;
}
p = array->data + array->size;
array->size += size;
return p;
}
/* RAZOR_IMMEDIATE and RAZOR_ENTRY_LAST must have the same value */
#define RAZOR_ENTRY_LAST 0x80
#define RAZOR_IMMEDIATE 0x80
#define RAZOR_EMPTY_LIST 0xff
void
list_set_empty(struct list_head *head)
{
head->list_ptr = ~0;
head->flags = RAZOR_EMPTY_LIST;
}
void
list_set_ptr(struct list_head *head, uint32_t ptr)
{
head->list_ptr = ptr;
head->flags = 0;
}
void
list_set_array(struct list_head *head, struct array *pool,
struct array *items, int force_indirect)
{
struct list *p;
if (!force_indirect) {
if (items->size == 0) {
list_set_empty(head);
return;
} else if (items->size == sizeof (uint32_t)) {
head->list_ptr = *(uint32_t *) items->data;
head->flags = RAZOR_IMMEDIATE;
return;
}
}
p = array_add(pool, items->size);
memcpy(p, items->data, items->size);
p[items->size / sizeof *p - 1].flags = RAZOR_ENTRY_LAST;
list_set_ptr(head, p - (struct list *) pool->data);
}
struct list *
list_first(struct list_head *head, struct array *pool)
{
if (head->flags == RAZOR_EMPTY_LIST)
return NULL;
else if (head->flags == RAZOR_IMMEDIATE)
return (struct list *) head;
else
return (struct list *) pool->data + head->list_ptr;
}
struct list *
list_next(struct list *list)
{
if (list->flags)
return NULL;
return ++list;
}
void
list_remap_pool(struct array *pool, uint32_t *map)
{
struct list *p, *end;
end = pool->data + pool->size;
for (p = pool->data; p < end; p++)
p->data = map[p->data];
}
void
list_remap_head(struct list_head *head, uint32_t *map)
{
if (head->flags == RAZOR_IMMEDIATE)
head->list_ptr = map[head->list_ptr];
}
void
hashtable_init(struct hashtable *table, struct array *pool)
{
array_init(&table->buckets);
table->pool = pool;
}
void
hashtable_release(struct hashtable *table)
{
array_release(&table->buckets);
}
static unsigned int
hash_string(const char *key)
{
const char *p;
unsigned int hash = 0;
for (p = key; *p; p++)
hash = (hash * 617) ^ *p;
return hash;
}
uint32_t
hashtable_lookup(struct hashtable *table, const char *key)
{
unsigned int mask, start, i;
uint32_t *b;
char *pool;
pool = table->pool->data;
mask = table->buckets.alloc - 1;
start = hash_string(key) * sizeof(uint32_t);
for (i = 0; i < table->buckets.alloc; i += sizeof *b) {
b = table->buckets.data + ((start + i) & mask);
if (*b == 0)
return 0;
if (strcmp(key, &pool[*b]) == 0)
return *b;
}
return 0;
}
static void
do_insert(struct hashtable *table, uint32_t value)
{
unsigned int mask, start, i;
uint32_t *b;
const char *key;
key = (char *) table->pool->data + value;
mask = table->buckets.alloc - 1;
start = hash_string(key) * sizeof(uint32_t);
for (i = 0; i < table->buckets.alloc; i += sizeof *b) {
b = table->buckets.data + ((start + i) & mask);
if (*b == 0) {
*b = value;
break;
}
}
}
static uint32_t
add_to_string_pool(struct hashtable *table, const char *key)
{
int len;
char *p;
len = strlen(key) + 1;
p = array_add(table->pool, len);
memcpy(p, key, len);
return p - (char *) table->pool->data;
}
uint32_t
hashtable_insert(struct hashtable *table, const char *key)
{
uint32_t value, *buckets, *b, *end;
int alloc;
alloc = table->buckets.alloc;
array_add(&table->buckets, 4 * sizeof *buckets);
if (alloc != table->buckets.alloc) {
end = table->buckets.data + alloc;
memset(end, 0, table->buckets.alloc - alloc);
for (b = table->buckets.data; b < end; b++) {
value = *b;
if (value != 0) {
*b = 0;
do_insert(table, value);
}
}
}
value = add_to_string_pool(table, key);
do_insert (table, value);
return value;
}
uint32_t
hashtable_tokenize(struct hashtable *table, const char *string)
{
uint32_t token;
if (string == NULL)
string = "";
token = hashtable_lookup(table, string);
if (token != 0)
return token;
return hashtable_insert(table, string);
}
|
