-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathMemoryPool.h
134 lines (108 loc) · 3.44 KB
/
MemoryPool.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#ifndef _MEMORY_POOL_H_
#define _MEMORY_POOL_H_
#include <memory>
#include <cstdlib>
namespace MemoryPool {
static const int DEFAULT_EXPAND_SIZE = 10000;
template <class T, std::size_t Size = DEFAULT_EXPAND_SIZE>
class MemoryPool {
public:
MemoryPool() : next(0) {
expandFreeList(Size);
}
~MemoryPool() {
MemoryPool<T, Size>* nextPtr = next;
for (nextPtr = next; nextPtr != 0; nextPtr = next) {
next = next->next;
std::free(nextPtr);
}
}
void* alloc(std::size_t) {
if (!next) expandFreeList(Size);
MemoryPool<T, Size>* head = next;
next = head->next;
return head;
}
void free(void* freePtr) {
MemoryPool<T, Size>* head = static_cast<MemoryPool<T, Size>*>(freePtr);
head->next = next;
next = head;
}
private:
void expandFreeList(int howMany) {
std::size_t size =
(sizeof(T) > sizeof(MemoryPool<T, Size>*)) ? sizeof(T) : sizeof(MemoryPool<T, Size>*);
MemoryPool<T, Size>* runner = reinterpret_cast<MemoryPool<T, Size>*>(std::malloc(size));
next = runner;
for (int i = 0; i < howMany; ++i) {
runner->next = reinterpret_cast<MemoryPool<T, Size>*>(std::malloc(size));
runner = runner->next;
}
runner->next = 0;
}
private:
MemoryPool<T, Size>* next;
};
template <class T, std::size_t Size = DEFAULT_EXPAND_SIZE>
class AppendMemoryPool {
public:
void* operator new(std::size_t size) { return pool->alloc(size); }
void operator delete(void* deletePtr, std::size_t) { pool->free(deletePtr); }
void* operator new[](std::size_t size) { return pool->alloc(size); }
void operator delete[](void* deletePtr, std::size_t) { pool->free(deletePtr); }
static void init() { pool.reset(new MemoryPool<T, Size>); }
private:
static std::auto_ptr<MemoryPool<T, Size> > pool;
};
template <class T, std::size_t Size = DEFAULT_EXPAND_SIZE>
class MakeMemoryPool {
public:
MakeMemoryPool() : pool(new MemoryPool<T, Size>) {}
~MakeMemoryPool() {}
T* poolNew() {
T* allocPtr = static_cast<T*>(pool->alloc(sizeof(T)));
return static_cast<T*>(new(allocPtr) T());
}
void poolDelete(T* deletePtr) {
deletePtr->~T();
pool->free(deletePtr);
}
private:
std::auto_ptr<MemoryPool<T, Size> > pool;
};
struct DataPool16 { char data[16]; };
struct DataPool32 { char data[32]; };
struct DataPool64 { char data[64]; };
struct DataPool128 { char data[128]; };
struct DataPool256 { char data[256]; };
class GeneralMemoryPool {
public:
GeneralMemoryPool() {}
~GeneralMemoryPool() {}
void* poolAlloc(std::size_t size) {
void* allocPtr = NULL;
if (size < 16) { allocPtr = mp16.alloc(size); }
else if (size < 32) { allocPtr = mp32.alloc(size); }
else if (size < 64) { allocPtr = mp64.alloc(size); }
else if (size < 128) { allocPtr = mp128.alloc(size); }
else if (size < 256) { allocPtr = mp256.alloc(size); }
return allocPtr;
}
void poolFree(void* freePtr, std::size_t size) {
if (size < 16) { mp16.free(freePtr); }
else if (size < 32) { mp32.free(freePtr); }
else if (size < 64) { mp64.free(freePtr); }
else if (size < 128) { mp128.free(freePtr); }
else if (size < 256) { mp256.free(freePtr); }
}
private:
MemoryPool<DataPool16> mp16;
MemoryPool<DataPool32> mp32;
MemoryPool<DataPool64> mp64;
MemoryPool<DataPool128> mp128;
MemoryPool<DataPool256> mp256;
};
template <class T, std::size_t Size>
std::auto_ptr<MemoryPool<T, Size> > AppendMemoryPool<T, Size>::pool;
} /* end of namespace MemoryPool */
#endif