[BACK]Return to subr_pool.c CVS log [TXT][DIR] Up to [cvs.NetBSD.org] / src / sys / kern

Annotation of src/sys/kern/subr_pool.c, Revision 1.33

1.33    ! chs         1: /*     $NetBSD: subr_pool.c,v 1.32 2000/04/10 02:17:42 chs Exp $       */
1.1       pk          2:
                      3: /*-
1.20      thorpej     4:  * Copyright (c) 1997, 1999 The NetBSD Foundation, Inc.
1.1       pk          5:  * All rights reserved.
                      6:  *
                      7:  * This code is derived from software contributed to The NetBSD Foundation
1.20      thorpej     8:  * by Paul Kranenburg; by Jason R. Thorpe of the Numerical Aerospace
                      9:  * Simulation Facility, NASA Ames Research Center.
1.1       pk         10:  *
                     11:  * Redistribution and use in source and binary forms, with or without
                     12:  * modification, are permitted provided that the following conditions
                     13:  * are met:
                     14:  * 1. Redistributions of source code must retain the above copyright
                     15:  *    notice, this list of conditions and the following disclaimer.
                     16:  * 2. Redistributions in binary form must reproduce the above copyright
                     17:  *    notice, this list of conditions and the following disclaimer in the
                     18:  *    documentation and/or other materials provided with the distribution.
                     19:  * 3. All advertising materials mentioning features or use of this software
                     20:  *    must display the following acknowledgement:
1.13      christos   21:  *     This product includes software developed by the NetBSD
                     22:  *     Foundation, Inc. and its contributors.
1.1       pk         23:  * 4. Neither the name of The NetBSD Foundation nor the names of its
                     24:  *    contributors may be used to endorse or promote products derived
                     25:  *    from this software without specific prior written permission.
                     26:  *
                     27:  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
                     28:  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
                     29:  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
                     30:  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
                     31:  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
                     32:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
                     33:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
                     34:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
                     35:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
                     36:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
                     37:  * POSSIBILITY OF SUCH DAMAGE.
                     38:  */
1.24      scottr     39:
1.25      thorpej    40: #include "opt_pool.h"
1.24      scottr     41: #include "opt_poollog.h"
1.28      thorpej    42: #include "opt_lockdebug.h"
1.1       pk         43:
                     44: #include <sys/param.h>
                     45: #include <sys/systm.h>
                     46: #include <sys/proc.h>
                     47: #include <sys/errno.h>
                     48: #include <sys/kernel.h>
                     49: #include <sys/malloc.h>
                     50: #include <sys/lock.h>
                     51: #include <sys/pool.h>
1.20      thorpej    52: #include <sys/syslog.h>
1.1       pk         53:
1.3       pk         54: #include <vm/vm.h>
                     55: #include <vm/vm_kern.h>
                     56:
                     57: #include <uvm/uvm.h>
                     58:
1.1       pk         59: /*
                     60:  * Pool resource management utility.
1.3       pk         61:  *
                     62:  * Memory is allocated in pages which are split into pieces according
                     63:  * to the pool item size. Each page is kept on a list headed by `pr_pagelist'
                     64:  * in the pool structure and the individual pool items are on a linked list
                     65:  * headed by `ph_itemlist' in each page header. The memory for building
                     66:  * the page list is either taken from the allocated pages themselves (for
                     67:  * small pool items) or taken from an internal pool of page headers (`phpool').
1.1       pk         68:  */
                     69:
1.3       pk         70: /* List of all pools */
1.5       thorpej    71: TAILQ_HEAD(,pool) pool_head = TAILQ_HEAD_INITIALIZER(pool_head);
1.3       pk         72:
                     73: /* Private pool for page header structures */
                     74: static struct pool phpool;
                     75:
                     76: /* # of seconds to retain page after last use */
                     77: int pool_inactive_time = 10;
                     78:
                     79: /* Next candidate for drainage (see pool_drain()) */
1.23      thorpej    80: static struct pool     *drainpp;
                     81:
                     82: /* This spin lock protects both pool_head and drainpp. */
                     83: struct simplelock pool_head_slock = SIMPLELOCK_INITIALIZER;
1.3       pk         84:
                     85: struct pool_item_header {
                     86:        /* Page headers */
                     87:        TAILQ_ENTRY(pool_item_header)
                     88:                                ph_pagelist;    /* pool page list */
                     89:        TAILQ_HEAD(,pool_item)  ph_itemlist;    /* chunk list for this page */
                     90:        LIST_ENTRY(pool_item_header)
                     91:                                ph_hashlist;    /* Off-page page headers */
                     92:        int                     ph_nmissing;    /* # of chunks in use */
                     93:        caddr_t                 ph_page;        /* this page's address */
                     94:        struct timeval          ph_time;        /* last referenced */
                     95: };
                     96:
1.1       pk         97: struct pool_item {
1.3       pk         98: #ifdef DIAGNOSTIC
                     99:        int pi_magic;
1.33    ! chs       100: #endif
1.25      thorpej   101: #define        PI_MAGIC 0xdeadbeef
1.3       pk        102:        /* Other entries use only this list entry */
                    103:        TAILQ_ENTRY(pool_item)  pi_list;
                    104: };
                    105:
                    106:
1.25      thorpej   107: #define        PR_HASH_INDEX(pp,addr) \
1.3       pk        108:        (((u_long)(addr) >> (pp)->pr_pageshift) & (PR_HASHTABSIZE - 1))
                    109:
                    110:
                    111:
                    112: static struct pool_item_header
                    113:                *pr_find_pagehead __P((struct pool *, caddr_t));
                    114: static void    pr_rmpage __P((struct pool *, struct pool_item_header *));
1.20      thorpej   115: static int     pool_catchup __P((struct pool *));
1.21      thorpej   116: static void    pool_prime_page __P((struct pool *, caddr_t));
1.3       pk        117: static void    *pool_page_alloc __P((unsigned long, int, int));
                    118: static void    pool_page_free __P((void *, unsigned long, int));
                    119:
1.25      thorpej   120: static void pool_print1 __P((struct pool *, const char *,
                    121:        void (*)(const char *, ...)));
1.3       pk        122:
                    123: /*
                    124:  * Pool log entry. An array of these is allocated in pool_create().
                    125:  */
                    126: struct pool_log {
                    127:        const char      *pl_file;
                    128:        long            pl_line;
                    129:        int             pl_action;
1.25      thorpej   130: #define        PRLOG_GET       1
                    131: #define        PRLOG_PUT       2
1.3       pk        132:        void            *pl_addr;
1.1       pk        133: };
                    134:
1.3       pk        135: /* Number of entries in pool log buffers */
1.17      thorpej   136: #ifndef POOL_LOGSIZE
                    137: #define        POOL_LOGSIZE    10
                    138: #endif
                    139:
                    140: int pool_logsize = POOL_LOGSIZE;
1.1       pk        141:
1.25      thorpej   142: #ifdef DIAGNOSTIC
1.3       pk        143: static void    pr_log __P((struct pool *, void *, int, const char *, long));
1.25      thorpej   144: static void    pr_printlog __P((struct pool *, struct pool_item *,
                    145:                    void (*)(const char *, ...)));
                    146: static void    pr_enter __P((struct pool *, const char *, long));
                    147: static void    pr_leave __P((struct pool *));
                    148: static void    pr_enter_check __P((struct pool *,
                    149:                    void (*)(const char *, ...)));
1.3       pk        150:
                    151: static __inline__ void
                    152: pr_log(pp, v, action, file, line)
                    153:        struct pool     *pp;
                    154:        void            *v;
                    155:        int             action;
                    156:        const char      *file;
                    157:        long            line;
                    158: {
                    159:        int n = pp->pr_curlogentry;
                    160:        struct pool_log *pl;
                    161:
1.20      thorpej   162:        if ((pp->pr_roflags & PR_LOGGING) == 0)
1.3       pk        163:                return;
                    164:
                    165:        /*
                    166:         * Fill in the current entry. Wrap around and overwrite
                    167:         * the oldest entry if necessary.
                    168:         */
                    169:        pl = &pp->pr_log[n];
                    170:        pl->pl_file = file;
                    171:        pl->pl_line = line;
                    172:        pl->pl_action = action;
                    173:        pl->pl_addr = v;
                    174:        if (++n >= pp->pr_logsize)
                    175:                n = 0;
                    176:        pp->pr_curlogentry = n;
                    177: }
                    178:
                    179: static void
1.25      thorpej   180: pr_printlog(pp, pi, pr)
1.3       pk        181:        struct pool *pp;
1.25      thorpej   182:        struct pool_item *pi;
                    183:        void (*pr) __P((const char *, ...));
