coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-06-30 06:18:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

object_pool work in progress

Browse Source
This commit is contained in:
John Wellbelove 2022-11-10 15:38:15 +00:00 committed by John Wellbelove
parent c4db50baca
commit 5c4f366a74
1 changed files with 2 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
include/etl/object_pool.h
View File

@ -71,7 +71,7 @@ namespace etl
//*************************************************************************
///
//*************************************************************************
template <typename T>
template <typename T, typename... TArgs>
void release(T&& object)
{
release_block(reinterpret_cast<char*>(&object));
@ -126,7 +126,7 @@ namespace etl
}
//*******************************
size_t size() const
size_t data_size() const
{
return size_t(reinterpret_cast<const char*>(next) - data());
}
@ -216,58 +216,6 @@ namespace etl
return nullptr;
}
//*************************************************************************
///
//*************************************************************************
void release_block(char* ptr)
{
header* block;
header* p;
// acquire pointer to block header
block = reinterpret_cast<header*>(ptr) - 1;
// Find the correct place to place the block in (the free list is sorted by
// address, increasing order)
//
for (p = head; !(block > p && block < p->next); p = p->next)
{
// Since the free list is circular, there is one link where a
// higher-addressed block points to a lower-addressed block.
// This condition checks if the block should be actually
// inserted between them
//
if (p >= p->next && (block > p || block < p->next))
break;
}
// Try to combine with the higher neighbor
//
if (block + block->size() == p->next)
{
block->size += p->next->size;
block->next = p->next->next;
}
else
{
block->next = p->next;
}
// Try to combine with the lower neighbor
//
if (p + p->size == block)
{
p->size += block->size;
p->next = block->next;
}
else
{
p->next = block;
}
free_p = p;
}
char* pbuffer;
size_t buffer_size;
header* head;