| 1 |
// Copyright (c) 2015 Ryan Prichard |
| 2 |
// |
| 3 |
// Permission is hereby granted, free of charge, to any person obtaining a copy |
| 4 |
// of this software and associated documentation files (the "Software"), to |
| 5 |
// deal in the Software without restriction, including without limitation the |
| 6 |
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
| 7 |
// sell copies of the Software, and to permit persons to whom the Software is |
| 8 |
// furnished to do so, subject to the following conditions: |
| 9 |
// |
| 10 |
// The above copyright notice and this permission notice shall be included in |
| 11 |
// all copies or substantial portions of the Software. |
| 12 |
// |
| 13 |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 14 |
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 15 |
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 16 |
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 17 |
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
| 18 |
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS |
| 19 |
// IN THE SOFTWARE. |
| 20 |
|
| 21 |
#ifndef SIMPLE_POOL_H |
| 22 |
#define SIMPLE_POOL_H |
| 23 |
|
| 24 |
#include <stdlib.h> |
| 25 |
|
| 26 |
#include <vector> |
| 27 |
|
| 28 |
#include "../shared/WinptyAssert.h" |
| 29 |
|
| 30 |
template <typename T, size_t chunkSize> |
| 31 |
class SimplePool { |
| 32 |
public: |
| 33 |
~SimplePool(); |
| 34 |
T *alloc(); |
| 35 |
void clear(); |
| 36 |
private: |
| 37 |
struct Chunk { |
| 38 |
size_t count; |
| 39 |
T *data; |
| 40 |
}; |
| 41 |
std::vector<Chunk> m_chunks; |
| 42 |
}; |
| 43 |
|
| 44 |
template <typename T, size_t chunkSize> |
| 45 |
SimplePool<T, chunkSize>::~SimplePool() { |
| 46 |
clear(); |
| 47 |
} |
| 48 |
|
| 49 |
template <typename T, size_t chunkSize> |
| 50 |
void SimplePool<T, chunkSize>::clear() { |
| 51 |
for (size_t ci = 0; ci < m_chunks.size(); ++ci) { |
| 52 |
Chunk &chunk = m_chunks[ci]; |
| 53 |
for (size_t ti = 0; ti < chunk.count; ++ti) { |
| 54 |
chunk.data[ti].~T(); |
| 55 |
} |
| 56 |
free(chunk.data); |
| 57 |
} |
| 58 |
m_chunks.clear(); |
| 59 |
} |
| 60 |
|
| 61 |
template <typename T, size_t chunkSize> |
| 62 |
T *SimplePool<T, chunkSize>::alloc() { |
| 63 |
if (m_chunks.empty() || m_chunks.back().count == chunkSize) { |
| 64 |
T *newData = reinterpret_cast<T*>(malloc(sizeof(T) * chunkSize)); |
| 65 |
ASSERT(newData != NULL); |
| 66 |
Chunk newChunk = { 0, newData }; |
| 67 |
m_chunks.push_back(newChunk); |
| 68 |
} |
| 69 |
Chunk &chunk = m_chunks.back(); |
| 70 |
T *ret = &chunk.data[chunk.count++]; |
| 71 |
new (ret) T(); |
| 72 |
return ret; |
| 73 |
} |
| 74 |
|
| 75 |
#endif // SIMPLE_POOL_H |