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
|
#include <u.h>
#include <libc.h>
#include <bio.h>
#include "ndb.h"
#include "ndbhf.h"
enum {
Dptr, /* pointer to database file */
Cptr, /* pointer to first chain entry */
Cptr1, /* pointer to second chain entry */
};
/*
* generate a hash value for an ascii string (val) given
* a hash table length (hlen)
*/
ulong
ndbhash(char *vp, int hlen)
{
ulong hash;
uchar *val = (uchar*)vp;
for(hash = 0; *val; val++)
hash = (hash*13) + *val-'a';
return hash % hlen;
}
/*
* read a hash file with buffering
*/
static uchar*
hfread(Ndbhf *hf, long off, int len)
{
if(off < hf->off || off + len > hf->off + hf->len){
if(seek(hf->fd, off, 0) < 0
|| (hf->len = read(hf->fd, hf->buf, sizeof(hf->buf))) < len){
hf->off = -1;
return 0;
}
hf->off = off;
}
return &hf->buf[off-hf->off];
}
/*
* return an opened hash file if one exists for the
* attribute and if it is current vis-a-vis the data
* base file
*/
static Ndbhf*
hfopen(Ndb *db, char *attr)
{
Ndbhf *hf;
char buf[sizeof(hf->attr)+sizeof(db->file)+2];
uchar *p;
Dir *d;
/* try opening the data base if it's closed */
if(db->mtime==0 && ndbreopen(db) < 0)
return nil;
/* if the database has changed, throw out hash files and reopen db */
if((d = dirfstat(Bfildes(&db->b))) == nil || db->qid.path != d->qid.path
|| db->qid.vers != d->qid.vers){
if(ndbreopen(db) < 0){
free(d);
return nil;
}
}
free(d);
if(db->nohash)
return nil;
/* see if a hash file exists for this attribute */
for(hf = db->hf; hf != nil; hf= hf->next){
if(strcmp(hf->attr, attr) == 0)
return hf;
}
/* create a new one */
hf = (Ndbhf*)malloc(sizeof(Ndbhf));
if(hf == nil)
return nil;
memset(hf, 0, sizeof(Ndbhf));
/* compare it to the database file */
strncpy(hf->attr, attr, sizeof(hf->attr)-1);
sprint(buf, "%s.%s", db->file, hf->attr);
hf->fd = open(buf, OREAD|OCEXEC);
if(hf->fd >= 0){
hf->len = 0;
hf->off = 0;
p = hfread(hf, 0, 2*NDBULLEN);
if(p != nil){
hf->dbmtime = NDBGETUL(p);
hf->hlen = NDBGETUL(p+NDBULLEN);
if(hf->dbmtime == db->mtime){
hf->next = db->hf;
db->hf = hf;
return hf;
}
}
close(hf->fd);
}
free(hf);
return nil;
}
/*
* return the first matching entry
*/
Ndbtuple*
ndbsearch(Ndb *db, Ndbs *s, char *attr, char *val)
{
uchar *p;
Ndbtuple *t;
Ndbhf *hf;
hf = hfopen(db, attr);
memset(s, 0, sizeof(*s));
if(_ndbcachesearch(db, s, attr, val, &t) == 0){
/* found in cache */
if(t != nil)
goto out;
if(db->next == nil)
return nil;
t = ndbsearch(db->next, s, attr, val);
goto out;
}
s->db = db;
s->hf = hf;
if(s->hf != nil){
s->ptr = ndbhash(val, s->hf->hlen)*NDBPLEN;
p = hfread(s->hf, s->ptr+NDBHLEN, NDBPLEN);
if(p == nil){
t = _ndbcacheadd(db, s, attr, val, nil);
goto out;
}
s->ptr = NDBGETP(p);
s->type = Cptr1;
} else {
s->ptr = 0;
s->type = Dptr;
}
t = ndbsnext(s, attr, val);
_ndbcacheadd(db, s, attr, val, (t != nil && s->db == db)?t:nil);
out:
ndbsetmalloctag(t, getcallerpc(&db));
return t;
}
static Ndbtuple*
match(Ndbtuple *t, char *attr, char *val)
{
Ndbtuple *nt;
for(nt = t; nt != nil; nt = nt->entry)
if(strcmp(attr, nt->attr) == 0
&& strcmp(val, nt->val) == 0)
return nt;
return nil;
}
/*
* return the next matching entry in the hash chain
*/
Ndbtuple*
ndbsnext(Ndbs *s, char *attr, char *val)
{
Ndbtuple *t;
Ndb *db;
uchar *p;
db = s->db;
if(s->ptr == NDBNAP)
goto nextfile;
for(;;){
if(s->type == Dptr){
if(Bseek(&db->b, s->ptr, 0) < 0)
break;
t = ndbparse(db);
s->ptr = Boffset(&db->b);
if(t == nil)
break;
if((s->t = match(t, attr, val)) != nil)
goto out;
ndbfree(t);
} else if(s->type == Cptr){
if(Bseek(&db->b, s->ptr, 0) < 0)
break;
s->ptr = s->ptr1;
s->type = Cptr1;
t = ndbparse(db);
if(t == nil)
break;
if((s->t = match(t, attr, val)) != nil)
goto out;
ndbfree(t);
} else if(s->type == Cptr1){
if(s->ptr & NDBCHAIN){ /* hash chain continuation */
s->ptr &= ~NDBCHAIN;
p = hfread(s->hf, s->ptr+NDBHLEN, 2*NDBPLEN);
if(p == nil)
break;
s->ptr = NDBGETP(p);
s->ptr1 = NDBGETP(p+NDBPLEN);
s->type = Cptr;
} else { /* end of hash chain */
if(Bseek(&db->b, s->ptr, 0) < 0)
break;
s->ptr = NDBNAP;
t = ndbparse(db);
if(t == nil)
break;
if((s->t = match(t, attr, val)) != nil)
goto out;
ndbfree(t);
break;
}
}
}
nextfile:
/* nothing left to search? */
s->ptr = NDBNAP;
if(db->next == nil)
return nil;
/* advance search to next db file */
t = ndbsearch(db->next, s, attr, val);
out:
ndbsetmalloctag(t, getcallerpc(&s));
return t;
}
|
