2 * AcessOS Microkernel Version
11 #define VERBOSE_DUMP 0
14 #define HEAP_INIT_SIZE 0x8000 // 32 KiB
15 #define MIN_SIZE (sizeof(void*))*8 // 8 Machine Words
17 #define COMPACT_HEAP 0 // Use 4 byte header?
20 //#define MAGIC_FOOT 0x2ACE5505
21 //#define MAGIC_FREE 0xACE55000
22 //#define MAGIC_USED 0x862B0505 // MAGIC_FOOT ^ MAGIC_FREE
23 #define MAGIC_FOOT 0x544F4F46 // 'FOOT'
24 #define MAGIC_FREE 0x45455246 // 'FREE'
25 #define MAGIC_USED 0x44455355 // 'USED'
28 void Heap_Install(void);
29 void *Heap_Extend(int Bytes);
30 void *Heap_Merge(tHeapHead *Head);
31 //void *Heap_Allocate(const char *File, int Line, size_t Bytes);
32 //void *Heap_AllocateZero(const char *File, int Line, size_t Bytes);
33 //void *Heap_Reallocate(const char *File, int Line, void *Ptr, size_t Bytes);
34 //void Heap_Deallocate(void *Ptr);
36 void Heap_Stats(void);
44 void Heap_Install(void)
46 gHeapStart = (void*)MM_KHEAP_BASE;
47 gHeapEnd = (void*)MM_KHEAP_BASE;
48 Heap_Extend(HEAP_INIT_SIZE);
52 * \fn void *Heap_Extend(int Bytes)
53 * \brief Extend the size of the heap
55 void *Heap_Extend(int Bytes)
58 tHeapHead *head = gHeapEnd;
62 if( (tVAddr)gHeapEnd == MM_KHEAP_MAX )
66 Log_Warning("Heap", "Heap_Extend called with Bytes=%i", Bytes);
71 if( (tVAddr)gHeapEnd + ((Bytes+0xFFF)&~0xFFF) > MM_KHEAP_MAX ) {
72 Bytes = MM_KHEAP_MAX - (tVAddr)gHeapEnd;
76 // Heap expands in pages
77 for( i = 0; i < (Bytes+0xFFF) >> 12; i ++ )
79 if( !MM_Allocate( (tVAddr)gHeapEnd+(i<<12) ) )
81 Warning("OOM - Heap_Extend");
87 gHeapEnd = (Uint8*)gHeapEnd + (i << 12);
90 head->Size = (Bytes+0xFFF)&~0xFFF;
91 head->Magic = MAGIC_FREE;
92 foot = (void*)( (Uint)gHeapEnd - sizeof(tHeapFoot) );
94 foot->Magic = MAGIC_FOOT;
96 return Heap_Merge(head); // Merge with previous block
100 * \fn void *Heap_Merge(tHeapHead *Head)
101 * \brief Merges two ajacent heap blocks
103 void *Heap_Merge(tHeapHead *Head)
109 //Log("Heap_Merge: (Head=%p)", Head);
111 thisFoot = (void*)( (Uint)Head + Head->Size - sizeof(tHeapFoot) );
112 if((Uint)thisFoot > (Uint)gHeapEnd) return NULL;
115 foot = (void*)( (Uint)Head - sizeof(tHeapFoot) );
116 if( ((Uint)foot < (Uint)gHeapEnd && (Uint)foot > (Uint)gHeapStart)
117 && foot->Head->Magic == MAGIC_FREE) {
118 foot->Head->Size += Head->Size; // Increase size
119 thisFoot->Head = foot->Head; // Change backlink
120 Head->Magic = 0; // Clear old head
122 Head = foot->Head; // Save new head address
123 foot->Head = NULL; // Clear central footer
127 // Merge Right (Upwards)
128 head = (void*)( (Uint)Head + Head->Size );
129 if((Uint)head < (Uint)gHeapEnd && head->Magic == MAGIC_FREE)
131 Head->Size += head->Size;
132 foot = (void*)( (Uint)Head + Head->Size - sizeof(tHeapFoot) );
133 foot->Head = Head; // Update Backlink
134 thisFoot->Head = NULL; // Clear old footer
136 head->Size = 0; // Clear old header
140 // Return new address
145 * \brief Allocate memory from the heap
146 * \param File Allocating source file
147 * \param Line Source line
148 * \param Bytes Size of region to allocate
150 void *Heap_Allocate(const char *File, int Line, size_t __Bytes)
152 tHeapHead *head, *newhead;
153 tHeapFoot *foot, *newfoot;
154 tHeapHead *best = NULL;
155 Uint bestSize = 0; // Speed hack
159 //return NULL; // TODO: Return a known un-mapped range.
165 Bytes = __Bytes + sizeof(tHeapHead) + sizeof(tHeapFoot);
166 Bytes = 1UUL << LOG2(__Bytes);
168 Bytes = (__Bytes + sizeof(tHeapHead) + sizeof(tHeapFoot) + MIN_SIZE-1) & ~(MIN_SIZE-1);
172 Mutex_Acquire(&glHeap);
175 for( head = gHeapStart;
176 (Uint)head < (Uint)gHeapEnd;
177 head = (void*)((Uint)head + head->Size)
182 if( head->Size != 1UUL << LOG2(head->Size) ) {
184 if( head->Size & (MIN_SIZE-1) ) {
186 Mutex_Release(&glHeap); // Release spinlock
188 Log_Warning("Heap", "Size of heap address %p is invalid not aligned (0x%x)", head, head->Size);
194 // Check if allocated
195 if(head->Magic == MAGIC_USED) continue;
197 if(head->Magic != MAGIC_FREE) {
198 Mutex_Release(&glHeap); // Release spinlock
200 Log_Warning("Heap", "Magic of heap address %p is invalid (%p = 0x%x)",
201 head, &head->Magic, head->Magic);
208 if(head->Size < Bytes) continue;
211 if(head->Size == Bytes) {
212 head->Magic = MAGIC_USED;
215 head->ValidSize = __Bytes;
216 head->AllocateTime = now();
217 Mutex_Release(&glHeap); // Release spinlock
219 Debug("[Heap ] Malloc'd %p (%i bytes), returning to %p", head->Data, head->Size, __builtin_return_address(0));
227 bestSize = head->Size;
230 // or check if the block is the best size
231 if(bestSize > head->Size) {
233 bestSize = head->Size;
238 // If no block large enough is found, create one
241 best = Heap_Extend( Bytes );
244 Mutex_Release(&glHeap); // Release spinlock
248 if(best->Size == Bytes) {
249 best->Magic = MAGIC_USED; // Mark block as used
252 best->ValidSize = __Bytes;
253 best->AllocateTime = now();
254 Mutex_Release(&glHeap); // Release spinlock
256 Debug("[Heap ] Malloc'd %p (%i bytes), returning to %s:%i", best->Data, best->Size, File, Line);
263 newhead = (void*)( (Uint)best + Bytes );
264 newfoot = (void*)( (Uint)best + Bytes - sizeof(tHeapFoot) );
265 foot = (void*)( (Uint)best + best->Size - sizeof(tHeapFoot) );
267 newfoot->Head = best; // Create new footer
268 newfoot->Magic = MAGIC_FOOT;
269 newhead->Size = best->Size - Bytes; // Create new header
270 newhead->Magic = MAGIC_FREE;
271 foot->Head = newhead; // Update backlink in old footer
272 best->Size = Bytes; // Update size in old header
273 best->ValidSize = __Bytes;
274 best->Magic = MAGIC_USED; // Mark block as used
277 best->AllocateTime = now();
279 Mutex_Release(&glHeap); // Release spinlock
281 Debug("[Heap ] Malloc'd %p (0x%x bytes), returning to %s:%i",
282 best->Data, best->Size, File, Line);
288 * \fn void Heap_Deallocate(void *Ptr)
289 * \brief Free an allocated memory block
291 void Heap_Deallocate(void *Ptr)
293 tHeapHead *head = (void*)( (Uint)Ptr - sizeof(tHeapHead) );
296 // INVLPTR is returned from Heap_Allocate when the allocation
298 if( Ptr == INVLPTR ) return;
301 Debug("[Heap ] free: %p freed by %p (%i old)", Ptr, __builtin_return_address(0), now()-head->AllocateTime);
305 if( (Uint)Ptr & (sizeof(Uint)-1) ) {
306 Log_Warning("Heap", "free - Passed a non-aligned address (%p)", Ptr);
311 if((Uint)Ptr < (Uint)gHeapStart || (Uint)Ptr > (Uint)gHeapEnd)
313 Log_Warning("Heap", "free - Passed a non-heap address (%p < %p < %p)\n",
314 gHeapStart, Ptr, gHeapEnd);
318 // Check memory block - Header
319 head = (void*)( (Uint)Ptr - sizeof(tHeapHead) );
320 if(head->Magic == MAGIC_FREE) {
321 Log_Warning("Heap", "free - Passed a freed block (%p) by %p", head, __builtin_return_address(0));
324 if(head->Magic != MAGIC_USED) {
325 Log_Warning("Heap", "free - Magic value is invalid (%p, 0x%x)", head, head->Magic);
326 Log_Notice("Heap", "Allocated by %s:%i", head->File, head->Line);
330 // Check memory block - Footer
331 foot = (void*)( (Uint)head + head->Size - sizeof(tHeapFoot) );
332 if(foot->Head != head) {
333 Log_Warning("Heap", "free - Footer backlink is incorrect (%p, 0x%x)", head, foot->Head);
334 Log_Notice("Heap", "Allocated by %s:%i", head->File, head->Line);
337 if(foot->Magic != MAGIC_FOOT) {
338 Log_Warning("Heap", "free - Footer magic is invalid (%p, %p = 0x%x)", head, &foot->Magic, foot->Magic);
339 Log_Notice("Heap", "Allocated by %s:%i", head->File, head->Line);
344 Mutex_Acquire( &glHeap );
347 head->Magic = MAGIC_FREE;
355 Mutex_Release( &glHeap );
359 * \brief Increase/Decrease the size of an allocation
360 * \param File Calling File
361 * \param Line Calling Line
362 * \param __ptr Old memory
363 * \param __size New Size
365 void *Heap_Reallocate(const char *File, int Line, void *__ptr, size_t __size)
367 tHeapHead *head = (void*)( (Uint)__ptr-sizeof(tHeapHead) );
370 Uint newSize = (__size + sizeof(tHeapFoot)+sizeof(tHeapHead)+MIN_SIZE-1)&~(MIN_SIZE-1);
372 // Check for reallocating NULL
373 if(__ptr == NULL) return Heap_Allocate(File, Line, __size);
375 // Check if resize is needed
376 if(newSize <= head->Size) return __ptr;
378 // Check if next block is free
379 nextHead = (void*)( (Uint)head + head->Size );
381 // Extend into next block
382 if(nextHead->Magic == MAGIC_FREE && nextHead->Size+head->Size >= newSize)
384 Uint size = nextHead->Size + head->Size;
385 foot = (void*)( (Uint)nextHead + nextHead->Size - sizeof(tHeapFoot) );
387 if(size == newSize) {
388 head->Size = newSize;
389 head->ValidSize = __size;
397 // Create a new heap block
398 nextHead = (void*)( (Uint)head + newSize );
399 nextHead->Size = size - newSize;
400 nextHead->Magic = MAGIC_FREE;
401 foot->Head = nextHead; // Edit 2nd footer
402 head->Size = newSize; // Edit first header
405 head->ValidSize = __size;
407 foot = (void*)( (Uint)head + newSize - sizeof(tHeapFoot) );
409 foot->Magic = MAGIC_FOOT;
414 foot = (void*)( (Uint)head - sizeof(tHeapFoot) );
415 nextHead = foot->Head;
416 if(nextHead->Magic == MAGIC_FREE && nextHead->Size+head->Size >= newSize)
418 Uint size = nextHead->Size + head->Size;
419 // Inexact fit, split things up
423 Warning("[Heap ] TODO: Space efficient realloc when new size is smaller");
430 // Set 1st (new/lower) header
431 nextHead->Magic = MAGIC_USED;
432 nextHead->Size = newSize;
433 nextHead->File = File;
434 nextHead->Line = Line;
435 nextHead->ValidSize = __size;
436 // Get 2nd (old) footer
437 foot = (void*)( (Uint)nextHead + newSize );
438 foot->Head = nextHead;
439 // Save old data size
440 oldDataSize = head->Size - sizeof(tHeapFoot) - sizeof(tHeapHead);
445 memcpy(nextHead->Data, __ptr, oldDataSize);
447 return nextHead->Data;
449 // On to the expensive then
453 nextHead = Heap_Allocate( File, Line, __size );
455 nextHead->File = File;
456 nextHead->Line = Line;
457 nextHead->ValidSize = __size;
462 head->Size - sizeof(tHeapFoot) - sizeof(tHeapHead)
467 return nextHead->Data;
471 * \fn void *Heap_AllocateZero(const char *File, int Line, size_t Bytes)
472 * \brief Allocate and Zero a buffer in memory
473 * \param File Allocating file
474 * \param Line Line of allocation
475 * \param Bytes Size of the allocation
477 void *Heap_AllocateZero(const char *File, int Line, size_t Bytes)
479 void *ret = Heap_Allocate(File, Line, Bytes);
480 if(ret == NULL) return NULL;
482 memset( ret, 0, Bytes );
488 * \fn int Heap_IsHeapAddr(void *Ptr)
489 * \brief Checks if an address is a heap pointer
491 int Heap_IsHeapAddr(void *Ptr)
494 if((Uint)Ptr < (Uint)gHeapStart) return 0;
495 if((Uint)Ptr > (Uint)gHeapEnd) return 0;
496 if((Uint)Ptr & (sizeof(Uint)-1)) return 0;
498 head = (void*)( (Uint)Ptr - sizeof(tHeapHead) );
499 if(head->Magic != MAGIC_USED && head->Magic != MAGIC_FREE)
507 void Heap_Validate(void)
515 tHeapHead *head, *badHead;
516 tHeapFoot *foot = NULL;
519 while( (Uint)head < (Uint)gHeapEnd )
521 foot = (void*)( (Uint)head + head->Size - sizeof(tHeapFoot) );
523 Log_Log("Heap", "%p (0x%P): 0x%08x (%i) %4C",
524 head, MM_GetPhysAddr((tVAddr)head), head->Size, head->ValidSize, &head->Magic);
525 Log_Log("Heap", "%p %4C", foot->Head, &foot->Magic);
527 Log_Log("Heap", "%sowned by %s:%i",
528 (head->Magic==MAGIC_FREE?"was ":""), head->File, head->Line);
532 // Sanity Check Header
533 if(head->Size == 0) {
534 Log_Warning("Heap", "HALTED - Size is zero");
537 if(head->Size & (MIN_SIZE-1)) {
538 Log_Warning("Heap", "HALTED - Size is malaligned");
541 if(head->Magic != MAGIC_FREE && head->Magic != MAGIC_USED) {
542 Log_Warning("Heap", "HALTED - Head Magic is Bad");
547 if(foot->Magic != MAGIC_FOOT) {
548 Log_Warning("Heap", "HALTED - Foot Magic is Bad");
551 if(head != foot->Head) {
552 Log_Warning("Heap", "HALTED - Footer backlink is invalid");
560 // All OK? Go to next
561 head = foot->NextHead;
564 // If the heap is valid, ok!
565 if( (tVAddr)head == (tVAddr)gHeapEnd )
568 // Check for a bad return
569 if( (tVAddr)head >= (tVAddr)gHeapEnd )
573 Log_Log("Heap", "%p (%P): 0x%08lx %i %4C",
574 head, MM_GetPhysAddr((Uint)head), head->Size, head->ValidSize, &head->Magic);
576 Log_Log("Heap", "Foot %p = {Head:%p,Magic:%4C}", foot, foot->Head, &foot->Magic);
578 Log_Log("Heap", "%sowned by %s:%i",
579 (head->Magic==MAGIC_FREE?"was ":""), head->File, head->Line);
588 foot = (void*)( (tVAddr)gHeapEnd - sizeof(tHeapFoot) );
589 Log_Log("Heap", "==== Going Backwards ==== (from %p)", foot);
591 while( (tVAddr)head >= (tVAddr)badHead )
593 Log_Log("Heap", "%p (%P): 0x%08lx %i %4C",
594 head, MM_GetPhysAddr((Uint)head), head->Size, head->ValidSize, &head->Magic);
595 Log_Log("Heap", "%p %4C", foot->Head, &foot->Magic);
597 Log_Log("Heap", "%sowned by %s:%i",
598 (head->Magic!=MAGIC_USED?"was ":""),
599 head->File, head->Line);
602 // Sanity Check Header
603 if(head->Size == 0) {
604 Log_Warning("Heap", "HALTED - Size is zero");
607 if(head->Size & (MIN_SIZE-1)) {
608 Log_Warning("Heap", " - Size is malaligned (&0x%x)", ~(MIN_SIZE-1));
611 if(head->Magic != MAGIC_FREE && head->Magic != MAGIC_USED) {
612 Log_Warning("Heap", "HALTED - Head Magic is Bad");
617 if(foot->Magic != MAGIC_FOOT) {
618 Log_Warning("Heap", "HALTED - Foot Magic is Bad");
621 if(head != foot->Head) {
622 Log_Warning("Heap", "HALTED - Footer backlink is invalid");
626 if(head == badHead) break;
628 foot = (void*)( (tVAddr)head - sizeof(tHeapFoot) );
630 Log_Debug("Heap", "head=%p", head);
633 Panic("Heap_Dump - Heap is corrupted, kernel panic!");
638 void Heap_Stats(void)
645 int maxAlloc=0, minAlloc=-1;
646 int avgAlloc, frag, overhead;
648 for(head = gHeapStart;
649 (Uint)head < (Uint)gHeapEnd;
650 head = (void*)( (Uint)head + head->Size )
654 totalBytes += head->Size;
655 if( head->Magic == MAGIC_FREE )
658 freeBytes += head->Size;
660 else if( head->Magic == MAGIC_USED) {
661 if(maxAlloc < head->Size) maxAlloc = head->Size;
662 if(minAlloc == -1 || minAlloc > head->Size)
663 minAlloc = head->Size;
666 Log_Warning("Heap", "Magic on %p invalid, skipping remainder of heap", head);
670 // Print the block info?
672 if( head->Magic == MAGIC_FREE )
673 Log_Debug("Heap", "%p (%P) - 0x%x free",
674 head->Data, MM_GetPhysAddr((tVAddr)&head->Data), head->Size);
676 Log_Debug("Heap", "%p (%P) - 0x%x (%i) Owned by %s:%i (%lli ms old)",
677 head->Data, MM_GetPhysAddr((tVAddr)&head->Data), head->Size, head->ValidSize, head->File, head->Line,
678 now() - head->AllocateTime
683 Log_Log("Heap", "%i blocks (0x%x bytes)", nBlocks, totalBytes);
684 Log_Log("Heap", "%i free blocks (0x%x bytes)", nFree, freeBytes);
686 frag = (nFree-1)*10000/nBlocks;
689 Log_Log("Heap", "%i.%02i%% Heap Fragmentation", frag/100, frag%100);
690 avgAlloc = (totalBytes-freeBytes)/(nBlocks-nFree);
692 overhead = (sizeof(tHeapFoot)+sizeof(tHeapHead))*10000/avgAlloc;
695 Log_Log("Heap", "Average allocation: %i bytes, Average Overhead: %i.%02i%%",
696 avgAlloc, overhead/100, overhead%100
698 Log_Log("Heap", "Smallest Block: %i bytes, Largest: %i bytes",
701 // Scan and get distribution
707 } sizeCounts[nBlocks];
710 memset(sizeCounts, 0, nBlocks*sizeof(sizeCounts[0]));
712 for(head = gHeapStart;
713 (Uint)head < (Uint)gHeapEnd;
714 head = (void*)( (Uint)head + head->Size )
717 for( i = 0; i < nBlocks; i ++ ) {
718 if( sizeCounts[i].Size == 0 )
720 if( sizeCounts[i].Size == head->Size )
723 // Should never reach this part (in a non-concurrent case)
724 if( i == nBlocks ) continue;
725 sizeCounts[i].Size = head->Size;
726 sizeCounts[i].Count ++;
728 //Log("Heap_Stats: %i %p - 0x%x bytes (%s) (%i)", nBlocks, head,
729 // head->Size, (head->Magic==MAGIC_FREE?"FREE":"used"), i
731 //Log("Heap_Stats: sizeCounts[%i] = {Size:0x%x, Count: %i}", i,
732 // sizeCounts[i].Size, sizeCounts[i].Count);
736 for( i = 0; i < nBlocks && sizeCounts[i].Count; i ++ )
738 Log("Heap_Stats: 0x%x - %i blocks",
739 sizeCounts[i].Size, sizeCounts[i].Count
748 EXPORT(Heap_Allocate);
749 EXPORT(Heap_AllocateZero);
750 EXPORT(Heap_Reallocate);
751 EXPORT(Heap_Deallocate);
752 EXPORT(Heap_IsHeapAddr);