2
Copyright (C) 1999-2007 The Botan Project. All rights reserved.
4
Redistribution and use in source and binary forms, for any use, with or without
5
modification, is permitted provided that the following conditions are met:
7
1. Redistributions of source code must retain the above copyright notice, this
8
list of conditions, and the following disclaimer.
10
2. Redistributions in binary form must reproduce the above copyright notice,
11
this list of conditions, and the following disclaimer in the documentation
12
and/or other materials provided with the distribution.
14
THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) "AS IS" AND ANY EXPRESS OR IMPLIED
15
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
16
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
18
IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE FOR ANY DIRECT,
19
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
20
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
22
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
23
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
24
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
namespace QCA { // WRAPNS_LINE
28
/*************************************************
29
* Pooling Allocator Header File *
30
* (C) 1999-2007 The Botan Project *
31
*************************************************/
33
#ifndef BOTAN_POOLING_ALLOCATOR_H__
34
#define BOTAN_POOLING_ALLOCATOR_H__
37
#include <botan/allocate.h>
38
namespace QCA { // WRAPNS_LINE
40
#include <botan/exceptn.h>
41
namespace QCA { // WRAPNS_LINE
43
#include <botan/mutex.h>
44
namespace QCA { // WRAPNS_LINE
47
namespace QCA { // WRAPNS_LINE
50
namespace QCA { // WRAPNS_LINE
54
/*************************************************
56
*************************************************/
57
class Pooling_Allocator : public Allocator
60
void* allocate(u32bit);
61
void deallocate(void*, u32bit);
65
Pooling_Allocator(u32bit, bool);
68
void get_more_core(u32bit);
69
byte* allocate_blocks(u32bit);
71
virtual void* alloc_block(u32bit) = 0;
72
virtual void dealloc_block(void*, u32bit) = 0;
79
static u32bit bitmap_size() { return BITMAP_SIZE; }
80
static u32bit block_size() { return BLOCK_SIZE; }
82
bool contains(void*, u32bit) const throw();
83
byte* alloc(u32bit) throw();
84
void free(void*, u32bit) throw();
86
bool operator<(const Memory_Block& other) const
88
if(buffer < other.buffer && other.buffer < buffer_end)
90
return (buffer < other.buffer);
94
typedef u64bit bitmap_type;
95
static const u32bit BITMAP_SIZE;
96
static const u32bit BLOCK_SIZE;
99
byte* buffer, *buffer_end;
102
const u32bit PREF_SIZE;
104
std::vector<Memory_Block> blocks;
105
std::vector<Memory_Block>::iterator last_used;
106
std::vector<std::pair<void*, u32bit> > allocated;