version 1.46, 2000/12/07 21:30:07 |
version 1.60.4.1, 2001/10/01 12:46:55 |
Line 90 struct pool_item_header { |
|
Line 90 struct pool_item_header { |
|
caddr_t ph_page; /* this page's address */ |
caddr_t ph_page; /* this page's address */ |
struct timeval ph_time; /* last referenced */ |
struct timeval ph_time; /* last referenced */ |
}; |
}; |
|
TAILQ_HEAD(pool_pagelist,pool_item_header); |
|
|
struct pool_item { |
struct pool_item { |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
Line 103 struct pool_item { |
|
Line 104 struct pool_item { |
|
#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)) |
|
|
|
#define POOL_NEEDS_CATCHUP(pp) \ |
|
((pp)->pr_nitems < (pp)->pr_minitems) |
|
|
/* |
/* |
* Pool cache management. |
* Pool cache management. |
* |
* |
Line 145 struct pool_cache_group { |
|
Line 149 struct pool_cache_group { |
|
static void pool_cache_reclaim(struct pool_cache *); |
static void pool_cache_reclaim(struct pool_cache *); |
|
|
static int pool_catchup(struct pool *); |
static int pool_catchup(struct pool *); |
static void pool_prime_page(struct pool *, caddr_t); |
static void pool_prime_page(struct pool *, caddr_t, |
|
struct pool_item_header *); |
static void *pool_page_alloc(unsigned long, int, int); |
static void *pool_page_alloc(unsigned long, int, int); |
static void pool_page_free(void *, unsigned long, int); |
static void pool_page_free(void *, unsigned long, int); |
|
|
Line 153 static void pool_print1(struct pool *, c |
|
Line 158 static void pool_print1(struct pool *, c |
|
void (*)(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_init(). |
*/ |
*/ |
struct pool_log { |
struct pool_log { |
const char *pl_file; |
const char *pl_file; |
Line 171 struct pool_log { |
|
Line 176 struct pool_log { |
|
|
|
int pool_logsize = POOL_LOGSIZE; |
int pool_logsize = POOL_LOGSIZE; |
|
|
#ifdef DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
static __inline void |
static __inline void |
pr_log(struct pool *pp, void *v, int action, const char *file, long line) |
pr_log(struct pool *pp, void *v, int action, const char *file, long line) |
{ |
{ |
Line 268 pr_enter_check(struct pool *pp, void (*p |
|
Line 273 pr_enter_check(struct pool *pp, void (*p |
|
#define pr_enter(pp, file, line) |
#define pr_enter(pp, file, line) |
#define pr_leave(pp) |
#define pr_leave(pp) |
#define pr_enter_check(pp, pr) |
#define pr_enter_check(pp, pr) |
#endif /* DIAGNOSTIC */ |
#endif /* POOL_DIAGNOSTIC */ |
|
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on page address. |
Line 294 pr_find_pagehead(struct pool *pp, caddr_ |
|
Line 299 pr_find_pagehead(struct pool *pp, caddr_ |
|
* Remove a page from the pool. |
* Remove a page from the pool. |
*/ |
*/ |
static __inline void |
static __inline void |
pr_rmpage(struct pool *pp, struct pool_item_header *ph) |
pr_rmpage(struct pool *pp, struct pool_item_header *ph, |
|
struct pool_pagelist *pq) |
{ |
{ |
|
int s; |
|
|
/* |
/* |
* If the page was idle, decrement the idle page count. |
* If the page was idle, decrement the idle page count. |
Line 313 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 320 pr_rmpage(struct pool *pp, struct pool_i |
|
pp->pr_nitems -= pp->pr_itemsperpage; |
pp->pr_nitems -= pp->pr_itemsperpage; |
|
|
/* |
/* |
* Unlink a page from the pool and release it. |
* Unlink a page from the pool and release it (or queue it for release). |
*/ |
*/ |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
(*pp->pr_free)(ph->ph_page, pp->pr_pagesz, pp->pr_mtype); |
if (pq) { |
|
TAILQ_INSERT_HEAD(pq, ph, ph_pagelist); |
|
} else { |
|
(*pp->pr_free)(ph->ph_page, pp->pr_pagesz, pp->pr_mtype); |
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
LIST_REMOVE(ph, ph_hashlist); |
|
s = splhigh(); |
|
pool_put(&phpool, ph); |
|
splx(s); |
|
} |
|
} |
pp->pr_npages--; |
pp->pr_npages--; |
pp->pr_npagefree++; |
pp->pr_npagefree++; |
|
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
int s; |
|
LIST_REMOVE(ph, ph_hashlist); |
|
s = splhigh(); |
|
pool_put(&phpool, ph); |
|
splx(s); |
|
} |
|
|
|
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. |
* Start search from the page head, to increase the |
* Start search from the page head, to increase the |
* chance for "high water" pages to be freed. |
* chance for "high water" pages to be freed. |
*/ |
*/ |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
ph = TAILQ_NEXT(ph, ph_pagelist)) |
|
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 344 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 352 pr_rmpage(struct pool *pp, struct pool_i |
|
} |
} |
|
|
/* |
/* |
* Allocate and initialize a pool. |
|
*/ |
|
struct pool * |
|
pool_create(size_t size, u_int align, u_int ioff, int nitems, |
|
const char *wchan, size_t pagesz, |
|
void *(*alloc)(unsigned long, int, int), |
|
void (*release)(void *, unsigned long, int), |
|
int mtype) |
|
{ |
|
struct pool *pp; |
|
int flags; |
|
|
|
pp = (struct pool *)malloc(sizeof(*pp), M_POOL, M_NOWAIT); |
|
if (pp == NULL) |
|
return (NULL); |
|
|
|
flags = PR_FREEHEADER; |
|
pool_init(pp, size, align, ioff, flags, wchan, pagesz, |
|
alloc, release, mtype); |
|
|
|
if (nitems != 0) { |
|
if (pool_prime(pp, nitems, NULL) != 0) { |
|
pool_destroy(pp); |
|
return (NULL); |
|
} |
|
} |
|
|
|
return (pp); |
|
} |
|
|
|
/* |
|
* Initialize the given pool resource structure. |
* Initialize the given pool resource structure. |
* |
* |
* We export this routine to allow other kernel parts to declare |
* We export this routine to allow other kernel parts to declare |
Line 504 pool_init(struct pool *pp, size_t size, |
|
Line 481 pool_init(struct pool *pp, size_t size, |
|
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) { |
if (kmem_map == NULL || |
if (kmem_map == NULL || |
(pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log), |
(pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log), |
Line 512 pool_init(struct pool *pp, size_t size, |
|
Line 490 pool_init(struct pool *pp, size_t size, |
|
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_file = NULL; |
pp->pr_entered_line = 0; |
pp->pr_entered_line = 0; |
Line 559 pool_destroy(struct pool *pp) |
|
Line 538 pool_destroy(struct pool *pp) |
|
|
|
/* Remove all pages */ |
/* Remove all pages */ |
if ((pp->pr_roflags & PR_STATIC) == 0) |
if ((pp->pr_roflags & PR_STATIC) == 0) |
while ((ph = pp->pr_pagelist.tqh_first) != NULL) |
while ((ph = TAILQ_FIRST(&pp->pr_pagelist)) != NULL) |
pr_rmpage(pp, ph); |
pr_rmpage(pp, ph, NULL); |
|
|
/* Remove from global pool list */ |
/* Remove from global pool list */ |
simple_lock(&pool_head_slock); |
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? */ |
if (drainpp == pp) { |
drainpp = NULL; |
drainpp = NULL; |
|
} |
simple_unlock(&pool_head_slock); |
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); |
} |
} |
|
|
|
static __inline struct pool_item_header * |
|
pool_alloc_item_header(struct pool *pp, caddr_t storage, int flags) |
|
{ |
|
struct pool_item_header *ph; |
|
int s; |
|
|
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock) == 0); |
|
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) |
|
ph = (struct pool_item_header *) (storage + pp->pr_phoffset); |
|
else { |
|
s = splhigh(); |
|
ph = pool_get(&phpool, flags); |
|
splx(s); |
|
} |
|
|
|
return (ph); |
|
} |
|
|
/* |
/* |
* 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 * |
|
#ifdef POOL_DIAGNOSTIC |
_pool_get(struct pool *pp, int flags, const char *file, long line) |
_pool_get(struct pool *pp, int flags, const char *file, long line) |
|
#else |
|
pool_get(struct pool *pp, int flags) |
|
#endif |
{ |
{ |
void *v; |
|
struct pool_item *pi; |
struct pool_item *pi; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
|
void *v; |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (__predict_false((pp->pr_roflags & PR_STATIC) && |
if (__predict_false((pp->pr_roflags & PR_STATIC) && |
Line 593 _pool_get(struct pool *pp, int flags, co |
|
Line 597 _pool_get(struct pool *pp, int flags, co |
|
pr_printlog(pp, NULL, printf); |
pr_printlog(pp, NULL, printf); |
panic("pool_get: static"); |
panic("pool_get: static"); |
} |
} |
#endif |
|
|
|
if (__predict_false(curproc == NULL && doing_shutdown == 0 && |
if (__predict_false(curproc == NULL && doing_shutdown == 0 && |
(flags & PR_WAITOK) != 0)) |
(flags & PR_WAITOK) != 0)) |
panic("pool_get: must have NOWAIT"); |
panic("pool_get: must have NOWAIT"); |
|
|
|
#ifdef LOCKDEBUG |
|
if (flags & PR_WAITOK) |
|
simple_lock_only_held(NULL, "pool_get(PR_WAITOK)"); |
|
#endif |
|
#endif /* DIAGNOSTIC */ |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
Line 653 _pool_get(struct pool *pp, int flags, co |
|
Line 662 _pool_get(struct pool *pp, int flags, co |
|
* has no items in its bucket. |
* has no items in its bucket. |
*/ |
*/ |
if ((ph = pp->pr_curpage) == NULL) { |
if ((ph = pp->pr_curpage) == NULL) { |
void *v; |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nitems != 0) { |
if (pp->pr_nitems != 0) { |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
Line 672 _pool_get(struct pool *pp, int flags, co |
|
Line 679 _pool_get(struct pool *pp, int flags, co |
|
pr_leave(pp); |
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); |
|
if (__predict_true(v != NULL)) |
|
ph = pool_alloc_item_header(pp, v, flags); |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
if (v == NULL) { |
if (__predict_false(v == NULL || ph == NULL)) { |
|
if (v != NULL) |
|
(*pp->pr_free)(v, pp->pr_pagesz, pp->pr_mtype); |
|
|
/* |
/* |
* We were unable to allocate a page, but |
* We were unable to allocate a page or item |
* we released the lock during allocation, |
* header, but we released the lock during |
* so perhaps items were freed back to the |
* allocation, so perhaps items were freed |
* pool. Check for this case. |
* back to the pool. Check for this case. |
*/ |
*/ |
if (pp->pr_curpage != NULL) |
if (pp->pr_curpage != NULL) |
goto startover; |
goto startover; |
Line 714 _pool_get(struct pool *pp, int flags, co |
|
Line 726 _pool_get(struct pool *pp, int flags, co |
|
} |
} |
|
|
/* We have more memory; add it to the pool */ |
/* We have more memory; add it to the pool */ |
|
pool_prime_page(pp, v, ph); |
pp->pr_npagealloc++; |
pp->pr_npagealloc++; |
pool_prime_page(pp, v); |
|
|
|
/* Start the allocation process over. */ |
/* Start the allocation process over. */ |
goto startover; |
goto startover; |
Line 734 _pool_get(struct pool *pp, int flags, co |
|
Line 746 _pool_get(struct pool *pp, int flags, co |
|
pp->pr_wchan, pp->pr_nitems); |
pp->pr_wchan, pp->pr_nitems); |
panic("pool_get: nitems inconsistent\n"); |
panic("pool_get: nitems inconsistent\n"); |
} |
} |
#endif |
|
pr_log(pp, v, PRLOG_GET, file, line); |
pr_log(pp, v, PRLOG_GET, file, line); |
|
|
#ifdef DIAGNOSTIC |
|
if (__predict_false(pi->pi_magic != PI_MAGIC)) { |
if (__predict_false(pi->pi_magic != PI_MAGIC)) { |
pr_printlog(pp, pi, printf); |
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;" |
Line 782 _pool_get(struct pool *pp, int flags, co |
|
Line 793 _pool_get(struct pool *pp, int flags, co |
|
*/ |
*/ |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist); |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
ph = TAILQ_NEXT(ph, ph_pagelist)) |
|
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 796 _pool_get(struct pool *pp, int flags, co |
|
Line 806 _pool_get(struct pool *pp, int flags, co |
|
* If we have a low water mark and we are now below that low |
* If we have a low water mark and we are now below that low |
* water mark, add more items to the pool. |
* water mark, add more items to the pool. |
*/ |
*/ |
if (pp->pr_nitems < pp->pr_minitems && pool_catchup(pp) != 0) { |
if (POOL_NEEDS_CATCHUP(pp) && 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 813 _pool_get(struct pool *pp, int flags, co |
|
Line 823 _pool_get(struct pool *pp, int flags, co |
|
* Internal version of pool_put(). Pool is already locked/entered. |
* Internal version of pool_put(). Pool is already locked/entered. |
*/ |
*/ |
static void |
static void |
pool_do_put(struct pool *pp, void *v, const char *file, long line) |
pool_do_put(struct pool *pp, void *v) |
{ |
{ |
struct pool_item *pi = v; |
struct pool_item *pi = v; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
caddr_t page; |
caddr_t page; |
int s; |
int s; |
|
|
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
|
|
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
page = (caddr_t)((u_long)v & pp->pr_pagemask); |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
Line 830 pool_do_put(struct pool *pp, void *v, co |
|
Line 842 pool_do_put(struct pool *pp, void *v, co |
|
} |
} |
#endif |
#endif |
|
|
pr_log(pp, v, PRLOG_PUT, file, line); |
|
|
|
if (__predict_false((ph = pr_find_pagehead(pp, page)) == NULL)) { |
if (__predict_false((ph = pr_find_pagehead(pp, page)) == NULL)) { |
pr_printlog(pp, NULL, printf); |
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); |
Line 895 pool_do_put(struct pool *pp, void *v, co |
|
Line 905 pool_do_put(struct pool *pp, void *v, co |
|
if (ph->ph_nmissing == 0) { |
if (ph->ph_nmissing == 0) { |
pp->pr_nidle++; |
pp->pr_nidle++; |
if (pp->pr_npages > pp->pr_maxpages) { |
if (pp->pr_npages > pp->pr_maxpages) { |
pr_rmpage(pp, ph); |
pr_rmpage(pp, ph, NULL); |
} else { |
} else { |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_INSERT_TAIL(&pp->pr_pagelist, ph, ph_pagelist); |
Line 918 pool_do_put(struct pool *pp, void *v, co |
|
Line 928 pool_do_put(struct pool *pp, void *v, co |
|
* page with the fewest available items, to minimize |
* page with the fewest available items, to minimize |
* fragmentation? |
* fragmentation? |
*/ |
*/ |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
ph = TAILQ_NEXT(ph, ph_pagelist)) |
|
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 942 pool_do_put(struct pool *pp, void *v, co |
|
Line 951 pool_do_put(struct pool *pp, void *v, co |
|
/* |
/* |
* 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(struct pool *pp, void *v, const char *file, long line) |
_pool_put(struct pool *pp, void *v, const char *file, long line) |
{ |
{ |
Line 949 _pool_put(struct pool *pp, void *v, cons |
|
Line 959 _pool_put(struct pool *pp, void *v, cons |
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
pool_do_put(pp, v, file, line); |
pr_log(pp, v, PRLOG_PUT, file, line); |
|
|
|
pool_do_put(pp, v); |
|
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
|
#undef pool_put |
|
#endif /* POOL_DIAGNOSTIC */ |
|
|
|
void |
|
pool_put(struct pool *pp, void *v) |
|
{ |
|
|
|
simple_lock(&pp->pr_slock); |
|
|
|
pool_do_put(pp, v); |
|
|
|
simple_unlock(&pp->pr_slock); |
|
} |
|
|
|
#ifdef POOL_DIAGNOSTIC |
|
#define pool_put(h, v) _pool_put((h), (v), __FILE__, __LINE__) |
|
#endif |
|
|
/* |
/* |
* Add N items to the pool. |
* Add N items to the pool. |
*/ |
*/ |
int |
int |
pool_prime(struct pool *pp, int n, caddr_t storage) |
pool_prime(struct pool *pp, int n) |
{ |
{ |
|
struct pool_item_header *ph; |
caddr_t cp; |
caddr_t cp; |
int newnitems, newpages; |
int newpages, error = 0; |
|
|
#ifdef DIAGNOSTIC |
|
if (__predict_false(storage && !(pp->pr_roflags & PR_STATIC))) |
|
panic("pool_prime: static"); |
|
/* !storage && static caught below */ |
|
#endif |
|
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
|
newnitems = pp->pr_minitems + n; |
newpages = roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage; |
newpages = |
|
roundup(newnitems, pp->pr_itemsperpage) / pp->pr_itemsperpage |
|
- pp->pr_minpages; |
|
|
|
while (newpages-- > 0) { |
while (newpages-- > 0) { |
if (pp->pr_roflags & PR_STATIC) { |
simple_unlock(&pp->pr_slock); |
cp = storage; |
cp = (*pp->pr_alloc)(pp->pr_pagesz, PR_NOWAIT, pp->pr_mtype); |
storage += pp->pr_pagesz; |
if (__predict_true(cp != NULL)) |
} else { |
ph = pool_alloc_item_header(pp, cp, PR_NOWAIT); |
simple_unlock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype); |
|
simple_lock(&pp->pr_slock); |
|
} |
|
|
|
if (cp == NULL) { |
if (__predict_false(cp == NULL || ph == NULL)) { |
simple_unlock(&pp->pr_slock); |
error = ENOMEM; |
return (ENOMEM); |
if (cp != NULL) |
|
(*pp->pr_free)(cp, pp->pr_pagesz, pp->pr_mtype); |
|
break; |
} |
} |
|
|
|
pool_prime_page(pp, cp, ph); |
pp->pr_npagealloc++; |
pp->pr_npagealloc++; |
pool_prime_page(pp, cp); |
|
pp->pr_minpages++; |
pp->pr_minpages++; |
} |
} |
|
|
pp->pr_minitems = newnitems; |
|
|
|
if (pp->pr_minpages >= pp->pr_maxpages) |
if (pp->pr_minpages >= pp->pr_maxpages) |
pp->pr_maxpages = pp->pr_minpages + 1; /* XXX */ |
pp->pr_maxpages = pp->pr_minpages + 1; /* XXX */ |
|
|
Line 1012 pool_prime(struct pool *pp, int n, caddr |
|
Line 1030 pool_prime(struct pool *pp, int n, caddr |
|
* 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(struct pool *pp, caddr_t storage) |
pool_prime_page(struct pool *pp, caddr_t storage, struct pool_item_header *ph) |
{ |
{ |
struct pool_item *pi; |
struct pool_item *pi; |
struct pool_item_header *ph; |
|
caddr_t cp = storage; |
caddr_t cp = storage; |
unsigned int align = pp->pr_align; |
unsigned int align = pp->pr_align; |
unsigned int ioff = pp->pr_itemoffset; |
unsigned int ioff = pp->pr_itemoffset; |
int s, n; |
int n; |
|
|
if (((u_long)cp & (pp->pr_pagesz - 1)) != 0) |
if (((u_long)cp & (pp->pr_pagesz - 1)) != 0) |
panic("pool_prime_page: %s: unaligned page", pp->pr_wchan); |
panic("pool_prime_page: %s: unaligned page", pp->pr_wchan); |
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) { |
if ((pp->pr_roflags & PR_PHINPAGE) == 0) |
ph = (struct pool_item_header *)(cp + pp->pr_phoffset); |
|
} else { |
|
s = splhigh(); |
|
ph = pool_get(&phpool, PR_URGENT); |
|
splx(s); |
|
LIST_INSERT_HEAD(&pp->pr_hashtab[PR_HASH_INDEX(pp, cp)], |
LIST_INSERT_HEAD(&pp->pr_hashtab[PR_HASH_INDEX(pp, cp)], |
ph, ph_hashlist); |
ph, ph_hashlist); |
} |
|
|
|
/* |
/* |
* Insert page header. |
* Insert page header. |
Line 1086 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1097 pool_prime_page(struct pool *pp, caddr_t |
|
} |
} |
|
|
/* |
/* |
* Like pool_prime(), except this is used by pool_get() when nitems |
* Used by pool_get() when nitems drops below the low water mark. This |
* drops below the low water mark. This is used to catch up nitmes |
* is used to catch up nitmes with the low water mark. |
* with the low water mark. |
|
* |
* |
* Note 1, we never wait for memory here, we let the caller decide what to do. |
* Note 1, we never wait for memory here, we let the caller decide what to do. |
* |
* |
Line 1100 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1110 pool_prime_page(struct pool *pp, caddr_t |
|
static int |
static int |
pool_catchup(struct pool *pp) |
pool_catchup(struct pool *pp) |
{ |
{ |
|
struct pool_item_header *ph; |
caddr_t cp; |
caddr_t cp; |
int error = 0; |
int error = 0; |
|
|
Line 1115 pool_catchup(struct pool *pp) |
|
Line 1126 pool_catchup(struct pool *pp) |
|
return (0); |
return (0); |
} |
} |
|
|
while (pp->pr_nitems < pp->pr_minitems) { |
while (POOL_NEEDS_CATCHUP(pp)) { |
/* |
/* |
* Call the page back-end allocator for more memory. |
* Call the page back-end allocator for more memory. |
* |
* |
Line 1123 pool_catchup(struct pool *pp) |
|
Line 1134 pool_catchup(struct pool *pp) |
|
* the pool descriptor? |
* the pool descriptor? |
*/ |
*/ |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype); |
cp = (*pp->pr_alloc)(pp->pr_pagesz, PR_NOWAIT, pp->pr_mtype); |
|
if (__predict_true(cp != NULL)) |
|
ph = pool_alloc_item_header(pp, cp, PR_NOWAIT); |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
if (__predict_false(cp == NULL)) { |
if (__predict_false(cp == NULL || ph == NULL)) { |
|
if (cp != NULL) |
|
(*pp->pr_free)(cp, pp->pr_pagesz, pp->pr_mtype); |
error = ENOMEM; |
error = ENOMEM; |
break; |
break; |
} |
} |
|
pool_prime_page(pp, cp, ph); |
pp->pr_npagealloc++; |
pp->pr_npagealloc++; |
pool_prime_page(pp, cp); |
|
} |
} |
|
|
return (error); |
return (error); |
Line 1149 pool_setlowat(struct pool *pp, int n) |
|
Line 1164 pool_setlowat(struct pool *pp, int 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 ((pp->pr_nitems < pp->pr_minitems) && |
if (POOL_NEEDS_CATCHUP(pp) && (error = pool_catchup(pp) != 0)) { |
(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 1240 pool_page_free_nointr(void *v, unsigned |
|
Line 1254 pool_page_free_nointr(void *v, unsigned |
|
* Release all complete pages that have not been used recently. |
* Release all complete pages that have not been used recently. |
*/ |
*/ |
void |
void |
|
#ifdef POOL_DIAGNOSTIC |
_pool_reclaim(struct pool *pp, const char *file, long line) |
_pool_reclaim(struct pool *pp, const char *file, long line) |
|
#else |
|
pool_reclaim(struct pool *pp) |
|
#endif |
{ |
{ |
struct pool_item_header *ph, *phnext; |
struct pool_item_header *ph, *phnext; |
struct pool_cache *pc; |
struct pool_cache *pc; |
struct timeval curtime; |
struct timeval curtime; |
|
struct pool_pagelist pq; |
int s; |
int s; |
|
|
if (pp->pr_roflags & PR_STATIC) |
if (pp->pr_roflags & PR_STATIC) |
Line 1253 _pool_reclaim(struct pool *pp, const cha |
|
Line 1272 _pool_reclaim(struct pool *pp, const cha |
|
if (simple_lock_try(&pp->pr_slock) == 0) |
if (simple_lock_try(&pp->pr_slock) == 0) |
return; |
return; |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
TAILQ_INIT(&pq); |
|
|
/* |
/* |
* Reclaim items from the pool's caches. |
* Reclaim items from the pool's caches. |
*/ |
*/ |
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
TAILQ_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
pc = TAILQ_NEXT(pc, pc_poollist)) |
|
pool_cache_reclaim(pc); |
pool_cache_reclaim(pc); |
|
|
s = splclock(); |
s = splclock(); |
Line 1286 _pool_reclaim(struct pool *pp, const cha |
|
Line 1305 _pool_reclaim(struct pool *pp, const cha |
|
pp->pr_minitems) |
pp->pr_minitems) |
break; |
break; |
|
|
pr_rmpage(pp, ph); |
pr_rmpage(pp, ph, &pq); |
} |
} |
} |
} |
|
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
if (TAILQ_EMPTY(&pq)) { |
|
return; |
|
} |
|
while ((ph = TAILQ_FIRST(&pq)) != NULL) { |
|
TAILQ_REMOVE(&pq, ph, ph_pagelist); |
|
(*pp->pr_free)(ph->ph_page, pp->pr_pagesz, pp->pr_mtype); |
|
if (pp->pr_roflags & PR_PHINPAGE) { |
|
continue; |
|
} |
|
LIST_REMOVE(ph, ph_hashlist); |
|
s = splhigh(); |
|
pool_put(&phpool, ph); |
|
splx(s); |
|
} |
} |
} |
|
|
|
|
Line 1306 pool_drain(void *arg) |
|
Line 1339 pool_drain(void *arg) |
|
struct pool *pp; |
struct pool *pp; |
int s; |
int s; |
|
|
s = splimp(); |
pp = NULL; |
|
s = splvm(); |
simple_lock(&pool_head_slock); |
simple_lock(&pool_head_slock); |
|
if (drainpp == NULL) { |
if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL) |
drainpp = TAILQ_FIRST(&pool_head); |
goto out; |
} |
|
if (drainpp) { |
pp = drainpp; |
pp = drainpp; |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
|
} |
pool_reclaim(pp); |
|
|
|
out: |
|
simple_unlock(&pool_head_slock); |
simple_unlock(&pool_head_slock); |
splx(s); |
splx(s); |
|
|
|
pool_reclaim(pp); |
} |
} |
|
|
|
|
Line 1331 pool_print(struct pool *pp, const char * |
|
Line 1364 pool_print(struct pool *pp, const char * |
|
{ |
{ |
int s; |
int s; |
|
|
s = splimp(); |
s = splvm(); |
if (simple_lock_try(&pp->pr_slock) == 0) { |
if (simple_lock_try(&pp->pr_slock) == 0) { |
printf("pool %s is locked; try again later\n", |
printf("pool %s is locked; try again later\n", |
pp->pr_wchan); |
pp->pr_wchan); |
Line 1421 pool_print1(struct pool *pp, const char |
|
Line 1454 pool_print1(struct pool *pp, const char |
|
(u_long)ph->ph_time.tv_sec, |
(u_long)ph->ph_time.tv_sec, |
(u_long)ph->ph_time.tv_usec); |
(u_long)ph->ph_time.tv_usec); |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL; |
TAILQ_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
pi = TAILQ_NEXT(pi, pi_list)) { |
|
if (pi->pi_magic != PI_MAGIC) { |
if (pi->pi_magic != PI_MAGIC) { |
(*pr)("\t\t\titem %p, magic 0x%x\n", |
(*pr)("\t\t\titem %p, magic 0x%x\n", |
pi, pi->pi_magic); |
pi, pi->pi_magic); |
Line 1451 pool_print1(struct pool *pp, const char |
|
Line 1483 pool_print1(struct pool *pp, const char |
|
if (print_cache == 0) |
if (print_cache == 0) |
goto skip_cache; |
goto skip_cache; |
|
|
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
TAILQ_FOREACH(pc, &pp->pr_cachelist, pc_poollist) { |
pc = TAILQ_NEXT(pc, pc_poollist)) { |
|
(*pr)("\tcache %p: allocfrom %p freeto %p\n", pc, |
(*pr)("\tcache %p: allocfrom %p freeto %p\n", pc, |
pc->pc_allocfrom, pc->pc_freeto); |
pc->pc_allocfrom, pc->pc_freeto); |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
(*pr)("\t hits %lu misses %lu ngroups %lu nitems %lu\n", |
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems); |
|
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); |
for (i = 0; i < PCG_NOBJECTS; i++) |
for (i = 0; i < PCG_NOBJECTS; i++) |
(*pr)("\t\t\t%p\n", pcg->pcg_objects[i]); |
(*pr)("\t\t\t%p\n", pcg->pcg_objects[i]); |
Line 1476 pool_chk(struct pool *pp, const char *la |
|
Line 1508 pool_chk(struct pool *pp, const char *la |
|
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
|
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) { |
ph = TAILQ_NEXT(ph, ph_pagelist)) { |
|
|
|
struct pool_item *pi; |
struct pool_item *pi; |
int n; |
int n; |
caddr_t page; |
caddr_t page; |
Line 1557 pool_cache_init(struct pool_cache *pc, s |
|
Line 1587 pool_cache_init(struct pool_cache *pc, s |
|
pc->pc_dtor = dtor; |
pc->pc_dtor = dtor; |
pc->pc_arg = arg; |
pc->pc_arg = arg; |
|
|
|
pc->pc_hits = 0; |
|
pc->pc_misses = 0; |
|
|
|
pc->pc_ngroups = 0; |
|
|
|
pc->pc_nitems = 0; |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
TAILQ_INSERT_TAIL(&pp->pr_cachelist, pc, pc_poollist); |
TAILQ_INSERT_TAIL(&pp->pr_cachelist, pc, pc_poollist); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
Line 1621 pool_cache_get(struct pool_cache *pc, in |
|
Line 1658 pool_cache_get(struct pool_cache *pc, in |
|
struct pool_cache_group *pcg; |
struct pool_cache_group *pcg; |
void *object; |
void *object; |
|
|
|
#ifdef LOCKDEBUG |
|
if (flags & PR_WAITOK) |
|
simple_lock_only_held(NULL, "pool_cache_get(PR_WAITOK)"); |
|
#endif |
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
|
|
if ((pcg = pc->pc_allocfrom) == NULL) { |
if ((pcg = pc->pc_allocfrom) == NULL) { |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
|
if (pcg->pcg_avail != 0) { |
if (pcg->pcg_avail != 0) { |
pc->pc_allocfrom = pcg; |
pc->pc_allocfrom = pcg; |
goto have_group; |
goto have_group; |
Line 1638 pool_cache_get(struct pool_cache *pc, in |
|
Line 1679 pool_cache_get(struct pool_cache *pc, in |
|
* the caller. We will allocate a group, if necessary, |
* the caller. We will allocate a group, if necessary, |
* when the object is freed back to the cache. |
* when the object is freed back to the cache. |
*/ |
*/ |
|
pc->pc_misses++; |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
object = pool_get(pc->pc_pool, flags); |
object = pool_get(pc->pc_pool, flags); |
if (object != NULL && pc->pc_ctor != NULL) { |
if (object != NULL && pc->pc_ctor != NULL) { |
Line 1650 pool_cache_get(struct pool_cache *pc, in |
|
Line 1692 pool_cache_get(struct pool_cache *pc, in |
|
} |
} |
|
|
have_group: |
have_group: |
|
pc->pc_hits++; |
|
pc->pc_nitems--; |
object = pcg_get(pcg); |
object = pcg_get(pcg); |
|
|
if (pcg->pcg_avail == 0) |
if (pcg->pcg_avail == 0) |
|
|
pool_cache_put(struct pool_cache *pc, void *object) |
pool_cache_put(struct pool_cache *pc, void *object) |
{ |
{ |
struct pool_cache_group *pcg; |
struct pool_cache_group *pcg; |
|
int s; |
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
|
|
if ((pcg = pc->pc_freeto) == NULL) { |
if ((pcg = pc->pc_freeto) == NULL) { |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
pcg = TAILQ_NEXT(pcg, pcg_list)) { |
|
if (pcg->pcg_avail != PCG_NOBJECTS) { |
if (pcg->pcg_avail != PCG_NOBJECTS) { |
pc->pc_freeto = pcg; |
pc->pc_freeto = pcg; |
goto have_group; |
goto have_group; |
Line 1683 pool_cache_put(struct pool_cache *pc, vo |
|
Line 1727 pool_cache_put(struct pool_cache *pc, vo |
|
|
|
/* |
/* |
* No empty groups to free the object to. Attempt to |
* No empty groups to free the object to. Attempt to |
* allocate one. We don't unlock the cache here, since |
* allocate one. |
* we never block. |
|
*/ |
*/ |
|
simple_unlock(&pc->pc_slock); |
|
s = splvm(); |
pcg = pool_get(&pcgpool, PR_NOWAIT); |
pcg = pool_get(&pcgpool, PR_NOWAIT); |
|
splx(s); |
if (pcg != NULL) { |
if (pcg != NULL) { |
memset(pcg, 0, sizeof(*pcg)); |
memset(pcg, 0, sizeof(*pcg)); |
|
simple_lock(&pc->pc_slock); |
|
pc->pc_ngroups++; |
TAILQ_INSERT_TAIL(&pc->pc_grouplist, pcg, pcg_list); |
TAILQ_INSERT_TAIL(&pc->pc_grouplist, pcg, pcg_list); |
pc->pc_freeto = pcg; |
if (pc->pc_freeto == NULL) |
|
pc->pc_freeto = pcg; |
goto have_group; |
goto have_group; |
} |
} |
|
|
simple_unlock(&pc->pc_slock); |
|
|
|
/* |
/* |
* Unable to allocate a cache group; destruct the object |
* Unable to allocate a cache group; destruct the object |
* and free it back to the pool. |
* and free it back to the pool. |
*/ |
*/ |
if (pc->pc_dtor != NULL) |
pool_cache_destruct_object(pc, object); |
(*pc->pc_dtor)(pc->pc_arg, object); |
|
pool_put(pc->pc_pool, object); |
|
return; |
return; |
} |
} |
|
|
have_group: |
have_group: |
|
pc->pc_nitems++; |
pcg_put(pcg, object); |
pcg_put(pcg, object); |
|
|
if (pcg->pcg_avail == PCG_NOBJECTS) |
if (pcg->pcg_avail == PCG_NOBJECTS) |
Line 1716 pool_cache_put(struct pool_cache *pc, vo |
|
Line 1762 pool_cache_put(struct pool_cache *pc, vo |
|
} |
} |
|
|
/* |
/* |
|
* pool_cache_destruct_object: |
|
* |
|
* Force destruction of an object and its release back into |
|
* the pool. |
|
*/ |
|
void |
|
pool_cache_destruct_object(struct pool_cache *pc, void *object) |
|
{ |
|
|
|
if (pc->pc_dtor != NULL) |
|
(*pc->pc_dtor)(pc->pc_arg, object); |
|
pool_put(pc->pc_pool, object); |
|
} |
|
|
|
/* |
* pool_cache_do_invalidate: |
* pool_cache_do_invalidate: |
* |
* |
* This internal function implements pool_cache_invalidate() and |
* This internal function implements pool_cache_invalidate() and |
Line 1723 pool_cache_put(struct pool_cache *pc, vo |
|
Line 1784 pool_cache_put(struct pool_cache *pc, vo |
|
*/ |
*/ |
static void |
static void |
pool_cache_do_invalidate(struct pool_cache *pc, int free_groups, |
pool_cache_do_invalidate(struct pool_cache *pc, int free_groups, |
void (*putit)(struct pool *, void *, const char *, long)) |
void (*putit)(struct pool *, void *)) |
{ |
{ |
struct pool_cache_group *pcg, *npcg; |
struct pool_cache_group *pcg, *npcg; |
void *object; |
void *object; |
|
int s; |
|
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
pcg = npcg) { |
pcg = npcg) { |
npcg = TAILQ_NEXT(pcg, pcg_list); |
npcg = TAILQ_NEXT(pcg, pcg_list); |
while (pcg->pcg_avail != 0) { |
while (pcg->pcg_avail != 0) { |
|
pc->pc_nitems--; |
object = pcg_get(pcg); |
object = pcg_get(pcg); |
if (pcg->pcg_avail == 0 && pc->pc_allocfrom == pcg) |
if (pcg->pcg_avail == 0 && pc->pc_allocfrom == pcg) |
pc->pc_allocfrom = NULL; |
pc->pc_allocfrom = NULL; |
if (pc->pc_dtor != NULL) |
if (pc->pc_dtor != NULL) |
(*pc->pc_dtor)(pc->pc_arg, object); |
(*pc->pc_dtor)(pc->pc_arg, object); |
(*putit)(pc->pc_pool, object, __FILE__, __LINE__); |
(*putit)(pc->pc_pool, object); |
} |
} |
if (free_groups) { |
if (free_groups) { |
|
pc->pc_ngroups--; |
TAILQ_REMOVE(&pc->pc_grouplist, pcg, pcg_list); |
TAILQ_REMOVE(&pc->pc_grouplist, pcg, pcg_list); |
if (pc->pc_freeto == pcg) |
if (pc->pc_freeto == pcg) |
pc->pc_freeto = NULL; |
pc->pc_freeto = NULL; |
|
s = splvm(); |
pool_put(&pcgpool, pcg); |
pool_put(&pcgpool, pcg); |
|
splx(s); |
} |
} |
} |
} |
} |
} |
Line 1759 pool_cache_invalidate(struct pool_cache |
|
Line 1825 pool_cache_invalidate(struct pool_cache |
|
{ |
{ |
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
pool_cache_do_invalidate(pc, 0, _pool_put); |
pool_cache_do_invalidate(pc, 0, pool_put); |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
} |
} |
|
|
|
|
pool_cache_reclaim(struct pool_cache *pc) |
pool_cache_reclaim(struct pool_cache *pc) |
{ |
{ |
|
|
/* |
simple_lock(&pc->pc_slock); |
* We're locking in the opposite order (pool already |
|
* locked in pool_reclaim()), so use a try-lock instead. |
|
*/ |
|
|
|
if (simple_lock_try(&pc->pc_slock) == 0) |
|
return; |
|
pool_cache_do_invalidate(pc, 1, pool_do_put); |
pool_cache_do_invalidate(pc, 1, pool_do_put); |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
} |
} |