UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-23 15:50:49 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix TreePool::alloc and dealloc

Browse Source
This commit is contained in:
Léa Saviot
2018-06-20 14:34:22 +02:00
parent 2f8d8890cb
commit 42c57ae6f2
1 changed files with 13 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
tree_pool.cpp
View File

@@ -3,6 +3,9 @@
#include "tree_node.h"
void * TreePool::alloc(size_t size) {
if (m_cursor >= m_buffer + BufferSize || m_cursor + size > m_buffer + BufferSize) {
return nullptr;
}
void * result = m_cursor;
m_cursor += size;
return result;
@@ -12,14 +15,22 @@ void TreePool::dealloc(void * ptr) {
assert(ptr >= m_buffer && ptr < m_cursor);
TreeNode * node = reinterpret_cast<TreeNode *>(ptr);
size_t size = node->size();
printf("Dealloc %d(%p) of size %d\n", node->m_identifier, node, size);
printf("Dealloc %d(%p) of size %zu\n", node->m_identifier, node, size);
// Step 1 - Compact the pool
memmove(
ptr,
static_cast<char *>(ptr) + size,
m_cursor - static_cast<char *>(ptr)
m_cursor - (static_cast<char *>(ptr) + size)
);
m_cursor -= size;
// Step 2 - Update m_nodeForIdentifier
for (int i = 0; i < MaxNumberOfNodes; i++) {
if (m_nodeForIdentifier[i] > node) {
m_nodeForIdentifier[i] -= size;
}
}
}
TreeNode * TreePool::node(int identifier) const {