1.3       pk        184: {
                    185:        int i = pp->pr_logsize;
                    186:        int n = pp->pr_curlogentry;
                    187:
1.20      thorpej   188:        if ((pp->pr_roflags & PR_LOGGING) == 0)
1.3       pk        189:                return;
                    190:
                    191:        /*
                    192:         * Print all entries in this pool's log.
                    193:         */
                    194:        while (i-- > 0) {
                    195:                struct pool_log *pl = &pp->pr_log[n];
                    196:                if (pl->pl_action != 0) {
1.25      thorpej   197:                        if (pi == NULL || pi == pl->pl_addr) {
                    198:                                (*pr)("\tlog entry %d:\n", i);
                    199:                                (*pr)("\t\taction = %s, addr = %p\n",
                    200:                                    pl->pl_action == PRLOG_GET ? "get" : "put",
                    201:                                    pl->pl_addr);
                    202:                                (*pr)("\t\tfile: %s at line %lu\n",
                    203:                                    pl->pl_file, pl->pl_line);
                    204:                        }
1.3       pk        205:                }
                    206:                if (++n >= pp->pr_logsize)
                    207:                        n = 0;
                    208:        }
                    209: }
1.25      thorpej   210:
                    211: static __inline__ void
                    212: pr_enter(pp, file, line)
                    213:        struct pool *pp;
                    214:        const char *file;
                    215:        long line;
                    216: {
                    217:
                    218:        if (pp->pr_entered_file != NULL) {
                    219:                printf("pool %s: reentrancy at file %s line %ld\n",
                    220:                    pp->pr_wchan, file, line);
                    221:                printf("         previous entry at file %s line %ld\n",
                    222:                    pp->pr_entered_file, pp->pr_entered_line);
                    223:                panic("pr_enter");
                    224:        }
                    225:
                    226:        pp->pr_entered_file = file;
                    227:        pp->pr_entered_line = line;
                    228: }
                    229:
                    230: static __inline__ void
                    231: pr_leave(pp)
                    232:        struct pool *pp;
                    233: {
                    234:
                    235:        if (pp->pr_entered_file == NULL) {
                    236:                printf("pool %s not entered?\n", pp->pr_wchan);
                    237:                panic("pr_leave");
                    238:        }
                    239:
                    240:        pp->pr_entered_file = NULL;
                    241:        pp->pr_entered_line = 0;
                    242: }
                    243:
                    244: static __inline__ void
                    245: pr_enter_check(pp, pr)
                    246:        struct pool *pp;
                    247:        void (*pr) __P((const char *, ...));
                    248: {
                    249:
                    250:        if (pp->pr_entered_file != NULL)
                    251:                (*pr)("\n\tcurrently entered from file %s line %ld\n",
                    252:                    pp->pr_entered_file, pp->pr_entered_line);
                    253: }
1.3       pk        254: #else
1.25      thorpej   255: #define        pr_log(pp, v, action, file, line)
                    256: #define        pr_printlog(pp, pi, pr)
                    257: #define        pr_enter(pp, file, line)
                    258: #define        pr_leave(pp)
                    259: #define        pr_enter_check(pp, pr)
                    260: #endif /* DIAGNOSTIC */
1.3       pk        261:
                    262: /*
                    263:  * Return the pool page header based on page address.
                    264:  */
                    265: static __inline__ struct pool_item_header *
                    266: pr_find_pagehead(pp, page)
                    267:        struct pool *pp;
                    268:        caddr_t page;
                    269: {
                    270:        struct pool_item_header *ph;
                    271:
1.20      thorpej   272:        if ((pp->pr_roflags & PR_PHINPAGE) != 0)
1.3       pk        273:                return ((struct pool_item_header *)(page + pp->pr_phoffset));
                    274:
                    275:        for (ph = LIST_FIRST(&pp->pr_hashtab[PR_HASH_INDEX(pp, page)]);
                    276:             ph != NULL;
                    277:             ph = LIST_NEXT(ph, ph_hashlist)) {
                    278:                if (ph->ph_page == page)
                    279:                        return (ph);
                    280:        }
                    281:        return (NULL);
                    282: }
                    283:
                    284: /*
                    285:  * Remove a page from the pool.
                    286:  */
                    287: static __inline__ void
                    288: pr_rmpage(pp, ph)
                    289:        struct pool *pp;
                    290:        struct pool_item_header *ph;
                    291: {
                    292:
                    293:        /*
1.7       thorpej   294:         * If the page was idle, decrement the idle page count.
1.3       pk        295:         */
1.6       thorpej   296:        if (ph->ph_nmissing == 0) {
                    297: #ifdef DIAGNOSTIC
                    298:                if (pp->pr_nidle == 0)
                    299:                        panic("pr_rmpage: nidle inconsistent");
1.20      thorpej   300:                if (pp->pr_nitems < pp->pr_itemsperpage)
                    301:                        panic("pr_rmpage: nitems inconsistent");
1.6       thorpej   302: #endif
                    303:                pp->pr_nidle--;
                    304:        }
1.7       thorpej   305:
1.20      thorpej   306:        pp->pr_nitems -= pp->pr_itemsperpage;
                    307:
1.7       thorpej   308:        /*
                    309:         * Unlink a page from the pool and release it.
                    310:         */
                    311:        TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
                    312:        (*pp->pr_free)(ph->ph_page, pp->pr_pagesz, pp->pr_mtype);
                    313:        pp->pr_npages--;
                    314:        pp->pr_npagefree++;
1.6       thorpej   315:
1.22      chs       316:        if ((pp->pr_roflags & PR_PHINPAGE) == 0) {
1.27      pk        317:                int s;
1.22      chs       318:                LIST_REMOVE(ph, ph_hashlist);
1.27      pk        319:                s = splhigh();
1.22      chs       320:                pool_put(&phpool, ph);
1.27      pk        321:                splx(s);
1.22      chs       322:        }
                    323:
1.3       pk        324:        if (pp->pr_curpage == ph) {
                    325:                /*
                    326:                 * Find a new non-empty page header, if any.
                    327:                 * Start search from the page head, to increase the
                    328:                 * chance for "high water" pages to be freed.
                    329:                 */
                    330:                for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
                    331:                     ph = TAILQ_NEXT(ph, ph_pagelist))
                    332:                        if (TAILQ_FIRST(&ph->ph_itemlist) != NULL)
                    333:                                break;
                    334:
                    335:                pp->pr_curpage = ph;
1.21      thorpej   336:        }
1.3       pk        337: }
                    338:
                    339: /*
                    340:  * Allocate and initialize a pool.
                    341:  */
1.1       pk        342: struct pool *
1.3       pk        343: pool_create(size, align, ioff, nitems, wchan, pagesz, alloc, release, mtype)
1.1       pk        344:        size_t  size;
1.3       pk        345:        u_int   align;
                    346:        u_int   ioff;
1.1       pk        347:        int     nitems;
1.21      thorpej   348:        const char *wchan;
1.3       pk        349:        size_t  pagesz;
                    350:        void    *(*alloc) __P((unsigned long, int, int));
                    351:        void    (*release) __P((void *, unsigned long, int));
1.1       pk        352:        int     mtype;
                    353: {
                    354:        struct pool *pp;
1.3       pk        355:        int flags;
1.1       pk        356:
1.3       pk        357:        pp = (struct pool *)malloc(sizeof(*pp), M_POOL, M_NOWAIT);
                    358:        if (pp == NULL)
1.1       pk        359:                return (NULL);
1.3       pk        360:
                    361:        flags = PR_FREEHEADER;
                    362:        pool_init(pp, size, align, ioff, flags, wchan, pagesz,
                    363:                  alloc, release, mtype);
                    364:
                    365:        if (nitems != 0) {
                    366:                if (pool_prime(pp, nitems, NULL) != 0) {
                    367:                        pool_destroy(pp);
                    368:                        return (NULL);
                    369:                }
1.1       pk        370:        }
                    371:
1.3       pk        372:        return (pp);
                    373: }
                    374:
                    375: /*
                    376:  * Initialize the given pool resource structure.
                    377:  *
                    378:  * We export this routine to allow other kernel parts to declare
                    379:  * static pools that must be initialized before malloc() is available.
                    380:  */
                    381: void
                    382: pool_init(pp, size, align, ioff, flags, wchan, pagesz, alloc, release, mtype)
                    383:        struct pool     *pp;
                    384:        size_t          size;
                    385:        u_int           align;
                    386:        u_int           ioff;
                    387:        int             flags;
