2000-05-28 13:40:48 +00:00
|
|
|
/*
|
|
|
|
* _heap.h
|
|
|
|
*
|
2004-12-19 23:09:38 +00:00
|
|
|
* Ullrich von Bassewitz, 1998-06-03, 2004-12-19
|
2000-05-28 13:40:48 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef __HEAP_H
|
|
|
|
#define __HEAP_H
|
|
|
|
|
|
|
|
|
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
/* Structure that preceeds a user block in most cases.
|
|
|
|
* The aligned_malloc function may generate blocks where the start pointer
|
|
|
|
* and size are splitted to handle a memory hole that is needed for
|
|
|
|
* alignment.
|
|
|
|
*/
|
|
|
|
struct usedblock {
|
|
|
|
unsigned size;
|
|
|
|
struct usedblock* start;
|
|
|
|
};
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Space needed for administering used blocks */
|
2004-12-19 23:09:38 +00:00
|
|
|
#define HEAP_ADMIN_SPACE sizeof (struct usedblock)
|
2000-05-28 13:40:48 +00:00
|
|
|
|
2003-02-01 12:22:09 +00:00
|
|
|
/* The data type used to implement the free list.
|
2000-05-28 13:40:48 +00:00
|
|
|
* Beware: Field order is significant!
|
2004-12-19 23:09:38 +00:00
|
|
|
*/
|
2000-05-28 13:40:48 +00:00
|
|
|
struct freeblock {
|
|
|
|
unsigned size;
|
|
|
|
struct freeblock* next;
|
|
|
|
struct freeblock* prev;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Variables that describe the heap */
|
2003-02-01 12:22:09 +00:00
|
|
|
extern unsigned* _heaporg; /* Bottom of heap */
|
|
|
|
extern unsigned* _heapptr; /* Current top */
|
|
|
|
extern unsigned* _heapend; /* Upper limit */
|
|
|
|
extern struct freeblock* _heapfirst; /* First free block in list */
|
|
|
|
extern struct freeblock* _heaplast; /* Last free block in list */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* End of _heap.h */
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|