blob: db950c0f6a18a57ef57f2f5047225ff6746a88aa (
plain) (
blame)
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
|
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
* palloc.c
*
*/
#include "pconfig.h"
#include "palloc.h"
#include "pfmtlog.h"
#include <algorithm>
namespace plib {
//============================================================
// Memory pool
//============================================================
mempool::mempool(size_t min_alloc, size_t min_align)
: m_min_alloc(min_alloc), m_min_align(min_align)
{
}
mempool::~mempool()
{
for (auto & b : m_blocks)
{
if (b.m_num_alloc != 0)
{
fprintf(stderr, "Found block with %d dangling allocations\n", static_cast<int>(b.m_num_alloc));
}
::operator delete(b.data);
}
m_blocks.clear();
}
size_t mempool::new_block()
{
block b;
b.data = static_cast<char *>(::operator new(m_min_alloc));
b.cur_ptr = b.data;
b.m_free = m_min_alloc;
b.m_num_alloc = 0;
m_blocks.push_back(b);
return m_blocks.size() - 1;
}
size_t mempool::mininfosize()
{
size_t sinfo = sizeof(mempool::info);
size_t ma = 8;
#ifdef __APPLE__
ma = 16;
#endif
return ((std::max(m_min_align, sinfo) + ma - 1) / ma) * ma;
}
void *mempool::alloc(size_t size)
{
size_t rs = (size + mininfosize() + m_min_align - 1) & ~(m_min_align - 1);
for (size_t bn=0; bn < m_blocks.size(); bn++)
{
auto &b = m_blocks[bn];
if (b.m_free > rs)
{
b.m_free -= rs;
b.m_num_alloc++;
auto i = reinterpret_cast<info *>(b.cur_ptr);
i->m_block = bn;
auto ret = reinterpret_cast<void *>(b.cur_ptr + mininfosize());
b.cur_ptr += rs;
return ret;
}
}
{
size_t bn = new_block();
auto &b = m_blocks[bn];
b.m_num_alloc = 1;
b.m_free = m_min_alloc - rs;
auto i = reinterpret_cast<info *>(b.cur_ptr);
i->m_block = bn;
auto ret = reinterpret_cast<void *>(b.cur_ptr + mininfosize());
b.cur_ptr += rs;
return ret;
}
}
void mempool::free(void *ptr)
{
auto p = reinterpret_cast<char *>(ptr);
auto i = reinterpret_cast<info *>(p - mininfosize());
block *b = &m_blocks[i->m_block];
if (b->m_num_alloc == 0)
fprintf(stderr, "Argh .. double free\n");
else
{
//b->m_free = m_min_alloc;
//b->cur_ptr = b->data;
}
b->m_num_alloc--;
}
}
|