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