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

tweaked heuristics

Browse Source
This commit is contained in:
toybchan
2026-06-09 19:25:07 +02:00
parent b6bc80cf22
commit 3582e21a84
2 changed files with 12 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
minimal_heap_implementation.inl
View File

@@ -108,8 +108,9 @@ void* MIHP_Allocate(MIHP_Heap* heap, size_t size)
MIHP_HeapSegmentHeader* nextSegment = currentArea->FirstSegment;
while (nextSegment)
{
if (numTraversedSegments * 100 > heap->Stats.NumTotalSegments * 80)
goto AllocateNewArea;
if (numTraversedSegments > MIHP_MIN_TRAVERSELS_BEFORE_EXPANSION)
if (numTraversedSegments * 100 > heap->Stats.NumTotalOccupiedSegments * MIHP_MIN_EXPANSION_TRAVERSEL_OCCUPIED_INT_PERCENT)
goto AllocateNewArea;
numTraversedSegments++;