1.21      thorpej   388:        const char      *wchan;
1.3       pk        389:        size_t          pagesz;
                    390:        void            *(*alloc) __P((unsigned long, int, int));
                    391:        void            (*release) __P((void *, unsigned long, int));
                    392:        int             mtype;
                    393: {
1.16      briggs    394:        int off, slack, i;
1.3       pk        395:
1.25      thorpej   396: #ifdef POOL_DIAGNOSTIC
                    397:        /*
                    398:         * Always log if POOL_DIAGNOSTIC is defined.
                    399:         */
                    400:        if (pool_logsize != 0)
                    401:                flags |= PR_LOGGING;
                    402: #endif
                    403:
1.3       pk        404:        /*
                    405:         * Check arguments and construct default values.
                    406:         */
                    407:        if (!powerof2(pagesz) || pagesz > PAGE_SIZE)
                    408:                panic("pool_init: page size invalid (%lx)\n", (u_long)pagesz);
                    409:
1.4       thorpej   410:        if (alloc == NULL && release == NULL) {
1.3       pk        411:                alloc = pool_page_alloc;
                    412:                release = pool_page_free;
1.4       thorpej   413:                pagesz = PAGE_SIZE;     /* Rounds to PAGE_SIZE anyhow. */
                    414:        } else if ((alloc != NULL && release != NULL) == 0) {
                    415:                /* If you specifiy one, must specify both. */
                    416:                panic("pool_init: must specify alloc and release together");
                    417:        }
                    418:
1.3       pk        419:        if (pagesz == 0)
                    420:                pagesz = PAGE_SIZE;
                    421:
                    422:        if (align == 0)
                    423:                align = ALIGN(1);
1.14      thorpej   424:
                    425:        if (size < sizeof(struct pool_item))
                    426:                size = sizeof(struct pool_item);
1.3       pk        427:
                    428:        /*
                    429:         * Initialize the pool structure.
                    430:         */
                    431:        TAILQ_INIT(&pp->pr_pagelist);
                    432:        pp->pr_curpage = NULL;
                    433:        pp->pr_npages = 0;
                    434:        pp->pr_minitems = 0;
                    435:        pp->pr_minpages = 0;
                    436:        pp->pr_maxpages = UINT_MAX;
1.20      thorpej   437:        pp->pr_roflags = flags;
                    438:        pp->pr_flags = 0;
1.3       pk        439:        pp->pr_size = ALIGN(size);
                    440:        pp->pr_align = align;
                    441:        pp->pr_wchan = wchan;
                    442:        pp->pr_mtype = mtype;
                    443:        pp->pr_alloc = alloc;
                    444:        pp->pr_free = release;
                    445:        pp->pr_pagesz = pagesz;
                    446:        pp->pr_pagemask = ~(pagesz - 1);
                    447:        pp->pr_pageshift = ffs(pagesz) - 1;
1.20      thorpej   448:        pp->pr_nitems = 0;
                    449:        pp->pr_nout = 0;
                    450:        pp->pr_hardlimit = UINT_MAX;
                    451:        pp->pr_hardlimit_warning = NULL;
1.31      thorpej   452:        pp->pr_hardlimit_ratecap.tv_sec = 0;
                    453:        pp->pr_hardlimit_ratecap.tv_usec = 0;
                    454:        pp->pr_hardlimit_warning_last.tv_sec = 0;
                    455:        pp->pr_hardlimit_warning_last.tv_usec = 0;
1.3       pk        456:
                    457:        /*
                    458:         * Decide whether to put the page header off page to avoid
                    459:         * wasting too large a part of the page. Off-page page headers
                    460:         * go on a hash table, so we can match a returned item
                    461:         * with its header based on the page address.
                    462:         * We use 1/16 of the page size as the threshold (XXX: tune)
                    463:         */
                    464:        if (pp->pr_size < pagesz/16) {
                    465:                /* Use the end of the page for the page header */
1.20      thorpej   466:                pp->pr_roflags |= PR_PHINPAGE;
1.3       pk        467:                pp->pr_phoffset = off =
                    468:                        pagesz - ALIGN(sizeof(struct pool_item_header));
1.2       pk        469:        } else {
1.3       pk        470:                /* The page header will be taken from our page header pool */
                    471:                pp->pr_phoffset = 0;
                    472:                off = pagesz;
1.16      briggs    473:                for (i = 0; i < PR_HASHTABSIZE; i++) {
                    474:                        LIST_INIT(&pp->pr_hashtab[i]);
                    475:                }
1.2       pk        476:        }
1.1       pk        477:
1.3       pk        478:        /*
                    479:         * Alignment is to take place at `ioff' within the item. This means
                    480:         * we must reserve up to `align - 1' bytes on the page to allow
                    481:         * appropriate positioning of each item.
                    482:         *
                    483:         * Silently enforce `0 <= ioff < align'.
                    484:         */
                    485:        pp->pr_itemoffset = ioff = ioff % align;
                    486:        pp->pr_itemsperpage = (off - ((align - ioff) % align)) / pp->pr_size;
                    487:
                    488:        /*
                    489:         * Use the slack between the chunks and the page header
                    490:         * for "cache coloring".
                    491:         */
                    492:        slack = off - pp->pr_itemsperpage * pp->pr_size;
                    493:        pp->pr_maxcolor = (slack / align) * align;
                    494:        pp->pr_curcolor = 0;
                    495:
                    496:        pp->pr_nget = 0;
                    497:        pp->pr_nfail = 0;
                    498:        pp->pr_nput = 0;
                    499:        pp->pr_npagealloc = 0;
                    500:        pp->pr_npagefree = 0;
1.1       pk        501:        pp->pr_hiwat = 0;
1.8       thorpej   502:        pp->pr_nidle = 0;
1.3       pk        503:
1.25      thorpej   504:        if (flags & PR_LOGGING) {
                    505:                if (kmem_map == NULL ||
                    506:                    (pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log),
                    507:                     M_TEMP, M_NOWAIT)) == NULL)
1.20      thorpej   508:                        pp->pr_roflags &= ~PR_LOGGING;
1.3       pk        509:                pp->pr_curlogentry = 0;
                    510:                pp->pr_logsize = pool_logsize;
                    511:        }
1.25      thorpej   512:
                    513:        pp->pr_entered_file = NULL;
                    514:        pp->pr_entered_line = 0;
1.3       pk        515:
1.21      thorpej   516:        simple_lock_init(&pp->pr_slock);
1.1       pk        517:
1.3       pk        518:        /*
                    519:         * Initialize private page header pool if we haven't done so yet.
1.23      thorpej   520:         * XXX LOCKING.
1.3       pk        521:         */
                    522:        if (phpool.pr_size == 0) {
                    523:                pool_init(&phpool, sizeof(struct pool_item_header), 0, 0,
                    524:                          0, "phpool", 0, 0, 0, 0);
1.1       pk        525:        }
                    526:
1.23      thorpej   527:        /* Insert into the list of all pools. */
                    528:        simple_lock(&pool_head_slock);
                    529:        TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist);
                    530:        simple_unlock(&pool_head_slock);
1.1       pk        531: }
                    532:
                    533: /*
                    534:  * De-commision a pool resource.
                    535:  */
                    536: void
                    537: pool_destroy(pp)
                    538:        struct pool *pp;
                    539: {
1.3       pk        540:        struct pool_item_header *ph;
                    541:
                    542: #ifdef DIAGNOSTIC
1.20      thorpej   543:        if (pp->pr_nout != 0) {
1.25      thorpej   544:                pr_printlog(pp, NULL, printf);
1.20      thorpej   545:                panic("pool_destroy: pool busy: still out: %u\n",
                    546:                    pp->pr_nout);
1.3       pk        547:        }
                    548: #endif
1.1       pk        549:
1.3       pk        550:        /* Remove all pages */
1.20      thorpej   551:        if ((pp->pr_roflags & PR_STATIC) == 0)
1.3       pk        552:                while ((ph = pp->pr_pagelist.tqh_first) != NULL)
                    553:                        pr_rmpage(pp, ph);
                    554:
                    555:        /* Remove from global pool list */
1.23      thorpej   556:        simple_lock(&pool_head_slock);
1.3       pk        557:        TAILQ_REMOVE(&pool_head, pp, pr_poollist);
1.23      thorpej   558:        /* XXX Only clear this if we were drainpp? */
1.3       pk        559:        drainpp = NULL;
1.23      thorpej   560:        simple_unlock(&pool_head_slock);
1.3       pk        561:
1.20      thorpej   562:        if ((pp->pr_roflags & PR_LOGGING) != 0)
1.3       pk        563:                free(pp->pr_log, M_TEMP);
1.2       pk        564:
1.20      thorpej   565:        if (pp->pr_roflags & PR_FREEHEADER)
1.3       pk        566:                free(pp, M_POOL);
1.1       pk        567: }
                    568:
                    569:
                    570: /*
1.3       pk        571:  * Grab an item from the pool; must be called at appropriate spl level
1.1       pk        572:  */
1.3       pk        573: void *
                    574: _pool_get(pp, flags, file, line)
                    575:        struct pool *pp;
                    576:        int flags;
                    577:        const char *file;
                    578:        long line;
