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