src/sys/kern/subr_pool.c - diff

Return to subr_pool.c CVS log

Up to [cvs.NetBSD.org] / src / sys / kern

Please note that diffs are not public domain; they are subject to the copyright notices on the relevant files.

Diff for /src/sys/kern/subr_pool.c between version 1.30.2.4 and 1.32

version 1.30.2.4, 2000/12/13 15:50:21

version 1.32, 2000/04/10 02:17:42

Line 1

/* $NetBSD$ */

/*-

* This code is derived from software contributed to The NetBSD Foundation

Line 51

#include <sys/pool.h>

#include <sys/syslog.h>

#include <vm/vm.h>

#include <vm/vm_kern.h>

#include <uvm/uvm.h>

Line 94 struct pool_item_header {

Line 97 struct pool_item_header {

struct pool_item {

#ifdef DIAGNOSTIC

int pi_magic;

#endif

#define PI_MAGIC 0xdeadbeef

#endif

/* Other entries use only this list entry */

TAILQ_ENTRY(pool_item) pi_list;

};

#define PR_HASH_INDEX(pp,addr) \

(((u_long)(addr) >> (pp)->pr_pageshift) & (PR_HASHTABSIZE - 1))

* Pool cache management.

* Pool caches provide a way for constructed objects to be cached by the

* pool subsystem. This can lead to performance improvements by avoiding

* needless object construction/destruction; it is deferred until absolutely

* necessary.

* Caches are grouped into cache groups. Each cache group references

* up to 16 constructed objects. When a cache allocates an object

* from the pool, it calls the object's constructor and places it into

* a cache group. When a cache group frees an object back to the pool,

* it first calls the object's destructor. This allows the object to

* persist in constructed form while freed to the cache.

* Multiple caches may exist for each pool. This allows a single

* object type to have multiple constructed forms. The pool references

* each cache, so that when a pool is drained by the pagedaemon, it can

* drain each individual cache as well. Each time a cache is drained,

* the most idle cache group is freed to the pool in its entirety.

* Pool caches are layed on top of pools. By layering them, we can avoid

* the complexity of cache management for pools which would not benefit

* from it.

/* The cache group pool. */

static struct pool pcgpool;

/* The pool cache group. */

#define PCG_NOBJECTS 16

struct pool_cache_group {

TAILQ_ENTRY(pool_cache_group)

pcg_list; /* link in the pool cache's group list */

u_int pcg_avail; /* # available objects */

/* pointers to the objects */

void *pcg_objects[PCG_NOBJECTS];

};

static void pool_cache_reclaim(struct pool_cache *);

static int pool_catchup(struct pool *);

static struct pool_item_header

static void pool_prime_page(struct pool *, caddr_t);

*pr_find_pagehead __P((struct pool *, caddr_t));

static void *pool_page_alloc(unsigned long, int, int);

static void pr_rmpage __P((struct pool *, struct pool_item_header *));

static void pool_page_free(void *, unsigned long, int);

static int pool_catchup __P((struct pool *));

static void pool_prime_page __P((struct pool *, caddr_t));

static void *pool_page_alloc __P((unsigned long, int, int));

static void pool_page_free __P((void *, unsigned long, int));

static void pool_print1(struct pool *, const char *,

static void pool_print1 __P((struct pool *, const char *,

void (*)(const char *, ...));

void (*)(const char *, ...)));

* Pool log entry. An array of these is allocated in pool_create().

