version 1.50.2.2, 2001/08/24 00:11:35 |
version 1.50.2.4, 2001/10/22 20:41:50 |
Line 70 TAILQ_HEAD(,pool) pool_head = TAILQ_HEAD |
|
Line 70 TAILQ_HEAD(,pool) pool_head = TAILQ_HEAD |
|
/* Private pool for page header structures */ |
/* Private pool for page header structures */ |
static struct pool phpool; |
static struct pool phpool; |
|
|
|
#ifdef POOL_SUBPAGE |
|
/* Pool of subpages for use by normal pools. */ |
|
static struct pool psppool; |
|
#endif |
|
|
/* # of seconds to retain page after last use */ |
/* # of seconds to retain page after last use */ |
int pool_inactive_time = 10; |
int pool_inactive_time = 10; |
|
|
Line 90 struct pool_item_header { |
|
Line 95 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 152 static void pool_prime_page(struct pool |
|
Line 158 static void pool_prime_page(struct pool |
|
struct pool_item_header *); |
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); |
|
#ifdef POOL_SUBPAGE |
|
static void *pool_subpage_alloc(unsigned long, int, int); |
|
static void pool_subpage_free(void *, unsigned long, int); |
|
#endif |
|
|
static void pool_print1(struct pool *, const char *, |
static void pool_print1(struct pool *, const char *, |
void (*)(const char *, ...)); |
void (*)(const char *, ...)); |
Line 298 pr_find_pagehead(struct pool *pp, caddr_ |
|
Line 308 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 317 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 329 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 377 pool_init(struct pool *pp, size_t size, |
|
Line 390 pool_init(struct pool *pp, size_t size, |
|
panic("pool_init: page size invalid (%lx)\n", (u_long)pagesz); |
panic("pool_init: page size invalid (%lx)\n", (u_long)pagesz); |
|
|
if (alloc == NULL && release == NULL) { |
if (alloc == NULL && release == NULL) { |
|
#ifdef POOL_SUBPAGE |
|
alloc = pool_subpage_alloc; |
|
release = pool_subpage_free; |
|
pagesz = POOL_SUBPAGE; |
|
#else |
alloc = pool_page_alloc; |
alloc = pool_page_alloc; |
release = pool_page_free; |
release = pool_page_free; |
pagesz = PAGE_SIZE; /* Rounds to PAGE_SIZE anyhow. */ |
pagesz = PAGE_SIZE; /* Rounds to PAGE_SIZE anyhow. */ |
|
#endif |
} else if ((alloc != NULL && release != NULL) == 0) { |
} else if ((alloc != NULL && release != NULL) == 0) { |
/* If you specifiy one, must specify both. */ |
/* If you specifiy one, must specify both. */ |
panic("pool_init: must specify alloc and release together"); |
panic("pool_init: must specify alloc and release together"); |
} |
} |
|
#ifdef POOL_SUBPAGE |
|
else if (alloc == pool_page_alloc_nointr && |
|
release == pool_page_free_nointr) |
|
pagesz = POOL_SUBPAGE; |
|
#endif |
|
|
if (pagesz == 0) |
if (pagesz == 0) |
pagesz = PAGE_SIZE; |
pagesz = PAGE_SIZE; |
Line 499 pool_init(struct pool *pp, size_t size, |
|
Line 523 pool_init(struct pool *pp, size_t size, |
|
* XXX LOCKING. |
* XXX LOCKING. |
*/ |
*/ |
if (phpool.pr_size == 0) { |
if (phpool.pr_size == 0) { |
|
#ifdef POOL_SUBPAGE |
|
pool_init(&phpool, sizeof(struct pool_item_header), 0, 0, 0, |
|
"phpool", PAGE_SIZE, pool_page_alloc, pool_page_free, 0); |
|
pool_init(&psppool, POOL_SUBPAGE, POOL_SUBPAGE, 0, |
|
PR_RECURSIVE, "psppool", PAGE_SIZE, |
|
pool_page_alloc, pool_page_free, 0); |
|
#else |
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); |
|
#endif |
pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0, |
pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0, |
0, "pcgpool", 0, 0, 0, 0); |
0, "pcgpool", 0, 0, 0, 0); |
} |
} |
Line 534 pool_destroy(struct pool *pp) |
|
Line 566 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 |
#ifdef POOL_DIAGNOSTIC |
Line 788 pool_get(struct pool *pp, int flags) |
|
Line 821 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); |
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 826 pool_do_put(struct pool *pp, void *v) |
|
Line 858 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 899 pool_do_put(struct pool *pp, void *v) |
|
Line 933 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); |
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 922 pool_do_put(struct pool *pp, void *v) |
|
Line 956 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? |
*/ |
*/ |
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 1224 pool_page_free(void *v, unsigned long sz |
|
Line 1257 pool_page_free(void *v, unsigned long sz |
|
uvm_km_free_poolpage((vaddr_t)v); |
uvm_km_free_poolpage((vaddr_t)v); |
} |
} |
|
|
|
#ifdef POOL_SUBPAGE |
|
/* |
|
* Sub-page allocator, for machines with large hardware pages. |
|
*/ |
|
static void * |
|
pool_subpage_alloc(unsigned long sz, int flags, int mtype) |
|
{ |
|
|
|
return pool_get(&psppool, flags); |
|
} |
|
|
|
static void |
|
pool_subpage_free(void *v, unsigned long sz, int mtype) |
|
{ |
|
|
|
pool_put(&psppool, v); |
|
} |
|
#endif |
|
|
|
#ifdef POOL_SUBPAGE |
|
/* We don't provide a real nointr allocator. Maybe later. */ |
|
void * |
|
pool_page_alloc_nointr(unsigned long sz, int flags, int mtype) |
|
{ |
|
|
|
return pool_subpage_alloc(sz, flags, mtype); |
|
} |
|
|
|
void |
|
pool_page_free_nointr(void *v, unsigned long sz, int mtype) |
|
{ |
|
|
|
pool_subpage_free(v, sz, mtype); |
|
} |
|
#else |
/* |
/* |
* Alternate pool page allocator for pools that know they will |
* Alternate pool page allocator for pools that know they will |
* never be accessed in interrupt context. |
* never be accessed in interrupt context. |
Line 1243 pool_page_free_nointr(void *v, unsigned |
|
Line 1311 pool_page_free_nointr(void *v, unsigned |
|
|
|
uvm_km_free_poolpage1(kernel_map, (vaddr_t)v); |
uvm_km_free_poolpage1(kernel_map, (vaddr_t)v); |
} |
} |
|
#endif |
|
|
|
|
/* |
/* |
Line 1258 pool_reclaim(struct pool *pp) |
|
Line 1327 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 1266 pool_reclaim(struct pool *pp) |
|
Line 1336 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. |
*/ |
*/ |
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 1299 pool_reclaim(struct pool *pp) |
|
Line 1369 pool_reclaim(struct pool *pp) |
|
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 1319 pool_drain(void *arg) |
|
Line 1403 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) { |
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); |
|
pool_reclaim(pp); |
splx(s); |
splx(s); |
} |
} |
|
|
Line 1434 pool_print1(struct pool *pp, const char |
|
Line 1517 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 1464 pool_print1(struct pool *pp, const char |
|
Line 1546 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); |
(*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); |
for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL; |
TAILQ_FOREACH(pcg, &pc->pc_grouplist, pcg_list) { |
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 1491 pool_chk(struct pool *pp, const char *la |
|
Line 1571 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 1651 pool_cache_get(struct pool_cache *pc, in |
|
Line 1729 pool_cache_get(struct pool_cache *pc, in |
|
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 1704 pool_cache_put(struct pool_cache *pc, vo |
|
Line 1781 pool_cache_put(struct pool_cache *pc, vo |
|
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; |