mirror of
https://github.com/Ninjdai1/pokeemerald.git
synced 2024-11-16 19:47:35 +01:00
230 lines
6.2 KiB
C
230 lines
6.2 KiB
C
#include "global.h"
|
|
#include "malloc.h"
|
|
#if TESTING
|
|
#include "test/test.h"
|
|
#endif
|
|
|
|
static void *sHeapStart;
|
|
static u32 sHeapSize;
|
|
|
|
void PutMemBlockHeader(void *block, struct MemBlock *prev, struct MemBlock *next, u32 size)
|
|
{
|
|
struct MemBlock *header = (struct MemBlock *)block;
|
|
|
|
header->allocated = FALSE;
|
|
header->locationHi = 0;
|
|
header->magic = MALLOC_SYSTEM_ID;
|
|
header->size = size;
|
|
header->locationLo = 0;
|
|
header->prev = prev;
|
|
header->next = next;
|
|
}
|
|
|
|
void PutFirstMemBlockHeader(void *block, u32 size)
|
|
{
|
|
PutMemBlockHeader(block, (struct MemBlock *)block, (struct MemBlock *)block, size - sizeof(struct MemBlock));
|
|
}
|
|
|
|
void *AllocInternal(void *heapStart, u32 size, const char *location)
|
|
{
|
|
struct MemBlock *pos = (struct MemBlock *)heapStart;
|
|
struct MemBlock *head = pos;
|
|
struct MemBlock *splitBlock;
|
|
u32 foundBlockSize;
|
|
|
|
// Alignment
|
|
if (size & 3)
|
|
size = 4 * ((size / 4) + 1);
|
|
|
|
for (;;) {
|
|
// Loop through the blocks looking for unused block that's big enough.
|
|
|
|
if (!pos->allocated) {
|
|
foundBlockSize = pos->size;
|
|
|
|
if (foundBlockSize >= size) {
|
|
if (foundBlockSize - size < 2 * sizeof(struct MemBlock)) {
|
|
// The block isn't much bigger than the requested size,
|
|
// so just use it.
|
|
pos->allocated = TRUE;
|
|
} else {
|
|
// The block is significantly bigger than the requested
|
|
// size, so split the rest into a separate block.
|
|
foundBlockSize -= sizeof(struct MemBlock);
|
|
foundBlockSize -= size;
|
|
|
|
splitBlock = (struct MemBlock *)(pos->data + size);
|
|
|
|
pos->allocated = TRUE;
|
|
pos->size = size;
|
|
|
|
PutMemBlockHeader(splitBlock, pos, pos->next, foundBlockSize);
|
|
|
|
pos->next = splitBlock;
|
|
|
|
if (splitBlock->next != head)
|
|
splitBlock->next->prev = splitBlock;
|
|
}
|
|
|
|
pos->locationHi = ((uintptr_t)location) >> 14;
|
|
pos->locationLo = (uintptr_t)location;
|
|
|
|
return pos->data;
|
|
}
|
|
}
|
|
|
|
if (pos->next == head)
|
|
{
|
|
#if TESTING
|
|
const struct MemBlock *head = HeapHead();
|
|
const struct MemBlock *block = head;
|
|
do
|
|
{
|
|
if (block->allocated)
|
|
{
|
|
const char *location = MemBlockLocation(block);
|
|
if (location)
|
|
MgbaPrintf_("%s: %d bytes allocated", location, block->size);
|
|
else
|
|
MgbaPrintf_("<unknown>: %d bytes allocated", block->size);
|
|
}
|
|
block = block->next;
|
|
}
|
|
while (block != head);
|
|
Test_ExitWithResult(TEST_RESULT_ERROR, "%s: OOM allocating %d bytes", location, size);
|
|
#endif
|
|
return NULL;
|
|
}
|
|
|
|
pos = pos->next;
|
|
}
|
|
}
|
|
|
|
void FreeInternal(void *heapStart, void *pointer)
|
|
{
|
|
if (pointer) {
|
|
struct MemBlock *head = (struct MemBlock *)heapStart;
|
|
struct MemBlock *block = (struct MemBlock *)((u8 *)pointer - sizeof(struct MemBlock));
|
|
block->allocated = FALSE;
|
|
|
|
// If the freed block isn't the last one, merge with the next block
|
|
// if it's not in use.
|
|
if (block->next != head) {
|
|
if (!block->next->allocated) {
|
|
block->size += sizeof(struct MemBlock) + block->next->size;
|
|
block->next->magic = 0;
|
|
block->next = block->next->next;
|
|
if (block->next != head)
|
|
block->next->prev = block;
|
|
}
|
|
}
|
|
|
|
// If the freed block isn't the first one, merge with the previous block
|
|
// if it's not in use.
|
|
if (block != head) {
|
|
if (!block->prev->allocated) {
|
|
block->prev->next = block->next;
|
|
|
|
if (block->next != head)
|
|
block->next->prev = block->prev;
|
|
|
|
block->magic = 0;
|
|
block->prev->size += sizeof(struct MemBlock) + block->size;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void *AllocZeroedInternal(void *heapStart, u32 size, const char *location)
|
|
{
|
|
void *mem = AllocInternal(heapStart, size, location);
|
|
|
|
if (mem != NULL) {
|
|
if (size & 3)
|
|
size = 4 * ((size / 4) + 1);
|
|
|
|
CpuFill32(0, mem, size);
|
|
}
|
|
|
|
return mem;
|
|
}
|
|
|
|
bool32 CheckMemBlockInternal(void *heapStart, void *pointer)
|
|
{
|
|
struct MemBlock *head = (struct MemBlock *)heapStart;
|
|
struct MemBlock *block = (struct MemBlock *)((u8 *)pointer - sizeof(struct MemBlock));
|
|
|
|
if (block->magic != MALLOC_SYSTEM_ID)
|
|
return FALSE;
|
|
|
|
if (block->next->magic != MALLOC_SYSTEM_ID)
|
|
return FALSE;
|
|
|
|
if (block->next != head && block->next->prev != block)
|
|
return FALSE;
|
|
|
|
if (block->prev->magic != MALLOC_SYSTEM_ID)
|
|
return FALSE;
|
|
|
|
if (block->prev != head && block->prev->next != block)
|
|
return FALSE;
|
|
|
|
if (block->next != head && block->next != (struct MemBlock *)(block->data + block->size))
|
|
return FALSE;
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
void InitHeap(void *heapStart, u32 heapSize)
|
|
{
|
|
sHeapStart = heapStart;
|
|
sHeapSize = heapSize;
|
|
PutFirstMemBlockHeader(heapStart, heapSize);
|
|
}
|
|
|
|
void *Alloc_(u32 size, const char *location)
|
|
{
|
|
return AllocInternal(sHeapStart, size, location);
|
|
}
|
|
|
|
void *AllocZeroed_(u32 size, const char *location)
|
|
{
|
|
return AllocZeroedInternal(sHeapStart, size, location);
|
|
}
|
|
|
|
void Free(void *pointer)
|
|
{
|
|
FreeInternal(sHeapStart, pointer);
|
|
}
|
|
|
|
bool32 CheckMemBlock(void *pointer)
|
|
{
|
|
return CheckMemBlockInternal(sHeapStart, pointer);
|
|
}
|
|
|
|
bool32 CheckHeap()
|
|
{
|
|
struct MemBlock *pos = (struct MemBlock *)sHeapStart;
|
|
|
|
do {
|
|
if (!CheckMemBlockInternal(sHeapStart, pos->data))
|
|
return FALSE;
|
|
pos = pos->next;
|
|
} while (pos != (struct MemBlock *)sHeapStart);
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
const struct MemBlock *HeapHead(void)
|
|
{
|
|
return (const struct MemBlock *)sHeapStart;
|
|
}
|
|
|
|
const char *MemBlockLocation(const struct MemBlock *block)
|
|
{
|
|
if (!block->allocated)
|
|
return NULL;
|
|
|
|
return (const char *)(ROM_START | (block->locationHi << 14) | block->locationLo);
|
|
}
|