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
|
#include "lib9.h"
#include "logfs.h"
#include "local.h"
typedef struct MapNode {
struct MapNode *next;
uchar e[1]; // entry goes here, inline
} MapNode;
struct Map {
int size;
int (*hash)(void *key, int size);
int (*compare)(void *entry, void *key);
int (*allocsize)(void *key);
void (*free)(void *entry);
MapNode *head[1];
};
char *
logfsmapnew(int size, int (*hash)(void *key, int size), int (*compare)(void *entry, void *key), int (*allocsize)(void *key), void (*free)(void *), Map **mapp)
{
Map *p;
*mapp = p = logfsrealloc(nil, sizeof(Map) + (size - 1) * sizeof(MapNode *));
if(p == nil)
return Enomem;
p->size = size;
p->hash = hash;
p->compare = compare;
p->allocsize = allocsize;
p->free = free;
return nil;
}
void
logfsmapfree(FidMap **mp)
{
FidMap *m;
int i;
m = *mp;
if(m == nil)
return;
for(i = 0; i < m->size; i++) {
MapNode *n, *next;
n = m->head[i];
while(n) {
next = n->next;
if(m->free)
(*m->free)(n->e);
logfsfreemem(n);
n = next;
}
}
logfsfreemem(m);
*mp = nil;
}
static char *
find(FidMap *m, void *key, int create, void **ep)
{
MapNode *n;
int i;
i = (*m->hash)(key, m->size);
n = m->head[i];
while(n && !(*m->compare)(n->e, key))
n = n->next;
if(n) {
if(create) {
*ep = nil;
return nil;
}
*ep = n->e;
return nil;
}
if(!create) {
*ep = nil;
return nil;
}
n = logfsrealloc(nil, (*m->allocsize)(key) + sizeof(MapNode *));
if(n == nil) {
*ep = nil;
return Enomem;
}
n->next = m->head[i];
m->head[i] = n;
*ep = n->e;
return nil;
}
void *
logfsmapfindentry(Map *m, void *key)
{
void *rv;
find(m, key, 0, &rv);
return rv;
}
char *
logfsmapnewentry(Map *m, void *key, void **entryp)
{
return find(m, key, 1, entryp);
}
int
logfsmapdeleteentry(Map *m, void *key)
{
MapNode **np, *n;
np = &m->head[(*m->hash)(key, m->size)];
while((n = *np) && !(*m->compare)(n->e, key))
np = &n->next;
if(n) {
*np = n->next;
if(m->free)
(*m->free)(n->e);
logfsfreemem(n);
return 1;
}
return 0; // not there
}
int
logfsmapwalk(Map *m, int (*func)(void *magic, void *), void *magic)
{
int x;
MapNode *n;
for(x = 0; x < m->size; x++)
for(n = m->head[x]; n; n = n->next) {
int rv = (*func)(magic, n->e);
if(rv <= 0)
return rv;
}
return 1;
}
|
