/*
 * Copyright © 2005 William Pitcock, et al.
 * Rights to this code are as documented in doc/pod/license.pod.
 *
 * Data structures for the block allocator.
 *
 * $Id: balloc.h,v 1.3 2007/08/28 17:12:24 pippijn dead $
 */

#ifndef BALLOC_H
#define BALLOC_H

struct Block
{
  size_t alloc_size;
  struct Block *next;		/* Next in our chain of blocks */
  void *elems;			/* Points to allocated memory */
  list_t free_list;
  list_t used_list;
};

struct MemBlock
{
#ifdef DEBUG_BALLOC
  unsigned long magic;
#endif
  node_t self;
  Block *block;			/* Which block we belong to */
};

/* information for the root node of the heap */
struct BlockHeap
{
  node_t hlist;
  size_t elemSize;		/* Size of each element to be stored */
  unsigned long elemsPerBlock;	/* Number of elements per block */
  unsigned long blocksAllocated;	/* Number of blocks allocated */
  unsigned long freeElems;	/* Number of free elements */
  Block *base;			/* Pointer to first block */
};

E int BlockHeapFree (BlockHeap *bh, void *ptr);
E void *BlockHeapAlloc (BlockHeap *bh);

E BlockHeap *BlockHeapCreate (size_t elemsize, int elemsperblock);
E int BlockHeapDestroy (BlockHeap *bh);

E void initBlockHeap (void);
E void BlockHeapUsage (BlockHeap *bh, size_t * bused, size_t * bfree, size_t * bmemusage);

#endif