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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
|
#include "memory.hpp"
#include <gmock/gmock.h>
#include <gtest/gtest.h>
struct TMemBlock {
char *data;
size_t size;
};
struct TMemBucket {
int64_t size;
int64_t head;
int64_t lostBytes;
int64_t allocs;
int64_t lastEmptyBlockIndex;
int64_t maxBlockCount;
TMemBlock *blocks;
char *ptr;
bool transient;
};
class MemoryTest : public ::testing::Test {
protected:
void SetUp() override {
MemBkt_Test = Pke_BeginTransientBucket(1024 * 1024);
bkt = reinterpret_cast<TMemBucket *>(MemBkt_Test);
};
void TearDown() override {
Pke_EndTransientBucket(MemBkt_Test);
};
MemBucket *MemBkt_Test = nullptr;
TMemBucket *bkt = nullptr;
};
/*
* Test that memory can be allocated at the head without misalignment
*/
TEST_F(MemoryTest, EnsureAllocation001) {
// arrange
size_t sz = 2;
size_t alignment = 1;
// act
Pke_New(sz, alignment, MemBkt_Test);
// assert
EXPECT_EQ(-1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(sz, bkt->head);
};
/*
* Test that memory can be allocated at the head with misalignment
*/
TEST_F(MemoryTest, EnsureAllocation002) {
// arrange
// act
Pke_New(2, 1, MemBkt_Test);
Pke_New(8, 16, MemBkt_Test);
// assert
EXPECT_EQ(0, bkt->lastEmptyBlockIndex);
EXPECT_EQ(24, bkt->head);
EXPECT_EQ(bkt->ptr + 2, bkt->blocks[0].data);
EXPECT_EQ(14, bkt->blocks[0].size);
};
/*
* Test that memory can be allocated into a blank block without misalignment
*/
TEST_F(MemoryTest, EnsureAllocation003) {
// arrange
// act
Pke_New(1, 1, MemBkt_Test);
Pke_New(1, 64, MemBkt_Test);
Pke_New(9, 1, MemBkt_Test);
// assert
EXPECT_EQ(0, bkt->lastEmptyBlockIndex);
EXPECT_EQ(65, bkt->head);
EXPECT_EQ(bkt->ptr + 10, bkt->blocks[0].data);
EXPECT_EQ(54, bkt->blocks[0].size);
};
/*
* Test that memory can be allocated into a blank block with misalignment
*/
TEST_F(MemoryTest, EnsureAllocation004) {
// arrange
// act
Pke_New(1, 1, MemBkt_Test);
Pke_New(1, 64, MemBkt_Test);
Pke_New(9, 16, MemBkt_Test);
// assert
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(65, bkt->head);
EXPECT_EQ(bkt->ptr + 1, bkt->blocks[0].data);
EXPECT_EQ(15, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 25, bkt->blocks[1].data);
EXPECT_EQ(39, bkt->blocks[1].size);
};
/*
* Test that memory can be freed predictably
*/
TEST_F(MemoryTest, EnsureFree001) {
// arrange
size_t sz = 2;
size_t alignment = 1;
// act
void *ptr1 = Pke_New(sz, alignment, MemBkt_Test);
Pke_Delete(ptr1, sz, MemBkt_Test);
// assert
EXPECT_EQ(-1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(0, bkt->head);
};
/* allocation events
* 1st = alignment 01, size 02, move head ( =02 )
* 2nd = alignment 64, size 16, move head ( =80 ) memBlock { +02, 62 }
* 3rd = alignment 16, size 16, memBlock { +2, 14 } memBlock { +32, 32 }
* 4th = alignment 08, size 04, memBlock { +2, 06 } memBlock { +12, 04 } memBlock { +32, 32 }
*/
/*
* Test that memory can be allocated and freed predictably
*/
class MemoryTestScenario100 : public MemoryTest {
void SetUp() override {
MemoryTest::SetUp();
for (long i = 0; i < cnt; ++i) {
ptrs[i] = Pke_New(sz[i], alignment[i], MemBkt_Test);
}
}
protected:
void TestExpectedState() {
EXPECT_EQ(2, bkt->lastEmptyBlockIndex);
EXPECT_EQ(80, bkt->head);
EXPECT_EQ(bkt->ptr + 00, ptrs[0]);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 16, ptrs[2]);
EXPECT_EQ(bkt->ptr + 8, ptrs[3]);
}
const long cnt = 4;
const size_t sz[4] = {2, 16, 16, 4};
const size_t alignment[4] = {1, 64, 16, 8};
void * ptrs[4];
};
TEST_F(MemoryTestScenario100, EnsureAllocFree0000) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
// act
// assert
EXPECT_EQ(bkt->ptr + 2, bkt->blocks[0].data);
EXPECT_EQ(6, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 12, bkt->blocks[1].data);
EXPECT_EQ(4, bkt->blocks[1].size);
EXPECT_EQ(bkt->ptr + 32, bkt->blocks[2].data);
EXPECT_EQ(32, bkt->blocks[2].size);
}
TEST_F(MemoryTestScenario100, EnsureAllocFree1000) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
size_t expectedHead = 80;
long freeIndex = 0;
// act
/* free events
* 1st = ptr +00, size 02, memBlock { +00, 08 }
*/
Pke_Delete(ptrs[freeIndex], sz[freeIndex], MemBkt_Test);
// assert
EXPECT_EQ(2, bkt->lastEmptyBlockIndex);
EXPECT_EQ(expectedHead, bkt->head);
EXPECT_EQ(bkt->ptr + 0, bkt->blocks[0].data);
EXPECT_EQ(8, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 12, bkt->blocks[1].data);
EXPECT_EQ(4, bkt->blocks[1].size);
EXPECT_EQ(bkt->ptr + 32, bkt->blocks[2].data);
EXPECT_EQ(32, bkt->blocks[2].size);
};
TEST_F(MemoryTestScenario100, EnsureAllocFree0100) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
size_t expectedHead = 32;
long freeIndex = 1;
// act
/* free events
* 1st = ptr +64, size 16, move head ( =32 ) memBlock { +02, 06 } memBlock { +12, 4 }
*/
Pke_Delete(ptrs[freeIndex], sz[freeIndex], MemBkt_Test);
// assert
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(expectedHead, bkt->head);
EXPECT_EQ(bkt->ptr + 2, bkt->blocks[0].data);
EXPECT_EQ(6, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 12, bkt->blocks[1].data);
EXPECT_EQ(4, bkt->blocks[1].size);
};
TEST_F(MemoryTestScenario100, EnsureAllocFree0010) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
size_t expectedHead = 80;
long freeIndex = 2;
// act
/* free events
* 1st = ptr +16, size 16, memBlock { +02, 06 } memBlock { +12, 04 } memBlock { +16, 48 }
* memBlock { +02, 06 } memBlock { +12, 52 }
*/
Pke_Delete(ptrs[freeIndex], sz[freeIndex], MemBkt_Test);
// assert
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(expectedHead, bkt->head);
EXPECT_EQ(bkt->ptr + 2, bkt->blocks[0].data);
EXPECT_EQ(6, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 12, bkt->blocks[1].data);
EXPECT_EQ(52, bkt->blocks[1].size);
}
TEST_F(MemoryTestScenario100, EnsureAllocFree0001) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
size_t expectedHead = 80;
long freeIndex = 3;
// act
/* free events
* 1st = ptr +08, size 4, memBlock { +02, 06 } memBlock { +08, 08 } memBlock { +32, 32 }
* memBlock { +02, 14 } memBlock { +32, 32 }
*/
Pke_Delete(ptrs[freeIndex], sz[freeIndex], MemBkt_Test);
// assert
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(expectedHead, bkt->head);
EXPECT_EQ(bkt->ptr + 2, bkt->blocks[0].data);
EXPECT_EQ(14, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 32, bkt->blocks[1].data);
EXPECT_EQ(32, bkt->blocks[1].size);
}
class MemoryTestScenario200 : public MemoryTest {
void SetUp() override {
MemoryTest::SetUp();
for (long i = 0; i < cnt; ++i) {
ptrs[i] = Pke_New(sz[i], alignment[i], MemBkt_Test);
}
}
protected:
void TestExpectedState() {
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(65, bkt->head);
EXPECT_EQ(bkt->ptr + 00, ptrs[0]);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 32, ptrs[2]);
EXPECT_EQ(bkt->ptr + 19, bkt->blocks[0].data);
EXPECT_EQ(13, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 33, bkt->blocks[1].data);
EXPECT_EQ(31, bkt->blocks[1].size);
}
const long cnt = 3;
const size_t sz[3] = {19, 1, 1};
const size_t alignment[3] = {1, 64, 32};
void * ptrs[3];
};
/* memory
* [00-18] (19) ptr0
* [19-31] (13) MemBlock
* [ 32 ] ( 1) ptr2
* [33-63] (31) MemBlock
* [ 64 ] ( 1) ptr1
* [ 65 ] ( 0) HEAD
*/
/*
* Test that memory can be freed touching after only
*/
TEST_F(MemoryTestScenario200, EnsureFreeTouchingAfter) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
// act
// frees [00-18] which gets absorbed into [19-31]
// [00-31] MemBlock
Pke_Delete(ptrs[0], 19, MemBkt_Test);
// assert
EXPECT_EQ(1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(65, bkt->head);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 32, ptrs[2]);
EXPECT_EQ(bkt->ptr + 0, bkt->blocks[0].data);
EXPECT_EQ(32, bkt->blocks[0].size);
EXPECT_EQ(bkt->ptr + 33, bkt->blocks[1].data);
EXPECT_EQ(31, bkt->blocks[1].size);
};
/*
* Test that memory can be freed touching before only
*/
TEST_F(MemoryTestScenario200, EnsureFreeTouchingBefore) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
// act 1
// fill everything, then allocate [65], moving HEAD
// [00-18] (19) ptr0
// [19-31] (13) ptr3
// [ 32 ] ( 1) ptr2
// [33-63] (31) ptr4
// [ 64 ] ( 1) ptr1
// [ 65 ] ( 1) ptr5
// [ 66 ] ( 0) HEAD
void *ptr3 = Pke_New(13, 1, MemBkt_Test);
void *ptr4 = Pke_New(31, 1, MemBkt_Test);
void *ptr5 = Pke_New( 1, 1, MemBkt_Test);
// assert 1
EXPECT_EQ(-1, bkt->lastEmptyBlockIndex);
EXPECT_EQ(66, bkt->head);
EXPECT_EQ(bkt->ptr + 00, ptrs[0]);
EXPECT_EQ(bkt->ptr + 19, ptr3);
EXPECT_EQ(bkt->ptr + 32, ptrs[2]);
EXPECT_EQ(bkt->ptr + 33, ptr4);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 65, ptr5);
// act 2
// free [19-31]
// [00-18] (19) ptr0
// [19-31] (13) MemBlock
// [ 32 ] ( 1) ptr2
// [33-63] (31) ptr4
// [ 64 ] ( 1) ptr1
// [ 65 ] ( 1) ptr5
// [ 66 ] ( 0) HEAD
Pke_Delete(ptr3, 13, MemBkt_Test);
ptr3 = nullptr;
// assert 2
EXPECT_EQ( 0, bkt->lastEmptyBlockIndex);
EXPECT_EQ(66, bkt->head);
EXPECT_EQ(bkt->ptr + 00, ptrs[0]);
EXPECT_EQ(nullptr, ptr3);
EXPECT_EQ(bkt->ptr + 32, ptrs[2]);
EXPECT_EQ(bkt->ptr + 33, ptr4);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 65, ptr5);
EXPECT_EQ(bkt->ptr + 19, bkt->blocks[0].data);
EXPECT_EQ(13, bkt->blocks[0].size);
// act 3
// free [32] which gets absorbed into 19-32
// [19-32] (14) MemBlock
// [33-63] (31) ptr4
Pke_Delete(ptrs[2], 1, MemBkt_Test);
ptrs[2] = nullptr;
// assert 3
EXPECT_EQ( 0, bkt->lastEmptyBlockIndex);
EXPECT_EQ(66, bkt->head);
EXPECT_EQ(bkt->ptr + 00, ptrs[0]);
EXPECT_EQ(nullptr, ptr3);
EXPECT_EQ(nullptr, ptrs[2]);
EXPECT_EQ(bkt->ptr + 33, ptr4);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(bkt->ptr + 65, ptr5);
EXPECT_EQ(bkt->ptr + 19, bkt->blocks[0].data);
EXPECT_EQ(14, bkt->blocks[0].size);
};
/*
* Test that memory can be freed touching before and after
*/
TEST_F(MemoryTestScenario200, EnsureFreeTouchingBoth) {
EXPECT_NO_FATAL_FAILURE(this->TestExpectedState());
// arrange
// act
// frees [32] which gets absorbed into [19-31]
// [00-18] (19) ptr0
// [19-63] (45) MemBlock
// [ 64 ] ( 1) ptr1
Pke_Delete(ptrs[2], 1, MemBkt_Test);
ptrs[2] = nullptr;
// assert
EXPECT_EQ(0, bkt->lastEmptyBlockIndex);
EXPECT_EQ(65, bkt->head);
EXPECT_EQ(bkt->ptr + 0, ptrs[0]);
EXPECT_EQ(bkt->ptr + 64, ptrs[1]);
EXPECT_EQ(nullptr , ptrs[2]);
EXPECT_EQ(bkt->ptr + 19, bkt->blocks[0].data);
EXPECT_EQ(45, bkt->blocks[0].size);
};
|
