-
Notifications
You must be signed in to change notification settings - Fork 1
/
map.c
155 lines (132 loc) · 3.13 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
/*
cproc/map.c
Copyright © 2019 Michael Forney
Permission to use, copy, modify, and/or distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright notice
and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
*/
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "nooc.h"
#include "stack.h"
#include "ir.h"
#include "util.h"
#include "map.h"
struct map {
size_t len, cap;
struct mapkey *keys;
union mapval *vals;
};
static uint64_t
hash(const void *ptr, size_t len)
{
extern int siphash(const uint8_t *, const size_t, const uint8_t *, uint8_t *, const size_t);
static const uint8_t k[16] = {0}; // XXX: we don't have a way to get entropy in standard C
uint64_t r;
siphash(ptr, len, k, (uint8_t *)&r, sizeof(r));
return r;
}
void
mapkey(struct mapkey *k, const void *s, size_t n)
{
k->str = s;
k->len = n;
k->hash = hash(s, n);
}
struct map *
mkmap(size_t cap)
{
struct map *h;
size_t i;
assert(!(cap & (cap - 1)));
h = xmalloc(sizeof(*h));
h->len = 0;
h->cap = cap;
h->keys = xcalloc(cap, sizeof(h->keys[0]));
h->vals = xcalloc(cap, sizeof(h->vals[0]));
for (i = 0; i < cap; ++i)
h->keys[i].str = NULL;
return h;
}
void
delmap(struct map *h, void del(union mapval))
{
size_t i;
if (!h)
return;
if (del) {
for (i = 0; i < h->cap; ++i) {
if (h->keys[i].str)
del(h->vals[i]);
}
}
free(h->keys);
free(h->vals);
free(h);
}
static bool
keyequal(struct mapkey *k1, struct mapkey *k2)
{
if (k1->hash != k2->hash || k1->len != k2->len)
return false;
return memcmp(k1->str, k2->str, k1->len) == 0;
}
static size_t
keyindex(struct map *h, struct mapkey *k)
{
size_t i;
i = k->hash & (h->cap - 1);
while (h->keys[i].str && !keyequal(&h->keys[i], k))
i = (i + 1) & (h->cap - 1);
return i;
}
union mapval *
mapput(struct map *h, struct mapkey *k)
{
struct mapkey *oldkeys;
union mapval *oldvals;
size_t i, j, oldcap;
if (h->cap / 2 < h->len) {
oldkeys = h->keys;
oldvals = h->vals;
oldcap = h->cap;
h->cap *= 2;
h->keys = xcalloc(h->cap, sizeof(h->keys[0]));
h->vals = xcalloc(h->cap, sizeof(h->vals[0]));
for (i = 0; i < h->cap; ++i)
h->keys[i].str = NULL;
for (i = 0; i < oldcap; ++i) {
if (oldkeys[i].str) {
j = keyindex(h, &oldkeys[i]);
h->keys[j] = oldkeys[i];
h->vals[j] = oldvals[i];
}
}
free(oldkeys);
free(oldvals);
}
i = keyindex(h, k);
if (!h->keys[i].str) {
h->keys[i] = *k;
h->vals[i].p = NULL;
++h->len;
}
return &h->vals[i];
}
union mapval
mapget(struct map *h, struct mapkey *k)
{
size_t i;
i = keyindex(h, k);
return h->keys[i].str ? h->vals[i] : (union mapval){0};
}