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.24 and 1.25

version 1.24, 1999/04/29 17:47:19

version 1.25, 1999/05/10 21:13:05

Line 37

* POSSIBILITY OF SUCH DAMAGE.

#include "opt_pool.h"

#include "opt_poollog.h"

#include <sys/param.h>

Line 95 struct pool_item_header {

Line 96 struct pool_item_header {

struct pool_item {

#ifdef DIAGNOSTIC

int pi_magic;

#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))

Line 115 static void pool_prime_page __P((struct

Line 116 static void pool_prime_page __P((struct

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

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

#if defined(POOL_DIAGNOSTIC) || defined(DEBUG)

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

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

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

#endif

#ifdef POOL_DIAGNOSTIC

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

Line 127 struct pool_log {

Line 126 struct pool_log {

const char *pl_file;

long pl_line;

int pl_action;

#define PRLOG_GET 1

#define PRLOG_PUT 2

void *pl_addr;

};

Line 139 struct pool_log {

Line 138 struct pool_log {

int pool_logsize = POOL_LOGSIZE;

#ifdef DIAGNOSTIC

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

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

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)

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

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

}

static void

pr_printlog(pp)

pr_printlog(pp, pi, pr)

struct pool *pp;

struct pool_item *pi;

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

{

int i = pp->pr_logsize;

int n = pp->pr_curlogentry;

Line 180 pr_printlog(pp)

Line 187 pr_printlog(pp)

if ((pp->pr_roflags & PR_LOGGING) == 0)

return;

pool_print1(pp, "printlog");

* Print all entries in this pool's log.

while (i-- > 0) {

struct pool_log *pl = &pp->pr_log[n];

if (pl->pl_action != 0) {

printf("log entry %d:\n", i);

if (pi == NULL || pi == pl->pl_addr) {

printf("\taction = %s, addr = %p\n",

(*pr)("\tlog entry %d:\n", i);

pl->pl_action == PRLOG_GET ? "get" : "put",

(*pr)("\t\taction = %s, addr = %p\n",

pl->pl_addr);

pl->pl_action == PRLOG_GET ? "get" : "put",

printf("\tfile: %s at line %lu\n",

pl->pl_addr);

pl->pl_file, pl->pl_line);

(*pr)("\t\tfile: %s at line %lu\n",

pl->pl_file, pl->pl_line);

}

if (++n >= pp->pr_logsize)

n = 0;

}

#else

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

#define pr_printlog(pp)

#endif

static __inline__ void

pr_enter(pp, file, line)

struct pool *pp;

const char *file;

long line;

{

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",

pp->pr_entered_file, pp->pr_entered_line);

panic("pr_enter");

}

pp->pr_entered_file = file;

pp->pr_entered_line = line;

}

static __inline__ void

pr_leave(pp)

struct pool *pp;

{

if (pp->pr_entered_file == NULL) {

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

panic("pr_leave");

}

pp->pr_entered_file = NULL;

pp->pr_entered_line = 0;

}

static __inline__ void

pr_enter_check(pp, pr)

struct pool *pp;

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

{

if (pp->pr_entered_file != NULL)

(*pr)("\n\tcurrently entered from file %s line %ld\n",

pp->pr_entered_file, pp->pr_entered_line);

}

#else

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

#define pr_printlog(pp, pi, pr)

#define pr_enter(pp, file, line)

#define pr_leave(pp)

#define pr_enter_check(pp, pr)

#endif /* DIAGNOSTIC */

* Return the pool page header based on page address.

Line 302 pool_create(size, align, ioff, nitems, w

Line 355 pool_create(size, align, ioff, nitems, w

return (NULL);

flags = PR_FREEHEADER;

#ifdef POOL_DIAGNOSTIC

if (pool_logsize != 0)

flags |= PR_LOGGING;

#endif

pool_init(pp, size, align, ioff, flags, wchan, pagesz,

alloc, release, mtype);

Line 341 pool_init(pp, size, align, ioff, flags,

Line 389 pool_init(pp, size, align, ioff, flags,

{

int off, slack, i;

#ifdef POOL_DIAGNOSTIC

* Always log if POOL_DIAGNOSTIC is defined.

if (pool_logsize != 0)

flags |= PR_LOGGING;

#endif

* Check arguments and construct default values.

Line 440 pool_init(pp, size, align, ioff, flags,

Line 496 pool_init(pp, size, align, ioff, flags,

pp->pr_hiwat = 0;

pp->pr_nidle = 0;

#ifdef POOL_DIAGNOSTIC

if (flags & PR_LOGGING) {

if ((flags & PR_LOGGING) != 0) {

if (kmem_map == NULL ||

pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log),

(pp->pr_log = malloc(pool_logsize * sizeof(struct pool_log),

M_TEMP, M_NOWAIT);

M_TEMP, M_NOWAIT)) == NULL)

if (pp->pr_log == NULL)

pp->pr_roflags &= ~PR_LOGGING;

pp->pr_curlogentry = 0;

pp->pr_logsize = pool_logsize;

}

#endif

pp->pr_entered_file = NULL;

pp->pr_entered_line = 0;

simple_lock_init(&pp->pr_slock);

Line 479 pool_destroy(pp)

Line 536 pool_destroy(pp)

#ifdef DIAGNOSTIC

if (pp->pr_nout != 0) {

pr_printlog(pp);

pr_printlog(pp, NULL, printf);

panic("pool_destroy: pool busy: still out: %u\n",

pp->pr_nout);

}

Line 497 pool_destroy(pp)

Line 554 pool_destroy(pp)

drainpp = NULL;

simple_unlock(&pool_head_slock);

#ifdef POOL_DIAGNOSTIC

if ((pp->pr_roflags & PR_LOGGING) != 0)

free(pp->pr_log, M_TEMP);

#endif

if (pp->pr_roflags & PR_FREEHEADER)

free(pp, M_POOL);

Line 510 pool_destroy(pp)

Line 565 pool_destroy(pp)

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

#ifdef POOL_DIAGNOSTIC

void *

_pool_get(pp, flags, file, line)

struct pool *pp;

int flags;

const char *file;

long line;

#else

void *

pool_get(pp, flags)

struct pool *pp;

int flags;

#endif

{

void *v;

struct pool_item *pi;

Line 530 pool_get(pp, flags)

Line 578 pool_get(pp, flags)

#ifdef DIAGNOSTIC

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

pr_printlog(pp);

pr_printlog(pp, NULL, printf);

panic("pool_get: static");

}

#endif

Line 539 pool_get(pp, flags)

Line 587 pool_get(pp, flags)

panic("pool_get: must have NOWAIT");

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

startover:

Line 548 pool_get(pp, flags)

Line 597 pool_get(pp, flags)

#ifdef DIAGNOSTIC

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);

}

Line 559 pool_get(pp, flags)

Line 609 pool_get(pp, flags)

* it be?

pp->pr_flags |= PR_WANTED;

pr_leave(pp);

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;

}

if (pp->pr_hardlimit_warning != NULL) {

Line 585 pool_get(pp, flags)

Line 637 pool_get(pp, flags)

pp->pr_nfail++;

pr_leave(pp);

simple_unlock(&pp->pr_slock);

return (NULL);

}

Line 612 pool_get(pp, flags)

Line 665 pool_get(pp, flags)

* Release the pool lock, as the back-end page allocator

* may block.

pr_leave(pp);

simple_unlock(&pp->pr_slock);

v = (*pp->pr_alloc)(pp->pr_pagesz, flags, pp->pr_mtype);

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

if (v == NULL) {

Line 631 pool_get(pp, flags)

Line 686 pool_get(pp, flags)

if ((flags & PR_WAITOK) == 0) {

pp->pr_nfail++;

pr_leave(pp);

simple_unlock(&pp->pr_slock);

return (NULL);

}

Line 647 pool_get(pp, flags)

Line 703 pool_get(pp, flags)

* try again?

pp->pr_flags |= PR_WANTED;

pr_leave(pp);

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 662 pool_get(pp, flags)

Line 720 pool_get(pp, flags)

}

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 (pp->pr_nitems == 0) {

pr_leave(pp);

simple_unlock(&pp->pr_slock);

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

pp->pr_wchan, pp->pr_nitems);

Line 677 pool_get(pp, flags)

Line 737 pool_get(pp, flags)

#ifdef DIAGNOSTIC

if (pi->pi_magic != PI_MAGIC) {

pr_printlog(pp);

pr_printlog(pp, pi, printf);

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

" item addr %p\n",

pp->pr_wchan, pi->pi_magic, ph->ph_page, pi);

Line 701 pool_get(pp, flags)

Line 761 pool_get(pp, flags)

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

#ifdef DIAGNOSTIC

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

pr_leave(pp);

simple_unlock(&pp->pr_slock);

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

pp->pr_wchan);

Line 741 pool_get(pp, flags)

Line 802 pool_get(pp, flags)

}

pr_leave(pp);

simple_unlock(&pp->pr_slock);

return (v);

}

Line 748 pool_get(pp, flags)

Line 810 pool_get(pp, flags)

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

#ifdef POOL_DIAGNOSTIC

void

_pool_put(pp, v, file, line)

struct pool *pp;

void *v;

const char *file;

long line;

#else

void

pool_put(pp, v)

struct pool *pp;

void *v;

#endif

{

struct pool_item *pi = v;

struct pool_item_header *ph;

Line 770 pool_put(pp, v)

Line 825 pool_put(pp, v)

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

simple_lock(&pp->pr_slock);

pr_enter(pp, file, line);

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

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

pr_printlog(pp);

pr_printlog(pp, NULL, printf);

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

}

Line 782 pool_put(pp, v)

Line 838 pool_put(pp, v)

* Return to item list.

#ifdef DIAGNOSTIC

/* XXX Should fill the item. */

pi->pi_magic = PI_MAGIC;

#endif

TAILQ_INSERT_HEAD(&ph->ph_itemlist, pi, pi_list);

Line 798 pool_put(pp, v)

Line 855 pool_put(pp, v)

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 863 pool_put(pp, v)

Line 921 pool_put(pp, v)

pp->pr_curpage = ph;

}

pr_leave(pp);

simple_unlock(&pp->pr_slock);

}

Line 1170 pool_page_free_nointr(v, sz, mtype)

Line 1229 pool_page_free_nointr(v, sz, mtype)

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

void

pool_reclaim(pp)

_pool_reclaim(pp, file, line)

pool_handle_t pp;

const char *file;

long line;

{

struct pool_item_header *ph, *phnext;

struct timeval curtime;

Line 1182 pool_reclaim(pp)

Line 1243 pool_reclaim(pp)

if (simple_lock_try(&pp->pr_slock) == 0)

return;

pr_enter(pp, file, line);

s = splclock();

curtime = mono_time;

Line 1212 pool_reclaim(pp)

Line 1274 pool_reclaim(pp)

}

pr_leave(pp);

simple_unlock(&pp->pr_slock);

}

Line 1245 pool_drain(arg)

Line 1308 pool_drain(arg)

}

#if defined(POOL_DIAGNOSTIC) || defined(DEBUG)

* Diagnostic helpers.

void

pool_print(pp, label)

pool_print(pp, modif)

struct pool *pp;

const char *label;

const char *modif;

{

int s;

s = splimp();

simple_lock(&pp->pr_slock);

if (simple_lock_try(&pp->pr_slock) == 0) {

pool_print1(pp, label);

printf("pool %s is locked; try again later\n",

pp->pr_wchan);

splx(s);

return;

}

pool_print1(pp, modif, printf);

simple_unlock(&pp->pr_slock);

splx(s);

}

void

pool_printit(pp, modif, pr)

struct pool *pp;

const char *modif;

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

{

int didlock = 0;

if (pp == NULL) {

(*pr)("Must specify a pool to print.\n");

return;

}

* Called from DDB; interrupts should be blocked, and all

* other processors should be paused. We can skip locking

* the pool in this case.

* We do a simple_lock_try() just to print the lock

* status, however.

if (simple_lock_try(&pp->pr_slock) == 0)

(*pr)("WARNING: pool %s is locked\n", pp->pr_wchan);

else

didlock = 1;

pool_print1(pp, modif, pr);

if (didlock)

simple_unlock(&pp->pr_slock);

}

static void

pool_print1(pp, label)

pool_print1(pp, modif, pr)

struct pool *pp;

const char *label;

const char *modif;

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

{

struct pool_item_header *ph;

#ifdef DIAGNOSTIC

struct pool_item *pi;

#endif

int print_log = 0, print_pagelist = 0;

char c;

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

if (c == 'l')

print_log = 1;

if (c == 'p')

print_pagelist = 1;

modif++;

}

(*pr)("POOL %s: size %u, align %u, ioff %u, roflags 0x%08x\n",

pp->pr_wchan, pp->pr_size, pp->pr_align, pp->pr_itemoffset,

pp->pr_roflags);

(*pr)("\tpagesz %u, mtype %d\n", pp->pr_pagesz, pp->pr_mtype);

(*pr)("\talloc %p, release %p\n", pp->pr_alloc, pp->pr_free);

(*pr)("\tminitems %u, minpages %u, maxpages %u, npages %u\n",

pp->pr_minitems, pp->pr_minpages, pp->pr_maxpages, pp->pr_npages);

(*pr)("\titemsperpage %u, nitems %u, nout %u, hardlimit %u\n",

pp->pr_itemsperpage, pp->pr_nitems, pp->pr_nout, pp->pr_hardlimit);

(*pr)("\n\tnget %lu, nfail %lu, nput %lu\n",

pp->pr_nget, pp->pr_nfail, pp->pr_nput);

(*pr)("\tnpagealloc %lu, npagefree %lu, hiwat %u, nidle %lu\n",

pp->pr_npagealloc, pp->pr_npagefree, pp->pr_hiwat, pp->pr_nidle);

if (print_pagelist == 0)

goto skip_pagelist;

if ((ph = TAILQ_FIRST(&pp->pr_pagelist)) != NULL)

(*pr)("\n\tpage list:\n");

for (; ph != NULL; ph = TAILQ_NEXT(ph, ph_pagelist)) {

(*pr)("\t\tpage %p, nmissing %d, time %lu,%lu\n",

ph->ph_page, ph->ph_nmissing,

(u_long)ph->ph_time.tv_sec,

(u_long)ph->ph_time.tv_usec);

#ifdef DIAGNOSTIC

for (pi = TAILQ_FIRST(&ph->ph_itemlist); pi != NULL;

pi = TAILQ_NEXT(pi, pi_list)) {

if (pi->pi_magic != PI_MAGIC) {

(*pr)("\t\t\titem %p, magic 0x%x\n",

pi, pi->pi_magic);

}

#endif

}

if (pp->pr_curpage == NULL)

(*pr)("\tno current page\n");

else

(*pr)("\tcurpage %p\n", pp->pr_curpage->ph_page);

skip_pagelist:

if (print_log == 0)

goto skip_log;

(*pr)("\n");

if ((pp->pr_roflags & PR_LOGGING) == 0)

(*pr)("\tno log\n");

else

pr_printlog(pp, NULL, pr);

if (label != NULL)

skip_log:

printf("%s: ", label);

printf("pool %s: nalloc %lu nfree %lu npagealloc %lu npagefree %lu\n"

pr_enter_check(pp, pr);

" npages %u minitems %u itemsperpage %u itemoffset %u\n"

" nidle %lu\n",

pp->pr_wchan,

pp->pr_nget,

pp->pr_nput,

pp->pr_npagealloc,

pp->pr_npagefree,

pp->pr_npages,

pp->pr_minitems,

pp->pr_itemsperpage,

pp->pr_itemoffset,

pp->pr_nidle);

}

int

Line 1351 out:

Line 1504 out:

simple_unlock(&pp->pr_slock);

return (r);

}

#endif /* POOL_DIAGNOSTIC || DEBUG */

CVSweb <webmaster@jp.NetBSD.org>