version 1.128.2.7, 2007/09/01 12:55:15 |
version 1.165, 2008/07/07 12:27:19 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/*- |
/*- |
* Copyright (c) 1997, 1999, 2000, 2002, 2007 The NetBSD Foundation, Inc. |
* Copyright (c) 1997, 1999, 2000, 2002, 2007, 2008 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 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
* 2. Redistributions in binary form must reproduce the above copyright |
* notice, this list of conditions and the following disclaimer in the |
* notice, this list of conditions and the following disclaimer in the |
* documentation and/or other materials provided with the distribution. |
* documentation and/or other materials provided with the distribution. |
* 3. All advertising materials mentioning features or use of this software |
|
* must display the following acknowledgement: |
|
* This product includes software developed by the NetBSD |
|
* Foundation, Inc. and its contributors. |
|
* 4. Neither the name of The NetBSD Foundation nor the names of its |
|
* contributors may be used to endorse or promote products derived |
|
* from this software without specific prior written permission. |
|
* |
* |
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
|
|
#include <sys/cdefs.h> |
#include <sys/cdefs.h> |
__KERNEL_RCSID(0, "$NetBSD$"); |
__KERNEL_RCSID(0, "$NetBSD$"); |
|
|
|
#include "opt_ddb.h" |
#include "opt_pool.h" |
#include "opt_pool.h" |
#include "opt_poollog.h" |
#include "opt_poollog.h" |
#include "opt_lockdebug.h" |
#include "opt_lockdebug.h" |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
#include <sys/systm.h> |
#include <sys/systm.h> |
|
#include <sys/bitops.h> |
#include <sys/proc.h> |
#include <sys/proc.h> |
#include <sys/errno.h> |
#include <sys/errno.h> |
#include <sys/kernel.h> |
#include <sys/kernel.h> |
#include <sys/malloc.h> |
#include <sys/malloc.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 <sys/debug.h> |
#include <sys/lockdebug.h> |
#include <sys/lockdebug.h> |
|
#include <sys/xcall.h> |
|
#include <sys/cpu.h> |
|
#include <sys/atomic.h> |
|
|
#include <uvm/uvm.h> |
#include <uvm/uvm.h> |
|
|
Line 72 __KERNEL_RCSID(0, "$NetBSD$"); |
|
Line 69 __KERNEL_RCSID(0, "$NetBSD$"); |
|
*/ |
*/ |
|
|
/* List of all pools */ |
/* List of all pools */ |
LIST_HEAD(,pool) pool_head = LIST_HEAD_INITIALIZER(pool_head); |
TAILQ_HEAD(,pool) pool_head = TAILQ_HEAD_INITIALIZER(pool_head); |
|
|
/* List of all caches. */ |
|
LIST_HEAD(,pool_cache) pool_cache_head = |
|
LIST_HEAD_INITIALIZER(pool_cache_head); |
|
|
|
/* Private pool for page header structures */ |
/* Private pool for page header structures */ |
#define PHPOOL_MAX 8 |
#define PHPOOL_MAX 8 |
static struct pool phpool[PHPOOL_MAX]; |
static struct pool phpool[PHPOOL_MAX]; |
#define PHPOOL_FREELIST_NELEM(idx) (((idx) == 0) ? 0 : (1 << (idx))) |
#define PHPOOL_FREELIST_NELEM(idx) \ |
|
(((idx) == 0) ? 0 : BITMAP_SIZE * (1 << (idx))) |
|
|
#ifdef POOL_SUBPAGE |
#ifdef POOL_SUBPAGE |
/* Pool of subpages for use by normal pools. */ |
/* Pool of subpages for use by normal pools. */ |
Line 110 static struct pool *drainpp; |
|
Line 104 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; |
|
|
typedef uint8_t pool_item_freelist_t; |
typedef uint32_t pool_item_bitmap_t; |
|
#define BITMAP_SIZE (CHAR_BIT * sizeof(pool_item_bitmap_t)) |
|
#define BITMAP_MASK (BITMAP_SIZE - 1) |
|
|
struct pool_item_header { |
struct pool_item_header { |
/* Page headers */ |
/* Page headers */ |
Line 119 struct pool_item_header { |
|
Line 115 struct pool_item_header { |
|
SPLAY_ENTRY(pool_item_header) |
SPLAY_ENTRY(pool_item_header) |
ph_node; /* Off-page page headers */ |
ph_node; /* Off-page page headers */ |
void * ph_page; /* this page's address */ |
void * ph_page; /* this page's address */ |
struct timeval ph_time; /* last referenced */ |
uint32_t ph_time; /* last referenced */ |
|
uint16_t ph_nmissing; /* # of chunks in use */ |
|
uint16_t ph_off; /* start offset in page */ |
union { |
union { |
/* !PR_NOTOUCH */ |
/* !PR_NOTOUCH */ |
struct { |
struct { |
Line 128 struct pool_item_header { |
|
Line 126 struct pool_item_header { |
|
} phu_normal; |
} phu_normal; |
/* PR_NOTOUCH */ |
/* PR_NOTOUCH */ |
struct { |
struct { |
uint16_t |
pool_item_bitmap_t phu_bitmap[1]; |
phu_off; /* start offset in page */ |
|
pool_item_freelist_t |
|
phu_firstfree; /* first free item */ |
|
/* |
|
* XXX it might be better to use |
|
* a simple bitmap and ffs(3) |
|
*/ |
|
} phu_notouch; |
} phu_notouch; |
} ph_u; |
} ph_u; |
uint16_t ph_nmissing; /* # of chunks in use */ |
|
}; |
}; |
#define ph_itemlist ph_u.phu_normal.phu_itemlist |
#define ph_itemlist ph_u.phu_normal.phu_itemlist |
#define ph_off ph_u.phu_notouch.phu_off |
#define ph_bitmap ph_u.phu_notouch.phu_bitmap |
#define ph_firstfree ph_u.phu_notouch.phu_firstfree |
|
|
|
struct pool_item { |
struct pool_item { |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
u_int pi_magic; |
u_int pi_magic; |
#endif |
#endif |
#define PI_MAGIC 0xdeadbeefU |
#define PI_MAGIC 0xdeaddeadU |
/* Other entries use only this list entry */ |
/* Other entries use only this list entry */ |
LIST_ENTRY(pool_item) pi_list; |
LIST_ENTRY(pool_item) pi_list; |
}; |
}; |
Line 181 struct pool_item { |
|
Line 170 struct pool_item { |
|
* from it. |
* from it. |
*/ |
*/ |
|
|
static struct pool pcgpool; |
static struct pool pcg_normal_pool; |
|
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; |
|
|
static pool_cache_cpu_t *pool_cache_put_slow(pool_cache_cpu_t *, int *, |
/* List of all caches. */ |
void *, paddr_t); |
TAILQ_HEAD(,pool_cache) pool_cache_head = |
static pool_cache_cpu_t *pool_cache_get_slow(pool_cache_cpu_t *, int *, |
TAILQ_HEAD_INITIALIZER(pool_cache_head); |
void **, paddr_t *, int); |
|
|
int pool_cache_disable; /* global disable for caching */ |
|
static pcg_t pcg_dummy; /* zero sized: always empty, yet always full */ |
|
|
|
static bool pool_cache_put_slow(pool_cache_cpu_t *, int, |
|
void *); |
|
static bool pool_cache_get_slow(pool_cache_cpu_t *, int, |
|
void **, paddr_t *, int); |
static void pool_cache_cpu_init1(struct cpu_info *, pool_cache_t); |
static void pool_cache_cpu_init1(struct cpu_info *, pool_cache_t); |
static void pool_cache_invalidate_groups(pool_cache_t, pcg_t *); |
static void pool_cache_invalidate_groups(pool_cache_t, pcg_t *); |
|
static void pool_cache_xcall(pool_cache_t); |
|
|
static int pool_catchup(struct pool *); |
static int pool_catchup(struct pool *); |
static void pool_prime_page(struct pool *, void *, |
static void pool_prime_page(struct pool *, void *, |
Line 327 pr_enter_check(struct pool *pp, void (*p |
|
Line 325 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 unsigned 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) |
{ |
{ |
const char *cp = v; |
const char *cp = v; |
int idx; |
unsigned int idx; |
|
|
KASSERT(pp->pr_roflags & PR_NOTOUCH); |
KASSERT(pp->pr_roflags & PR_NOTOUCH); |
idx = (cp - (char *)ph->ph_page - ph->ph_off) / pp->pr_size; |
idx = (cp - (char *)ph->ph_page - ph->ph_off) / pp->pr_size; |
Line 340 pr_item_notouch_index(const struct pool |
|
Line 338 pr_item_notouch_index(const struct pool |
|
return idx; |
return idx; |
} |
} |
|
|
#define PR_FREELIST_ALIGN(p) \ |
|
roundup((uintptr_t)(p), sizeof(pool_item_freelist_t)) |
|
#define PR_FREELIST(ph) ((pool_item_freelist_t *)PR_FREELIST_ALIGN((ph) + 1)) |
|
#define PR_INDEX_USED ((pool_item_freelist_t)-1) |
|
#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) |
{ |
{ |
int idx = pr_item_notouch_index(pp, ph, obj); |
unsigned int idx = pr_item_notouch_index(pp, ph, obj); |
pool_item_freelist_t *freelist = PR_FREELIST(ph); |
pool_item_bitmap_t *bitmap = ph->ph_bitmap + (idx / BITMAP_SIZE); |
|
pool_item_bitmap_t mask = 1 << (idx & BITMAP_MASK); |
|
|
KASSERT(freelist[idx] == PR_INDEX_USED); |
KASSERT((*bitmap & mask) == 0); |
freelist[idx] = ph->ph_firstfree; |
*bitmap |= mask; |
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; |
pool_item_bitmap_t *bitmap = ph->ph_bitmap; |
pool_item_freelist_t *freelist = PR_FREELIST(ph); |
unsigned int idx; |
|
int i; |
|
|
KASSERT(freelist[idx] != PR_INDEX_USED); |
for (i = 0; ; i++) { |
ph->ph_firstfree = freelist[idx]; |
int bit; |
freelist[idx] = PR_INDEX_USED; |
|
|
|
|
KASSERT((i * BITMAP_SIZE) < pp->pr_itemsperpage); |
|
bit = ffs32(bitmap[i]); |
|
if (bit) { |
|
pool_item_bitmap_t mask; |
|
|
|
bit--; |
|
idx = (i * BITMAP_SIZE) + bit; |
|
mask = 1 << bit; |
|
KASSERT((bitmap[i] & mask) != 0); |
|
bitmap[i] &= ~mask; |
|
break; |
|
} |
|
} |
|
KASSERT(idx < pp->pr_itemsperpage); |
return (char *)ph->ph_page + ph->ph_off + idx * pp->pr_size; |
return (char *)ph->ph_page + ph->ph_off + idx * pp->pr_size; |
} |
} |
|
|
|
static inline void |
|
pr_item_notouch_init(const struct pool *pp, struct pool_item_header *ph) |
|
{ |
|
pool_item_bitmap_t *bitmap = ph->ph_bitmap; |
|
const int n = howmany(pp->pr_itemsperpage, BITMAP_SIZE); |
|
int i; |
|
|
|
for (i = 0; i < n; i++) { |
|
bitmap[i] = (pool_item_bitmap_t)-1; |
|
} |
|
} |
|
|
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) |
{ |
{ |
Line 391 phtree_compare(struct pool_item_header * |
|
Line 409 phtree_compare(struct pool_item_header * |
|
SPLAY_PROTOTYPE(phtree, pool_item_header, ph_node, phtree_compare); |
SPLAY_PROTOTYPE(phtree, pool_item_header, ph_node, phtree_compare); |
SPLAY_GENERATE(phtree, pool_item_header, ph_node, phtree_compare); |
SPLAY_GENERATE(phtree, pool_item_header, ph_node, phtree_compare); |
|
|
|
static inline struct pool_item_header * |
|
pr_find_pagehead_noalign(struct pool *pp, void *v) |
|
{ |
|
struct pool_item_header *ph, tmp; |
|
|
|
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); |
|
} |
|
|
|
return ph; |
|
} |
|
|
/* |
/* |
* Return the pool page header based on item address. |
* Return the pool page header based on item address. |
*/ |
*/ |
Line 400 pr_find_pagehead(struct pool *pp, void * |
|
Line 436 pr_find_pagehead(struct pool *pp, void * |
|
struct pool_item_header *ph, tmp; |
struct pool_item_header *ph, tmp; |
|
|
if ((pp->pr_roflags & PR_NOALIGN) != 0) { |
if ((pp->pr_roflags & PR_NOALIGN) != 0) { |
tmp.ph_page = (void *)(uintptr_t)v; |
ph = pr_find_pagehead_noalign(pp, 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 { |
} else { |
void *page = |
void *page = |
(void *)((uintptr_t)v & pp->pr_alloc->pa_pagemask); |
(void *)((uintptr_t)v & pp->pr_alloc->pa_pagemask); |
Line 577 pool_subsystem_init(void) |
|
Line 605 pool_subsystem_init(void) |
|
pa_reclaim_register(pa); |
pa_reclaim_register(pa); |
} |
} |
|
|
pool_init(&cache_pool, sizeof(struct pool_cache), CACHE_LINE_SIZE, |
pool_init(&cache_pool, sizeof(struct pool_cache), coherency_unit, |
0, 0, "pcache", &pool_allocator_nointr, IPL_NONE); |
0, 0, "pcache", &pool_allocator_nointr, IPL_NONE); |
|
|
pool_init(&cache_cpu_pool, sizeof(pool_cache_cpu_t), CACHE_LINE_SIZE, |
pool_init(&cache_cpu_pool, sizeof(pool_cache_cpu_t), coherency_unit, |
0, 0, "pcachecpu", &pool_allocator_nointr, IPL_NONE); |
0, 0, "pcachecpu", &pool_allocator_nointr, IPL_NONE); |
} |
} |
|
|
|
|
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, int ipl) |
const char *wchan, struct pool_allocator *palloc, int ipl) |
{ |
{ |
#ifdef DEBUG |
|
struct pool *pp1; |
struct pool *pp1; |
#endif |
|
size_t trysize, phsize; |
size_t trysize, phsize; |
int off, slack; |
int off, slack; |
|
|
KASSERT((1UL << (CHAR_BIT * sizeof(pool_item_freelist_t))) - 2 >= |
|
PHPOOL_FREELIST_NELEM(PHPOOL_MAX - 1)); |
|
|
|
#ifdef DEBUG |
#ifdef DEBUG |
/* |
/* |
* Check that the pool hasn't already been initialised and |
* Check that the pool hasn't already been initialised and |
* added to the list of all pools. |
* added to the list of all pools. |
*/ |
*/ |
LIST_FOREACH(pp1, &pool_head, pr_poollist) { |
TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { |
if (pp == pp1) |
if (pp == pp1) |
panic("pool_init: pool %s already initialised", |
panic("pool_init: pool %s already initialised", |
wchan); |
wchan); |
Line 805 pool_init(struct pool *pp, size_t size, |
|
Line 828 pool_init(struct pool *pp, size_t size, |
|
"phpool-%d", nelem); |
"phpool-%d", nelem); |
sz = sizeof(struct pool_item_header); |
sz = sizeof(struct pool_item_header); |
if (nelem) { |
if (nelem) { |
sz = PR_FREELIST_ALIGN(sz) |
sz = offsetof(struct pool_item_header, |
+ nelem * sizeof(pool_item_freelist_t); |
ph_bitmap[howmany(nelem, BITMAP_SIZE)]); |
} |
} |
pool_init(&phpool[idx], sz, 0, 0, 0, |
pool_init(&phpool[idx], sz, 0, 0, 0, |
phpool_names[idx], &pool_allocator_meta, IPL_VM); |
phpool_names[idx], &pool_allocator_meta, IPL_VM); |
Line 815 pool_init(struct pool *pp, size_t size, |
|
Line 838 pool_init(struct pool *pp, size_t size, |
|
pool_init(&psppool, POOL_SUBPAGE, POOL_SUBPAGE, 0, |
pool_init(&psppool, POOL_SUBPAGE, POOL_SUBPAGE, 0, |
PR_RECURSIVE, "psppool", &pool_allocator_meta, IPL_VM); |
PR_RECURSIVE, "psppool", &pool_allocator_meta, IPL_VM); |
#endif |
#endif |
pool_init(&pcgpool, sizeof(pcg_t), CACHE_LINE_SIZE, 0, 0, |
|
"cachegrp", &pool_allocator_meta, IPL_VM); |
size = sizeof(pcg_t) + |
|
(PCG_NOBJECTS_NORMAL - 1) * sizeof(pcgpair_t); |
|
pool_init(&pcg_normal_pool, size, coherency_unit, 0, 0, |
|
"pcgnormal", &pool_allocator_meta, IPL_VM); |
|
|
|
size = sizeof(pcg_t) + |
|
(PCG_NOBJECTS_LARGE - 1) * sizeof(pcgpair_t); |
|
pool_init(&pcg_large_pool, size, coherency_unit, 0, 0, |
|
"pcglarge", &pool_allocator_meta, IPL_VM); |
} |
} |
|
|
if (__predict_true(!cold)) { |
/* Insert into the list of all pools. */ |
/* Insert into the list of all pools. */ |
if (__predict_true(!cold)) |
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
LIST_INSERT_HEAD(&pool_head, pp, pr_poollist); |
TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { |
|
if (strcmp(pp1->pr_wchan, pp->pr_wchan) > 0) |
|
break; |
|
} |
|
if (pp1 == NULL) |
|
TAILQ_INSERT_TAIL(&pool_head, pp, pr_poollist); |
|
else |
|
TAILQ_INSERT_BEFORE(pp1, pp, pr_poollist); |
|
if (__predict_true(!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)) |
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)) |
mutex_exit(&palloc->pa_lock); |
mutex_exit(&palloc->pa_lock); |
} else { |
|
LIST_INSERT_HEAD(&pool_head, pp, pr_poollist); |
|
TAILQ_INSERT_TAIL(&palloc->pa_list, pp, pr_alloc_list); |
|
} |
|
|
|
pool_reclaim_register(pp); |
pool_reclaim_register(pp); |
} |
} |
Line 850 pool_destroy(struct pool *pp) |
|
Line 887 pool_destroy(struct pool *pp) |
|
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
while (pp->pr_refcnt != 0) |
while (pp->pr_refcnt != 0) |
cv_wait(&pool_busy, &pool_head_lock); |
cv_wait(&pool_busy, &pool_head_lock); |
LIST_REMOVE(pp, pr_poollist); |
TAILQ_REMOVE(&pool_head, pp, pr_poollist); |
if (drainpp == pp) |
if (drainpp == pp) |
drainpp = NULL; |
drainpp = NULL; |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
Line 921 pool_alloc_item_header(struct pool *pp, |
|
Line 958 pool_alloc_item_header(struct pool *pp, |
|
} |
} |
|
|
/* |
/* |
* Grab an item from the pool; must be called at appropriate spl level |
* Grab an item from the pool. |
*/ |
*/ |
void * |
void * |
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
Line 944 pool_get(struct pool *pp, int flags) |
|
Line 981 pool_get(struct pool *pp, int flags) |
|
|
|
#endif /* DIAGNOSTIC */ |
#endif /* DIAGNOSTIC */ |
#ifdef LOCKDEBUG |
#ifdef LOCKDEBUG |
if (flags & PR_WAITOK) |
if (flags & PR_WAITOK) { |
ASSERT_SLEEPABLE(NULL, "pool_get(PR_WAITOK)"); |
ASSERT_SLEEPABLE(); |
|
} |
#endif |
#endif |
|
|
mutex_enter(&pp->pr_lock); |
mutex_enter(&pp->pr_lock); |
Line 1237 pool_do_put(struct pool *pp, void *v, st |
|
Line 1275 pool_do_put(struct pool *pp, void *v, st |
|
if (ph->ph_nmissing == 0) { |
if (ph->ph_nmissing == 0) { |
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) { |
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 1249 pool_do_put(struct pool *pp, void *v, st |
|
Line 1286 pool_do_put(struct pool *pp, void *v, st |
|
* be idle for some period of time before it can |
* be idle for some period of time before it can |
* be reclaimed by the pagedaemon. This minimizes |
* be reclaimed by the pagedaemon. This minimizes |
* ping-pong'ing for memory. |
* ping-pong'ing for memory. |
|
* |
|
* note for 64-bit time_t: truncating to 32-bit is not |
|
* a problem for our usage. |
*/ |
*/ |
getmicrotime(&ph->ph_time); |
ph->ph_time = time_uptime; |
} |
} |
pool_update_curpage(pp); |
pool_update_curpage(pp); |
} |
} |
Line 1269 pool_do_put(struct pool *pp, void *v, st |
|
Line 1309 pool_do_put(struct pool *pp, void *v, st |
|
} |
} |
|
|
/* |
/* |
* Return resource to the pool; must be called at appropriate spl level |
* Return resource to the pool. |
*/ |
*/ |
#ifdef POOL_DIAGNOSTIC |
#ifdef POOL_DIAGNOSTIC |
void |
void |
Line 1402 pool_prime_page(struct pool *pp, void *s |
|
Line 1442 pool_prime_page(struct pool *pp, void *s |
|
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; |
getmicrotime(&ph->ph_time); |
ph->ph_time = time_uptime; |
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 1411 pool_prime_page(struct pool *pp, void *s |
|
Line 1451 pool_prime_page(struct pool *pp, void *s |
|
/* |
/* |
* Color this page. |
* Color this page. |
*/ |
*/ |
cp = (char *)cp + pp->pr_curcolor; |
ph->ph_off = pp->pr_curcolor; |
|
cp = (char *)cp + ph->ph_off; |
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 1430 pool_prime_page(struct pool *pp, void *s |
|
Line 1471 pool_prime_page(struct pool *pp, void *s |
|
pp->pr_nitems += n; |
pp->pr_nitems += n; |
|
|
if (pp->pr_roflags & PR_NOTOUCH) { |
if (pp->pr_roflags & PR_NOTOUCH) { |
pool_item_freelist_t *freelist = PR_FREELIST(ph); |
pr_item_notouch_init(pp, ph); |
int i; |
|
|
|
ph->ph_off = (char *)cp - (char *)storage; |
|
ph->ph_firstfree = 0; |
|
for (i = 0; i < n - 1; i++) |
|
freelist[i] = i + 1; |
|
freelist[n - 1] = PR_INDEX_EOL; |
|
} else { |
} else { |
while (n--) { |
while (n--) { |
pi = (struct pool_item *)cp; |
pi = (struct pool_item *)cp; |
Line 1569 pool_reclaim(struct pool *pp) |
|
Line 1603 pool_reclaim(struct pool *pp) |
|
{ |
{ |
struct pool_item_header *ph, *phnext; |
struct pool_item_header *ph, *phnext; |
struct pool_pagelist pq; |
struct pool_pagelist pq; |
struct timeval curtime, diff; |
uint32_t curtime; |
|
bool klock; |
|
int rv; |
|
|
if (pp->pr_drain_hook != NULL) { |
if (pp->pr_drain_hook != NULL) { |
/* |
/* |
Line 1578 pool_reclaim(struct pool *pp) |
|
Line 1614 pool_reclaim(struct pool *pp) |
|
(*pp->pr_drain_hook)(pp->pr_drain_hook_arg, PR_NOWAIT); |
(*pp->pr_drain_hook)(pp->pr_drain_hook_arg, PR_NOWAIT); |
} |
} |
|
|
if (mutex_tryenter(&pp->pr_lock) == 0) |
|
return (0); |
|
pr_enter(pp, file, line); |
|
|
|
LIST_INIT(&pq); |
|
|
|
/* |
/* |
* Reclaim items from the pool's caches. |
* XXXSMP Because we do not want to cause non-MPSAFE code |
|
* to block. |
*/ |
*/ |
|
if (pp->pr_ipl == IPL_SOFTNET || pp->pr_ipl == IPL_SOFTCLOCK || |
|
pp->pr_ipl == IPL_SOFTSERIAL) { |
|
KERNEL_LOCK(1, NULL); |
|
klock = true; |
|
} else |
|
klock = false; |
|
|
|
/* Reclaim items from the pool's cache (if any). */ |
if (pp->pr_cache != NULL) |
if (pp->pr_cache != NULL) |
pool_cache_invalidate(pp->pr_cache); |
pool_cache_invalidate(pp->pr_cache); |
|
|
getmicrotime(&curtime); |
if (mutex_tryenter(&pp->pr_lock) == 0) { |
|
if (klock) { |
|
KERNEL_UNLOCK_ONE(NULL); |
|
} |
|
return (0); |
|
} |
|
pr_enter(pp, file, line); |
|
|
|
LIST_INIT(&pq); |
|
|
|
curtime = time_uptime; |
|
|
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 1600 pool_reclaim(struct pool *pp) |
|
Line 1649 pool_reclaim(struct pool *pp) |
|
break; |
break; |
|
|
KASSERT(ph->ph_nmissing == 0); |
KASSERT(ph->ph_nmissing == 0); |
timersub(&curtime, &ph->ph_time, &diff); |
if (curtime - ph->ph_time < pool_inactive_time |
if (diff.tv_sec < pool_inactive_time |
|
&& !pa_starved_p(pp->pr_alloc)) |
&& !pa_starved_p(pp->pr_alloc)) |
continue; |
continue; |
|
|
Line 1618 pool_reclaim(struct pool *pp) |
|
Line 1666 pool_reclaim(struct pool *pp) |
|
|
|
pr_leave(pp); |
pr_leave(pp); |
mutex_exit(&pp->pr_lock); |
mutex_exit(&pp->pr_lock); |
|
|
if (LIST_EMPTY(&pq)) |
if (LIST_EMPTY(&pq)) |
return 0; |
rv = 0; |
|
else { |
|
pr_pagelist_free(pp, &pq); |
|
rv = 1; |
|
} |
|
|
pr_pagelist_free(pp, &pq); |
if (klock) { |
|
KERNEL_UNLOCK_ONE(NULL); |
|
} |
|
|
return (1); |
return (rv); |
} |
} |
|
|
/* |
/* |
* Drain pools, one at a time. |
* Drain pools, one at a time. This is a two stage process; |
|
* drain_start kicks off a cross call to drain CPU-level caches |
|
* if the pool has an associated pool_cache. drain_end waits |
|
* for those cross calls to finish, and then drains the cache |
|
* (if any) and pool. |
* |
* |
* Note, we must never be called from an interrupt context. |
* Note, must never be called from interrupt context. |
*/ |
*/ |
void |
void |
pool_drain(void *arg) |
pool_drain_start(struct pool **ppp, uint64_t *wp) |
{ |
{ |
struct pool *pp; |
struct pool *pp; |
|
|
|
KASSERT(!TAILQ_EMPTY(&pool_head)); |
|
|
pp = NULL; |
pp = NULL; |
|
|
/* Find next pool to drain, and add a reference. */ |
/* Find next pool to drain, and add a reference. */ |
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
if (drainpp == NULL) { |
do { |
drainpp = LIST_FIRST(&pool_head); |
if (drainpp == NULL) { |
} |
drainpp = TAILQ_FIRST(&pool_head); |
if (drainpp != NULL) { |
} |
pp = drainpp; |
if (drainpp != NULL) { |
drainpp = LIST_NEXT(pp, pr_poollist); |
pp = drainpp; |
} |
drainpp = TAILQ_NEXT(pp, pr_poollist); |
if (pp != NULL) |
} |
pp->pr_refcnt++; |
/* |
|
* Skip completely idle pools. We depend on at least |
|
* one pool in the system being active. |
|
*/ |
|
} while (pp == NULL || pp->pr_npages == 0); |
|
pp->pr_refcnt++; |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
|
|
/* If we have a candidate, drain it and unlock. */ |
/* If there is a pool_cache, drain CPU level caches. */ |
if (pp != NULL) { |
*ppp = pp; |
pool_reclaim(pp); |
if (pp->pr_cache != NULL) { |
mutex_enter(&pool_head_lock); |
*wp = xc_broadcast(0, (xcfunc_t)pool_cache_xcall, |
pp->pr_refcnt--; |
pp->pr_cache, NULL); |
cv_broadcast(&pool_busy); |
|
mutex_exit(&pool_head_lock); |
|
} |
} |
} |
} |
|
|
|
void |
|
pool_drain_end(struct pool *pp, uint64_t where) |
|
{ |
|
|
|
if (pp == NULL) |
|
return; |
|
|
|
KASSERT(pp->pr_refcnt > 0); |
|
|
|
/* Wait for remote draining to complete. */ |
|
if (pp->pr_cache != NULL) |
|
xc_wait(where); |
|
|
|
/* Drain the cache (if any) and pool.. */ |
|
pool_reclaim(pp); |
|
|
|
/* Finally, unlock the pool. */ |
|
mutex_enter(&pool_head_lock); |
|
pp->pr_refcnt--; |
|
cv_broadcast(&pool_busy); |
|
mutex_exit(&pool_head_lock); |
|
} |
|
|
/* |
/* |
* Diagnostic helpers. |
* Diagnostic helpers. |
*/ |
*/ |
Line 1676 pool_printall(const char *modif, void (* |
|
Line 1763 pool_printall(const char *modif, void (* |
|
{ |
{ |
struct pool *pp; |
struct pool *pp; |
|
|
LIST_FOREACH(pp, &pool_head, pr_poollist) { |
TAILQ_FOREACH(pp, &pool_head, pr_poollist) { |
pool_printit(pp, modif, pr); |
pool_printit(pp, modif, pr); |
} |
} |
} |
} |
Line 1703 pool_print_pagelist(struct pool *pp, str |
|
Line 1790 pool_print_pagelist(struct pool *pp, str |
|
#endif |
#endif |
|
|
LIST_FOREACH(ph, pl, ph_pagelist) { |
LIST_FOREACH(ph, pl, ph_pagelist) { |
(*pr)("\t\tpage %p, nmissing %d, time %lu,%lu\n", |
(*pr)("\t\tpage %p, nmissing %d, time %" PRIu32 "\n", |
ph->ph_page, ph->ph_nmissing, |
ph->ph_page, ph->ph_nmissing, ph->ph_time); |
(u_long)ph->ph_time.tv_sec, |
|
(u_long)ph->ph_time.tv_usec); |
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (!(pp->pr_roflags & PR_NOTOUCH)) { |
if (!(pp->pr_roflags & PR_NOTOUCH)) { |
LIST_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
LIST_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
Line 1793 pool_print1(struct pool *pp, const char |
|
Line 1878 pool_print1(struct pool *pp, const char |
|
|
|
#define PR_GROUPLIST(pcg) \ |
#define PR_GROUPLIST(pcg) \ |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); \ |
(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail); \ |
for (i = 0; i < PCG_NOBJECTS; i++) { \ |
for (i = 0; i < pcg->pcg_size; i++) { \ |
if (pcg->pcg_objects[i].pcgo_pa != \ |
if (pcg->pcg_objects[i].pcgo_pa != \ |
POOL_PADDR_INVALID) { \ |
POOL_PADDR_INVALID) { \ |
(*pr)("\t\t\t%p, 0x%llx\n", \ |
(*pr)("\t\t\t%p, 0x%llx\n", \ |
Line 1966 pool_cache_bootstrap(pool_cache_t pc, si |
|
Line 2051 pool_cache_bootstrap(pool_cache_t pc, si |
|
void *arg) |
void *arg) |
{ |
{ |
CPU_INFO_ITERATOR cii; |
CPU_INFO_ITERATOR cii; |
|
pool_cache_t pc1; |
struct cpu_info *ci; |
struct cpu_info *ci; |
struct pool *pp; |
struct pool *pp; |
|
|
Line 1973 pool_cache_bootstrap(pool_cache_t pc, si |
|
Line 2059 pool_cache_bootstrap(pool_cache_t pc, si |
|
if (palloc == NULL && ipl == IPL_NONE) |
if (palloc == NULL && ipl == IPL_NONE) |
palloc = &pool_allocator_nointr; |
palloc = &pool_allocator_nointr; |
pool_init(pp, size, align, align_offset, flags, wchan, palloc, ipl); |
pool_init(pp, size, align, align_offset, flags, wchan, palloc, ipl); |
|
mutex_init(&pc->pc_lock, MUTEX_DEFAULT, ipl); |
|
|
mutex_init(&pc->pc_lock, MUTEX_DEFAULT, pp->pr_ipl); |
if (ctor == NULL) { |
|
ctor = (int (*)(void *, void *, int))nullop; |
|
} |
|
if (dtor == NULL) { |
|
dtor = (void (*)(void *, void *))nullop; |
|
} |
|
|
pc->pc_emptygroups = NULL; |
pc->pc_emptygroups = NULL; |
pc->pc_fullgroups = NULL; |
pc->pc_fullgroups = NULL; |
|
pc->pc_partgroups = NULL; |
pc->pc_ctor = ctor; |
pc->pc_ctor = ctor; |
pc->pc_dtor = dtor; |
pc->pc_dtor = dtor; |
pc->pc_arg = arg; |
pc->pc_arg = arg; |
pc->pc_hits = 0; |
pc->pc_hits = 0; |
pc->pc_misses = 0; |
pc->pc_misses = 0; |
pc->pc_nempty = 0; |
pc->pc_nempty = 0; |
|
pc->pc_npart = 0; |
pc->pc_nfull = 0; |
pc->pc_nfull = 0; |
pc->pc_contended = 0; |
pc->pc_contended = 0; |
pc->pc_refcnt = 0; |
pc->pc_refcnt = 0; |
|
pc->pc_freecheck = NULL; |
|
|
|
if ((flags & PR_LARGECACHE) != 0) { |
|
pc->pc_pcgsize = PCG_NOBJECTS_LARGE; |
|
pc->pc_pcgpool = &pcg_large_pool; |
|
} else { |
|
pc->pc_pcgsize = PCG_NOBJECTS_NORMAL; |
|
pc->pc_pcgpool = &pcg_normal_pool; |
|
} |
|
|
/* Allocate per-CPU caches. */ |
/* Allocate per-CPU caches. */ |
memset(pc->pc_cpus, 0, sizeof(pc->pc_cpus)); |
memset(pc->pc_cpus, 0, sizeof(pc->pc_cpus)); |
pc->pc_ncpu = 0; |
pc->pc_ncpu = 0; |
for (CPU_INFO_FOREACH(cii, ci)) { |
if (ncpu < 2) { |
pool_cache_cpu_init1(ci, pc); |
/* XXX For sparc: boot CPU is not attached yet. */ |
|
pool_cache_cpu_init1(curcpu(), pc); |
|
} else { |
|
for (CPU_INFO_FOREACH(cii, ci)) { |
|
pool_cache_cpu_init1(ci, pc); |
|
} |
} |
} |
|
|
if (__predict_true(!cold)) { |
/* Add to list of all pools. */ |
mutex_enter(&pp->pr_lock); |
if (__predict_true(!cold)) |
pp->pr_cache = pc; |
|
mutex_exit(&pp->pr_lock); |
|
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
LIST_INSERT_HEAD(&pool_cache_head, pc, pc_cachelist); |
TAILQ_FOREACH(pc1, &pool_cache_head, pc_cachelist) { |
mutex_exit(&pool_head_lock); |
if (strcmp(pc1->pc_pool.pr_wchan, pc->pc_pool.pr_wchan) > 0) |
} else { |
break; |
pp->pr_cache = pc; |
|
LIST_INSERT_HEAD(&pool_cache_head, pc, pc_cachelist); |
|
} |
} |
|
if (pc1 == NULL) |
|
TAILQ_INSERT_TAIL(&pool_cache_head, pc, pc_cachelist); |
|
else |
|
TAILQ_INSERT_BEFORE(pc1, pc, pc_cachelist); |
|
if (__predict_true(!cold)) |
|
mutex_exit(&pool_head_lock); |
|
|
|
membar_sync(); |
|
pp->pr_cache = pc; |
} |
} |
|
|
/* |
/* |
Line 2025 pool_cache_destroy(pool_cache_t pc) |
|
Line 2138 pool_cache_destroy(pool_cache_t pc) |
|
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
while (pc->pc_refcnt != 0) |
while (pc->pc_refcnt != 0) |
cv_wait(&pool_busy, &pool_head_lock); |
cv_wait(&pool_busy, &pool_head_lock); |
LIST_REMOVE(pc, pc_cachelist); |
TAILQ_REMOVE(&pool_cache_head, pc, pc_cachelist); |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
|
|
/* First, invalidate the entire cache. */ |
/* First, invalidate the entire cache. */ |
Line 2040 pool_cache_destroy(pool_cache_t pc) |
|
Line 2153 pool_cache_destroy(pool_cache_t pc) |
|
for (i = 0; i < MAXCPUS; i++) { |
for (i = 0; i < MAXCPUS; i++) { |
if ((cc = pc->pc_cpus[i]) == NULL) |
if ((cc = pc->pc_cpus[i]) == NULL) |
continue; |
continue; |
if ((pcg = cc->cc_current) != NULL) { |
if ((pcg = cc->cc_current) != &pcg_dummy) { |
pcg->pcg_next = NULL; |
pcg->pcg_next = NULL; |
pool_cache_invalidate_groups(pc, pcg); |
pool_cache_invalidate_groups(pc, pcg); |
} |
} |
if ((pcg = cc->cc_previous) != NULL) { |
if ((pcg = cc->cc_previous) != &pcg_dummy) { |
pcg->pcg_next = NULL; |
pcg->pcg_next = NULL; |
pool_cache_invalidate_groups(pc, pcg); |
pool_cache_invalidate_groups(pc, pcg); |
} |
} |
|
|
pool_cache_cpu_init1(struct cpu_info *ci, pool_cache_t pc) |
pool_cache_cpu_init1(struct cpu_info *ci, pool_cache_t pc) |
{ |
{ |
pool_cache_cpu_t *cc; |
pool_cache_cpu_t *cc; |
|
int index; |
|
|
KASSERT(((uintptr_t)pc->pc_cpus & (CACHE_LINE_SIZE - 1)) == 0); |
index = ci->ci_index; |
|
|
if ((cc = pc->pc_cpus[ci->ci_index]) != NULL) { |
KASSERT(index < MAXCPUS); |
KASSERT(cc->cc_cpu = ci); |
|
|
if ((cc = pc->pc_cpus[index]) != NULL) { |
|
KASSERT(cc->cc_cpuindex == index); |
return; |
return; |
} |
} |
|
|
Line 2092 pool_cache_cpu_init1(struct cpu_info *ci |
|
Line 2208 pool_cache_cpu_init1(struct cpu_info *ci |
|
cc->cc_ipl = pc->pc_pool.pr_ipl; |
cc->cc_ipl = pc->pc_pool.pr_ipl; |
cc->cc_iplcookie = makeiplcookie(cc->cc_ipl); |
cc->cc_iplcookie = makeiplcookie(cc->cc_ipl); |
cc->cc_cache = pc; |
cc->cc_cache = pc; |
cc->cc_cpu = ci; |
cc->cc_cpuindex = index; |
cc->cc_hits = 0; |
cc->cc_hits = 0; |
cc->cc_misses = 0; |
cc->cc_misses = 0; |
cc->cc_current = NULL; |
cc->cc_current = &pcg_dummy; |
cc->cc_previous = NULL; |
cc->cc_previous = &pcg_dummy; |
cc->cc_busy = NULL; |
|
|
|
pc->pc_cpus[ci->ci_index] = cc; |
pc->pc_cpus[index] = cc; |
} |
} |
|
|
/* |
/* |
Line 2113 pool_cache_cpu_init(struct cpu_info *ci) |
|
Line 2228 pool_cache_cpu_init(struct cpu_info *ci) |
|
pool_cache_t pc; |
pool_cache_t pc; |
|
|
mutex_enter(&pool_head_lock); |
mutex_enter(&pool_head_lock); |
LIST_FOREACH(pc, &pool_cache_head, pc_cachelist) { |
TAILQ_FOREACH(pc, &pool_cache_head, pc_cachelist) { |
pc->pc_refcnt++; |
pc->pc_refcnt++; |
mutex_exit(&pool_head_lock); |
mutex_exit(&pool_head_lock); |
|
|
Line 2138 pool_cache_reclaim(pool_cache_t pc) |
|
Line 2253 pool_cache_reclaim(pool_cache_t pc) |
|
return pool_reclaim(&pc->pc_pool); |
return pool_reclaim(&pc->pc_pool); |
} |
} |
|
|
static inline void * |
static void |
pcg_get(pcg_t *pcg, paddr_t *pap) |
pool_cache_destruct_object1(pool_cache_t pc, void *object) |
{ |
|
void *object; |
|
u_int idx; |
|
|
|
KASSERT(pcg->pcg_avail <= PCG_NOBJECTS); |
|
KASSERT(pcg->pcg_avail != 0); |
|
|
|
idx = --pcg->pcg_avail; |
|
object = pcg->pcg_objects[idx].pcgo_va; |
|
if (pap != NULL) |
|
*pap = pcg->pcg_objects[idx].pcgo_pa; |
|
|
|
#ifdef DIAGNOSTIC |
|
pcg->pcg_objects[idx].pcgo_va = NULL; |
|
KASSERT(object != NULL); |
|
#endif |
|
|
|
return (object); |
|
} |
|
|
|
static inline void |
|
pcg_put(pcg_t *pcg, void *object, paddr_t pa) |
|
{ |
{ |
u_int idx; |
|
|
|
idx = pcg->pcg_avail++; |
|
|
|
KASSERT(pcg->pcg_avail <= PCG_NOBJECTS); |
|
KASSERT(pcg->pcg_objects[idx].pcgo_va == NULL); |
|
|
|
pcg->pcg_objects[idx].pcgo_va = object; |
(*pc->pc_dtor)(pc->pc_arg, object); |
pcg->pcg_objects[idx].pcgo_pa = pa; |
pool_put(&pc->pc_pool, object); |
} |
} |
|
|
/* |
/* |
|
|
pool_cache_destruct_object(pool_cache_t pc, void *object) |
pool_cache_destruct_object(pool_cache_t pc, void *object) |
{ |
{ |
|
|
if (pc->pc_dtor != NULL) |
FREECHECK_IN(&pc->pc_freecheck, object); |
(*pc->pc_dtor)(pc->pc_arg, object); |
|
pool_put(&pc->pc_pool, object); |
pool_cache_destruct_object1(pc, object); |
} |
} |
|
|
/* |
/* |
Line 2206 pool_cache_invalidate_groups(pool_cache_ |
|
Line 2293 pool_cache_invalidate_groups(pool_cache_ |
|
|
|
for (i = 0; i < pcg->pcg_avail; i++) { |
for (i = 0; i < pcg->pcg_avail; i++) { |
object = pcg->pcg_objects[i].pcgo_va; |
object = pcg->pcg_objects[i].pcgo_va; |
if (pc->pc_dtor != NULL) |
pool_cache_destruct_object1(pc, object); |
(*pc->pc_dtor)(pc->pc_arg, object); |
|
pool_put(&pc->pc_pool, object); |
|
} |
} |
|
|
pool_put(&pcgpool, pcg); |
if (pcg->pcg_size == PCG_NOBJECTS_LARGE) { |
|
pool_put(&pcg_large_pool, pcg); |
|
} else { |
|
KASSERT(pcg->pcg_size == PCG_NOBJECTS_NORMAL); |
|
pool_put(&pcg_normal_pool, pcg); |
|
} |
} |
} |
} |
} |
|
|
Line 2224 pool_cache_invalidate_groups(pool_cache_ |
|
Line 2314 pool_cache_invalidate_groups(pool_cache_ |
|
void |
void |
pool_cache_invalidate(pool_cache_t pc) |
pool_cache_invalidate(pool_cache_t pc) |
{ |
{ |
pcg_t *full, *empty; |
pcg_t *full, *empty, *part; |
|
|
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; |
|
part = pc->pc_partgroups; |
pc->pc_fullgroups = NULL; |
pc->pc_fullgroups = NULL; |
pc->pc_emptygroups = NULL; |
pc->pc_emptygroups = NULL; |
|
pc->pc_partgroups = NULL; |
pc->pc_nfull = 0; |
pc->pc_nfull = 0; |
pc->pc_nempty = 0; |
pc->pc_nempty = 0; |
|
pc->pc_npart = 0; |
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
|
|
pool_cache_invalidate_groups(pc, full); |
pool_cache_invalidate_groups(pc, full); |
pool_cache_invalidate_groups(pc, empty); |
pool_cache_invalidate_groups(pc, empty); |
|
pool_cache_invalidate_groups(pc, part); |
} |
} |
|
|
void |
void |
Line 2267 pool_cache_sethardlimit(pool_cache_t pc, |
|
Line 2361 pool_cache_sethardlimit(pool_cache_t pc, |
|
pool_sethardlimit(&pc->pc_pool, n, warnmess, ratecap); |
pool_sethardlimit(&pc->pc_pool, n, warnmess, ratecap); |
} |
} |
|
|
static inline pool_cache_cpu_t * |
static bool __noinline |
pool_cache_cpu_enter(pool_cache_t pc, int *s) |
pool_cache_get_slow(pool_cache_cpu_t *cc, int s, void **objectp, |
{ |
|
pool_cache_cpu_t *cc; |
|
struct cpu_info *ci; |
|
|
|
/* |
|
* Prevent other users of the cache from accessing our |
|
* CPU-local data. To avoid touching shared state, we |
|
* pull the neccessary information from CPU local data. |
|
*/ |
|
ci = curcpu(); |
|
cc = pc->pc_cpus[ci->ci_data.cpu_index]; |
|
if (cc->cc_ipl == IPL_NONE) { |
|
crit_enter(); |
|
} else { |
|
*s = splraiseipl(cc->cc_iplcookie); |
|
} |
|
|
|
/* Moved to another CPU before disabling preemption? */ |
|
if (__predict_false(ci != curcpu())) { |
|
ci = curcpu(); |
|
cc = pc->pc_cpus[ci->ci_data.cpu_index]; |
|
} |
|
|
|
#ifdef DIAGNOSTIC |
|
KASSERT(cc->cc_busy == NULL); |
|
KASSERT(cc->cc_cpu == ci); |
|
KASSERT(((uintptr_t)cc & (CACHE_LINE_SIZE - 1)) == 0); |
|
cc->cc_busy = curlwp; |
|
#endif |
|
|
|
return cc; |
|
} |
|
|
|
static inline void |
|
pool_cache_cpu_exit(pool_cache_cpu_t *cc, int *s) |
|
{ |
|
|
|
#ifdef DIAGNOSTIC |
|
KASSERT(cc->cc_busy == curlwp); |
|
cc->cc_busy = NULL; |
|
#endif |
|
|
|
/* No longer need exclusive access to the per-CPU data. */ |
|
if (cc->cc_ipl == IPL_NONE) { |
|
crit_exit(); |
|
} else { |
|
splx(*s); |
|
} |
|
} |
|
|
|
#if __GNUC_PREREQ__(3, 0) |
|
__attribute ((noinline)) |
|
#endif |
|
pool_cache_cpu_t * |
|
pool_cache_get_slow(pool_cache_cpu_t *cc, int *s, void **objectp, |
|
paddr_t *pap, int flags) |
paddr_t *pap, int flags) |
{ |
{ |
pcg_t *pcg, *cur; |
pcg_t *pcg, *cur; |
Line 2338 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
Line 2377 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
* Nothing was available locally. Try and grab a group |
* Nothing was available locally. Try and grab a group |
* from the cache. |
* from the cache. |
*/ |
*/ |
if (!mutex_tryenter(&pc->pc_lock)) { |
if (__predict_false(!mutex_tryenter(&pc->pc_lock))) { |
ncsw = curlwp->l_ncsw; |
ncsw = curlwp->l_ncsw; |
mutex_enter(&pc->pc_lock); |
mutex_enter(&pc->pc_lock); |
pc->pc_contended++; |
pc->pc_contended++; |
Line 2350 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
Line 2389 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
*/ |
*/ |
if (curlwp->l_ncsw != ncsw) { |
if (curlwp->l_ncsw != ncsw) { |
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
pool_cache_cpu_exit(cc, s); |
return true; |
return pool_cache_cpu_enter(pc, s); |
|
} |
} |
} |
} |
|
|
if ((pcg = pc->pc_fullgroups) != NULL) { |
if (__predict_true((pcg = pc->pc_fullgroups) != NULL)) { |
/* |
/* |
* If there's a full group, release our empty |
* If there's a full group, release our empty |
* group back to the cache. Install the full |
* group back to the cache. Install the full |
* group as cc_current and return. |
* group as cc_current and return. |
*/ |
*/ |
if ((cur = cc->cc_current) != NULL) { |
if (__predict_true((cur = cc->cc_current) != &pcg_dummy)) { |
KASSERT(cur->pcg_avail == 0); |
KASSERT(cur->pcg_avail == 0); |
cur->pcg_next = pc->pc_emptygroups; |
cur->pcg_next = pc->pc_emptygroups; |
pc->pc_emptygroups = cur; |
pc->pc_emptygroups = cur; |
pc->pc_nempty++; |
pc->pc_nempty++; |
} |
} |
KASSERT(pcg->pcg_avail == PCG_NOBJECTS); |
KASSERT(pcg->pcg_avail == pcg->pcg_size); |
cc->cc_current = pcg; |
cc->cc_current = pcg; |
pc->pc_fullgroups = pcg->pcg_next; |
pc->pc_fullgroups = pcg->pcg_next; |
pc->pc_hits++; |
pc->pc_hits++; |
pc->pc_nfull--; |
pc->pc_nfull--; |
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
return cc; |
return true; |
} |
} |
|
|
/* |
/* |
Line 2383 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
Line 2421 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
*/ |
*/ |
pc->pc_misses++; |
pc->pc_misses++; |
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
pool_cache_cpu_exit(cc, s); |
splx(s); |
|
|
object = pool_get(&pc->pc_pool, flags); |
object = pool_get(&pc->pc_pool, flags); |
*objectp = object; |
*objectp = object; |
if (object == NULL) |
if (__predict_false(object == NULL)) |
return NULL; |
return false; |
|
|
if (pc->pc_ctor != NULL) { |
if (__predict_false((*pc->pc_ctor)(pc->pc_arg, object, flags) != 0)) { |
if ((*pc->pc_ctor)(pc->pc_arg, object, flags) != 0) { |
pool_put(&pc->pc_pool, object); |
pool_put(&pc->pc_pool, object); |
*objectp = NULL; |
*objectp = NULL; |
return false; |
return NULL; |
|
} |
|
} |
} |
|
|
KASSERT((((vaddr_t)object + pc->pc_pool.pr_itemoffset) & |
KASSERT((((vaddr_t)object + pc->pc_pool.pr_itemoffset) & |
Line 2410 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
Line 2446 pool_cache_get_slow(pool_cache_cpu_t *cc |
|
} |
} |
|
|
FREECHECK_OUT(&pc->pc_freecheck, object); |
FREECHECK_OUT(&pc->pc_freecheck, object); |
return NULL; |
return false; |
} |
} |
|
|
/* |
/* |
Line 2428 pool_cache_get_paddr(pool_cache_t pc, in |
|
Line 2464 pool_cache_get_paddr(pool_cache_t pc, in |
|
int s; |
int s; |
|
|
#ifdef LOCKDEBUG |
#ifdef LOCKDEBUG |
if (flags & PR_WAITOK) |
if (flags & PR_WAITOK) { |
ASSERT_SLEEPABLE(NULL, "pool_cache_get(PR_WAITOK)"); |
ASSERT_SLEEPABLE(); |
|
} |
#endif |
#endif |
|
|
cc = pool_cache_cpu_enter(pc, &s); |
/* Lock out interrupts and disable preemption. */ |
do { |
s = splvm(); |
|
while (/* CONSTCOND */ true) { |
/* Try and allocate an object from the current group. */ |
/* Try and allocate an object from the current group. */ |
|
cc = pc->pc_cpus[curcpu()->ci_index]; |
|
KASSERT(cc->cc_cache == pc); |
pcg = cc->cc_current; |
pcg = cc->cc_current; |
if (pcg != NULL && pcg->pcg_avail > 0) { |
if (__predict_true(pcg->pcg_avail > 0)) { |
object = pcg_get(pcg, pap); |
object = pcg->pcg_objects[--pcg->pcg_avail].pcgo_va; |
|
if (__predict_false(pap != NULL)) |
|
*pap = pcg->pcg_objects[pcg->pcg_avail].pcgo_pa; |
|
#if defined(DIAGNOSTIC) |
|
pcg->pcg_objects[pcg->pcg_avail].pcgo_va = NULL; |
|
KASSERT(pcg->pcg_avail < pcg->pcg_size); |
|
KASSERT(object != NULL); |
|
#endif |
cc->cc_hits++; |
cc->cc_hits++; |
pool_cache_cpu_exit(cc, &s); |
splx(s); |
FREECHECK_OUT(&pc->pc_freecheck, object); |
FREECHECK_OUT(&pc->pc_freecheck, object); |
return object; |
return object; |
} |
} |
Line 2449 pool_cache_get_paddr(pool_cache_t pc, in |
|
Line 2496 pool_cache_get_paddr(pool_cache_t pc, in |
|
* it with the current group and allocate from there. |
* it with the current group and allocate from there. |
*/ |
*/ |
pcg = cc->cc_previous; |
pcg = cc->cc_previous; |
if (pcg != NULL && pcg->pcg_avail > 0) { |
if (__predict_true(pcg->pcg_avail > 0)) { |
cc->cc_previous = cc->cc_current; |
cc->cc_previous = cc->cc_current; |
cc->cc_current = pcg; |
cc->cc_current = pcg; |
continue; |
continue; |
Line 2458 pool_cache_get_paddr(pool_cache_t pc, in |
|
Line 2505 pool_cache_get_paddr(pool_cache_t pc, in |
|
/* |
/* |
* Can't allocate from either group: try the slow path. |
* Can't allocate from either group: try the slow path. |
* If get_slow() allocated an object for us, or if |
* If get_slow() allocated an object for us, or if |
* no more objects are available, it will return NULL. |
* no more objects are available, it will return false. |
* Otherwise, we need to retry. |
* Otherwise, we need to retry. |
*/ |
*/ |
cc = pool_cache_get_slow(cc, &s, &object, pap, flags); |
if (!pool_cache_get_slow(cc, s, &object, pap, flags)) |
} while (cc != NULL); |
break; |
|
} |
|
|
return object; |
return object; |
} |
} |
|
|
#if __GNUC_PREREQ__(3, 0) |
static bool __noinline |
__attribute ((noinline)) |
pool_cache_put_slow(pool_cache_cpu_t *cc, int s, void *object) |
#endif |
|
pool_cache_cpu_t * |
|
pool_cache_put_slow(pool_cache_cpu_t *cc, int *s, void *object, paddr_t pa) |
|
{ |
{ |
pcg_t *pcg, *cur; |
pcg_t *pcg, *cur; |
uint64_t ncsw; |
uint64_t ncsw; |
Line 2480 pool_cache_put_slow(pool_cache_cpu_t *cc |
|
Line 2525 pool_cache_put_slow(pool_cache_cpu_t *cc |
|
pc = cc->cc_cache; |
pc = cc->cc_cache; |
cc->cc_misses++; |
cc->cc_misses++; |
|
|
/* |
/* Lock the cache. */ |
* No free slots locally. Try to grab an empty, unused |
if (__predict_false(!mutex_tryenter(&pc->pc_lock))) { |
* group from the cache. |
|
*/ |
|
if (!mutex_tryenter(&pc->pc_lock)) { |
|
ncsw = curlwp->l_ncsw; |
ncsw = curlwp->l_ncsw; |
mutex_enter(&pc->pc_lock); |
mutex_enter(&pc->pc_lock); |
pc->pc_contended++; |
pc->pc_contended++; |
|
|
/* |
/* |
* If we context switched while locking, then |
* If we context switched while locking, then our view of |
* our view of the per-CPU data is invalid: |
* the per-CPU data is invalid: retry. |
* retry. |
|
*/ |
*/ |
if (curlwp->l_ncsw != ncsw) { |
if (__predict_false(curlwp->l_ncsw != ncsw)) { |
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
pool_cache_cpu_exit(cc, s); |
return true; |
return pool_cache_cpu_enter(pc, s); |
|
} |
} |
} |
} |
|
|
if ((pcg = pc->pc_emptygroups) != NULL) { |
/* If there are no empty groups in the cache then allocate one. */ |
/* |
if (__predict_false((pcg = pc->pc_emptygroups) == NULL)) { |
* If there's a empty group, release our full |
if (__predict_true(!pool_cache_disable)) { |
* group back to the cache. Install the empty |
pcg = pool_get(pc->pc_pcgpool, PR_NOWAIT); |
* group as cc_current and return. |
|
*/ |
|
if ((cur = cc->cc_current) != NULL) { |
|
KASSERT(cur->pcg_avail == PCG_NOBJECTS); |
|
cur->pcg_next = pc->pc_fullgroups; |
|
pc->pc_fullgroups = cur; |
|
pc->pc_nfull++; |
|
} |
} |
KASSERT(pcg->pcg_avail == 0); |
if (__predict_true(pcg != NULL)) { |
cc->cc_current = pcg; |
pcg->pcg_avail = 0; |
|
pcg->pcg_size = pc->pc_pcgsize; |
|
} |
|
} else { |
pc->pc_emptygroups = pcg->pcg_next; |
pc->pc_emptygroups = pcg->pcg_next; |
pc->pc_hits++; |
|
pc->pc_nempty--; |
pc->pc_nempty--; |
mutex_exit(&pc->pc_lock); |
|
return cc; |
|
} |
} |
|
|
/* |
/* |
* Nothing available locally or in cache. Take the |
* If there's a empty group, release our full group back |
* slow path and try to allocate a new group that we |
* to the cache. Install the empty group to the local CPU |
* can release to. |
* and return. |
*/ |
*/ |
pc->pc_misses++; |
if (pcg != NULL) { |
mutex_exit(&pc->pc_lock); |
KASSERT(pcg->pcg_avail == 0); |
pool_cache_cpu_exit(cc, s); |
if (__predict_false(cc->cc_previous == &pcg_dummy)) { |
|
cc->cc_previous = pcg; |
/* |
} else { |
* If we can't allocate a new group, just throw the |
cur = cc->cc_current; |
* object away. |
if (__predict_true(cur != &pcg_dummy)) { |
*/ |
KASSERT(cur->pcg_avail == cur->pcg_size); |
#ifdef XXXAD /* Disable the cache layer for now. */ |
cur->pcg_next = pc->pc_fullgroups; |
pcg = pool_get(&pcgpool, PR_NOWAIT); |
pc->pc_fullgroups = cur; |
#else |
pc->pc_nfull++; |
pcg = NULL; |
} |
#endif |
cc->cc_current = pcg; |
if (pcg == NULL) { |
} |
pool_cache_destruct_object(pc, object); |
pc->pc_hits++; |
return NULL; |
mutex_exit(&pc->pc_lock); |
|
return true; |
} |
} |
#ifdef DIAGNOSTIC |
|
memset(pcg, 0, sizeof(*pcg)); |
|
#else |
|
pcg->pcg_avail = 0; |
|
#endif |
|
|
|
/* |
/* |
* Add the empty group to the cache and try again. |
* Nothing available locally or in cache, and we didn't |
|
* allocate an empty group. Take the slow path and destroy |
|
* the object here and now. |
*/ |
*/ |
mutex_enter(&pc->pc_lock); |
pc->pc_misses++; |
pcg->pcg_next = pc->pc_emptygroups; |
|
pc->pc_emptygroups = pcg; |
|
pc->pc_nempty++; |
|
mutex_exit(&pc->pc_lock); |
mutex_exit(&pc->pc_lock); |
|
splx(s); |
|
pool_cache_destruct_object(pc, object); |
|
|
return pool_cache_cpu_enter(pc, s); |
return false; |
} |
} |
|
|
/* |
/* |
Line 2577 pool_cache_put_paddr(pool_cache_t pc, vo |
|
Line 2607 pool_cache_put_paddr(pool_cache_t pc, vo |
|
|
|
FREECHECK_IN(&pc->pc_freecheck, object); |
FREECHECK_IN(&pc->pc_freecheck, object); |
|
|
cc = pool_cache_cpu_enter(pc, &s); |
/* Lock out interrupts and disable preemption. */ |
do { |
s = splvm(); |
|
while (/* CONSTCOND */ true) { |
/* If the current group isn't full, release it there. */ |
/* If the current group isn't full, release it there. */ |
|
cc = pc->pc_cpus[curcpu()->ci_index]; |
|
KASSERT(cc->cc_cache == pc); |
pcg = cc->cc_current; |
pcg = cc->cc_current; |
if (pcg != NULL && pcg->pcg_avail < PCG_NOBJECTS) { |
if (__predict_true(pcg->pcg_avail < pcg->pcg_size)) { |
pcg_put(pcg, object, pa); |
pcg->pcg_objects[pcg->pcg_avail].pcgo_va = object; |
|
pcg->pcg_objects[pcg->pcg_avail].pcgo_pa = pa; |
|
pcg->pcg_avail++; |
cc->cc_hits++; |
cc->cc_hits++; |
pool_cache_cpu_exit(cc, &s); |
splx(s); |
return; |
return; |
} |
} |
|
|
/* |
/* |
* That failed. If the previous group is empty, swap |
* That failed. If the previous group isn't full, swap |
* it with the current group and try again. |
* it with the current group and try again. |
*/ |
*/ |
pcg = cc->cc_previous; |
pcg = cc->cc_previous; |
if (pcg != NULL && pcg->pcg_avail == 0) { |
if (__predict_true(pcg->pcg_avail < pcg->pcg_size)) { |
cc->cc_previous = cc->cc_current; |
cc->cc_previous = cc->cc_current; |
cc->cc_current = pcg; |
cc->cc_current = pcg; |
continue; |
continue; |
Line 2602 pool_cache_put_paddr(pool_cache_t pc, vo |
|
Line 2637 pool_cache_put_paddr(pool_cache_t pc, vo |
|
/* |
/* |
* Can't free to either group: try the slow path. |
* Can't free to either group: try the slow path. |
* If put_slow() releases the object for us, it |
* If put_slow() releases the object for us, it |
* will return NULL. Otherwise we need to retry. |
* will return false. Otherwise we need to retry. |
*/ |
*/ |
cc = pool_cache_put_slow(cc, &s, object, pa); |
if (!pool_cache_put_slow(cc, s, object)) |
} while (cc != NULL); |
break; |
|
} |
|
} |
|
|
|
/* |
|
* pool_cache_xcall: |
|
* |
|
* Transfer objects from the per-CPU cache to the global cache. |
|
* Run within a cross-call thread. |
|
*/ |
|
static void |
|
pool_cache_xcall(pool_cache_t pc) |
|
{ |
|
pool_cache_cpu_t *cc; |
|
pcg_t *prev, *cur, **list; |
|
int s; |
|
|
|
s = splvm(); |
|
mutex_enter(&pc->pc_lock); |
|
cc = pc->pc_cpus[curcpu()->ci_index]; |
|
cur = cc->cc_current; |
|
cc->cc_current = &pcg_dummy; |
|
prev = cc->cc_previous; |
|
cc->cc_previous = &pcg_dummy; |
|
if (cur != &pcg_dummy) { |
|
if (cur->pcg_avail == cur->pcg_size) { |
|
list = &pc->pc_fullgroups; |
|
pc->pc_nfull++; |
|
} else if (cur->pcg_avail == 0) { |
|
list = &pc->pc_emptygroups; |
|
pc->pc_nempty++; |
|
} else { |
|
list = &pc->pc_partgroups; |
|
pc->pc_npart++; |
|
} |
|
cur->pcg_next = *list; |
|
*list = cur; |
|
} |
|
if (prev != &pcg_dummy) { |
|
if (prev->pcg_avail == prev->pcg_size) { |
|
list = &pc->pc_fullgroups; |
|
pc->pc_nfull++; |
|
} else if (prev->pcg_avail == 0) { |
|
list = &pc->pc_emptygroups; |
|
pc->pc_nempty++; |
|
} else { |
|
list = &pc->pc_partgroups; |
|
pc->pc_npart++; |
|
} |
|
prev->pcg_next = *list; |
|
*list = prev; |
|
} |
|
mutex_exit(&pc->pc_lock); |
|
splx(s); |
} |
} |
|
|
/* |
/* |
Line 2771 pool_page_free_nointr(struct pool *pp, v |
|
Line 2859 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); |
} |
} |
|
|
|
#if defined(DDB) |
|
static bool |
|
pool_in_page(struct pool *pp, struct pool_item_header *ph, uintptr_t addr) |
|
{ |
|
|
|
return (uintptr_t)ph->ph_page <= addr && |
|
addr < (uintptr_t)ph->ph_page + pp->pr_alloc->pa_pagesz; |
|
} |
|
|
|
static bool |
|
pool_in_item(struct pool *pp, void *item, uintptr_t addr) |
|
{ |
|
|
|
return (uintptr_t)item <= addr && addr < (uintptr_t)item + pp->pr_size; |
|
} |
|
|
|
static bool |
|
pool_in_cg(struct pool *pp, struct pool_cache_group *pcg, uintptr_t addr) |
|
{ |
|
int i; |
|
|
|
if (pcg == NULL) { |
|
return false; |
|
} |
|
for (i = 0; i < pcg->pcg_avail; i++) { |
|
if (pool_in_item(pp, pcg->pcg_objects[i].pcgo_va, addr)) { |
|
return true; |
|
} |
|
} |
|
return false; |
|
} |
|
|
|
static bool |
|
pool_allocated(struct pool *pp, struct pool_item_header *ph, uintptr_t addr) |
|
{ |
|
|
|
if ((pp->pr_roflags & PR_NOTOUCH) != 0) { |
|
unsigned int idx = pr_item_notouch_index(pp, ph, (void *)addr); |
|
pool_item_bitmap_t *bitmap = |
|
ph->ph_bitmap + (idx / BITMAP_SIZE); |
|
pool_item_bitmap_t mask = 1 << (idx & BITMAP_MASK); |
|
|
|
return (*bitmap & mask) == 0; |
|
} else { |
|
struct pool_item *pi; |
|
|
|
LIST_FOREACH(pi, &ph->ph_itemlist, pi_list) { |
|
if (pool_in_item(pp, pi, addr)) { |
|
return false; |
|
} |
|
} |
|
return true; |
|
} |
|
} |
|
|
|
void |
|
pool_whatis(uintptr_t addr, void (*pr)(const char *, ...)) |
|
{ |
|
struct pool *pp; |
|
|
|
TAILQ_FOREACH(pp, &pool_head, pr_poollist) { |
|
struct pool_item_header *ph; |
|
uintptr_t item; |
|
bool allocated = true; |
|
bool incache = false; |
|
bool incpucache = false; |
|
char cpucachestr[32]; |
|
|
|
if ((pp->pr_roflags & PR_PHINPAGE) != 0) { |
|
LIST_FOREACH(ph, &pp->pr_fullpages, ph_pagelist) { |
|
if (pool_in_page(pp, ph, addr)) { |
|
goto found; |
|
} |
|
} |
|
LIST_FOREACH(ph, &pp->pr_partpages, ph_pagelist) { |
|
if (pool_in_page(pp, ph, addr)) { |
|
allocated = |
|
pool_allocated(pp, ph, addr); |
|
goto found; |
|
} |
|
} |
|
LIST_FOREACH(ph, &pp->pr_emptypages, ph_pagelist) { |
|
if (pool_in_page(pp, ph, addr)) { |
|
allocated = false; |
|
goto found; |
|
} |
|
} |
|
continue; |
|
} else { |
|
ph = pr_find_pagehead_noalign(pp, (void *)addr); |
|
if (ph == NULL || !pool_in_page(pp, ph, addr)) { |
|
continue; |
|
} |
|
allocated = pool_allocated(pp, ph, addr); |
|
} |
|
found: |
|
if (allocated && pp->pr_cache) { |
|
pool_cache_t pc = pp->pr_cache; |
|
struct pool_cache_group *pcg; |
|
int i; |
|
|
|
for (pcg = pc->pc_fullgroups; pcg != NULL; |
|
pcg = pcg->pcg_next) { |
|
if (pool_in_cg(pp, pcg, addr)) { |
|
incache = true; |
|
goto print; |
|
} |
|
} |
|
for (i = 0; i < MAXCPUS; i++) { |
|
pool_cache_cpu_t *cc; |
|
|
|
if ((cc = pc->pc_cpus[i]) == NULL) { |
|
continue; |
|
} |
|
if (pool_in_cg(pp, cc->cc_current, addr) || |
|
pool_in_cg(pp, cc->cc_previous, addr)) { |
|
struct cpu_info *ci = |
|
cpu_lookup_byindex(i); |
|
|
|
incpucache = true; |
|
snprintf(cpucachestr, |
|
sizeof(cpucachestr), |
|
"cached by CPU %u", |
|
ci->ci_index); |
|
goto print; |
|
} |
|
} |
|
} |
|
print: |
|
item = (uintptr_t)ph->ph_page + ph->ph_off; |
|
item = item + rounddown(addr - item, pp->pr_size); |
|
(*pr)("%p is %p+%zu in POOL '%s' (%s)\n", |
|
(void *)addr, item, (size_t)(addr - item), |
|
pp->pr_wchan, |
|
incpucache ? cpucachestr : |
|
incache ? "cached" : allocated ? "allocated" : "free"); |
|
} |
|
} |
|
#endif /* defined(DDB) */ |