allocator remake
This commit is contained in:
parent
3f0a0cb9de
commit
4e6a1106fa
|
@ -120,6 +120,7 @@ IF(WIN32)
|
||||||
ADD_DEFINITIONS(-DWIN32_NO_CONSOLE)
|
ADD_DEFINITIONS(-DWIN32_NO_CONSOLE)
|
||||||
ELSE(WIN32)
|
ELSE(WIN32)
|
||||||
SET(SOURCES ${SOURCES} src/framework/platform/x11platform.cpp)
|
SET(SOURCES ${SOURCES} src/framework/platform/x11platform.cpp)
|
||||||
|
ADD_DEFINITIONS(-D_DEBUG_MEMORY)
|
||||||
SET(ADDITIONAL_LIBRARIES pthread GLU)
|
SET(ADDITIONAL_LIBRARIES pthread GLU)
|
||||||
ENDIF(WIN32)
|
ENDIF(WIN32)
|
||||||
|
|
||||||
|
|
|
@ -1,28 +1,39 @@
|
||||||
|
#ifdef _DEBUG_MEMORY
|
||||||
|
|
||||||
#include "allocator.h"
|
#include "allocator.h"
|
||||||
|
|
||||||
#include <ucontext.h>
|
#include <cstdio>
|
||||||
|
#include <cstdlib>
|
||||||
#include <execinfo.h>
|
#include <execinfo.h>
|
||||||
|
|
||||||
#if defined(REG_EIP)
|
bool allocatorEnabled = false;
|
||||||
# define MACHINE_X86
|
Allocator *allocator = NULL;
|
||||||
# define REGFORMAT "0x%08x"
|
|
||||||
# define ADDRTYPE unsigned int
|
|
||||||
#elif defined(REG_RIP)
|
|
||||||
# define MACHINE_X86_64
|
|
||||||
# define REGFORMAT "0x%016lx"
|
|
||||||
# define ADDRTYPE long unsigned int
|
|
||||||
#endif
|
|
||||||
|
|
||||||
Allocator Allocator::m_instance __attribute__((init_priority(101)));
|
void disableAllocator() { allocatorEnabled = false; }
|
||||||
|
void enableAllocator() { allocatorEnabled = true; }
|
||||||
|
bool isAllocatorEnabled() { return allocatorEnabled; }
|
||||||
|
|
||||||
static void addr2line(ADDRTYPE address, const char* name, bool viewSource = false)
|
class Initializer {
|
||||||
|
public:
|
||||||
|
Initializer() {
|
||||||
|
allocator = new Allocator;
|
||||||
|
enableAllocator();
|
||||||
|
}
|
||||||
|
~Initializer() {
|
||||||
|
disableAllocator();
|
||||||
|
Allocator *tmp = allocator;
|
||||||
|
allocator = NULL;
|
||||||
|
delete tmp;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
Initializer initializer __attribute__((init_priority(101)));
|
||||||
|
|
||||||
|
static void addr2line(void *address, const char* name, bool viewSource = false)
|
||||||
{
|
{
|
||||||
char tmpbuf[1024];
|
char tmpbuf[1024];
|
||||||
char *pos;
|
char *pos;
|
||||||
|
|
||||||
printf(REGFORMAT": ", address);
|
snprintf(tmpbuf, sizeof(tmpbuf), "addr2line --functions --demangle -e %s %p", name, address);
|
||||||
|
|
||||||
snprintf(tmpbuf, sizeof(tmpbuf), "addr2line --functions --demangle -e %s "REGFORMAT, name, address);
|
|
||||||
|
|
||||||
FILE *output = popen(tmpbuf, "r");
|
FILE *output = popen(tmpbuf, "r");
|
||||||
if(output) {
|
if(output) {
|
||||||
|
@ -95,44 +106,43 @@ static void addr2line(ADDRTYPE address, const char* name, bool viewSource = fals
|
||||||
printf("\n");
|
printf("\n");
|
||||||
}
|
}
|
||||||
|
|
||||||
Allocator::Allocator() : m_inside(false)
|
Allocator::Allocator()
|
||||||
{
|
{
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
Allocator::~Allocator()
|
Allocator::~Allocator()
|
||||||
{
|
{
|
||||||
|
#ifdef _REENTRANT
|
||||||
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
||||||
|
#endif
|
||||||
|
|
||||||
dumpLeaks();
|
dumpLeaks();
|
||||||
|
|
||||||
m_inside = true;
|
disableAllocator();
|
||||||
|
|
||||||
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
||||||
AllocationBlock* block = (*it);
|
AllocationBlock* block = (*it);
|
||||||
block->~AllocationBlock();
|
free(block->backtraceBuffer);
|
||||||
free(block);
|
free(block);
|
||||||
}
|
}
|
||||||
m_allocationsBlocks.clear();
|
m_allocationsBlocks.clear();
|
||||||
m_allocationAddresses.clear();
|
|
||||||
|
|
||||||
m_inside = false;
|
enableAllocator();
|
||||||
}
|
}
|
||||||
|
|
||||||
//TODO: dump leaks to a file
|
|
||||||
void Allocator::dumpLeaks()
|
void Allocator::dumpLeaks()
|
||||||
{
|
{
|
||||||
|
#ifdef _REENTRANT
|
||||||
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
||||||
|
#endif
|
||||||
|
|
||||||
m_inside = true;
|
disableAllocator();
|
||||||
|
|
||||||
if(m_allocationAddresses.size() > 0) {
|
|
||||||
uint32_t definitelyLostBytes = 0;
|
|
||||||
uint32_t blockNumber = 1;
|
|
||||||
uint32_t countRecords = 0;
|
|
||||||
uint32_t numberOfLeakedBlocks = 0;
|
|
||||||
uint32_t numberOfBlocks = m_allocationsBlocks.size();
|
|
||||||
|
|
||||||
|
unsigned int definitelyLostBytes = 0;
|
||||||
|
unsigned int blockNumber = 1;
|
||||||
|
unsigned int countRecords = 0;
|
||||||
|
unsigned int numberOfLeakedBlocks = 0;
|
||||||
|
unsigned int numberOfBlocks = m_allocationsBlocks.size();
|
||||||
|
|
||||||
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
||||||
AllocationBlock* block = (*it);
|
AllocationBlock* block = (*it);
|
||||||
|
@ -141,11 +151,12 @@ void Allocator::dumpLeaks()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if(numberOfLeakedBlocks > 0) {
|
||||||
printf("== LOST BLOCKS:\n");
|
printf("== LOST BLOCKS:\n");
|
||||||
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
||||||
AllocationBlock* block = (*it);
|
AllocationBlock* block = (*it);
|
||||||
if(block->records != 0) {
|
if(block->records != 0) {
|
||||||
uint32_t lostBytes = block->bytes * block->records;
|
unsigned int lostBytes = block->bytes * block->records;
|
||||||
|
|
||||||
definitelyLostBytes += lostBytes;
|
definitelyLostBytes += lostBytes;
|
||||||
countRecords += block->records;
|
countRecords += block->records;
|
||||||
|
@ -161,7 +172,7 @@ void Allocator::dumpLeaks()
|
||||||
printf("\tby ");
|
printf("\tby ");
|
||||||
}
|
}
|
||||||
std::string str = strings[i];
|
std::string str = strings[i];
|
||||||
addr2line((ADDRTYPE)block->backtraceBuffer[i], str.substr(0, str.find('(')).c_str());
|
addr2line(block->backtraceBuffer[i], str.substr(0, str.find('(')).c_str());
|
||||||
}
|
}
|
||||||
printf("\n");
|
printf("\n");
|
||||||
free(strings);
|
free(strings);
|
||||||
|
@ -176,7 +187,7 @@ void Allocator::dumpLeaks()
|
||||||
printf("leaked blocks: %d in %d blocks\n", numberOfLeakedBlocks, numberOfBlocks);
|
printf("leaked blocks: %d in %d blocks\n", numberOfLeakedBlocks, numberOfBlocks);
|
||||||
}
|
}
|
||||||
|
|
||||||
m_inside = false;
|
enableAllocator();
|
||||||
}
|
}
|
||||||
|
|
||||||
void printBacktrace()
|
void printBacktrace()
|
||||||
|
@ -191,137 +202,128 @@ void printBacktrace()
|
||||||
printf("\tat ");
|
printf("\tat ");
|
||||||
}
|
}
|
||||||
std::string str = strings[i];
|
std::string str = strings[i];
|
||||||
addr2line((ADDRTYPE)buffer[i], str.substr(0, str.find('(')).c_str());
|
addr2line(buffer[i], str.substr(0, str.find('(')).c_str());
|
||||||
}
|
}
|
||||||
printf("\n");
|
printf("\n");
|
||||||
free(strings);
|
free(strings);
|
||||||
}
|
}
|
||||||
|
|
||||||
//TODO: dump allocator memory stats by blocks to a file
|
AllocationBlock* Allocator::findBlock(void **backtraceBuffer, int backtraceSize, unsigned int bytes)
|
||||||
|
|
||||||
AllocationBlock* Allocator::findBlock(void **backtraceBuffer, int backtraceSize, uint32_t bytes)
|
|
||||||
{
|
{
|
||||||
for(AllocationBlocksList::iterator it = m_allocationsBlocks.begin(), end = m_allocationsBlocks.end(); it != end; ++it) {
|
AllocationBlock blockToFind;
|
||||||
AllocationBlock* block = (*it);
|
blockToFind.backtraceBuffer = backtraceBuffer;
|
||||||
|
blockToFind.backtraceSize = backtraceSize;
|
||||||
|
blockToFind.bytes = bytes;
|
||||||
|
|
||||||
if(block->bytes != bytes || block->backtraceSize != backtraceSize) {
|
auto it = m_allocationsBlocks.find(&blockToFind);
|
||||||
continue;
|
if(it != m_allocationsBlocks.end())
|
||||||
}
|
return (*it);
|
||||||
|
|
||||||
bool isSame = true;
|
|
||||||
for(int i = 0; i < backtraceSize; i++) {
|
|
||||||
if(block->backtraceBuffer[i] != backtraceBuffer[i]) {
|
|
||||||
isSame = false;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if(isSame) {
|
|
||||||
return block;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
void *Allocator::allocate(size_t bytes)
|
void *Allocator::allocate(size_t bytes)
|
||||||
{
|
{
|
||||||
|
#ifdef _REENTRANT
|
||||||
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
||||||
|
#endif
|
||||||
|
|
||||||
if(m_inside) {
|
if(!isAllocatorEnabled()) {
|
||||||
return malloc(bytes);
|
return malloc(bytes);
|
||||||
} else {
|
} else {
|
||||||
void* p = malloc(bytes + sizeof(ADDRTYPE));
|
disableAllocator();
|
||||||
void* p2 = (void*)((ADDRTYPE)p + sizeof(ADDRTYPE));
|
|
||||||
|
|
||||||
m_inside = true;
|
void* p = malloc(bytes + sizeof(void *));
|
||||||
|
void* usedPtr = (void *)((char *)p + sizeof(void *));
|
||||||
static void* buffer[128];
|
static void *buffer[128];
|
||||||
int size = backtrace(buffer, 128);
|
int size = backtrace(buffer, 128);
|
||||||
|
AllocationBlock* block = findBlock(&buffer[1], size - 1, bytes);
|
||||||
|
|
||||||
AllocationBlock* block = findBlock(&buffer[1], size-1, bytes);
|
|
||||||
if(!block) {
|
if(!block) {
|
||||||
block = (AllocationBlock *) malloc(sizeof(AllocationBlock));
|
block = (AllocationBlock *)malloc(sizeof(AllocationBlock));
|
||||||
|
|
||||||
block->backtraceBuffer = (void**) malloc((sizeof(void*)) * (size - 1));
|
block->backtraceBuffer = (void **)malloc(sizeof(void*) * (size - 1));
|
||||||
block->backtraceSize = size-1;
|
block->backtraceSize = size - 1;
|
||||||
block->bytes = bytes;
|
block->bytes = bytes;
|
||||||
block->records = 0;
|
block->records = 0;
|
||||||
|
|
||||||
for(int i=0;i<size-1;i++) {
|
for(int i=0;i<size-1;i++)
|
||||||
block->backtraceBuffer[i] = buffer[i+1];
|
block->backtraceBuffer[i] = buffer[i+1];
|
||||||
}
|
|
||||||
|
|
||||||
m_allocationsBlocks.push_front(block);
|
m_allocationsBlocks.insert(block);
|
||||||
}
|
}
|
||||||
block->records += 1;
|
block->records += 1;
|
||||||
|
*((void **)p) = (void *)block;
|
||||||
|
|
||||||
m_allocationAddresses.push_front(block);
|
enableAllocator();
|
||||||
*(ADDRTYPE *)p = (ADDRTYPE)m_allocationAddresses.begin()._M_node;
|
return usedPtr;
|
||||||
|
|
||||||
m_inside = false;
|
|
||||||
|
|
||||||
return p2;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void Allocator::deallocate(void* p)
|
void Allocator::deallocate(void *p)
|
||||||
{
|
{
|
||||||
|
#ifdef _REENTRANT
|
||||||
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
boost::recursive_mutex::scoped_lock lock(m_allocatorLock);
|
||||||
|
#endif
|
||||||
|
|
||||||
if(m_inside) {
|
if(!isAllocatorEnabled()) {
|
||||||
free(p);
|
free(p);
|
||||||
} else if(p == NULL) {
|
} else if(p == NULL) {
|
||||||
m_inside = true;
|
disableAllocator();
|
||||||
|
|
||||||
printf("attempt to delete NULL address\n");
|
printf("attempt to delete NULL address\n");
|
||||||
printBacktrace();
|
printBacktrace();
|
||||||
|
|
||||||
m_inside = false;
|
enableAllocator();
|
||||||
return;
|
|
||||||
} else {
|
} else {
|
||||||
void *p2 = (void*)((ADDRTYPE)p - sizeof(ADDRTYPE));
|
disableAllocator();
|
||||||
|
|
||||||
if(!m_inside) {
|
void *allocatedPtr = (void *)((char *)p - sizeof(void *));
|
||||||
m_inside = true;
|
AllocationBlock *block = (AllocationBlock *)(*((void **)allocatedPtr));
|
||||||
|
|
||||||
AllocationsAddressesMap::iterator it((std::__detail::_List_node_base*)(*(ADDRTYPE*)p2));
|
block->records--;
|
||||||
|
memset(allocatedPtr, 0, block->bytes + sizeof(void *));
|
||||||
|
|
||||||
AllocationBlock* block = (*it);
|
free(allocatedPtr);
|
||||||
block->records -= 1;
|
|
||||||
memset(p2, 0x00, block->bytes);
|
|
||||||
|
|
||||||
m_allocationAddresses.erase(it);
|
enableAllocator();
|
||||||
|
|
||||||
m_inside = false;
|
|
||||||
|
|
||||||
free(p2);
|
|
||||||
} else {
|
|
||||||
free(p);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void* operator new(size_t bytes, int dummy)
|
void *operator new(size_t bytes, int dummy)
|
||||||
{
|
{
|
||||||
return Allocator::instance()->allocate(bytes);
|
if(allocator)
|
||||||
|
return allocator->allocate(bytes);
|
||||||
|
return malloc(bytes);
|
||||||
}
|
}
|
||||||
|
|
||||||
void* operator new(size_t bytes)
|
void *operator new(size_t bytes)
|
||||||
{
|
{
|
||||||
return Allocator::instance()->allocate(bytes);
|
if(allocator)
|
||||||
|
return allocator->allocate(bytes);
|
||||||
|
return malloc(bytes);
|
||||||
}
|
}
|
||||||
|
|
||||||
void* operator new[](size_t bytes)
|
void *operator new[](size_t bytes)
|
||||||
{
|
{
|
||||||
return Allocator::instance()->allocate(bytes);
|
if(allocator)
|
||||||
|
return allocator->allocate(bytes);
|
||||||
|
return malloc(bytes);
|
||||||
}
|
}
|
||||||
|
|
||||||
void operator delete(void *p)
|
void operator delete(void *p)
|
||||||
{
|
{
|
||||||
Allocator::instance()->deallocate(p);
|
if(allocator)
|
||||||
|
allocator->deallocate(p);
|
||||||
|
else
|
||||||
|
free(p);
|
||||||
}
|
}
|
||||||
|
|
||||||
void operator delete[](void* p)
|
void operator delete[](void *p)
|
||||||
{
|
{
|
||||||
Allocator::instance()->deallocate(p);
|
if(allocator)
|
||||||
|
allocator->deallocate(p);
|
||||||
|
else
|
||||||
|
free(p);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#endif // _DEBUG_MEMORY
|
||||||
|
|
|
@ -1,31 +1,57 @@
|
||||||
#ifndef __ALLOCATOR_H__
|
#ifndef __ALLOCATOR_H__
|
||||||
#define __ALLOCATOR_H__
|
#define __ALLOCATOR_H__
|
||||||
|
|
||||||
#include <stdint.h>
|
#ifdef _DEBUG_MEMORY
|
||||||
#include <stdlib.h>
|
|
||||||
#include <list>
|
|
||||||
#include <boost/thread.hpp>
|
|
||||||
|
|
||||||
class Allocator;
|
#include <unordered_set>
|
||||||
|
|
||||||
|
#ifdef _REENTRANT
|
||||||
|
#include <boost/thread.hpp>
|
||||||
|
#endif
|
||||||
|
|
||||||
struct AllocationBlock
|
struct AllocationBlock
|
||||||
{
|
{
|
||||||
~AllocationBlock() { free(backtraceBuffer); }
|
unsigned int bytes;
|
||||||
|
|
||||||
uint32_t bytes;
|
|
||||||
uint32_t records;
|
|
||||||
void** backtraceBuffer;
|
void** backtraceBuffer;
|
||||||
uint8_t backtraceSize;
|
unsigned char backtraceSize;
|
||||||
|
unsigned int records;
|
||||||
friend class Allocator;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
//TODO: allocattion tags
|
struct block_hash : std::unary_function<AllocationBlock *, std::size_t> {
|
||||||
/*
|
std::size_t operator()(const AllocationBlock *block) const {
|
||||||
struct AllocationTag
|
struct HashKey {
|
||||||
{
|
unsigned int bytes;
|
||||||
std::_List_node_base *listNode;
|
void *backtraceTop[3];
|
||||||
};*/
|
unsigned char backtraceSize;
|
||||||
|
} hashKey;
|
||||||
|
|
||||||
|
hashKey.bytes = block->bytes;
|
||||||
|
for(int i=0;i<3;++i) {
|
||||||
|
if(i < block->backtraceSize)
|
||||||
|
hashKey.backtraceTop[i] = block->backtraceBuffer[i];
|
||||||
|
else
|
||||||
|
hashKey.backtraceTop[i] = NULL;
|
||||||
|
}
|
||||||
|
hashKey.backtraceSize = block->backtraceSize;
|
||||||
|
|
||||||
|
//std::hash<HashKey> hasher;
|
||||||
|
return 1;//hasher(hashKey);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
struct block_equal_to : std::binary_function<AllocationBlock *, AllocationBlock *, bool> {
|
||||||
|
bool operator()(const AllocationBlock* a, const AllocationBlock *b) const
|
||||||
|
{
|
||||||
|
if(a->bytes != b->bytes || a->backtraceSize != b->backtraceSize)
|
||||||
|
return false;
|
||||||
|
for(int i=0;i<a->backtraceSize;++i)
|
||||||
|
if(a->backtraceBuffer[i] != b->backtraceBuffer[i])
|
||||||
|
return false;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
//TODO: use mem tags
|
||||||
|
|
||||||
class Allocator
|
class Allocator
|
||||||
{
|
{
|
||||||
|
@ -34,34 +60,28 @@ public:
|
||||||
~Allocator();
|
~Allocator();
|
||||||
|
|
||||||
void *allocate(size_t bytes);
|
void *allocate(size_t bytes);
|
||||||
void deallocate(void* p);
|
void deallocate(void *p);
|
||||||
|
|
||||||
void dumpLeaks();
|
void dumpLeaks();
|
||||||
|
|
||||||
static Allocator* instance() {
|
|
||||||
return &m_instance;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
private:
|
||||||
AllocationBlock* findBlock(void **backtrace, int backtraceSize, uint32_t bytes);
|
AllocationBlock* findBlock(void** backtraceBuffer, int backtraceSize, unsigned int bytes);
|
||||||
|
|
||||||
typedef std::list<AllocationBlock*> AllocationBlocksList;
|
typedef std::unordered_set<AllocationBlock*, block_hash, block_equal_to> AllocationBlocksList;
|
||||||
AllocationBlocksList m_allocationsBlocks;
|
AllocationBlocksList m_allocationsBlocks;
|
||||||
|
|
||||||
typedef std::list<AllocationBlock*> AllocationsAddressesMap;
|
#ifdef _REENTRANT
|
||||||
AllocationsAddressesMap m_allocationAddresses;
|
|
||||||
|
|
||||||
boost::recursive_mutex m_allocatorLock;
|
boost::recursive_mutex m_allocatorLock;
|
||||||
bool m_inside;
|
#endif
|
||||||
|
|
||||||
static Allocator m_instance;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
void* operator new(size_t bytes, int dummy);
|
void* operator new(size_t bytes, int dummy);
|
||||||
void* operator new(size_t bytes);
|
void* operator new(size_t bytes);
|
||||||
void* operator new[](size_t bytes);
|
void* operator new[](size_t bytes);
|
||||||
void operator delete(void *p);
|
void operator delete(void *p);
|
||||||
void operator delete[](void* p);
|
void operator delete[](void *p);
|
||||||
|
|
||||||
|
#endif // _DEBUG_MEMORY
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue