1 | |
---|
2 | |
---|
3 | |
---|
4 | #include "mempool.h" |
---|
5 | |
---|
6 | AsyncDNSMemPool::PoolChunk::PoolChunk(size_t _size): |
---|
7 | pool(NULL), pos(0), size(_size) |
---|
8 | { |
---|
9 | pool = ::malloc(size); |
---|
10 | } |
---|
11 | |
---|
12 | AsyncDNSMemPool::PoolChunk::~PoolChunk() |
---|
13 | { |
---|
14 | ::free(pool); |
---|
15 | } |
---|
16 | |
---|
17 | AsyncDNSMemPool::AsyncDNSMemPool(size_t _defaultSize): |
---|
18 | chunks(NULL), chunksCount(0), defaultSize(_defaultSize), |
---|
19 | poolUsage(0), poolUsageCounter(0) |
---|
20 | { |
---|
21 | } |
---|
22 | |
---|
23 | AsyncDNSMemPool::~AsyncDNSMemPool() |
---|
24 | { |
---|
25 | for(size_t i = 0; i<chunksCount; i++){ |
---|
26 | delete chunks[i]; |
---|
27 | } |
---|
28 | ::free(chunks); |
---|
29 | } |
---|
30 | |
---|
31 | int AsyncDNSMemPool::initialize() |
---|
32 | { |
---|
33 | chunksCount = 1; |
---|
34 | chunks = (PoolChunk**)::malloc(sizeof(PoolChunk*)); |
---|
35 | if(chunks == NULL) |
---|
36 | return -1; |
---|
37 | |
---|
38 | chunks[chunksCount-1] = new PoolChunk(defaultSize); |
---|
39 | |
---|
40 | return 0; |
---|
41 | } |
---|
42 | |
---|
43 | void AsyncDNSMemPool::addNewChunk(size_t size) |
---|
44 | { |
---|
45 | ++chunksCount; |
---|
46 | chunks = (PoolChunk**)::realloc(chunks, chunksCount*sizeof(PoolChunk*)); |
---|
47 | if(size <= defaultSize) |
---|
48 | chunks[chunksCount-1] = new PoolChunk(defaultSize); |
---|
49 | else |
---|
50 | chunks[chunksCount-1] = new PoolChunk(size); |
---|
51 | } |
---|
52 | |
---|
53 | void * AsyncDNSMemPool::alloc(size_t size) |
---|
54 | { |
---|
55 | PoolChunk * chunk = NULL; |
---|
56 | for(size_t i = 0; i<chunksCount; i++){ |
---|
57 | chunk = chunks[i]; |
---|
58 | if((chunk->size - chunk->pos) >= size){ |
---|
59 | chunk->pos += size; |
---|
60 | return ((char*)chunk->pool) + chunk->pos - size; |
---|
61 | } |
---|
62 | } |
---|
63 | addNewChunk(size); |
---|
64 | chunks[chunksCount-1]->pos = size; |
---|
65 | return chunks[chunksCount-1]->pool; |
---|
66 | } |
---|
67 | |
---|
68 | void AsyncDNSMemPool::free() |
---|
69 | { |
---|
70 | size_t pu = 0; |
---|
71 | size_t psz = 0; |
---|
72 | ++poolUsageCounter; |
---|
73 | |
---|
74 | for(size_t i = 0; i<chunksCount; i++){ |
---|
75 | pu += chunks[i]->pos; |
---|
76 | psz += chunks[i]->size; |
---|
77 | chunks[i]->pos = 0; |
---|
78 | } |
---|
79 | poolUsage=(poolUsage>pu)?poolUsage:pu; |
---|
80 | |
---|
81 | if(poolUsageCounter >= 10 && chunksCount > 1){ |
---|
82 | psz -= chunks[chunksCount-1]->size; |
---|
83 | if(poolUsage < psz){ |
---|
84 | --chunksCount; |
---|
85 | delete chunks[chunksCount]; |
---|
86 | } |
---|
87 | poolUsage = 0; |
---|
88 | poolUsageCounter = 0; |
---|
89 | } |
---|
90 | } |
---|
91 | |
---|
92 | void * AsyncDNSMemPool::calloc(size_t size) |
---|
93 | { |
---|
94 | return ::memset(this->alloc(size), 0, size); |
---|
95 | } |
---|
96 | |
---|
97 | char * AsyncDNSMemPool::strdup(const char *str) |
---|
98 | { |
---|
99 | return ::strcpy((char*)this->alloc(strlen(str)+1), str); |
---|
100 | } |
---|