version 1.50.2.3, 2001/09/26 19:55:05 |
version 1.56, 2001/05/13 17:06:59 |
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 176 struct pool_log { |
|
Line 175 struct pool_log { |
|
|
|
int pool_logsize = POOL_LOGSIZE; |
int pool_logsize = POOL_LOGSIZE; |
|
|
#ifdef POOL_DIAGNOSTIC |
#ifdef 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 273 pr_enter_check(struct pool *pp, void (*p |
|
Line 272 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 /* POOL_DIAGNOSTIC */ |
#endif /* DIAGNOSTIC */ |
|
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on page address. |
Line 299 pr_find_pagehead(struct pool *pp, caddr_ |
|
Line 298 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 320 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 317 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 (or queue it for release). |
* Unlink a page from the pool and release it. |
*/ |
*/ |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
TAILQ_REMOVE(&pp->pr_pagelist, ph, ph_pagelist); |
if (pq) { |
(*pp->pr_free)(ph->ph_page, pp->pr_pagesz, pp->pr_mtype); |
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. |
*/ |
*/ |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
|
ph = TAILQ_NEXT(ph, ph_pagelist)) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 481 pool_init(struct pool *pp, size_t size, |
|
Line 477 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 490 pool_init(struct pool *pp, size_t size, |
|
Line 485 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 538 pool_destroy(struct pool *pp) |
|
Line 532 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 = TAILQ_FIRST(&pp->pr_pagelist)) != NULL) |
while ((ph = pp->pr_pagelist.tqh_first) != NULL) |
pr_rmpage(pp, ph, NULL); |
pr_rmpage(pp, ph); |
|
|
/* 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); |
if (drainpp == pp) { |
/* XXX Only clear this if we were drainpp? */ |
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); |
Line 581 pool_alloc_item_header(struct pool *pp, |
|
Line 572 pool_alloc_item_header(struct pool *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 * |
#ifdef POOL_DIAGNOSTIC |
#ifdef 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 |
#else |
pool_get(struct pool *pp, int flags) |
pool_get(struct pool *pp, int flags) |
Line 601 pool_get(struct pool *pp, int flags) |
|
Line 592 pool_get(struct pool *pp, int flags) |
|
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 |
#endif /* DIAGNOSTIC */ |
|
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
Line 793 pool_get(struct pool *pp, int flags) |
|
Line 779 pool_get(struct pool *pp, int flags) |
|
*/ |
*/ |
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); |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
|
ph = TAILQ_NEXT(ph, ph_pagelist)) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 830 pool_do_put(struct pool *pp, void *v) |
|
Line 817 pool_do_put(struct pool *pp, void *v) |
|
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 905 pool_do_put(struct pool *pp, void *v) |
|
Line 890 pool_do_put(struct pool *pp, void *v) |
|
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, NULL); |
pr_rmpage(pp, ph); |
} 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 928 pool_do_put(struct pool *pp, void *v) |
|
Line 913 pool_do_put(struct pool *pp, void *v) |
|
* page with the fewest available items, to minimize |
* page with the fewest available items, to minimize |
* fragmentation? |
* fragmentation? |
*/ |
*/ |
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
|
ph = TAILQ_NEXT(ph, ph_pagelist)) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
if (TAILQ_FIRST(&ph->ph_itemlist) != NULL) |
break; |
break; |
|
|
Line 951 pool_do_put(struct pool *pp, void *v) |
|
Line 937 pool_do_put(struct pool *pp, void *v) |
|
/* |
/* |
* 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 |
#ifdef 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 966 _pool_put(struct pool *pp, void *v, cons |
|
Line 952 _pool_put(struct pool *pp, void *v, cons |
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
#undef pool_put |
|
#endif /* POOL_DIAGNOSTIC */ |
|
|
|
|
#else |
void |
void |
pool_put(struct pool *pp, void *v) |
pool_put(struct pool *pp, void *v) |
{ |
{ |
Line 979 pool_put(struct pool *pp, void *v) |
|
Line 964 pool_put(struct pool *pp, void *v) |
|
|
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
|
|
#ifdef POOL_DIAGNOSTIC |
|
#define pool_put(h, v) _pool_put((h), (v), __FILE__, __LINE__) |
|
#endif |
#endif |
|
|
/* |
/* |
Line 1254 pool_page_free_nointr(void *v, unsigned |
|
Line 1236 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 |
#ifdef DIAGNOSTIC |
_pool_reclaim(struct pool *pp, const char *file, long line) |
_pool_reclaim(struct pool *pp, const char *file, long line) |
#else |
#else |
pool_reclaim(struct pool *pp) |
pool_reclaim(struct pool *pp) |
Line 1263 pool_reclaim(struct pool *pp) |
|
Line 1245 pool_reclaim(struct pool *pp) |
|
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 1272 pool_reclaim(struct pool *pp) |
|
Line 1253 pool_reclaim(struct pool *pp) |
|
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. |
*/ |
*/ |
TAILQ_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
|
pc = TAILQ_NEXT(pc, pc_poollist)) |
pool_cache_reclaim(pc); |
pool_cache_reclaim(pc); |
|
|
s = splclock(); |
s = splclock(); |
Line 1305 pool_reclaim(struct pool *pp) |
|
Line 1286 pool_reclaim(struct pool *pp) |
|
pp->pr_minitems) |
pp->pr_minitems) |
break; |
break; |
|
|
pr_rmpage(pp, ph, &pq); |
pr_rmpage(pp, ph); |
} |
} |
} |
} |
|
|
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 1339 pool_drain(void *arg) |
|
Line 1306 pool_drain(void *arg) |
|
struct pool *pp; |
struct pool *pp; |
int s; |
int s; |
|
|
pp = NULL; |
|
s = splvm(); |
s = splvm(); |
simple_lock(&pool_head_slock); |
simple_lock(&pool_head_slock); |
if (drainpp == NULL) { |
|
drainpp = TAILQ_FIRST(&pool_head); |
if (drainpp == NULL && (drainpp = TAILQ_FIRST(&pool_head)) == NULL) |
} |
goto out; |
if (drainpp) { |
|
pp = drainpp; |
pp = drainpp; |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
} |
|
simple_unlock(&pool_head_slock); |
|
splx(s); |
|
|
|
pool_reclaim(pp); |
pool_reclaim(pp); |
|
|
|
out: |
|
simple_unlock(&pool_head_slock); |
|
splx(s); |
} |
} |
|
|
|
|
Line 1454 pool_print1(struct pool *pp, const char |
|
Line 1421 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 |
TAILQ_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL; |
|
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 1483 pool_print1(struct pool *pp, const char |
|
Line 1451 pool_print1(struct pool *pp, const char |
|
if (print_cache == 0) |
if (print_cache == 0) |
goto skip_cache; |
goto skip_cache; |
|
|
TAILQ_FOREACH(pc, &pp->pr_cachelist, pc_poollist) { |
for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL; |
|
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); |
(*pr)("\t hits %lu misses %lu ngroups %lu nitems %lu\n", |
(*pr)("\t hits %lu misses %lu ngroups %lu nitems %lu\n", |
pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems); |
pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems); |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
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); |
(*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 1508 pool_chk(struct pool *pp, const char *la |
|
Line 1478 pool_chk(struct pool *pp, const char *la |
|
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
|
TAILQ_FOREACH(ph, &pp->pr_pagelist, ph_pagelist) { |
for (ph = TAILQ_FIRST(&pp->pr_pagelist); ph != NULL; |
|
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 1658 pool_cache_get(struct pool_cache *pc, in |
|
Line 1630 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) { |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
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; |
|
|
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) { |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
|
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 1730 pool_cache_put(struct pool_cache *pc, vo |
|
Line 1698 pool_cache_put(struct pool_cache *pc, vo |
|
* allocate one. |
* allocate one. |
*/ |
*/ |
simple_unlock(&pc->pc_slock); |
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); |
simple_lock(&pc->pc_slock); |
Line 1788 pool_cache_do_invalidate(struct pool_cac |
|
Line 1754 pool_cache_do_invalidate(struct pool_cac |
|
{ |
{ |
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) { |
Line 1807 pool_cache_do_invalidate(struct pool_cac |
|
Line 1772 pool_cache_do_invalidate(struct pool_cac |
|
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); |
|
} |
} |
} |
} |
} |
} |