2009-02-15 09:09:56 +00:00
|
|
|
#include "zone.hpp"
|
|
|
|
|
|
|
|
namespace msgpack {
|
|
|
|
|
|
|
|
|
|
|
|
void* zone::alloc()
|
|
|
|
{
|
2009-02-15 09:09:56 +00:00
|
|
|
if(m_pool.size()*ZONE_CHUNK_SIZE <= m_used) {
|
|
|
|
cell_t* chunk = (cell_t*)malloc(sizeof(cell_t)*ZONE_CHUNK_SIZE);
|
|
|
|
if(!chunk) { throw std::bad_alloc(); }
|
|
|
|
try {
|
|
|
|
m_pool.push_back(chunk);
|
|
|
|
} catch (...) {
|
|
|
|
free(chunk);
|
|
|
|
throw;
|
|
|
|
}
|
2009-02-15 09:09:56 +00:00
|
|
|
}
|
2009-02-15 09:09:56 +00:00
|
|
|
void* data = m_pool[m_used/ZONE_CHUNK_SIZE][m_used%ZONE_CHUNK_SIZE].data;
|
2009-02-15 09:09:56 +00:00
|
|
|
++m_used;
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
|
|
|
|
void zone::clear()
|
|
|
|
{
|
2009-02-15 09:09:56 +00:00
|
|
|
if(!m_pool.empty()) {
|
2009-02-15 09:09:56 +00:00
|
|
|
for(size_t b=0; b < m_used/ZONE_CHUNK_SIZE; ++b) {
|
|
|
|
cell_t* c(m_pool[b]);
|
|
|
|
for(size_t e=0; e < ZONE_CHUNK_SIZE; ++e) {
|
2009-02-15 09:09:56 +00:00
|
|
|
reinterpret_cast<object_class*>(c[e].data)->~object_class();
|
|
|
|
}
|
|
|
|
}
|
2009-02-15 09:09:56 +00:00
|
|
|
cell_t* c(m_pool.back());
|
|
|
|
for(size_t e=0; e < m_used%ZONE_CHUNK_SIZE; ++e) {
|
2009-02-15 09:09:56 +00:00
|
|
|
reinterpret_cast<object_class*>(c[e].data)->~object_class();
|
|
|
|
}
|
2009-02-15 09:09:56 +00:00
|
|
|
|
|
|
|
for(pool_t::iterator it(m_pool.begin()), it_end(m_pool.end());
|
|
|
|
it != it_end;
|
|
|
|
++it) {
|
2009-02-15 09:09:56 +00:00
|
|
|
free(*it);
|
2009-02-15 09:09:56 +00:00
|
|
|
}
|
|
|
|
m_pool.clear();
|
2009-02-15 09:09:56 +00:00
|
|
|
}
|
|
|
|
m_used = 0;
|
2009-02-15 09:09:56 +00:00
|
|
|
|
2009-02-15 09:09:56 +00:00
|
|
|
for(user_finalizer_t::reverse_iterator it(m_user_finalizer.rbegin()), it_end(m_user_finalizer.rend());
|
|
|
|
it != it_end;
|
|
|
|
++it) {
|
|
|
|
it->call();
|
|
|
|
}
|
|
|
|
m_user_finalizer.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace msgpack
|
|
|
|
|