mpool.c revision 1.6 1 1.5 cgd /* $NetBSD: mpool.c,v 1.6 1996/05/03 21:29:48 cgd Exp $ */
2 1.5 cgd
3 1.1 cgd /*-
4 1.6 cgd * Copyright (c) 1990, 1993, 1994
5 1.1 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
37 1.5 cgd #if 0
38 1.6 cgd static char sccsid[] = "@(#)mpool.c 8.5 (Berkeley) 7/26/94";
39 1.5 cgd #else
40 1.5 cgd static char rcsid[] = "$NetBSD: mpool.c,v 1.6 1996/05/03 21:29:48 cgd Exp $";
41 1.5 cgd #endif
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.1 cgd #include <sys/param.h>
45 1.6 cgd #include <sys/queue.h>
46 1.1 cgd #include <sys/stat.h>
47 1.1 cgd
48 1.1 cgd #include <errno.h>
49 1.1 cgd #include <stdio.h>
50 1.1 cgd #include <stdlib.h>
51 1.1 cgd #include <string.h>
52 1.1 cgd #include <unistd.h>
53 1.1 cgd
54 1.1 cgd #include <db.h>
55 1.6 cgd
56 1.1 cgd #define __MPOOLINTERFACE_PRIVATE
57 1.6 cgd #include <mpool.h>
58 1.1 cgd
59 1.1 cgd static BKT *mpool_bkt __P((MPOOL *));
60 1.1 cgd static BKT *mpool_look __P((MPOOL *, pgno_t));
61 1.1 cgd static int mpool_write __P((MPOOL *, BKT *));
62 1.1 cgd
63 1.1 cgd /*
64 1.6 cgd * mpool_open --
65 1.6 cgd * Initialize a memory pool.
66 1.1 cgd */
67 1.1 cgd MPOOL *
68 1.1 cgd mpool_open(key, fd, pagesize, maxcache)
69 1.6 cgd void *key;
70 1.1 cgd int fd;
71 1.1 cgd pgno_t pagesize, maxcache;
72 1.1 cgd {
73 1.1 cgd struct stat sb;
74 1.1 cgd MPOOL *mp;
75 1.1 cgd int entry;
76 1.1 cgd
77 1.6 cgd /*
78 1.6 cgd * Get information about the file.
79 1.6 cgd *
80 1.6 cgd * XXX
81 1.6 cgd * We don't currently handle pipes, although we should.
82 1.6 cgd */
83 1.1 cgd if (fstat(fd, &sb))
84 1.1 cgd return (NULL);
85 1.1 cgd if (!S_ISREG(sb.st_mode)) {
86 1.1 cgd errno = ESPIPE;
87 1.1 cgd return (NULL);
88 1.1 cgd }
89 1.1 cgd
90 1.6 cgd /* Allocate and initialize the MPOOL cookie. */
91 1.6 cgd if ((mp = (MPOOL *)calloc(1, sizeof(MPOOL))) == NULL)
92 1.1 cgd return (NULL);
93 1.6 cgd CIRCLEQ_INIT(&mp->lqh);
94 1.1 cgd for (entry = 0; entry < HASHSIZE; ++entry)
95 1.6 cgd CIRCLEQ_INIT(&mp->hqh[entry]);
96 1.1 cgd mp->maxcache = maxcache;
97 1.6 cgd mp->npages = sb.st_size / pagesize;
98 1.1 cgd mp->pagesize = pagesize;
99 1.1 cgd mp->fd = fd;
100 1.1 cgd return (mp);
101 1.1 cgd }
102 1.1 cgd
103 1.1 cgd /*
104 1.6 cgd * mpool_filter --
105 1.6 cgd * Initialize input/output filters.
106 1.1 cgd */
107 1.1 cgd void
108 1.1 cgd mpool_filter(mp, pgin, pgout, pgcookie)
109 1.1 cgd MPOOL *mp;
110 1.1 cgd void (*pgin) __P((void *, pgno_t, void *));
111 1.1 cgd void (*pgout) __P((void *, pgno_t, void *));
112 1.1 cgd void *pgcookie;
113 1.1 cgd {
114 1.1 cgd mp->pgin = pgin;
115 1.1 cgd mp->pgout = pgout;
116 1.1 cgd mp->pgcookie = pgcookie;
117 1.1 cgd }
118 1.1 cgd
119 1.1 cgd /*
120 1.6 cgd * mpool_new --
121 1.6 cgd * Get a new page of memory.
122 1.1 cgd */
123 1.1 cgd void *
124 1.1 cgd mpool_new(mp, pgnoaddr)
125 1.1 cgd MPOOL *mp;
126 1.1 cgd pgno_t *pgnoaddr;
127 1.1 cgd {
128 1.6 cgd struct _hqh *head;
129 1.6 cgd BKT *bp;
130 1.1 cgd
131 1.6 cgd if (mp->npages == MAX_PAGE_NUMBER) {
132 1.6 cgd (void)fprintf(stderr, "mpool_new: page allocation overflow.\n");
133 1.6 cgd abort();
134 1.6 cgd }
135 1.1 cgd #ifdef STATISTICS
136 1.1 cgd ++mp->pagenew;
137 1.1 cgd #endif
138 1.1 cgd /*
139 1.6 cgd * Get a BKT from the cache. Assign a new page number, attach
140 1.6 cgd * it to the head of the hash chain, the tail of the lru chain,
141 1.6 cgd * and return.
142 1.1 cgd */
143 1.6 cgd if ((bp = mpool_bkt(mp)) == NULL)
144 1.1 cgd return (NULL);
145 1.6 cgd *pgnoaddr = bp->pgno = mp->npages++;
146 1.6 cgd bp->flags = MPOOL_PINNED;
147 1.6 cgd
148 1.6 cgd head = &mp->hqh[HASHKEY(bp->pgno)];
149 1.6 cgd CIRCLEQ_INSERT_HEAD(head, bp, hq);
150 1.6 cgd CIRCLEQ_INSERT_TAIL(&mp->lqh, bp, q);
151 1.6 cgd return (bp->page);
152 1.1 cgd }
153 1.1 cgd
154 1.1 cgd /*
155 1.6 cgd * mpool_get
156 1.6 cgd * Get a page.
157 1.1 cgd */
158 1.1 cgd void *
159 1.1 cgd mpool_get(mp, pgno, flags)
160 1.1 cgd MPOOL *mp;
161 1.1 cgd pgno_t pgno;
162 1.6 cgd u_int flags; /* XXX not used? */
163 1.1 cgd {
164 1.6 cgd struct _hqh *head;
165 1.6 cgd BKT *bp;
166 1.1 cgd off_t off;
167 1.1 cgd int nr;
168 1.1 cgd
169 1.6 cgd /* Check for attempt to retrieve a non-existent page. */
170 1.6 cgd if (pgno >= mp->npages) {
171 1.6 cgd errno = EINVAL;
172 1.6 cgd return (NULL);
173 1.6 cgd }
174 1.6 cgd
175 1.1 cgd #ifdef STATISTICS
176 1.6 cgd ++mp->pageget;
177 1.1 cgd #endif
178 1.6 cgd
179 1.6 cgd /* Check for a page that is cached. */
180 1.6 cgd if ((bp = mpool_look(mp, pgno)) != NULL) {
181 1.1 cgd #ifdef DEBUG
182 1.6 cgd if (bp->flags & MPOOL_PINNED) {
183 1.6 cgd (void)fprintf(stderr,
184 1.6 cgd "mpool_get: page %d already pinned\n", bp->pgno);
185 1.6 cgd abort();
186 1.6 cgd }
187 1.6 cgd #endif
188 1.6 cgd /*
189 1.6 cgd * Move the page to the head of the hash chain and the tail
190 1.6 cgd * of the lru chain.
191 1.6 cgd */
192 1.6 cgd head = &mp->hqh[HASHKEY(bp->pgno)];
193 1.6 cgd CIRCLEQ_REMOVE(head, bp, hq);
194 1.6 cgd CIRCLEQ_INSERT_HEAD(head, bp, hq);
195 1.6 cgd CIRCLEQ_REMOVE(&mp->lqh, bp, q);
196 1.6 cgd CIRCLEQ_INSERT_TAIL(&mp->lqh, bp, q);
197 1.6 cgd
198 1.6 cgd /* Return a pinned page. */
199 1.6 cgd bp->flags |= MPOOL_PINNED;
200 1.6 cgd return (bp->page);
201 1.1 cgd }
202 1.1 cgd
203 1.1 cgd /* Get a page from the cache. */
204 1.6 cgd if ((bp = mpool_bkt(mp)) == NULL)
205 1.1 cgd return (NULL);
206 1.1 cgd
207 1.6 cgd /* Read in the contents. */
208 1.1 cgd #ifdef STATISTICS
209 1.1 cgd ++mp->pageread;
210 1.1 cgd #endif
211 1.1 cgd off = mp->pagesize * pgno;
212 1.1 cgd if (lseek(mp->fd, off, SEEK_SET) != off)
213 1.1 cgd return (NULL);
214 1.6 cgd if ((nr = read(mp->fd, bp->page, mp->pagesize)) != mp->pagesize) {
215 1.1 cgd if (nr >= 0)
216 1.1 cgd errno = EFTYPE;
217 1.1 cgd return (NULL);
218 1.1 cgd }
219 1.1 cgd
220 1.6 cgd /* Set the page number, pin the page. */
221 1.6 cgd bp->pgno = pgno;
222 1.6 cgd bp->flags = MPOOL_PINNED;
223 1.6 cgd
224 1.6 cgd /*
225 1.6 cgd * Add the page to the head of the hash chain and the tail
226 1.6 cgd * of the lru chain.
227 1.6 cgd */
228 1.6 cgd head = &mp->hqh[HASHKEY(bp->pgno)];
229 1.6 cgd CIRCLEQ_INSERT_HEAD(head, bp, hq);
230 1.6 cgd CIRCLEQ_INSERT_TAIL(&mp->lqh, bp, q);
231 1.6 cgd
232 1.6 cgd /* Run through the user's filter. */
233 1.6 cgd if (mp->pgin != NULL)
234 1.6 cgd (mp->pgin)(mp->pgcookie, bp->pgno, bp->page);
235 1.6 cgd
236 1.6 cgd return (bp->page);
237 1.1 cgd }
238 1.1 cgd
239 1.1 cgd /*
240 1.6 cgd * mpool_put
241 1.6 cgd * Return a page.
242 1.1 cgd */
243 1.1 cgd int
244 1.1 cgd mpool_put(mp, page, flags)
245 1.1 cgd MPOOL *mp;
246 1.1 cgd void *page;
247 1.1 cgd u_int flags;
248 1.1 cgd {
249 1.6 cgd BKT *bp;
250 1.1 cgd
251 1.1 cgd #ifdef STATISTICS
252 1.1 cgd ++mp->pageput;
253 1.1 cgd #endif
254 1.6 cgd bp = (BKT *)((char *)page - sizeof(BKT));
255 1.1 cgd #ifdef DEBUG
256 1.6 cgd if (!(bp->flags & MPOOL_PINNED)) {
257 1.6 cgd (void)fprintf(stderr,
258 1.6 cgd "mpool_put: page %d not pinned\n", bp->pgno);
259 1.6 cgd abort();
260 1.1 cgd }
261 1.1 cgd #endif
262 1.6 cgd bp->flags &= ~MPOOL_PINNED;
263 1.6 cgd bp->flags |= flags & MPOOL_DIRTY;
264 1.1 cgd return (RET_SUCCESS);
265 1.1 cgd }
266 1.1 cgd
267 1.1 cgd /*
268 1.6 cgd * mpool_close
269 1.6 cgd * Close the buffer pool.
270 1.1 cgd */
271 1.1 cgd int
272 1.1 cgd mpool_close(mp)
273 1.1 cgd MPOOL *mp;
274 1.1 cgd {
275 1.6 cgd BKT *bp;
276 1.1 cgd
277 1.1 cgd /* Free up any space allocated to the lru pages. */
278 1.6 cgd while ((bp = mp->lqh.cqh_first) != (void *)&mp->lqh) {
279 1.6 cgd CIRCLEQ_REMOVE(&mp->lqh, mp->lqh.cqh_first, q);
280 1.6 cgd free(bp);
281 1.1 cgd }
282 1.6 cgd
283 1.6 cgd /* Free the MPOOL cookie. */
284 1.1 cgd free(mp);
285 1.1 cgd return (RET_SUCCESS);
286 1.1 cgd }
287 1.1 cgd
288 1.1 cgd /*
289 1.6 cgd * mpool_sync
290 1.6 cgd * Sync the pool to disk.
291 1.1 cgd */
292 1.1 cgd int
293 1.1 cgd mpool_sync(mp)
294 1.1 cgd MPOOL *mp;
295 1.1 cgd {
296 1.6 cgd BKT *bp;
297 1.1 cgd
298 1.6 cgd /* Walk the lru chain, flushing any dirty pages to disk. */
299 1.6 cgd for (bp = mp->lqh.cqh_first;
300 1.6 cgd bp != (void *)&mp->lqh; bp = bp->q.cqe_next)
301 1.6 cgd if (bp->flags & MPOOL_DIRTY &&
302 1.6 cgd mpool_write(mp, bp) == RET_ERROR)
303 1.1 cgd return (RET_ERROR);
304 1.6 cgd
305 1.6 cgd /* Sync the file descriptor. */
306 1.1 cgd return (fsync(mp->fd) ? RET_ERROR : RET_SUCCESS);
307 1.1 cgd }
308 1.1 cgd
309 1.1 cgd /*
310 1.6 cgd * mpool_bkt
311 1.6 cgd * Get a page from the cache (or create one).
312 1.1 cgd */
313 1.1 cgd static BKT *
314 1.1 cgd mpool_bkt(mp)
315 1.1 cgd MPOOL *mp;
316 1.1 cgd {
317 1.6 cgd struct _hqh *head;
318 1.6 cgd BKT *bp;
319 1.1 cgd
320 1.6 cgd /* If under the max cached, always create a new page. */
321 1.1 cgd if (mp->curcache < mp->maxcache)
322 1.1 cgd goto new;
323 1.1 cgd
324 1.1 cgd /*
325 1.6 cgd * If the cache is max'd out, walk the lru list for a buffer we
326 1.6 cgd * can flush. If we find one, write it (if necessary) and take it
327 1.6 cgd * off any lists. If we don't find anything we grow the cache anyway.
328 1.1 cgd * The cache never shrinks.
329 1.1 cgd */
330 1.6 cgd for (bp = mp->lqh.cqh_first;
331 1.6 cgd bp != (void *)&mp->lqh; bp = bp->q.cqe_next)
332 1.6 cgd if (!(bp->flags & MPOOL_PINNED)) {
333 1.6 cgd /* Flush if dirty. */
334 1.6 cgd if (bp->flags & MPOOL_DIRTY &&
335 1.6 cgd mpool_write(mp, bp) == RET_ERROR)
336 1.1 cgd return (NULL);
337 1.1 cgd #ifdef STATISTICS
338 1.1 cgd ++mp->pageflush;
339 1.1 cgd #endif
340 1.6 cgd /* Remove from the hash and lru queues. */
341 1.6 cgd head = &mp->hqh[HASHKEY(bp->pgno)];
342 1.6 cgd CIRCLEQ_REMOVE(head, bp, hq);
343 1.6 cgd CIRCLEQ_REMOVE(&mp->lqh, bp, q);
344 1.1 cgd #ifdef DEBUG
345 1.6 cgd { void *spage;
346 1.6 cgd spage = bp->page;
347 1.6 cgd memset(bp, 0xff, sizeof(BKT) + mp->pagesize);
348 1.6 cgd bp->page = spage;
349 1.1 cgd }
350 1.1 cgd #endif
351 1.6 cgd return (bp);
352 1.1 cgd }
353 1.1 cgd
354 1.6 cgd new: if ((bp = (BKT *)malloc(sizeof(BKT) + mp->pagesize)) == NULL)
355 1.1 cgd return (NULL);
356 1.1 cgd #ifdef STATISTICS
357 1.1 cgd ++mp->pagealloc;
358 1.1 cgd #endif
359 1.6 cgd #if defined(DEBUG) || defined(PURIFY)
360 1.6 cgd memset(bp, 0xff, sizeof(BKT) + mp->pagesize);
361 1.1 cgd #endif
362 1.6 cgd bp->page = (char *)bp + sizeof(BKT);
363 1.1 cgd ++mp->curcache;
364 1.6 cgd return (bp);
365 1.1 cgd }
366 1.1 cgd
367 1.1 cgd /*
368 1.6 cgd * mpool_write
369 1.6 cgd * Write a page to disk.
370 1.1 cgd */
371 1.1 cgd static int
372 1.6 cgd mpool_write(mp, bp)
373 1.1 cgd MPOOL *mp;
374 1.6 cgd BKT *bp;
375 1.1 cgd {
376 1.1 cgd off_t off;
377 1.1 cgd
378 1.1 cgd #ifdef STATISTICS
379 1.1 cgd ++mp->pagewrite;
380 1.1 cgd #endif
381 1.6 cgd
382 1.6 cgd /* Run through the user's filter. */
383 1.6 cgd if (mp->pgout)
384 1.6 cgd (mp->pgout)(mp->pgcookie, bp->pgno, bp->page);
385 1.6 cgd
386 1.6 cgd off = mp->pagesize * bp->pgno;
387 1.1 cgd if (lseek(mp->fd, off, SEEK_SET) != off)
388 1.1 cgd return (RET_ERROR);
389 1.6 cgd if (write(mp->fd, bp->page, mp->pagesize) != mp->pagesize)
390 1.1 cgd return (RET_ERROR);
391 1.6 cgd
392 1.6 cgd bp->flags &= ~MPOOL_DIRTY;
393 1.1 cgd return (RET_SUCCESS);
394 1.1 cgd }
395 1.1 cgd
396 1.1 cgd /*
397 1.6 cgd * mpool_look
398 1.6 cgd * Lookup a page in the cache.
399 1.1 cgd */
400 1.1 cgd static BKT *
401 1.1 cgd mpool_look(mp, pgno)
402 1.1 cgd MPOOL *mp;
403 1.1 cgd pgno_t pgno;
404 1.1 cgd {
405 1.6 cgd struct _hqh *head;
406 1.6 cgd BKT *bp;
407 1.1 cgd
408 1.6 cgd head = &mp->hqh[HASHKEY(pgno)];
409 1.6 cgd for (bp = head->cqh_first; bp != (void *)head; bp = bp->hq.cqe_next)
410 1.6 cgd if (bp->pgno == pgno) {
411 1.1 cgd #ifdef STATISTICS
412 1.1 cgd ++mp->cachehit;
413 1.1 cgd #endif
414 1.6 cgd return (bp);
415 1.1 cgd }
416 1.1 cgd #ifdef STATISTICS
417 1.1 cgd ++mp->cachemiss;
418 1.1 cgd #endif
419 1.1 cgd return (NULL);
420 1.1 cgd }
421 1.1 cgd
422 1.1 cgd #ifdef STATISTICS
423 1.1 cgd /*
424 1.6 cgd * mpool_stat
425 1.6 cgd * Print out cache statistics.
426 1.1 cgd */
427 1.1 cgd void
428 1.1 cgd mpool_stat(mp)
429 1.1 cgd MPOOL *mp;
430 1.1 cgd {
431 1.6 cgd BKT *bp;
432 1.1 cgd int cnt;
433 1.1 cgd char *sep;
434 1.1 cgd
435 1.1 cgd (void)fprintf(stderr, "%lu pages in the file\n", mp->npages);
436 1.1 cgd (void)fprintf(stderr,
437 1.1 cgd "page size %lu, cacheing %lu pages of %lu page max cache\n",
438 1.1 cgd mp->pagesize, mp->curcache, mp->maxcache);
439 1.1 cgd (void)fprintf(stderr, "%lu page puts, %lu page gets, %lu page new\n",
440 1.1 cgd mp->pageput, mp->pageget, mp->pagenew);
441 1.1 cgd (void)fprintf(stderr, "%lu page allocs, %lu page flushes\n",
442 1.1 cgd mp->pagealloc, mp->pageflush);
443 1.1 cgd if (mp->cachehit + mp->cachemiss)
444 1.1 cgd (void)fprintf(stderr,
445 1.1 cgd "%.0f%% cache hit rate (%lu hits, %lu misses)\n",
446 1.1 cgd ((double)mp->cachehit / (mp->cachehit + mp->cachemiss))
447 1.1 cgd * 100, mp->cachehit, mp->cachemiss);
448 1.1 cgd (void)fprintf(stderr, "%lu page reads, %lu page writes\n",
449 1.1 cgd mp->pageread, mp->pagewrite);
450 1.1 cgd
451 1.1 cgd sep = "";
452 1.1 cgd cnt = 0;
453 1.6 cgd for (bp = mp->lqh.cqh_first;
454 1.6 cgd bp != (void *)&mp->lqh; bp = bp->q.cqe_next) {
455 1.6 cgd (void)fprintf(stderr, "%s%d", sep, bp->pgno);
456 1.6 cgd if (bp->flags & MPOOL_DIRTY)
457 1.1 cgd (void)fprintf(stderr, "d");
458 1.6 cgd if (bp->flags & MPOOL_PINNED)
459 1.1 cgd (void)fprintf(stderr, "P");
460 1.1 cgd if (++cnt == 10) {
461 1.1 cgd sep = "\n";
462 1.1 cgd cnt = 0;
463 1.1 cgd } else
464 1.1 cgd sep = ", ";
465 1.1 cgd
466 1.1 cgd }
467 1.1 cgd (void)fprintf(stderr, "\n");
468 1.1 cgd }
469 1.1 cgd #endif
470