2 * sdbm - ndbm work-alike hashed database library
3 * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978).
4 * author: oz@nexus.yorku.ca
5 * status: public domain.
12 # define EXTCONST extern const
20 #define exhash(item) sdbm_hash((item).dptr, (item).dsize)
25 static int seepair proto((char *, int, char *, int));
29 * +------------------------------+
30 * ino | n | keyoff | datoff | keyoff |
31 * +------------+--------+--------+
32 * | datoff | - - - ----> |
33 * +--------+---------------------+
35 * +--------------+---------------+
36 * | <---- - - - | data |
37 * +--------+-----+----+----------+
38 * | key | data | key |
39 * +--------+----------+----------+
41 * calculating the offsets for free area: if the number
42 * of entries (ino[0]) is zero, the offset to the END of
43 * the free area is the block size. Otherwise, it is the
44 * nth (ino[ino[0]]) entry's offset.
48 fitpair(char *pag, int need)
53 register short *ino = (short *) pag;
55 off = ((n = ino[0]) > 0) ? ino[n] : PBLKSIZ;
56 free = off - (n + 1) * sizeof(short);
57 need += 2 * sizeof(short);
59 debug(("free %d need %d\n", free, need));
65 putpair(char *pag, datum key, datum val)
69 register short *ino = (short *) pag;
71 off = ((n = ino[0]) > 0) ? ino[n] : PBLKSIZ;
76 (void) memcpy(pag + off, key.dptr, key.dsize);
82 (void) memcpy(pag + off, val.dptr, val.dsize);
91 getpair(char *pag, datum key)
96 register short *ino = (short *) pag;
98 if ((n = ino[0]) == 0)
101 if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0)
104 val.dptr = pag + ino[i + 1];
105 val.dsize = ino[i] - ino[i + 1];
110 exipair(char *pag, datum key)
112 register short *ino = (short *) pag;
117 return (seepair(pag, ino[0], key.dptr, key.dsize) != 0);
122 duppair(char *pag, datum key)
124 register short *ino = (short *) pag;
125 return ino[0] > 0 && seepair(pag, ino[0], key.dptr, key.dsize) > 0;
130 getnkey(char *pag, int num)
134 register short *ino = (short *) pag;
137 if (ino[0] == 0 || num > ino[0])
140 off = (num > 1) ? ino[num - 1] : PBLKSIZ;
142 key.dptr = pag + ino[num];
143 key.dsize = off - ino[num];
149 delpair(char *pag, datum key)
153 register short *ino = (short *) pag;
155 if ((n = ino[0]) == 0)
158 if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0)
161 * found the key. if it is the last entry
162 * [i.e. i == n - 1] we just adjust the entry count.
163 * hard case: move all data down onto the deleted pair,
164 * shift offsets onto deleted offsets, and adjust them.
169 register char *dst = pag + (i == 1 ? PBLKSIZ : ino[i - 1]);
170 register char *src = pag + ino[i + 1];
171 register int zoo = dst - src;
173 debug(("free-up %d ", zoo));
175 * shift data/keys down
177 m = ino[i + 1] - ino[n];
179 #define MOVB *--dst = *--src
182 register int loop = (m + 8 - 1) >> 3;
184 switch (m & (8 - 1)) {
187 case 6: MOVB; case 5: MOVB;
188 case 4: MOVB; case 3: MOVB;
189 case 2: MOVB; case 1: MOVB;
197 memmove(dst, src, m);
204 * adjust offset index up
207 ino[i] = ino[i + 2] + zoo;
216 * search for the key in the page.
217 * return offset index in the range 0 < i < n.
218 * return 0 if not found.
221 seepair(char *pag, register int n, register char *key, register int siz)
224 register int off = PBLKSIZ;
225 register short *ino = (short *) pag;
227 for (i = 1; i < n; i += 2) {
228 if (siz == off - ino[i] &&
229 memEQ(key, pag + ino[i], siz))
237 splpage(char *pag, char *New, long int sbit)
243 register int off = PBLKSIZ;
245 register short *ino = (short *) cur;
247 (void) memcpy(cur, pag, PBLKSIZ);
248 (void) memset(pag, 0, PBLKSIZ);
249 (void) memset(New, 0, PBLKSIZ);
252 for (ino++; n > 0; ino += 2) {
253 key.dptr = cur + ino[0];
254 key.dsize = off - ino[0];
255 val.dptr = cur + ino[1];
256 val.dsize = ino[0] - ino[1];
258 * select the page pointer (by looking at sbit) and insert
260 (void) putpair((exhash(key) & sbit) ? New : pag, key, val);
266 debug(("%d split %d/%d\n", ((short *) cur)[0] / 2,
267 ((short *) New)[0] / 2,
268 ((short *) pag)[0] / 2));
273 * number of entries should be something
274 * reasonable, and all offsets in the index should be in order.
275 * this could be made more rigorous.
282 register short *ino = (short *) pag;
284 if ((n = ino[0]) < 0 || n > PBLKSIZ / sizeof(short))
289 for (ino++; n > 0; ino += 2) {
290 if (ino[0] > off || ino[1] > off ||