Line 172 struct pool_log {

Line 140 struct pool_log {

int pool_logsize = POOL_LOGSIZE;

#ifdef DIAGNOSTIC

static __inline void

static void pr_log __P((struct pool *, void *, int, const char *, long));

pr_log(struct pool *pp, void *v, int action, const char *file, long line)

static void pr_printlog __P((struct pool *, struct pool_item *,

void (*)(const char *, ...)));

static void pr_enter __P((struct pool *, const char *, long));

static void pr_leave __P((struct pool *));

static void pr_enter_check __P((struct pool *,

void (*)(const char *, ...)));

static __inline__ void

pr_log(pp, v, action, file, line)

struct pool *pp;

void *v;

int action;

const char *file;

long line;

{

int n = pp->pr_curlogentry;

struct pool_log *pl;

Line 196 pr_log(struct pool *pp, void *v, int act

Line 177 pr_log(struct pool *pp, void *v, int act

}

static void

pr_printlog(struct pool *pp, struct pool_item *pi,

pr_printlog(pp, pi, pr)

void (*pr)(const char *, ...))

struct pool *pp;

struct pool_item *pi;

void (*pr) __P((const char *, ...));

{

int i = pp->pr_logsize;

int n = pp->pr_curlogentry;

Line 225 pr_printlog(struct pool *pp, struct pool

Line 208 pr_printlog(struct pool *pp, struct pool

}

static __inline void

static __inline__ void

pr_enter(struct pool *pp, const char *file, long line)

pr_enter(pp, file, line)

struct pool *pp;

const char *file;

long line;

{

if (__predict_false(pp->pr_entered_file != NULL)) {

if (pp->pr_entered_file != NULL) {

printf("pool %s: reentrancy at file %s line %ld\n",

pp->pr_wchan, file, line);

printf(" previous entry at file %s line %ld\n",

Line 241 pr_enter(struct pool *pp, const char *fi

Line 227 pr_enter(struct pool *pp, const char *fi

pp->pr_entered_line = line;

}

static __inline void

static __inline__ void

pr_leave(struct pool *pp)

pr_leave(pp)

struct pool *pp;

{

if (__predict_false(pp->pr_entered_file == NULL)) {

if (pp->pr_entered_file == NULL) {

printf("pool %s not entered?\n", pp->pr_wchan);

panic("pr_leave");

}

Line 254 pr_leave(struct pool *pp)

Line 241 pr_leave(struct pool *pp)

pp->pr_entered_line = 0;

}

static __inline void

static __inline__ void

pr_enter_check(struct pool *pp, void (*pr)(const char *, ...))

pr_enter_check(pp, pr)

struct pool *pp;

void (*pr) __P((const char *, ...));

{

if (pp->pr_entered_file != NULL)

Line 273 pr_enter_check(struct pool *pp, void (*p

Line 262 pr_enter_check(struct pool *pp, void (*p

* Return the pool page header based on page address.

static __inline struct pool_item_header *

static __inline__ struct pool_item_header *

pr_find_pagehead(struct pool *pp, caddr_t page)

pr_find_pagehead(pp, page)

struct pool *pp;

caddr_t page;

{

struct pool_item_header *ph;

Line 293 pr_find_pagehead(struct pool *pp, caddr_

Line 284 pr_find_pagehead(struct pool *pp, caddr_

* Remove a page from the pool.

static __inline void

static __inline__ void

pr_rmpage(struct pool *pp, struct pool_item_header *ph)

pr_rmpage(pp, ph)

struct pool *pp;

struct pool_item_header *ph;

{

Line 347 pr_rmpage(struct pool *pp, struct pool_i

Line 340 pr_rmpage(struct pool *pp, struct pool_i

* Allocate and initialize a pool.

struct pool *

pool_create(size_t size, u_int align, u_int ioff, int nitems,

pool_create(size, align, ioff, nitems, wchan, pagesz, alloc, release, mtype)

const char *wchan, size_t pagesz,

size_t size;

void *(*alloc)(unsigned long, int, int),

u_int align;

void (*release)(void *, unsigned long, int),

u_int ioff;

int mtype)

int nitems;

const char *wchan;

size_t pagesz;

void *(*alloc) __P((unsigned long, int, int));

void (*release) __P((void *, unsigned long, int));

int mtype;

{

struct pool *pp;

int flags;

Line 381 pool_create(size_t size, u_int align, u_

Line 379 pool_create(size_t size, u_int align, u_

* static pools that must be initialized before malloc() is available.

void

pool_init(struct pool *pp, size_t size, u_int align, u_int ioff, int flags,

pool_init(pp, size, align, ioff, flags, wchan, pagesz, alloc, release, mtype)

const char *wchan, size_t pagesz,

struct pool *pp;

void *(*alloc)(unsigned long, int, int),

size_t size;

void (*release)(void *, unsigned long, int),

u_int align;

int mtype)

u_int ioff;

int flags;

const char *wchan;

size_t pagesz;

void *(*alloc) __P((unsigned long, int, int));

void (*release) __P((void *, unsigned long, int));

int mtype;

{

int off, slack, i;

Line 400 pool_init(struct pool *pp, size_t size,

Line 404 pool_init(struct pool *pp, size_t size,

* Check arguments and construct default values.

if (!powerof2(pagesz))

if (!powerof2(pagesz) || pagesz > PAGE_SIZE)

panic("pool_init: page size invalid (%lx)\n", (u_long)pagesz);

if (alloc == NULL && release == NULL) {

Line 421 pool_init(struct pool *pp, size_t size,

Line 425 pool_init(struct pool *pp, size_t size,

if (size < sizeof(struct pool_item))

size = sizeof(struct pool_item);

size = ALIGN(size);

if (size > pagesz)

panic("pool_init: pool item size (%lu) too large",

(u_long)size);

* Initialize the pool structure.

TAILQ_INIT(&pp->pr_pagelist);

TAILQ_INIT(&pp->pr_cachelist);

pp->pr_curpage = NULL;

pp->pr_npages = 0;

pp->pr_minitems = 0;

Line 438 pool_init(struct pool *pp, size_t size,

Line 436 pool_init(struct pool *pp, size_t size,

pp->pr_maxpages = UINT_MAX;

pp->pr_roflags = flags;

pp->pr_flags = 0;

pp->pr_size = size;

pp->pr_size = ALIGN(size);

pp->pr_align = align;

pp->pr_wchan = wchan;

pp->pr_mtype = mtype;

Line 486 pool_init(struct pool *pp, size_t size,

Line 484 pool_init(struct pool *pp, size_t size,

pp->pr_itemoffset = ioff = ioff % align;

pp->pr_itemsperpage = (off - ((align - ioff) % align)) / pp->pr_size;

KASSERT(pp->pr_itemsperpage != 0);

* Use the slack between the chunks and the page header

Line 519 pool_init(struct pool *pp, size_t size,

Line 516 pool_init(struct pool *pp, size_t size,

simple_lock_init(&pp->pr_slock);

* Initialize private page header pool and cache magazine pool if we

* Initialize private page header pool if we haven't done so yet.

* haven't done so yet.

* XXX LOCKING.

if (phpool.pr_size == 0) {

pool_init(&phpool, sizeof(struct pool_item_header), 0, 0,

0, "phpool", 0, 0, 0, 0);

pool_init(&pcgpool, sizeof(struct pool_cache_group), 0, 0,

0, "pcgpool", 0, 0, 0, 0);

}

/* Insert into the list of all pools. */

Line 540 pool_init(struct pool *pp, size_t size,

Line 534 pool_init(struct pool *pp, size_t size,

* De-commision a pool resource.

void

pool_destroy(struct pool *pp)

pool_destroy(pp)

struct pool *pp;

{

struct pool_item_header *ph;

struct pool_cache *pc;

/* Destroy all caches for this pool. */

while ((pc = TAILQ_FIRST(&pp->pr_cachelist)) != NULL)

pool_cache_destroy(pc);

#ifdef DIAGNOSTIC

if (pp->pr_nout != 0) {

Line 581 pool_destroy(struct pool *pp)

Line 571 pool_destroy(struct pool *pp)

* Grab an item from the pool; must be called at appropriate spl level

void *

_pool_get(struct pool *pp, int flags, const char *file, long line)

_pool_get(pp, flags, file, line)

struct pool *pp;

int flags;

const char *file;

long line;

{

void *v;

struct pool_item *pi;

struct pool_item_header *ph;

#ifdef DIAGNOSTIC

if (__predict_false((pp->pr_roflags & PR_STATIC) &&

if ((pp->pr_roflags & PR_STATIC) && (flags & PR_MALLOCOK)) {

(flags & PR_MALLOCOK))) {

pr_printlog(pp, NULL, printf);

panic("pool_get: static");

}

#endif

if (__predict_false(curproc == NULL && doing_shutdown == 0 &&

if (curproc == NULL && (flags & PR_WAITOK) != 0)

(flags & PR_WAITOK) != 0))

panic("pool_get: must have NOWAIT");

simple_lock(&pp->pr_slock);

Line 609 _pool_get(struct pool *pp, int flags, co

Line 601 _pool_get(struct pool *pp, int flags, co

* the pool.

#ifdef DIAGNOSTIC

if (__predict_false(pp->pr_nout > pp->pr_hardlimit)) {

if (pp->pr_nout > pp->pr_hardlimit) {

pr_leave(pp);

simple_unlock(&pp->pr_slock);

panic("pool_get: %s: crossed hard limit", pp->pr_wchan);

}

#endif

if (__predict_false(pp->pr_nout == pp->pr_hardlimit)) {

if (pp->pr_nout == pp->pr_hardlimit) {

if ((flags & PR_WAITOK) && !(flags & PR_LIMITFAIL)) {

* XXX: A warning isn't logged in this case. Should

Line 623 _pool_get(struct pool *pp, int flags, co

Line 615 _pool_get(struct pool *pp, int flags, co

pp->pr_flags |= PR_WANTED;

pr_leave(pp);

ltsleep(pp, PSWP, pp->pr_wchan, 0, &pp->pr_slock);

simple_unlock(&pp->pr_slock);

tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

goto startover;

}

Line 708 _pool_get(struct pool *pp, int flags, co

Line 702 _pool_get(struct pool *pp, int flags, co

pp->pr_flags |= PR_WANTED;

pr_leave(pp);

ltsleep(pp, PSWP, pp->pr_wchan, 0, &pp->pr_slock);

simple_unlock(&pp->pr_slock);

tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

goto startover;

}

Line 721 _pool_get(struct pool *pp, int flags, co

Line 717 _pool_get(struct pool *pp, int flags, co

goto startover;

}

if (__predict_false((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL)) {

if ((v = pi = TAILQ_FIRST(&ph->ph_itemlist)) == NULL) {

pr_leave(pp);

simple_unlock(&pp->pr_slock);

panic("pool_get: %s: page empty", pp->pr_wchan);

}

#ifdef DIAGNOSTIC

if (__predict_false(pp->pr_nitems == 0)) {

if (pp->pr_nitems == 0) {

pr_leave(pp);

simple_unlock(&pp->pr_slock);

printf("pool_get: %s: items on itemlist, nitems %u\n",

Line 738 _pool_get(struct pool *pp, int flags, co

Line 734 _pool_get(struct pool *pp, int flags, co

pr_log(pp, v, PRLOG_GET, file, line);

#ifdef DIAGNOSTIC

if (__predict_false(pi->pi_magic != PI_MAGIC)) {

if (pi->pi_magic != PI_MAGIC) {

pr_printlog(pp, pi, printf);

panic("pool_get(%s): free list modified: magic=%x; page %p;"

" item addr %p\n",

Line 754 _pool_get(struct pool *pp, int flags, co

Line 750 _pool_get(struct pool *pp, int flags, co

pp->pr_nout++;

if (ph->ph_nmissing == 0) {

#ifdef DIAGNOSTIC

if (__predict_false(pp->pr_nidle == 0))

if (pp->pr_nidle == 0)

panic("pool_get: nidle inconsistent");

#endif

pp->pr_nidle--;

Line 762 _pool_get(struct pool *pp, int flags, co

Line 758 _pool_get(struct pool *pp, int flags, co

ph->ph_nmissing++;

if (TAILQ_FIRST(&ph->ph_itemlist) == NULL) {

#ifdef DIAGNOSTIC

if (__predict_false(ph->ph_nmissing != pp->pr_itemsperpage)) {

if (ph->ph_nmissing != pp->pr_itemsperpage) {

pr_leave(pp);

simple_unlock(&pp->pr_slock);

panic("pool_get: %s: nmissing inconsistent",

Line 810 _pool_get(struct pool *pp, int flags, co

Line 806 _pool_get(struct pool *pp, int flags, co

}

* Internal version of pool_put(). Pool is already locked/entered.

* Return resource to the pool; must be called at appropriate spl level

static void

void

pool_do_put(struct pool *pp, void *v, const char *file, long line)

_pool_put(pp, v, file, line)

struct pool *pp;

void *v;

const char *file;

long line;

{

struct pool_item *pi = v;

struct pool_item_header *ph;

Line 822 pool_do_put(struct pool *pp, void *v, co

page = (caddr_t)((u_long)v & pp->pr_pagemask);

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

#ifdef DIAGNOSTIC

if (__predict_false(pp->pr_nout == 0)) {

if (pp->pr_nout == 0) {

printf("pool %s: putting with none out\n",

pp->pr_wchan);

panic("pool_put");

Line 832 pool_do_put(struct pool *pp, void *v, co

Line 835 pool_do_put(struct pool *pp, void *v, co

pr_log(pp, v, PRLOG_PUT, file, line);

if (__predict_false((ph = pr_find_pagehead(pp, page)) == NULL)) {

if ((ph = pr_find_pagehead(pp, page)) == NULL) {

pr_printlog(pp, NULL, printf);

panic("pool_put: %s: page header missing", pp->pr_wchan);

}

Line 874 pool_do_put(struct pool *pp, void *v, co

Line 877 pool_do_put(struct pool *pp, void *v, co

pp->pr_flags &= ~PR_WANTED;

if (ph->ph_nmissing == 0)

pp->pr_nidle++;

pr_leave(pp);

simple_unlock(&pp->pr_slock);

wakeup((caddr_t)pp);

return;

}

Line 937 pool_do_put(struct pool *pp, void *v, co

Line 942 pool_do_put(struct pool *pp, void *v, co

TAILQ_INSERT_HEAD(&pp->pr_pagelist, ph, ph_pagelist);

pp->pr_curpage = ph;

}

* Return resource to the pool; must be called at appropriate spl level

void

_pool_put(struct pool *pp, void *v, const char *file, long line)

{

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

pool_do_put(pp, v, file, line);

pr_leave(pp);

simple_unlock(&pp->pr_slock);

}

* Add N items to the pool.

int

pool_prime(struct pool *pp, int n, caddr_t storage)

pool_prime(pp, n, storage)

struct pool *pp;

int n;

caddr_t storage;

{

caddr_t cp;

int newnitems, newpages;

#ifdef DIAGNOSTIC

if (__predict_false(storage && !(pp->pr_roflags & PR_STATIC)))

if (storage && !(pp->pr_roflags & PR_STATIC))

panic("pool_prime: static");

/* !storage && static caught below */

#endif

Line 1012 pool_prime(struct pool *pp, int n, caddr

Line 1008 pool_prime(struct pool *pp, int n, caddr

* Note, we must be called with the pool descriptor LOCKED.

static void

pool_prime_page(struct pool *pp, caddr_t storage)

pool_prime_page(pp, storage)

struct pool *pp;

caddr_t storage;

{

struct pool_item *pi;

struct pool_item_header *ph;

Line 1021 pool_prime_page(struct pool *pp, caddr_t

Line 1019 pool_prime_page(struct pool *pp, caddr_t

unsigned int ioff = pp->pr_itemoffset;

int s, n;

if (((u_long)cp & (pp->pr_pagesz - 1)) != 0)

panic("pool_prime_page: %s: unaligned page", pp->pr_wchan);

if ((pp->pr_roflags & PR_PHINPAGE) != 0) {

ph = (struct pool_item_header *)(cp + pp->pr_phoffset);

} else {

Line 1098 pool_prime_page(struct pool *pp, caddr_t

Line 1093 pool_prime_page(struct pool *pp, caddr_t

* with it locked.

static int

pool_catchup(struct pool *pp)

pool_catchup(pp)

struct pool *pp;

{

caddr_t cp;

int error = 0;

Line 1125 pool_catchup(struct pool *pp)

Line 1121 pool_catchup(struct pool *pp)

simple_unlock(&pp->pr_slock);

cp = (*pp->pr_alloc)(pp->pr_pagesz, 0, pp->pr_mtype);

simple_lock(&pp->pr_slock);

if (__predict_false(cp == NULL)) {

if (cp == NULL) {

error = ENOMEM;

break;

}

Line 1137 pool_catchup(struct pool *pp)

Line 1133 pool_catchup(struct pool *pp)

}

void

pool_setlowat(struct pool *pp, int n)

pool_setlowat(pp, n)

pool_handle_t pp;

int n;

{

int error;

Line 1149 pool_setlowat(struct pool *pp, int n)

Line 1147 pool_setlowat(struct pool *pp, int n)

: roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;

/* Make sure we're caught up with the newly-set low water mark. */

if ((pp->pr_nitems < pp->pr_minitems) &&

if ((error = pool_catchup(pp)) != 0) {

(error = pool_catchup(pp)) != 0) {

* XXX: Should we log a warning? Should we set up a timeout

* to try again in a second or so? The latter could break

Line 1162 pool_setlowat(struct pool *pp, int n)

Line 1159 pool_setlowat(struct pool *pp, int n)

}

void

pool_sethiwat(struct pool *pp, int n)

pool_sethiwat(pp, n)

pool_handle_t pp;

int n;

{

simple_lock(&pp->pr_slock);

Line 1175 pool_sethiwat(struct pool *pp, int n)

Line 1174 pool_sethiwat(struct pool *pp, int n)

}

void

pool_sethardlimit(struct pool *pp, int n, const char *warnmess, int ratecap)

pool_sethardlimit(pp, n, warnmess, ratecap)

pool_handle_t pp;

int n;

const char *warnmess;

int ratecap;

{

simple_lock(&pp->pr_slock);

Line 1201 pool_sethardlimit(struct pool *pp, int n

Line 1204 pool_sethardlimit(struct pool *pp, int n

* Default page allocator.

static void *

pool_page_alloc(unsigned long sz, int flags, int mtype)

pool_page_alloc(sz, flags, mtype)

unsigned long sz;

int flags;

int mtype;

{

boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;

Line 1209 pool_page_alloc(unsigned long sz, int fl

Line 1215 pool_page_alloc(unsigned long sz, int fl

}

static void

pool_page_free(void *v, unsigned long sz, int mtype)

pool_page_free(v, sz, mtype)

void *v;

unsigned long sz;

int mtype;

{

uvm_km_free_poolpage((vaddr_t)v);

Line 1220 pool_page_free(void *v, unsigned long sz

Line 1229 pool_page_free(void *v, unsigned long sz

* never be accessed in interrupt context.

void *

pool_page_alloc_nointr(unsigned long sz, int flags, int mtype)

pool_page_alloc_nointr(sz, flags, mtype)

unsigned long sz;

int flags;

int mtype;

{

boolean_t waitok = (flags & PR_WAITOK) ? TRUE : FALSE;

Line 1229 pool_page_alloc_nointr(unsigned long sz,

Line 1241 pool_page_alloc_nointr(unsigned long sz,

}

void

pool_page_free_nointr(void *v, unsigned long sz, int mtype)

pool_page_free_nointr(v, sz, mtype)

void *v;

unsigned long sz;

int mtype;

{

uvm_km_free_poolpage1(kernel_map, (vaddr_t)v);

Line 1240 pool_page_free_nointr(void *v, unsigned

Line 1255 pool_page_free_nointr(void *v, unsigned

* Release all complete pages that have not been used recently.

void

_pool_reclaim(struct pool *pp, const char *file, long line)

_pool_reclaim(pp, file, line)

pool_handle_t pp;

const char *file;

long line;

{

struct pool_item_header *ph, *phnext;

struct pool_cache *pc;

struct timeval curtime;

int s;

Line 1254 _pool_reclaim(struct pool *pp, const cha

Line 1271 _pool_reclaim(struct pool *pp, const cha

return;

pr_enter(pp, file, line);

* Reclaim items from the pool's caches.

for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL;

pc = TAILQ_NEXT(pc, pc_poollist))

pool_cache_reclaim(pc);

s = splclock();

curtime = mono_time;

splx(s);

Line 1301 _pool_reclaim(struct pool *pp, const cha

Line 1311 _pool_reclaim(struct pool *pp, const cha

* Note, we must never be called from an interrupt context.

void

pool_drain(void *arg)

pool_drain(arg)

void *arg;

{

struct pool *pp;

int s;

Line 1327 pool_drain(void *arg)

Line 1338 pool_drain(void *arg)

* Diagnostic helpers.

void

pool_print(struct pool *pp, const char *modif)

pool_print(pp, modif)

struct pool *pp;

const char *modif;

{

int s;

Line 1344 pool_print(struct pool *pp, const char *

Line 1357 pool_print(struct pool *pp, const char *

}

void

pool_printit(struct pool *pp, const char *modif, void (*pr)(const char *, ...))

pool_printit(pp, modif, pr)

struct pool *pp;

const char *modif;

void (*pr) __P((const char *, ...));

{

int didlock = 0;

Line 1374 pool_printit(struct pool *pp, const char

Line 1390 pool_printit(struct pool *pp, const char

}

static void

pool_print1(struct pool *pp, const char *modif, void (*pr)(const char *, ...))

pool_print1(pp, modif, pr)

struct pool *pp;

const char *modif;

void (*pr) __P((const char *, ...));

{

struct pool_item_header *ph;

struct pool_cache *pc;

struct pool_cache_group *pcg;

#ifdef DIAGNOSTIC

struct pool_item *pi;

#endif

int i, print_log = 0, print_pagelist = 0, print_cache = 0;

int print_log = 0, print_pagelist = 0;

char c;

while ((c = *modif++) != '\0') {

Line 1390 pool_print1(struct pool *pp, const char

Line 1407 pool_print1(struct pool *pp, const char

print_log = 1;

if (c == 'p')

print_pagelist = 1;

if (c == 'c')

print_cache = 1;

modif++;

}

Line 1448 pool_print1(struct pool *pp, const char

Line 1463 pool_print1(struct pool *pp, const char

skip_log:

if (print_cache == 0)

goto skip_cache;

for (pc = TAILQ_FIRST(&pp->pr_cachelist); pc != NULL;

pc = TAILQ_NEXT(pc, pc_poollist)) {

(*pr)("\tcache %p: allocfrom %p freeto %p\n", pc,

pc->pc_allocfrom, pc->pc_freeto);

(*pr)("\t hits %lu misses %lu ngroups %lu nitems %lu\n",

pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems);

for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL;

pcg = TAILQ_NEXT(pcg, pcg_list)) {

(*pr)("\t\tgroup %p: avail %d\n", pcg, pcg->pcg_avail);

for (i = 0; i < PCG_NOBJECTS; i++)

(*pr)("\t\t\t%p\n", pcg->pcg_objects[i]);

}

skip_cache:

pr_enter_check(pp, pr);

}

int

pool_chk(struct pool *pp, const char *label)

pool_chk(pp, label)

struct pool *pp;

char *label;

{

struct pool_item_header *ph;

int r = 0;

Line 1532 out:

Line 1530 out:

simple_unlock(&pp->pr_slock);

return (r);

}

* pool_cache_init:

* Initialize a pool cache.

* NOTE: If the pool must be protected from interrupts, we expect

* to be called at the appropriate interrupt priority level.

void

pool_cache_init(struct pool_cache *pc, struct pool *pp,

int (*ctor)(void *, void *, int),

void (*dtor)(void *, void *),

void *arg)

{

TAILQ_INIT(&pc->pc_grouplist);

simple_lock_init(&pc->pc_slock);

pc->pc_allocfrom = NULL;

pc->pc_freeto = NULL;

pc->pc_pool = pp;

pc->pc_ctor = ctor;

pc->pc_dtor = dtor;

pc->pc_arg = arg;

pc->pc_hits = 0;

pc->pc_misses = 0;

pc->pc_ngroups = 0;

pc->pc_nitems = 0;

simple_lock(&pp->pr_slock);

TAILQ_INSERT_TAIL(&pp->pr_cachelist, pc, pc_poollist);

simple_unlock(&pp->pr_slock);

}

* pool_cache_destroy:

* Destroy a pool cache.

void

pool_cache_destroy(struct pool_cache *pc)

{

struct pool *pp = pc->pc_pool;

/* First, invalidate the entire cache. */

pool_cache_invalidate(pc);

/* ...and remove it from the pool's cache list. */

simple_lock(&pp->pr_slock);

TAILQ_REMOVE(&pp->pr_cachelist, pc, pc_poollist);

simple_unlock(&pp->pr_slock);

}

static __inline void *

pcg_get(struct pool_cache_group *pcg)

{

void *object;

u_int idx;

KASSERT(pcg->pcg_avail <= PCG_NOBJECTS);

KASSERT(pcg->pcg_avail != 0);

idx = --pcg->pcg_avail;

KASSERT(pcg->pcg_objects[idx] != NULL);

object = pcg->pcg_objects[idx];

pcg->pcg_objects[idx] = NULL;

return (object);

}

static __inline void

pcg_put(struct pool_cache_group *pcg, void *object)

{

u_int idx;

KASSERT(pcg->pcg_avail < PCG_NOBJECTS);

idx = pcg->pcg_avail++;

KASSERT(pcg->pcg_objects[idx] == NULL);

pcg->pcg_objects[idx] = object;

}

* pool_cache_get:

* Get an object from a pool cache.

void *

pool_cache_get(struct pool_cache *pc, int flags)

{

struct pool_cache_group *pcg;

void *object;

simple_lock(&pc->pc_slock);

if ((pcg = pc->pc_allocfrom) == NULL) {

for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL;

pcg = TAILQ_NEXT(pcg, pcg_list)) {

if (pcg->pcg_avail != 0) {

pc->pc_allocfrom = pcg;

goto have_group;

}

* No groups with any available objects. Allocate

* a new object, construct it, and return it to

* the caller. We will allocate a group, if necessary,

* when the object is freed back to the cache.

pc->pc_misses++;

simple_unlock(&pc->pc_slock);

object = pool_get(pc->pc_pool, flags);

if (object != NULL && pc->pc_ctor != NULL) {

if ((*pc->pc_ctor)(pc->pc_arg, object, flags) != 0) {

pool_put(pc->pc_pool, object);

return (NULL);

}

return (object);

}

have_group:

pc->pc_hits++;

pc->pc_nitems--;

object = pcg_get(pcg);

if (pcg->pcg_avail == 0)

pc->pc_allocfrom = NULL;

simple_unlock(&pc->pc_slock);

return (object);

}

* pool_cache_put:

* Put an object back to the pool cache.

void

pool_cache_put(struct pool_cache *pc, void *object)

{

struct pool_cache_group *pcg;

simple_lock(&pc->pc_slock);

if ((pcg = pc->pc_freeto) == NULL) {

for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL;

pcg = TAILQ_NEXT(pcg, pcg_list)) {

if (pcg->pcg_avail != PCG_NOBJECTS) {

pc->pc_freeto = pcg;

goto have_group;

}

* No empty groups to free the object to. Attempt to

* allocate one.

simple_unlock(&pc->pc_slock);

pcg = pool_get(&pcgpool, PR_NOWAIT);

if (pcg != NULL) {

memset(pcg, 0, sizeof(*pcg));

simple_lock(&pc->pc_slock);

pc->pc_ngroups++;

TAILQ_INSERT_TAIL(&pc->pc_grouplist, pcg, pcg_list);

if (pc->pc_freeto == NULL)

pc->pc_freeto = pcg;

goto have_group;

}

* Unable to allocate a cache group; destruct the object

* and free it back to the pool.

if (pc->pc_dtor != NULL)

(*pc->pc_dtor)(pc->pc_arg, object);

pool_put(pc->pc_pool, object);

return;

}

have_group:

pc->pc_nitems++;

pcg_put(pcg, object);

if (pcg->pcg_avail == PCG_NOBJECTS)

pc->pc_freeto = NULL;

simple_unlock(&pc->pc_slock);

}

* pool_cache_do_invalidate:

* This internal function implements pool_cache_invalidate() and

* pool_cache_reclaim().

static void

pool_cache_do_invalidate(struct pool_cache *pc, int free_groups,

void (*putit)(struct pool *, void *, const char *, long))

{

struct pool_cache_group *pcg, *npcg;

void *object;

for (pcg = TAILQ_FIRST(&pc->pc_grouplist); pcg != NULL;

pcg = npcg) {

npcg = TAILQ_NEXT(pcg, pcg_list);

while (pcg->pcg_avail != 0) {

pc->pc_nitems--;

object = pcg_get(pcg);

if (pcg->pcg_avail == 0 && pc->pc_allocfrom == pcg)

pc->pc_allocfrom = NULL;

if (pc->pc_dtor != NULL)

(*pc->pc_dtor)(pc->pc_arg, object);

(*putit)(pc->pc_pool, object, __FILE__, __LINE__);

}

if (free_groups) {

pc->pc_ngroups--;

TAILQ_REMOVE(&pc->pc_grouplist, pcg, pcg_list);

if (pc->pc_freeto == pcg)

pc->pc_freeto = NULL;

pool_put(&pcgpool, pcg);

}

* pool_cache_invalidate:

* Invalidate a pool cache (destruct and release all of the

* cached objects).

void

pool_cache_invalidate(struct pool_cache *pc)

{

simple_lock(&pc->pc_slock);

pool_cache_do_invalidate(pc, 0, _pool_put);

simple_unlock(&pc->pc_slock);

}

* pool_cache_reclaim:

* Reclaim a pool cache for pool_reclaim().

static void

pool_cache_reclaim(struct pool_cache *pc)

{

simple_lock(&pc->pc_slock);

pool_cache_do_invalidate(pc, 1, pool_do_put);

simple_unlock(&pc->pc_slock);

}

CVSweb <webmaster@jp.NetBSD.org>