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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/*
This file is part of the KDE libraries
Copyright (C) 1999 Waldo Bastian ([email protected])
Copyright (C) 2002 Michael Matz ([email protected])
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
/* Fast zone memory allocator with deallocation support, for use as obstack
or as general purpose allocator. It does no compaction. If the usage
pattern is non-optimal it might waste some memory while running. E.g.
allocating many small things at once, and then deallocating only every
second one, there is a high chance, that actually no memory is freed. */
// $Id$
#include "kallocator.h"
#include <kdebug.h>
class TDEZoneAllocator::MemBlock
{
public:
MemBlock(size_t s) : size(s), ref(0), older(0), newer(0)
{ begin = new char[s]; }
~MemBlock() { delete [] begin; }
bool is_in(void *ptr) const {return !(begin > (char *)ptr
|| (begin + size) <= (char *)ptr); }
size_t size;
unsigned int ref;
char *begin;
MemBlock *older;
MemBlock *newer;
};
TDEZoneAllocator::TDEZoneAllocator(unsigned long _blockSize)
: currentBlock(0), blockSize(1), blockOffset(0), log2(0), num_blocks(0),
hashList(0), hashSize(0), hashDirty(true)
{
while (blockSize < _blockSize)
blockSize <<= 1, log2++;
/* Make sure, that a block is allocated at the first time allocate()
is called (even with a 0 size). */
blockOffset = blockSize + 1;
}
TDEZoneAllocator::~TDEZoneAllocator()
{
unsigned int count = 0;
if (hashList) {
/* No need to maintain the different lists in hashList[] anymore.
I.e. no need to use delBlock(). */
for (unsigned int i = 0; i < hashSize; i++)
delete hashList[i];
delete [] hashList;
hashList = 0;
}
MemBlock *next;
for (; currentBlock; currentBlock = next) {
next = currentBlock->older;
delete currentBlock;
count++;
}
#ifndef NDEBUG // as this is called quite late in the app, we don't care
// to use kdDebug
if (count > 1)
tqDebug("zone still contained %d blocks", count);
#endif
}
void TDEZoneAllocator::insertHash(MemBlock *b)
{
unsigned long adr = ((unsigned long)b->begin) & (~(blockSize - 1));
unsigned long end = ((unsigned long)b->begin) + blockSize;
while (adr < end) {
unsigned long key = adr >> log2;
key = key & (hashSize - 1);
if (!hashList[key])
hashList[key] = new TQValueList<MemBlock *>;
hashList[key]->append(b);
adr += blockSize;
}
}
/** Add a new memory block to the pool of blocks,
and reorganize the hash lists if needed.
@param b block to add
@internal
*/
void TDEZoneAllocator::addBlock(MemBlock *b)
{
b->newer = 0;
b->older = currentBlock;
if (currentBlock)
b->older->newer = b;
currentBlock = b;
num_blocks++;
/* If we either have no hashList at all, or since it's last construction
there are now many more blocks we reconstruct the list. But don't
make it larger than a certain maximum. */
if (hashList && ((num_blocks / 4) > hashSize && hashSize < 64*1024))
hashDirty = true;
/* Only insert this block into the hashlists, if we aren't going to
reconstruct them anyway. */
if (hashList && !hashDirty)
insertHash (b);
}
/** Reinitialize hash list. @internal */
void TDEZoneAllocator::initHash()
{
if (hashList) {
for (unsigned int i = 0; i < hashSize; i++)
delete hashList[i];
delete [] hashList;
hashList = 0;
}
hashSize = 1;
while (hashSize < num_blocks)
hashSize <<= 1;
if (hashSize < 1024)
hashSize = 1024;
if (hashSize > 64*1024)
hashSize = 64*1024;
hashList = new TQValueList<MemBlock *> *[hashSize];
memset (hashList, 0, sizeof(TQValueList<MemBlock*> *) * hashSize);
hashDirty = false;
for (MemBlock *b = currentBlock; b; b = b->older)
insertHash(b);
}
/** Delete a memory block. This @em really returns the memory to the heap.
@param b block to delete
@internal
*/
void TDEZoneAllocator::delBlock(MemBlock *b)
{
/* Update also the hashlists if we aren't going to reconstruct them
soon. */
if (hashList && !hashDirty) {
unsigned long adr = ((unsigned long)b->begin) & (~(blockSize - 1));
unsigned long end = ((unsigned long)b->begin) + blockSize;
while (adr < end) {
unsigned long key = adr >> log2;
key = key & (hashSize - 1);
if (hashList[key]) {
TQValueList<MemBlock *> *list = hashList[key];
TQValueList<MemBlock *>::Iterator it = list->begin();
TQValueList<MemBlock *>::Iterator endit = list->end();
for (; it != endit; ++it)
if (*it == b) {
list->remove(it);
break;
}
}
adr += blockSize;
}
}
if (b->older)
b->older->newer = b->newer;
if (b->newer)
b->newer->older = b->older;
if (b == currentBlock) {
currentBlock = 0;
blockOffset = blockSize;
}
delete b;
num_blocks--;
}
void *
TDEZoneAllocator::allocate(size_t _size)
{
// Use the size of (void *) as alignment
const size_t alignment = sizeof(void *) - 1;
_size = (_size + alignment) & ~alignment;
if ((unsigned long) _size + blockOffset > blockSize)
{
if (_size > blockSize) {
tqDebug("TDEZoneAllocator: allocating more than %lu bytes", blockSize);
return 0;
}
addBlock(new MemBlock(blockSize));
blockOffset = 0;
//tqDebug ("Allocating block #%d (%x)\n", num_blocks, currentBlock->begin);
}
void *result = (void *)(currentBlock->begin+blockOffset);
currentBlock->ref++;
blockOffset += _size;
return result;
}
void
TDEZoneAllocator::deallocate(void *ptr)
{
if (hashDirty)
initHash();
unsigned long key = (((unsigned long)ptr) >> log2) & (hashSize - 1);
TQValueList<MemBlock *> *list = hashList[key];
if (!list) {
/* Can happen with certain usage pattern of intermixed free_since()
and deallocate(). */
//tqDebug("Uhoh");
return;
}
TQValueList<MemBlock*>::ConstIterator it = list->begin();
TQValueList<MemBlock*>::ConstIterator endit = list->end();
for (; it != endit; ++it) {
MemBlock *cur = *it;
if (cur->is_in(ptr)) {
if (!--cur->ref) {
if (cur != currentBlock)
delBlock (cur);
else
blockOffset = 0;
}
return;
}
}
/* Can happen with certain usage pattern of intermixed free_since()
and deallocate(). */
//tqDebug("Uhoh2");
}
void
TDEZoneAllocator::free_since(void *ptr)
{
/* If we have a hashList and it's not yet dirty, see, if we will dirty
it by removing too many blocks. This will make the below delBlock()s
faster. */
if (hashList && !hashDirty)
{
const MemBlock *b;
unsigned int removed = 0;
for (b = currentBlock; b; b = b->older, removed++)
if (b->is_in (ptr))
break;
if (hashSize >= 4 * (num_blocks - removed))
hashDirty = true;
}
while (currentBlock && !currentBlock->is_in(ptr)) {
currentBlock = currentBlock->older;
delBlock (currentBlock->newer);
}
blockOffset = ((char*)ptr) - currentBlock->begin;
}
|