forked from Telodendria/Telodendria
Jordan Bancino
bcff59bacb
This will eventually enable us to get memory information in O(1) time. Right now, we're still O(n) because MemoryInfoGet() still has to check to see if the allocation is known or not.
320 lines
5.2 KiB
C
320 lines
5.2 KiB
C
/*
|
|
* Copyright (C) 2022 Jordan Bancino <@jordan:bancino.net>
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person
|
|
* obtaining a copy of this software and associated documentation files
|
|
* (the "Software"), to deal in the Software without restriction,
|
|
* including without limitation the rights to use, copy, modify, merge,
|
|
* publish, distribute, sublicense, and/or sell copies of the Software,
|
|
* and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*/
|
|
#include <Memory.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <pthread.h>
|
|
|
|
struct MemoryInfo
|
|
{
|
|
size_t size;
|
|
const char *file;
|
|
int line;
|
|
|
|
MemoryInfo *next;
|
|
MemoryInfo *prev;
|
|
};
|
|
|
|
static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
|
|
static MemoryInfo *lastAllocation = NULL;
|
|
static void (*hook) (MemoryAction, MemoryInfo *, void *) = NULL;
|
|
static void *hookArgs = NULL;
|
|
|
|
void *
|
|
MemoryAllocate(size_t size, const char *file, int line)
|
|
{
|
|
MemoryInfo *a;
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
a = malloc(sizeof(MemoryInfo) + size);
|
|
if (!a)
|
|
{
|
|
pthread_mutex_unlock(&lock);
|
|
return NULL;
|
|
}
|
|
|
|
a->size = sizeof(MemoryInfo) + size;
|
|
a->file = file;
|
|
a->line = line;
|
|
a->next = NULL;
|
|
a->prev = lastAllocation;
|
|
|
|
if (lastAllocation)
|
|
{
|
|
lastAllocation->next = a;
|
|
}
|
|
|
|
lastAllocation = a;
|
|
|
|
if (hook)
|
|
{
|
|
hook(MEMORY_ALLOCATE, a, hookArgs);
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
return MemoryInfoGetPointer(a);
|
|
}
|
|
|
|
void *
|
|
MemoryReallocate(void *p, size_t size)
|
|
{
|
|
MemoryInfo *a;
|
|
void *new = NULL;
|
|
|
|
a = MemoryInfoGet(p);
|
|
|
|
if (!a)
|
|
{
|
|
if (hook)
|
|
{
|
|
hook(MEMORY_BAD_POINTER, NULL, hookArgs);
|
|
}
|
|
pthread_mutex_unlock(&lock);
|
|
return NULL;
|
|
}
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
new = realloc(a, sizeof(MemoryInfo) + size);
|
|
if (!new)
|
|
{
|
|
pthread_mutex_unlock(&lock);
|
|
return NULL;
|
|
}
|
|
a = new;
|
|
a->size = sizeof(MemoryInfo) + size;
|
|
|
|
if (a->prev)
|
|
{
|
|
a->prev->next = a;
|
|
}
|
|
else
|
|
{
|
|
lastAllocation = a;
|
|
}
|
|
|
|
if (a->next)
|
|
{
|
|
a->next->prev = a;
|
|
}
|
|
else
|
|
{
|
|
lastAllocation = a;
|
|
}
|
|
|
|
if (hook)
|
|
{
|
|
hook(MEMORY_REALLOCATE, a, hookArgs);
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
|
|
return MemoryInfoGetPointer(a);
|
|
}
|
|
|
|
void
|
|
MemoryFree(void *p)
|
|
{
|
|
MemoryInfo *a;
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
a = MemoryInfoGet(p);
|
|
if (!a)
|
|
{
|
|
if (hook)
|
|
{
|
|
hook(MEMORY_BAD_POINTER, NULL, hookArgs);
|
|
}
|
|
pthread_mutex_unlock(&lock);
|
|
return;
|
|
}
|
|
|
|
if (a->prev)
|
|
{
|
|
a->prev->next = a->next;
|
|
}
|
|
else
|
|
{
|
|
lastAllocation = a->next;
|
|
}
|
|
|
|
if (a->next)
|
|
{
|
|
a->next->prev = a->prev;
|
|
}
|
|
else
|
|
{
|
|
lastAllocation = a->prev;
|
|
}
|
|
|
|
if (hook)
|
|
{
|
|
hook(MEMORY_FREE, a, hookArgs);
|
|
}
|
|
|
|
free(a);
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
}
|
|
|
|
size_t
|
|
MemoryAllocated(void)
|
|
{
|
|
MemoryInfo *a;
|
|
size_t total = 0;
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
a = lastAllocation;
|
|
while (a)
|
|
{
|
|
total += a->size;
|
|
a = a->prev;
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
|
|
return total;
|
|
}
|
|
|
|
void
|
|
MemoryFreeAll(void)
|
|
{
|
|
MemoryInfo *a;
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
a = lastAllocation;
|
|
while (a)
|
|
{
|
|
MemoryInfo *prev = a->prev;
|
|
|
|
free(a);
|
|
a = prev;
|
|
}
|
|
|
|
lastAllocation = NULL;
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
}
|
|
|
|
MemoryInfo *
|
|
MemoryInfoGet(void *p)
|
|
{
|
|
MemoryInfo *a;
|
|
|
|
if (!p)
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
p = &(((MemoryInfo *) p)[-1]);
|
|
|
|
a = lastAllocation;
|
|
|
|
while (a)
|
|
{
|
|
if (a == p)
|
|
{
|
|
break;
|
|
}
|
|
|
|
a = a->prev;
|
|
}
|
|
|
|
return a;
|
|
}
|
|
|
|
size_t
|
|
MemoryInfoGetSize(MemoryInfo * a)
|
|
{
|
|
if (!a)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
return a->size;
|
|
}
|
|
|
|
const char *
|
|
MemoryInfoGetFile(MemoryInfo * a)
|
|
{
|
|
if (!a)
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
return a->file;
|
|
}
|
|
|
|
int
|
|
MemoryInfoGetLine(MemoryInfo * a)
|
|
{
|
|
if (!a)
|
|
{
|
|
return -1;
|
|
}
|
|
|
|
return a->line;
|
|
}
|
|
|
|
void *
|
|
MemoryInfoGetPointer(MemoryInfo * a)
|
|
{
|
|
if (!a)
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
return &(a[1]);
|
|
}
|
|
|
|
void
|
|
MemoryIterate(void (*iterFunc) (MemoryInfo *, void *), void *args)
|
|
{
|
|
MemoryInfo *a;
|
|
|
|
pthread_mutex_lock(&lock);
|
|
|
|
a = lastAllocation;
|
|
while (a)
|
|
{
|
|
iterFunc(a, args);
|
|
a = a->prev;
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock);
|
|
}
|
|
|
|
void
|
|
MemoryHook(void (*memHook) (MemoryAction, MemoryInfo *, void *), void *args)
|
|
{
|
|
pthread_mutex_lock(&lock);
|
|
hook = memHook;
|
|
hookArgs = args;
|
|
pthread_mutex_unlock(&lock);
|
|
}
|