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

uintptr_t

Browse Source
This commit is contained in:
toybchan
2026-06-10 22:41:41 +02:00
parent 17df4f1f85
commit e75b551159
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
minimal_heap_implementation.inl
View File

@@ -453,7 +453,7 @@ bool MIHP_IsPointerInHeap(MIHP_Heap* heap, void* ptr)
MIHP_LockHeap(heap); MIHP_LockHeap(heap);
size_t searchingPtr = (size_t)ptr; uintptr_t searchingPtr = (uintptr_t)ptr;
MIHP_HeapMemoryAreaHeader* nextArea = heap->FirstArea; MIHP_HeapMemoryAreaHeader* nextArea = heap->FirstArea;
while (nextArea) while (nextArea)
@@ -462,8 +462,8 @@ bool MIHP_IsPointerInHeap(MIHP_Heap* heap, void* ptr)
MIHP_ValidateHeapMemoryAreaHeader(heap, currentArea); MIHP_ValidateHeapMemoryAreaHeader(heap, currentArea);
nextArea = currentArea->NextArea; nextArea = currentArea->NextArea;
size_t ptrMin = (size_t)currentArea; uintptr_t ptrMin = (uintptr_t)currentArea;
size_t ptrMax = (size_t)currentArea + currentArea->AreaSize; uintptr_t ptrMax = (uintptr_t)currentArea + currentArea->AreaSize;
if (searchingPtr >= ptrMin && searchingPtr <= ptrMax) if (searchingPtr >= ptrMin && searchingPtr <= ptrMax)
{ {