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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Support {
/**
* \brief Manage memory organized into block lists (allocator)
*
* The allocation policy is to free all memory allocated when
* the block allocator is deleted.
*
* \ingroup FuncSupport
*/
template<class T, class A, int blocksize = 512>
class BlockAllocator {
private:
/// Memory allocator
A& a;
/// One block of memory
class Block {
public:
T b[blocksize];
Block* next;
};
/// Pointer to current block
Block* b;
/// Pointer to next part of block (decreasing)
T* n;
/// Size of allocated blocks
size_t _size;
/// Allocate additional block
void allocate(void);
public:
/// Initialize
BlockAllocator(A& a);
/// Free all allocated blocks
~BlockAllocator(void);
/// Return allocator used
A& allocator(void);
/// Return memory of size required by \a T
T* operator ()(void);
/// Return size of memory required by allocator
size_t size(void) const;
};
/**
* \brief Client for block allocator of type \a T
*
* Provides memory management for objects of type \a T.
*
* \ingroup FuncSupport
*/
template<class T, class A, int blocksize = 512>
class BlockClient {
public:
/// Allocate memory from block allocator \a ba
static void* operator new(size_t s, BlockAllocator<T,A,blocksize>& ba);
/// Noop (memory freed only when block allocator deleted)
static void operator delete(void*, BlockAllocator<T,A,blocksize>& ba);
/// Noop (memory freed only when block allocator deleted)
static void operator delete(void*);
};
template<class T, class A, int blocksize>
forceinline
BlockAllocator<T,A,blocksize>::BlockAllocator(A& a0) : a(a0) {
b = static_cast<Block*>(a.ralloc(sizeof(Block)));
b->next = nullptr;
n = &b->b[blocksize];
_size = sizeof(Block);
}
template<class T, class A, int blocksize>
forceinline
BlockAllocator<T,A,blocksize>::~BlockAllocator(void) {
while (b != nullptr) {
Block* f = b; b = b->next;
a.rfree(f,sizeof(Block));
}
}
template<class T, class A, int blocksize>
forceinline A&
BlockAllocator<T,A,blocksize>::allocator(void) {
return a;
}
template<class T, class A, int blocksize>
forceinline T*
BlockAllocator<T,A,blocksize>::operator ()(void) {
T* t = --n;
if (t == &b->b[0])
allocate();
return t;
}
template<class T, class A, int blocksize>
void
BlockAllocator<T,A,blocksize>::allocate(void) {
// Allocate another block
Block* nb = static_cast<Block*>(a.ralloc(sizeof(Block)));
nb->next = b; b = nb;
n = &nb->b[blocksize];
_size += sizeof(Block);
}
template<class T, class A, int blocksize>
forceinline size_t
BlockAllocator<T,A,blocksize>::size(void) const {
return _size;
}
template<class T, class A, int blocksize>
forceinline void
BlockClient<T,A,blocksize>::operator
delete(void*,BlockAllocator<T,A,blocksize>&) {
}
template<class T, class A, int blocksize>
forceinline void
BlockClient<T,A,blocksize>::operator delete(void*) {
}
template<class T, class A, int blocksize>
forceinline void*
BlockClient<T,A,blocksize>::operator new(size_t,
BlockAllocator<T,A,blocksize>& ba) {
return ba();
}
}}
// STATISTICS: support-any
|