1.1       pk        579: {
                    580:        void *v;
                    581:        struct pool_item *pi;
1.3       pk        582:        struct pool_item_header *ph;
1.1       pk        583:
1.2       pk        584: #ifdef DIAGNOSTIC
1.20      thorpej   585:        if ((pp->pr_roflags & PR_STATIC) && (flags & PR_MALLOCOK)) {
1.25      thorpej   586:                pr_printlog(pp, NULL, printf);
1.2       pk        587:                panic("pool_get: static");
1.3       pk        588:        }
1.2       pk        589: #endif
                    590:
1.3       pk        591:        if (curproc == NULL && (flags & PR_WAITOK) != 0)
                    592:                panic("pool_get: must have NOWAIT");
1.1       pk        593:
1.21      thorpej   594:        simple_lock(&pp->pr_slock);
1.25      thorpej   595:        pr_enter(pp, file, line);
1.20      thorpej   596:
                    597:  startover:
                    598:        /*
                    599:         * Check to see if we've reached the hard limit.  If we have,
                    600:         * and we can wait, then wait until an item has been returned to
                    601:         * the pool.
                    602:         */
                    603: #ifdef DIAGNOSTIC
                    604:        if (pp->pr_nout > pp->pr_hardlimit) {
1.25      thorpej   605:                pr_leave(pp);
1.21      thorpej   606:                simple_unlock(&pp->pr_slock);
1.20      thorpej   607:                panic("pool_get: %s: crossed hard limit", pp->pr_wchan);
                    608:        }
                    609: #endif
                    610:        if (pp->pr_nout == pp->pr_hardlimit) {
1.29      sommerfe  611:                if ((flags & PR_WAITOK) && !(flags & PR_LIMITFAIL)) {
1.20      thorpej   612:                        /*
                    613:                         * XXX: A warning isn't logged in this case.  Should
                    614:                         * it be?
                    615:                         */
                    616:                        pp->pr_flags |= PR_WANTED;
1.25      thorpej   617:                        pr_leave(pp);
1.21      thorpej   618:                        simple_unlock(&pp->pr_slock);
1.20      thorpej   619:                        tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);
1.21      thorpej   620:                        simple_lock(&pp->pr_slock);
1.25      thorpej   621:                        pr_enter(pp, file, line);
1.20      thorpej   622:                        goto startover;
                    623:                }
1.31      thorpej   624:
                    625:                /*
                    626:                 * Log a message that the hard limit has been hit.
                    627:                 */
                    628:                if (pp->pr_hardlimit_warning != NULL &&
                    629:                    ratecheck(&pp->pr_hardlimit_warning_last,
                    630:                              &pp->pr_hardlimit_ratecap))
                    631:                        log(LOG_ERR, "%s\n", pp->pr_hardlimit_warning);
1.21      thorpej   632:
                    633:                if (flags & PR_URGENT)
                    634:                        panic("pool_get: urgent");
                    635:
                    636:                pp->pr_nfail++;
                    637:
1.25      thorpej   638:                pr_leave(pp);
1.21      thorpej   639:                simple_unlock(&pp->pr_slock);
1.20      thorpej   640:                return (NULL);
                    641:        }
                    642:
1.3       pk        643:        /*
                    644:         * The convention we use is that if `curpage' is not NULL, then
                    645:         * it points at a non-empty bucket. In particular, `curpage'
                    646:         * never points at a page header which has PR_PHINPAGE set and
                    647:         * has no items in its bucket.
                    648:         */
1.20      thorpej   649:        if ((ph = pp->pr_curpage) == NULL) {
1.15      pk        650:                void *v;
                    651:
1.20      thorpej   652: #ifdef DIAGNOSTIC
                    653:                if (pp->pr_nitems != 0) {
1.21      thorpej   654:                        simple_unlock(&pp->pr_slock);
1.20      thorpej   655:                        printf("pool_get: %s: curpage NULL, nitems %u\n",
                    656:                            pp->pr_wchan, pp->pr_nitems);
                    657:                        panic("pool_get: nitems inconsistent\n");
                    658:                }
                    659: #endif
                    660:
1.21      thorpej   661:                /*
                    662:                 * Call the back-end page allocator for more memory.
                    663:                 * Release the pool lock, as the back-end page allocator
                    664:                 * may block.
                    665:                 */
1.25      thorpej   666:                pr_leave(pp);
1.21      thorpej   667:                simple_unlock(&pp->pr_slock);
                    668:                v = (*pp->pr_alloc)(pp->pr_pagesz, flags, pp->pr_mtype);
                    669:                simple_lock(&pp->pr_slock);
1.25      thorpej   670:                pr_enter(pp, file, line);
1.15      pk        671:
1.21      thorpej   672:                if (v == NULL) {
                    673:                        /*
                    674:                         * We were unable to allocate a page, but
                    675:                         * we released the lock during allocation,
                    676:                         * so perhaps items were freed back to the
                    677:                         * pool.  Check for this case.
                    678:                         */
                    679:                        if (pp->pr_curpage != NULL)
                    680:                                goto startover;
1.15      pk        681:
1.3       pk        682:                        if (flags & PR_URGENT)
                    683:                                panic("pool_get: urgent");
1.21      thorpej   684:
1.3       pk        685:                        if ((flags & PR_WAITOK) == 0) {
                    686:                                pp->pr_nfail++;
1.25      thorpej   687:                                pr_leave(pp);
1.21      thorpej   688:                                simple_unlock(&pp->pr_slock);
1.1       pk        689:                                return (NULL);
1.3       pk        690:                        }
                    691:
1.15      pk        692:                        /*
                    693:                         * Wait for items to be returned to this pool.
1.21      thorpej   694:                         *
1.15      pk        695:                         * XXX: we actually want to wait just until
                    696:                         * the page allocator has memory again. Depending
                    697:                         * on this pool's usage, we might get stuck here
                    698:                         * for a long time.
1.20      thorpej   699:                         *
                    700:                         * XXX: maybe we should wake up once a second and
                    701:                         * try again?
1.15      pk        702:                         */
1.1       pk        703:                        pp->pr_flags |= PR_WANTED;
1.25      thorpej   704:                        pr_leave(pp);
1.21      thorpej   705:                        simple_unlock(&pp->pr_slock);
1.1       pk        706:                        tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);
1.21      thorpej   707:                        simple_lock(&pp->pr_slock);
1.25      thorpej   708:                        pr_enter(pp, file, line);
1.20      thorpej   709:                        goto startover;
1.1       pk        710:                }
1.3       pk        711:
1.15      pk        712:                /* We have more memory; add it to the pool */
                    713:                pp->pr_npagealloc++;
                    714:                pool_prime_page(pp, v);
                    715:
1.20      thorpej   716:                /* Start the allocation process over. */
                    717:                goto startover;
1.3       pk        718:        }
                    719:
