version 1.87.2.5, 2005/04/01 14:30:56 |
version 1.111.4.3, 2006/06/01 22:38:09 |
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 82 static struct pool phpool[PHPOOL_MAX]; |
|
Line 82 static struct pool phpool[PHPOOL_MAX]; |
|
static struct pool psppool; |
static struct pool psppool; |
#endif |
#endif |
|
|
|
static SLIST_HEAD(, pool_allocator) pa_deferinitq = |
|
SLIST_HEAD_INITIALIZER(pa_deferinitq); |
|
|
static void *pool_page_alloc_meta(struct pool *, int); |
static void *pool_page_alloc_meta(struct pool *, int); |
static void pool_page_free_meta(struct pool *, void *); |
static void pool_page_free_meta(struct pool *, void *); |
|
|
/* allocator for pool metadata */ |
/* allocator for pool metadata */ |
static struct pool_allocator pool_allocator_meta = { |
static struct pool_allocator pool_allocator_meta = { |
pool_page_alloc_meta, pool_page_free_meta |
pool_page_alloc_meta, pool_page_free_meta, |
|
.pa_backingmapptr = &kmem_map, |
}; |
}; |
|
|
/* # of seconds to retain page after last use */ |
/* # of seconds to retain page after last use */ |
Line 112 struct pool_item_header { |
|
Line 116 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 143 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 178 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, |
struct pool_item_header *); |
struct pool_item_header *); |
static void pool_update_curpage(struct pool *); |
static void pool_update_curpage(struct pool *); |
|
|
void *pool_allocator_alloc(struct pool *, int); |
static int pool_grow(struct pool *, int); |
void pool_allocator_free(struct pool *, void *); |
static void *pool_allocator_alloc(struct pool *, int); |
|
static void pool_allocator_free(struct pool *, void *); |
|
|
static void pool_print_pagelist(struct pool *, struct pool_pagelist *, |
static void pool_print_pagelist(struct pool *, struct pool_pagelist *, |
void (*)(const char *, ...)); |
void (*)(const char *, ...)); |
Line 212 struct pool_log { |
|
Line 219 struct pool_log { |
|
|
|
int pool_logsize = POOL_LOGSIZE; |
int pool_logsize = POOL_LOGSIZE; |
|
|
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) |
{ |
{ |
int n = pp->pr_curlogentry; |
int n = pp->pr_curlogentry; |
Line 265 pr_printlog(struct pool *pp, struct pool |
|
Line 272 pr_printlog(struct pool *pp, struct pool |
|
} |
} |
} |
} |
|
|
static __inline void |
static inline void |
pr_enter(struct pool *pp, const char *file, long line) |
pr_enter(struct pool *pp, const char *file, long line) |
{ |
{ |
|
|
Line 281 pr_enter(struct pool *pp, const char *fi |
|
Line 288 pr_enter(struct pool *pp, const char *fi |
|
pp->pr_entered_line = line; |
pp->pr_entered_line = line; |
} |
} |
|
|
static __inline void |
static inline void |
pr_leave(struct pool *pp) |
pr_leave(struct pool *pp) |
{ |
{ |
|
|
Line 294 pr_leave(struct pool *pp) |
|
Line 301 pr_leave(struct pool *pp) |
|
pp->pr_entered_line = 0; |
pp->pr_entered_line = 0; |
} |
} |
|
|
static __inline void |
static inline void |
pr_enter_check(struct pool *pp, void (*pr)(const char *, ...)) |
pr_enter_check(struct pool *pp, void (*pr)(const char *, ...)) |
{ |
{ |
|
|
Line 310 pr_enter_check(struct pool *pp, void (*p |
|
Line 317 pr_enter_check(struct pool *pp, void (*p |
|
#define pr_enter_check(pp, pr) |
#define pr_enter_check(pp, pr) |
#endif /* POOL_DIAGNOSTIC */ |
#endif /* POOL_DIAGNOSTIC */ |
|
|
static __inline int |
static inline int |
pr_item_notouch_index(const struct pool *pp, const struct pool_item_header *ph, |
pr_item_notouch_index(const struct pool *pp, const struct pool_item_header *ph, |
const void *v) |
const void *v) |
{ |
{ |
Line 329 pr_item_notouch_index(const struct pool |
|
Line 336 pr_item_notouch_index(const struct pool |
|
#define PR_INDEX_USED ((pool_item_freelist_t)-1) |
#define PR_INDEX_USED ((pool_item_freelist_t)-1) |
#define PR_INDEX_EOL ((pool_item_freelist_t)-2) |
#define PR_INDEX_EOL ((pool_item_freelist_t)-2) |
|
|
static __inline void |
static inline void |
pr_item_notouch_put(const struct pool *pp, struct pool_item_header *ph, |
pr_item_notouch_put(const struct pool *pp, struct pool_item_header *ph, |
void *obj) |
void *obj) |
{ |
{ |
Line 341 pr_item_notouch_put(const struct pool *p |
|
Line 348 pr_item_notouch_put(const struct pool *p |
|
ph->ph_firstfree = idx; |
ph->ph_firstfree = idx; |
} |
} |
|
|
static __inline void * |
static inline void * |
pr_item_notouch_get(const struct pool *pp, struct pool_item_header *ph) |
pr_item_notouch_get(const struct pool *pp, struct pool_item_header *ph) |
{ |
{ |
int idx = ph->ph_firstfree; |
int idx = ph->ph_firstfree; |
Line 354 pr_item_notouch_get(const struct pool *p |
|
Line 361 pr_item_notouch_get(const struct pool *p |
|
return ph->ph_page + ph->ph_off + idx * pp->pr_size; |
return ph->ph_page + ph->ph_off + idx * pp->pr_size; |
} |
} |
|
|
static __inline int |
static inline int |
phtree_compare(struct pool_item_header *a, struct pool_item_header *b) |
phtree_compare(struct pool_item_header *a, struct pool_item_header *b) |
{ |
{ |
if (a->ph_page < b->ph_page) |
if (a->ph_page < b->ph_page) |
Line 371 SPLAY_GENERATE(phtree, pool_item_header, |
|
Line 378 SPLAY_GENERATE(phtree, pool_item_header, |
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on page address. |
*/ |
*/ |
static __inline struct pool_item_header * |
static inline struct pool_item_header * |
pr_find_pagehead(struct pool *pp, caddr_t page) |
pr_find_pagehead(struct pool *pp, caddr_t page) |
{ |
{ |
struct pool_item_header *ph, tmp; |
struct pool_item_header *ph, tmp; |
Line 384 pr_find_pagehead(struct pool *pp, caddr_ |
|
Line 391 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. |
*/ |
*/ |
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) |
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 434 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++; |
|
|
pool_update_curpage(pp); |
pool_update_curpage(pp); |
} |
} |
|
|
|
static boolean_t |
|
pa_starved_p(struct pool_allocator *pa) |
|
{ |
|
|
|
if (pa->pa_backingmap != NULL) { |
|
return vm_map_starved_p(pa->pa_backingmap); |
|
} |
|
return FALSE; |
|
} |
|
|
|
static int |
|
pool_reclaim_callback(struct callback_entry *ce, void *obj, void *arg) |
|
{ |
|
struct pool *pp = obj; |
|
struct pool_allocator *pa = pp->pr_alloc; |
|
|
|
KASSERT(&pp->pr_reclaimerentry == ce); |
|
pool_reclaim(pp); |
|
if (!pa_starved_p(pa)) { |
|
return CALLBACK_CHAIN_ABORT; |
|
} |
|
return CALLBACK_CHAIN_CONTINUE; |
|
} |
|
|
|
static void |
|
pool_reclaim_register(struct pool *pp) |
|
{ |
|
struct vm_map *map = pp->pr_alloc->pa_backingmap; |
|
int s; |
|
|
|
if (map == NULL) { |
|
return; |
|
} |
|
|
|
s = splvm(); /* not necessary for INTRSAFE maps, but don't care. */ |
|
callback_register(&vm_map_to_kernel(map)->vmk_reclaim_callback, |
|
&pp->pr_reclaimerentry, pp, pool_reclaim_callback); |
|
splx(s); |
|
} |
|
|
|
static void |
|
pool_reclaim_unregister(struct pool *pp) |
|
{ |
|
struct vm_map *map = pp->pr_alloc->pa_backingmap; |
|
int s; |
|
|
|
if (map == NULL) { |
|
return; |
|
} |
|
|
|
s = splvm(); /* not necessary for INTRSAFE maps, but don't care. */ |
|
callback_unregister(&vm_map_to_kernel(map)->vmk_reclaim_callback, |
|
&pp->pr_reclaimerentry); |
|
splx(s); |
|
} |
|
|
|
static void |
|
pa_reclaim_register(struct pool_allocator *pa) |
|
{ |
|
struct vm_map *map = *pa->pa_backingmapptr; |
|
struct pool *pp; |
|
|
|
KASSERT(pa->pa_backingmap == NULL); |
|
if (map == NULL) { |
|
SLIST_INSERT_HEAD(&pa_deferinitq, pa, pa_q); |
|
return; |
|
} |
|
pa->pa_backingmap = map; |
|
TAILQ_FOREACH(pp, &pa->pa_list, pr_alloc_list) { |
|
pool_reclaim_register(pp); |
|
} |
|
} |
|
|
/* |
/* |
* Initialize all the pools listed in the "pools" link set. |
* Initialize all the pools listed in the "pools" link set. |
*/ |
*/ |
void |
void |
link_pool_init(void) |
pool_subsystem_init(void) |
{ |
{ |
|
struct pool_allocator *pa; |
__link_set_decl(pools, struct link_pool_init); |
__link_set_decl(pools, struct link_pool_init); |
struct link_pool_init * const *pi; |
struct link_pool_init * const *pi; |
|
|
Line 445 link_pool_init(void) |
|
Line 534 link_pool_init(void) |
|
pool_init((*pi)->pp, (*pi)->size, (*pi)->align, |
pool_init((*pi)->pp, (*pi)->size, (*pi)->align, |
(*pi)->align_offset, (*pi)->flags, (*pi)->wchan, |
(*pi)->align_offset, (*pi)->flags, (*pi)->wchan, |
(*pi)->palloc); |
(*pi)->palloc); |
|
|
|
while ((pa = SLIST_FIRST(&pa_deferinitq)) != NULL) { |
|
KASSERT(pa->pa_backingmapptr != NULL); |
|
KASSERT(*pa->pa_backingmapptr != NULL); |
|
SLIST_REMOVE_HEAD(&pa_deferinitq, pa_q); |
|
pa_reclaim_register(pa); |
|
} |
} |
} |
|
|
/* |
/* |
|
|
pool_init(struct pool *pp, size_t size, u_int align, u_int ioff, int flags, |
pool_init(struct pool *pp, size_t size, u_int align, u_int ioff, int flags, |
const char *wchan, struct pool_allocator *palloc) |
const char *wchan, struct pool_allocator *palloc) |
{ |
{ |
int off, slack; |
#ifdef DEBUG |
|
struct pool *pp1; |
|
#endif |
size_t trysize, phsize; |
size_t trysize, phsize; |
int s; |
int off, slack, s; |
|
|
KASSERT((1UL << (CHAR_BIT * sizeof(pool_item_freelist_t))) - 2 >= |
KASSERT((1UL << (CHAR_BIT * sizeof(pool_item_freelist_t))) - 2 >= |
PHPOOL_FREELIST_NELEM(PHPOOL_MAX - 1)); |
PHPOOL_FREELIST_NELEM(PHPOOL_MAX - 1)); |
|
|
|
#ifdef DEBUG |
|
/* |
|
* Check that the pool hasn't already been initialised and |
|
* added to the list of all pools. |
|
*/ |
|
LIST_FOREACH(pp1, &pool_head, pr_poollist) { |
|
if (pp == pp1) |
|
panic("pool_init: pool %s already initialised", |
|
wchan); |
|
} |
|
#endif |
|
|
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
/* |
/* |
* Always log if POOL_DIAGNOSTIC is defined. |
* Always log if POOL_DIAGNOSTIC is defined. |
Line 472 pool_init(struct pool *pp, size_t size, |
|
Line 582 pool_init(struct pool *pp, size_t size, |
|
flags |= PR_LOGGING; |
flags |= PR_LOGGING; |
#endif |
#endif |
|
|
#ifdef POOL_SUBPAGE |
|
/* |
|
* XXX We don't provide a real `nointr' back-end |
|
* yet; all sub-pages come from a kmem back-end. |
|
* maybe some day... |
|
*/ |
|
if (palloc == NULL) { |
|
extern struct pool_allocator pool_allocator_kmem_subpage; |
|
palloc = &pool_allocator_kmem_subpage; |
|
} |
|
/* |
|
* We'll assume any user-specified back-end allocator |
|
* will deal with sub-pages, or simply don't care. |
|
*/ |
|
#else |
|
if (palloc == NULL) |
if (palloc == NULL) |
palloc = &pool_allocator_kmem; |
palloc = &pool_allocator_kmem; |
|
#ifdef POOL_SUBPAGE |
|
if (size > palloc->pa_pagesz) { |
|
if (palloc == &pool_allocator_kmem) |
|
palloc = &pool_allocator_kmem_fullpage; |
|
else if (palloc == &pool_allocator_nointr) |
|
palloc = &pool_allocator_nointr_fullpage; |
|
} |
#endif /* POOL_SUBPAGE */ |
#endif /* POOL_SUBPAGE */ |
if ((palloc->pa_flags & PA_INITIALIZED) == 0) { |
if ((palloc->pa_flags & PA_INITIALIZED) == 0) { |
if (palloc->pa_pagesz == 0) { |
if (palloc->pa_pagesz == 0) |
#ifdef POOL_SUBPAGE |
|
if (palloc == &pool_allocator_kmem) |
|
palloc->pa_pagesz = PAGE_SIZE; |
|
else |
|
palloc->pa_pagesz = POOL_SUBPAGE; |
|
#else |
|
palloc->pa_pagesz = PAGE_SIZE; |
palloc->pa_pagesz = PAGE_SIZE; |
#endif /* POOL_SUBPAGE */ |
|
} |
|
|
|
TAILQ_INIT(&palloc->pa_list); |
TAILQ_INIT(&palloc->pa_list); |
|
|
simple_lock_init(&palloc->pa_slock); |
simple_lock_init(&palloc->pa_slock); |
palloc->pa_pagemask = ~(palloc->pa_pagesz - 1); |
palloc->pa_pagemask = ~(palloc->pa_pagesz - 1); |
palloc->pa_pageshift = ffs(palloc->pa_pagesz) - 1; |
palloc->pa_pageshift = ffs(palloc->pa_pagesz) - 1; |
|
|
|
if (palloc->pa_backingmapptr != NULL) { |
|
pa_reclaim_register(palloc); |
|
} |
palloc->pa_flags |= PA_INITIALIZED; |
palloc->pa_flags |= PA_INITIALIZED; |
} |
} |
|
|
Line 529 pool_init(struct pool *pp, size_t size, |
|
Line 627 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 777 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 688 pool_init(struct pool *pp, size_t size, |
|
Line 786 pool_init(struct pool *pp, size_t size, |
|
TAILQ_INSERT_TAIL(&palloc->pa_list, pp, pr_alloc_list); |
TAILQ_INSERT_TAIL(&palloc->pa_list, pp, pr_alloc_list); |
simple_unlock(&palloc->pa_slock); |
simple_unlock(&palloc->pa_slock); |
splx(s); |
splx(s); |
|
pool_reclaim_register(pp); |
} |
} |
|
|
/* |
/* |
Line 696 pool_init(struct pool *pp, size_t size, |
|
Line 795 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. */ |
|
pool_reclaim_unregister(pp); |
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 827 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 900 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 865 pool_get(struct pool *pp, int flags) |
|
Line 973 pool_get(struct pool *pp, int flags) |
|
* has no items in its bucket. |
* has no items in its bucket. |
*/ |
*/ |
if ((ph = pp->pr_curpage) == NULL) { |
if ((ph = pp->pr_curpage) == NULL) { |
|
int error; |
|
|
#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 880 pool_get(struct pool *pp, int flags) |
|
Line 990 pool_get(struct pool *pp, int flags) |
|
* may block. |
* may block. |
*/ |
*/ |
pr_leave(pp); |
pr_leave(pp); |
simple_unlock(&pp->pr_slock); |
error = pool_grow(pp, flags); |
v = pool_allocator_alloc(pp, flags); |
pr_enter(pp, file, line); |
if (__predict_true(v != NULL)) |
if (error != 0) { |
ph = pool_alloc_item_header(pp, v, flags); |
|
|
|
if (__predict_false(v == NULL || ph == NULL)) { |
|
if (v != NULL) |
|
pool_allocator_free(pp, v); |
|
|
|
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
|
|
/* |
/* |
* We were unable to allocate a page or item |
* We were unable to allocate a page or item |
* header, but we released the lock during |
* header, but we released the lock during |
Line 901 pool_get(struct pool *pp, int flags) |
|
Line 1002 pool_get(struct pool *pp, int flags) |
|
if (pp->pr_curpage != NULL) |
if (pp->pr_curpage != NULL) |
goto startover; |
goto startover; |
|
|
if ((flags & PR_WAITOK) == 0) { |
pp->pr_nfail++; |
pp->pr_nfail++; |
|
pr_leave(pp); |
|
simple_unlock(&pp->pr_slock); |
|
return (NULL); |
|
} |
|
|
|
/* |
|
* Wait for items to be returned to this pool. |
|
* |
|
* XXX: maybe we should wake up once a second and |
|
* try again? |
|
*/ |
|
pp->pr_flags |= PR_WANTED; |
|
/* PA_WANTED is already set on the allocator. */ |
|
pr_leave(pp); |
pr_leave(pp); |
ltsleep(pp, PSWP, pp->pr_wchan, 0, &pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
pr_enter(pp, file, line); |
return (NULL); |
goto startover; |
|
} |
} |
|
|
/* We have more memory; add it to the pool */ |
|
simple_lock(&pp->pr_slock); |
|
pr_enter(pp, file, line); |
|
pool_prime_page(pp, v, ph); |
|
pp->pr_npagealloc++; |
|
|
|
/* Start the allocation process over. */ |
/* Start the allocation process over. */ |
goto startover; |
goto startover; |
} |
} |
Line 944 pool_get(struct pool *pp, int flags) |
|
Line 1024 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 1056 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 1078 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 1015 pool_get(struct pool *pp, int flags) |
|
Line 1095 pool_get(struct pool *pp, int flags) |
|
} |
} |
|
|
pp->pr_nget++; |
pp->pr_nget++; |
|
pr_leave(pp); |
|
|
/* |
/* |
* 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 |
Line 1028 pool_get(struct pool *pp, int flags) |
|
Line 1109 pool_get(struct pool *pp, int flags) |
|
*/ |
*/ |
} |
} |
|
|
pr_leave(pp); |
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (v); |
return (v); |
} |
} |
Line 1037 pool_get(struct pool *pp, int flags) |
|
Line 1117 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; |
caddr_t page; |
caddr_t page; |
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 1167 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 1124 pool_do_put(struct pool *pp, void *v) |
|
Line 1204 pool_do_put(struct pool *pp, void *v) |
|
pp->pr_nidle++; |
pp->pr_nidle++; |
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)) { |
pa_starved_p(pp->pr_alloc))) { |
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 1138 pool_do_put(struct pool *pp, void *v) |
|
Line 1216 pool_do_put(struct pool *pp, void *v) |
|
* be reclaimed by the pagedaemon. This minimizes |
* be reclaimed by the pagedaemon. This minimizes |
* ping-pong'ing for memory. |
* ping-pong'ing for memory. |
*/ |
*/ |
s = splclock(); |
getmicrotime(&ph->ph_time); |
ph->ph_time = mono_time; |
|
splx(s); |
|
} |
} |
pool_update_curpage(pp); |
pool_update_curpage(pp); |
} |
} |
Line 1165 pool_do_put(struct pool *pp, void *v) |
|
Line 1241 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 1263 _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 1195 pool_put(struct pool *pp, void *v) |
|
Line 1279 pool_put(struct pool *pp, void *v) |
|
#endif |
#endif |
|
|
/* |
/* |
|
* pool_grow: grow a pool by a page. |
|
* |
|
* => called with pool locked. |
|
* => unlock and relock the pool. |
|
* => return with pool locked. |
|
*/ |
|
|
|
static int |
|
pool_grow(struct pool *pp, int flags) |
|
{ |
|
struct pool_item_header *ph = NULL; |
|
char *cp; |
|
|
|
simple_unlock(&pp->pr_slock); |
|
cp = pool_allocator_alloc(pp, flags); |
|
if (__predict_true(cp != NULL)) { |
|
ph = pool_alloc_item_header(pp, cp, flags); |
|
} |
|
if (__predict_false(cp == NULL || ph == NULL)) { |
|
if (cp != NULL) { |
|
pool_allocator_free(pp, cp); |
|
} |
|
simple_lock(&pp->pr_slock); |
|
return ENOMEM; |
|
} |
|
|
|
simple_lock(&pp->pr_slock); |
|
pool_prime_page(pp, cp, ph); |
|
pp->pr_npagealloc++; |
|
return 0; |
|
} |
|
|
|
/* |
* Add N items to the pool. |
* Add N items to the pool. |
*/ |
*/ |
int |
int |
pool_prime(struct pool *pp, int n) |
pool_prime(struct pool *pp, int n) |
{ |
{ |
struct pool_item_header *ph = NULL; |
|
caddr_t cp; |
|
int newpages; |
int newpages; |
|
int error = 0; |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
|
|
newpages = roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage; |
newpages = roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage; |
|
|
while (newpages-- > 0) { |
while (newpages-- > 0) { |
simple_unlock(&pp->pr_slock); |
error = pool_grow(pp, PR_NOWAIT); |
cp = pool_allocator_alloc(pp, PR_NOWAIT); |
if (error) { |
if (__predict_true(cp != NULL)) |
|
ph = pool_alloc_item_header(pp, cp, PR_NOWAIT); |
|
|
|
if (__predict_false(cp == NULL || ph == NULL)) { |
|
if (cp != NULL) |
|
pool_allocator_free(pp, cp); |
|
simple_lock(&pp->pr_slock); |
|
break; |
break; |
} |
} |
|
|
simple_lock(&pp->pr_slock); |
|
pool_prime_page(pp, cp, ph); |
|
pp->pr_npagealloc++; |
|
pp->pr_minpages++; |
pp->pr_minpages++; |
} |
} |
|
|
Line 1231 pool_prime(struct pool *pp, int n) |
|
Line 1336 pool_prime(struct pool *pp, int n) |
|
pp->pr_maxpages = pp->pr_minpages + 1; /* XXX */ |
pp->pr_maxpages = pp->pr_minpages + 1; /* XXX */ |
|
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
return (0); |
return error; |
} |
} |
|
|
/* |
/* |
Line 1247 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1352 pool_prime_page(struct pool *pp, caddr_t |
|
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 n; |
int n; |
int s; |
|
|
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
|
|
Line 1260 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1364 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(); |
getmicrotime(&ph->ph_time); |
ph->ph_time = mono_time; |
|
splx(s); |
|
if ((pp->pr_roflags & PR_PHINPAGE) == 0) |
if ((pp->pr_roflags & PR_PHINPAGE) == 0) |
SPLAY_INSERT(phtree, &pp->pr_phtree, ph); |
SPLAY_INSERT(phtree, &pp->pr_phtree, ph); |
|
|
Line 1306 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1408 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 1336 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1438 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 = NULL; |
|
caddr_t cp; |
|
int error = 0; |
int error = 0; |
|
|
while (POOL_NEEDS_CATCHUP(pp)) { |
while (POOL_NEEDS_CATCHUP(pp)) { |
/* |
error = pool_grow(pp, PR_NOWAIT); |
* Call the page back-end allocator for more memory. |
if (error) { |
* |
|
* XXX: We never wait, so should we bother unlocking |
|
* the pool descriptor? |
|
*/ |
|
simple_unlock(&pp->pr_slock); |
|
cp = pool_allocator_alloc(pp, PR_NOWAIT); |
|
if (__predict_true(cp != NULL)) |
|
ph = pool_alloc_item_header(pp, cp, PR_NOWAIT); |
|
if (__predict_false(cp == NULL || ph == NULL)) { |
|
if (cp != NULL) |
|
pool_allocator_free(pp, cp); |
|
error = ENOMEM; |
|
simple_lock(&pp->pr_slock); |
|
break; |
break; |
} |
} |
simple_lock(&pp->pr_slock); |
|
pool_prime_page(pp, cp, ph); |
|
pp->pr_npagealloc++; |
|
} |
} |
|
return error; |
return (error); |
|
} |
} |
|
|
static void |
static void |
Line 1447 pool_reclaim(struct pool *pp) |
|
Line 1530 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; |
int s; |
struct timeval curtime, diff; |
|
|
if (pp->pr_drain_hook != NULL) { |
if (pp->pr_drain_hook != NULL) { |
/* |
/* |
Line 1464 pool_reclaim(struct pool *pp) |
|
Line 1546 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(); |
getmicrotime(&curtime); |
curtime = mono_time; |
|
splx(s); |
|
|
|
for (ph = LIST_FIRST(&pp->pr_emptypages); ph != NULL; ph = phnext) { |
for (ph = LIST_FIRST(&pp->pr_emptypages); ph != NULL; ph = phnext) { |
phnext = LIST_NEXT(ph, ph_pagelist); |
phnext = LIST_NEXT(ph, ph_pagelist); |
Line 1484 pool_reclaim(struct pool *pp) |
|
Line 1565 pool_reclaim(struct pool *pp) |
|
|
|
KASSERT(ph->ph_nmissing == 0); |
KASSERT(ph->ph_nmissing == 0); |
timersub(&curtime, &ph->ph_time, &diff); |
timersub(&curtime, &ph->ph_time, &diff); |
if (diff.tv_sec < pool_inactive_time) |
if (diff.tv_sec < pool_inactive_time |
|
&& !pa_starved_p(pp->pr_alloc)) |
continue; |
continue; |
|
|
/* |
/* |
Line 1500 pool_reclaim(struct pool *pp) |
|
Line 1582 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 1605 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); |
if (pp) |
|
pool_reclaim(pp); |
splx(s); |
splx(s); |
} |
} |
|
|
Line 1564 pool_print(struct pool *pp, const char * |
|
Line 1638 pool_print(struct pool *pp, const char * |
|
} |
} |
|
|
void |
void |
|
pool_printall(const char *modif, void (*pr)(const char *, ...)) |
|
{ |
|
struct pool *pp; |
|
|
|
if (simple_lock_try(&pool_head_slock) == 0) { |
|
(*pr)("WARNING: pool_head_slock is locked\n"); |
|
} else { |
|
simple_unlock(&pool_head_slock); |
|
} |
|
|
|
LIST_FOREACH(pp, &pool_head, pr_poollist) { |
|
pool_printit(pp, modif, pr); |
|
} |
|
} |
|
|
|
void |
pool_printit(struct pool *pp, const char *modif, void (*pr)(const char *, ...)) |
pool_printit(struct pool *pp, const char *modif, void (*pr)(const char *, ...)) |
{ |
{ |
int didlock = 0; |
|
|
|
if (pp == NULL) { |
if (pp == NULL) { |
(*pr)("Must specify a pool to print.\n"); |
(*pr)("Must specify a pool to print.\n"); |
Line 1585 pool_printit(struct pool *pp, const char |
|
Line 1674 pool_printit(struct pool *pp, const char |
|
if (simple_lock_try(&pp->pr_slock) == 0) |
if (simple_lock_try(&pp->pr_slock) == 0) |
(*pr)("WARNING: pool %s is locked\n", pp->pr_wchan); |
(*pr)("WARNING: pool %s is locked\n", pp->pr_wchan); |
else |
else |
didlock = 1; |
simple_unlock(&pp->pr_slock); |
|
|
pool_print1(pp, modif, pr); |
pool_print1(pp, modif, pr); |
|
|
if (didlock) |
|
simple_unlock(&pp->pr_slock); |
|
} |
} |
|
|
static void |
static void |
Line 1609 pool_print_pagelist(struct pool *pp, str |
|
Line 1695 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 1770 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 1830 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 1909 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 1928 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 1947 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); |
} |
} |
|
|
static __inline void * |
static inline void * |
pcg_get(struct pool_cache_group *pcg, paddr_t *pap) |
pcg_get(struct pool_cache_group *pcg, paddr_t *pap) |
{ |
{ |
void *object; |
void *object; |
Line 1872 pcg_get(struct pool_cache_group *pcg, pa |
|
Line 1970 pcg_get(struct pool_cache_group *pcg, pa |
|
return (object); |
return (object); |
} |
} |
|
|
static __inline void |
static inline void |
pcg_put(struct pool_cache_group *pcg, void *object, paddr_t pa) |
pcg_put(struct pool_cache_group *pcg, void *object, paddr_t pa) |
{ |
{ |
u_int idx; |
u_int idx; |
Line 1885 pcg_put(struct pool_cache_group *pcg, vo |
|
Line 1983 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 2016 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 2051 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 1962 pool_cache_put_paddr(struct pool_cache * |
|
Line 2076 pool_cache_put_paddr(struct pool_cache * |
|
struct pool_cache_group *pcg; |
struct pool_cache_group *pcg; |
int s; |
int s; |
|
|
|
if (__predict_false((pc->pc_pool->pr_flags & PR_WANTED) != 0)) { |
|
goto destruct; |
|
} |
|
|
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 2100 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)); |
destruct: |
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 2141 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_grouplist *pcgsl, |
void (*putit)(struct pool *, void *)) |
struct pool_cache *pc, struct pool_pagelist *pq, |
|
struct pool_cache_grouplist *pcgdl) |
{ |
{ |
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 = LIST_FIRST(pcgsl); 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(pcgdl, 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(&pc->pc_fullgroups, pc, pq, pcgl); |
|
pool_do_cache_invalidate_grouplist(&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 2189 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 2213 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 2106 pool_cache_reclaim(struct pool_cache *pc |
|
Line 2247 pool_cache_reclaim(struct pool_cache *pc |
|
void *pool_page_alloc(struct pool *, int); |
void *pool_page_alloc(struct pool *, int); |
void pool_page_free(struct pool *, void *); |
void pool_page_free(struct pool *, void *); |
|
|
|
#ifdef POOL_SUBPAGE |
|
struct pool_allocator pool_allocator_kmem_fullpage = { |
|
pool_page_alloc, pool_page_free, 0, |
|
.pa_backingmapptr = &kmem_map, |
|
}; |
|
#else |
struct pool_allocator pool_allocator_kmem = { |
struct pool_allocator pool_allocator_kmem = { |
pool_page_alloc, pool_page_free, 0, |
pool_page_alloc, pool_page_free, 0, |
|
.pa_backingmapptr = &kmem_map, |
}; |
}; |
|
#endif |
|
|
void *pool_page_alloc_nointr(struct pool *, int); |
void *pool_page_alloc_nointr(struct pool *, int); |
void pool_page_free_nointr(struct pool *, void *); |
void pool_page_free_nointr(struct pool *, void *); |
|
|
|
#ifdef POOL_SUBPAGE |
|
struct pool_allocator pool_allocator_nointr_fullpage = { |
|
pool_page_alloc_nointr, pool_page_free_nointr, 0, |
|
.pa_backingmapptr = &kernel_map, |
|
}; |
|
#else |
struct pool_allocator pool_allocator_nointr = { |
struct pool_allocator pool_allocator_nointr = { |
pool_page_alloc_nointr, pool_page_free_nointr, 0, |
pool_page_alloc_nointr, pool_page_free_nointr, 0, |
|
.pa_backingmapptr = &kernel_map, |
}; |
}; |
|
#endif |
|
|
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
void *pool_subpage_alloc(struct pool *, int); |
void *pool_subpage_alloc(struct pool *, int); |
void pool_subpage_free(struct pool *, void *); |
void pool_subpage_free(struct pool *, void *); |
|
|
struct pool_allocator pool_allocator_kmem_subpage = { |
struct pool_allocator pool_allocator_kmem = { |
pool_subpage_alloc, pool_subpage_free, 0, |
pool_subpage_alloc, pool_subpage_free, POOL_SUBPAGE, |
|
.pa_backingmapptr = &kmem_map, |
|
}; |
|
|
|
void *pool_subpage_alloc_nointr(struct pool *, int); |
|
void pool_subpage_free_nointr(struct pool *, void *); |
|
|
|
struct pool_allocator pool_allocator_nointr = { |
|
pool_subpage_alloc, pool_subpage_free, POOL_SUBPAGE, |
|
.pa_backingmapptr = &kmem_map, |
}; |
}; |
#endif /* POOL_SUBPAGE */ |
#endif /* POOL_SUBPAGE */ |
|
|
/* |
static void * |
* We have at least three different resources for the same allocation and |
pool_allocator_alloc(struct pool *pp, int flags) |
* each resource can be depleted. First, we have the ready elements in the |
|
* pool. Then we have the resource (typically a vm_map) for this allocator. |
|
* Finally, we have physical memory. Waiting for any of these can be |
|
* unnecessary when any other is freed, but the kernel doesn't support |
|
* sleeping on multiple wait channels, so we have to employ another strategy. |
|
* |
|
* The caller sleeps on the pool (so that it can be awakened when an item |
|
* is returned to the pool), but we set PA_WANT on the allocator. When a |
|
* page is returned to the allocator and PA_WANT is set, pool_allocator_free |
|
* will wake up all sleeping pools belonging to this allocator. |
|
* |
|
* XXX Thundering herd. |
|
*/ |
|
void * |
|
pool_allocator_alloc(struct pool *org, int flags) |
|
{ |
{ |
struct pool_allocator *pa = org->pr_alloc; |
struct pool_allocator *pa = pp->pr_alloc; |
struct pool *pp, *start; |
|
int s, freed; |
|
void *res; |
void *res; |
|
|
LOCK_ASSERT(!simple_lock_held(&org->pr_slock)); |
LOCK_ASSERT(!simple_lock_held(&pp->pr_slock)); |
|
|
do { |
|
if ((res = (*pa->pa_alloc)(org, flags)) != NULL) |
|
return (res); |
|
if ((flags & PR_WAITOK) == 0) { |
|
/* |
|
* We only run the drain hookhere if PR_NOWAIT. |
|
* In other cases, the hook will be run in |
|
* pool_reclaim(). |
|
*/ |
|
if (org->pr_drain_hook != NULL) { |
|
(*org->pr_drain_hook)(org->pr_drain_hook_arg, |
|
flags); |
|
if ((res = (*pa->pa_alloc)(org, flags)) != NULL) |
|
return (res); |
|
} |
|
break; |
|
} |
|
|
|
|
res = (*pa->pa_alloc)(pp, flags); |
|
if (res == NULL && (flags & PR_WAITOK) == 0) { |
/* |
/* |
* Drain all pools, except "org", that use this |
* We only run the drain hook here if PR_NOWAIT. |
* allocator. We do this to reclaim VA space. |
* In other cases, the hook will be run in |
* pa_alloc is responsible for waiting for |
* pool_reclaim(). |
* physical memory. |
|
* |
|
* XXX We risk looping forever if start if someone |
|
* calls pool_destroy on "start". But there is no |
|
* other way to have potentially sleeping pool_reclaim, |
|
* non-sleeping locks on pool_allocator, and some |
|
* stirring of drained pools in the allocator. |
|
* |
|
* XXX Maybe we should use pool_head_slock for locking |
|
* the allocators? |
|
*/ |
*/ |
freed = 0; |
if (pp->pr_drain_hook != NULL) { |
|
(*pp->pr_drain_hook)(pp->pr_drain_hook_arg, flags); |
s = splvm(); |
res = (*pa->pa_alloc)(pp, flags); |
simple_lock(&pa->pa_slock); |
|
pp = start = TAILQ_FIRST(&pa->pa_list); |
|
do { |
|
TAILQ_REMOVE(&pa->pa_list, pp, pr_alloc_list); |
|
TAILQ_INSERT_TAIL(&pa->pa_list, pp, pr_alloc_list); |
|
if (pp == org) |
|
continue; |
|
simple_unlock(&pa->pa_slock); |
|
freed = pool_reclaim(pp); |
|
simple_lock(&pa->pa_slock); |
|
} while ((pp = TAILQ_FIRST(&pa->pa_list)) != start && |
|
freed == 0); |
|
|
|
if (freed == 0) { |
|
/* |
|
* We set PA_WANT here, the caller will most likely |
|
* sleep waiting for pages (if not, this won't hurt |
|
* that much), and there is no way to set this in |
|
* the caller without violating locking order. |
|
*/ |
|
pa->pa_flags |= PA_WANT; |
|
} |
} |
simple_unlock(&pa->pa_slock); |
} |
splx(s); |
return res; |
} while (freed); |
|
return (NULL); |
|
} |
} |
|
|
void |
static void |
pool_allocator_free(struct pool *pp, void *v) |
pool_allocator_free(struct pool *pp, void *v) |
{ |
{ |
struct pool_allocator *pa = pp->pr_alloc; |
struct pool_allocator *pa = pp->pr_alloc; |
int s; |
|
|
|
LOCK_ASSERT(!simple_lock_held(&pp->pr_slock)); |
LOCK_ASSERT(!simple_lock_held(&pp->pr_slock)); |
|
|
(*pa->pa_free)(pp, v); |
(*pa->pa_free)(pp, v); |
|
|
s = splvm(); |
|
simple_lock(&pa->pa_slock); |
|
if ((pa->pa_flags & PA_WANT) == 0) { |
|
simple_unlock(&pa->pa_slock); |
|
splx(s); |
|
return; |
|
} |
|
|
|
TAILQ_FOREACH(pp, &pa->pa_list, pr_alloc_list) { |
|
simple_lock(&pp->pr_slock); |
|
if ((pp->pr_flags & PR_WANTED) != 0) { |
|
pp->pr_flags &= ~PR_WANTED; |
|
wakeup(pp); |
|
} |
|
simple_unlock(&pp->pr_slock); |
|
} |
|
pa->pa_flags &= ~PA_WANT; |
|
simple_unlock(&pa->pa_slock); |
|
splx(s); |
|
} |
} |
|
|
void * |
void * |
Line 2300 pool_subpage_free(struct pool *pp, void |
|
Line 2379 pool_subpage_free(struct pool *pp, void |
|
|
|
/* We don't provide a real nointr allocator. Maybe later. */ |
/* We don't provide a real nointr allocator. Maybe later. */ |
void * |
void * |
pool_page_alloc_nointr(struct pool *pp, int flags) |
pool_subpage_alloc_nointr(struct pool *pp, int flags) |
{ |
{ |
|
|
return (pool_subpage_alloc(pp, flags)); |
return (pool_subpage_alloc(pp, flags)); |
} |
} |
|
|
void |
void |
pool_page_free_nointr(struct pool *pp, void *v) |
pool_subpage_free_nointr(struct pool *pp, void *v) |
{ |
{ |
|
|
pool_subpage_free(pp, v); |
pool_subpage_free(pp, v); |
} |
} |
#else |
#endif /* POOL_SUBPAGE */ |
void * |
void * |
pool_page_alloc_nointr(struct pool *pp, int flags) |
pool_page_alloc_nointr(struct pool *pp, int flags) |
{ |
{ |
Line 2327 pool_page_free_nointr(struct pool *pp, v |
|
Line 2406 pool_page_free_nointr(struct pool *pp, v |
|
|
|
uvm_km_free_poolpage_cache(kernel_map, (vaddr_t) v); |
uvm_km_free_poolpage_cache(kernel_map, (vaddr_t) v); |
} |
} |
#endif /* POOL_SUBPAGE */ |
|