toybchan/minimal-heap
1
0
Fork 0
mirror of https://github.com/ToyB-Chan/minimal-heap.git synced 2026-07-13 21:51:16 +02:00
Code Issues Packages Projects Releases Wiki Activity

changed the way areas are inserted and deleted, making heap compact itself automatically after massive frees

Browse Source
This commit is contained in:
toybchan
2026-06-10 08:15:53 +02:00
parent 57cbacda15
commit 17df4f1f85
1 changed files with 18 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
minimal_heap_implementation.inl
View File

@@ -185,9 +185,10 @@ void* MIHP_Allocate(MIHP_Heap* heap, size_t size)
} while (nextSegment != currentArea->LastSuccessfulAllocationSegment); } while (nextSegment != currentArea->LastSuccessfulAllocationSegment);
} while (nextArea != heap->LastSuccessfulAllocationArea); } while (nextArea != heap->LastSuccessfulAllocationArea);
/* No free segment found (in time), allocate new area */ ///
/// No free segment found (in time), allocate new area
///
size_t newAreaSize = heap->Stats.TotalSize / 4; // growth-rate of 1.25 size_t newAreaSize = heap->Stats.TotalSize / 4; // growth-rate of 1.25
while (newAreaSize < size) while (newAreaSize < size)
@@ -200,12 +201,19 @@ void* MIHP_Allocate(MIHP_Heap* heap, size_t size)
return NULL; return NULL;
} }
newArea->NextArea = heap->FirstArea; // Insert new area one after first area, since the first area is always kept and should be the smallest
heap->FirstArea->PreviousArea = newArea;
heap->FirstArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, heap->FirstArea);
heap->FirstArea = newArea; newArea->PreviousArea = heap->FirstArea;
heap->LastSuccessfulAllocationArea = newArea; newArea->NextArea = heap->FirstArea->NextArea;
if (heap->FirstArea->NextArea)
{
heap->FirstArea->NextArea->PreviousArea = newArea;
heap->FirstArea->NextArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, heap->FirstArea->NextArea);
}
heap->FirstArea->NextArea = newArea;
heap->FirstArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, heap->FirstArea);
newArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, newArea); newArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, newArea);
MIHP_UnlockHeap(heap); MIHP_UnlockHeap(heap);
@@ -330,7 +338,7 @@ bool MIHP_Free(MIHP_Heap* heap, void* ptr)
heap->Stats.NumTotalOccupiedSegments--; heap->Stats.NumTotalOccupiedSegments--;
if (area->NumOccupiedSegments == 0 && heap->Stats.NumMemoryAreas > 1) if (area->NumOccupiedSegments == 0 && area != heap->FirstArea)
{ {
MIHP_HeapMemoryAreaHeader* prevArea = area->PreviousArea; MIHP_HeapMemoryAreaHeader* prevArea = area->PreviousArea;
MIHP_HeapMemoryAreaHeader* nextArea = area->NextArea; MIHP_HeapMemoryAreaHeader* nextArea = area->NextArea;
@@ -351,11 +359,8 @@ bool MIHP_Free(MIHP_Heap* heap, void* ptr)
nextArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, nextArea); nextArea->Checksum = MIHP_GenerateHeapMemoryAreaChecksum(heap, nextArea);
} }
if (heap->FirstArea == area)
heap->FirstArea = nextArea;
if (heap->LastSuccessfulAllocationArea == area) if (heap->LastSuccessfulAllocationArea == area)
heap->LastSuccessfulAllocationArea = nextArea; heap->LastSuccessfulAllocationArea = heap->FirstArea;
MIHP_UnlockHeap(heap); MIHP_UnlockHeap(heap);
return true; return true;