version 1.21, 1999/03/31 23:23:48 |
version 1.25, 1999/05/10 21:13:05 |
|
|
* POSSIBILITY OF SUCH DAMAGE. |
* POSSIBILITY OF SUCH DAMAGE. |
*/ |
*/ |
|
|
|
#include "opt_pool.h" |
|
#include "opt_poollog.h" |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
#include <sys/systm.h> |
#include <sys/systm.h> |
#include <sys/proc.h> |
#include <sys/proc.h> |
Line 73 static struct pool phpool; |
|
Line 76 static struct pool phpool; |
|
int pool_inactive_time = 10; |
int pool_inactive_time = 10; |
|
|
/* Next candidate for drainage (see pool_drain()) */ |
/* Next candidate for drainage (see pool_drain()) */ |
static struct pool *drainpp = NULL; |
static struct pool *drainpp; |
|
|
|
/* This spin lock protects both pool_head and drainpp. */ |
|
struct simplelock pool_head_slock = SIMPLELOCK_INITIALIZER; |
|
|
struct pool_item_header { |
struct pool_item_header { |
/* Page headers */ |
/* Page headers */ |
Line 90 struct pool_item_header { |
|
Line 96 struct pool_item_header { |
|
struct pool_item { |
struct pool_item { |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
int pi_magic; |
int pi_magic; |
#define PI_MAGIC 0xdeadbeef |
#define PI_MAGIC 0xdeadbeef |
#endif |
#endif |
/* Other entries use only this list entry */ |
/* Other entries use only this list entry */ |
TAILQ_ENTRY(pool_item) pi_list; |
TAILQ_ENTRY(pool_item) pi_list; |
}; |
}; |
|
|
|
|
#define PR_HASH_INDEX(pp,addr) \ |
#define PR_HASH_INDEX(pp,addr) \ |
(((u_long)(addr) >> (pp)->pr_pageshift) & (PR_HASHTABSIZE - 1)) |
(((u_long)(addr) >> (pp)->pr_pageshift) & (PR_HASHTABSIZE - 1)) |
|
|
|
|
Line 110 static void pool_prime_page __P((struct |
|
Line 116 static void pool_prime_page __P((struct |
|
static void *pool_page_alloc __P((unsigned long, int, int)); |
static void *pool_page_alloc __P((unsigned long, int, int)); |
static void pool_page_free __P((void *, unsigned long, int)); |
static void pool_page_free __P((void *, unsigned long, int)); |
|
|
#if defined(POOL_DIAGNOSTIC) || defined(DEBUG) |
static void pool_print1 __P((struct pool *, const char *, |
static void pool_print1 __P((struct pool *, const char *)); |
void (*)(const char *, ...))); |
#endif |
|
|
|
#ifdef POOL_DIAGNOSTIC |
|
/* |
/* |
* Pool log entry. An array of these is allocated in pool_create(). |
* Pool log entry. An array of these is allocated in pool_create(). |
*/ |
*/ |
Line 122 struct pool_log { |
|
Line 126 struct pool_log { |
|
const char *pl_file; |
const char *pl_file; |
long pl_line; |
long pl_line; |
int pl_action; |
int pl_action; |
#define PRLOG_GET 1 |
#define PRLOG_GET 1 |
#define PRLOG_PUT 2 |
#define PRLOG_PUT 2 |
void *pl_addr; |
void *pl_addr; |
}; |
}; |
|
|
Line 134 struct pool_log { |
|
Line 138 struct pool_log { |
|
|
|
int pool_logsize = POOL_LOGSIZE; |
int pool_logsize = POOL_LOGSIZE; |
|
|
|
#ifdef DIAGNOSTIC |
static void pr_log __P((struct pool *, void *, int, const char *, long)); |
static void pr_log __P((struct pool *, void *, int, const char *, long)); |
static void pr_printlog __P((struct pool *)); |
static void pr_printlog __P((struct pool *, struct pool_item *, |
|
void (*)(const char *, ...))); |
|
static void pr_enter __P((struct pool *, const char *, long)); |
|
static void pr_leave __P((struct pool *)); |
|
static void pr_enter_check __P((struct pool *, |
|
void (*)(const char *, ...))); |
|
|
static __inline__ void |
static __inline__ void |
pr_log(pp, v, action, file, line) |
pr_log(pp, v, action, file, line) |
Line 166 pr_log(pp, v, action, file, line) |
|
Line 176 pr_log(pp, v, action, file, line) |
|
} |
} |
|
|
static void |
static void |
pr_printlog(pp) |
pr_printlog(pp, pi, pr) |
struct pool *pp; |
struct pool *pp; |
|
struct pool_item *pi; |
|
void (*pr) __P((const char *, ...)); |
{ |
{ |
int i = pp->pr_logsize; |
int i = pp->pr_logsize; |
int n = pp->pr_curlogentry; |
int n = pp->pr_curlogentry; |
|
|
if ((pp->pr_roflags & PR_LOGGING) == 0) |
if ((pp->pr_roflags & PR_LOGGING) == 0) |
return; |
return; |
|
|
pool_print1(pp, "printlog"); |
|
|
|
/* |
/* |
* Print all entries in this pool's log. |
* Print all entries in this pool's log. |
*/ |
*/ |
while (i-- > 0) { |
while (i-- > 0) { |
struct pool_log *pl = &pp->pr_log[n]; |
struct pool_log *pl = &pp->pr_log[n]; |
if (pl->pl_action != 0) { |
if (pl->pl_action != 0) { |
printf("log entry %d:\n", i); |
if (pi == NULL || pi == pl->pl_addr) { |
printf("\taction = %s, addr = %p\n", |
(*pr)("\tlog entry %d:\n", i); |
pl->pl_action == PRLOG_GET ? "get" : "put", |
(*pr)("\t\taction = %s, addr = %p\n", |
pl->pl_addr); |
pl->pl_action == PRLOG_GET ? "get" : "put", |
printf("\tfile: %s at line %lu\n", |
pl->pl_addr); |
pl->pl_file, pl->pl_line); |
(*pr)("\t\tfile: %s at line %lu\n", |
|
pl->pl_file, pl->pl_line); |
|
} |
} |
} |
if (++n >= pp->pr_logsize) |
if (++n >= pp->pr_logsize) |
n = 0; |
n = 0; |
} |
} |
} |
} |
#else |
|
#define pr_log(pp, v, action, file, line) |
|
#define pr_printlog(pp) |
|
#endif |
|
|
|
|
static __inline__ void |
|
pr_enter(pp, file, line) |
|
struct pool *pp; |
|
const char *file; |
|
long line; |
|
{ |
|
|
|
if (pp->pr_entered_file != NULL) { |
|
printf("pool %s: reentrancy at file %s line %ld\n", |
|
pp->pr_wchan, file, line); |
|
printf(" previous entry at file %s line %ld\n", |
|
pp->pr_entered_file, pp->pr_entered_line); |
|
panic("pr_enter"); |
|
} |
|
|
|
pp->pr_entered_file = file; |
|
pp->pr_entered_line = line; |
|
} |
|
|
|
static __inline__ void |
|
pr_leave(pp) |
|
struct pool *pp; |
|
{ |
|
|
|
if (pp->pr_entered_file == NULL) { |
|
printf("pool %s not entered?\n", pp->pr_wchan); |
|
panic("pr_leave"); |
|
} |
|
|
|
pp->pr_entered_file = NULL; |
|
pp->pr_entered_line = 0; |
|
} |
|
|
|
static __inline__ void |
|
pr_enter_check(pp, pr) |
|
struct pool *pp; |
|
void (*pr) __P((const char *, ...)); |
|
{ |
|
|
|
if (pp->pr_entered_file != NULL) |
|
(*pr)("\n\tcurrently entered from file %s line %ld\n", |
|
pp->pr_entered_file, pp->pr_entered_line); |
|
} |
|
#else |
|
#define pr_log(pp, v, action, file, line) |
|
#define pr_printlog(pp, pi, pr) |
|
#define pr_enter(pp, file, line) |
|
#define pr_leave(pp) |
|
#define pr_enter_check(pp, pr) |
|
#endif /* DIAGNOSTIC */ |
|
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on page address. |
Line 254 pr_rmpage(pp, ph) |
|
Line 312 pr_rmpage(pp, ph) |
|
pp->pr_npages--; |
pp->pr_npages--; |
pp->pr_npagefree++; |
pp->pr_npagefree++; |
|
|
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
LIST_REMOVE(ph, ph_hashlist); |
|
pool_put(&phpool, ph); |
|
} |
|
|
if (pp->pr_curpage == ph) { |
if (pp->pr_curpage == ph) { |
/* |
/* |
* Find a new non-empty page header, if any. |
* Find a new non-empty page header, if any. |
Line 267 pr_rmpage(pp, ph) |
|
Line 330 pr_rmpage(pp, ph) |
|
|
|
pp->pr_curpage = ph; |
pp->pr_curpage = ph; |
} |
} |
|
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
LIST_REMOVE(ph, ph_hashlist); |
|
pool_put(&phpool, ph); |
|
} |
|
} |
} |
|
|
/* |
/* |
Line 297 pool_create(size, align, ioff, nitems, w |
|
Line 355 pool_create(size, align, ioff, nitems, w |
|
return (NULL); |
return (NULL); |
|
|
flags = PR_FREEHEADER; |
flags = PR_FREEHEADER; |
#ifdef POOL_DIAGNOSTIC |
|
if (pool_logsize != 0) |
|
flags |= PR_LOGGING; |
|
#endif |
|
|
|
pool_init(pp, size, align, ioff, flags, wchan, pagesz, |
pool_init(pp, size, align, ioff, flags, wchan, pagesz, |
alloc, release, mtype); |
alloc, release, mtype); |
|
|
Line 336 pool_init(pp, size, align, ioff, flags, |
|
Line 389 pool_init(pp, size, align, ioff, flags, |
|
{ |
{ |
int off, slack, i; |
int off, slack, i; |
|
|
|
#ifdef POOL_DIAGNOSTIC |
|
/* |
|
* Always log if POOL_DIAGNOSTIC is defined. |
|
*/ |
|
if (pool_logsize != 0) |
|
flags |= PR_LOGGING; |
|
#endif |
|
|
/* |
/* |
* Check arguments and construct default values. |
* Check arguments and construct default values. |
*/ |
*/ |
Line 363 pool_init(pp, size, align, ioff, flags, |
|
Line 424 pool_init(pp, size, align, ioff, flags, |
|
/* |
/* |
* Initialize the pool structure. |
* Initialize the pool structure. |
*/ |
*/ |
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
|
TAILQ_INIT(&pp->pr_pagelist); |
TAILQ_INIT(&pp->pr_pagelist); |
pp->pr_curpage = NULL; |
pp->pr_curpage = NULL; |
pp->pr_npages = 0; |
pp->pr_npages = 0; |
Line 436 pool_init(pp, size, align, ioff, flags, |
|
Line 496 pool_init(pp, size, align, ioff, flags, |
|
pp->pr_hiwat = 0; |
pp->pr_hiwat = 0; |
pp->pr_nidle = 0; |
pp->pr_nidle = 0; |
|
|
#ifdef POOL_DIAGNOSTIC |
if (flags & PR_LOGGING) { |
if ((flags & PR_LOGGING) != 0) { |
if (kmem_map == NULL || |
pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log), |
(pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log), |
M_TEMP, M_NOWAIT); |
M_TEMP, M_NOWAIT)) == NULL) |
if (pp->pr_log == NULL) |
|
pp->pr_roflags &= ~PR_LOGGING; |
pp->pr_roflags &= ~PR_LOGGING; |
pp->pr_curlogentry = 0; |
pp->pr_curlogentry = 0; |
pp->pr_logsize = pool_logsize; |
pp->pr_logsize = pool_logsize; |
} |
} |
#endif |
|
|
pp->pr_entered_file = NULL; |
|
pp->pr_entered_line = 0; |
|
|
simple_lock_init(&pp->pr_slock); |
simple_lock_init(&pp->pr_slock); |
|
|
/* |
/* |
* Initialize private page header pool if we haven't done so yet. |
* Initialize private page header pool if we haven't done so yet. |
|
* XXX LOCKING. |
*/ |
*/ |
if (phpool.pr_size == 0) { |
if (phpool.pr_size == 0) { |
pool_init(&phpool, sizeof(struct pool_item_header), 0, 0, |
pool_init(&phpool, sizeof(struct pool_item_header), 0, 0, |
0, "phpool", 0, 0, 0, 0); |
0, "phpool", 0, 0, 0, 0); |
} |
} |
|
|
return; |
/* Insert into the list of all pools. */ |
|
simple_lock(&pool_head_slock); |
|
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
|
simple_unlock(&pool_head_slock); |
} |
} |
|
|
/* |
/* |
Line 471 pool_destroy(pp) |
|
Line 536 pool_destroy(pp) |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nout != 0) { |
if (pp->pr_nout != 0) { |
pr_printlog(pp); |
pr_printlog(pp, NULL, printf); |
panic("pool_destroy: pool busy: still out: %u\n", |
panic("pool_destroy: pool busy: still out: %u\n", |
pp->pr_nout); |
pp->pr_nout); |
} |
} |
Line 483 pool_destroy(pp) |
|
Line 548 pool_destroy(pp) |
|
pr_rmpage(pp, ph); |
pr_rmpage(pp, ph); |
|
|
/* Remove from global pool list */ |
/* Remove from global pool list */ |
|
simple_lock(&pool_head_slock); |
TAILQ_REMOVE(&pool_head, pp, pr_poollist); |
TAILQ_REMOVE(&pool_head, pp, pr_poollist); |
|
/* XXX Only clear this if we were drainpp? */ |
drainpp = NULL; |
drainpp = NULL; |
|
simple_unlock(&pool_head_slock); |
|
|
#ifdef POOL_DIAGNOSTIC |
|
if ((pp->pr_roflags & PR_LOGGING) != 0) |
if ((pp->pr_roflags & PR_LOGGING) != 0) |
free(pp->pr_log, M_TEMP); |
free(pp->pr_log, M_TEMP); |
#endif |
|
|
|
if (pp->pr_roflags & PR_FREEHEADER) |
if (pp->pr_roflags & PR_FREEHEADER) |
free(pp, M_POOL); |
free(pp, M_POOL); |
Line 499 pool_destroy(pp) |
|
Line 565 pool_destroy(pp) |
|
/* |
/* |
* Grab an item from the pool; must be called at appropriate spl level |
* Grab an item from the pool; must be called at appropriate spl level |
*/ |
*/ |
#ifdef POOL_DIAGNOSTIC |
|
void * |
void * |
_pool_get(pp, flags, file, line) |
_pool_get(pp, flags, file, line) |
struct pool *pp; |
struct pool *pp; |
int flags; |
int flags; |
const char *file; |
const char *file; |
long line; |
long line; |
#else |
|
void * |
|
pool_get(pp, flags) |
|
struct pool *pp; |
|
int flags; |
|
#endif |
|
{ |
{ |
void *v; |
void *v; |
struct pool_item *pi; |
struct pool_item *pi; |
Line 519 pool_get(pp, flags) |
|
Line 578 pool_get(pp, flags) |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if ((pp->pr_roflags & PR_STATIC) && (flags & PR_MALLOCOK)) { |
if ((pp->pr_roflags & PR_STATIC) && (flags & PR_MALLOCOK)) { |
pr_printlog(pp); |
pr_printlog(pp, NULL, printf); |
panic("pool_get: static"); |
panic("pool_get: static"); |
} |
} |
#endif |
#endif |
Line 528 pool_get(pp, flags) |
|
Line 587 pool_get(pp, flags) |
|
panic("pool_get: must have NOWAIT"); |
panic("pool_get: must have NOWAIT"); |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
startover: |
startover: |
/* |
/* |
Line 537 pool_get(pp, flags) |
|
Line 597 pool_get(pp, flags) |
|
*/ |
*/ |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nout > pp->pr_hardlimit) { |
if (pp->pr_nout > pp->pr_hardlimit) { |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
panic("pool_get: %s: crossed hard limit", pp->pr_wchan); |
panic("pool_get: %s: crossed hard limit", pp->pr_wchan); |
} |
} |
Line 548 pool_get(pp, flags) |
|
Line 609 pool_get(pp, flags) |
|
* it be? |
* it be? |
*/ |
*/ |
pp->pr_flags |= PR_WANTED; |
pp->pr_flags |= PR_WANTED; |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0); |
tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0); |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
goto startover; |
goto startover; |
} |
} |
if (pp->pr_hardlimit_warning != NULL) { |
if (pp->pr_hardlimit_warning != NULL) { |
Line 574 pool_get(pp, flags) |
|
Line 637 pool_get(pp, flags) |
|
|
|
pp->pr_nfail++; |
pp->pr_nfail++; |
|
|
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (NULL); |
return (NULL); |
} |
} |
Line 601 pool_get(pp, flags) |
|
Line 665 pool_get(pp, flags) |
|
* Release the pool lock, as the back-end page allocator |
* Release the pool lock, as the back-end page allocator |
* may block. |
* may block. |
*/ |
*/ |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
v = (*pp->pr_alloc)(pp->pr_pagesz, flags, pp->pr_mtype); |
v = (*pp->pr_alloc)(pp->pr_pagesz, flags, pp->pr_mtype); |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
if (v == NULL) { |
if (v == NULL) { |
/* |
/* |
Line 620 pool_get(pp, flags) |
|
Line 686 pool_get(pp, flags) |
|
|
|
if ((flags & PR_WAITOK) == 0) { |
if ((flags & PR_WAITOK) == 0) { |
pp->pr_nfail++; |
pp->pr_nfail++; |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (NULL); |
return (NULL); |
} |
} |
Line 636 pool_get(pp, flags) |
|
Line 703 pool_get(pp, flags) |
|
* try again? |
* try again? |
*/ |
*/ |
pp->pr_flags |= PR_WANTED; |
pp->pr_flags |= PR_WANTED; |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0); |
tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0); |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
goto startover; |
goto startover; |
} |
} |
|
|
Line 651 pool_get(pp, flags) |
|
Line 720 pool_get(pp, flags) |
|
} |
} |
|
|
if ((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL) { |
if ((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL) { |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
panic("pool_get: %s: page empty", pp->pr_wchan); |
panic("pool_get: %s: page empty", pp->pr_wchan); |
} |
} |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nitems == 0) { |
if (pp->pr_nitems == 0) { |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
printf("pool_get: %s: items on itemlist, nitems %u\n", |
printf("pool_get: %s: items on itemlist, nitems %u\n", |
pp->pr_wchan, pp->pr_nitems); |
pp->pr_wchan, pp->pr_nitems); |
Line 666 pool_get(pp, flags) |
|
Line 737 pool_get(pp, flags) |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pi->pi_magic != PI_MAGIC) { |
if (pi->pi_magic != PI_MAGIC) { |
pr_printlog(pp); |
pr_printlog(pp, pi, printf); |
panic("pool_get(%s): free list modified: magic=%x; page %p;" |
panic("pool_get(%s): free list modified: magic=%x; page %p;" |
" item addr %p\n", |
" item addr %p\n", |
pp->pr_wchan, pi->pi_magic, ph->ph_page, pi); |
pp->pr_wchan, pi->pi_magic, ph->ph_page, pi); |
Line 690 pool_get(pp, flags) |
|
Line 761 pool_get(pp, flags) |
|
if (TAILQ_FIRST(&ph->ph_itemlist) == NULL) { |
if (TAILQ_FIRST(&ph->ph_itemlist) == NULL) { |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (ph->ph_nmissing != pp->pr_itemsperpage) { |
if (ph->ph_nmissing != pp->pr_itemsperpage) { |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
panic("pool_get: %s: nmissing inconsistent", |
panic("pool_get: %s: nmissing inconsistent", |
pp->pr_wchan); |
pp->pr_wchan); |
Line 730 pool_get(pp, flags) |
|
Line 802 pool_get(pp, flags) |
|
*/ |
*/ |
} |
} |
|
|
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (v); |
return (v); |
} |
} |
Line 737 pool_get(pp, flags) |
|
Line 810 pool_get(pp, flags) |
|
/* |
/* |
* Return resource to the pool; must be called at appropriate spl level |
* Return resource to the pool; must be called at appropriate spl level |
*/ |
*/ |
#ifdef POOL_DIAGNOSTIC |
|
void |
void |
_pool_put(pp, v, file, line) |
_pool_put(pp, v, file, line) |
struct pool *pp; |
struct pool *pp; |
void *v; |
void *v; |
const char *file; |
const char *file; |
long line; |
long line; |
#else |
|
void |
|
pool_put(pp, v) |
|
struct pool *pp; |
|
void *v; |
|
#endif |
|
{ |
{ |
struct pool_item *pi = v; |
struct pool_item *pi = v; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
|
|
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
pr_log(pp, v, PRLOG_PUT, file, line); |
pr_log(pp, v, PRLOG_PUT, file, line); |
|
|
if ((ph = pr_find_pagehead(pp, page)) == NULL) { |
if ((ph = pr_find_pagehead(pp, page)) == NULL) { |
pr_printlog(pp); |
pr_printlog(pp, NULL, printf); |
panic("pool_put: %s: page header missing", pp->pr_wchan); |
panic("pool_put: %s: page header missing", pp->pr_wchan); |
} |
} |
|
|
|
|
* Return to item list. |
* Return to item list. |
*/ |
*/ |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
|
/* XXX Should fill the item. */ |
pi->pi_magic = PI_MAGIC; |
pi->pi_magic = PI_MAGIC; |
#endif |
#endif |
TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list); |
TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list); |
|
|
pp->pr_flags &= ~PR_WANTED; |
pp->pr_flags &= ~PR_WANTED; |
if (ph->ph_nmissing == 0) |
if (ph->ph_nmissing == 0) |
pp->pr_nidle++; |
pp->pr_nidle++; |
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
wakeup((caddr_t)pp); |
wakeup((caddr_t)pp); |
return; |
return; |
|
|
pp->pr_curpage = ph; |
pp->pr_curpage = ph; |
} |
} |
|
|
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
|
} |
} |
Line 1159 pool_page_free_nointr(v, sz, mtype) |
|
Line 1229 pool_page_free_nointr(v, sz, mtype) |
|
* Release all complete pages that have not been used recently. |
* Release all complete pages that have not been used recently. |
*/ |
*/ |
void |
void |
pool_reclaim(pp) |
_pool_reclaim(pp, file, line) |
pool_handle_t pp; |
pool_handle_t pp; |
|
const char *file; |
|
long line; |
{ |
{ |
struct pool_item_header *ph, *phnext; |
struct pool_item_header *ph, *phnext; |
struct timeval curtime; |
struct timeval curtime; |
Line 1171 pool_reclaim(pp) |
|
Line 1243 pool_reclaim(pp) |
|
|
|
if (simple_lock_try(&pp->pr_slock) == 0) |
if (simple_lock_try(&pp->pr_slock) == 0) |
return; |
return; |
|
pr_enter(pp, file, line); |
|
|
s = splclock(); |
s = splclock(); |
curtime = mono_time; |
curtime = mono_time; |
Line 1201 pool_reclaim(pp) |
|
Line 1274 pool_reclaim(pp) |
|
} |
} |
} |
} |
|
|
|
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
|
|
Line 1215 pool_drain(arg) |
|
Line 1289 pool_drain(arg) |
|
void *arg; |
void *arg; |
{ |
{ |
struct pool *pp; |
struct pool *pp; |
int s = splimp(); |
int s; |
|
|
/* XXX:lock pool head */ |
s = splimp(); |
if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL) { |
simple_lock(&pool_head_slock); |
splx(s); |
|
return; |
if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL) |
} |
goto out; |
|
|
pp = drainpp; |
pp = drainpp; |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
/* XXX:unlock pool head */ |
|
|
|
pool_reclaim(pp); |
pool_reclaim(pp); |
|
|
|
out: |
|
simple_unlock(&pool_head_slock); |
splx(s); |
splx(s); |
} |
} |
|
|
|
|
#if defined(POOL_DIAGNOSTIC) || defined(DEBUG) |
|
/* |
/* |
* Diagnostic helpers. |
* Diagnostic helpers. |
*/ |
*/ |
void |
void |
pool_print(pp, label) |
pool_print(pp, modif) |
struct pool *pp; |
struct pool *pp; |
const char *label; |
const char *modif; |
{ |
{ |
int s; |
int s; |
|
|
s = splimp(); |
s = splimp(); |
simple_lock(&pp->pr_slock); |
if (simple_lock_try(&pp->pr_slock) == 0) { |
pool_print1(pp, label); |
printf("pool %s is locked; try again later\n", |
|
pp->pr_wchan); |
|
splx(s); |
|
return; |
|
} |
|
pool_print1(pp, modif, printf); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
splx(s); |
splx(s); |
} |
} |
|
|
|
void |
|
pool_printit(pp, modif, pr) |
|
struct pool *pp; |
|
const char *modif; |
|
void (*pr) __P((const char *, ...)); |
|
{ |
|
int didlock = 0; |
|
|
|
if (pp == NULL) { |
|
(*pr)("Must specify a pool to print.\n"); |
|
return; |
|
} |
|
|
|
/* |
|
* Called from DDB; interrupts should be blocked, and all |
|
* other processors should be paused. We can skip locking |
|
* the pool in this case. |
|
* |
|
* We do a simple_lock_try() just to print the lock |
|
* status, however. |
|
*/ |
|
|
|
if (simple_lock_try(&pp->pr_slock) == 0) |
|
(*pr)("WARNING: pool %s is locked\n", pp->pr_wchan); |
|
else |
|
didlock = 1; |
|
|
|
pool_print1(pp, modif, pr); |
|
|
|
if (didlock) |
|
simple_unlock(&pp->pr_slock); |
|
} |
|
|
static void |
static void |
pool_print1(pp, label) |
pool_print1(pp, modif, pr) |
struct pool *pp; |
struct pool *pp; |
const char *label; |
const char *modif; |
|
void (*pr) __P((const char *, ...)); |
{ |
{ |
|
struct pool_item_header *ph; |
|
#ifdef DIAGNOSTIC |
|
struct pool_item *pi; |
|
#endif |
|
int print_log = 0, print_pagelist = 0; |
|
char c; |
|
|
|
while ((c = *modif++) != '\0') { |
|
if (c == 'l') |
|
print_log = 1; |
|
if (c == 'p') |
|
print_pagelist = 1; |
|
modif++; |
|
} |
|
|
|
(*pr)("POOL %s: size %u, align %u, ioff %u, roflags 0x%08x\n", |
|
pp->pr_wchan, pp->pr_size, pp->pr_align, pp->pr_itemoffset, |
|
pp->pr_roflags); |
|
(*pr)("\tpagesz %u, mtype %d\n", pp->pr_pagesz, pp->pr_mtype); |
|
(*pr)("\talloc %p, release %p\n", pp->pr_alloc, pp->pr_free); |
|
(*pr)("\tminitems %u, minpages %u, maxpages %u, npages %u\n", |
|
pp->pr_minitems, pp->pr_minpages, pp->pr_maxpages, pp->pr_npages); |
|
(*pr)("\titemsperpage %u, nitems %u, nout %u, hardlimit %u\n", |
|
pp->pr_itemsperpage, pp->pr_nitems, pp->pr_nout, pp->pr_hardlimit); |
|
|
|
(*pr)("\n\tnget %lu, nfail %lu, nput %lu\n", |
|
pp->pr_nget, pp->pr_nfail, pp->pr_nput); |
|
(*pr)("\tnpagealloc %lu, npagefree %lu, hiwat %u, nidle %lu\n", |
|
pp->pr_npagealloc, pp->pr_npagefree, pp->pr_hiwat, pp->pr_nidle); |
|
|
|
if (print_pagelist == 0) |
|
goto skip_pagelist; |
|
|
|
if ((ph = TAILQ_FIRST(&pp->pr_pagelist)) != NULL) |
|
(*pr)("\n\tpage list:\n"); |
|
for (; ph != NULL; ph = TAILQ_NEXT(ph, ph_pagelist)) { |
|
(*pr)("\t\tpage %p, nmissing %d, time %lu,%lu\n", |
|
ph->ph_page, ph->ph_nmissing, |
|
(u_long)ph->ph_time.tv_sec, |
|
(u_long)ph->ph_time.tv_usec); |
|
#ifdef DIAGNOSTIC |
|
for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL; |
|
pi = TAILQ_NEXT(pi, pi_list)) { |
|
if (pi->pi_magic != PI_MAGIC) { |
|
(*pr)("\t\t\titem %p, magic 0x%x\n", |
|
pi, pi->pi_magic); |
|
} |
|
} |
|
#endif |
|
} |
|
if (pp->pr_curpage == NULL) |
|
(*pr)("\tno current page\n"); |
|
else |
|
(*pr)("\tcurpage %p\n", pp->pr_curpage->ph_page); |
|
|
|
skip_pagelist: |
|
|
|
if (print_log == 0) |
|
goto skip_log; |
|
|
|
(*pr)("\n"); |
|
if ((pp->pr_roflags & PR_LOGGING) == 0) |
|
(*pr)("\tno log\n"); |
|
else |
|
pr_printlog(pp, NULL, pr); |
|
|
if (label != NULL) |
skip_log: |
printf("%s: ", label); |
|
|
|
printf("pool %s: nalloc %lu nfree %lu npagealloc %lu npagefree %lu\n" |
pr_enter_check(pp, pr); |
" npages %u minitems %u itemsperpage %u itemoffset %u\n" |
|
" nidle %lu\n", |
|
pp->pr_wchan, |
|
pp->pr_nget, |
|
pp->pr_nput, |
|
pp->pr_npagealloc, |
|
pp->pr_npagefree, |
|
pp->pr_npages, |
|
pp->pr_minitems, |
|
pp->pr_itemsperpage, |
|
pp->pr_itemoffset, |
|
pp->pr_nidle); |
|
} |
} |
|
|
int |
int |
|
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (r); |
return (r); |
} |
} |
#endif /* POOL_DIAGNOSTIC || DEBUG */ |
|