Something went wrong. Try again.
Cider Isn't Darwin Emulation, Really
Something went wrong. Try again.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447/*- * Copyright (c) 1990, 1993, 1994 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */
#if defined(LIBC_SCCS) && !defined(lint)static char sccsid[] = "@(#)mpool.c 8.5 (Berkeley) 7/26/94";#endif /* LIBC_SCCS and not lint */#include <sys/cdefs.h>__FBSDID("$FreeBSD: src/lib/libc/db/mpool/mpool.c,v 1.16 2009/03/28 04:00:46 delphij Exp $");
#include "namespace.h"#include <sys/param.h>#include <sys/queue.h>#include <sys/stat.h>
#include <errno.h>#include <stdio.h>#include <stdlib.h>#include <string.h>#include <unistd.h>#include "un-namespace.h"
#include <db.h>
#define __MPOOLINTERFACE_PRIVATE#include <mpool.h>
static BKT *mpool_bkt(MPOOL *);static BKT *mpool_look(MPOOL *, pgno_t);static int mpool_write(MPOOL *, BKT *);
/* * mpool_open -- * Initialize a memory pool. *//* ARGSUSED */MPOOL *mpool_open(void *key, int fd, pgno_t pagesize, pgno_t maxcache){ struct stat sb; MPOOL *mp; int entry;
/* * Get information about the file. * * XXX * We don't currently handle pipes, although we should. */ if (_fstat(fd, &sb)) return (NULL); if (!S_ISREG(sb.st_mode)) { errno = ESPIPE; return (NULL); }
/* Allocate and initialize the MPOOL cookie. */ if ((mp = (MPOOL *)calloc(1, sizeof(MPOOL))) == NULL) return (NULL); TAILQ_INIT(&mp->lqh); for (entry = 0; entry < HASHSIZE; ++entry) TAILQ_INIT(&mp->hqh[entry]); mp->maxcache = maxcache; mp->npages = sb.st_size / pagesize; mp->pagesize = pagesize; mp->fd = fd; return (mp);}
/* * mpool_filter -- * Initialize input/output filters. */voidmpool_filter(MPOOL *mp, void (*pgin) (void *, pgno_t, void *), void (*pgout) (void *, pgno_t, void *), void *pgcookie){ mp->pgin = pgin; mp->pgout = pgout; mp->pgcookie = pgcookie;} /* * mpool_new -- * Get a new page of memory. */void *mpool_new(mp, pgnoaddr) MPOOL *mp; pgno_t *pgnoaddr;{ struct _hqh *head; BKT *bp;
if (mp->npages == MAX_PAGE_NUMBER) { (void)fprintf(stderr, "mpool_new: page allocation overflow.\n"); LIBC_ABORT("page allocation overflow"); }#ifdef STATISTICS ++mp->pagenew;#endif /* * Get a BKT from the cache. Assign a new page number, attach * it to the head of the hash chain, the tail of the lru chain, * and return. */ if ((bp = mpool_bkt(mp)) == NULL) return (NULL); *pgnoaddr = bp->pgno = mp->npages++; bp->flags = MPOOL_PINNED;
head = &mp->hqh[HASHKEY(bp->pgno)]; TAILQ_INSERT_HEAD(head, bp, hq); TAILQ_INSERT_TAIL(&mp->lqh, bp, q); return (bp->page);}
/* * mpool_get * Get a page. *//* ARGSUSED */void *mpool_get(MPOOL *mp, pgno_t pgno, u_int flags) /* XXX not used? */{ struct _hqh *head; BKT *bp; off_t off; int nr;
/* Check for attempt to retrieve a non-existent page. */ if (pgno >= mp->npages) { errno = EINVAL; return (NULL); }
#ifdef STATISTICS ++mp->pageget;#endif
/* Check for a page that is cached. */ if ((bp = mpool_look(mp, pgno)) != NULL) {#ifdef DEBUG if (bp->flags & MPOOL_PINNED) { (void)fprintf(stderr, "mpool_get: page %d already pinned\n", bp->pgno); LIBC_ABORT("page %d already pinned", bp->pgno); }#endif /* * Move the page to the head of the hash chain and the tail * of the lru chain. */ head = &mp->hqh[HASHKEY(bp->pgno)]; TAILQ_REMOVE(head, bp, hq); TAILQ_INSERT_HEAD(head, bp, hq); TAILQ_REMOVE(&mp->lqh, bp, q); TAILQ_INSERT_TAIL(&mp->lqh, bp, q);
/* Return a pinned page. */ bp->flags |= MPOOL_PINNED; return (bp->page); }
/* Get a page from the cache. */ if ((bp = mpool_bkt(mp)) == NULL) return (NULL);
/* Read in the contents. */#ifdef STATISTICS ++mp->pageread;#endif off = mp->pagesize * pgno; nr = pread(mp->fd, bp->page, mp->pagesize, off); if (nr != mp->pagesize) { if (nr >= 0) errno = EFTYPE; return (NULL); }
/* Set the page number, pin the page. */ bp->pgno = pgno; bp->flags = MPOOL_PINNED;
/* * Add the page to the head of the hash chain and the tail * of the lru chain. */ head = &mp->hqh[HASHKEY(bp->pgno)]; TAILQ_INSERT_HEAD(head, bp, hq); TAILQ_INSERT_TAIL(&mp->lqh, bp, q);
/* Run through the user's filter. */ if (mp->pgin != NULL) (mp->pgin)(mp->pgcookie, bp->pgno, bp->page);
return (bp->page);}
/* * mpool_put * Return a page. *//* ARGSUSED */intmpool_put(MPOOL *mp, void *page, u_int flags){ BKT *bp;
#ifdef STATISTICS ++mp->pageput;#endif bp = (BKT *)((char *)page - sizeof(BKT));#ifdef DEBUG if (!(bp->flags & MPOOL_PINNED)) { (void)fprintf(stderr, "mpool_put: page %d not pinned\n", bp->pgno); LIBC_ABORT("page %d not pinned", bp->pgno); }#endif bp->flags &= ~MPOOL_PINNED; bp->flags |= flags & MPOOL_DIRTY; return (RET_SUCCESS);}
/* * mpool_close * Close the buffer pool. */intmpool_close(MPOOL *mp){ BKT *bp;
/* Free up any space allocated to the lru pages. */ while (!TAILQ_EMPTY(&mp->lqh)) { bp = TAILQ_FIRST(&mp->lqh); TAILQ_REMOVE(&mp->lqh, bp, q); free(bp); }
/* Free the MPOOL cookie. */ free(mp); return (RET_SUCCESS);}
/* * mpool_sync * Sync the pool to disk. */intmpool_sync(MPOOL *mp){ BKT *bp;
/* Walk the lru chain, flushing any dirty pages to disk. */ TAILQ_FOREACH(bp, &mp->lqh, q) { if (bp->flags & MPOOL_DIRTY) { if (mpool_write(mp, bp) == RET_ERROR) { return (RET_ERROR); } else { /* 4874757: Re-run through the user's pgin filter. */ if (mp->pgin != NULL) (mp->pgin)(mp->pgcookie, bp->pgno, bp->page); } } }
/* Sync the file descriptor. */ return (_fsync(mp->fd) ? RET_ERROR : RET_SUCCESS);}
/* * mpool_bkt * Get a page from the cache (or create one). */static BKT *mpool_bkt(MPOOL *mp){ struct _hqh *head; BKT *bp;
/* If under the max cached, always create a new page. */ if (mp->curcache < mp->maxcache) goto new;
/* * If the cache is max'd out, walk the lru list for a buffer we * can flush. If we find one, write it (if necessary) and take it * off any lists. If we don't find anything we grow the cache anyway. * The cache never shrinks. */ TAILQ_FOREACH(bp, &mp->lqh, q) if (!(bp->flags & MPOOL_PINNED)) { /* Flush if dirty. */ if (bp->flags & MPOOL_DIRTY && mpool_write(mp, bp) == RET_ERROR) return (NULL);#ifdef STATISTICS ++mp->pageflush;#endif /* Remove from the hash and lru queues. */ head = &mp->hqh[HASHKEY(bp->pgno)]; TAILQ_REMOVE(head, bp, hq); TAILQ_REMOVE(&mp->lqh, bp, q);#ifdef DEBUG { void *spage; spage = bp->page; memset(bp, 0xff, sizeof(BKT) + mp->pagesize); bp->page = spage; }#endif return (bp); }
new: if ((bp = (BKT *)calloc(1, sizeof(BKT) + mp->pagesize)) == NULL) return (NULL);#ifdef STATISTICS ++mp->pagealloc;#endif bp->page = (char *)bp + sizeof(BKT); ++mp->curcache; return (bp);}
/* * mpool_write * Write a page to disk. */static intmpool_write(MPOOL *mp, BKT *bp){ off_t off;
#ifdef STATISTICS ++mp->pagewrite;#endif
/* Run through the user's filter. */ if (mp->pgout) (mp->pgout)(mp->pgcookie, bp->pgno, bp->page);
off = mp->pagesize * bp->pgno; if (pwrite(mp->fd, bp->page, mp->pagesize, off) != mp->pagesize) return (RET_ERROR);
bp->flags &= ~MPOOL_DIRTY; return (RET_SUCCESS);}
/* * mpool_look * Lookup a page in the cache. */static BKT *mpool_look(MPOOL *mp, pgno_t pgno){ struct _hqh *head; BKT *bp;
head = &mp->hqh[HASHKEY(pgno)]; TAILQ_FOREACH(bp, head, hq) if (bp->pgno == pgno) {#ifdef STATISTICS ++mp->cachehit;#endif return (bp); }#ifdef STATISTICS ++mp->cachemiss;#endif return (NULL);}
#ifdef STATISTICS/* * mpool_stat * Print out cache statistics. */voidmpool_stat(MPOOL *mp){ BKT *bp; int cnt; char *sep;
(void)fprintf(stderr, "%lu pages in the file\n", mp->npages); (void)fprintf(stderr, "page size %lu, cacheing %lu pages of %lu page max cache\n", mp->pagesize, mp->curcache, mp->maxcache); (void)fprintf(stderr, "%lu page puts, %lu page gets, %lu page new\n", mp->pageput, mp->pageget, mp->pagenew); (void)fprintf(stderr, "%lu page allocs, %lu page flushes\n", mp->pagealloc, mp->pageflush); if (mp->cachehit + mp->cachemiss) (void)fprintf(stderr, "%.0f%% cache hit rate (%lu hits, %lu misses)\n", ((double)mp->cachehit / (mp->cachehit + mp->cachemiss)) * 100, mp->cachehit, mp->cachemiss); (void)fprintf(stderr, "%lu page reads, %lu page writes\n", mp->pageread, mp->pagewrite);
sep = ""; cnt = 0; TAILQ_FOREACH(bp, &mp->lqh, q) { (void)fprintf(stderr, "%s%d", sep, bp->pgno); if (bp->flags & MPOOL_DIRTY) (void)fprintf(stderr, "d"); if (bp->flags & MPOOL_PINNED) (void)fprintf(stderr, "P"); if (++cnt == 10) { sep = "\n"; cnt = 0; } else sep = ", "; } (void)fprintf(stderr, "\n");}#endif