mirror of
https://github.com/simon987/sist2.git
synced 2025-04-10 14:06:45 +00:00
757 lines
21 KiB
C
757 lines
21 KiB
C
#include "mempool.h"
|
|
#include <unistd.h>
|
|
|
|
#define NCX_SLAB_PAGE_MASK 3
|
|
#define NCX_SLAB_PAGE 0
|
|
#define NCX_SLAB_BIG 1
|
|
#define NCX_SLAB_EXACT 2
|
|
#define NCX_SLAB_SMALL 3
|
|
|
|
#define NCX_SLAB_PAGE_FREE 0
|
|
#define NCX_SLAB_PAGE_BUSY 0xffffffffffffffff
|
|
#define NCX_SLAB_PAGE_START 0x8000000000000000
|
|
|
|
#define NCX_SLAB_SHIFT_MASK 0x000000000000000f
|
|
#define NCX_SLAB_MAP_MASK 0xffffffff00000000
|
|
#define NCX_SLAB_MAP_SHIFT 32
|
|
|
|
#define NCX_SLAB_BUSY 0xffffffffffffffff
|
|
|
|
|
|
static ncx_slab_page_t *ncx_slab_alloc_pages(ncx_slab_pool_t *pool, ncx_uint_t pages);
|
|
|
|
static void ncx_slab_free_pages(ncx_slab_pool_t *pool, ncx_slab_page_t *page, ncx_uint_t pages);
|
|
|
|
static bool ncx_slab_empty(ncx_slab_pool_t *pool, ncx_slab_page_t *page);
|
|
|
|
static ncx_uint_t ncx_slab_max_size;
|
|
static ncx_uint_t ncx_slab_exact_size;
|
|
static ncx_uint_t ncx_slab_exact_shift;
|
|
static ncx_uint_t ncx_pagesize;
|
|
static ncx_uint_t ncx_pagesize_shift;
|
|
static ncx_uint_t ncx_real_pages;
|
|
|
|
void ncx_slab_init(ncx_slab_pool_t *pool) {
|
|
u_char *p;
|
|
size_t size;
|
|
ncx_uint_t i, n, pages;
|
|
ncx_slab_page_t *slots;
|
|
|
|
/*pagesize*/
|
|
ncx_pagesize = getpagesize();
|
|
for (n = ncx_pagesize, ncx_pagesize_shift = 0;
|
|
n >>= 1; ncx_pagesize_shift++) { /* void */ }
|
|
|
|
/* STUB */
|
|
if (ncx_slab_max_size == 0) {
|
|
ncx_slab_max_size = ncx_pagesize / 2;
|
|
ncx_slab_exact_size = ncx_pagesize / (8 * sizeof(uintptr_t));
|
|
for (n = ncx_slab_exact_size; n >>= 1; ncx_slab_exact_shift++) {
|
|
/* void */
|
|
}
|
|
}
|
|
|
|
pool->min_size = 1 << pool->min_shift;
|
|
|
|
p = (u_char *) pool + sizeof(ncx_slab_pool_t);
|
|
slots = (ncx_slab_page_t *) p;
|
|
|
|
n = ncx_pagesize_shift - pool->min_shift;
|
|
for (i = 0; i < n; i++) {
|
|
slots[i].slab = 0;
|
|
slots[i].next = &slots[i];
|
|
slots[i].prev = 0;
|
|
}
|
|
|
|
p += n * sizeof(ncx_slab_page_t);
|
|
|
|
size = pool->end - p;
|
|
|
|
pages = (ncx_uint_t) (size / (ncx_pagesize + sizeof(ncx_slab_page_t)));
|
|
|
|
ncx_memzero(p, pages * sizeof(ncx_slab_page_t));
|
|
|
|
pool->pages = (ncx_slab_page_t *) p;
|
|
|
|
pool->free.prev = 0;
|
|
pool->free.next = (ncx_slab_page_t *) p;
|
|
|
|
pool->pages->slab = pages;
|
|
pool->pages->next = &pool->free;
|
|
pool->pages->prev = (uintptr_t) &pool->free;
|
|
|
|
pool->start = (u_char *)
|
|
ncx_align_ptr((uintptr_t) p + pages * sizeof(ncx_slab_page_t),
|
|
ncx_pagesize);
|
|
|
|
ncx_real_pages = (pool->end - pool->start) / ncx_pagesize;
|
|
pool->pages->slab = ncx_real_pages;
|
|
}
|
|
|
|
|
|
void *ncx_slab_alloc(ncx_slab_pool_t *pool, size_t size) {
|
|
size_t s;
|
|
uintptr_t p, n, m, mask, *bitmap;
|
|
ncx_uint_t i, slot, shift, map;
|
|
ncx_slab_page_t *page, *prev, *slots;
|
|
|
|
if (size >= ncx_slab_max_size) {
|
|
|
|
page = ncx_slab_alloc_pages(pool, (size >> ncx_pagesize_shift)
|
|
+ ((size % ncx_pagesize) ? 1 : 0));
|
|
if (page) {
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
} else {
|
|
p = 0;
|
|
}
|
|
|
|
goto done;
|
|
}
|
|
|
|
if (size > pool->min_size) {
|
|
shift = 1;
|
|
for (s = size - 1; s >>= 1; shift++) { /* void */ }
|
|
slot = shift - pool->min_shift;
|
|
|
|
} else {
|
|
shift = pool->min_shift;
|
|
slot = 0;
|
|
}
|
|
|
|
slots = (ncx_slab_page_t *) ((u_char *) pool + sizeof(ncx_slab_pool_t));
|
|
page = slots[slot].next;
|
|
|
|
if (page->next != page) {
|
|
|
|
if (shift < ncx_slab_exact_shift) {
|
|
|
|
do {
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
bitmap = (uintptr_t *) (pool->start + p);
|
|
|
|
map = (1 << (ncx_pagesize_shift - shift))
|
|
/ (sizeof(uintptr_t) * 8);
|
|
|
|
for (n = 0; n < map; n++) {
|
|
|
|
if (bitmap[n] != NCX_SLAB_BUSY) {
|
|
|
|
for (m = 1, i = 0; m; m <<= 1, i++) {
|
|
if ((bitmap[n] & m)) {
|
|
continue;
|
|
}
|
|
|
|
bitmap[n] |= m;
|
|
|
|
i = ((n * sizeof(uintptr_t) * 8) << shift)
|
|
+ (i << shift);
|
|
|
|
if (bitmap[n] == NCX_SLAB_BUSY) {
|
|
for (n = n + 1; n < map; n++) {
|
|
if (bitmap[n] != NCX_SLAB_BUSY) {
|
|
p = (uintptr_t) bitmap + i;
|
|
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
prev = (ncx_slab_page_t *)
|
|
(page->prev & ~NCX_SLAB_PAGE_MASK);
|
|
prev->next = page->next;
|
|
page->next->prev = page->prev;
|
|
|
|
page->next = NULL;
|
|
page->prev = NCX_SLAB_SMALL;
|
|
}
|
|
|
|
p = (uintptr_t) bitmap + i;
|
|
|
|
goto done;
|
|
}
|
|
}
|
|
}
|
|
|
|
page = page->next;
|
|
|
|
} while (page);
|
|
|
|
} else if (shift == ncx_slab_exact_shift) {
|
|
|
|
do {
|
|
if (page->slab != NCX_SLAB_BUSY) {
|
|
|
|
for (m = 1, i = 0; m; m <<= 1, i++) {
|
|
if ((page->slab & m)) {
|
|
continue;
|
|
}
|
|
|
|
page->slab |= m;
|
|
|
|
if (page->slab == NCX_SLAB_BUSY) {
|
|
prev = (ncx_slab_page_t *)
|
|
(page->prev & ~NCX_SLAB_PAGE_MASK);
|
|
prev->next = page->next;
|
|
page->next->prev = page->prev;
|
|
|
|
page->next = NULL;
|
|
page->prev = NCX_SLAB_EXACT;
|
|
}
|
|
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
p += i << shift;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
page = page->next;
|
|
|
|
} while (page);
|
|
|
|
} else { /* shift > ncx_slab_exact_shift */
|
|
|
|
n = ncx_pagesize_shift - (page->slab & NCX_SLAB_SHIFT_MASK);
|
|
n = 1 << n;
|
|
n = ((uintptr_t) 1 << n) - 1;
|
|
mask = n << NCX_SLAB_MAP_SHIFT;
|
|
|
|
do {
|
|
if ((page->slab & NCX_SLAB_MAP_MASK) != mask) {
|
|
|
|
for (m = (uintptr_t) 1 << NCX_SLAB_MAP_SHIFT, i = 0;
|
|
m & mask;
|
|
m <<= 1, i++) {
|
|
if ((page->slab & m)) {
|
|
continue;
|
|
}
|
|
|
|
page->slab |= m;
|
|
|
|
if ((page->slab & NCX_SLAB_MAP_MASK) == mask) {
|
|
prev = (ncx_slab_page_t *)
|
|
(page->prev & ~NCX_SLAB_PAGE_MASK);
|
|
prev->next = page->next;
|
|
page->next->prev = page->prev;
|
|
|
|
page->next = NULL;
|
|
page->prev = NCX_SLAB_BIG;
|
|
}
|
|
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
p += i << shift;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
page = page->next;
|
|
|
|
} while (page);
|
|
}
|
|
}
|
|
|
|
page = ncx_slab_alloc_pages(pool, 1);
|
|
|
|
if (page) {
|
|
if (shift < ncx_slab_exact_shift) {
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
bitmap = (uintptr_t *) (pool->start + p);
|
|
|
|
s = 1 << shift;
|
|
n = (1 << (ncx_pagesize_shift - shift)) / 8 / s;
|
|
|
|
if (n == 0) {
|
|
n = 1;
|
|
}
|
|
|
|
bitmap[0] = (2 << n) - 1;
|
|
|
|
map = (1 << (ncx_pagesize_shift - shift)) / (sizeof(uintptr_t) * 8);
|
|
|
|
for (i = 1; i < map; i++) {
|
|
bitmap[i] = 0;
|
|
}
|
|
|
|
page->slab = shift;
|
|
page->next = &slots[slot];
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_SMALL;
|
|
|
|
slots[slot].next = page;
|
|
|
|
p = ((page - pool->pages) << ncx_pagesize_shift) + s * n;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
goto done;
|
|
|
|
} else if (shift == ncx_slab_exact_shift) {
|
|
|
|
page->slab = 1;
|
|
page->next = &slots[slot];
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_EXACT;
|
|
|
|
slots[slot].next = page;
|
|
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
goto done;
|
|
|
|
} else { /* shift > ncx_slab_exact_shift */
|
|
|
|
page->slab = ((uintptr_t) 1 << NCX_SLAB_MAP_SHIFT) | shift;
|
|
page->next = &slots[slot];
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_BIG;
|
|
|
|
slots[slot].next = page;
|
|
|
|
p = (page - pool->pages) << ncx_pagesize_shift;
|
|
p += (uintptr_t) pool->start;
|
|
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
p = 0;
|
|
|
|
done:
|
|
|
|
return (void *) p;
|
|
}
|
|
|
|
|
|
void ncx_slab_free(ncx_slab_pool_t *pool, void *p) {
|
|
size_t size;
|
|
uintptr_t slab, m, *bitmap;
|
|
ncx_uint_t n, type, slot, shift, map;
|
|
ncx_slab_page_t *slots, *page;
|
|
|
|
if ((u_char *) p < pool->start || (u_char *) p > pool->end) {
|
|
// error("ncx_slab_free(): outside of pool");
|
|
goto fail;
|
|
}
|
|
|
|
n = ((u_char *) p - pool->start) >> ncx_pagesize_shift;
|
|
page = &pool->pages[n];
|
|
slab = page->slab;
|
|
type = page->prev & NCX_SLAB_PAGE_MASK;
|
|
|
|
switch (type) {
|
|
|
|
case NCX_SLAB_SMALL:
|
|
|
|
shift = slab & NCX_SLAB_SHIFT_MASK;
|
|
size = 1 << shift;
|
|
|
|
if ((uintptr_t) p & (size - 1)) {
|
|
goto wrong_chunk;
|
|
}
|
|
|
|
n = ((uintptr_t) p & (ncx_pagesize - 1)) >> shift;
|
|
m = (uintptr_t) 1 << (n & (sizeof(uintptr_t) * 8 - 1));
|
|
n /= (sizeof(uintptr_t) * 8);
|
|
bitmap = (uintptr_t *) ((uintptr_t) p & ~(ncx_pagesize - 1));
|
|
|
|
if (bitmap[n] & m) {
|
|
|
|
if (page->next == NULL) {
|
|
slots = (ncx_slab_page_t *)
|
|
((u_char *) pool + sizeof(ncx_slab_pool_t));
|
|
slot = shift - pool->min_shift;
|
|
|
|
page->next = slots[slot].next;
|
|
slots[slot].next = page;
|
|
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_SMALL;
|
|
page->next->prev = (uintptr_t) page | NCX_SLAB_SMALL;
|
|
}
|
|
|
|
bitmap[n] &= ~m;
|
|
|
|
n = (1 << (ncx_pagesize_shift - shift)) / 8 / (1 << shift);
|
|
|
|
if (n == 0) {
|
|
n = 1;
|
|
}
|
|
|
|
if (bitmap[0] & ~(((uintptr_t) 1 << n) - 1)) {
|
|
goto done;
|
|
}
|
|
|
|
map = (1 << (ncx_pagesize_shift - shift)) / (sizeof(uintptr_t) * 8);
|
|
|
|
for (n = 1; n < map; n++) {
|
|
if (bitmap[n]) {
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
ncx_slab_free_pages(pool, page, 1);
|
|
|
|
goto done;
|
|
}
|
|
|
|
goto chunk_already_free;
|
|
|
|
case NCX_SLAB_EXACT:
|
|
|
|
m = (uintptr_t) 1 <<
|
|
(((uintptr_t) p & (ncx_pagesize - 1)) >> ncx_slab_exact_shift);
|
|
size = ncx_slab_exact_size;
|
|
|
|
if ((uintptr_t) p & (size - 1)) {
|
|
goto wrong_chunk;
|
|
}
|
|
|
|
if (slab & m) {
|
|
if (slab == NCX_SLAB_BUSY) {
|
|
slots = (ncx_slab_page_t *)
|
|
((u_char *) pool + sizeof(ncx_slab_pool_t));
|
|
slot = ncx_slab_exact_shift - pool->min_shift;
|
|
|
|
page->next = slots[slot].next;
|
|
slots[slot].next = page;
|
|
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_EXACT;
|
|
page->next->prev = (uintptr_t) page | NCX_SLAB_EXACT;
|
|
}
|
|
|
|
page->slab &= ~m;
|
|
|
|
if (page->slab) {
|
|
goto done;
|
|
}
|
|
|
|
ncx_slab_free_pages(pool, page, 1);
|
|
|
|
goto done;
|
|
}
|
|
|
|
goto chunk_already_free;
|
|
|
|
case NCX_SLAB_BIG:
|
|
|
|
shift = slab & NCX_SLAB_SHIFT_MASK;
|
|
size = 1 << shift;
|
|
|
|
if ((uintptr_t) p & (size - 1)) {
|
|
goto wrong_chunk;
|
|
}
|
|
|
|
m = (uintptr_t) 1 << ((((uintptr_t) p & (ncx_pagesize - 1)) >> shift)
|
|
+ NCX_SLAB_MAP_SHIFT);
|
|
|
|
if (slab & m) {
|
|
|
|
if (page->next == NULL) {
|
|
slots = (ncx_slab_page_t *)
|
|
((u_char *) pool + sizeof(ncx_slab_pool_t));
|
|
slot = shift - pool->min_shift;
|
|
|
|
page->next = slots[slot].next;
|
|
slots[slot].next = page;
|
|
|
|
page->prev = (uintptr_t) &slots[slot] | NCX_SLAB_BIG;
|
|
page->next->prev = (uintptr_t) page | NCX_SLAB_BIG;
|
|
}
|
|
|
|
page->slab &= ~m;
|
|
|
|
if (page->slab & NCX_SLAB_MAP_MASK) {
|
|
goto done;
|
|
}
|
|
|
|
ncx_slab_free_pages(pool, page, 1);
|
|
|
|
goto done;
|
|
}
|
|
|
|
goto chunk_already_free;
|
|
|
|
case NCX_SLAB_PAGE:
|
|
|
|
if ((uintptr_t) p & (ncx_pagesize - 1)) {
|
|
goto wrong_chunk;
|
|
}
|
|
|
|
if (slab == NCX_SLAB_PAGE_FREE) {
|
|
// alert("ncx_slab_free(): page is already free");
|
|
goto fail;
|
|
}
|
|
|
|
if (slab == NCX_SLAB_PAGE_BUSY) {
|
|
// alert("ncx_slab_free(): pointer to wrong page");
|
|
goto fail;
|
|
}
|
|
|
|
n = ((u_char *) p - pool->start) >> ncx_pagesize_shift;
|
|
size = slab & ~NCX_SLAB_PAGE_START;
|
|
|
|
ncx_slab_free_pages(pool, &pool->pages[n], size);
|
|
|
|
return;
|
|
}
|
|
|
|
/* not reached */
|
|
|
|
return;
|
|
|
|
done:
|
|
|
|
return;
|
|
|
|
wrong_chunk:
|
|
|
|
// error("ncx_slab_free(): pointer to wrong chunk");
|
|
|
|
goto fail;
|
|
|
|
chunk_already_free:
|
|
|
|
// error("ncx_slab_free(): chunk is already free");
|
|
|
|
fail:
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
static ncx_slab_page_t *ncx_slab_alloc_pages(ncx_slab_pool_t *pool, ncx_uint_t pages) {
|
|
ncx_slab_page_t *page, *p;
|
|
|
|
for (page = pool->free.next; page != &pool->free; page = page->next) {
|
|
|
|
if (page->slab >= pages) {
|
|
|
|
if (page->slab > pages) {
|
|
page[pages].slab = page->slab - pages;
|
|
page[pages].next = page->next;
|
|
page[pages].prev = page->prev;
|
|
|
|
p = (ncx_slab_page_t *) page->prev;
|
|
p->next = &page[pages];
|
|
page->next->prev = (uintptr_t) &page[pages];
|
|
|
|
} else {
|
|
p = (ncx_slab_page_t *) page->prev;
|
|
p->next = page->next;
|
|
page->next->prev = page->prev;
|
|
}
|
|
|
|
page->slab = pages | NCX_SLAB_PAGE_START;
|
|
page->next = NULL;
|
|
page->prev = NCX_SLAB_PAGE;
|
|
|
|
if (--pages == 0) {
|
|
return page;
|
|
}
|
|
|
|
for (p = page + 1; pages; pages--) {
|
|
p->slab = NCX_SLAB_PAGE_BUSY;
|
|
p->next = NULL;
|
|
p->prev = NCX_SLAB_PAGE;
|
|
p++;
|
|
}
|
|
|
|
return page;
|
|
}
|
|
}
|
|
|
|
// error("ncx_slab_alloc() failed: no memory");
|
|
|
|
return NULL;
|
|
}
|
|
|
|
static void ncx_slab_free_pages(ncx_slab_pool_t *pool, ncx_slab_page_t *page, ncx_uint_t pages) {
|
|
ncx_slab_page_t *prev;
|
|
|
|
if (pages > 1) {
|
|
ncx_memzero(&page[1], (pages - 1) * sizeof(ncx_slab_page_t));
|
|
}
|
|
|
|
if (page->next) {
|
|
prev = (ncx_slab_page_t *) (page->prev & ~NCX_SLAB_PAGE_MASK);
|
|
prev->next = page->next;
|
|
page->next->prev = page->prev;
|
|
}
|
|
|
|
page->slab = pages;
|
|
page->prev = (uintptr_t) &pool->free;
|
|
page->next = pool->free.next;
|
|
page->next->prev = (uintptr_t) page;
|
|
|
|
pool->free.next = page;
|
|
|
|
#ifdef PAGE_MERGE
|
|
if (pool->pages != page) {
|
|
prev = page - 1;
|
|
if (ncx_slab_empty(pool, prev)) {
|
|
for (; prev >= pool->pages; prev--) {
|
|
if (prev->slab != 0)
|
|
{
|
|
pool->free.next = page->next;
|
|
page->next->prev = (uintptr_t) &pool->free;
|
|
|
|
prev->slab += pages;
|
|
ncx_memzero(page, sizeof(ncx_slab_page_t));
|
|
|
|
page = prev;
|
|
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if ((page - pool->pages + page->slab) < ncx_real_pages) {
|
|
next = page + page->slab;
|
|
if (ncx_slab_empty(pool, next))
|
|
{
|
|
prev = (ncx_slab_page_t *) (next->prev);
|
|
prev->next = next->next;
|
|
next->next->prev = next->prev;
|
|
|
|
page->slab += next->slab;
|
|
ncx_memzero(next, sizeof(ncx_slab_page_t));
|
|
}
|
|
}
|
|
|
|
#endif
|
|
}
|
|
|
|
void ncx_slab_stat(ncx_slab_pool_t *pool, ncx_slab_stat_t *stat) {
|
|
uintptr_t m, n, mask, slab;
|
|
uintptr_t *bitmap;
|
|
ncx_uint_t i, j, map, type, obj_size;
|
|
ncx_slab_page_t *page;
|
|
|
|
ncx_memzero(stat, sizeof(ncx_slab_stat_t));
|
|
|
|
page = pool->pages;
|
|
stat->pages = (pool->end - pool->start) / ncx_pagesize;
|
|
|
|
for (i = 0; i < stat->pages; i++) {
|
|
slab = page->slab;
|
|
type = page->prev & NCX_SLAB_PAGE_MASK;
|
|
|
|
switch (type) {
|
|
|
|
case NCX_SLAB_SMALL:
|
|
|
|
n = (page - pool->pages) << ncx_pagesize_shift;
|
|
bitmap = (uintptr_t *) (pool->start + n);
|
|
|
|
obj_size = 1 << slab;
|
|
map = (1 << (ncx_pagesize_shift - slab))
|
|
/ (sizeof(uintptr_t) * 8);
|
|
|
|
for (j = 0; j < map; j++) {
|
|
for (m = 1; m; m <<= 1) {
|
|
if ((bitmap[j] & m)) {
|
|
stat->used_size += obj_size;
|
|
stat->b_small += obj_size;
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
stat->p_small++;
|
|
|
|
break;
|
|
|
|
case NCX_SLAB_EXACT:
|
|
|
|
if (slab == NCX_SLAB_BUSY) {
|
|
stat->used_size += sizeof(uintptr_t) * 8 * ncx_slab_exact_size;
|
|
stat->b_exact += sizeof(uintptr_t) * 8 * ncx_slab_exact_size;
|
|
} else {
|
|
for (m = 1; m; m <<= 1) {
|
|
if (slab & m) {
|
|
stat->used_size += ncx_slab_exact_size;
|
|
stat->b_exact += ncx_slab_exact_size;
|
|
}
|
|
}
|
|
}
|
|
|
|
stat->p_exact++;
|
|
|
|
break;
|
|
|
|
case NCX_SLAB_BIG:
|
|
|
|
j = ncx_pagesize_shift - (slab & NCX_SLAB_SHIFT_MASK);
|
|
j = 1 << j;
|
|
j = ((uintptr_t) 1 << j) - 1;
|
|
mask = j << NCX_SLAB_MAP_SHIFT;
|
|
obj_size = 1 << (slab & NCX_SLAB_SHIFT_MASK);
|
|
|
|
for (m = (uintptr_t) 1 << NCX_SLAB_MAP_SHIFT; m & mask; m <<= 1) {
|
|
if ((page->slab & m)) {
|
|
stat->used_size += obj_size;
|
|
stat->b_big += obj_size;
|
|
}
|
|
}
|
|
|
|
stat->p_big++;
|
|
|
|
break;
|
|
|
|
case NCX_SLAB_PAGE:
|
|
|
|
if (page->prev == NCX_SLAB_PAGE) {
|
|
slab = slab & ~NCX_SLAB_PAGE_START;
|
|
stat->used_size += slab * ncx_pagesize;
|
|
stat->b_page += slab * ncx_pagesize;
|
|
stat->p_page += slab;
|
|
|
|
i += (slab - 1);
|
|
|
|
break;
|
|
}
|
|
|
|
default:
|
|
|
|
if (slab > stat->max_free_pages) {
|
|
stat->max_free_pages = page->slab;
|
|
}
|
|
|
|
stat->free_page += slab;
|
|
|
|
i += (slab - 1);
|
|
|
|
break;
|
|
}
|
|
|
|
page = pool->pages + i + 1;
|
|
}
|
|
|
|
stat->pool_size = pool->end - pool->start;
|
|
stat->used_pct = stat->used_size * 100 / stat->pool_size;
|
|
}
|
|
|
|
static bool ncx_slab_empty(ncx_slab_pool_t *pool, ncx_slab_page_t *page) {
|
|
ncx_slab_page_t *prev;
|
|
|
|
if (page->slab == 0) {
|
|
return true;
|
|
}
|
|
|
|
//page->prev == PAGE | SMALL | EXACT | BIG
|
|
if (page->next == NULL) {
|
|
return false;
|
|
}
|
|
|
|
prev = (ncx_slab_page_t *) (page->prev & ~NCX_SLAB_PAGE_MASK);
|
|
while (prev >= pool->pages) {
|
|
prev = (ncx_slab_page_t *) (prev->prev & ~NCX_SLAB_PAGE_MASK);
|
|
}
|
|
|
|
if (prev == &pool->free) {
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
} |