version 1.112.6.1, 2006/03/28 09:42:26 |
version 1.132, 2007/10/11 19:45:25 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/*- |
/*- |
* Copyright (c) 1997, 1999, 2000 The NetBSD Foundation, Inc. |
* Copyright (c) 1997, 1999, 2000, 2002 The NetBSD Foundation, Inc. |
* All rights reserved. |
* All rights reserved. |
* |
* |
* This code is derived from software contributed to The NetBSD Foundation |
* This code is derived from software contributed to The NetBSD Foundation |
Line 53 __KERNEL_RCSID(0, "$NetBSD$"); |
|
Line 53 __KERNEL_RCSID(0, "$NetBSD$"); |
|
#include <sys/lock.h> |
#include <sys/lock.h> |
#include <sys/pool.h> |
#include <sys/pool.h> |
#include <sys/syslog.h> |
#include <sys/syslog.h> |
|
#include <sys/debug.h> |
|
|
#include <uvm/uvm.h> |
#include <uvm/uvm.h> |
|
|
Line 82 static struct pool phpool[PHPOOL_MAX]; |
|
Line 83 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 107 struct pool_item_header { |
|
Line 112 struct pool_item_header { |
|
ph_pagelist; /* pool page list */ |
ph_pagelist; /* pool page list */ |
SPLAY_ENTRY(pool_item_header) |
SPLAY_ENTRY(pool_item_header) |
ph_node; /* Off-page page headers */ |
ph_node; /* Off-page page headers */ |
caddr_t ph_page; /* this page's address */ |
void * ph_page; /* this page's address */ |
struct timeval ph_time; /* last referenced */ |
struct timeval ph_time; /* last referenced */ |
union { |
union { |
/* !PR_NOTOUCH */ |
/* !PR_NOTOUCH */ |
Line 179 static void pool_cache_reclaim(struct po |
|
Line 184 static void pool_cache_reclaim(struct po |
|
static void pcg_grouplist_free(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 *, void *, |
struct pool_item_header *); |
struct pool_item_header *); |
static void pool_update_curpage(struct pool *); |
static void pool_update_curpage(struct pool *); |
|
|
static int pool_grow(struct pool *, int); |
static int pool_grow(struct pool *, int); |
void *pool_allocator_alloc(struct pool *, int); |
static void *pool_allocator_alloc(struct pool *, int); |
void pool_allocator_free(struct pool *, void *); |
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 321 pr_item_notouch_index(const struct pool |
|
Line 326 pr_item_notouch_index(const struct pool |
|
int idx; |
int idx; |
|
|
KASSERT(pp->pr_roflags & PR_NOTOUCH); |
KASSERT(pp->pr_roflags & PR_NOTOUCH); |
idx = (cp - ph->ph_page - ph->ph_off) / pp->pr_size; |
idx = (cp - (char *)ph->ph_page - ph->ph_off) / pp->pr_size; |
KASSERT(idx < pp->pr_itemsperpage); |
KASSERT(idx < pp->pr_itemsperpage); |
return idx; |
return idx; |
} |
} |
Line 354 pr_item_notouch_get(const struct pool *p |
|
Line 359 pr_item_notouch_get(const struct pool *p |
|
ph->ph_firstfree = freelist[idx]; |
ph->ph_firstfree = freelist[idx]; |
freelist[idx] = PR_INDEX_USED; |
freelist[idx] = PR_INDEX_USED; |
|
|
return ph->ph_page + ph->ph_off + idx * pp->pr_size; |
return (char *)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) |
{ |
{ |
|
|
|
/* |
|
* we consider pool_item_header with smaller ph_page bigger. |
|
* (this unnatural ordering is for the benefit of pr_find_pagehead.) |
|
*/ |
|
|
if (a->ph_page < b->ph_page) |
if (a->ph_page < b->ph_page) |
return (-1); |
|
else if (a->ph_page > b->ph_page) |
|
return (1); |
return (1); |
|
else if (a->ph_page > b->ph_page) |
|
return (-1); |
else |
else |
return (0); |
return (0); |
} |
} |
Line 372 SPLAY_PROTOTYPE(phtree, pool_item_header |
|
Line 383 SPLAY_PROTOTYPE(phtree, pool_item_header |
|
SPLAY_GENERATE(phtree, pool_item_header, ph_node, phtree_compare); |
SPLAY_GENERATE(phtree, pool_item_header, ph_node, phtree_compare); |
|
|
/* |
/* |
* Return the pool page header based on page address. |
* Return the pool page header based on item 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, void *v) |
{ |
{ |
struct pool_item_header *ph, tmp; |
struct pool_item_header *ph, tmp; |
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) |
if ((pp->pr_roflags & PR_NOALIGN) != 0) { |
return ((struct pool_item_header *)(page + pp->pr_phoffset)); |
tmp.ph_page = (void *)(uintptr_t)v; |
|
ph = SPLAY_FIND(phtree, &pp->pr_phtree, &tmp); |
|
if (ph == NULL) { |
|
ph = SPLAY_ROOT(&pp->pr_phtree); |
|
if (ph != NULL && phtree_compare(&tmp, ph) >= 0) { |
|
ph = SPLAY_NEXT(phtree, &pp->pr_phtree, ph); |
|
} |
|
KASSERT(ph == NULL || phtree_compare(&tmp, ph) < 0); |
|
} |
|
} else { |
|
void *page = |
|
(void *)((uintptr_t)v & pp->pr_alloc->pa_pagemask); |
|
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) { |
|
ph = (struct pool_item_header *)((char *)page + pp->pr_phoffset); |
|
} else { |
|
tmp.ph_page = page; |
|
ph = SPLAY_FIND(phtree, &pp->pr_phtree, &tmp); |
|
} |
|
} |
|
|
tmp.ph_page = page; |
KASSERT(ph == NULL || ((pp->pr_roflags & PR_PHINPAGE) != 0) || |
ph = SPLAY_FIND(phtree, &pp->pr_phtree, &tmp); |
((char *)ph->ph_page <= (char *)v && |
|
(char *)v < (char *)ph->ph_page + pp->pr_alloc->pa_pagesz)); |
return ph; |
return ph; |
} |
} |
|
|
Line 443 pr_rmpage(struct pool *pp, struct pool_i |
|
Line 474 pr_rmpage(struct pool *pp, struct pool_i |
|
pool_update_curpage(pp); |
pool_update_curpage(pp); |
} |
} |
|
|
|
static bool |
|
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; |
|
|
__link_set_foreach(pi, pools) |
__link_set_foreach(pi, pools) |
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, (*pi)->ipl); |
|
|
|
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); |
|
} |
} |
} |
|
|
/* |
/* |
Line 466 link_pool_init(void) |
|
Line 578 link_pool_init(void) |
|
*/ |
*/ |
void |
void |
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 ipl) |
{ |
{ |
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 502 pool_init(struct pool *pp, size_t size, |
|
Line 628 pool_init(struct pool *pp, size_t size, |
|
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; |
} |
} |
|
|
if (align == 0) |
if (align == 0) |
align = ALIGN(1); |
align = ALIGN(1); |
|
|
if (size < sizeof(struct pool_item)) |
if ((flags & PR_NOTOUCH) == 0 && size < sizeof(struct pool_item)) |
size = sizeof(struct pool_item); |
size = sizeof(struct pool_item); |
|
|
size = roundup(size, align); |
size = roundup(size, align); |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (size > palloc->pa_pagesz) |
if (size > palloc->pa_pagesz) |
panic("pool_init: pool item size (%lu) too large", |
panic("pool_init: pool item size (%zu) too large", size); |
(u_long)size); |
|
#endif |
#endif |
|
|
/* |
/* |
Line 546 pool_init(struct pool *pp, size_t size, |
|
Line 675 pool_init(struct pool *pp, size_t size, |
|
pp->pr_hardlimit_warning_last.tv_usec = 0; |
pp->pr_hardlimit_warning_last.tv_usec = 0; |
pp->pr_drain_hook = NULL; |
pp->pr_drain_hook = NULL; |
pp->pr_drain_hook_arg = NULL; |
pp->pr_drain_hook_arg = NULL; |
|
pp->pr_freecheck = NULL; |
|
|
/* |
/* |
* Decide whether to put the page header off page to avoid |
* Decide whether to put the page header off page to avoid |
Line 564 pool_init(struct pool *pp, size_t size, |
|
Line 694 pool_init(struct pool *pp, size_t size, |
|
/* See the comment below about reserved bytes. */ |
/* See the comment below about reserved bytes. */ |
trysize = palloc->pa_pagesz - ((align - ioff) % align); |
trysize = palloc->pa_pagesz - ((align - ioff) % align); |
phsize = ALIGN(sizeof(struct pool_item_header)); |
phsize = ALIGN(sizeof(struct pool_item_header)); |
if ((pp->pr_roflags & PR_NOTOUCH) == 0 && |
if ((pp->pr_roflags & (PR_NOTOUCH | PR_NOALIGN)) == 0 && |
(pp->pr_size < MIN(palloc->pa_pagesz / 16, phsize << 3) || |
(pp->pr_size < MIN(palloc->pa_pagesz / 16, phsize << 3) || |
trysize / pp->pr_size == (trysize - phsize) / pp->pr_size)) { |
trysize / pp->pr_size == (trysize - phsize) / pp->pr_size)) { |
/* Use the end of the page for the page header */ |
/* Use the end of the page for the page header */ |
Line 662 pool_init(struct pool *pp, size_t size, |
|
Line 792 pool_init(struct pool *pp, size_t size, |
|
+ nelem * sizeof(pool_item_freelist_t); |
+ nelem * sizeof(pool_item_freelist_t); |
} |
} |
pool_init(&phpool[idx], sz, 0, 0, 0, |
pool_init(&phpool[idx], sz, 0, 0, 0, |
phpool_names[idx], &pool_allocator_meta); |
phpool_names[idx], &pool_allocator_meta, IPL_VM); |
} |
} |
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
pool_init(&psppool, POOL_SUBPAGE, POOL_SUBPAGE, 0, |
pool_init(&psppool, POOL_SUBPAGE, POOL_SUBPAGE, 0, |
PR_RECURSIVE, "psppool", &pool_allocator_meta); |
PR_RECURSIVE, "psppool", &pool_allocator_meta, IPL_VM); |
#endif |
#endif |
pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0, |
pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0, |
0, "pcgpool", &pool_allocator_meta); |
0, "pcgpool", &pool_allocator_meta, IPL_VM); |
} |
} |
|
|
/* Insert into the list of all pools. */ |
/* Insert into the list of all pools. */ |
Line 683 pool_init(struct pool *pp, size_t size, |
|
Line 813 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 703 pool_destroy(struct pool *pp) |
|
Line 834 pool_destroy(struct pool *pp) |
|
simple_unlock(&pool_head_slock); |
simple_unlock(&pool_head_slock); |
|
|
/* Remove this pool from its allocator's list of pools. */ |
/* 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); |
Line 755 pool_set_drain_hook(struct pool *pp, voi |
|
Line 887 pool_set_drain_hook(struct pool *pp, voi |
|
} |
} |
|
|
static struct pool_item_header * |
static struct pool_item_header * |
pool_alloc_item_header(struct pool *pp, caddr_t storage, int flags) |
pool_alloc_item_header(struct pool *pp, void *storage, int flags) |
{ |
{ |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
int s; |
int s; |
Line 763 pool_alloc_item_header(struct pool *pp, |
|
Line 895 pool_alloc_item_header(struct pool *pp, |
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock) == 0); |
LOCK_ASSERT(simple_lock_held(&pp->pr_slock) == 0); |
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) |
if ((pp->pr_roflags & PR_PHINPAGE) != 0) |
ph = (struct pool_item_header *) (storage + pp->pr_phoffset); |
ph = (struct pool_item_header *) ((char *)storage + pp->pr_phoffset); |
else { |
else { |
s = splvm(); |
s = splvm(); |
ph = pool_get(pp->pr_phpool, flags); |
ph = pool_get(pp->pr_phpool, flags); |
Line 798 pool_get(struct pool *pp, int flags) |
|
Line 930 pool_get(struct pool *pp, int flags) |
|
#endif /* DIAGNOSTIC */ |
#endif /* DIAGNOSTIC */ |
#ifdef LOCKDEBUG |
#ifdef LOCKDEBUG |
if (flags & PR_WAITOK) |
if (flags & PR_WAITOK) |
simple_lock_only_held(NULL, "pool_get(PR_WAITOK)"); |
ASSERT_SLEEPABLE(NULL, "pool_get(PR_WAITOK)"); |
SCHED_ASSERT_UNLOCKED(); |
|
#endif |
#endif |
|
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
Line 897 pool_get(struct pool *pp, int flags) |
|
Line 1028 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. |
|
* |
|
* wake up once a second and try again, |
|
* as the check in pool_cache_put_paddr() is racy. |
|
*/ |
|
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, hz, &pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
pr_enter(pp, file, line); |
return (NULL); |
} |
} |
|
|
/* Start the allocation process over. */ |
/* Start the allocation process over. */ |
Line 1019 pool_get(struct pool *pp, int flags) |
|
Line 1136 pool_get(struct pool *pp, int flags) |
|
} |
} |
|
|
simple_unlock(&pp->pr_slock); |
simple_unlock(&pp->pr_slock); |
|
KASSERT((((vaddr_t)v + pp->pr_itemoffset) & (pp->pr_align - 1)) == 0); |
|
FREECHECK_OUT(&pp->pr_freecheck, v); |
return (v); |
return (v); |
} |
} |
|
|
Line 1030 pool_do_put(struct pool *pp, void *v, st |
|
Line 1149 pool_do_put(struct pool *pp, void *v, st |
|
{ |
{ |
struct pool_item *pi = v; |
struct pool_item *pi = v; |
struct pool_item_header *ph; |
struct pool_item_header *ph; |
caddr_t page; |
|
int s; |
|
|
|
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
LOCK_ASSERT(simple_lock_held(&pp->pr_slock)); |
SCHED_ASSERT_UNLOCKED(); |
FREECHECK_IN(&pp->pr_freecheck, v); |
|
|
page = (caddr_t)((u_long)v & pp->pr_alloc->pa_pagemask); |
|
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (__predict_false(pp->pr_nout == 0)) { |
if (__predict_false(pp->pr_nout == 0)) { |
Line 1046 pool_do_put(struct pool *pp, void *v, st |
|
Line 1161 pool_do_put(struct pool *pp, void *v, st |
|
} |
} |
#endif |
#endif |
|
|
if (__predict_false((ph = pr_find_pagehead(pp, page)) == NULL)) { |
if (__predict_false((ph = pr_find_pagehead(pp, v)) == NULL)) { |
pr_printlog(pp, NULL, printf); |
pr_printlog(pp, NULL, printf); |
panic("pool_put: %s: page header missing", pp->pr_wchan); |
panic("pool_put: %s: page header missing", pp->pr_wchan); |
} |
} |
|
|
#ifdef LOCKDEBUG |
|
/* |
|
* Check if we're freeing a locked simple lock. |
|
*/ |
|
simple_lock_freecheck((caddr_t)pi, ((caddr_t)pi) + pp->pr_size); |
|
#endif |
|
|
|
/* |
/* |
* Return to item list. |
* Return to item list. |
*/ |
*/ |
Line 1093 pool_do_put(struct pool *pp, void *v, st |
|
Line 1201 pool_do_put(struct pool *pp, void *v, st |
|
pp->pr_flags &= ~PR_WANTED; |
pp->pr_flags &= ~PR_WANTED; |
if (ph->ph_nmissing == 0) |
if (ph->ph_nmissing == 0) |
pp->pr_nidle++; |
pp->pr_nidle++; |
wakeup((caddr_t)pp); |
wakeup((void *)pp); |
return; |
return; |
} |
} |
|
|
Line 1114 pool_do_put(struct pool *pp, void *v, st |
|
Line 1222 pool_do_put(struct pool *pp, void *v, st |
|
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))) { |
pr_rmpage(pp, ph, pq); |
pr_rmpage(pp, ph, pq); |
} else { |
} else { |
LIST_REMOVE(ph, ph_pagelist); |
LIST_REMOVE(ph, ph_pagelist); |
Line 1126 pool_do_put(struct pool *pp, void *v, st |
|
Line 1234 pool_do_put(struct pool *pp, void *v, st |
|
* 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 1220 pool_grow(struct pool *pp, int flags) |
|
Line 1326 pool_grow(struct pool *pp, int flags) |
|
simple_lock(&pp->pr_slock); |
simple_lock(&pp->pr_slock); |
pool_prime_page(pp, cp, ph); |
pool_prime_page(pp, cp, ph); |
pp->pr_npagealloc++; |
pp->pr_npagealloc++; |
pp->pr_minpages++; |
|
return 0; |
return 0; |
} |
} |
|
|
Line 1258 pool_prime(struct pool *pp, int n) |
|
Line 1363 pool_prime(struct pool *pp, int n) |
|
* Note, we must be called with the pool descriptor LOCKED. |
* Note, we must be called with the pool descriptor LOCKED. |
*/ |
*/ |
static void |
static void |
pool_prime_page(struct pool *pp, caddr_t storage, struct pool_item_header *ph) |
pool_prime_page(struct pool *pp, void *storage, struct pool_item_header *ph) |
{ |
{ |
struct pool_item *pi; |
struct pool_item *pi; |
caddr_t cp = storage; |
void *cp = storage; |
unsigned int align = pp->pr_align; |
const unsigned int align = pp->pr_align; |
unsigned int ioff = pp->pr_itemoffset; |
const 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)); |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (((u_long)cp & (pp->pr_alloc->pa_pagesz - 1)) != 0) |
if ((pp->pr_roflags & PR_NOALIGN) == 0 && |
|
((uintptr_t)cp & (pp->pr_alloc->pa_pagesz - 1)) != 0) |
panic("pool_prime_page: %s: unaligned page", pp->pr_wchan); |
panic("pool_prime_page: %s: unaligned page", pp->pr_wchan); |
#endif |
#endif |
|
|
Line 1281 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1386 pool_prime_page(struct pool *pp, caddr_t |
|
LIST_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 1292 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1395 pool_prime_page(struct pool *pp, caddr_t |
|
/* |
/* |
* Color this page. |
* Color this page. |
*/ |
*/ |
cp = (caddr_t)(cp + pp->pr_curcolor); |
cp = (char *)cp + pp->pr_curcolor; |
if ((pp->pr_curcolor += align) > pp->pr_maxcolor) |
if ((pp->pr_curcolor += align) > pp->pr_maxcolor) |
pp->pr_curcolor = 0; |
pp->pr_curcolor = 0; |
|
|
Line 1300 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1403 pool_prime_page(struct pool *pp, caddr_t |
|
* Adjust storage to apply aligment to `pr_itemoffset' in each item. |
* Adjust storage to apply aligment to `pr_itemoffset' in each item. |
*/ |
*/ |
if (ioff != 0) |
if (ioff != 0) |
cp = (caddr_t)(cp + (align - ioff)); |
cp = (char *)cp + align - ioff; |
|
|
|
KASSERT((((vaddr_t)cp + ioff) & (align - 1)) == 0); |
|
|
/* |
/* |
* Insert remaining chunks on the bucket list. |
* Insert remaining chunks on the bucket list. |
Line 1312 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1417 pool_prime_page(struct pool *pp, caddr_t |
|
pool_item_freelist_t *freelist = PR_FREELIST(ph); |
pool_item_freelist_t *freelist = PR_FREELIST(ph); |
int i; |
int i; |
|
|
ph->ph_off = cp - storage; |
ph->ph_off = (char *)cp - (char *)storage; |
ph->ph_firstfree = 0; |
ph->ph_firstfree = 0; |
for (i = 0; i < n - 1; i++) |
for (i = 0; i < n - 1; i++) |
freelist[i] = i + 1; |
freelist[i] = i + 1; |
Line 1328 pool_prime_page(struct pool *pp, caddr_t |
|
Line 1433 pool_prime_page(struct pool *pp, caddr_t |
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
pi->pi_magic = PI_MAGIC; |
pi->pi_magic = PI_MAGIC; |
#endif |
#endif |
cp = (caddr_t)(cp + pp->pr_size); |
cp = (char *)cp + pp->pr_size; |
|
|
|
KASSERT((((vaddr_t)cp + ioff) & (align - 1)) == 0); |
} |
} |
} |
} |
|
|
Line 1449 pool_reclaim(struct pool *pp) |
|
Line 1556 pool_reclaim(struct pool *pp) |
|
struct pool_pagelist pq; |
struct pool_pagelist pq; |
struct pool_cache_grouplist pcgl; |
struct pool_cache_grouplist pcgl; |
struct timeval curtime, diff; |
struct timeval curtime, diff; |
int s; |
|
|
|
if (pp->pr_drain_hook != NULL) { |
if (pp->pr_drain_hook != NULL) { |
/* |
/* |
Line 1471 pool_reclaim(struct pool *pp) |
|
Line 1577 pool_reclaim(struct pool *pp) |
|
LIST_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
LIST_FOREACH(pc, &pp->pr_cachelist, pc_poollist) |
pool_cache_reclaim(pc, &pq, &pcgl); |
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 1588 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 1512 pool_reclaim(struct pool *pp) |
|
Line 1617 pool_reclaim(struct pool *pp) |
|
* Drain pools, one at a time. |
* Drain pools, one at a time. |
* |
* |
* Note, we must never be called from an interrupt context. |
* Note, we must never be called from an interrupt context. |
|
* |
|
* XXX Pool can disappear while draining. |
*/ |
*/ |
void |
void |
pool_drain(void *arg) |
pool_drain(void *arg) |
Line 1530 pool_drain(void *arg) |
|
Line 1637 pool_drain(void *arg) |
|
drainpp = LIST_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 1680 pool_print1(struct pool *pp, const char |
|
Line 1788 pool_print1(struct pool *pp, const char |
|
(*pr)("\n"); |
(*pr)("\n"); |
if ((pp->pr_roflags & PR_LOGGING) == 0) |
if ((pp->pr_roflags & PR_LOGGING) == 0) |
(*pr)("\tno log\n"); |
(*pr)("\tno log\n"); |
else |
else { |
pr_printlog(pp, NULL, pr); |
pr_printlog(pp, NULL, pr); |
|
} |
|
|
skip_log: |
skip_log: |
if (print_cache == 0) |
if (print_cache == 0) |
|
|
pool_chk_page(struct pool *pp, const char *label, struct pool_item_header *ph) |
pool_chk_page(struct pool *pp, const char *label, struct pool_item_header *ph) |
{ |
{ |
struct pool_item *pi; |
struct pool_item *pi; |
caddr_t page; |
void *page; |
int n; |
int n; |
|
|
page = (caddr_t)((u_long)ph & pp->pr_alloc->pa_pagemask); |
if ((pp->pr_roflags & PR_NOALIGN) == 0) { |
if (page != ph->ph_page && |
page = (void *)((uintptr_t)ph & pp->pr_alloc->pa_pagemask); |
(pp->pr_roflags & PR_PHINPAGE) != 0) { |
if (page != ph->ph_page && |
if (label != NULL) |
(pp->pr_roflags & PR_PHINPAGE) != 0) { |
printf("%s: ", label); |
if (label != NULL) |
printf("pool(%p:%s): page inconsistency: page %p;" |
printf("%s: ", label); |
" at page head addr %p (p %p)\n", pp, |
printf("pool(%p:%s): page inconsistency: page %p;" |
pp->pr_wchan, ph->ph_page, |
" at page head addr %p (p %p)\n", pp, |
ph, page); |
pp->pr_wchan, ph->ph_page, |
return 1; |
ph, page); |
|
return 1; |
|
} |
} |
} |
|
|
if ((pp->pr_roflags & PR_NOTOUCH) != 0) |
if ((pp->pr_roflags & PR_NOTOUCH) != 0) |
Line 1756 pool_chk_page(struct pool *pp, const cha |
|
Line 1867 pool_chk_page(struct pool *pp, const cha |
|
if (label != NULL) |
if (label != NULL) |
printf("%s: ", label); |
printf("%s: ", label); |
printf("pool(%s): free list modified: magic=%x;" |
printf("pool(%s): free list modified: magic=%x;" |
" page %p; item ordinal %d;" |
" page %p; item ordinal %d; addr %p\n", |
" addr %p (p %p)\n", |
|
pp->pr_wchan, pi->pi_magic, ph->ph_page, |
pp->pr_wchan, pi->pi_magic, ph->ph_page, |
n, pi, page); |
n, pi); |
panic("pool"); |
panic("pool"); |
} |
} |
#endif |
#endif |
page = |
if ((pp->pr_roflags & PR_NOALIGN) != 0) { |
(caddr_t)((u_long)pi & pp->pr_alloc->pa_pagemask); |
continue; |
|
} |
|
page = (void *)((uintptr_t)pi & pp->pr_alloc->pa_pagemask); |
if (page == ph->ph_page) |
if (page == ph->ph_page) |
continue; |
continue; |
|
|
Line 1928 pool_cache_get_paddr(struct pool_cache * |
|
Line 2040 pool_cache_get_paddr(struct pool_cache * |
|
|
|
#ifdef LOCKDEBUG |
#ifdef LOCKDEBUG |
if (flags & PR_WAITOK) |
if (flags & PR_WAITOK) |
simple_lock_only_held(NULL, "pool_cache_get(PR_WAITOK)"); |
ASSERT_SLEEPABLE(NULL, "pool_cache_get(PR_WAITOK)"); |
#endif |
#endif |
|
|
simple_lock(&pc->pc_slock); |
simple_lock(&pc->pc_slock); |
Line 1958 pool_cache_get_paddr(struct pool_cache * |
|
Line 2070 pool_cache_get_paddr(struct pool_cache * |
|
return (NULL); |
return (NULL); |
} |
} |
} |
} |
|
KASSERT((((vaddr_t)object + pc->pc_pool->pr_itemoffset) & |
|
(pc->pc_pool->pr_align - 1)) == 0); |
if (object != NULL && pap != NULL) { |
if (object != NULL && pap != NULL) { |
#ifdef POOL_VTOPHYS |
#ifdef POOL_VTOPHYS |
*pap = POOL_VTOPHYS(object); |
*pap = POOL_VTOPHYS(object); |
Line 1965 pool_cache_get_paddr(struct pool_cache * |
|
Line 2079 pool_cache_get_paddr(struct pool_cache * |
|
*pap = POOL_PADDR_INVALID; |
*pap = POOL_PADDR_INVALID; |
#endif |
#endif |
} |
} |
|
|
|
FREECHECK_OUT(&pc->pc_freecheck, object); |
return (object); |
return (object); |
} |
} |
|
|
Line 1978 pool_cache_get_paddr(struct pool_cache * |
|
Line 2094 pool_cache_get_paddr(struct pool_cache * |
|
} |
} |
simple_unlock(&pc->pc_slock); |
simple_unlock(&pc->pc_slock); |
|
|
|
KASSERT((((vaddr_t)object + pc->pc_pool->pr_itemoffset) & |
|
(pc->pc_pool->pr_align - 1)) == 0); |
|
FREECHECK_OUT(&pc->pc_freecheck, object); |
return (object); |
return (object); |
} |
} |
|
|
Line 1993 pool_cache_put_paddr(struct pool_cache * |
|
Line 2112 pool_cache_put_paddr(struct pool_cache * |
|
struct pool_cache_group *pcg; |
struct pool_cache_group *pcg; |
int s; |
int s; |
|
|
|
FREECHECK_IN(&pc->pc_freecheck, object); |
|
|
if (__predict_false((pc->pc_pool->pr_flags & PR_WANTED) != 0)) { |
if (__predict_false((pc->pc_pool->pr_flags & PR_WANTED) != 0)) { |
goto destruct; |
goto destruct; |
} |
} |
Line 2058 pool_cache_destruct_object(struct pool_c |
|
Line 2179 pool_cache_destruct_object(struct pool_c |
|
pool_put(pc->pc_pool, object); |
pool_put(pc->pc_pool, object); |
} |
} |
|
|
|
/* |
|
* pool_do_cache_invalidate_grouplist: |
|
* |
|
* Invalidate a single grouplist and destruct all objects. |
|
* XXX This is too expensive. We should swap the list then |
|
* unlock. |
|
*/ |
static void |
static void |
pool_do_cache_invalidate_grouplist(struct pool_cache_grouplist *pcgsl, |
pool_do_cache_invalidate_grouplist(struct pool_cache_grouplist *pcgsl, |
struct pool_cache *pc, struct pool_pagelist *pq, |
struct pool_cache *pc, struct pool_pagelist *pq, |
struct pool_cache_grouplist *pcgdl) |
struct pool_cache_grouplist *pcgdl) |
{ |
{ |
struct pool_cache_group *pcg, *npcg; |
struct pool_cache_group *pcg; |
void *object; |
void *object; |
|
|
for (pcg = LIST_FIRST(pcgsl); pcg != NULL; pcg = npcg) { |
LOCK_ASSERT(simple_lock_held(&pc->pc_slock)); |
npcg = LIST_NEXT(pcg, pcg_list); |
LOCK_ASSERT(simple_lock_held(&pc->pc_pool->pr_slock)); |
|
|
|
while ((pcg = LIST_FIRST(pcgsl)) != NULL) { |
|
pc->pc_ngroups--; |
|
LIST_REMOVE(pcg, pcg_list); |
|
LIST_INSERT_HEAD(pcgdl, pcg, pcg_list); |
|
pc->pc_nitems -= pcg->pcg_avail; |
|
simple_unlock(&pc->pc_pool->pr_slock); |
|
simple_unlock(&pc->pc_slock); |
|
|
while (pcg->pcg_avail != 0) { |
while (pcg->pcg_avail != 0) { |
pc->pc_nitems--; |
|
object = pcg_get(pcg, NULL); |
object = pcg_get(pcg, 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); |
|
simple_lock(&pc->pc_pool->pr_slock); |
pool_do_put(pc->pc_pool, object, pq); |
pool_do_put(pc->pc_pool, object, pq); |
|
simple_unlock(&pc->pc_pool->pr_slock); |
} |
} |
pc->pc_ngroups--; |
|
LIST_REMOVE(pcg, pcg_list); |
simple_lock(&pc->pc_slock); |
LIST_INSERT_HEAD(pcgdl, pcg, pcg_list); |
simple_lock(&pc->pc_pool->pr_slock); |
} |
} |
} |
} |
|
|
Line 2167 void pool_page_free(struct pool *, void |
|
Line 2305 void pool_page_free(struct pool *, void |
|
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
struct pool_allocator pool_allocator_kmem_fullpage = { |
struct pool_allocator pool_allocator_kmem_fullpage = { |
pool_page_alloc, pool_page_free, 0, |
pool_page_alloc, pool_page_free, 0, |
|
.pa_backingmapptr = &kmem_map, |
}; |
}; |
#else |
#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 |
#endif |
|
|
Line 2180 void pool_page_free_nointr(struct pool * |
|
Line 2320 void pool_page_free_nointr(struct pool * |
|
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
struct pool_allocator pool_allocator_nointr_fullpage = { |
struct pool_allocator pool_allocator_nointr_fullpage = { |
pool_page_alloc_nointr, pool_page_free_nointr, 0, |
pool_page_alloc_nointr, pool_page_free_nointr, 0, |
|
.pa_backingmapptr = &kernel_map, |
}; |
}; |
#else |
#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 |
#endif |
|
|
Line 2193 void pool_subpage_free(struct pool *, vo |
|
Line 2335 void pool_subpage_free(struct pool *, vo |
|
|
|
struct pool_allocator pool_allocator_kmem = { |
struct pool_allocator pool_allocator_kmem = { |
pool_subpage_alloc, pool_subpage_free, POOL_SUBPAGE, |
pool_subpage_alloc, pool_subpage_free, POOL_SUBPAGE, |
|
.pa_backingmapptr = &kmem_map, |
}; |
}; |
|
|
void *pool_subpage_alloc_nointr(struct pool *, int); |
void *pool_subpage_alloc_nointr(struct pool *, int); |
Line 2200 void pool_subpage_free_nointr(struct poo |
|
Line 2343 void pool_subpage_free_nointr(struct poo |
|
|
|
struct pool_allocator pool_allocator_nointr = { |
struct pool_allocator pool_allocator_nointr = { |
pool_subpage_alloc, pool_subpage_free, POOL_SUBPAGE, |
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, that use this allocator. |
* We only run the drain hook here if PR_NOWAIT. |
* 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); |
|
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 * |
pool_page_alloc(struct pool *pp, int flags) |
pool_page_alloc(struct pool *pp, int flags) |
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
bool waitok = (flags & PR_WAITOK) ? true : false; |
|
|
return ((void *) uvm_km_alloc_poolpage_cache(kmem_map, waitok)); |
return ((void *) uvm_km_alloc_poolpage_cache(kmem_map, waitok)); |
} |
} |
Line 2339 pool_page_free(struct pool *pp, void *v) |
|
Line 2398 pool_page_free(struct pool *pp, void *v) |
|
static void * |
static void * |
pool_page_alloc_meta(struct pool *pp, int flags) |
pool_page_alloc_meta(struct pool *pp, int flags) |
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
bool waitok = (flags & PR_WAITOK) ? true : false; |
|
|
return ((void *) uvm_km_alloc_poolpage(kmem_map, waitok)); |
return ((void *) uvm_km_alloc_poolpage(kmem_map, waitok)); |
} |
} |
Line 2391 pool_subpage_free_nointr(struct pool *pp |
|
Line 2450 pool_subpage_free_nointr(struct pool *pp |
|
void * |
void * |
pool_page_alloc_nointr(struct pool *pp, int flags) |
pool_page_alloc_nointr(struct pool *pp, int flags) |
{ |
{ |
boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE; |
bool waitok = (flags & PR_WAITOK) ? true : false; |
|
|
return ((void *) uvm_km_alloc_poolpage_cache(kernel_map, waitok)); |
return ((void *) uvm_km_alloc_poolpage_cache(kernel_map, waitok)); |
} |
} |