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
|
/* Copyright (C) 2011 Wildfire Games.
*
* 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.
*/
/*
* pool allocator
*/
#include "precompiled.h"
#include "lib/allocators/pool.h"
#include "lib/alignment.h"
#include "lib/allocators/freelist.h"
#include "lib/allocators/allocator_adapters.h"
#include "lib/timer.h"
namespace Allocators {
template<class Storage>
struct BasicPoolTest
{
void operator()() const
{
Pool<double, Storage> p(100);
const size_t initialSpace = p.RemainingObjects();
double* p1 = p.Allocate();
ENSURE(p1 != 0);
ENSURE(p.Contains(uintptr_t(p1)));
ENSURE(p.RemainingObjects() == initialSpace-1);
ENSURE(p.Contains(uintptr_t(p1)+1));
ENSURE(p.Contains(uintptr_t(p1)+sizeof(double)-1));
ENSURE(!p.Contains(uintptr_t(p1)-1));
ENSURE(!p.Contains(uintptr_t(p1)+sizeof(double)));
if(p.RemainingObjects() == 0)
ENSURE(p.Allocate() == 0); // full
else
ENSURE(p.Allocate() != 0); // can still expand
p.DeallocateAll();
ENSURE(!p.Contains(uintptr_t(p1)));
p1 = p.Allocate();
ENSURE(p1 != 0);
ENSURE(p.Contains(uintptr_t(p1)));
ENSURE(p.RemainingObjects() == initialSpace-1);
double* p2 = p.Allocate();
ENSURE(p2 != 0);
ENSURE(p.Contains(uintptr_t(p2)));
ENSURE(p.RemainingObjects() == initialSpace-2);
ENSURE(p2 == (double*)(uintptr_t(p1)+sizeof(double)));
if(p.RemainingObjects() == 0)
ENSURE(p.Allocate() == 0); // full
else
ENSURE(p.Allocate() != 0); // can still expand
}
};
void TestPool()
{
ForEachStorage<BasicPoolTest>();
}
} // namespace Allocators
TIMER_ADD_CLIENT(tc_pool_alloc);
Status pool_create(Pool* p, size_t max_size, size_t el_size)
{
if(el_size == POOL_VARIABLE_ALLOCS)
p->el_size = 0;
else
p->el_size = Align<allocationAlignment>(el_size);
p->freelist = mem_freelist_Sentinel();
RETURN_STATUS_IF_ERR(da_alloc(&p->da, max_size));
return INFO::OK;
}
Status pool_destroy(Pool* p)
{
// don't be picky and complain if the freelist isn't empty;
// we don't care since it's all part of the da anyway.
// however, zero it to prevent further allocs from succeeding.
p->freelist = mem_freelist_Sentinel();
return da_free(&p->da);
}
bool pool_contains(const Pool* p, void* el)
{
// outside of our range
if(!(p->da.base <= el && el < p->da.base+p->da.pos))
return false;
// sanity check: it should be aligned (if pool has fixed-size elements)
if(p->el_size)
ENSURE((uintptr_t)((u8*)el - p->da.base) % p->el_size == 0);
return true;
}
void* pool_alloc(Pool* p, size_t size)
{
TIMER_ACCRUE(tc_pool_alloc);
// if pool allows variable sizes, go with the size parameter,
// otherwise the pool el_size setting.
const size_t el_size = p->el_size? p->el_size : Align<allocationAlignment>(size);
ASSERT(el_size != 0);
// note: freelist is always empty in pools with variable-sized elements
// because they disallow pool_free.
void* el = mem_freelist_Detach(p->freelist);
if(!el) // freelist empty, need to allocate a new entry
{
// expand, if necessary
if(da_reserve(&p->da, el_size) < 0)
return 0;
el = p->da.base + p->da.pos;
p->da.pos += el_size;
}
ASSERT(pool_contains(p, el)); // paranoia
return el;
}
void pool_free(Pool* p, void* el)
{
// only allowed to free items if we were initialized with
// fixed el_size. (this avoids having to pass el_size here and
// check if requested_size matches that when allocating)
if(p->el_size == 0)
{
DEBUG_WARN_ERR(ERR::LOGIC); // cannot free variable-size items
return;
}
if(pool_contains(p, el))
mem_freelist_AddToFront(p->freelist, el);
else
DEBUG_WARN_ERR(ERR::LOGIC); // invalid pointer (not in pool)
}
void pool_free_all(Pool* p)
{
p->freelist = mem_freelist_Sentinel();
// must be reset before da_set_size or CHECK_DA will complain.
p->da.pos = 0;
da_set_size(&p->da, 0);
}
size_t pool_committed(Pool* p)
{
return p->da.cur_size;
}
|