1.21      thorpej   720:        if ((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL) {
1.25      thorpej   721:                pr_leave(pp);
1.21      thorpej   722:                simple_unlock(&pp->pr_slock);
1.3       pk        723:                panic("pool_get: %s: page empty", pp->pr_wchan);
1.21      thorpej   724:        }
1.20      thorpej   725: #ifdef DIAGNOSTIC
                    726:        if (pp->pr_nitems == 0) {
1.25      thorpej   727:                pr_leave(pp);
1.21      thorpej   728:                simple_unlock(&pp->pr_slock);
1.20      thorpej   729:                printf("pool_get: %s: items on itemlist, nitems %u\n",
                    730:                    pp->pr_wchan, pp->pr_nitems);
                    731:                panic("pool_get: nitems inconsistent\n");
                    732:        }
                    733: #endif
1.3       pk        734:        pr_log(pp, v, PRLOG_GET, file, line);
                    735:
                    736: #ifdef DIAGNOSTIC
                    737:        if (pi->pi_magic != PI_MAGIC) {
1.25      thorpej   738:                pr_printlog(pp, pi, printf);
1.3       pk        739:                panic("pool_get(%s): free list modified: magic=%x; page %p;"
                    740:                       " item addr %p\n",
                    741:                        pp->pr_wchan, pi->pi_magic, ph->ph_page, pi);
                    742:        }
                    743: #endif
                    744:
                    745:        /*
                    746:         * Remove from item list.
                    747:         */
                    748:        TAILQ_REMOVE(&ph->ph_itemlist, pi, pi_list);
1.20      thorpej   749:        pp->pr_nitems--;
                    750:        pp->pr_nout++;
1.6       thorpej   751:        if (ph->ph_nmissing == 0) {
                    752: #ifdef DIAGNOSTIC
                    753:                if (pp->pr_nidle == 0)
                    754:                        panic("pool_get: nidle inconsistent");
                    755: #endif
                    756:                pp->pr_nidle--;
                    757:        }
1.3       pk        758:        ph->ph_nmissing++;
                    759:        if (TAILQ_FIRST(&ph->ph_itemlist) == NULL) {
1.21      thorpej   760: #ifdef DIAGNOSTIC
                    761:                if (ph->ph_nmissing != pp->pr_itemsperpage) {
1.25      thorpej   762:                        pr_leave(pp);
1.21      thorpej   763:                        simple_unlock(&pp->pr_slock);
                    764:                        panic("pool_get: %s: nmissing inconsistent",
                    765:                            pp->pr_wchan);
                    766:                }
                    767: #endif
1.3       pk        768:                /*
                    769:                 * Find a new non-empty page header, if any.
                    770:                 * Start search from the page head, to increase
                    771:                 * the chance for "high water" pages to be freed.
                    772:                 *
1.21      thorpej   773:                 * Migrate empty pages to the end of the list.  This
                    774:                 * will speed the update of curpage as pages become
                    775:                 * idle.  Empty pages intermingled with idle pages
                    776:                 * is no big deal.  As soon as a page becomes un-empty,
                    777:                 * it will move back to the head of the list.
1.3       pk        778:                 */
                    779:                TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
1.21      thorpej   780:                TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist);
                    781:                for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
                    782:                     ph = TAILQ_NEXT(ph, ph_pagelist))
1.3       pk        783:                        if (TAILQ_FIRST(&ph->ph_itemlist) != NULL)
                    784:                                break;
                    785:
                    786:                pp->pr_curpage = ph;
1.1       pk        787:        }
1.3       pk        788:
                    789:        pp->pr_nget++;
1.20      thorpej   790:
                    791:        /*
                    792:         * If we have a low water mark and we are now below that low
                    793:         * water mark, add more items to the pool.
                    794:         */
                    795:        if (pp->pr_nitems < pp->pr_minitems && pool_catchup(pp) != 0) {
                    796:                /*
                    797:                 * XXX: Should we log a warning?  Should we set up a timeout
                    798:                 * to try again in a second or so?  The latter could break
                    799:                 * a caller's assumptions about interrupt protection, etc.
                    800:                 */
                    801:        }
                    802:
1.25      thorpej   803:        pr_leave(pp);
1.21      thorpej   804:        simple_unlock(&pp->pr_slock);
1.1       pk        805:        return (v);
                    806: }
                    807:
                    808: /*
1.3       pk        809:  * Return resource to the pool; must be called at appropriate spl level
1.1       pk        810:  */
1.3       pk        811: void
                    812: _pool_put(pp, v, file, line)
                    813:        struct pool *pp;
                    814:        void *v;
                    815:        const char *file;
                    816:        long line;
1.1       pk        817: {
                    818:        struct pool_item *pi = v;
1.3       pk        819:        struct pool_item_header *ph;
                    820:        caddr_t page;
1.21      thorpej   821:        int s;
1.3       pk        822:
                    823:        page = (caddr_t)((u_long)v & pp->pr_pagemask);
1.1       pk        824:
1.21      thorpej   825:        simple_lock(&pp->pr_slock);
1.25      thorpej   826:        pr_enter(pp, file, line);
1.30      thorpej   827:
                    828: #ifdef DIAGNOSTIC
                    829:        if (pp->pr_nout == 0) {
                    830:                printf("pool %s: putting with none out\n",
                    831:                    pp->pr_wchan);
                    832:                panic("pool_put");
                    833:        }
                    834: #endif
1.3       pk        835:
                    836:        pr_log(pp, v, PRLOG_PUT, file, line);
                    837:
                    838:        if ((ph = pr_find_pagehead(pp, page)) == NULL) {
1.25      thorpej   839:                pr_printlog(pp, NULL, printf);
1.3       pk        840:                panic("pool_put: %s: page header missing", pp->pr_wchan);
                    841:        }
1.28      thorpej   842:
                    843: #ifdef LOCKDEBUG
                    844:        /*
                    845:         * Check if we're freeing a locked simple lock.
                    846:         */
                    847:        simple_lock_freecheck((caddr_t)pi, ((caddr_t)pi) + pp->pr_size);
                    848: #endif
1.3       pk        849:
                    850:        /*
                    851:         * Return to item list.
                    852:         */
1.2       pk        853: #ifdef DIAGNOSTIC
1.3       pk        854:        pi->pi_magic = PI_MAGIC;
                    855: #endif
1.32      chs       856: #ifdef DEBUG
                    857:        {
                    858:                int i, *ip = v;
                    859:
                    860:                for (i = 0; i < pp->pr_size / sizeof(int); i++) {
                    861:                        *ip++ = PI_MAGIC;
                    862:                }
                    863:        }
                    864: #endif
                    865:
1.3       pk        866:        TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list);
                    867:        ph->ph_nmissing--;
                    868:        pp->pr_nput++;
1.20      thorpej   869:        pp->pr_nitems++;
                    870:        pp->pr_nout--;
1.3       pk        871:
                    872:        /* Cancel "pool empty" condition if it exists */
                    873:        if (pp->pr_curpage == NULL)
                    874:                pp->pr_curpage = ph;
                    875:
                    876:        if (pp->pr_flags & PR_WANTED) {
                    877:                pp->pr_flags &= ~PR_WANTED;
1.15      pk        878:                if (ph->ph_nmissing == 0)
                    879:                        pp->pr_nidle++;
1.25      thorpej   880:                pr_leave(pp);
1.21      thorpej   881:                simple_unlock(&pp->pr_slock);
1.3       pk        882:                wakeup((caddr_t)pp);
                    883:                return;
                    884:        }
                    885:
                    886:        /*
1.21      thorpej   887:         * If this page is now complete, do one of two things:
                    888:         *
                    889:         *      (1) If we have more pages than the page high water
                    890:         *          mark, free the page back to the system.
                    891:         *
                    892:         *      (2) Move it to the end of the page list, so that
                    893:         *          we minimize our chances of fragmenting the
                    894:         *          pool.  Idle pages migrate to the end (along with
                    895:         *          completely empty pages, so that we find un-empty
                    896:         *          pages more quickly when we update curpage) of the
                    897:         *          list so they can be more easily swept up by
                    898:         *          the pagedaemon when pages are scarce.
1.3       pk        899:         */
                    900:        if (ph->ph_nmissing == 0) {
1.6       thorpej   901:                pp->pr_nidle++;
1.3       pk        902:                if (pp->pr_npages > pp->pr_maxpages) {
                    903:                        pr_rmpage(pp, ph);
                    904:                } else {
                    905:                        TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
                    906:                        TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist);
                    907:
1.21      thorpej   908:                        /*
                    909:                         * Update the timestamp on the page.  A page must
                    910:                         * be idle for some period of time before it can
                    911:                         * be reclaimed by the pagedaemon.  This minimizes
                    912:                         * ping-pong'ing for memory.
                    913:                         */
                    914:                        s = splclock();
                    915:                        ph->ph_time = mono_time;
                    916:                        splx(s);
                    917:
                    918:                        /*
                    919:                         * Update the current page pointer.  Just look for
                    920:                         * the first page with any free items.
                    921:                         *
                    922:                         * XXX: Maybe we want an option to look for the
                    923:                         * page with the fewest available items, to minimize
                    924:                         * fragmentation?
                    925:                         */
1.3       pk        926:                        for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
                    927:                             ph = TAILQ_NEXT(ph, ph_pagelist))
                    928:                                if (TAILQ_FIRST(&ph->ph_itemlist) != NULL)
                    929:                                        break;
1.1       pk        930:
1.3       pk        931:                        pp->pr_curpage = ph;
1.1       pk        932:                }
                    933:        }
1.21      thorpej   934:        /*
                    935:         * If the page has just become un-empty, move it to the head of
                    936:         * the list, and make it the current page.  The next allocation
                    937:         * will get the item from this page, instead of further fragmenting
                    938:         * the pool.
                    939:         */
                    940:        else if (ph->ph_nmissing == (pp->pr_itemsperpage - 1)) {
                    941:                TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
                    942:                TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist);
                    943:                pp->pr_curpage = ph;
                    944:        }
                    945:
