version 1.40, 2000/08/12 16:28:30 |
version 1.47, 2000/12/10 17:03:34 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/*- |
/*- |
* Copyright (c) 1997, 1999 The NetBSD Foundation, Inc. |
* Copyright (c) 1997, 1999, 2000 The NetBSD Foundation, Inc. |
* All rights reserved. |
* All rights reserved. |
* |
* |
* This code is derived from software contributed to The NetBSD Foundation |
* This code is derived from software contributed to The NetBSD Foundation |
Line 100 struct pool_item { |
|
Line 100 struct pool_item { |
|
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)) |
|
|
|
/* |
|
* Pool cache management. |
|
* |
|
* Pool caches provide a way for constructed objects to be cached by the |
|
* pool subsystem. This can lead to performance improvements by avoiding |
|
* needless object construction/destruction; it is deferred until absolutely |
|
* necessary. |
|
* |
|
* Caches are grouped into cache groups. Each cache group references |
|
* up to 16 constructed objects. When a cache allocates an object |
|
* from the pool, it calls the object's constructor and places it into |
|
* a cache group. When a cache group frees an object back to the pool, |
|
* it first calls the object's destructor. This allows the object to |
|
* persist in constructed form while freed to the cache. |
|
* |
|
* Multiple caches may exist for each pool. This allows a single |
|
* object type to have multiple constructed forms. The pool references |
|
* each cache, so that when a pool is drained by the pagedaemon, it can |
|
* drain each individual cache as well. Each time a cache is drained, |
|
* the most idle cache group is freed to the pool in its entirety. |
|
* |
|
* Pool caches are layed on top of pools. By layering them, we can avoid |
|
* the complexity of cache management for pools which would not benefit |
|
* from it. |
|
*/ |
|
|
|
/* The cache group pool. */ |
|
static struct pool pcgpool; |
|
|
|
/* The pool cache group. */ |
|
#define PCG_NOBJECTS 16 |
|
struct pool_cache_group { |
|
TAILQ_ENTRY(pool_cache_group) |
|
pcg_list; /* link in the pool cache's group list */ |
|
u_int pcg_avail; /* # available objects */ |
|
/* pointers to the objects */ |
|
void *pcg_objects[PCG_NOBJECTS]; |
|
}; |
|
|
static struct pool_item_header |
static void pool_cache_reclaim(struct pool_cache *); |
*pr_find_pagehead __P((struct pool *, caddr_t)); |
|
static void pr_rmpage __P((struct pool *, struct pool_item_header *)); |
|
static int pool_catchup __P((struct pool *)); |
|
static void pool_prime_page __P((struct pool *, caddr_t)); |
|
static void *pool_page_alloc __P((unsigned long, int, int)); |
|
static void pool_page_free __P((void *, unsigned long, int)); |
|
|
|
static void pool_print1 __P((struct pool *, const char *, |
static int pool_catchup(struct pool *); |
void (*)(const char *, ...))); |
static void pool_prime_page(struct pool *, caddr_t); |
|
static void *pool_page_alloc(unsigned long, int, int); |
|
static void pool_page_free(void *, unsigned long, int); |
|
|
|
static void pool_print1(struct pool *, const char *, |
|
void (*)(const char *, ...)); |
|
|
/* |
/* |
* 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 137 struct pool_log { |
|
Line 172 struct pool_log { |
|
int pool_logsize = POOL_LOGSIZE; |
int pool_logsize = POOL_LOGSIZE; |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
static void pr_log __P((struct pool *, void *, int, const char *, long)); |
static __inline void |
static void pr_printlog __P((struct pool *, struct pool_item *, |
pr_log(struct pool *pp, void *v, int action, const char *file, long line) |
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 |
|
pr_log(pp, v, action, file, line) |
|
struct pool *pp; |
|
void *v; |
|
int action; |
|
const char *file; |
|
long line; |
|
{ |
{ |
int n = pp->pr_curlogentry; |
int n = pp->pr_curlogentry; |
struct pool_log *pl; |
struct pool_log *pl; |
Line 174 pr_log(pp, v, action, file, line) |
|
Line 196 pr_log(pp, v, action, file, line) |
|
} |
} |
|
|
static void |
static void |
pr_printlog(pp, pi, pr) |
pr_printlog(struct pool *pp, struct pool_item *pi, |
struct pool *pp; |
void (*pr)(const char *, ...)) |
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; |
Line 205 pr_printlog(pp, pi, pr) |
|
Line 225 pr_printlog(pp, pi, pr) |
|
} |
} |
} |
} |
|
|
static __inline__ void |
static __inline void |
pr_enter(pp, file, line) |
pr_enter(struct pool *pp, const char *file, long line) |
struct pool *pp; |
|
const char *file; |
|
long line; |
|
{ |
{ |
|
|
if (__predict_false(pp->pr_entered_file != NULL)) { |
if (__predict_false(pp->pr_entered_file != NULL)) { |
Line 224 pr_enter(pp, file, line) |
|
Line 241 pr_enter(pp, file, line) |
|
pp->pr_entered_line = line; |
pp->pr_entered_line = line; |
} |
} |
|
|
static __inline__ void |
static __inline void |
pr_leave(pp) |
pr_leave(struct pool *pp) |
struct pool *pp; |
|
{ |
{ |
|
|
if (__predict_false(pp->pr_entered_file == NULL)) { |
if (__predict_false(pp->pr_entered_file == NULL)) { |
|
|
pp->pr_entered_line = 0; |
pp->pr_entered_line = 0; |
} |
} |
|
|
static __inline__ void |
static __inline void |
pr_enter_check(pp, pr) |
pr_enter_check(struct pool *pp, void (*pr)(const char *, ...)) |
struct pool *pp; |
|
void (*pr) __P((const char *, ...)); |
|
{ |
{ |
|
|
if (pp->pr_entered_file != NULL) |
if (pp->pr_entered_file != NULL) |
Line 259 pr_enter_check(pp, pr) |
|
Line 273 pr_enter_check(pp, pr) |
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on page address. |
*/ |
*/ |
static __inline__ struct pool_item_header * |
static __inline struct pool_item_header * |
pr_find_pagehead(pp, page) |
pr_find_pagehead(struct pool *pp, caddr_t page) |
struct pool *pp; |
|
caddr_t page; |
|
{ |
{ |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
|
|
Line 281 pr_find_pagehead(pp, page) |
|
Line 293 pr_find_pagehead(pp, page) |
|
/* |
/* |
* Remove a page from the pool. |
* Remove a page from the pool. |
*/ |
*/ |
static __inline__ void |
static __inline void |
pr_rmpage(pp, ph) |
pr_rmpage(struct pool *pp, struct pool_item_header *ph) |
struct pool *pp; |
|
struct pool_item_header *ph; |
|
{ |
{ |
|
|
/* |
/* |
Line 337 pr_rmpage(pp, ph) |
|
Line 347 pr_rmpage(pp, ph) |
|
* Allocate and initialize a pool. |
* Allocate and initialize a pool. |
*/ |
*/ |
struct pool * |
struct pool * |
pool_create(size, align, ioff, nitems, wchan, pagesz, alloc, release, mtype) |
pool_create(size_t size, u_int align, u_int ioff, int nitems, |
size_t size; |
const char *wchan, size_t pagesz, |
u_int align; |
void *(*alloc)(unsigned long, int, int), |
u_int ioff; |
void (*release)(void *, unsigned long, int), |
int nitems; |
int mtype) |
const char *wchan; |
|
size_t pagesz; |
|
void *(*alloc) __P((unsigned long, int, int)); |
|
void (*release) __P((void *, unsigned long, int)); |
|
int mtype; |
|
{ |
{ |
struct pool *pp; |
struct pool *pp; |
int flags; |
int flags; |
Line 376 pool_create(size, align, ioff, nitems, w |
|
Line 381 pool_create(size, align, ioff, nitems, w |
|
* static pools that must be initialized before malloc() is available. |
* static pools that must be initialized before malloc() is available. |
*/ |
*/ |
void |
void |
pool_init(pp, size, align, ioff, flags, wchan, pagesz, alloc, release, mtype) |
pool_init(struct pool *pp, size_t size, u_int align, u_int ioff, int flags, |
struct pool *pp; |
const char *wchan, size_t pagesz, |
size_t size; |
void *(*alloc)(unsigned long, int, int), |
u_int align; |
void (*release)(void *, unsigned long, int), |
u_int ioff; |
int mtype) |
int flags; |
|
const char *wchan; |
|
size_t pagesz; |
|
void *(*alloc) __P((unsigned long, int, int)); |
|
void (*release) __P((void *, unsigned long, int)); |
|
int mtype; |
|
{ |
{ |
int off, slack, i; |
int off, slack, i; |
|
|
Line 423 pool_init(pp, size, align, ioff, flags, |
|
Line 422 pool_init(pp, size, align, ioff, flags, |
|
size = sizeof(struct pool_item); |
size = sizeof(struct pool_item); |
|
|
size = ALIGN(size); |
size = ALIGN(size); |
if (size >= pagesz) |
if (size > pagesz) |
panic("pool_init: pool item size (%lu) too large", |
panic("pool_init: pool item size (%lu) too large", |
(u_long)size); |
(u_long)size); |
|
|
Line 431 pool_init(pp, size, align, ioff, flags, |
|
Line 430 pool_init(pp, size, align, ioff, flags, |
|
* Initialize the pool structure. |
* Initialize the pool structure. |
*/ |
*/ |
TAILQ_INIT(&pp->pr_pagelist); |
TAILQ_INIT(&pp->pr_pagelist); |
|
TAILQ_INIT(&pp->pr_cachelist); |
pp->pr_curpage = NULL; |
pp->pr_curpage = NULL; |
pp->pr_npages = 0; |
pp->pr_npages = 0; |
pp->pr_minitems = 0; |
pp->pr_minitems = 0; |
Line 486 pool_init(pp, size, align, ioff, flags, |
|
Line 486 pool_init(pp, size, align, ioff, flags, |
|
*/ |
*/ |
pp->pr_itemoffset = ioff = ioff % align; |
pp->pr_itemoffset = ioff = ioff % align; |
pp->pr_itemsperpage = (off - ((align - ioff) % align)) / pp->pr_size; |
pp->pr_itemsperpage = (off - ((align - ioff) % align)) / pp->pr_size; |
|
KASSERT(pp->pr_itemsperpage != 0); |
|
|
/* |
/* |
* Use the slack between the chunks and the page header |
* Use the slack between the chunks and the page header |
Line 518 pool_init(pp, size, align, ioff, flags, |
|
Line 519 pool_init(pp, size, align, ioff, flags, |
|
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 and cache magazine pool if we |
|
* haven't done so yet. |
* XXX LOCKING. |
* 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); |
|
pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0, |
|
0, "pcgpool", 0, 0, 0, 0); |
} |
} |
|
|
/* Insert into the list of all pools. */ |
/* Insert into the list of all pools. */ |
Line 536 pool_init(pp, size, align, ioff, flags, |
|
Line 540 pool_init(pp, size, align, ioff, flags, |
|
* De-commision a pool resource. |
* De-commision a pool resource. |
*/ |
*/ |
void |
void |
pool_destroy(pp) |
pool_destroy(struct pool *pp) |
struct pool *pp; |
|
{ |
{ |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
|
struct pool_cache *pc; |
|
|
|
/* Destroy all caches for this pool. */ |
|
while ((pc = TAILQ_FIRST(&pp->pr_cachelist)) != NULL) |
|
pool_cache_destroy(pc); |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nout != 0) { |
if (pp->pr_nout != 0) { |
Line 573 pool_destroy(pp) |
|
Line 581 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 |
*/ |
*/ |
void * |
void * |
_pool_get(pp, flags, file, line) |
_pool_get(struct pool *pp, int flags, const char *file, long line) |
struct pool *pp; |
|
int flags; |
|
const char *file; |
|
long line; |
|
{ |
{ |
void *v; |
void *v; |
struct pool_item *pi; |
struct pool_item *pi; |
Line 806 _pool_get(pp, flags, file, line) |
|
Line 810 _pool_get(pp, flags, file, line) |
|
} |
} |
|
|
/* |
/* |
* Return resource to the pool; must be called at appropriate spl level |
* Internal version of pool_put(). Pool is already locked/entered. |
*/ |
*/ |
void |
static void |
_pool_put(pp, v, file, line) |
pool_do_put(struct pool *pp, void *v, const char *file, long line) |
struct pool *pp; |
|
void *v; |
|
const char *file; |
|
long line; |
|
{ |
{ |
struct pool_item *pi = v; |
struct pool_item *pi = v; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
Line 822 _pool_put(pp, v, file, line) |
|
Line 822 _pool_put(pp, v, file, line) |
|
|
|
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
|
|
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (__predict_false(pp->pr_nout == 0)) { |
if (__predict_false(pp->pr_nout == 0)) { |
printf("pool %s: putting with none out\n", |
printf("pool %s: putting with none out\n", |
Line 877 _pool_put(pp, v, file, line) |
|
Line 874 _pool_put(pp, v, file, line) |
|
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); |
|
wakeup((caddr_t)pp); |
wakeup((caddr_t)pp); |
return; |
return; |
} |
} |
Line 942 _pool_put(pp, v, file, line) |
|
Line 937 _pool_put(pp, v, file, line) |
|
TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist); |
pp->pr_curpage = ph; |
pp->pr_curpage = ph; |
} |
} |
|
} |
|
|
|
/* |
|
* Return resource to the pool; must be called at appropriate spl level |
|
*/ |
|
void |
|
_pool_put(struct pool *pp, void *v, const char *file, long line) |
|
{ |
|
|
|
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
|
pool_do_put(pp, v, file, line); |
|
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
|
} |
} |
|
|
/* |
/* |
* Add N items to the pool. |
* Add N items to the pool. |
*/ |
*/ |
int |
int |
pool_prime(pp, n, storage) |
pool_prime(struct pool *pp, int n, caddr_t storage) |
struct pool *pp; |
|
int n; |
|
caddr_t storage; |
|
{ |
{ |
caddr_t cp; |
caddr_t cp; |
int newnitems, newpages; |
int newnitems, newpages; |
Line 1008 pool_prime(pp, n, storage) |
|
Line 1012 pool_prime(pp, n, storage) |
|
* Note, we must be called with the pool descriptor LOCKED. |
* Note, we must be called with the pool descriptor LOCKED. |
*/ |
*/ |
static void |
static void |
pool_prime_page(pp, storage) |
pool_prime_page(struct pool *pp, caddr_t storage) |
struct pool *pp; |
|
caddr_t storage; |
|
{ |
{ |
struct pool_item *pi; |
struct pool_item *pi; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
Line 1096 pool_prime_page(pp, storage) |
|
Line 1098 pool_prime_page(pp, storage) |
|
* with it locked. |
* with it locked. |
*/ |
*/ |
static int |
static int |
pool_catchup(pp) |
pool_catchup(struct pool *pp) |
struct pool *pp; |
|
{ |
{ |
caddr_t cp; |
caddr_t cp; |
int error = 0; |
int error = 0; |
Line 1136 pool_catchup(pp) |
|
Line 1137 pool_catchup(pp) |
|
} |
} |
|
|
void |
void |
pool_setlowat(pp, n) |
pool_setlowat(struct pool *pp, int n) |
pool_handle_t pp; |
|
int n; |
|
{ |
{ |
int error; |
int error; |
|
|
Line 1150 pool_setlowat(pp, n) |
|
Line 1149 pool_setlowat(pp, n) |
|
: roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage; |
: roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage; |
|
|
/* Make sure we're caught up with the newly-set low water mark. */ |
/* Make sure we're caught up with the newly-set low water mark. */ |
if ((error = pool_catchup(pp)) != 0) { |
if ((pp->pr_nitems < pp->pr_minitems) && |
|
(error = pool_catchup(pp)) != 0) { |
/* |
/* |
* XXX: Should we log a warning? Should we set up a timeout |
* XXX: Should we log a warning? Should we set up a timeout |
* to try again in a second or so? The latter could break |
* to try again in a second or so? The latter could break |
Line 1162 pool_setlowat(pp, n) |
|
Line 1162 pool_setlowat(pp, n) |
|
} |
} |
|
|
void |
void |
pool_sethiwat(pp, n) |
pool_sethiwat(struct pool *pp, int n) |
pool_handle_t pp; |
|
int n; |
|
{ |
{ |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
Line 1177 pool_sethiwat(pp, n) |
|
Line 1175 pool_sethiwat(pp, n) |
|
} |
} |
|
|
void |
void |
pool_sethardlimit(pp, n, warnmess, ratecap) |
pool_sethardlimit(struct pool *pp, int n, const char *warnmess, int ratecap) |
pool_handle_t pp; |
|
int n; |
|
const char *warnmess; |
|
int ratecap; |
|
{ |
{ |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
Line 1207 pool_sethardlimit(pp, n, warnmess, ratec |
|
Line 1201 pool_sethardlimit(pp, n, warnmess, ratec |
|
* Default page allocator. |
* Default page allocator. |
*/ |
*/ |
static void * |
static void * |
pool_page_alloc(sz, flags, mtype) |
pool_page_alloc(unsigned long sz, int flags, int mtype) |
unsigned long sz; |
|
int flags; |
|
int mtype; |
|
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
|
|
Line 1218 pool_page_alloc(sz, flags, mtype) |
|
Line 1209 pool_page_alloc(sz, flags, mtype) |
|
} |
} |
|
|
static void |
static void |
pool_page_free(v, sz, mtype) |
pool_page_free(void *v, unsigned long sz, int mtype) |
void *v; |
|
unsigned long sz; |
|
int mtype; |
|
{ |
{ |
|
|
uvm_km_free_poolpage((vaddr_t)v); |
uvm_km_free_poolpage((vaddr_t)v); |
Line 1232 pool_page_free(v, sz, mtype) |
|
Line 1220 pool_page_free(v, sz, mtype) |
|
* never be accessed in interrupt context. |
* never be accessed in interrupt context. |
*/ |
*/ |
void * |
void * |
pool_page_alloc_nointr(sz, flags, mtype) |
pool_page_alloc_nointr(unsigned long sz, int flags, int mtype) |
unsigned long sz; |
|
int flags; |
|
int mtype; |
|
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
|
|
Line 1244 pool_page_alloc_nointr(sz, flags, mtype) |
|
Line 1229 pool_page_alloc_nointr(sz, flags, mtype) |
|
} |
} |
|
|
void |
void |
pool_page_free_nointr(v, sz, mtype) |
pool_page_free_nointr(void *v, unsigned long sz, int mtype) |
void *v; |
|
unsigned long sz; |
|
int mtype; |
|
{ |
{ |
|
|
uvm_km_free_poolpage1(kernel_map, (vaddr_t)v); |
uvm_km_free_poolpage1(kernel_map, (vaddr_t)v); |
Line 1258 pool_page_free_nointr(v, sz, mtype) |
|
Line 1240 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, file, line) |
_pool_reclaim(struct pool *pp, const char *file, long line) |
pool_handle_t pp; |
|
const char *file; |
|
long line; |
|
{ |
{ |
struct pool_item_header *ph, *phnext; |
struct pool_item_header *ph, *phnext; |
|
struct pool_cache *pc; |
struct timeval curtime; |
struct timeval curtime; |
int s; |
int s; |
|
|
Line 1274 _pool_reclaim(pp, file, line) |
|
Line 1254 _pool_reclaim(pp, file, line) |
|
return; |
return; |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
|
/* |
|
* Reclaim items from the pool's caches. |
|
*/ |
|
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
|
pc = TAILQ_NEXT(pc, pc_poollist)) |
|
pool_cache_reclaim(pc); |
|
|
s = splclock(); |
s = splclock(); |
curtime = mono_time; |
curtime = mono_time; |
splx(s); |
splx(s); |
Line 1314 _pool_reclaim(pp, file, line) |
|
Line 1301 _pool_reclaim(pp, file, line) |
|
* Note, we must never be called from an interrupt context. |
* Note, we must never be called from an interrupt context. |
*/ |
*/ |
void |
void |
pool_drain(arg) |
pool_drain(void *arg) |
void *arg; |
|
{ |
{ |
struct pool *pp; |
struct pool *pp; |
int s; |
int s; |
Line 1341 pool_drain(arg) |
|
Line 1327 pool_drain(arg) |
|
* Diagnostic helpers. |
* Diagnostic helpers. |
*/ |
*/ |
void |
void |
pool_print(pp, modif) |
pool_print(struct pool *pp, const char *modif) |
struct pool *pp; |
|
const char *modif; |
|
{ |
{ |
int s; |
int s; |
|
|
Line 1360 pool_print(pp, modif) |
|
Line 1344 pool_print(pp, modif) |
|
} |
} |
|
|
void |
void |
pool_printit(pp, modif, pr) |
pool_printit(struct pool *pp, const char *modif, void (*pr)(const char *, ...)) |
struct pool *pp; |
|
const char *modif; |
|
void (*pr) __P((const char *, ...)); |
|
{ |
{ |
int didlock = 0; |
int didlock = 0; |
|
|
Line 1393 pool_printit(pp, modif, pr) |
|
Line 1374 pool_printit(pp, modif, pr) |
|
} |
} |
|
|
static void |
static void |
pool_print1(pp, modif, pr) |
pool_print1(struct pool *pp, const char *modif, void (*pr)(const char *, ...)) |
struct pool *pp; |
|
const char *modif; |
|
void (*pr) __P((const char *, ...)); |
|
{ |
{ |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
|
struct pool_cache *pc; |
|
struct pool_cache_group *pcg; |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
struct pool_item *pi; |
struct pool_item *pi; |
#endif |
#endif |
int print_log = 0, print_pagelist = 0; |
int i, print_log = 0, print_pagelist = 0, print_cache = 0; |
char c; |
char c; |
|
|
while ((c = *modif++) != '\0') { |
while ((c = *modif++) != '\0') { |
Line 1410 pool_print1(pp, modif, pr) |
|
Line 1390 pool_print1(pp, modif, pr) |
|
print_log = 1; |
print_log = 1; |
if (c == 'p') |
if (c == 'p') |
print_pagelist = 1; |
print_pagelist = 1; |
|
if (c == 'c') |
|
print_cache = 1; |
modif++; |
modif++; |
} |
} |
|
|
Line 1466 pool_print1(pp, modif, pr) |
|
Line 1448 pool_print1(pp, modif, pr) |
|
|
|
skip_log: |
skip_log: |
|
|
|
if (print_cache == 0) |
|
goto skip_cache; |
|
|
|
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
|
pc = TAILQ_NEXT(pc, pc_poollist)) { |
|
(*pr)("\tcache %p: allocfrom %p freeto %p\n", pc, |
|
pc->pc_allocfrom, pc->pc_freeto); |
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
|
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); |
|
for (i = 0; i < PCG_NOBJECTS; i++) |
|
(*pr)("\t\t\t%p\n", pcg->pcg_objects[i]); |
|
} |
|
} |
|
|
|
skip_cache: |
|
|
pr_enter_check(pp, pr); |
pr_enter_check(pp, pr); |
} |
} |
|
|
int |
int |
pool_chk(pp, label) |
pool_chk(struct pool *pp, const char *label) |
struct pool *pp; |
|
char *label; |
|
{ |
{ |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
int r = 0; |
int r = 0; |
|
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (r); |
return (r); |
} |
} |
|
|
|
/* |
|
* pool_cache_init: |
|
* |
|
* Initialize a pool cache. |
|
* |
|
* NOTE: If the pool must be protected from interrupts, we expect |
|
* to be called at the appropriate interrupt priority level. |
|
*/ |
|
void |
|
pool_cache_init(struct pool_cache *pc, struct pool *pp, |
|
int (*ctor)(void *, void *, int), |
|
void (*dtor)(void *, void *), |
|
void *arg) |
|
{ |
|
|
|
TAILQ_INIT(&pc->pc_grouplist); |
|
simple_lock_init(&pc->pc_slock); |
|
|
|
pc->pc_allocfrom = NULL; |
|
pc->pc_freeto = NULL; |
|
pc->pc_pool = pp; |
|
|
|
pc->pc_ctor = ctor; |
|
pc->pc_dtor = dtor; |
|
pc->pc_arg = arg; |
|
|
|
simple_lock(&pp->pr_slock); |
|
TAILQ_INSERT_TAIL(&pp->pr_cachelist, pc, pc_poollist); |
|
simple_unlock(&pp->pr_slock); |
|
} |
|
|
|
/* |
|
* pool_cache_destroy: |
|
* |
|
* Destroy a pool cache. |
|
*/ |
|
void |
|
pool_cache_destroy(struct pool_cache *pc) |
|
{ |
|
struct pool *pp = pc->pc_pool; |
|
|
|
/* First, invalidate the entire cache. */ |
|
pool_cache_invalidate(pc); |
|
|
|
/* ...and remove it from the pool's cache list. */ |
|
simple_lock(&pp->pr_slock); |
|
TAILQ_REMOVE(&pp->pr_cachelist, pc, pc_poollist); |
|
simple_unlock(&pp->pr_slock); |
|
} |
|
|
|
static __inline void * |
|
pcg_get(struct pool_cache_group *pcg) |
|
{ |
|
void *object; |
|
u_int idx; |
|
|
|
KASSERT(pcg->pcg_avail <= PCG_NOBJECTS); |
|
KASSERT(pcg->pcg_avail != 0); |
|
idx = --pcg->pcg_avail; |
|
|
|
KASSERT(pcg->pcg_objects[idx] != NULL); |
|
object = pcg->pcg_objects[idx]; |
|
pcg->pcg_objects[idx] = NULL; |
|
|
|
return (object); |
|
} |
|
|
|
static __inline void |
|
pcg_put(struct pool_cache_group *pcg, void *object) |
|
{ |
|
u_int idx; |
|
|
|
KASSERT(pcg->pcg_avail < PCG_NOBJECTS); |
|
idx = pcg->pcg_avail++; |
|
|
|
KASSERT(pcg->pcg_objects[idx] == NULL); |
|
pcg->pcg_objects[idx] = object; |
|
} |
|
|
|
/* |
|
* pool_cache_get: |
|
* |
|
* Get an object from a pool cache. |
|
*/ |
|
void * |
|
pool_cache_get(struct pool_cache *pc, int flags) |
|
{ |
|
struct pool_cache_group *pcg; |
|
void *object; |
|
|
|
simple_lock(&pc->pc_slock); |
|
|
|
if ((pcg = pc->pc_allocfrom) == NULL) { |
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
|
if (pcg->pcg_avail != 0) { |
|
pc->pc_allocfrom = pcg; |
|
goto have_group; |
|
} |
|
} |
|
|
|
/* |
|
* No groups with any available objects. Allocate |
|
* a new object, construct it, and return it to |
|
* the caller. We will allocate a group, if necessary, |
|
* when the object is freed back to the cache. |
|
*/ |
|
simple_unlock(&pc->pc_slock); |
|
object = pool_get(pc->pc_pool, flags); |
|
if (object != NULL && pc->pc_ctor != NULL) { |
|
if ((*pc->pc_ctor)(pc->pc_arg, object, flags) != 0) { |
|
pool_put(pc->pc_pool, object); |
|
return (NULL); |
|
} |
|
} |
|
return (object); |
|
} |
|
|
|
have_group: |
|
object = pcg_get(pcg); |
|
|
|
if (pcg->pcg_avail == 0) |
|
pc->pc_allocfrom = NULL; |
|
|
|
simple_unlock(&pc->pc_slock); |
|
|
|
return (object); |
|
} |
|
|
|
/* |
|
* pool_cache_put: |
|
* |
|
* Put an object back to the pool cache. |
|
*/ |
|
void |
|
pool_cache_put(struct pool_cache *pc, void *object) |
|
{ |
|
struct pool_cache_group *pcg; |
|
|
|
simple_lock(&pc->pc_slock); |
|
|
|
if ((pcg = pc->pc_freeto) == NULL) { |
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
|
if (pcg->pcg_avail != PCG_NOBJECTS) { |
|
pc->pc_freeto = pcg; |
|
goto have_group; |
|
} |
|
} |
|
|
|
/* |
|
* No empty groups to free the object to. Attempt to |
|
* allocate one. |
|
*/ |
|
simple_unlock(&pc->pc_slock); |
|
pcg = pool_get(&pcgpool, PR_NOWAIT); |
|
if (pcg != NULL) { |
|
memset(pcg, 0, sizeof(*pcg)); |
|
simple_lock(&pc->pc_slock); |
|
TAILQ_INSERT_TAIL(&pc->pc_grouplist, pcg, pcg_list); |
|
if (pc->pc_freeto == NULL) |
|
pc->pc_freeto = pcg; |
|
goto have_group; |
|
} |
|
|
|
/* |
|
* Unable to allocate a cache group; destruct the object |
|
* and free it back to the pool. |
|
*/ |
|
if (pc->pc_dtor != NULL) |
|
(*pc->pc_dtor)(pc->pc_arg, object); |
|
pool_put(pc->pc_pool, object); |
|
return; |
|
} |
|
|
|
have_group: |
|
pcg_put(pcg, object); |
|
|
|
if (pcg->pcg_avail == PCG_NOBJECTS) |
|
pc->pc_freeto = NULL; |
|
|
|
simple_unlock(&pc->pc_slock); |
|
} |
|
|
|
/* |
|
* pool_cache_do_invalidate: |
|
* |
|
* This internal function implements pool_cache_invalidate() and |
|
* pool_cache_reclaim(). |
|
*/ |
|
static void |
|
pool_cache_do_invalidate(struct pool_cache *pc, int free_groups, |
|
void (*putit)(struct pool *, void *, const char *, long)) |
|
{ |
|
struct pool_cache_group *pcg, *npcg; |
|
void *object; |
|
|
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
pcg = npcg) { |
|
npcg = TAILQ_NEXT(pcg, pcg_list); |
|
while (pcg->pcg_avail != 0) { |
|
object = pcg_get(pcg); |
|
if (pcg->pcg_avail == 0 && pc->pc_allocfrom == pcg) |
|
pc->pc_allocfrom = NULL; |
|
if (pc->pc_dtor != NULL) |
|
(*pc->pc_dtor)(pc->pc_arg, object); |
|
(*putit)(pc->pc_pool, object, __FILE__, __LINE__); |
|
} |
|
if (free_groups) { |
|
TAILQ_REMOVE(&pc->pc_grouplist, pcg, pcg_list); |
|
if (pc->pc_freeto == pcg) |
|
pc->pc_freeto = NULL; |
|
pool_put(&pcgpool, pcg); |
|
} |
|
} |
|
} |
|
|
|
/* |
|
* pool_cache_invalidate: |
|
* |
|
* Invalidate a pool cache (destruct and release all of the |
|
* cached objects). |
|
*/ |
|
void |
|
pool_cache_invalidate(struct pool_cache *pc) |
|
{ |
|
|
|
simple_lock(&pc->pc_slock); |
|
pool_cache_do_invalidate(pc, 0, _pool_put); |
|
simple_unlock(&pc->pc_slock); |
|
} |
|
|
|
/* |
|
* pool_cache_reclaim: |
|
* |
|
* Reclaim a pool cache for pool_reclaim(). |
|
*/ |
|
static void |
|
pool_cache_reclaim(struct pool_cache *pc) |
|
{ |
|
|
|
simple_lock(&pc->pc_slock); |
|
pool_cache_do_invalidate(pc, 1, pool_do_put); |
|
simple_unlock(&pc->pc_slock); |
|
} |