94 lines
2.3 KiB
C++
94 lines
2.3 KiB
C++
/*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*
|
|
* Copyright 2011-2012 Danny Robson <danny@nerdcruft.net>
|
|
*/
|
|
|
|
#ifdef __UTIL_POOL_IPP
|
|
#error Double inclusion of pool.ipp
|
|
#endif
|
|
|
|
#define __UTIL_POOL_IPP
|
|
|
|
|
|
namespace util {
|
|
template <typename T>
|
|
pool<T>::pool (unsigned int _capacity):
|
|
m_capacity (_capacity)
|
|
{
|
|
static_assert (sizeof (T) >= sizeof (uintptr_t),
|
|
"pool<T>'s chained block system requires that T be at least pointer sized");
|
|
|
|
m_head = static_cast<node *> (operator new (sizeof (T) * m_capacity));
|
|
m_next = m_head;
|
|
|
|
for (unsigned int i = 0; i < m_capacity - 1; ++i)
|
|
m_next[i]._chain = &m_next[i + 1];
|
|
m_next[m_capacity - 1]._chain = NULL;
|
|
}
|
|
|
|
|
|
template <typename T>
|
|
pool<T>::~pool () {
|
|
CHECK (m_next != NULL);
|
|
|
|
unsigned int doomed_count = 0;
|
|
for (node *cursor = m_next; cursor != NULL; cursor = cursor->_chain)
|
|
++doomed_count;
|
|
|
|
CHECK_EQ (doomed_count, m_capacity);
|
|
operator delete (m_head);
|
|
}
|
|
|
|
|
|
template <typename T>
|
|
size_t
|
|
pool<T>::capacity (void) const
|
|
{ return m_capacity; }
|
|
|
|
|
|
template <typename T>
|
|
template <typename ...Args>
|
|
T*
|
|
pool<T>::acquire (Args&... args) {
|
|
if (!m_next)
|
|
throw std::bad_alloc ();
|
|
|
|
node *newnext = m_next->_chain;
|
|
T *data = (T*)&m_next->_data;
|
|
|
|
try {
|
|
new (data) T (args...);
|
|
} catch (...) {
|
|
m_next->_chain = newnext;
|
|
throw;
|
|
}
|
|
|
|
m_next = newnext;
|
|
return data;
|
|
}
|
|
|
|
|
|
template <typename T>
|
|
void
|
|
pool<T>::release (T *data) {
|
|
data->~T();
|
|
node *newnode = reinterpret_cast<node *> (data);
|
|
|
|
newnode->_chain = m_next;
|
|
m_next = newnode;
|
|
}
|
|
}
|
|
|
|
|