1.25      thorpej   946:        pr_leave(pp);
1.21      thorpej   947:        simple_unlock(&pp->pr_slock);
1.3       pk        948:
1.1       pk        949: }
                    950:
                    951: /*
1.3       pk        952:  * Add N items to the pool.
1.1       pk        953:  */
                    954: int
1.2       pk        955: pool_prime(pp, n, storage)
1.1       pk        956:        struct pool *pp;
                    957:        int n;
1.2       pk        958:        caddr_t storage;
1.1       pk        959: {
1.3       pk        960:        caddr_t cp;
                    961:        int newnitems, newpages;
1.2       pk        962:
                    963: #ifdef DIAGNOSTIC
1.20      thorpej   964:        if (storage && !(pp->pr_roflags & PR_STATIC))
1.2       pk        965:                panic("pool_prime: static");
                    966:        /* !storage && static caught below */
                    967: #endif
1.1       pk        968:
1.21      thorpej   969:        simple_lock(&pp->pr_slock);
                    970:
1.3       pk        971:        newnitems = pp->pr_minitems + n;
                    972:        newpages =
1.18      thorpej   973:                roundup(newnitems, pp->pr_itemsperpage) / pp->pr_itemsperpage
1.3       pk        974:                - pp->pr_minpages;
                    975:
                    976:        while (newpages-- > 0) {
1.20      thorpej   977:                if (pp->pr_roflags & PR_STATIC) {
1.3       pk        978:                        cp = storage;
                    979:                        storage += pp->pr_pagesz;
                    980:                } else {
1.21      thorpej   981:                        simple_unlock(&pp->pr_slock);
1.3       pk        982:                        cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype);
1.21      thorpej   983:                        simple_lock(&pp->pr_slock);
1.3       pk        984:                }
1.2       pk        985:
1.3       pk        986:                if (cp == NULL) {
1.21      thorpej   987:                        simple_unlock(&pp->pr_slock);
1.1       pk        988:                        return (ENOMEM);
                    989:                }
                    990:
1.26      thorpej   991:                pp->pr_npagealloc++;
1.3       pk        992:                pool_prime_page(pp, cp);
                    993:                pp->pr_minpages++;
1.1       pk        994:        }
1.3       pk        995:
                    996:        pp->pr_minitems = newnitems;
                    997:
                    998:        if (pp->pr_minpages >= pp->pr_maxpages)
                    999:                pp->pr_maxpages = pp->pr_minpages + 1;  /* XXX */
                   1000:
1.21      thorpej  1001:        simple_unlock(&pp->pr_slock);
1.1       pk       1002:        return (0);
                   1003: }
1.3       pk       1004:
                   1005: /*
                   1006:  * Add a page worth of items to the pool.
1.21      thorpej  1007:  *
                   1008:  * Note, we must be called with the pool descriptor LOCKED.
1.3       pk       1009:  */
1.21      thorpej  1010: static void
1.3       pk       1011: pool_prime_page(pp, storage)
                   1012:        struct pool *pp;
                   1013:        caddr_t storage;
                   1014: {
                   1015:        struct pool_item *pi;
                   1016:        struct pool_item_header *ph;
                   1017:        caddr_t cp = storage;
                   1018:        unsigned int align = pp->pr_align;
                   1019:        unsigned int ioff = pp->pr_itemoffset;
1.27      pk       1020:        int s, n;
1.3       pk       1021:
1.20      thorpej  1022:        if ((pp->pr_roflags & PR_PHINPAGE) != 0) {
1.3       pk       1023:                ph = (struct pool_item_header *)(cp + pp->pr_phoffset);
                   1024:        } else {
1.27      pk       1025:                s = splhigh();
1.3       pk       1026:                ph = pool_get(&phpool, PR_URGENT);
1.27      pk       1027:                splx(s);
1.3       pk       1028:                LIST_INSERT_HEAD(&pp->pr_hashtab[PR_HASH_INDEX(pp, cp)],
                   1029:                                 ph, ph_hashlist);
                   1030:        }
                   1031:
                   1032:        /*
                   1033:         * Insert page header.
                   1034:         */
                   1035:        TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist);
                   1036:        TAILQ_INIT(&ph->ph_itemlist);
                   1037:        ph->ph_page = storage;
                   1038:        ph->ph_nmissing = 0;
1.21      thorpej  1039:        memset(&ph->ph_time, 0, sizeof(ph->ph_time));
1.3       pk       1040:
1.6       thorpej  1041:        pp->pr_nidle++;
                   1042:
1.3       pk       1043:        /*
                   1044:         * Color this page.
                   1045:         */
                   1046:        cp = (caddr_t)(cp + pp->pr_curcolor);
                   1047:        if ((pp->pr_curcolor += align) > pp->pr_maxcolor)
                   1048:                pp->pr_curcolor = 0;
                   1049:
                   1050:        /*
                   1051:         * Adjust storage to apply aligment to `pr_itemoffset' in each item.
                   1052:         */
                   1053:        if (ioff != 0)
                   1054:                cp = (caddr_t)(cp + (align - ioff));
                   1055:
                   1056:        /*
                   1057:         * Insert remaining chunks on the bucket list.
                   1058:         */
                   1059:        n = pp->pr_itemsperpage;
1.20      thorpej  1060:        pp->pr_nitems += n;
1.3       pk       1061:
                   1062:        while (n--) {
                   1063:                pi = (struct pool_item *)cp;
                   1064:
                   1065:                /* Insert on page list */
                   1066:                TAILQ_INSERT_TAIL(&ph->ph_itemlist, pi, pi_list);
                   1067: #ifdef DIAGNOSTIC
                   1068:                pi->pi_magic = PI_MAGIC;
                   1069: #endif
                   1070:                cp = (caddr_t)(cp + pp->pr_size);
                   1071:        }
                   1072:
                   1073:        /*
                   1074:         * If the pool was depleted, point at the new page.
                   1075:         */
                   1076:        if (pp->pr_curpage == NULL)
                   1077:                pp->pr_curpage = ph;
                   1078:
                   1079:        if (++pp->pr_npages > pp->pr_hiwat)
                   1080:                pp->pr_hiwat = pp->pr_npages;
                   1081: }
                   1082:
1.20      thorpej  1083: /*
                   1084:  * Like pool_prime(), except this is used by pool_get() when nitems
                   1085:  * drops below the low water mark.  This is used to catch up nitmes
                   1086:  * with the low water mark.
                   1087:  *
1.21      thorpej  1088:  * Note 1, we never wait for memory here, we let the caller decide what to do.
1.20      thorpej  1089:  *
                   1090:  * Note 2, this doesn't work with static pools.
                   1091:  *
                   1092:  * Note 3, we must be called with the pool already locked, and we return
                   1093:  * with it locked.
                   1094:  */
                   1095: static int
                   1096: pool_catchup(pp)
                   1097:        struct pool *pp;
                   1098: {
                   1099:        caddr_t cp;
                   1100:        int error = 0;
                   1101:
                   1102:        if (pp->pr_roflags & PR_STATIC) {
                   1103:                /*
                   1104:                 * We dropped below the low water mark, and this is not a
                   1105:                 * good thing.  Log a warning.
1.21      thorpej  1106:                 *
                   1107:                 * XXX: rate-limit this?
1.20      thorpej  1108:                 */
                   1109:                printf("WARNING: static pool `%s' dropped below low water "
                   1110:                    "mark\n", pp->pr_wchan);
                   1111:                return (0);
                   1112:        }
                   1113:
1.21      thorpej  1114:        while (pp->pr_nitems < pp->pr_minitems) {
1.20      thorpej  1115:                /*
1.21      thorpej  1116:                 * Call the page back-end allocator for more memory.
                   1117:                 *
                   1118:                 * XXX: We never wait, so should we bother unlocking
                   1119:                 * the pool descriptor?
1.20      thorpej  1120:                 */
1.21      thorpej  1121:                simple_unlock(&pp->pr_slock);
1.20      thorpej  1122:                cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype);
1.21      thorpej  1123:                simple_lock(&pp->pr_slock);
1.20      thorpej  1124:                if (cp == NULL) {
                   1125:                        error = ENOMEM;
                   1126:                        break;
                   1127:                }
1.26      thorpej  1128:                pp->pr_npagealloc++;
1.20      thorpej  1129:                pool_prime_page(pp, cp);
                   1130:        }
                   1131:
                   1132:        return (error);
                   1133: }
                   1134:
