version 1.175, 2009/10/08 21:54:45 |
version 1.186.2.1, 2011/06/06 09:09:35 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/*- |
/*- |
* Copyright (c) 1997, 1999, 2000, 2002, 2007, 2008 The NetBSD Foundation, Inc. |
* Copyright (c) 1997, 1999, 2000, 2002, 2007, 2008, 2010 |
|
* 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 54 __KERNEL_RCSID(0, "$NetBSD$"); |
|
#include <sys/cpu.h> |
#include <sys/cpu.h> |
#include <sys/atomic.h> |
#include <sys/atomic.h> |
|
|
#include <uvm/uvm.h> |
#include <uvm/uvm_extern.h> |
|
#ifdef DIAGNOSTIC |
|
#include <uvm/uvm_km.h> /* uvm_km_va_drain */ |
|
#endif |
|
|
/* |
/* |
* Pool resource management utility. |
* Pool resource management utility. |
Line 104 static struct pool *drainpp; |
|
Line 108 static struct pool *drainpp; |
|
static kmutex_t pool_head_lock; |
static kmutex_t pool_head_lock; |
static kcondvar_t pool_busy; |
static kcondvar_t pool_busy; |
|
|
|
/* This lock protects initialization of a potentially shared pool allocator */ |
|
static kmutex_t pool_allocator_lock; |
|
|
typedef uint32_t pool_item_bitmap_t; |
typedef uint32_t pool_item_bitmap_t; |
#define BITMAP_SIZE (CHAR_BIT * sizeof(pool_item_bitmap_t)) |
#define BITMAP_SIZE (CHAR_BIT * sizeof(pool_item_bitmap_t)) |
#define BITMAP_MASK (BITMAP_SIZE - 1) |
#define BITMAP_MASK (BITMAP_SIZE - 1) |
Line 175 static struct pool pcg_large_pool; |
|
Line 182 static struct pool pcg_large_pool; |
|
static struct pool cache_pool; |
static struct pool cache_pool; |
static struct pool cache_cpu_pool; |
static struct pool cache_cpu_pool; |
|
|
|
pool_cache_t pnbuf_cache; /* pathname buffer cache */ |
|
|
/* List of all caches. */ |
/* List of all caches. */ |
TAILQ_HEAD(,pool_cache) pool_cache_head = |
TAILQ_HEAD(,pool_cache) pool_cache_head = |
TAILQ_HEAD_INITIALIZER(pool_cache_head); |
TAILQ_HEAD_INITIALIZER(pool_cache_head); |
Line 231 int pool_logsize = POOL_LOGSIZE; |
|
Line 240 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; |
struct pool_log *pl; |
struct pool_log *pl; |
|
|
if ((pp->pr_roflags & PR_LOGGING) == 0) |
if ((pp->pr_roflags & PR_LOGGING) == 0) |
return; |
return; |
|
|
|
if (pp->pr_log == NULL) { |
|
if (kmem_map != NULL) |
|
pp->pr_log = malloc( |
|
pool_logsize * sizeof(struct pool_log), |
|
M_TEMP, M_NOWAIT | M_ZERO); |
|
if (pp->pr_log == NULL) |
|
return; |
|
pp->pr_curlogentry = 0; |
|
pp->pr_logsize = pool_logsize; |
|
} |
|
|
/* |
/* |
* Fill in the current entry. Wrap around and overwrite |
* Fill in the current entry. Wrap around and overwrite |
* the oldest entry if necessary. |
* the oldest entry if necessary. |
*/ |
*/ |
|
n = pp->pr_curlogentry; |
pl = &pp->pr_log[n]; |
pl = &pp->pr_log[n]; |
pl->pl_file = file; |
pl->pl_file = file; |
pl->pl_line = line; |
pl->pl_line = line; |
Line 258 pr_printlog(struct pool *pp, struct pool |
|
Line 279 pr_printlog(struct pool *pp, struct pool |
|
int i = pp->pr_logsize; |
int i = pp->pr_logsize; |
int n = pp->pr_curlogentry; |
int n = pp->pr_curlogentry; |
|
|
if ((pp->pr_roflags & PR_LOGGING) == 0) |
if (pp->pr_log == NULL) |
return; |
return; |
|
|
/* |
/* |
Line 546 pool_reclaim_register(struct pool *pp) |
|
Line 567 pool_reclaim_register(struct pool *pp) |
|
callback_register(&vm_map_to_kernel(map)->vmk_reclaim_callback, |
callback_register(&vm_map_to_kernel(map)->vmk_reclaim_callback, |
&pp->pr_reclaimerentry, pp, pool_reclaim_callback); |
&pp->pr_reclaimerentry, pp, pool_reclaim_callback); |
splx(s); |
splx(s); |
|
|
|
#ifdef DIAGNOSTIC |
|
/* Diagnostic drain attempt. */ |
|
uvm_km_va_drain(map, 0); |
|
#endif |
} |
} |
|
|
static void |
static void |
Line 590 pool_subsystem_init(void) |
|
Line 616 pool_subsystem_init(void) |
|
struct pool_allocator *pa; |
struct pool_allocator *pa; |
|
|
mutex_init(&pool_head_lock, MUTEX_DEFAULT, IPL_NONE); |
mutex_init(&pool_head_lock, MUTEX_DEFAULT, IPL_NONE); |
|
mutex_init(&pool_allocator_lock, MUTEX_DEFAULT, IPL_NONE); |
cv_init(&pool_busy, "poolbusy"); |
cv_init(&pool_busy, "poolbusy"); |
|
|
while ((pa = SLIST_FIRST(&pa_deferinitq)) != NULL) { |
while ((pa = SLIST_FIRST(&pa_deferinitq)) != NULL) { |
Line 650 pool_init(struct pool *pp, size_t size, |
|
Line 677 pool_init(struct pool *pp, size_t size, |
|
palloc = &pool_allocator_nointr_fullpage; |
palloc = &pool_allocator_nointr_fullpage; |
} |
} |
#endif /* POOL_SUBPAGE */ |
#endif /* POOL_SUBPAGE */ |
if ((palloc->pa_flags & PA_INITIALIZED) == 0) { |
if (!cold) |
|
mutex_enter(&pool_allocator_lock); |
|
if (palloc->pa_refcnt++ == 0) { |
if (palloc->pa_pagesz == 0) |
if (palloc->pa_pagesz == 0) |
palloc->pa_pagesz = PAGE_SIZE; |
palloc->pa_pagesz = PAGE_SIZE; |
|
|
Line 663 pool_init(struct pool *pp, size_t size, |
|
Line 692 pool_init(struct pool *pp, size_t size, |
|
if (palloc->pa_backingmapptr != NULL) { |
if (palloc->pa_backingmapptr != NULL) { |
pa_reclaim_register(palloc); |
pa_reclaim_register(palloc); |
} |
} |
palloc->pa_flags |= PA_INITIALIZED; |
|
} |
} |
|
if (!cold) |
|
mutex_exit(&pool_allocator_lock); |
|
|
if (align == 0) |
if (align == 0) |
align = ALIGN(1); |
align = ALIGN(1); |
Line 787 pool_init(struct pool *pp, size_t size, |
|
Line 817 pool_init(struct pool *pp, size_t size, |
|
pp->pr_nidle = 0; |
pp->pr_nidle = 0; |
pp->pr_refcnt = 0; |
pp->pr_refcnt = 0; |
|
|
#ifdef POOL_DIAGNOSTIC |
pp->pr_log = NULL; |
if (flags & PR_LOGGING) { |
|
if (kmem_map == NULL || |
|
(pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log), |
|
M_TEMP, M_NOWAIT)) == NULL) |
|
pp->pr_roflags &= ~PR_LOGGING; |
|
pp->pr_curlogentry = 0; |
|
pp->pr_logsize = pool_logsize; |
|
} |
|
#endif |
|
|
|
pp->pr_entered_file = NULL; |
pp->pr_entered_file = NULL; |
pp->pr_entered_line = 0; |
pp->pr_entered_line = 0; |
Line 845 pool_init(struct pool *pp, size_t size, |
|
Line 866 pool_init(struct pool *pp, size_t size, |
|
} |
} |
|
|
/* Insert into the list of all pools. */ |
/* Insert into the list of all pools. */ |
if (__predict_true(!cold)) |
if (!cold) |
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { |
TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { |
if (strcmp(pp1->pr_wchan, pp->pr_wchan) > 0) |
if (strcmp(pp1->pr_wchan, pp->pr_wchan) > 0) |
Line 855 pool_init(struct pool *pp, size_t size, |
|
Line 876 pool_init(struct pool *pp, size_t size, |
|
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
else |
else |
TAILQ_INSERT_BEFORE(pp1, pp, pr_poollist); |
TAILQ_INSERT_BEFORE(pp1, pp, pr_poollist); |
if (__predict_true(!cold)) |
if (!cold) |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
|
|
/* Insert this into the list of pools using this allocator. */ |
/* Insert this into the list of pools using this allocator. */ |
if (__predict_true(!cold)) |
if (!cold) |
mutex_enter(&palloc->pa_lock); |
mutex_enter(&palloc->pa_lock); |
TAILQ_INSERT_TAIL(&palloc->pa_list, pp, pr_alloc_list); |
TAILQ_INSERT_TAIL(&palloc->pa_list, pp, pr_alloc_list); |
if (__predict_true(!cold)) |
if (!cold) |
mutex_exit(&palloc->pa_lock); |
mutex_exit(&palloc->pa_lock); |
|
|
pool_reclaim_register(pp); |
pool_reclaim_register(pp); |
Line 892 pool_destroy(struct pool *pp) |
|
Line 913 pool_destroy(struct pool *pp) |
|
TAILQ_REMOVE(&pp->pr_alloc->pa_list, pp, pr_alloc_list); |
TAILQ_REMOVE(&pp->pr_alloc->pa_list, pp, pr_alloc_list); |
mutex_exit(&pp->pr_alloc->pa_lock); |
mutex_exit(&pp->pr_alloc->pa_lock); |
|
|
|
mutex_enter(&pool_allocator_lock); |
|
if (--pp->pr_alloc->pa_refcnt == 0) |
|
mutex_destroy(&pp->pr_alloc->pa_lock); |
|
mutex_exit(&pool_allocator_lock); |
|
|
mutex_enter(&pp->pr_lock); |
mutex_enter(&pp->pr_lock); |
|
|
KASSERT(pp->pr_cache == NULL); |
KASSERT(pp->pr_cache == NULL); |
Line 917 pool_destroy(struct pool *pp) |
|
Line 943 pool_destroy(struct pool *pp) |
|
pr_pagelist_free(pp, &pq); |
pr_pagelist_free(pp, &pq); |
|
|
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
if ((pp->pr_roflags & PR_LOGGING) != 0) |
if (pp->pr_log != NULL) { |
free(pp->pr_log, M_TEMP); |
free(pp->pr_log, M_TEMP); |
|
pp->pr_log = NULL; |
|
} |
#endif |
#endif |
|
|
cv_destroy(&pp->pr_cv); |
cv_destroy(&pp->pr_cv); |
Line 966 pool_get(struct pool *pp, int flags) |
|
Line 994 pool_get(struct pool *pp, int flags) |
|
void *v; |
void *v; |
|
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (__predict_false(pp->pr_itemsperpage == 0)) |
if (pp->pr_itemsperpage == 0) |
panic("pool_get: pool %p: pr_itemsperpage is zero, " |
panic("pool_get: pool '%s': pr_itemsperpage is zero, " |
"pool not initialized?", pp); |
"pool not initialized?", pp->pr_wchan); |
if (__predict_false(curlwp == NULL && doing_shutdown == 0 && |
if ((cpu_intr_p() || cpu_softintr_p()) && pp->pr_ipl == IPL_NONE && |
(flags & PR_WAITOK) != 0)) |
!cold && panicstr == NULL) |
panic("pool_get: %s: must have NOWAIT", pp->pr_wchan); |
panic("pool '%s' is IPL_NONE, but called from " |
|
"interrupt context\n", pp->pr_wchan); |
#endif /* DIAGNOSTIC */ |
#endif |
#ifdef LOCKDEBUG |
|
if (flags & PR_WAITOK) { |
if (flags & PR_WAITOK) { |
ASSERT_SLEEPABLE(); |
ASSERT_SLEEPABLE(); |
} |
} |
#endif |
|
|
|
mutex_enter(&pp->pr_lock); |
mutex_enter(&pp->pr_lock); |
pr_enter(pp, file, line); |
pr_enter(pp, file, line); |
Line 1586 pool_sethardlimit(struct pool *pp, int n |
|
Line 1612 pool_sethardlimit(struct pool *pp, int n |
|
|
|
/* |
/* |
* Release all complete pages that have not been used recently. |
* Release all complete pages that have not been used recently. |
|
* |
|
* Might be called from interrupt context. |
*/ |
*/ |
int |
int |
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
Line 1600 pool_reclaim(struct pool *pp) |
|
Line 1628 pool_reclaim(struct pool *pp) |
|
bool klock; |
bool klock; |
int rv; |
int rv; |
|
|
|
if (cpu_intr_p() || cpu_softintr_p()) { |
|
KASSERT(pp->pr_ipl != IPL_NONE); |
|
} |
|
|
if (pp->pr_drain_hook != NULL) { |
if (pp->pr_drain_hook != NULL) { |
/* |
/* |
* The drain hook must be called with the pool unlocked. |
* The drain hook must be called with the pool unlocked. |
Line 1718 pool_drain_start(struct pool **ppp, uint |
|
Line 1750 pool_drain_start(struct pool **ppp, uint |
|
} |
} |
} |
} |
|
|
void |
bool |
pool_drain_end(struct pool *pp, uint64_t where) |
pool_drain_end(struct pool *pp, uint64_t where) |
{ |
{ |
|
bool reclaimed; |
|
|
if (pp == NULL) |
if (pp == NULL) |
return; |
return false; |
|
|
KASSERT(pp->pr_refcnt > 0); |
KASSERT(pp->pr_refcnt > 0); |
|
|
Line 1732 pool_drain_end(struct pool *pp, uint64_t |
|
Line 1765 pool_drain_end(struct pool *pp, uint64_t |
|
xc_wait(where); |
xc_wait(where); |
|
|
/* Drain the cache (if any) and pool.. */ |
/* Drain the cache (if any) and pool.. */ |
pool_reclaim(pp); |
reclaimed = pool_reclaim(pp); |
|
|
/* Finally, unlock the pool. */ |
/* Finally, unlock the pool. */ |
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
pp->pr_refcnt--; |
pp->pr_refcnt--; |
cv_broadcast(&pool_busy); |
cv_broadcast(&pool_busy); |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
|
|
|
return reclaimed; |
} |
} |
|
|
/* |
/* |
Line 1887 pool_print1(struct pool *pp, const char |
|
Line 1922 pool_print1(struct pool *pp, const char |
|
if (pc != NULL) { |
if (pc != NULL) { |
cpuhit = 0; |
cpuhit = 0; |
cpumiss = 0; |
cpumiss = 0; |
for (i = 0; i < MAXCPUS; i++) { |
for (i = 0; i < __arraycount(pc->pc_cpus); i++) { |
if ((cc = pc->pc_cpus[i]) == NULL) |
if ((cc = pc->pc_cpus[i]) == NULL) |
continue; |
continue; |
cpuhit += cc->cc_hits; |
cpuhit += cc->cc_hits; |
Line 2141 pool_cache_destroy(pool_cache_t pc) |
|
Line 2176 pool_cache_destroy(pool_cache_t pc) |
|
mutex_exit(&pp->pr_lock); |
mutex_exit(&pp->pr_lock); |
|
|
/* Destroy per-CPU data */ |
/* Destroy per-CPU data */ |
for (i = 0; i < MAXCPUS; i++) |
for (i = 0; i < __arraycount(pc->pc_cpus); i++) |
pool_cache_invalidate_cpu(pc, i); |
pool_cache_invalidate_cpu(pc, i); |
|
|
/* Finally, destroy it. */ |
/* Finally, destroy it. */ |
Line 2163 pool_cache_cpu_init1(struct cpu_info *ci |
|
Line 2198 pool_cache_cpu_init1(struct cpu_info *ci |
|
|
|
index = ci->ci_index; |
index = ci->ci_index; |
|
|
KASSERT(index < MAXCPUS); |
KASSERT(index < __arraycount(pc->pc_cpus)); |
|
|
if ((cc = pc->pc_cpus[index]) != NULL) { |
if ((cc = pc->pc_cpus[index]) != NULL) { |
KASSERT(cc->cc_cpuindex == index); |
KASSERT(cc->cc_cpuindex == index); |
Line 2289 pool_cache_invalidate_groups(pool_cache_ |
|
Line 2324 pool_cache_invalidate_groups(pool_cache_ |
|
* |
* |
* Invalidate a pool cache (destruct and release all of the |
* Invalidate a pool cache (destruct and release all of the |
* cached objects). Does not reclaim objects from the pool. |
* cached objects). Does not reclaim objects from the pool. |
|
* |
|
* Note: For pool caches that provide constructed objects, there |
|
* is an assumption that another level of synchronization is occurring |
|
* between the input to the constructor and the cache invalidation. |
*/ |
*/ |
void |
void |
pool_cache_invalidate(pool_cache_t pc) |
pool_cache_invalidate(pool_cache_t pc) |
{ |
{ |
pcg_t *full, *empty, *part; |
pcg_t *full, *empty, *part; |
|
#if 0 |
|
uint64_t where; |
|
|
|
if (ncpu < 2 || !mp_online) { |
|
/* |
|
* We might be called early enough in the boot process |
|
* for the CPU data structures to not be fully initialized. |
|
* In this case, simply gather the local CPU's cache now |
|
* since it will be the only one running. |
|
*/ |
|
pool_cache_xcall(pc); |
|
} else { |
|
/* |
|
* Gather all of the CPU-specific caches into the |
|
* global cache. |
|
*/ |
|
where = xc_broadcast(0, (xcfunc_t)pool_cache_xcall, pc, NULL); |
|
xc_wait(where); |
|
} |
|
#endif |
mutex_enter(&pc->pc_lock); |
mutex_enter(&pc->pc_lock); |
full = pc->pc_fullgroups; |
full = pc->pc_fullgroups; |
empty = pc->pc_emptygroups; |
empty = pc->pc_emptygroups; |
Line 2313 pool_cache_invalidate(pool_cache_t pc) |
|
Line 2371 pool_cache_invalidate(pool_cache_t pc) |
|
} |
} |
|
|
/* |
/* |
* pool_cache_invalidate_local: |
|
* |
|
* Invalidate all local ('current CPU') cached objects in |
|
* pool cache. |
|
* It is caller's responsibility to ensure that no operation is |
|
* taking place on this pool cache while doing the local invalidation. |
|
*/ |
|
void |
|
pool_cache_invalidate_local(pool_cache_t pc) |
|
{ |
|
pool_cache_invalidate_cpu(pc, curcpu()->ci_index); |
|
} |
|
|
|
/* |
|
* pool_cache_invalidate_cpu: |
* pool_cache_invalidate_cpu: |
* |
* |
* Invalidate all CPU-bound cached objects in pool cache, the CPU being |
* Invalidate all CPU-bound cached objects in pool cache, the CPU being |
Line 2493 pool_cache_get_paddr(pool_cache_t pc, in |
|
Line 2537 pool_cache_get_paddr(pool_cache_t pc, in |
|
void *object; |
void *object; |
int s; |
int s; |
|
|
#ifdef LOCKDEBUG |
KASSERTMSG((!cpu_intr_p() && !cpu_softintr_p()) || |
|
(pc->pc_pool.pr_ipl != IPL_NONE || cold || panicstr != NULL), |
|
("pool '%s' is IPL_NONE, but called from interrupt context\n", |
|
pc->pc_pool.pr_wchan)); |
|
|
if (flags & PR_WAITOK) { |
if (flags & PR_WAITOK) { |
ASSERT_SLEEPABLE(); |
ASSERT_SLEEPABLE(); |
} |
} |
#endif |
|
|
|
/* Lock out interrupts and disable preemption. */ |
/* Lock out interrupts and disable preemption. */ |
s = splvm(); |
s = splvm(); |
|
|
goto print; |
goto print; |
} |
} |
} |
} |
for (i = 0; i < MAXCPUS; i++) { |
for (i = 0; i < __arraycount(pc->pc_cpus); i++) { |
pool_cache_cpu_t *cc; |
pool_cache_cpu_t *cc; |
|
|
if ((cc = pc->pc_cpus[i]) == NULL) { |
if ((cc = pc->pc_cpus[i]) == NULL) { |