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
|
/*
* Copyright 2010-2018 Branimir Karadzic. All rights reserved.
* License: https://github.com/bkaradzic/bx#license-bsd-2-clause
*/
#include "test.h"
#include <bx/sort.h>
#include <bx/allocator.h>
bx::DefaultAllocator g_allocator0;
struct TinyStlAllocator
{
static void* static_allocate(size_t _bytes)
{
return BX_ALLOC(&g_allocator0, _bytes);
}
static void static_deallocate(void* _ptr, size_t /*_bytes*/)
{
if (NULL != _ptr)
{
BX_FREE(&g_allocator0, _ptr);
}
}
};
#define TINYSTL_ALLOCATOR ::TinyStlAllocator
#include <tinystl/vector.h>
namespace stl = tinystl;
namespace bx
{
struct Blk
{
static const uint64_t kInvalid = UINT64_MAX;
Blk()
: ptr(kInvalid)
, size(0)
{
}
Blk(uint64_t _ptr, uint32_t _size)
: ptr(_ptr)
, size(_size)
{
}
uint64_t ptr;
uint32_t size;
};
inline bool operator<(const Blk& _lhs, const Blk& _rhs)
{
return _lhs.ptr < _rhs.ptr;
}
inline bool isValid(const Blk& _blk)
{
return Blk::kInvalid != _blk.ptr;
}
// First-fit non-local allocator.
class NonLocalAllocator
{
public:
NonLocalAllocator()
{
reset();
}
~NonLocalAllocator()
{
}
void reset()
{
m_free.clear();
m_used = 0;
}
void add(const Blk& _blk)
{
m_free.push_back(_blk);
}
Blk remove()
{
BX_CHECK(0 == m_used, "");
if (0 < m_free.size() )
{
Blk freeBlock = m_free.back();
m_free.pop_back();
return freeBlock;
}
return Blk{};
}
Blk alloc(uint32_t _size)
{
_size = max(_size, 16u);
for (FreeList::iterator it = m_free.begin(), itEnd = m_free.end(); it != itEnd; ++it)
{
if (it->size >= _size)
{
uint64_t ptr = it->ptr;
if (it->size != _size)
{
it->size -= _size;
it->ptr += _size;
}
else
{
m_free.erase(it);
}
m_used += _size;
return Blk{ ptr, _size };
}
}
// there is no block large enough.
return Blk{};
}
void free(const Blk& _blk)
{
m_used -= _blk.size;
m_free.push_back(_blk);
compact();
}
bool compact()
{
bx::quickSort(
m_free.begin()
, uint32_t(m_free.end() - m_free.begin() )
, sizeof(Blk)
, [](const void* _a, const void* _b) -> int32_t {
const Blk& lhs = *(const Blk*)(_a);
const Blk& rhs = *(const Blk*)(_b);
return lhs < rhs ? -1 : 1;
});
for (FreeList::iterator it = m_free.begin(), next = it, itEnd = m_free.end(); next != itEnd;)
{
if ( (it->ptr + it->size) == next->ptr)
{
it->size += next->size;
next = m_free.erase(next);
}
else
{
it = next;
++next;
}
}
return 0 == m_used;
}
uint32_t getUsed() const
{
return m_used;
}
private:
typedef stl::vector<Blk> FreeList;
FreeList m_free;
uint32_t m_used;
};
} // namespace bx
TEST_CASE("nlalloc")
{
bx::NonLocalAllocator nla;
bx::Blk blk;
blk = nla.alloc(100);
REQUIRE(!isValid(blk) );
nla.add(bx::Blk{0x1000, 100});
blk = nla.alloc(100);
REQUIRE(isValid(blk) );
nla.free(blk);
REQUIRE(0 == nla.getUsed() );
}
|