pool_page_header
pool_p_insert(struct pool *pp, struct pool_page_header *ph)
pool_p_remove(struct pool *pp, struct pool_page_header *ph)
struct pool_page_header *ph, *phnext;
struct pool_page_header *ph;
struct pool_page_header *ph;
pool_chk_page(struct pool *pp, struct pool_page_header *ph, int expected)
struct pool_page_header *ph;
TAILQ_ENTRY(pool_page_header)
struct pool_page_header *ph;
RBT_ENTRY(pool_page_header)
struct pool_page_header *ph, *freeph;
struct pool_page_header *
void pool_p_insert(struct pool *, struct pool_page_header *);
void pool_p_remove(struct pool *, struct pool_page_header *);
void pool_p_free(struct pool *, struct pool_page_header *);
int pool_chk_page(struct pool *, struct pool_page_header *, int);
RBT_PROTOTYPE(phtree, pool_page_header, ph_node, phtree_compare);
phtree_compare(const struct pool_page_header *a,
const struct pool_page_header *b)
RBT_GENERATE(phtree, pool_page_header, ph_node, phtree_compare);
static inline struct pool_page_header *
struct pool_page_header *ph, key;
return ((struct pool_page_header *)(page + pp->pr_phoffset));
sizeof(struct pool_page_header)) {
off = pgsize - sizeof(struct pool_page_header);
} else if (sizeof(struct pool_page_header) * 2 >= size) {
off = pgsize - sizeof(struct pool_page_header);
pool_init(&phpool, sizeof(struct pool_page_header), 0,
struct pool_page_header *ph;
struct pool_page_header *ph;
struct pool_page_header *ph, *freeph = NULL;
struct pool_page_header *ph;
struct pool_page_header *ph;
struct pool_page_header *
struct pool_page_header *ph;
ph = (struct pool_page_header *)(addr + pp->pr_phoffset);
pool_p_free(struct pool *pp, struct pool_page_header *ph)
TAILQ_HEAD(pool_pagelist, pool_page_header);
struct pool_page_header *
RBT_HEAD(phtree, pool_page_header)