hash_buf.c revision 1.5 1 /* $NetBSD: hash_buf.c,v 1.5 1995/02/27 13:22:23 cgd Exp $ */
2
3 /*-
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Margo Seltzer.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38
39 #if defined(LIBC_SCCS) && !defined(lint)
40 #if 0
41 static char sccsid[] = "@(#)hash_buf.c 8.4 (Berkeley) 6/4/94";
42 #else
43 static char rcsid[] = "$NetBSD: hash_buf.c,v 1.5 1995/02/27 13:22:23 cgd Exp $";
44 #endif
45 #endif /* LIBC_SCCS and not lint */
46
47 /*
48 * PACKAGE: hash
49 *
50 * DESCRIPTION:
51 * Contains buffer management
52 *
53 * ROUTINES:
54 * External
55 * __buf_init
56 * __get_buf
57 * __buf_free
58 * __reclaim_buf
59 * Internal
60 * newbuf
61 */
62
63 #include <sys/param.h>
64
65 #include <errno.h>
66 #include <stddef.h>
67 #include <stdio.h>
68 #include <stdlib.h>
69
70 #ifdef DEBUG
71 #include <assert.h>
72 #endif
73
74 #include <db.h>
75 #include "hash.h"
76 #include "page.h"
77 #include "extern.h"
78
79 static BUFHEAD *newbuf __P((HTAB *, u_int32_t, BUFHEAD *));
80
81 /* Unlink B from its place in the lru */
82 #define BUF_REMOVE(B) { \
83 (B)->prev->next = (B)->next; \
84 (B)->next->prev = (B)->prev; \
85 }
86
87 /* Insert B after P */
88 #define BUF_INSERT(B, P) { \
89 (B)->next = (P)->next; \
90 (B)->prev = (P); \
91 (P)->next = (B); \
92 (B)->next->prev = (B); \
93 }
94
95 #define MRU hashp->bufhead.next
96 #define LRU hashp->bufhead.prev
97
98 #define MRU_INSERT(B) BUF_INSERT((B), &hashp->bufhead)
99 #define LRU_INSERT(B) BUF_INSERT((B), LRU)
100
101 /*
102 * We are looking for a buffer with address "addr". If prev_bp is NULL, then
103 * address is a bucket index. If prev_bp is not NULL, then it points to the
104 * page previous to an overflow page that we are trying to find.
105 *
106 * CAVEAT: The buffer header accessed via prev_bp's ovfl field may no longer
107 * be valid. Therefore, you must always verify that its address matches the
108 * address you are seeking.
109 */
110 extern BUFHEAD *
111 __get_buf(hashp, addr, prev_bp, newpage)
112 HTAB *hashp;
113 u_int32_t addr;
114 BUFHEAD *prev_bp;
115 int newpage; /* If prev_bp set, indicates a new overflow page. */
116 {
117 register BUFHEAD *bp;
118 register u_int32_t is_disk_mask;
119 register int is_disk, segment_ndx;
120 SEGMENT segp;
121
122 is_disk = 0;
123 is_disk_mask = 0;
124 if (prev_bp) {
125 bp = prev_bp->ovfl;
126 if (!bp || (bp->addr != addr))
127 bp = NULL;
128 if (!newpage)
129 is_disk = BUF_DISK;
130 } else {
131 /* Grab buffer out of directory */
132 segment_ndx = addr & (hashp->SGSIZE - 1);
133
134 /* valid segment ensured by __call_hash() */
135 segp = hashp->dir[addr >> hashp->SSHIFT];
136 #ifdef DEBUG
137 assert(segp != NULL);
138 #endif
139 bp = PTROF(segp[segment_ndx]);
140 is_disk_mask = ISDISK(segp[segment_ndx]);
141 is_disk = is_disk_mask || !hashp->new_file;
142 }
143
144 if (!bp) {
145 bp = newbuf(hashp, addr, prev_bp);
146 if (!bp ||
147 __get_page(hashp, bp->page, addr, !prev_bp, is_disk, 0))
148 return (NULL);
149 if (!prev_bp)
150 segp[segment_ndx] =
151 (BUFHEAD *)((ptrdiff_t)bp | is_disk_mask);
152 } else {
153 BUF_REMOVE(bp);
154 MRU_INSERT(bp);
155 }
156 return (bp);
157 }
158
159 /*
160 * We need a buffer for this page. Either allocate one, or evict a resident
161 * one (if we have as many buffers as we're allowed) and put this one in.
162 *
163 * If newbuf finds an error (returning NULL), it also sets errno.
164 */
165 static BUFHEAD *
166 newbuf(hashp, addr, prev_bp)
167 HTAB *hashp;
168 u_int32_t addr;
169 BUFHEAD *prev_bp;
170 {
171 register BUFHEAD *bp; /* The buffer we're going to use */
172 register BUFHEAD *xbp; /* Temp pointer */
173 register BUFHEAD *next_xbp;
174 SEGMENT segp;
175 int segment_ndx;
176 u_int16_t oaddr, *shortp;
177
178 oaddr = 0;
179 bp = LRU;
180 /*
181 * If LRU buffer is pinned, the buffer pool is too small. We need to
182 * allocate more buffers.
183 */
184 if (hashp->nbufs || (bp->flags & BUF_PIN)) {
185 /* Allocate a new one */
186 if ((bp = (BUFHEAD *)malloc(sizeof(BUFHEAD))) == NULL)
187 return (NULL);
188 if ((bp->page = (char *)malloc(hashp->BSIZE)) == NULL) {
189 free(bp);
190 return (NULL);
191 }
192 if (hashp->nbufs)
193 hashp->nbufs--;
194 } else {
195 /* Kick someone out */
196 BUF_REMOVE(bp);
197 /*
198 * If this is an overflow page with addr 0, it's already been
199 * flushed back in an overflow chain and initialized.
200 */
201 if ((bp->addr != 0) || (bp->flags & BUF_BUCKET)) {
202 /*
203 * Set oaddr before __put_page so that you get it
204 * before bytes are swapped.
205 */
206 shortp = (u_int16_t *)bp->page;
207 if (shortp[0])
208 oaddr = shortp[shortp[0] - 1];
209 if ((bp->flags & BUF_MOD) && __put_page(hashp, bp->page,
210 bp->addr, (int)IS_BUCKET(bp->flags), 0))
211 return (NULL);
212 /*
213 * Update the pointer to this page (i.e. invalidate it).
214 *
215 * If this is a new file (i.e. we created it at open
216 * time), make sure that we mark pages which have been
217 * written to disk so we retrieve them from disk later,
218 * rather than allocating new pages.
219 */
220 if (IS_BUCKET(bp->flags)) {
221 segment_ndx = bp->addr & (hashp->SGSIZE - 1);
222 segp = hashp->dir[bp->addr >> hashp->SSHIFT];
223 #ifdef DEBUG
224 assert(segp != NULL);
225 #endif
226
227 if (hashp->new_file &&
228 ((bp->flags & BUF_MOD) ||
229 ISDISK(segp[segment_ndx])))
230 segp[segment_ndx] = (BUFHEAD *)BUF_DISK;
231 else
232 segp[segment_ndx] = NULL;
233 }
234 /*
235 * Since overflow pages can only be access by means of
236 * their bucket, free overflow pages associated with
237 * this bucket.
238 */
239 for (xbp = bp; xbp->ovfl;) {
240 next_xbp = xbp->ovfl;
241 xbp->ovfl = 0;
242 xbp = next_xbp;
243
244 /* Check that ovfl pointer is up date. */
245 if (IS_BUCKET(xbp->flags) ||
246 (oaddr != xbp->addr))
247 break;
248
249 shortp = (u_int16_t *)xbp->page;
250 if (shortp[0])
251 /* set before __put_page */
252 oaddr = shortp[shortp[0] - 1];
253 if ((xbp->flags & BUF_MOD) && __put_page(hashp,
254 xbp->page, xbp->addr, 0, 0))
255 return (NULL);
256 xbp->addr = 0;
257 xbp->flags = 0;
258 BUF_REMOVE(xbp);
259 LRU_INSERT(xbp);
260 }
261 }
262 }
263
264 /* Now assign this buffer */
265 bp->addr = addr;
266 #ifdef DEBUG1
267 (void)fprintf(stderr, "NEWBUF1: %d->ovfl was %d is now %d\n",
268 bp->addr, (bp->ovfl ? bp->ovfl->addr : 0), 0);
269 #endif
270 bp->ovfl = NULL;
271 if (prev_bp) {
272 /*
273 * If prev_bp is set, this is an overflow page, hook it in to
274 * the buffer overflow links.
275 */
276 #ifdef DEBUG1
277 (void)fprintf(stderr, "NEWBUF2: %d->ovfl was %d is now %d\n",
278 prev_bp->addr, (prev_bp->ovfl ? bp->ovfl->addr : 0),
279 (bp ? bp->addr : 0));
280 #endif
281 prev_bp->ovfl = bp;
282 bp->flags = 0;
283 } else
284 bp->flags = BUF_BUCKET;
285 MRU_INSERT(bp);
286 return (bp);
287 }
288
289 extern void
290 __buf_init(hashp, nbytes)
291 HTAB *hashp;
292 int nbytes;
293 {
294 BUFHEAD *bfp;
295 int npages;
296
297 bfp = &(hashp->bufhead);
298 npages = (nbytes + hashp->BSIZE - 1) >> hashp->BSHIFT;
299 npages = MAX(npages, MIN_BUFFERS);
300
301 hashp->nbufs = npages;
302 bfp->next = bfp;
303 bfp->prev = bfp;
304 /*
305 * This space is calloc'd so these are already null.
306 *
307 * bfp->ovfl = NULL;
308 * bfp->flags = 0;
309 * bfp->page = NULL;
310 * bfp->addr = 0;
311 */
312 }
313
314 extern int
315 __buf_free(hashp, do_free, to_disk)
316 HTAB *hashp;
317 int do_free, to_disk;
318 {
319 BUFHEAD *bp;
320
321 /* Need to make sure that buffer manager has been initialized */
322 if (!LRU)
323 return (0);
324 for (bp = LRU; bp != &hashp->bufhead;) {
325 /* Check that the buffer is valid */
326 if (bp->addr || IS_BUCKET(bp->flags)) {
327 if (to_disk && (bp->flags & BUF_MOD) &&
328 __put_page(hashp, bp->page,
329 bp->addr, IS_BUCKET(bp->flags), 0))
330 return (-1);
331 }
332 /* Check if we are freeing stuff */
333 if (do_free) {
334 if (bp->page)
335 free(bp->page);
336 BUF_REMOVE(bp);
337 free(bp);
338 bp = LRU;
339 } else
340 bp = bp->prev;
341 }
342 return (0);
343 }
344
345 extern void
346 __reclaim_buf(hashp, bp)
347 HTAB *hashp;
348 BUFHEAD *bp;
349 {
350 bp->ovfl = 0;
351 bp->addr = 0;
352 bp->flags = 0;
353 BUF_REMOVE(bp);
354 LRU_INSERT(bp);
355 }
356