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 order areas are traversed

Browse Source
This commit is contained in:
toybchan
2026-06-09 19:41:06 +02:00
parent 3582e21a84
commit 2150fcb0a2
2 changed files with 8 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
minimal_heap.h
View File

@@ -25,8 +25,8 @@
#define MIHP_MIN_TRAVERSELS_BEFORE_EXPANSION 10000 #define MIHP_MIN_TRAVERSELS_BEFORE_EXPANSION 10000
#endif #endif
#ifndef MIHP_EXPANSION_TRAVERSEL_OCCUPIED_INT_PERCENT #ifndef MIHP_MIN_EXPANSION_TRAVERSEL_OCCUPIED_INT_PERCENT
#define MIHP_EXPANSION_TRAVERSEL_OCCUPIED_INT_PERCENT 50 #define MIHP_MIN_EXPANSION_TRAVERSEL_OCCUPIED_INT_PERCENT 50
#endif #endif
#ifndef MIHP_ASSERT #ifndef MIHP_ASSERT

19
minimal_heap_implementation.inl
View File

@@ -85,20 +85,13 @@ void* MIHP_Allocate(MIHP_Heap* heap, size_t size)
bool triedLastAllocationArea = false; bool triedLastAllocationArea = false;
MIHP_HeapMemoryAreaHeader* nextArea = heap->FirstArea; MIHP_HeapMemoryAreaHeader* nextArea = heap->FirstArea;
while (nextArea) do
{ {
MIHP_HeapMemoryAreaHeader* currentArea = NULL; MIHP_HeapMemoryAreaHeader* currentArea = nextArea;
if (!triedLastAllocationArea)
{
currentArea = heap->LastSuccessfulAllocationArea;
triedLastAllocationArea = true;
}
else
{
currentArea = nextArea;
nextArea = currentArea->NextArea; nextArea = currentArea->NextArea;
}
if (nextArea == NULL)
nextArea = heap->FirstArea;
MIHP_ValidateHeapMemoryAreaHeader(heap, currentArea); MIHP_ValidateHeapMemoryAreaHeader(heap, currentArea);
@@ -147,7 +140,7 @@ void* MIHP_Allocate(MIHP_Heap* heap, size_t size)
return data; return data;
} }
} } while (nextArea != heap->LastSuccessfulAllocationArea);
AllocateNewArea: AllocateNewArea:
size_t newAreaSize = heap->Stats.TotalSize; size_t newAreaSize = heap->Stats.TotalSize;