Annotation of src/sys/kern/subr_pool.c, Revision 1.35
1.35 ! pk 1: /* $NetBSD: subr_pool.c,v 1.34 2000/05/08 20:09:44 thorpej 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:
1.34 thorpej 218: if (__predict_false(pp->pr_entered_file != NULL)) {
1.25 thorpej 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:
1.34 thorpej 235: if (__predict_false(pp->pr_entered_file == NULL)) {
1.25 thorpej 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:
1.35 ! pk 428: size = ALIGN(size);
! 429: if (size >= pagesz)
! 430: panic("pool_init: pool item size (%lu) too large",
! 431: (u_long)size);
! 432:
1.3 pk 433: /*
434: * Initialize the pool structure.
435: */
436: TAILQ_INIT(&pp->pr_pagelist);
437: pp->pr_curpage = NULL;
438: pp->pr_npages = 0;
439: pp->pr_minitems = 0;
440: pp->pr_minpages = 0;
441: pp->pr_maxpages = UINT_MAX;
1.20 thorpej 442: pp->pr_roflags = flags;
443: pp->pr_flags = 0;
1.35 ! pk 444: pp->pr_size = size;
1.3 pk 445: pp->pr_align = align;
446: pp->pr_wchan = wchan;
447: pp->pr_mtype = mtype;
448: pp->pr_alloc = alloc;
449: pp->pr_free = release;
450: pp->pr_pagesz = pagesz;
451: pp->pr_pagemask = ~(pagesz - 1);
452: pp->pr_pageshift = ffs(pagesz) - 1;
1.20 thorpej 453: pp->pr_nitems = 0;
454: pp->pr_nout = 0;
455: pp->pr_hardlimit = UINT_MAX;
456: pp->pr_hardlimit_warning = NULL;
1.31 thorpej 457: pp->pr_hardlimit_ratecap.tv_sec = 0;
458: pp->pr_hardlimit_ratecap.tv_usec = 0;
459: pp->pr_hardlimit_warning_last.tv_sec = 0;
460: pp->pr_hardlimit_warning_last.tv_usec = 0;
1.3 pk 461:
462: /*
463: * Decide whether to put the page header off page to avoid
464: * wasting too large a part of the page. Off-page page headers
465: * go on a hash table, so we can match a returned item
466: * with its header based on the page address.
467: * We use 1/16 of the page size as the threshold (XXX: tune)
468: */
469: if (pp->pr_size < pagesz/16) {
470: /* Use the end of the page for the page header */
1.20 thorpej 471: pp->pr_roflags |= PR_PHINPAGE;
1.3 pk 472: pp->pr_phoffset = off =
473: pagesz - ALIGN(sizeof(struct pool_item_header));
1.2 pk 474: } else {
1.3 pk 475: /* The page header will be taken from our page header pool */
476: pp->pr_phoffset = 0;
477: off = pagesz;
1.16 briggs 478: for (i = 0; i < PR_HASHTABSIZE; i++) {
479: LIST_INIT(&pp->pr_hashtab[i]);
480: }
1.2 pk 481: }
1.1 pk 482:
1.3 pk 483: /*
484: * Alignment is to take place at `ioff' within the item. This means
485: * we must reserve up to `align - 1' bytes on the page to allow
486: * appropriate positioning of each item.
487: *
488: * Silently enforce `0 <= ioff < align'.
489: */
490: pp->pr_itemoffset = ioff = ioff % align;
491: pp->pr_itemsperpage = (off - ((align - ioff) % align)) / pp->pr_size;
492:
493: /*
494: * Use the slack between the chunks and the page header
495: * for "cache coloring".
496: */
497: slack = off - pp->pr_itemsperpage * pp->pr_size;
498: pp->pr_maxcolor = (slack / align) * align;
499: pp->pr_curcolor = 0;
500:
501: pp->pr_nget = 0;
502: pp->pr_nfail = 0;
503: pp->pr_nput = 0;
504: pp->pr_npagealloc = 0;
505: pp->pr_npagefree = 0;
1.1 pk 506: pp->pr_hiwat = 0;
1.8 thorpej 507: pp->pr_nidle = 0;
1.3 pk 508:
1.25 thorpej 509: if (flags & PR_LOGGING) {
510: if (kmem_map == NULL ||
511: (pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log),
512: M_TEMP, M_NOWAIT)) == NULL)
1.20 thorpej 513: pp->pr_roflags &= ~PR_LOGGING;
1.3 pk 514: pp->pr_curlogentry = 0;
515: pp->pr_logsize = pool_logsize;
516: }
1.25 thorpej 517:
518: pp->pr_entered_file = NULL;
519: pp->pr_entered_line = 0;
1.3 pk 520:
1.21 thorpej 521: simple_lock_init(&pp->pr_slock);
1.1 pk 522:
1.3 pk 523: /*
524: * Initialize private page header pool if we haven't done so yet.
1.23 thorpej 525: * XXX LOCKING.
1.3 pk 526: */
527: if (phpool.pr_size == 0) {
528: pool_init(&phpool, sizeof(struct pool_item_header), 0, 0,
529: 0, "phpool", 0, 0, 0, 0);
1.1 pk 530: }
531:
1.23 thorpej 532: /* Insert into the list of all pools. */
533: simple_lock(&pool_head_slock);
534: TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist);
535: simple_unlock(&pool_head_slock);
1.1 pk 536: }
537:
538: /*
539: * De-commision a pool resource.
540: */
541: void
542: pool_destroy(pp)
543: struct pool *pp;
544: {
1.3 pk 545: struct pool_item_header *ph;
546:
547: #ifdef DIAGNOSTIC
1.20 thorpej 548: if (pp->pr_nout != 0) {
1.25 thorpej 549: pr_printlog(pp, NULL, printf);
1.20 thorpej 550: panic("pool_destroy: pool busy: still out: %u\n",
551: pp->pr_nout);
1.3 pk 552: }
553: #endif
1.1 pk 554:
1.3 pk 555: /* Remove all pages */
1.20 thorpej 556: if ((pp->pr_roflags & PR_STATIC) == 0)
1.3 pk 557: while ((ph = pp->pr_pagelist.tqh_first) != NULL)
558: pr_rmpage(pp, ph);
559:
560: /* Remove from global pool list */
1.23 thorpej 561: simple_lock(&pool_head_slock);
1.3 pk 562: TAILQ_REMOVE(&pool_head, pp, pr_poollist);
1.23 thorpej 563: /* XXX Only clear this if we were drainpp? */
1.3 pk 564: drainpp = NULL;
1.23 thorpej 565: simple_unlock(&pool_head_slock);
1.3 pk 566:
1.20 thorpej 567: if ((pp->pr_roflags & PR_LOGGING) != 0)
1.3 pk 568: free(pp->pr_log, M_TEMP);
1.2 pk 569:
1.20 thorpej 570: if (pp->pr_roflags & PR_FREEHEADER)
1.3 pk 571: free(pp, M_POOL);
1.1 pk 572: }
573:
574:
575: /*
1.3 pk 576: * Grab an item from the pool; must be called at appropriate spl level
1.1 pk 577: */
1.3 pk 578: void *
579: _pool_get(pp, flags, file, line)
580: struct pool *pp;
581: int flags;
582: const char *file;
583: long line;
1.1 pk 584: {
585: void *v;
586: struct pool_item *pi;
1.3 pk 587: struct pool_item_header *ph;
1.1 pk 588:
1.2 pk 589: #ifdef DIAGNOSTIC
1.34 thorpej 590: if (__predict_false((pp->pr_roflags & PR_STATIC) &&
591: (flags & PR_MALLOCOK))) {
1.25 thorpej 592: pr_printlog(pp, NULL, printf);
1.2 pk 593: panic("pool_get: static");
1.3 pk 594: }
1.2 pk 595: #endif
596:
1.34 thorpej 597: if (__predict_false(curproc == NULL && (flags & PR_WAITOK) != 0))
1.3 pk 598: panic("pool_get: must have NOWAIT");
1.1 pk 599:
1.21 thorpej 600: simple_lock(&pp->pr_slock);
1.25 thorpej 601: pr_enter(pp, file, line);
1.20 thorpej 602:
603: startover:
604: /*
605: * Check to see if we've reached the hard limit. If we have,
606: * and we can wait, then wait until an item has been returned to
607: * the pool.
608: */
609: #ifdef DIAGNOSTIC
1.34 thorpej 610: if (__predict_false(pp->pr_nout > pp->pr_hardlimit)) {
1.25 thorpej 611: pr_leave(pp);
1.21 thorpej 612: simple_unlock(&pp->pr_slock);
1.20 thorpej 613: panic("pool_get: %s: crossed hard limit", pp->pr_wchan);
614: }
615: #endif
1.34 thorpej 616: if (__predict_false(pp->pr_nout == pp->pr_hardlimit)) {
1.29 sommerfe 617: if ((flags & PR_WAITOK) && !(flags & PR_LIMITFAIL)) {
1.20 thorpej 618: /*
619: * XXX: A warning isn't logged in this case. Should
620: * it be?
621: */
622: pp->pr_flags |= PR_WANTED;
1.25 thorpej 623: pr_leave(pp);
1.21 thorpej 624: simple_unlock(&pp->pr_slock);
1.20 thorpej 625: tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);
1.21 thorpej 626: simple_lock(&pp->pr_slock);
1.25 thorpej 627: pr_enter(pp, file, line);
1.20 thorpej 628: goto startover;
629: }
1.31 thorpej 630:
631: /*
632: * Log a message that the hard limit has been hit.
633: */
634: if (pp->pr_hardlimit_warning != NULL &&
635: ratecheck(&pp->pr_hardlimit_warning_last,
636: &pp->pr_hardlimit_ratecap))
637: log(LOG_ERR, "%s\n", pp->pr_hardlimit_warning);
1.21 thorpej 638:
639: if (flags & PR_URGENT)
640: panic("pool_get: urgent");
641:
642: pp->pr_nfail++;
643:
1.25 thorpej 644: pr_leave(pp);
1.21 thorpej 645: simple_unlock(&pp->pr_slock);
1.20 thorpej 646: return (NULL);
647: }
648:
1.3 pk 649: /*
650: * The convention we use is that if `curpage' is not NULL, then
651: * it points at a non-empty bucket. In particular, `curpage'
652: * never points at a page header which has PR_PHINPAGE set and
653: * has no items in its bucket.
654: */
1.20 thorpej 655: if ((ph = pp->pr_curpage) == NULL) {
1.15 pk 656: void *v;
657:
1.20 thorpej 658: #ifdef DIAGNOSTIC
659: if (pp->pr_nitems != 0) {
1.21 thorpej 660: simple_unlock(&pp->pr_slock);
1.20 thorpej 661: printf("pool_get: %s: curpage NULL, nitems %u\n",
662: pp->pr_wchan, pp->pr_nitems);
663: panic("pool_get: nitems inconsistent\n");
664: }
665: #endif
666:
1.21 thorpej 667: /*
668: * Call the back-end page allocator for more memory.
669: * Release the pool lock, as the back-end page allocator
670: * may block.
671: */
1.25 thorpej 672: pr_leave(pp);
1.21 thorpej 673: simple_unlock(&pp->pr_slock);
674: v = (*pp->pr_alloc)(pp->pr_pagesz, flags, pp->pr_mtype);
675: simple_lock(&pp->pr_slock);
1.25 thorpej 676: pr_enter(pp, file, line);
1.15 pk 677:
1.21 thorpej 678: if (v == NULL) {
679: /*
680: * We were unable to allocate a page, but
681: * we released the lock during allocation,
682: * so perhaps items were freed back to the
683: * pool. Check for this case.
684: */
685: if (pp->pr_curpage != NULL)
686: goto startover;
1.15 pk 687:
1.3 pk 688: if (flags & PR_URGENT)
689: panic("pool_get: urgent");
1.21 thorpej 690:
1.3 pk 691: if ((flags & PR_WAITOK) == 0) {
692: pp->pr_nfail++;
1.25 thorpej 693: pr_leave(pp);
1.21 thorpej 694: simple_unlock(&pp->pr_slock);
1.1 pk 695: return (NULL);
1.3 pk 696: }
697:
1.15 pk 698: /*
699: * Wait for items to be returned to this pool.
1.21 thorpej 700: *
1.15 pk 701: * XXX: we actually want to wait just until
702: * the page allocator has memory again. Depending
703: * on this pool's usage, we might get stuck here
704: * for a long time.
1.20 thorpej 705: *
706: * XXX: maybe we should wake up once a second and
707: * try again?
1.15 pk 708: */
1.1 pk 709: pp->pr_flags |= PR_WANTED;
1.25 thorpej 710: pr_leave(pp);
1.21 thorpej 711: simple_unlock(&pp->pr_slock);
1.1 pk 712: tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);
1.21 thorpej 713: simple_lock(&pp->pr_slock);
1.25 thorpej 714: pr_enter(pp, file, line);
1.20 thorpej 715: goto startover;
1.1 pk 716: }
1.3 pk 717:
1.15 pk 718: /* We have more memory; add it to the pool */
719: pp->pr_npagealloc++;
720: pool_prime_page(pp, v);
721:
1.20 thorpej 722: /* Start the allocation process over. */
723: goto startover;
1.3 pk 724: }
725:
1.34 thorpej 726: if (__predict_false((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL)) {
1.25 thorpej 727: pr_leave(pp);
1.21 thorpej 728: simple_unlock(&pp->pr_slock);
1.3 pk 729: panic("pool_get: %s: page empty", pp->pr_wchan);
1.21 thorpej 730: }
1.20 thorpej 731: #ifdef DIAGNOSTIC
1.34 thorpej 732: if (__predict_false(pp->pr_nitems == 0)) {
1.25 thorpej 733: pr_leave(pp);
1.21 thorpej 734: simple_unlock(&pp->pr_slock);
1.20 thorpej 735: printf("pool_get: %s: items on itemlist, nitems %u\n",
736: pp->pr_wchan, pp->pr_nitems);
737: panic("pool_get: nitems inconsistent\n");
738: }
739: #endif
1.3 pk 740: pr_log(pp, v, PRLOG_GET, file, line);
741:
742: #ifdef DIAGNOSTIC
1.34 thorpej 743: if (__predict_false(pi->pi_magic != PI_MAGIC)) {
1.25 thorpej 744: pr_printlog(pp, pi, printf);
1.3 pk 745: panic("pool_get(%s): free list modified: magic=%x; page %p;"
746: " item addr %p\n",
747: pp->pr_wchan, pi->pi_magic, ph->ph_page, pi);
748: }
749: #endif
750:
751: /*
752: * Remove from item list.
753: */
754: TAILQ_REMOVE(&ph->ph_itemlist, pi, pi_list);
1.20 thorpej 755: pp->pr_nitems--;
756: pp->pr_nout++;
1.6 thorpej 757: if (ph->ph_nmissing == 0) {
758: #ifdef DIAGNOSTIC
1.34 thorpej 759: if (__predict_false(pp->pr_nidle == 0))
1.6 thorpej 760: panic("pool_get: nidle inconsistent");
761: #endif
762: pp->pr_nidle--;
763: }
1.3 pk 764: ph->ph_nmissing++;
765: if (TAILQ_FIRST(&ph->ph_itemlist) == NULL) {
1.21 thorpej 766: #ifdef DIAGNOSTIC
1.34 thorpej 767: if (__predict_false(ph->ph_nmissing != pp->pr_itemsperpage)) {
1.25 thorpej 768: pr_leave(pp);
1.21 thorpej 769: simple_unlock(&pp->pr_slock);
770: panic("pool_get: %s: nmissing inconsistent",
771: pp->pr_wchan);
772: }
773: #endif
1.3 pk 774: /*
775: * Find a new non-empty page header, if any.
776: * Start search from the page head, to increase
777: * the chance for "high water" pages to be freed.
778: *
1.21 thorpej 779: * Migrate empty pages to the end of the list. This
780: * will speed the update of curpage as pages become
781: * idle. Empty pages intermingled with idle pages
782: * is no big deal. As soon as a page becomes un-empty,
783: * it will move back to the head of the list.
1.3 pk 784: */
785: TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
1.21 thorpej 786: TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist);
787: for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
788: ph = TAILQ_NEXT(ph, ph_pagelist))
1.3 pk 789: if (TAILQ_FIRST(&ph->ph_itemlist) != NULL)
790: break;
791:
792: pp->pr_curpage = ph;
1.1 pk 793: }
1.3 pk 794:
795: pp->pr_nget++;
1.20 thorpej 796:
797: /*
798: * If we have a low water mark and we are now below that low
799: * water mark, add more items to the pool.
800: */
801: if (pp->pr_nitems < pp->pr_minitems && pool_catchup(pp) != 0) {
802: /*
803: * XXX: Should we log a warning? Should we set up a timeout
804: * to try again in a second or so? The latter could break
805: * a caller's assumptions about interrupt protection, etc.
806: */
807: }
808:
1.25 thorpej 809: pr_leave(pp);
1.21 thorpej 810: simple_unlock(&pp->pr_slock);
1.1 pk 811: return (v);
812: }
813:
814: /*
1.3 pk 815: * Return resource to the pool; must be called at appropriate spl level
1.1 pk 816: */
1.3 pk 817: void
818: _pool_put(pp, v, file, line)
819: struct pool *pp;
820: void *v;
821: const char *file;
822: long line;
1.1 pk 823: {
824: struct pool_item *pi = v;
1.3 pk 825: struct pool_item_header *ph;
826: caddr_t page;
1.21 thorpej 827: int s;
1.3 pk 828:
829: page = (caddr_t)((u_long)v & pp->pr_pagemask);
1.1 pk 830:
1.21 thorpej 831: simple_lock(&pp->pr_slock);
1.25 thorpej 832: pr_enter(pp, file, line);
1.30 thorpej 833:
834: #ifdef DIAGNOSTIC
1.34 thorpej 835: if (__predict_false(pp->pr_nout == 0)) {
1.30 thorpej 836: printf("pool %s: putting with none out\n",
837: pp->pr_wchan);
838: panic("pool_put");
839: }
840: #endif
1.3 pk 841:
842: pr_log(pp, v, PRLOG_PUT, file, line);
843:
1.34 thorpej 844: if (__predict_false((ph = pr_find_pagehead(pp, page)) == NULL)) {
1.25 thorpej 845: pr_printlog(pp, NULL, printf);
1.3 pk 846: panic("pool_put: %s: page header missing", pp->pr_wchan);
847: }
1.28 thorpej 848:
849: #ifdef LOCKDEBUG
850: /*
851: * Check if we're freeing a locked simple lock.
852: */
853: simple_lock_freecheck((caddr_t)pi, ((caddr_t)pi) + pp->pr_size);
854: #endif
1.3 pk 855:
856: /*
857: * Return to item list.
858: */
1.2 pk 859: #ifdef DIAGNOSTIC
1.3 pk 860: pi->pi_magic = PI_MAGIC;
861: #endif
1.32 chs 862: #ifdef DEBUG
863: {
864: int i, *ip = v;
865:
866: for (i = 0; i < pp->pr_size / sizeof(int); i++) {
867: *ip++ = PI_MAGIC;
868: }
869: }
870: #endif
871:
1.3 pk 872: TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list);
873: ph->ph_nmissing--;
874: pp->pr_nput++;
1.20 thorpej 875: pp->pr_nitems++;
876: pp->pr_nout--;
1.3 pk 877:
878: /* Cancel "pool empty" condition if it exists */
879: if (pp->pr_curpage == NULL)
880: pp->pr_curpage = ph;
881:
882: if (pp->pr_flags & PR_WANTED) {
883: pp->pr_flags &= ~PR_WANTED;
1.15 pk 884: if (ph->ph_nmissing == 0)
885: pp->pr_nidle++;
1.25 thorpej 886: pr_leave(pp);
1.21 thorpej 887: simple_unlock(&pp->pr_slock);
1.3 pk 888: wakeup((caddr_t)pp);
889: return;
890: }
891:
892: /*
1.21 thorpej 893: * If this page is now complete, do one of two things:
894: *
895: * (1) If we have more pages than the page high water
896: * mark, free the page back to the system.
897: *
898: * (2) Move it to the end of the page list, so that
899: * we minimize our chances of fragmenting the
900: * pool. Idle pages migrate to the end (along with
901: * completely empty pages, so that we find un-empty
902: * pages more quickly when we update curpage) of the
903: * list so they can be more easily swept up by
904: * the pagedaemon when pages are scarce.
1.3 pk 905: */
906: if (ph->ph_nmissing == 0) {
1.6 thorpej 907: pp->pr_nidle++;
1.3 pk 908: if (pp->pr_npages > pp->pr_maxpages) {
909: pr_rmpage(pp, ph);
910: } else {
911: TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
912: TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist);
913:
1.21 thorpej 914: /*
915: * Update the timestamp on the page. A page must
916: * be idle for some period of time before it can
917: * be reclaimed by the pagedaemon. This minimizes
918: * ping-pong'ing for memory.
919: */
920: s = splclock();
921: ph->ph_time = mono_time;
922: splx(s);
923:
924: /*
925: * Update the current page pointer. Just look for
926: * the first page with any free items.
927: *
928: * XXX: Maybe we want an option to look for the
929: * page with the fewest available items, to minimize
930: * fragmentation?
931: */
1.3 pk 932: for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
933: ph = TAILQ_NEXT(ph, ph_pagelist))
934: if (TAILQ_FIRST(&ph->ph_itemlist) != NULL)
935: break;
1.1 pk 936:
1.3 pk 937: pp->pr_curpage = ph;
1.1 pk 938: }
939: }
1.21 thorpej 940: /*
941: * If the page has just become un-empty, move it to the head of
942: * the list, and make it the current page. The next allocation
943: * will get the item from this page, instead of further fragmenting
944: * the pool.
945: */
946: else if (ph->ph_nmissing == (pp->pr_itemsperpage - 1)) {
947: TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist);
948: TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist);
949: pp->pr_curpage = ph;
950: }
951:
1.25 thorpej 952: pr_leave(pp);
1.21 thorpej 953: simple_unlock(&pp->pr_slock);
1.3 pk 954:
1.1 pk 955: }
956:
957: /*
1.3 pk 958: * Add N items to the pool.
1.1 pk 959: */
960: int
1.2 pk 961: pool_prime(pp, n, storage)
1.1 pk 962: struct pool *pp;
963: int n;
1.2 pk 964: caddr_t storage;
1.1 pk 965: {
1.3 pk 966: caddr_t cp;
967: int newnitems, newpages;
1.2 pk 968:
969: #ifdef DIAGNOSTIC
1.34 thorpej 970: if (__predict_false(storage && !(pp->pr_roflags & PR_STATIC)))
1.2 pk 971: panic("pool_prime: static");
972: /* !storage && static caught below */
973: #endif
1.1 pk 974:
1.21 thorpej 975: simple_lock(&pp->pr_slock);
976:
1.3 pk 977: newnitems = pp->pr_minitems + n;
978: newpages =
1.18 thorpej 979: roundup(newnitems, pp->pr_itemsperpage) / pp->pr_itemsperpage
1.3 pk 980: - pp->pr_minpages;
981:
982: while (newpages-- > 0) {
1.20 thorpej 983: if (pp->pr_roflags & PR_STATIC) {
1.3 pk 984: cp = storage;
985: storage += pp->pr_pagesz;
986: } else {
1.21 thorpej 987: simple_unlock(&pp->pr_slock);
1.3 pk 988: cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype);
1.21 thorpej 989: simple_lock(&pp->pr_slock);
1.3 pk 990: }
1.2 pk 991:
1.3 pk 992: if (cp == NULL) {
1.21 thorpej 993: simple_unlock(&pp->pr_slock);
1.1 pk 994: return (ENOMEM);
995: }
996:
1.26 thorpej 997: pp->pr_npagealloc++;
1.3 pk 998: pool_prime_page(pp, cp);
999: pp->pr_minpages++;
1.1 pk 1000: }
1.3 pk 1001:
1002: pp->pr_minitems = newnitems;
1003:
1004: if (pp->pr_minpages >= pp->pr_maxpages)
1005: pp->pr_maxpages = pp->pr_minpages + 1; /* XXX */
1006:
1.21 thorpej 1007: simple_unlock(&pp->pr_slock);
1.1 pk 1008: return (0);
1009: }
1.3 pk 1010:
1011: /*
1012: * Add a page worth of items to the pool.
1.21 thorpej 1013: *
1014: * Note, we must be called with the pool descriptor LOCKED.
1.3 pk 1015: */
1.21 thorpej 1016: static void
1.3 pk 1017: pool_prime_page(pp, storage)
1018: struct pool *pp;
1019: caddr_t storage;
1020: {
1021: struct pool_item *pi;
1022: struct pool_item_header *ph;
1023: caddr_t cp = storage;
1024: unsigned int align = pp->pr_align;
1025: unsigned int ioff = pp->pr_itemoffset;
1.27 pk 1026: int s, n;
1.3 pk 1027:
1.20 thorpej 1028: if ((pp->pr_roflags & PR_PHINPAGE) != 0) {
1.3 pk 1029: ph = (struct pool_item_header *)(cp + pp->pr_phoffset);
1030: } else {
1.27 pk 1031: s = splhigh();
1.3 pk 1032: ph = pool_get(&phpool, PR_URGENT);
1.27 pk 1033: splx(s);
1.3 pk 1034: LIST_INSERT_HEAD(&pp->pr_hashtab[PR_HASH_INDEX(pp, cp)],
1035: ph, ph_hashlist);
1036: }
1037:
1038: /*
1039: * Insert page header.
1040: */
1041: TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist);
1042: TAILQ_INIT(&ph->ph_itemlist);
1043: ph->ph_page = storage;
1044: ph->ph_nmissing = 0;
1.21 thorpej 1045: memset(&ph->ph_time, 0, sizeof(ph->ph_time));
1.3 pk 1046:
1.6 thorpej 1047: pp->pr_nidle++;
1048:
1.3 pk 1049: /*
1050: * Color this page.
1051: */
1052: cp = (caddr_t)(cp + pp->pr_curcolor);
1053: if ((pp->pr_curcolor += align) > pp->pr_maxcolor)
1054: pp->pr_curcolor = 0;
1055:
1056: /*
1057: * Adjust storage to apply aligment to `pr_itemoffset' in each item.
1058: */
1059: if (ioff != 0)
1060: cp = (caddr_t)(cp + (align - ioff));
1061:
1062: /*
1063: * Insert remaining chunks on the bucket list.
1064: */
1065: n = pp->pr_itemsperpage;
1.20 thorpej 1066: pp->pr_nitems += n;
1.3 pk 1067:
1068: while (n--) {
1069: pi = (struct pool_item *)cp;
1070:
1071: /* Insert on page list */
1072: TAILQ_INSERT_TAIL(&ph->ph_itemlist, pi, pi_list);
1073: #ifdef DIAGNOSTIC
1074: pi->pi_magic = PI_MAGIC;
1075: #endif
1076: cp = (caddr_t)(cp + pp->pr_size);
1077: }
1078:
1079: /*
1080: * If the pool was depleted, point at the new page.
1081: */
1082: if (pp->pr_curpage == NULL)
1083: pp->pr_curpage = ph;
1084:
1085: if (++pp->pr_npages > pp->pr_hiwat)
1086: pp->pr_hiwat = pp->pr_npages;
1087: }
1088:
1.20 thorpej 1089: /*
1090: * Like pool_prime(), except this is used by pool_get() when nitems
1091: * drops below the low water mark. This is used to catch up nitmes
1092: * with the low water mark.
1093: *
1.21 thorpej 1094: * Note 1, we never wait for memory here, we let the caller decide what to do.
1.20 thorpej 1095: *
1096: * Note 2, this doesn't work with static pools.
1097: *
1098: * Note 3, we must be called with the pool already locked, and we return
1099: * with it locked.
1100: */
1101: static int
1102: pool_catchup(pp)
1103: struct pool *pp;
1104: {
1105: caddr_t cp;
1106: int error = 0;
1107:
1108: if (pp->pr_roflags & PR_STATIC) {
1109: /*
1110: * We dropped below the low water mark, and this is not a
1111: * good thing. Log a warning.
1.21 thorpej 1112: *
1113: * XXX: rate-limit this?
1.20 thorpej 1114: */
1115: printf("WARNING: static pool `%s' dropped below low water "
1116: "mark\n", pp->pr_wchan);
1117: return (0);
1118: }
1119:
1.21 thorpej 1120: while (pp->pr_nitems < pp->pr_minitems) {
1.20 thorpej 1121: /*
1.21 thorpej 1122: * Call the page back-end allocator for more memory.
1123: *
1124: * XXX: We never wait, so should we bother unlocking
1125: * the pool descriptor?
1.20 thorpej 1126: */
1.21 thorpej 1127: simple_unlock(&pp->pr_slock);
1.20 thorpej 1128: cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype);
1.21 thorpej 1129: simple_lock(&pp->pr_slock);
1.34 thorpej 1130: if (__predict_false(cp == NULL)) {
1.20 thorpej 1131: error = ENOMEM;
1132: break;
1133: }
1.26 thorpej 1134: pp->pr_npagealloc++;
1.20 thorpej 1135: pool_prime_page(pp, cp);
1136: }
1137:
1138: return (error);
1139: }
1140:
1.3 pk 1141: void
1142: pool_setlowat(pp, n)
1143: pool_handle_t pp;
1144: int n;
1145: {
1.20 thorpej 1146: int error;
1.15 pk 1147:
1.21 thorpej 1148: simple_lock(&pp->pr_slock);
1149:
1.3 pk 1150: pp->pr_minitems = n;
1.15 pk 1151: pp->pr_minpages = (n == 0)
1152: ? 0
1.18 thorpej 1153: : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.20 thorpej 1154:
1155: /* Make sure we're caught up with the newly-set low water mark. */
1.21 thorpej 1156: if ((error = pool_catchup(pp)) != 0) {
1.20 thorpej 1157: /*
1158: * XXX: Should we log a warning? Should we set up a timeout
1159: * to try again in a second or so? The latter could break
1160: * a caller's assumptions about interrupt protection, etc.
1161: */
1162: }
1.21 thorpej 1163:
1164: simple_unlock(&pp->pr_slock);
1.3 pk 1165: }
1166:
1167: void
1168: pool_sethiwat(pp, n)
1169: pool_handle_t pp;
1170: int n;
1171: {
1.15 pk 1172:
1.21 thorpej 1173: simple_lock(&pp->pr_slock);
1174:
1.15 pk 1175: pp->pr_maxpages = (n == 0)
1176: ? 0
1.18 thorpej 1177: : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.21 thorpej 1178:
1179: simple_unlock(&pp->pr_slock);
1.3 pk 1180: }
1181:
1.20 thorpej 1182: void
1183: pool_sethardlimit(pp, n, warnmess, ratecap)
1184: pool_handle_t pp;
1185: int n;
1186: const char *warnmess;
1187: int ratecap;
1188: {
1189:
1.21 thorpej 1190: simple_lock(&pp->pr_slock);
1.20 thorpej 1191:
1192: pp->pr_hardlimit = n;
1193: pp->pr_hardlimit_warning = warnmess;
1.31 thorpej 1194: pp->pr_hardlimit_ratecap.tv_sec = ratecap;
1195: pp->pr_hardlimit_warning_last.tv_sec = 0;
1196: pp->pr_hardlimit_warning_last.tv_usec = 0;
1.20 thorpej 1197:
1198: /*
1.21 thorpej 1199: * In-line version of pool_sethiwat(), because we don't want to
1200: * release the lock.
1.20 thorpej 1201: */
1202: pp->pr_maxpages = (n == 0)
1203: ? 0
1204: : roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
1.21 thorpej 1205:
1206: simple_unlock(&pp->pr_slock);
1.20 thorpej 1207: }
1.3 pk 1208:
1209: /*
1210: * Default page allocator.
1211: */
1212: static void *
1213: pool_page_alloc(sz, flags, mtype)
1214: unsigned long sz;
1215: int flags;
1216: int mtype;
1217: {
1.11 thorpej 1218: boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;
1.3 pk 1219:
1.11 thorpej 1220: return ((void *)uvm_km_alloc_poolpage(waitok));
1.3 pk 1221: }
1222:
1223: static void
1224: pool_page_free(v, sz, mtype)
1225: void *v;
1226: unsigned long sz;
1227: int mtype;
1228: {
1229:
1.10 eeh 1230: uvm_km_free_poolpage((vaddr_t)v);
1.3 pk 1231: }
1.12 thorpej 1232:
1233: /*
1234: * Alternate pool page allocator for pools that know they will
1235: * never be accessed in interrupt context.
1236: */
1237: void *
1238: pool_page_alloc_nointr(sz, flags, mtype)
1239: unsigned long sz;
1240: int flags;
1241: int mtype;
1242: {
1243: boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;
1244:
1245: return ((void *)uvm_km_alloc_poolpage1(kernel_map, uvm.kernel_object,
1246: waitok));
1247: }
1248:
1249: void
1250: pool_page_free_nointr(v, sz, mtype)
1251: void *v;
1252: unsigned long sz;
1253: int mtype;
1254: {
1255:
1256: uvm_km_free_poolpage1(kernel_map, (vaddr_t)v);
1257: }
1258:
1.3 pk 1259:
1260: /*
1261: * Release all complete pages that have not been used recently.
1262: */
1263: void
1.25 thorpej 1264: _pool_reclaim(pp, file, line)
1.3 pk 1265: pool_handle_t pp;
1.25 thorpej 1266: const char *file;
1267: long line;
1.3 pk 1268: {
1269: struct pool_item_header *ph, *phnext;
1.21 thorpej 1270: struct timeval curtime;
1271: int s;
1.3 pk 1272:
1.20 thorpej 1273: if (pp->pr_roflags & PR_STATIC)
1.3 pk 1274: return;
1275:
1.21 thorpej 1276: if (simple_lock_try(&pp->pr_slock) == 0)
1.3 pk 1277: return;
1.25 thorpej 1278: pr_enter(pp, file, line);
1.3 pk 1279:
1.21 thorpej 1280: s = splclock();
1281: curtime = mono_time;
1282: splx(s);
1283:
1.3 pk 1284: for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; ph = phnext) {
1285: phnext = TAILQ_NEXT(ph, ph_pagelist);
1286:
1287: /* Check our minimum page claim */
1288: if (pp->pr_npages <= pp->pr_minpages)
1289: break;
1290:
1291: if (ph->ph_nmissing == 0) {
1292: struct timeval diff;
1293: timersub(&curtime, &ph->ph_time, &diff);
1294: if (diff.tv_sec < pool_inactive_time)
1295: continue;
1.21 thorpej 1296:
1297: /*
1298: * If freeing this page would put us below
1299: * the low water mark, stop now.
1300: */
1301: if ((pp->pr_nitems - pp->pr_itemsperpage) <
1302: pp->pr_minitems)
1303: break;
1304:
1.3 pk 1305: pr_rmpage(pp, ph);
1306: }
1307: }
1308:
1.25 thorpej 1309: pr_leave(pp);
1.21 thorpej 1310: simple_unlock(&pp->pr_slock);
1.3 pk 1311: }
1312:
1313:
1314: /*
1315: * Drain pools, one at a time.
1.21 thorpej 1316: *
1317: * Note, we must never be called from an interrupt context.
1.3 pk 1318: */
1319: void
1320: pool_drain(arg)
1321: void *arg;
1322: {
1323: struct pool *pp;
1.23 thorpej 1324: int s;
1.3 pk 1325:
1.23 thorpej 1326: s = splimp();
1327: simple_lock(&pool_head_slock);
1328:
1329: if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL)
1330: goto out;
1.3 pk 1331:
1332: pp = drainpp;
1333: drainpp = TAILQ_NEXT(pp, pr_poollist);
1334:
1335: pool_reclaim(pp);
1.23 thorpej 1336:
1337: out:
1338: simple_unlock(&pool_head_slock);
1.3 pk 1339: splx(s);
1340: }
1341:
1342:
1343: /*
1344: * Diagnostic helpers.
1345: */
1346: void
1.25 thorpej 1347: pool_print(pp, modif)
1.3 pk 1348: struct pool *pp;
1.25 thorpej 1349: const char *modif;
1.21 thorpej 1350: {
1351: int s;
1352:
1353: s = splimp();
1.25 thorpej 1354: if (simple_lock_try(&pp->pr_slock) == 0) {
1355: printf("pool %s is locked; try again later\n",
1356: pp->pr_wchan);
1357: splx(s);
1358: return;
1359: }
1360: pool_print1(pp, modif, printf);
1.21 thorpej 1361: simple_unlock(&pp->pr_slock);
1362: splx(s);
1363: }
1364:
1.25 thorpej 1365: void
1366: pool_printit(pp, modif, pr)
1367: struct pool *pp;
1368: const char *modif;
1369: void (*pr) __P((const char *, ...));
1370: {
1371: int didlock = 0;
1372:
1373: if (pp == NULL) {
1374: (*pr)("Must specify a pool to print.\n");
1375: return;
1376: }
1377:
1378: /*
1379: * Called from DDB; interrupts should be blocked, and all
1380: * other processors should be paused. We can skip locking
1381: * the pool in this case.
1382: *
1383: * We do a simple_lock_try() just to print the lock
1384: * status, however.
1385: */
1386:
1387: if (simple_lock_try(&pp->pr_slock) == 0)
1388: (*pr)("WARNING: pool %s is locked\n", pp->pr_wchan);
1389: else
1390: didlock = 1;
1391:
1392: pool_print1(pp, modif, pr);
1393:
1394: if (didlock)
1395: simple_unlock(&pp->pr_slock);
1396: }
1397:
1.21 thorpej 1398: static void
1.25 thorpej 1399: pool_print1(pp, modif, pr)
1.21 thorpej 1400: struct pool *pp;
1.25 thorpej 1401: const char *modif;
1402: void (*pr) __P((const char *, ...));
1.3 pk 1403: {
1.25 thorpej 1404: struct pool_item_header *ph;
1405: #ifdef DIAGNOSTIC
1406: struct pool_item *pi;
1407: #endif
1408: int print_log = 0, print_pagelist = 0;
1409: char c;
1410:
1411: while ((c = *modif++) != '\0') {
1412: if (c == 'l')
1413: print_log = 1;
1414: if (c == 'p')
1415: print_pagelist = 1;
1416: modif++;
1417: }
1418:
1419: (*pr)("POOL %s: size %u, align %u, ioff %u, roflags 0x%08x\n",
1420: pp->pr_wchan, pp->pr_size, pp->pr_align, pp->pr_itemoffset,
1421: pp->pr_roflags);
1422: (*pr)("\tpagesz %u, mtype %d\n", pp->pr_pagesz, pp->pr_mtype);
1423: (*pr)("\talloc %p, release %p\n", pp->pr_alloc, pp->pr_free);
1424: (*pr)("\tminitems %u, minpages %u, maxpages %u, npages %u\n",
1425: pp->pr_minitems, pp->pr_minpages, pp->pr_maxpages, pp->pr_npages);
1426: (*pr)("\titemsperpage %u, nitems %u, nout %u, hardlimit %u\n",
1427: pp->pr_itemsperpage, pp->pr_nitems, pp->pr_nout, pp->pr_hardlimit);
1428:
1429: (*pr)("\n\tnget %lu, nfail %lu, nput %lu\n",
1430: pp->pr_nget, pp->pr_nfail, pp->pr_nput);
1431: (*pr)("\tnpagealloc %lu, npagefree %lu, hiwat %u, nidle %lu\n",
1432: pp->pr_npagealloc, pp->pr_npagefree, pp->pr_hiwat, pp->pr_nidle);
1433:
1434: if (print_pagelist == 0)
1435: goto skip_pagelist;
1436:
1437: if ((ph = TAILQ_FIRST(&pp->pr_pagelist)) != NULL)
1438: (*pr)("\n\tpage list:\n");
1439: for (; ph != NULL; ph = TAILQ_NEXT(ph, ph_pagelist)) {
1440: (*pr)("\t\tpage %p, nmissing %d, time %lu,%lu\n",
1441: ph->ph_page, ph->ph_nmissing,
1442: (u_long)ph->ph_time.tv_sec,
1443: (u_long)ph->ph_time.tv_usec);
1444: #ifdef DIAGNOSTIC
1445: for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL;
1446: pi = TAILQ_NEXT(pi, pi_list)) {
1447: if (pi->pi_magic != PI_MAGIC) {
1448: (*pr)("\t\t\titem %p, magic 0x%x\n",
1449: pi, pi->pi_magic);
1450: }
1451: }
1452: #endif
1453: }
1454: if (pp->pr_curpage == NULL)
1455: (*pr)("\tno current page\n");
1456: else
1457: (*pr)("\tcurpage %p\n", pp->pr_curpage->ph_page);
1458:
1459: skip_pagelist:
1460:
1461: if (print_log == 0)
1462: goto skip_log;
1463:
1464: (*pr)("\n");
1465: if ((pp->pr_roflags & PR_LOGGING) == 0)
1466: (*pr)("\tno log\n");
1467: else
1468: pr_printlog(pp, NULL, pr);
1.3 pk 1469:
1.25 thorpej 1470: skip_log:
1.3 pk 1471:
1.25 thorpej 1472: pr_enter_check(pp, pr);
1.3 pk 1473: }
1474:
1475: int
1476: pool_chk(pp, label)
1477: struct pool *pp;
1478: char *label;
1479: {
1480: struct pool_item_header *ph;
1481: int r = 0;
1482:
1.21 thorpej 1483: simple_lock(&pp->pr_slock);
1.3 pk 1484:
1485: for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL;
1486: ph = TAILQ_NEXT(ph, ph_pagelist)) {
1487:
1488: struct pool_item *pi;
1489: int n;
1490: caddr_t page;
1491:
1492: page = (caddr_t)((u_long)ph & pp->pr_pagemask);
1.20 thorpej 1493: if (page != ph->ph_page &&
1494: (pp->pr_roflags & PR_PHINPAGE) != 0) {
1.3 pk 1495: if (label != NULL)
1496: printf("%s: ", label);
1.16 briggs 1497: printf("pool(%p:%s): page inconsistency: page %p;"
1498: " at page head addr %p (p %p)\n", pp,
1.3 pk 1499: pp->pr_wchan, ph->ph_page,
1500: ph, page);
1501: r++;
1502: goto out;
1503: }
1504:
1505: for (pi = TAILQ_FIRST(&ph->ph_itemlist), n = 0;
1506: pi != NULL;
1507: pi = TAILQ_NEXT(pi,pi_list), n++) {
1508:
1509: #ifdef DIAGNOSTIC
1510: if (pi->pi_magic != PI_MAGIC) {
1511: if (label != NULL)
1512: printf("%s: ", label);
1513: printf("pool(%s): free list modified: magic=%x;"
1514: " page %p; item ordinal %d;"
1515: " addr %p (p %p)\n",
1516: pp->pr_wchan, pi->pi_magic, ph->ph_page,
1517: n, pi, page);
1518: panic("pool");
1519: }
1520: #endif
1521: page = (caddr_t)((u_long)pi & pp->pr_pagemask);
1522: if (page == ph->ph_page)
1523: continue;
1524:
1525: if (label != NULL)
1526: printf("%s: ", label);
1.16 briggs 1527: printf("pool(%p:%s): page inconsistency: page %p;"
1528: " item ordinal %d; addr %p (p %p)\n", pp,
1.3 pk 1529: pp->pr_wchan, ph->ph_page,
1530: n, pi, page);
1531: r++;
1532: goto out;
1533: }
1534: }
1535: out:
1.21 thorpej 1536: simple_unlock(&pp->pr_slock);
1.3 pk 1537: return (r);
1538: }
CVSweb <webmaster@jp.NetBSD.org>
![[BACK]](/icons/back.gif){kind=icon}
Return to subr_pool.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [cvs.NetBSD.org] / src / sys / kern