3 heap.c - Heap Manager
\r
5 #include <acess/sys.h>
\r
10 #define MAGIC 0xACE55051 //AcessOS1
\r
11 #define MAGIC_FREE (~MAGIC)
\r
12 #define BLOCK_SIZE 16 //Minimum
\r
13 #define HEAP_INIT_SIZE 0x10000
\r
15 typedef unsigned int Uint;
\r
28 void *_heap_start = NULL;
\r
29 void *_heap_end = NULL;
\r
32 EXPORT void *malloc(Uint bytes);
\r
33 EXPORT void free(void *mem);
\r
34 EXPORT void *realloc(void *mem, Uint bytes);
\r
35 EXPORT void *sbrk(int increment);
\r
36 LOCAL void *extendHeap(int bytes);
\r
37 LOCAL uint brk(Uint newpos);
\r
42 \fn EXPORT void *malloc(size_t bytes)
\r
43 \brief Allocates memory from the heap space
\r
44 \param bytes Integer - Size of buffer to return
\r
45 \return Pointer to buffer
\r
47 EXPORT void *malloc(size_t bytes)
\r
50 Uint closestMatch = 0;
\r
51 Uint bestMatchAddr = 0;
\r
52 heap_head *curBlock;
\r
55 if(_heap_start == NULL)
\r
57 _heap_start = sbrk(0);
\r
58 _heap_end = _heap_start;
\r
59 extendHeap(HEAP_INIT_SIZE);
\r
62 curBlock = _heap_start;
\r
64 bestSize = bytes + sizeof(heap_head) + sizeof(heap_foot) + BLOCK_SIZE - 1;
\r
65 bestSize = (bestSize/BLOCK_SIZE)*BLOCK_SIZE; //Round up to block size
\r
67 while((Uint)curBlock < (Uint)_heap_end)
\r
69 //SysDebug(" malloc: curBlock = 0x%x, curBlock->magic = 0x%x\n", curBlock, curBlock->magic);
\r
70 if(curBlock->magic == MAGIC_FREE)
\r
72 if(curBlock->size == bestSize)
\r
74 if(bestSize < curBlock->size && (curBlock->size < closestMatch || closestMatch == 0)) {
\r
75 closestMatch = curBlock->size;
\r
76 bestMatchAddr = (Uint)curBlock;
\r
79 else if(curBlock->magic != MAGIC)
\r
82 //SysDebug("malloc: Corrupt Heap\n");
\r
85 curBlock = (heap_head*)((Uint)curBlock + curBlock->size);
\r
88 if((Uint)curBlock < (Uint)_heap_start) {
\r
89 //SysDebug("malloc: Heap underrun for some reason\n");
\r
93 //Found a perfect match
\r
94 if((Uint)curBlock < (Uint)_heap_end) {
\r
95 curBlock->magic = MAGIC;
\r
96 return (void*)((Uint)curBlock + sizeof(heap_head));
\r
100 if(!closestMatch) {
\r
101 curBlock = extendHeap(bestSize); //Allocate more
\r
102 if(curBlock == NULL) {
\r
103 //SysDebug("malloc: Out of Heap Space\n");
\r
106 curBlock->magic = MAGIC;
\r
107 return (void*)((Uint)curBlock + sizeof(heap_head));
\r
111 if(closestMatch - bestSize > BLOCK_SIZE) {
\r
113 curBlock = (heap_head*)bestMatchAddr;
\r
114 curBlock->magic = MAGIC;
\r
115 curBlock->size = bestSize;
\r
116 foot = (heap_foot*)(bestMatchAddr + bestSize - sizeof(heap_foot));
\r
117 foot->header = curBlock;
\r
118 foot->magic = MAGIC;
\r
120 curBlock = (heap_head*)(bestMatchAddr + bestSize);
\r
121 curBlock->magic = MAGIC_FREE;
\r
122 curBlock->size = closestMatch - bestSize;
\r
124 foot = (heap_foot*)(bestMatchAddr + closestMatch - sizeof(heap_foot));
\r
125 foot->header = curBlock;
\r
127 ((heap_head*)bestMatchAddr)->magic = MAGIC; //mark as used
\r
128 return (void*)(bestMatchAddr + sizeof(heap_head));
\r
131 //Don't Split the block
\r
132 ((heap_head*)bestMatchAddr)->magic = MAGIC;
\r
133 return (void*)(bestMatchAddr+sizeof(heap_head));
\r
137 \fn EXPORT void free(void *mem)
\r
138 \brief Free previously allocated memory
\r
139 \param mem Pointer - Memory to free
\r
141 EXPORT void free(void *mem)
\r
143 heap_head *head = (void*)((intptr_t)mem-sizeof(heap_head));
\r
148 if(head->magic != MAGIC) //Valid Heap Address
\r
151 head->magic = MAGIC_FREE;
\r
154 if((intptr_t)head + head->size < (intptr_t)_heap_end)
\r
156 heap_head *nextHead = (heap_head*)((intptr_t)head + head->size);
\r
157 if(nextHead->magic == MAGIC_FREE) { //Is the next block free
\r
158 head->size += nextHead->size; //Amalgamate
\r
159 nextHead->magic = 0; //For Security
\r
163 if((intptr_t)head - sizeof(heap_foot) > (intptr_t)_heap_start)
\r
165 heap_head *prevHead;
\r
166 heap_foot *prevFoot = (heap_foot *)((intptr_t)head - sizeof(heap_foot));
\r
167 if(prevFoot->magic == MAGIC) {
\r
168 prevHead = prevFoot->header;
\r
169 if(prevHead->magic == MAGIC_FREE) {
\r
170 prevHead->size += head->size; //Amalgamate
\r
171 head->magic = 0; //For Security
\r
178 \fn EXPORT void *realloc(void *oldPos, size_t bytes)
\r
179 \brief Reallocate a block of memory
\r
180 \param bytes Integer - Size of new buffer
\r
181 \param oldPos Pointer - Old Buffer
\r
182 \return Pointer to new buffer
\r
184 EXPORT void *realloc(void *oldPos, size_t bytes)
\r
189 if(oldPos == NULL) {
\r
190 return malloc(bytes);
\r
193 //Check for free space after block
\r
194 head = (heap_head*)((Uint)oldPos-sizeof(heap_head));
\r
196 //Hack to used free's amagamating algorithym and malloc's splitting
\r
199 //Allocate new memory
\r
200 ret = malloc(bytes);
\r
205 if((Uint)ret != (Uint)oldPos) {
\r
206 memcpy(ret, oldPos, head->size-sizeof(heap_head)-sizeof(heap_foot));
\r
214 * \fn LOCAL void *extendHeap(int bytes)
\r
215 * \brief Create a new block at the end of the heap area
\r
216 * \param bytes Integer - Size reqired
\r
217 * \return Pointer to last free block
\r
220 LOCAL void *extendHeap(int bytes)
\r
222 heap_head *head = _heap_end;
\r
225 //Expand Memory Space (Use foot as a temp pointer)
\r
226 foot = sbrk(bytes);
\r
227 if(foot == (void*)-1)
\r
233 head->magic = MAGIC_FREE; //Unallocated
\r
234 head->size = bytes;
\r
236 foot = _heap_end + bytes - sizeof(heap_foot);
\r
237 foot->header = head;
\r
238 foot->magic = MAGIC;
\r
240 //Combine with previous block if nessasary
\r
241 if(_heap_end != _heap_start && ((heap_foot*)((Uint)_heap_end-sizeof(heap_foot)))->magic == MAGIC) {
\r
242 heap_head *tmpHead = ((heap_foot*)((Uint)_heap_end-sizeof(heap_foot)))->header;
\r
243 if(tmpHead->magic == MAGIC_FREE) {
\r
244 tmpHead->size += bytes;
\r
245 foot->header = tmpHead;
\r
250 _heap_end = (void*) ((Uint)foot+sizeof(heap_foot));
\r
255 \fn EXPORT void *sbrk(int increment)
\r
256 \brief Increases the program's memory space
\r
257 \param count Integer - Size of heap increase
\r
258 \return Pointer to start of new region
\r
260 EXPORT void *sbrk(int increment)
\r
263 static size_t oldEnd = 0;
\r
264 static size_t curEnd = 0;
\r
266 //_SysDebug("sbrk: (increment=%i)\n", increment);
\r
268 if (oldEnd == 0) curEnd = oldEnd = brk(0);
\r
270 //SysDebug(" sbrk: oldEnd = 0x%x\n", oldEnd);
\r
271 if (increment == 0) return (void *) curEnd;
\r
273 newEnd = curEnd + increment;
\r
275 if (brk(newEnd) == curEnd) return (void *) -1;
\r
278 //SysDebug(" sbrk: newEnd = 0x%x\n", newEnd);
\r
280 return (void *) oldEnd;
\r
284 * \fn EXPORT int IsHeap(void *ptr)
\r
286 EXPORT int IsHeap(void *ptr)
\r
292 if( (Uint)ptr < (Uint)_heap_start ) return 0;
\r
293 if( (Uint)ptr > (Uint)_heap_end ) return 0;
\r
296 head = (void*)((Uint)ptr - 4);
\r
297 if( head->magic != MAGIC ) return 0;
\r
298 foot = (void*)( (Uint)ptr + head->size - sizeof(heap_foot) );
\r
299 if( foot->magic != MAGIC ) return 0;
\r
304 // === STATIC FUNCTIONS ===
\r
306 * Does the job of brk(0)
\r
308 static void *FindHeapBase()
\r
311 #define MAX 0xC0000000 // Address
\r
312 #define THRESHOLD 512 // Pages
\r
317 // Scan address space
\r
323 tmp = _SysGetPhys(addr);
\r
328 if(stretch > THRESHOLD)
\r
330 return (void*)( addr - stretch*0x1000 );
\r
333 //__asm__ __volatile__ (
\r
334 // "push %%ebx;mov %%edx,%%ebx;int $0xAC;pop %%ebx"
\r
335 // ::"a"(256),"d"("%x"),"c"(addr));
\r
340 return (void*)0x00900000;
\r
344 LOCAL uint brk(Uint newpos)
\r
346 static uint curpos;
\r
351 //_SysDebug("brk: (newpos=0x%x)", newpos);
\r
353 // Find initial position
\r
354 if(curpos == 0) curpos = (uint)FindHeapBase();
\r
356 // Get Current Position
\r
357 if(newpos == 0) return curpos;
\r
359 if(newpos < curpos) return newpos;
\r
361 delta = newpos - curpos;
\r
362 //_SysDebug(" brk: delta = 0x%x", delta);
\r
364 // Do we need to add pages
\r
365 if(curpos & 0xFFF && (curpos & 0xFFF) + delta < 0x1000)
\r
366 return curpos += delta;
\r
368 // Page align current position
\r
369 if(curpos & 0xFFF) delta -= 0x1000 - (curpos & 0xFFF);
\r
370 curpos = (curpos + 0xFFF) & ~0xFFF;
\r
373 pages = (delta + 0xFFF) >> 12;
\r
376 _SysAllocate(curpos);
\r
381 // Bring the current position to exactly what we want
\r
382 curpos -= ((delta + 0xFFF) & ~0xFFF) - delta;
\r
384 return ret; // Return old curpos
\r