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
|
/*
SuperCollider real time audio synthesis system
Copyright (c) 2002 James McCartney. All rights reserved.
http://www.audiosynth.com
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
AdvancingAllocPool implements a simple advancing pointer allocation scheme.
There is no Free(). All objects in the pool are freed at once with FreeAll().
Thus it is very fast.
*/
#ifndef _AdvancingAllocPool_
#define _AdvancingAllocPool_
#include <stdexcept>
#include <stdlib.h>
class AllocPool;
struct AdvancingAllocPoolChunk;
typedef int int32;
inline void FailNil(void *ptr) {
if (!ptr) throw std::runtime_error("alloc failed");
}
struct AdvancingAllocPoolChunkHdr {
AdvancingAllocPoolChunk *mNext;
size_t mSize;
int32 mPad1, mPad2;
};
struct AdvancingAllocPoolChunk {
AdvancingAllocPoolChunk *mNext;
size_t mSize;
int32 mPad1, mPad2;
char mSpace[16];
};
class AdvancingAllocPool
{
public:
AdvancingAllocPool();
~AdvancingAllocPool() { FreeAll(); }
void Init(AllocPool *inAllocPool, size_t initSize, size_t growSize, size_t tooBigSize);
void *Alloc(size_t inBytes);
void FreeAll();
bool SanityCheck();
private:
void AddChunk(size_t inSize);
AllocPool* mAllocPool;
size_t mInitSize;
size_t mGrowSize;
size_t mCurSize;
size_t mTooBig;
AdvancingAllocPoolChunk *mChunks;
AdvancingAllocPoolChunk *mFatties;
};
#endif
|
