blob: b90960f953e127d2ed15ca5e5538e96dd5a3a25d (
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
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
|
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
* palloc.c
*
*/
#include <cstdio>
#include "pconfig.h"
#include "palloc.h"
#include "pfmtlog.h"
namespace plib {
//============================================================
// Exceptions
//============================================================
pexception::pexception(const pstring text)
{
m_text = text;
}
file_e::file_e(const pstring fmt, const pstring &filename)
: pexception(pfmt(fmt)(filename))
{
}
file_open_e::file_open_e(const pstring &filename)
: file_e("File open failed: {}", filename)
{
}
file_read_e::file_read_e(const pstring &filename)
: file_e("File read failed: {}", filename)
{
}
file_write_e::file_write_e(const pstring &filename)
: file_e("File write failed: {}", filename)
{
}
null_argument_e::null_argument_e(const pstring &argument)
: pexception(pfmt("Null argument passed: {}")(argument))
{
}
out_of_mem_e::out_of_mem_e(const pstring &location)
: pexception(pfmt("Out of memory: {}")(location))
{
}
//============================================================
// 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));
}
delete b.data;
}
m_blocks.clear();
}
size_t mempool::new_block()
{
block b;
b.data = new char[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;
}
void *mempool::alloc(size_t size)
{
size_t rs = (size + sizeof(info) + 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 + sizeof(info));
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 + sizeof(info));
b.cur_ptr += rs;
return ret;
}
}
void mempool::free(void *ptr)
{
auto p = reinterpret_cast<char *>(ptr);
auto i = reinterpret_cast<info *>(p - sizeof(info));
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--;
}
}
|