1.3       pk       1135: void
                   1136: pool_setlowat(pp, n)
                   1137:        pool_handle_t   pp;
                   1138:        int n;
                   1139: {
1.20      thorpej  1140:        int error;
1.15      pk       1141:
1.21      thorpej  1142:        simple_lock(&pp->pr_slock);
                   1143:
1.3       pk       1144:        pp->pr_minitems = n;
1.15      pk       1145:        pp->pr_minpages = (n == 0)
                   1146:                ? 0
1.18      thorpej  1147:                : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.20      thorpej  1148:
                   1149:        /* Make sure we're caught up with the newly-set low water mark. */
1.21      thorpej  1150:        if ((error = pool_catchup(pp)) != 0) {
1.20      thorpej  1151:                /*
                   1152:                 * XXX: Should we log a warning?  Should we set up a timeout
                   1153:                 * to try again in a second or so?  The latter could break
                   1154:                 * a caller's assumptions about interrupt protection, etc.
                   1155:                 */
                   1156:        }
1.21      thorpej  1157:
                   1158:        simple_unlock(&pp->pr_slock);
1.3       pk       1159: }
                   1160:
                   1161: void
                   1162: pool_sethiwat(pp, n)
                   1163:        pool_handle_t   pp;
                   1164:        int n;
                   1165: {
1.15      pk       1166:
1.21      thorpej  1167:        simple_lock(&pp->pr_slock);
                   1168:
1.15      pk       1169:        pp->pr_maxpages = (n == 0)
                   1170:                ? 0
1.18      thorpej  1171:                : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.21      thorpej  1172:
                   1173:        simple_unlock(&pp->pr_slock);
1.3       pk       1174: }
                   1175:
1.20      thorpej  1176: void
                   1177: pool_sethardlimit(pp, n, warnmess, ratecap)
                   1178:        pool_handle_t pp;
                   1179:        int n;
                   1180:        const char *warnmess;
                   1181:        int ratecap;
                   1182: {
                   1183:
1.21      thorpej  1184:        simple_lock(&pp->pr_slock);
1.20      thorpej  1185:
                   1186:        pp->pr_hardlimit = n;
                   1187:        pp->pr_hardlimit_warning = warnmess;
1.31      thorpej  1188:        pp->pr_hardlimit_ratecap.tv_sec = ratecap;
                   1189:        pp->pr_hardlimit_warning_last.tv_sec = 0;
                   1190:        pp->pr_hardlimit_warning_last.tv_usec = 0;
1.20      thorpej  1191:
                   1192:        /*
1.21      thorpej  1193:         * In-line version of pool_sethiwat(), because we don't want to
                   1194:         * release the lock.
1.20      thorpej  1195:         */
                   1196:        pp->pr_maxpages = (n == 0)
                   1197:                ? 0
                   1198:                : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.21      thorpej  1199:
                   1200:        simple_unlock(&pp->pr_slock);
1.20      thorpej  1201: }
1.3       pk       1202:
                   1203: /*
                   1204:  * Default page allocator.
                   1205:  */
                   1206: static void *
                   1207: pool_page_alloc(sz, flags, mtype)
                   1208:        unsigned long sz;
                   1209:        int flags;
                   1210:        int mtype;
                   1211: {
1.11      thorpej  1212:        boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;
1.3       pk       1213:
1.11      thorpej  1214:        return ((void *)uvm_km_alloc_poolpage(waitok));
1.3       pk       1215: }
                   1216:
                   1217: static void
                   1218: pool_page_free(v, sz, mtype)
                   1219:        void *v;
                   1220:        unsigned long sz;
                   1221:        int mtype;
                   1222: {
                   1223:
1.10      eeh      1224:        uvm_km_free_poolpage((vaddr_t)v);
1.3       pk       1225: }
1.12      thorpej  1226:
                   1227: /*
                   1228:  * Alternate pool page allocator for pools that know they will
                   1229:  * never be accessed in interrupt context.
                   1230:  */
                   1231: void *
                   1232: pool_page_alloc_nointr(sz, flags, mtype)
                   1233:        unsigned long sz;
                   1234:        int flags;
                   1235:        int mtype;
                   1236: {
                   1237:        boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;
                   1238:
                   1239:        return ((void *)uvm_km_alloc_poolpage1(kernel_map, uvm.kernel_object,
                   1240:            waitok));
                   1241: }
                   1242:
                   1243: void
                   1244: pool_page_free_nointr(v, sz, mtype)
                   1245:        void *v;
                   1246:        unsigned long sz;
                   1247:        int mtype;
                   1248: {
                   1249:
                   1250:        uvm_km_free_poolpage1(kernel_map, (vaddr_t)v);
                   1251: }
                   1252:
1.3       pk       1253:
                   1254: /*
                   1255:  * Release all complete pages that have not been used recently.
                   1256:  */
                   1257: void
1.25      thorpej  1258: _pool_reclaim(pp, file, line)
1.3       pk       1259:        pool_handle_t pp;
1.25      thorpej  1260:        const char *file;
                   1261:        long line;
1.3       pk       1262: {
                   1263:        struct pool_item_header *ph, *phnext;
1.21      thorpej  1264:        struct timeval curtime;
                   1265:        int s;
1.3       pk       1266:
1.20      thorpej  1267:        if (pp->pr_roflags & PR_STATIC)
1.3       pk       1268:                return;
                   1269:
1.21      thorpej  1270:        if (simple_lock_try(&pp->pr_slock) == 0)
1.3       pk       1271:                return;
1.25      thorpej  1272:        pr_enter(pp, file, line);
1.3       pk       1273:
1.21      thorpej  1274:        s = splclock();
                   1275:        curtime = mono_time;
                   1276:        splx(s);
                   1277:
1.3       pk       1278:        for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; ph = phnext) {
                   1279:                phnext = TAILQ_NEXT(ph, ph_pagelist);
                   1280:
                   1281:                /* Check our minimum page claim */
                   1282:                if (pp->pr_npages <= pp->pr_minpages)
                   1283:                        break;
                   1284:
                   1285:                if (ph->ph_nmissing == 0) {
                   1286:                        struct timeval diff;
                   1287:                        timersub(&curtime, &ph->ph_time, &diff);
                   1288:                        if (diff.tv_sec < pool_inactive_time)
                   1289:                                continue;
1.21      thorpej  1290:
                   1291:                        /*
                   1292:                         * If freeing this page would put us below
                   1293:                         * the low water mark, stop now.
                   1294:                         */
                   1295:                        if ((pp->pr_nitems - pp->pr_itemsperpage) <
                   1296:                            pp->pr_minitems)
                   1297:                                break;
                   1298:
1.3       pk       1299:                        pr_rmpage(pp, ph);
                   1300:                }
                   1301:        }
                   1302:
1.25      thorpej  1303:        pr_leave(pp);
1.21      thorpej  1304:        simple_unlock(&pp->pr_slock);
1.3       pk       1305: }
                   1306:
                   1307:
                   1308: /*
                   1309:  * Drain pools, one at a time.
1.21      thorpej  1310:  *
                   1311:  * Note, we must never be called from an interrupt context.
1.3       pk       1312:  */
                   1313: void
                   1314: pool_drain(arg)
                   1315:        void *arg;
                   1316: {
                   1317:        struct pool *pp;
1.23      thorpej  1318:        int s;
1.3       pk       1319:
1.23      thorpej  1320:        s = splimp();
                   1321:        simple_lock(&pool_head_slock);
                   1322:
                   1323:        if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL)
                   1324:                goto out;
1.3       pk       1325:
                   1326:        pp = drainpp;
                   1327:        drainpp = TAILQ_NEXT(pp, pr_poollist);
                   1328:
                   1329:        pool_reclaim(pp);
1.23      thorpej  1330:
                   1331:  out:
                   1332:        simple_unlock(&pool_head_slock);
1.3       pk       1333:        splx(s);
                   1334: }
                   1335:
                   1336:
                   1337: /*
                   1338:  * Diagnostic helpers.
                   1339:  */
                   1340: void
1.25      thorpej  1341: pool_print(pp, modif)
1.3       pk       1342:        struct pool *pp;
1.25      thorpej  1343:        const char *modif;
1.21      thorpej  1344: {
                   1345:        int s;
                   1346:
                   1347:        s = splimp();
1.25      thorpej  1348:        if (simple_lock_try(&pp->pr_slock) == 0) {
                   1349:                printf("pool %s is locked; try again later\n",
                   1350:                    pp->pr_wchan);
                   1351:                splx(s);
                   1352:                return;
                   1353:        }
                   1354:        pool_print1(pp, modif, printf);
1.21      thorpej  1355:        simple_unlock(&pp->pr_slock);
                   1356:        splx(s);
                   1357: }
                   1358:
