version 1.87.2.4, 2005/01/17 19:32:25 |
version 1.105, 2005/10/16 02:21:40 |
Line 70 __KERNEL_RCSID(0, "$NetBSD$"); |
|
Line 70 __KERNEL_RCSID(0, "$NetBSD$"); |
|
*/ |
*/ |
|
|
/* List of all pools */ |
/* List of all pools */ |
TAILQ_HEAD(,pool) pool_head = TAILQ_HEAD_INITIALIZER(pool_head); |
LIST_HEAD(,pool) pool_head = LIST_HEAD_INITIALIZER(pool_head); |
|
|
/* Private pool for page header structures */ |
/* Private pool for page header structures */ |
#define PHPOOL_MAX 8 |
#define PHPOOL_MAX 8 |
Line 112 struct pool_item_header { |
|
Line 112 struct pool_item_header { |
|
union { |
union { |
/* !PR_NOTOUCH */ |
/* !PR_NOTOUCH */ |
struct { |
struct { |
TAILQ_HEAD(, pool_item) |
LIST_HEAD(, pool_item) |
phu_itemlist; /* chunk list for this page */ |
phu_itemlist; /* chunk list for this page */ |
} phu_normal; |
} phu_normal; |
/* PR_NOTOUCH */ |
/* PR_NOTOUCH */ |
Line 139 struct pool_item { |
|
Line 139 struct pool_item { |
|
#endif |
#endif |
#define PI_MAGIC 0xdeadbeefU |
#define PI_MAGIC 0xdeadbeefU |
/* Other entries use only this list entry */ |
/* Other entries use only this list entry */ |
TAILQ_ENTRY(pool_item) pi_list; |
LIST_ENTRY(pool_item) pi_list; |
}; |
}; |
|
|
#define POOL_NEEDS_CATCHUP(pp) \ |
#define POOL_NEEDS_CATCHUP(pp) \ |
Line 174 struct pool_item { |
|
Line 174 struct pool_item { |
|
/* The cache group pool. */ |
/* The cache group pool. */ |
static struct pool pcgpool; |
static struct pool pcgpool; |
|
|
static void pool_cache_reclaim(struct pool_cache *); |
static void pool_cache_reclaim(struct pool_cache *, struct pool_pagelist *, |
|
struct pool_cache_grouplist *); |
|
static void pcg_grouplist_free(struct pool_cache_grouplist *); |
|
|
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, |
Line 384 pr_find_pagehead(struct pool *pp, caddr_ |
|
Line 386 pr_find_pagehead(struct pool *pp, caddr_ |
|
return ph; |
return ph; |
} |
} |
|
|
|
static void |
|
pr_pagelist_free(struct pool *pp, struct pool_pagelist *pq) |
|
{ |
|
struct pool_item_header *ph; |
|
int s; |
|
|
|
while ((ph = LIST_FIRST(pq)) != NULL) { |
|
LIST_REMOVE(ph, ph_pagelist); |
|
pool_allocator_free(pp, ph->ph_page); |
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
s = splvm(); |
|
pool_put(pp->pr_phpool, ph); |
|
splx(s); |
|
} |
|
} |
|
} |
|
|
/* |
/* |
* Remove a page from the pool. |
* Remove a page from the pool. |
*/ |
*/ |
Line 391 static __inline void |
|
Line 410 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) |
struct pool_pagelist *pq) |
{ |
{ |
int s; |
|
|
|
LOCK_ASSERT(!simple_lock_held(&pp->pr_slock) || pq != NULL); |
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
|
|
/* |
/* |
* If the page was idle, decrement the idle page count. |
* If the page was idle, decrement the idle page count. |
Line 411 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 429 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 the page from the pool and queue it for release. |
*/ |
*/ |
LIST_REMOVE(ph, ph_pagelist); |
LIST_REMOVE(ph, ph_pagelist); |
if ((pp->pr_roflags & PR_PHINPAGE) == 0) |
if ((pp->pr_roflags & PR_PHINPAGE) == 0) |
SPLAY_REMOVE(phtree, &pp->pr_phtree, ph); |
SPLAY_REMOVE(phtree, &pp->pr_phtree, ph); |
if (pq) { |
LIST_INSERT_HEAD(pq, ph, ph_pagelist); |
LIST_INSERT_HEAD(pq, ph, ph_pagelist); |
|
} else { |
|
pool_allocator_free(pp, ph->ph_page); |
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) { |
|
s = splvm(); |
|
pool_put(pp->pr_phpool, ph); |
|
splx(s); |
|
} |
|
} |
|
pp->pr_npages--; |
pp->pr_npages--; |
pp->pr_npagefree++; |
pp->pr_npagefree++; |
|
|
Line 529 pool_init(struct pool *pp, size_t size, |
|
Line 539 pool_init(struct pool *pp, size_t size, |
|
LIST_INIT(&pp->pr_emptypages); |
LIST_INIT(&pp->pr_emptypages); |
LIST_INIT(&pp->pr_fullpages); |
LIST_INIT(&pp->pr_fullpages); |
LIST_INIT(&pp->pr_partpages); |
LIST_INIT(&pp->pr_partpages); |
TAILQ_INIT(&pp->pr_cachelist); |
LIST_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 679 pool_init(struct pool *pp, size_t size, |
|
Line 689 pool_init(struct pool *pp, size_t size, |
|
|
|
/* Insert into the list of all pools. */ |
/* Insert into the list of all pools. */ |
simple_lock(&pool_head_slock); |
simple_lock(&pool_head_slock); |
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
LIST_INSERT_HEAD(&pool_head, pp, pr_poollist); |
simple_unlock(&pool_head_slock); |
simple_unlock(&pool_head_slock); |
|
|
/* Insert this into the list of pools using this allocator. */ |
/* Insert this into the list of pools using this allocator. */ |
Line 696 pool_init(struct pool *pp, size_t size, |
|
Line 706 pool_init(struct pool *pp, size_t size, |
|
void |
void |
pool_destroy(struct pool *pp) |
pool_destroy(struct pool *pp) |
{ |
{ |
|
struct pool_pagelist pq; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
struct pool_cache *pc; |
|
int s; |
int s; |
|
|
/* Locking order: pool_allocator -> pool */ |
/* Remove from global pool list */ |
|
simple_lock(&pool_head_slock); |
|
LIST_REMOVE(pp, pr_poollist); |
|
if (drainpp == pp) |
|
drainpp = NULL; |
|
simple_unlock(&pool_head_slock); |
|
|
|
/* Remove this pool from its allocator's list of pools. */ |
s = splvm(); |
s = splvm(); |
simple_lock(&pp->pr_alloc->pa_slock); |
simple_lock(&pp->pr_alloc->pa_slock); |
TAILQ_REMOVE(&pp->pr_alloc->pa_list, pp, pr_alloc_list); |
TAILQ_REMOVE(&pp->pr_alloc->pa_list, pp, pr_alloc_list); |
simple_unlock(&pp->pr_alloc->pa_slock); |
simple_unlock(&pp->pr_alloc->pa_slock); |
splx(s); |
splx(s); |
|
|
/* Destroy all caches for this pool. */ |
s = splvm(); |
while ((pc = TAILQ_FIRST(&pp->pr_cachelist)) != NULL) |
simple_lock(&pp->pr_slock); |
pool_cache_destroy(pc); |
|
|
KASSERT(LIST_EMPTY(&pp->pr_cachelist)); |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pp->pr_nout != 0) { |
if (pp->pr_nout != 0) { |
Line 719 pool_destroy(struct pool *pp) |
|
Line 737 pool_destroy(struct pool *pp) |
|
} |
} |
#endif |
#endif |
|
|
/* Remove all pages */ |
|
while ((ph = LIST_FIRST(&pp->pr_emptypages)) != NULL) |
|
pr_rmpage(pp, ph, NULL); |
|
KASSERT(LIST_EMPTY(&pp->pr_fullpages)); |
KASSERT(LIST_EMPTY(&pp->pr_fullpages)); |
KASSERT(LIST_EMPTY(&pp->pr_partpages)); |
KASSERT(LIST_EMPTY(&pp->pr_partpages)); |
|
|
/* Remove from global pool list */ |
/* Remove all pages */ |
simple_lock(&pool_head_slock); |
LIST_INIT(&pq); |
TAILQ_REMOVE(&pool_head, pp, pr_poollist); |
while ((ph = LIST_FIRST(&pp->pr_emptypages)) != NULL) |
if (drainpp == pp) { |
pr_rmpage(pp, ph, &pq); |
drainpp = NULL; |
|
} |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pool_head_slock); |
splx(s); |
|
|
|
pr_pagelist_free(pp, &pq); |
|
|
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
if ((pp->pr_roflags & PR_LOGGING) != 0) |
if ((pp->pr_roflags & PR_LOGGING) != 0) |
Line 793 pool_get(struct pool *pp, int flags) |
|
Line 810 pool_get(struct pool *pp, int flags) |
|
(flags & PR_WAITOK) != 0)) |
(flags & PR_WAITOK) != 0)) |
panic("pool_get: %s: must have NOWAIT", pp->pr_wchan); |
panic("pool_get: %s: must have NOWAIT", pp->pr_wchan); |
|
|
|
#endif /* DIAGNOSTIC */ |
#ifdef LOCKDEBUG |
#ifdef LOCKDEBUG |
if (flags & PR_WAITOK) |
if (flags & PR_WAITOK) |
simple_lock_only_held(NULL, "pool_get(PR_WAITOK)"); |
simple_lock_only_held(NULL, "pool_get(PR_WAITOK)"); |
|
SCHED_ASSERT_UNLOCKED(); |
#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 944 pool_get(struct pool *pp, int flags) |
|
Line 962 pool_get(struct pool *pp, int flags) |
|
pr_log(pp, v, PRLOG_GET, file, line); |
pr_log(pp, v, PRLOG_GET, file, line); |
#endif |
#endif |
} else { |
} else { |
v = pi = TAILQ_FIRST(&ph->ph_itemlist); |
v = pi = LIST_FIRST(&ph->ph_itemlist); |
if (__predict_false(v == NULL)) { |
if (__predict_false(v == NULL)) { |
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
Line 976 pool_get(struct pool *pp, int flags) |
|
Line 994 pool_get(struct pool *pp, int flags) |
|
/* |
/* |
* Remove from item list. |
* Remove from item list. |
*/ |
*/ |
TAILQ_REMOVE(&ph->ph_itemlist, pi, pi_list); |
LIST_REMOVE(pi, pi_list); |
} |
} |
pp->pr_nitems--; |
pp->pr_nitems--; |
pp->pr_nout++; |
pp->pr_nout++; |
Line 998 pool_get(struct pool *pp, int flags) |
|
Line 1016 pool_get(struct pool *pp, int flags) |
|
if (ph->ph_nmissing == pp->pr_itemsperpage) { |
if (ph->ph_nmissing == pp->pr_itemsperpage) { |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (__predict_false((pp->pr_roflags & PR_NOTOUCH) == 0 && |
if (__predict_false((pp->pr_roflags & PR_NOTOUCH) == 0 && |
!TAILQ_EMPTY(&ph->ph_itemlist))) { |
!LIST_EMPTY(&ph->ph_itemlist))) { |
pr_leave(pp); |
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", |
Line 1037 pool_get(struct pool *pp, int flags) |
|
Line 1055 pool_get(struct pool *pp, int flags) |
|
* 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) |
pool_do_put(struct pool *pp, void *v, struct pool_pagelist *pq) |
{ |
{ |
struct pool_item *pi = v; |
struct pool_item *pi = v; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
Line 1045 pool_do_put(struct pool *pp, void *v) |
|
Line 1063 pool_do_put(struct pool *pp, void *v) |
|
int s; |
int s; |
|
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
|
SCHED_ASSERT_UNLOCKED(); |
|
|
page = (caddr_t)((u_long)v & pp->pr_alloc->pa_pagemask); |
page = (caddr_t)((u_long)v & pp->pr_alloc->pa_pagemask); |
|
|
Line 1087 pool_do_put(struct pool *pp, void *v) |
|
Line 1106 pool_do_put(struct pool *pp, void *v) |
|
} |
} |
#endif |
#endif |
|
|
TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list); |
LIST_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list); |
} |
} |
KDASSERT(ph->ph_nmissing != 0); |
KDASSERT(ph->ph_nmissing != 0); |
ph->ph_nmissing--; |
ph->ph_nmissing--; |
Line 1125 pool_do_put(struct pool *pp, void *v) |
|
Line 1144 pool_do_put(struct pool *pp, void *v) |
|
if (pp->pr_npages > pp->pr_minpages && |
if (pp->pr_npages > pp->pr_minpages && |
(pp->pr_npages > pp->pr_maxpages || |
(pp->pr_npages > pp->pr_maxpages || |
(pp->pr_alloc->pa_flags & PA_WANT) != 0)) { |
(pp->pr_alloc->pa_flags & PA_WANT) != 0)) { |
simple_unlock(&pp->pr_slock); |
pr_rmpage(pp, ph, pq); |
pr_rmpage(pp, ph, NULL); |
|
simple_lock(&pp->pr_slock); |
|
} else { |
} else { |
LIST_REMOVE(ph, ph_pagelist); |
LIST_REMOVE(ph, ph_pagelist); |
LIST_INSERT_HEAD(&pp->pr_emptypages, ph, ph_pagelist); |
LIST_INSERT_HEAD(&pp->pr_emptypages, ph, ph_pagelist); |
Line 1165 pool_do_put(struct pool *pp, void *v) |
|
Line 1182 pool_do_put(struct pool *pp, void *v) |
|
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) |
{ |
{ |
|
struct pool_pagelist pq; |
|
|
|
LIST_INIT(&pq); |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
pr_log(pp, v, PRLOG_PUT, file, line); |
pr_log(pp, v, PRLOG_PUT, file, line); |
|
|
pool_do_put(pp, v); |
pool_do_put(pp, v, &pq); |
|
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
|
|
pr_pagelist_free(pp, &pq); |
} |
} |
#undef pool_put |
#undef pool_put |
#endif /* POOL_DIAGNOSTIC */ |
#endif /* POOL_DIAGNOSTIC */ |
Line 1182 _pool_put(struct pool *pp, void *v, cons |
|
Line 1204 _pool_put(struct pool *pp, void *v, cons |
|
void |
void |
pool_put(struct pool *pp, void *v) |
pool_put(struct pool *pp, void *v) |
{ |
{ |
|
struct pool_pagelist pq; |
|
|
simple_lock(&pp->pr_slock); |
LIST_INIT(&pq); |
|
|
pool_do_put(pp, v); |
|
|
|
|
simple_lock(&pp->pr_slock); |
|
pool_do_put(pp, v, &pq); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
|
|
pr_pagelist_free(pp, &pq); |
} |
} |
|
|
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
Line 1260 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1285 pool_prime_page(struct pool *pp, caddr_t |
|
* Insert page header. |
* Insert page header. |
*/ |
*/ |
LIST_INSERT_HEAD(&pp->pr_emptypages, ph, ph_pagelist); |
LIST_INSERT_HEAD(&pp->pr_emptypages, ph, ph_pagelist); |
TAILQ_INIT(&ph->ph_itemlist); |
LIST_INIT(&ph->ph_itemlist); |
ph->ph_page = storage; |
ph->ph_page = storage; |
ph->ph_nmissing = 0; |
ph->ph_nmissing = 0; |
s = splclock(); |
s = splclock(); |
Line 1306 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1331 pool_prime_page(struct pool *pp, caddr_t |
|
KASSERT(((((vaddr_t)pi) + ioff) & (align - 1)) == 0); |
KASSERT(((((vaddr_t)pi) + ioff) & (align - 1)) == 0); |
|
|
/* Insert on page list */ |
/* Insert on page list */ |
TAILQ_INSERT_TAIL(&ph->ph_itemlist, pi, pi_list); |
LIST_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list); |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
pi->pi_magic = PI_MAGIC; |
pi->pi_magic = PI_MAGIC; |
#endif |
#endif |
Line 1447 pool_reclaim(struct pool *pp) |
|
Line 1472 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 pool_pagelist pq; |
struct pool_pagelist pq; |
struct timeval diff; |
struct pool_cache_grouplist pcgl; |
|
struct timeval curtime, diff; |
int s; |
int s; |
|
|
if (pp->pr_drain_hook != NULL) { |
if (pp->pr_drain_hook != NULL) { |
Line 1464 pool_reclaim(struct pool *pp) |
|
Line 1489 pool_reclaim(struct pool *pp) |
|
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
|
|
LIST_INIT(&pq); |
LIST_INIT(&pq); |
|
LIST_INIT(&pcgl); |
|
|
/* |
/* |
* Reclaim items from the pool's caches. |
* Reclaim items from the pool's caches. |
*/ |
*/ |
TAILQ_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
LIST_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
pool_cache_reclaim(pc); |
pool_cache_reclaim(pc, &pq, &pcgl); |
|
|
s = splclock(); |
s = splclock(); |
curtime = mono_time; |
curtime = mono_time; |
Line 1500 pool_reclaim(struct pool *pp) |
|
Line 1526 pool_reclaim(struct pool *pp) |
|
|
|
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
if (LIST_EMPTY(&pq)) |
if (LIST_EMPTY(&pq) && LIST_EMPTY(&pcgl)) |
return (0); |
return 0; |
|
|
while ((ph = LIST_FIRST(&pq)) != NULL) { |
|
LIST_REMOVE(ph, ph_pagelist); |
|
pool_allocator_free(pp, ph->ph_page); |
|
if (pp->pr_roflags & PR_PHINPAGE) { |
|
continue; |
|
} |
|
s = splvm(); |
|
pool_put(pp->pr_phpool, ph); |
|
splx(s); |
|
} |
|
|
|
|
pr_pagelist_free(pp, &pq); |
|
pcg_grouplist_free(&pcgl); |
return (1); |
return (1); |
} |
} |
|
|
Line 1532 pool_drain(void *arg) |
|
Line 1549 pool_drain(void *arg) |
|
s = splvm(); |
s = splvm(); |
simple_lock(&pool_head_slock); |
simple_lock(&pool_head_slock); |
if (drainpp == NULL) { |
if (drainpp == NULL) { |
drainpp = TAILQ_FIRST(&pool_head); |
drainpp = LIST_FIRST(&pool_head); |
} |
} |
if (drainpp) { |
if (drainpp) { |
pp = drainpp; |
pp = drainpp; |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
drainpp = LIST_NEXT(pp, pr_poollist); |
} |
} |
simple_unlock(&pool_head_slock); |
simple_unlock(&pool_head_slock); |
pool_reclaim(pp); |
pool_reclaim(pp); |
Line 1609 pool_print_pagelist(struct pool *pp, str |
|
Line 1626 pool_print_pagelist(struct pool *pp, str |
|
(u_long)ph->ph_time.tv_usec); |
(u_long)ph->ph_time.tv_usec); |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (!(pp->pr_roflags & PR_NOTOUCH)) { |
if (!(pp->pr_roflags & PR_NOTOUCH)) { |
TAILQ_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
LIST_FOREACH(pi, &ph->ph_itemlist, 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 1684 pool_print1(struct pool *pp, const char |
|
Line 1701 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) { |
#define PR_GROUPLIST(pcg) \ |
(*pr)("\tcache %p: allocfrom %p freeto %p\n", pc, |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); \ |
pc->pc_allocfrom, pc->pc_freeto); |
for (i = 0; i < PCG_NOBJECTS; i++) { \ |
|
if (pcg->pcg_objects[i].pcgo_pa != \ |
|
POOL_PADDR_INVALID) { \ |
|
(*pr)("\t\t\t%p, 0x%llx\n", \ |
|
pcg->pcg_objects[i].pcgo_va, \ |
|
(unsigned long long) \ |
|
pcg->pcg_objects[i].pcgo_pa); \ |
|
} else { \ |
|
(*pr)("\t\t\t%p\n", \ |
|
pcg->pcg_objects[i].pcgo_va); \ |
|
} \ |
|
} |
|
|
|
LIST_FOREACH(pc, &pp->pr_cachelist, pc_poollist) { |
|
(*pr)("\tcache %p\n", pc); |
(*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) { |
(*pr)("\t full groups:\n"); |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); |
LIST_FOREACH(pcg, &pc->pc_fullgroups, pcg_list) { |
for (i = 0; i < PCG_NOBJECTS; i++) { |
PR_GROUPLIST(pcg); |
if (pcg->pcg_objects[i].pcgo_pa != |
} |
POOL_PADDR_INVALID) { |
(*pr)("\t partial groups:\n"); |
(*pr)("\t\t\t%p, 0x%llx\n", |
LIST_FOREACH(pcg, &pc->pc_partgroups, pcg_list) { |
pcg->pcg_objects[i].pcgo_va, |
PR_GROUPLIST(pcg); |
(unsigned long long) |
} |
pcg->pcg_objects[i].pcgo_pa); |
(*pr)("\t empty groups:\n"); |
} else { |
LIST_FOREACH(pcg, &pc->pc_emptygroups, pcg_list) { |
(*pr)("\t\t\t%p\n", |
PR_GROUPLIST(pcg); |
pcg->pcg_objects[i].pcgo_va); |
|
} |
|
} |
|
} |
} |
} |
} |
|
#undef PR_GROUPLIST |
|
|
skip_cache: |
skip_cache: |
pr_enter_check(pp, pr); |
pr_enter_check(pp, pr); |
Line 1732 pool_chk_page(struct pool *pp, const cha |
|
Line 1761 pool_chk_page(struct pool *pp, const cha |
|
if ((pp->pr_roflags & PR_NOTOUCH) != 0) |
if ((pp->pr_roflags & PR_NOTOUCH) != 0) |
return 0; |
return 0; |
|
|
for (pi = TAILQ_FIRST(&ph->ph_itemlist), n = 0; |
for (pi = LIST_FIRST(&ph->ph_itemlist), n = 0; |
pi != NULL; |
pi != NULL; |
pi = TAILQ_NEXT(pi,pi_list), n++) { |
pi = LIST_NEXT(pi,pi_list), n++) { |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (pi->pi_magic != PI_MAGIC) { |
if (pi->pi_magic != PI_MAGIC) { |
Line 1811 pool_cache_init(struct pool_cache *pc, s |
|
Line 1840 pool_cache_init(struct pool_cache *pc, s |
|
void *arg) |
void *arg) |
{ |
{ |
|
|
TAILQ_INIT(&pc->pc_grouplist); |
LIST_INIT(&pc->pc_emptygroups); |
|
LIST_INIT(&pc->pc_fullgroups); |
|
LIST_INIT(&pc->pc_partgroups); |
simple_lock_init(&pc->pc_slock); |
simple_lock_init(&pc->pc_slock); |
|
|
pc->pc_allocfrom = NULL; |
|
pc->pc_freeto = NULL; |
|
pc->pc_pool = pp; |
pc->pc_pool = pp; |
|
|
pc->pc_ctor = ctor; |
pc->pc_ctor = ctor; |
Line 1830 pool_cache_init(struct pool_cache *pc, s |
|
Line 1859 pool_cache_init(struct pool_cache *pc, s |
|
pc->pc_nitems = 0; |
pc->pc_nitems = 0; |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
TAILQ_INSERT_TAIL(&pp->pr_cachelist, pc, pc_poollist); |
LIST_INSERT_HEAD(&pp->pr_cachelist, pc, pc_poollist); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
|
|
Line 1849 pool_cache_destroy(struct pool_cache *pc |
|
Line 1878 pool_cache_destroy(struct pool_cache *pc |
|
|
|
/* ...and remove it from the pool's cache list. */ |
/* ...and remove it from the pool's cache list. */ |
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
TAILQ_REMOVE(&pp->pr_cachelist, pc, pc_poollist); |
LIST_REMOVE(pc, pc_poollist); |
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
} |
} |
|
|
Line 1885 pcg_put(struct pool_cache_group *pcg, vo |
|
Line 1914 pcg_put(struct pool_cache_group *pcg, vo |
|
pcg->pcg_objects[idx].pcgo_pa = pa; |
pcg->pcg_objects[idx].pcgo_pa = pa; |
} |
} |
|
|
|
static void |
|
pcg_grouplist_free(struct pool_cache_grouplist *pcgl) |
|
{ |
|
struct pool_cache_group *pcg; |
|
int s; |
|
|
|
s = splvm(); |
|
while ((pcg = LIST_FIRST(pcgl)) != NULL) { |
|
LIST_REMOVE(pcg, pcg_list); |
|
pool_put(&pcgpool, pcg); |
|
} |
|
splx(s); |
|
} |
|
|
/* |
/* |
* pool_cache_get{,_paddr}: |
* pool_cache_get{,_paddr}: |
* |
* |
Line 1904 pool_cache_get_paddr(struct pool_cache * |
|
Line 1947 pool_cache_get_paddr(struct pool_cache * |
|
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
|
|
if ((pcg = pc->pc_allocfrom) == NULL) { |
pcg = LIST_FIRST(&pc->pc_partgroups); |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
if (pcg == NULL) { |
if (pcg->pcg_avail != 0) { |
pcg = LIST_FIRST(&pc->pc_fullgroups); |
pc->pc_allocfrom = pcg; |
if (pcg != NULL) { |
goto have_group; |
LIST_REMOVE(pcg, pcg_list); |
} |
LIST_INSERT_HEAD(&pc->pc_partgroups, pcg, pcg_list); |
} |
} |
|
} |
|
if (pcg == NULL) { |
|
|
/* |
/* |
* No groups with any available objects. Allocate |
* No groups with any available objects. Allocate |
Line 1937 pool_cache_get_paddr(struct pool_cache * |
|
Line 1982 pool_cache_get_paddr(struct pool_cache * |
|
return (object); |
return (object); |
} |
} |
|
|
have_group: |
|
pc->pc_hits++; |
pc->pc_hits++; |
pc->pc_nitems--; |
pc->pc_nitems--; |
object = pcg_get(pcg, pap); |
object = pcg_get(pcg, pap); |
|
|
if (pcg->pcg_avail == 0) |
if (pcg->pcg_avail == 0) { |
pc->pc_allocfrom = NULL; |
LIST_REMOVE(pcg, pcg_list); |
|
LIST_INSERT_HEAD(&pc->pc_emptygroups, pcg, pcg_list); |
|
} |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
|
|
return (object); |
return (object); |
Line 1964 pool_cache_put_paddr(struct pool_cache * |
|
Line 2009 pool_cache_put_paddr(struct pool_cache * |
|
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
|
|
if ((pcg = pc->pc_freeto) == NULL) { |
pcg = LIST_FIRST(&pc->pc_partgroups); |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
if (pcg == NULL) { |
if (pcg->pcg_avail != PCG_NOBJECTS) { |
pcg = LIST_FIRST(&pc->pc_emptygroups); |
pc->pc_freeto = pcg; |
if (pcg != NULL) { |
goto have_group; |
LIST_REMOVE(pcg, pcg_list); |
} |
LIST_INSERT_HEAD(&pc->pc_partgroups, pcg, pcg_list); |
} |
} |
|
} |
|
if (pcg == NULL) { |
|
|
/* |
/* |
* No empty groups to free the object to. Attempt to |
* No empty groups to free the object to. Attempt to |
Line 1980 pool_cache_put_paddr(struct pool_cache * |
|
Line 2027 pool_cache_put_paddr(struct pool_cache * |
|
s = splvm(); |
s = splvm(); |
pcg = pool_get(&pcgpool, PR_NOWAIT); |
pcg = pool_get(&pcgpool, PR_NOWAIT); |
splx(s); |
splx(s); |
if (pcg != NULL) { |
if (pcg == NULL) { |
memset(pcg, 0, sizeof(*pcg)); |
|
simple_lock(&pc->pc_slock); |
|
pc->pc_ngroups++; |
|
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 |
* Unable to allocate a cache group; destruct the object |
* and free it back to the pool. |
* and free it back to the pool. |
*/ |
*/ |
pool_cache_destruct_object(pc, object); |
pool_cache_destruct_object(pc, object); |
return; |
return; |
|
} |
|
memset(pcg, 0, sizeof(*pcg)); |
|
simple_lock(&pc->pc_slock); |
|
pc->pc_ngroups++; |
|
LIST_INSERT_HEAD(&pc->pc_partgroups, pcg, pcg_list); |
} |
} |
|
|
have_group: |
|
pc->pc_nitems++; |
pc->pc_nitems++; |
pcg_put(pcg, object, pa); |
pcg_put(pcg, object, pa); |
|
|
if (pcg->pcg_avail == PCG_NOBJECTS) |
if (pcg->pcg_avail == PCG_NOBJECTS) { |
pc->pc_freeto = NULL; |
LIST_REMOVE(pcg, pcg_list); |
|
LIST_INSERT_HEAD(&pc->pc_fullgroups, pcg, pcg_list); |
|
} |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
} |
} |
|
|
Line 2023 pool_cache_destruct_object(struct pool_c |
|
Line 2067 pool_cache_destruct_object(struct pool_c |
|
pool_put(pc->pc_pool, object); |
pool_put(pc->pc_pool, object); |
} |
} |
|
|
/* |
|
* pool_cache_do_invalidate: |
|
* |
|
* This internal function implements pool_cache_invalidate() and |
|
* pool_cache_reclaim(). |
|
*/ |
|
static void |
static void |
pool_cache_do_invalidate(struct pool_cache *pc, int free_groups, |
pool_do_cache_invalidate_grouplist(struct pool_cache_group *pcg, |
void (*putit)(struct pool *, void *)) |
struct pool_cache *pc, struct pool_pagelist *pq, |
|
struct pool_cache_grouplist *pcgl) |
{ |
{ |
struct pool_cache_group *pcg, *npcg; |
struct pool_cache_group *npcg; |
void *object; |
void *object; |
int s; |
|
|
|
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
for (; pcg != NULL; pcg = npcg) { |
pcg = npcg) { |
npcg = LIST_NEXT(pcg, pcg_list); |
npcg = TAILQ_NEXT(pcg, pcg_list); |
|
while (pcg->pcg_avail != 0) { |
while (pcg->pcg_avail != 0) { |
pc->pc_nitems--; |
pc->pc_nitems--; |
object = pcg_get(pcg, NULL); |
object = pcg_get(pcg, NULL); |
if (pcg->pcg_avail == 0 && pc->pc_allocfrom == pcg) |
|
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); |
pool_do_put(pc->pc_pool, object, pq); |
} |
|
if (free_groups) { |
|
pc->pc_ngroups--; |
|
TAILQ_REMOVE(&pc->pc_grouplist, pcg, pcg_list); |
|
if (pc->pc_freeto == pcg) |
|
pc->pc_freeto = NULL; |
|
s = splvm(); |
|
pool_put(&pcgpool, pcg); |
|
splx(s); |
|
} |
} |
|
pc->pc_ngroups--; |
|
LIST_REMOVE(pcg, pcg_list); |
|
LIST_INSERT_HEAD(pcgl, pcg, pcg_list); |
} |
} |
} |
} |
|
|
|
static void |
|
pool_do_cache_invalidate(struct pool_cache *pc, struct pool_pagelist *pq, |
|
struct pool_cache_grouplist *pcgl) |
|
{ |
|
|
|
LOCK_ASSERT(simple_lock_held(&pc->pc_slock)); |
|
LOCK_ASSERT(simple_lock_held(&pc->pc_pool->pr_slock)); |
|
|
|
pool_do_cache_invalidate_grouplist(LIST_FIRST(&pc->pc_fullgroups), |
|
pc, pq, pcgl); |
|
pool_do_cache_invalidate_grouplist(LIST_FIRST(&pc->pc_partgroups), |
|
pc, pq, pcgl); |
|
|
|
KASSERT(LIST_EMPTY(&pc->pc_partgroups)); |
|
KASSERT(LIST_EMPTY(&pc->pc_fullgroups)); |
|
KASSERT(pc->pc_nitems == 0); |
|
} |
|
|
/* |
/* |
* pool_cache_invalidate: |
* pool_cache_invalidate: |
* |
* |
Line 2070 pool_cache_do_invalidate(struct pool_cac |
|
Line 2117 pool_cache_do_invalidate(struct pool_cac |
|
void |
void |
pool_cache_invalidate(struct pool_cache *pc) |
pool_cache_invalidate(struct pool_cache *pc) |
{ |
{ |
|
struct pool_pagelist pq; |
|
struct pool_cache_grouplist pcgl; |
|
|
|
LIST_INIT(&pq); |
|
LIST_INIT(&pcgl); |
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
pool_cache_do_invalidate(pc, 0, pool_put); |
simple_lock(&pc->pc_pool->pr_slock); |
|
|
|
pool_do_cache_invalidate(pc, &pq, &pcgl); |
|
|
|
simple_unlock(&pc->pc_pool->pr_slock); |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
|
|
|
pr_pagelist_free(pc->pc_pool, &pq); |
|
pcg_grouplist_free(&pcgl); |
} |
} |
|
|
/* |
/* |
Line 2082 pool_cache_invalidate(struct pool_cache |
|
Line 2141 pool_cache_invalidate(struct pool_cache |
|
* Reclaim a pool cache for pool_reclaim(). |
* Reclaim a pool cache for pool_reclaim(). |
*/ |
*/ |
static void |
static void |
pool_cache_reclaim(struct pool_cache *pc) |
pool_cache_reclaim(struct pool_cache *pc, struct pool_pagelist *pq, |
|
struct pool_cache_grouplist *pcgl) |
{ |
{ |
|
|
simple_lock(&pc->pc_slock); |
/* |
pool_cache_do_invalidate(pc, 1, pool_do_put); |
* We're locking in the wrong order (normally pool_cache -> pool, |
|
* but the pool is already locked when we get here), so we have |
|
* to use trylock. If we can't lock the pool_cache, it's not really |
|
* a big deal here. |
|
*/ |
|
if (simple_lock_try(&pc->pc_slock) == 0) |
|
return; |
|
|
|
pool_do_cache_invalidate(pc, pq, pcgl); |
|
|
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
} |
} |
|
|
Line 2251 pool_page_alloc(struct pool *pp, int fla |
|
Line 2320 pool_page_alloc(struct pool *pp, int fla |
|
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
|
|
return ((void *) uvm_km_alloc_poolpage_cache(kmem_map, NULL, waitok)); |
return ((void *) uvm_km_alloc_poolpage_cache(kmem_map, waitok)); |
} |
} |
|
|
void |
void |
Line 2266 pool_page_alloc_meta(struct pool *pp, in |
|
Line 2335 pool_page_alloc_meta(struct pool *pp, in |
|
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
|
|
return ((void *) uvm_km_alloc_poolpage1(kmem_map, NULL, waitok)); |
return ((void *) uvm_km_alloc_poolpage(kmem_map, waitok)); |
} |
} |
|
|
static void |
static void |
pool_page_free_meta(struct pool *pp, void *v) |
pool_page_free_meta(struct pool *pp, void *v) |
{ |
{ |
|
|
uvm_km_free_poolpage1(kmem_map, (vaddr_t) v); |
uvm_km_free_poolpage(kmem_map, (vaddr_t) v); |
} |
} |
|
|
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
Line 2318 pool_page_alloc_nointr(struct pool *pp, |
|
Line 2387 pool_page_alloc_nointr(struct pool *pp, |
|
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
|
|
return ((void *) uvm_km_alloc_poolpage_cache(kernel_map, |
return ((void *) uvm_km_alloc_poolpage_cache(kernel_map, waitok)); |
uvm.kernel_object, waitok)); |
|
} |
} |
|
|
void |
void |