blob: 4fcec15eebf1c0e5b180e74067b2c212abad7bf0 (
plain)
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
|
/*
* (C) 2018 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#ifndef BOTAN_MEM_POOL_H_
#define BOTAN_MEM_POOL_H_
#include <botan/types.h>
#include <botan/mutex.h>
#include <vector>
#include <deque>
#include <map>
namespace Botan {
class Bucket;
class BOTAN_TEST_API Memory_Pool final
{
public:
/**
* Initialize a memory pool. The memory is not owned by *this,
* it must be freed by the caller.
* @param pages a list of pages to allocate from
* @param page_size the system page size, each page should
* point to exactly this much memory.
*/
Memory_Pool(const std::vector<void*>& pages,
size_t page_size);
~Memory_Pool();
void* allocate(size_t size);
bool deallocate(void* p, size_t size) noexcept;
Memory_Pool(const Memory_Pool&) = delete;
Memory_Pool(Memory_Pool&&) = delete;
Memory_Pool& operator=(const Memory_Pool&) = delete;
Memory_Pool& operator=(Memory_Pool&&) = delete;
private:
const size_t m_page_size = 0;
mutex_type m_mutex;
std::deque<uint8_t*> m_free_pages;
std::map<size_t, std::deque<Bucket>> m_buckets_for;
uintptr_t m_min_page_ptr;
uintptr_t m_max_page_ptr;
};
}
#endif
|