1.25      thorpej  1359: void
                   1360: pool_printit(pp, modif, pr)
                   1361:        struct pool *pp;
                   1362:        const char *modif;
                   1363:        void (*pr) __P((const char *, ...));
                   1364: {
                   1365:        int didlock = 0;
                   1366:
                   1367:        if (pp == NULL) {
                   1368:                (*pr)("Must specify a pool to print.\n");
                   1369:                return;
                   1370:        }
                   1371:
                   1372:        /*
                   1373:         * Called from DDB; interrupts should be blocked, and all
                   1374:         * other processors should be paused.  We can skip locking
                   1375:         * the pool in this case.
                   1376:         *
                   1377:         * We do a simple_lock_try() just to print the lock
                   1378:         * status, however.
                   1379:         */
                   1380:
                   1381:        if (simple_lock_try(&pp->pr_slock) == 0)
                   1382:                (*pr)("WARNING: pool %s is locked\n", pp->pr_wchan);
                   1383:        else
                   1384:                didlock = 1;
                   1385:
                   1386:        pool_print1(pp, modif, pr);
                   1387:
                   1388:        if (didlock)
                   1389:                simple_unlock(&pp->pr_slock);
                   1390: }
                   1391:
1.21      thorpej  1392: static void
1.25      thorpej  1393: pool_print1(pp, modif, pr)
1.21      thorpej  1394:        struct pool *pp;
1.25      thorpej  1395:        const char *modif;
                   1396:        void (*pr) __P((const char *, ...));
1.3       pk       1397: {
1.25      thorpej  1398:        struct pool_item_header *ph;
                   1399: #ifdef DIAGNOSTIC
                   1400:        struct pool_item *pi;
                   1401: #endif
                   1402:        int print_log = 0, print_pagelist = 0;
                   1403:        char c;
                   1404:
                   1405:        while ((c = *modif++) != '\0') {
                   1406:                if (c == 'l')
                   1407:                        print_log = 1;
                   1408:                if (c == 'p')
                   1409:                        print_pagelist = 1;
                   1410:                modif++;
                   1411:        }
                   1412:
                   1413:        (*pr)("POOL %s: size %u, align %u, ioff %u, roflags 0x%08x\n",
                   1414:            pp->pr_wchan, pp->pr_size, pp->pr_align, pp->pr_itemoffset,
                   1415:            pp->pr_roflags);
                   1416:        (*pr)("\tpagesz %u, mtype %d\n", pp->pr_pagesz, pp->pr_mtype);
                   1417:        (*pr)("\talloc %p, release %p\n", pp->pr_alloc, pp->pr_free);
                   1418:        (*pr)("\tminitems %u, minpages %u, maxpages %u, npages %u\n",
                   1419:            pp->pr_minitems, pp->pr_minpages, pp->pr_maxpages, pp->pr_npages);
                   1420:        (*pr)("\titemsperpage %u, nitems %u, nout %u, hardlimit %u\n",
                   1421:            pp->pr_itemsperpage, pp->pr_nitems, pp->pr_nout, pp->pr_hardlimit);
                   1422:
                   1423:        (*pr)("\n\tnget %lu, nfail %lu, nput %lu\n",
                   1424:            pp->pr_nget, pp->pr_nfail, pp->pr_nput);
                   1425:        (*pr)("\tnpagealloc %lu, npagefree %lu, hiwat %u, nidle %lu\n",
                   1426:            pp->pr_npagealloc, pp->pr_npagefree, pp->pr_hiwat, pp->pr_nidle);
                   1427:
                   1428:        if (print_pagelist == 0)
                   1429:                goto skip_pagelist;
                   1430:
                   1431:        if ((ph = TAILQ_FIRST(&pp->pr_pagelist)) != NULL)
                   1432:                (*pr)("\n\tpage list:\n");
                   1433:        for (; ph != NULL; ph = TAILQ_NEXT(ph, ph_pagelist)) {
                   1434:                (*pr)("\t\tpage %p, nmissing %d, time %lu,%lu\n",
                   1435:                    ph->ph_page, ph->ph_nmissing,
                   1436:                    (u_long)ph->ph_time.tv_sec,
                   1437:                    (u_long)ph->ph_time.tv_usec);
                   1438: #ifdef DIAGNOSTIC
                   1439:                for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL;
                   1440:                     pi = TAILQ_NEXT(pi, pi_list)) {
                   1441:                        if (pi->pi_magic != PI_MAGIC) {
                   1442:                                (*pr)("\t\t\titem %p, magic 0x%x\n",
                   1443:                                    pi, pi->pi_magic);
                   1444:                        }
                   1445:                }
                   1446: #endif
                   1447:        }
                   1448:        if (pp->pr_curpage == NULL)
                   1449:                (*pr)("\tno current page\n");
                   1450:        else
                   1451:                (*pr)("\tcurpage %p\n", pp->pr_curpage->ph_page);
                   1452:
                   1453:  skip_pagelist:
                   1454:
                   1455:        if (print_log == 0)
                   1456:                goto skip_log;
                   1457:
                   1458:        (*pr)("\n");
                   1459:        if ((pp->pr_roflags & PR_LOGGING) == 0)
                   1460:                (*pr)("\tno log\n");
                   1461:        else
                   1462:                pr_printlog(pp, NULL, pr);
1.3       pk       1463:
1.25      thorpej  1464:  skip_log:
1.3       pk       1465:
1.25      thorpej  1466:        pr_enter_check(pp, pr);
1.3       pk       1467: }
                   1468:
                   1469: int
                   1470: pool_chk(pp, label)
                   1471:        struct pool *pp;
                   1472:        char *label;
                   1473: {
                   1474:        struct pool_item_header *ph;
                   1475:        int r = 0;
                   1476:
1.21      thorpej  1477:        simple_lock(&pp->pr_slock);
1.3       pk       1478:
                   1479:        for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
                   1480:             ph = TAILQ_NEXT(ph, ph_pagelist)) {
                   1481:
                   1482:                struct pool_item *pi;
                   1483:                int n;
                   1484:                caddr_t page;
                   1485:
                   1486:                page = (caddr_t)((u_long)ph & pp->pr_pagemask);
1.20      thorpej  1487:                if (page != ph->ph_page &&
                   1488:                    (pp->pr_roflags & PR_PHINPAGE) != 0) {
1.3       pk       1489:                        if (label != NULL)
                   1490:                                printf("%s: ", label);
1.16      briggs   1491:                        printf("pool(%p:%s): page inconsistency: page %p;"
                   1492:                               " at page head addr %p (p %p)\n", pp,
1.3       pk       1493:                                pp->pr_wchan, ph->ph_page,
                   1494:                                ph, page);
                   1495:                        r++;
                   1496:                        goto out;
                   1497:                }
                   1498:
                   1499:                for (pi = TAILQ_FIRST(&ph->ph_itemlist), n = 0;
                   1500:                     pi != NULL;
                   1501:                     pi = TAILQ_NEXT(pi,pi_list), n++) {
                   1502:
                   1503: #ifdef DIAGNOSTIC
                   1504:                        if (pi->pi_magic != PI_MAGIC) {
                   1505:                                if (label != NULL)
                   1506:                                        printf("%s: ", label);
                   1507:                                printf("pool(%s): free list modified: magic=%x;"
                   1508:                                       " page %p; item ordinal %d;"
                   1509:                                       " addr %p (p %p)\n",
                   1510:                                        pp->pr_wchan, pi->pi_magic, ph->ph_page,
                   1511:                                        n, pi, page);
                   1512:                                panic("pool");
                   1513:                        }
                   1514: #endif
                   1515:                        page = (caddr_t)((u_long)pi & pp->pr_pagemask);
                   1516:                        if (page == ph->ph_page)
                   1517:                                continue;
                   1518:
                   1519:                        if (label != NULL)
                   1520:                                printf("%s: ", label);
1.16      briggs   1521:                        printf("pool(%p:%s): page inconsistency: page %p;"
                   1522:                               " item ordinal %d; addr %p (p %p)\n", pp,
1.3       pk       1523:                                pp->pr_wchan, ph->ph_page,
                   1524:                                n, pi, page);
                   1525:                        r++;
                   1526:                        goto out;
                   1527:                }
                   1528:        }
                   1529: out:
1.21      thorpej  1530:        simple_unlock(&pp->pr_slock);
1.3       pk       1531:        return (r);
                   1532: }

CVSweb <webmaster@jp.NetBSD.org>