malloc/mstat.c

   1 #include "mpool.h"
   2 #include "mstat.h"
   3
   4 void mpool_stat_get_nodes(const mpool_t *mpool, size_t *avail, size_t *used)
   5 {
   6     const blkhead_t *phead;
   7     const blknode_t *pnode;
   8     size_t i;
   9
  10     *avail = 0;
  11     *used = 0;
  12     for (i = 0; i < mpool->nblocks; i++) {
  13         phead = &mpool->blktable[i];
  14         LIST_FOREACH(pnode, phead, next_chunk) {
  15             /*if (pnode->flags & MP_NODE_AVAIL)*/
  16             if (MPOOL_IS_AVAIL(pnode))
  17                 (*avail)++;
  18             else
  19                 (*used)++;
  20         }
  21     }
  22 }
  23
  24 void mpool_stat_get_bytes(const mpool_t *mpool, size_t *avail, size_t *used)
  25 {
  26     const blkhead_t *phead;
  27     const blknode_t *pnode;
  28     size_t i;
  29
  30     *avail = 0;
  31     *used = 0;
  32     for (i = 0; i < mpool->nblocks; i++) {
  33         phead = &mpool->blktable[i];
  34         LIST_FOREACH(pnode, phead, next_chunk) {
  35             /*if (pnode->flags & MP_NODE_AVAIL)*/
  36             if (MPOOL_IS_AVAIL(pnode))
  37                 *avail += 1 << pnode->logsize;
  38             else
  39                 *used += 1 << pnode->logsize;
  40         }
  41     }
  42 }
  43
  44 size_t mpool_stat_get_blocks(const mpool_t *mpool)
  45 {
  46     return mpool->nblocks;
  47 }
  48
  49 size_t mpool_stat_get_block_length(const mpool_t *mpool, size_t pos)
  50 {
  51     const blknode_t *pnode;
  52     size_t length;
  53
  54     if (pos >= mpool->nblocks)
  55         return 0;    /* FIXME: Better error handling */
  56
  57     length = 0;
  58     LIST_FOREACH(pnode, &mpool->blktable[pos], next_chunk)
  59         length++;
  60
  61     return length;
  62 }
  63
  64 #ifdef MP_STATS
  65 size_t mpool_stat_get_splits(const mpool_t *mpool)
  66 {
  67     return mpool->nsplits;
  68 }
  69
  70 size_t mpool_stat_get_merges(const mpool_t *mpool)
  71 {
  72     return mpool->nmerges;
  73 }
  74 #endif
  75