1/*
2Copyright (C) 1999-2007 The Botan Project. All rights reserved.
3
4Redistribution and use in source and binary forms, for any use, with or without
5modification, is permitted provided that the following conditions are met:
6
71. Redistributions of source code must retain the above copyright notice, this
8list of conditions, and the following disclaimer.
9
102. Redistributions in binary form must reproduce the above copyright notice,
11this list of conditions, and the following disclaimer in the documentation
12and/or other materials provided with the distribution.
13
14THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) "AS IS" AND ANY EXPRESS OR IMPLIED
15WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
16MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
17
18IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE FOR ANY DIRECT,
19INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
20BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
22LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
23OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
24ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25*/
26// LICENSEHEADER_END
27namespace QCA { // WRAPNS_LINE
28/*************************************************
29 * Pooling Allocator Header File *
30 * (C) 1999-2007 The Botan Project *
31 *************************************************/
32
33#ifndef BOTAN_POOLING_ALLOCATOR_H__
34#define BOTAN_POOLING_ALLOCATOR_H__
35
36} // WRAPNS_LINE
37#include <botan/allocate.h>
38namespace QCA { // WRAPNS_LINE
39} // WRAPNS_LINE
40#include <botan/exceptn.h>
41namespace QCA { // WRAPNS_LINE
42} // WRAPNS_LINE
43#include <botan/mutex.h>
44namespace QCA { // WRAPNS_LINE
45} // WRAPNS_LINE
46#include <utility>
47namespace QCA { // WRAPNS_LINE
48} // WRAPNS_LINE
49#include <vector>
50namespace QCA { // WRAPNS_LINE
51
52namespace Botan {
53
54/*************************************************
55 * Pooling Allocator *
56 *************************************************/
57class Pooling_Allocator : public Allocator
58{
59public:
60 void *allocate(u32bit) override;
61 void deallocate(void *, u32bit) override;
62
63 void destroy() override;
64
65 Pooling_Allocator(u32bit, bool);
66 ~Pooling_Allocator() QCA_NOEXCEPT(false) override;
67
68private:
69 void get_more_core(u32bit);
70 byte *allocate_blocks(u32bit);
71
72 virtual void *alloc_block(u32bit) = 0;
73 virtual void dealloc_block(void *, u32bit) = 0;
74
75 class Memory_Block
76 {
77 public:
78 Memory_Block(void *);
79
80 static u32bit bitmap_size()
81 {
82 return BITMAP_SIZE;
83 }
84 static u32bit block_size()
85 {
86 return BLOCK_SIZE;
87 }
88
89 bool contains(void *, u32bit) const throw();
90 byte *alloc(u32bit) throw();
91 void free(void *, u32bit) throw();
92
93 bool operator<(const Memory_Block &other) const
94 {
95 if (buffer < other.buffer && other.buffer < buffer_end)
96 return false;
97 return (buffer < other.buffer);
98 }
99
100 private:
101 typedef u64bit bitmap_type;
102 static const u32bit BITMAP_SIZE;
103 static const u32bit BLOCK_SIZE;
104
105 bitmap_type bitmap;
106 byte *buffer, *buffer_end;
107 };
108
109 const u32bit PREF_SIZE;
110
111 std::vector<Memory_Block> blocks;
112 std::vector<Memory_Block>::iterator last_used;
113 std::vector<std::pair<void *, u32bit>> allocated;
114 Mutex *mutex;
115};
116
117}
118
119#endif
120} // WRAPNS_LINE
121

source code of qca/src/botantools/botan/botan/mem_pool.h