-
Notifications
You must be signed in to change notification settings - Fork 0
/
hashmap.c
266 lines (218 loc) · 7.32 KB
/
hashmap.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
#include <stdio.h>
#include "hashmap.h"
#include "world.h"
static void freeChunk(chunk_t *);
static void printChunkList(chunk_t *);
static int resize(map_t *, float);
int updateChunk(map_t *hashmap, chunk_t *chunk, Vector2 cell, size_t chunkSize, int value, int which) {
int updateNext = (which > 0);
int *wstate = updateNext ? chunk->nextState : chunk->state;
size_t *alive = updateNext ? &chunk->newAlive : &chunk->alive;
if(!chunk || !wstate) return 0;
wstate[(int)cell.y + (chunkSize * (int)cell.x)] = value;
if(value == 0) {
int cond = (*alive == 0);
*alive = !cond * (*alive - 1) + cond * 0;
} else {
if(*alive == 0) {
Vector2 neighbours[8];
getChunkNeighbours(neighbours, 8, chunk->index);
for(short i = 0; i < 8; i++)
insert(hashmap, neighbours[i], chunkSize);
}
chunk->timeToLive = TIME_TO_LIVE;
*alive += *alive < (chunkSize * chunkSize);
}
return 1;
}
int getCellValue_(const chunk_t *chunk, Vector2 cell, size_t chunkSize) {
if(!chunk || !chunk->state) return -1;
return chunk->state[(int)cell.y + chunkSize * (int) cell.x];
}
int getCellValue(map_t hashmap, const chunk_t *chunk, Vector2 cell, size_t chunkSize) {
if(!chunk || !chunk->state) return -1;
int value = -1;
Vector2 sign = VSIGN(chunk->index);
Vector2 chunkIndex = chunk->index;
int changed = 0;
if(cell.x < 0 || cell.x >= chunkSize) {
int cond = cell.x < 0;
int idx = abs((int)cell.x) % chunkSize;
cell.x = cond * (chunkSize - idx) + !cond * idx;
chunkIndex.x += (cond * -1 + !cond * 1);
chunkIndex.x += (chunkIndex.x == 0) * -sign.x;
changed = 1;
}
if(cell.y < 0 || cell.y >= chunkSize) {
int cond = cell.y < 0;
int idx = abs((int)cell.y) % chunkSize;
cell.y = cond * (chunkSize - idx) + !cond * idx;
chunkIndex.y += (cond * -1 + !cond * 1);
chunkIndex.y += (chunkIndex.y == 0) * -sign.y;
changed = 1;
}
if(changed) {
chunk_t *sel = find(hashmap, chunkIndex);
if(sel) value = getCellValue_(sel, cell, chunkSize);
else value = 0;
} else {
value = getCellValue_(chunk, cell, chunkSize);
}
return value;
}
int resize(map_t *hashmap, float ammount) {
if(ammount < 0) return 0;
size_t newSize = hashmap->size * ammount;
map_t newMap = createMap(newSize);
for(size_t i = 0; i < hashmap->size; i++) {
chunk_t *current = hashmap->slots[i];
while(current) {
size_t idx = map(current->index.x, current->index.y) % newSize;
chunk_t *next = current->next;
current->next = newMap.slots[idx];
newMap.slots[idx] = current;
current = next;
}
}
free(hashmap->slots);
hashmap->slots = newMap.slots;
hashmap->size = newSize;
return 1;
}
void printChunkList(chunk_t *head) {
if(!head) return;
fprintf(stderr, "{x: %i, y: %i} %s",
(int)head->index.x, (int)head->index.y, head->next ? "-> " : "\n");
printChunkList(head->next);
}
void printMap(map_t hashmap) {
fprintf(stderr, "####\n");
/*for(size_t j = 0; j < hashmap.size; j++) {*/
/*if(hashmap.slots[j]) {*/
/*fprintf(stderr, "[%02zu]:\t", j);*/
/*printChunkList(hashmap.slots[j]);*/
/*}*/
/*}*/
fprintf(stderr, "Size: %zu Items: %zu Load: %0.2f\n", hashmap.size,
hashmap.taken,
!hashmap.size ? 0 : (float) hashmap.taken / hashmap.size );
fprintf(stderr, "####\n");
}
static void freeChunk(chunk_t *chunk) {
free(chunk->state);
free(chunk->nextState);
free(chunk);
chunk = NULL;
}
int freeChunkList(chunk_t *head) {
if(!head) return 0;
freeChunkList(head->next);
freeChunk(head);
return 1;
}
int deleteMap(map_t * hashmap) {
if(!hashmap) return 0;
for(size_t idx = 0; idx < hashmap->size; idx++) {
freeChunkList(hashmap->slots[idx]);
}
hashmap->size = 0;
hashmap->taken = 0;
return 1;
}
int drop(map_t *hashmap, Vector2 chunkIdx) {
if((float) hashmap->taken / hashmap->size < SHRINK_THRESHOLD &&
hashmap->size > MIN_SIZE) {
fprintf(stderr, "Shrinking table\n");
resize(hashmap, 0.5);
}
size_t idx = map(chunkIdx.x, chunkIdx.y) % hashmap->size;
chunk_t *head = hashmap->slots[idx];
if(head && (chunkIdx.x == head->index.x && chunkIdx.y == head->index.y)) {
chunk_t *next = head->next;
freeChunk(head);
hashmap->slots[idx] = next;
next = hashmap->slots[idx];
hashmap->taken--;
} else {
for(chunk_t *current = head; current; current = current->next) {
chunk_t *next = current->next;
if(next && (chunkIdx.x == next->index.x && chunkIdx.y == next->index.y)) {
free(next->state);
free(next->nextState);
current->next = next->next;
free(next);
hashmap->taken--;
break;
}
}
}
return 1;
}
chunk_t *insert(map_t *entry, Vector2 chunkidx, size_t chunkSize) {
if((float) (entry->taken + 1) / entry->size >= GROW_THRESHOLD &&
entry->size * 2 <= MAX_SIZE) {
fprintf(stderr, "Growing table\n");
resize(entry, 2);
}
size_t idx = map((int)chunkidx.x, (int)chunkidx.y) % entry->size;
chunk_t *update = search(entry->slots[idx], chunkidx);
if(update != NULL) return update;
chunk_t *chunk = createChunk(chunkidx, chunkSize);
if(!chunk) return NULL;
chunk->next = entry->slots[idx];
entry->slots[idx] = chunk;
entry->taken++;
return chunk;
}
map_t createMap(size_t mapSize) {
map_t newMap;
chunk_t **heads = malloc(mapSize * sizeof(chunk_t *));
newMap.slots = heads;
for(size_t i = 0; i < mapSize; i++)
newMap.slots[i] = NULL;
newMap.taken = 0;
newMap.size = mapSize;
return newMap;
}
chunk_t *createChunk(Vector2 index, size_t chunkSize) {
chunk_t *newChunk = malloc(sizeof(chunk_t));
newChunk->index = index;
newChunk->alive = 0;
newChunk->newAlive = 0;
newChunk->timeToLive = TIME_TO_LIVE;
newChunk->state = calloc(chunkSize * chunkSize, sizeof(int));
newChunk->nextState = calloc(chunkSize * chunkSize, sizeof(int));
if(!newChunk->state) {
newChunk->index.x = 0;
newChunk->index.y = 0;
}
newChunk->next = NULL;
return newChunk;
}
chunk_t *search(chunk_t *head, Vector2 index) {
if(!head) return NULL;
if(index.x == head->index.x && index.y == head->index.y) return head;
return search(head->next, index);
}
chunk_t *find(map_t hashmap, Vector2 index) {
size_t idx = map(index.x, index.y) % hashmap.size;
return search(hashmap.slots[idx], index);
}
/*
Hash function taken from:
https://www.forceflow.be/2013/10/07/morton-encodingdecoding-through-bit-interleaving-implementations/
*/
static uint64_t splitBy3(int a){
uint64_t x = a & 0x1fffff;
x = (x | x << 32) & 0x1f00000000ffff;
x = (x | x << 16) & 0x1f0000ff0000ff;
x = (x | x << 8) & 0x100f00f00f00f00f;
x = (x | x << 4) & 0x10c30c30c30c30c3;
x = (x | x << 2) & 0x1249249249249249;
return x;
}
uint64_t map(int x, int y) {
uint64_t answer = 0;
answer |= splitBy3(x) | splitBy3(y) << 1;
return answer;
}