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
|
/*
* Copyright (C) 2012-2014 Alec Thomas <alec@swapoff.org>
* All rights reserved.
*
* This software is licensed as described in the file COPYING, which
* you should have received as part of this distribution.
*
* Author: Alec Thomas <alec@swapoff.org>
*/
#include <gtest/gtest.h>
#include <vector>
#include "entityx/help/Pool.h"
struct Position {
explicit Position(int *ptr = nullptr) : ptr(ptr) {
if (ptr) (*ptr)++;
}
~Position() {
if (ptr) (*ptr)++;
}
float x, y;
int *ptr;
};
TEST(PoolTest, TestPoolReserve) {
entityx::Pool<Position, 8> pool;
ASSERT_EQ(0, pool.capacity());
ASSERT_EQ(0, pool.chunks());
pool.reserve(8);
ASSERT_EQ(0, pool.size());
ASSERT_EQ(8, pool.capacity());
ASSERT_EQ(1, pool.chunks());
pool.reserve(16);
ASSERT_EQ(0, pool.size());
ASSERT_EQ(16, pool.capacity());
ASSERT_EQ(2, pool.chunks());
}
TEST(PoolTest, TestPoolPointers) {
entityx::Pool<Position, 8> pool;
std::vector<char*> ptrs;
for (int i = 0; i < 4; i++) {
pool.expand(i * 8 + 8);
// NOTE: This is an attempt to ensure non-contiguous allocations from
// arena allocators.
ptrs.push_back(new char[8 * sizeof(Position)]);
}
char *p0 = static_cast<char*>(pool.get(0));
char *p7 = static_cast<char*>(pool.get(7));
char *p8 = static_cast<char*>(pool.get(8));
char *p16 = static_cast<char*>(pool.get(16));
char *p24 = static_cast<char*>(pool.get(24));
ASSERT_EQ(p0 + 7 * sizeof(Position), p7);
ASSERT_NE(p0 + 8 * sizeof(Position), p8);
ASSERT_NE(p8 + 8 * sizeof(Position), p16);
ASSERT_NE(p16 + 8 * sizeof(Position), p24);
}
TEST(PoolTest, TestDeconstruct) {
entityx::Pool<Position, 8> pool;
pool.expand(8);
void *p0 = pool.get(0);
int counter = 0;
new(p0) Position(&counter);
ASSERT_EQ(1, counter);
pool.destroy(0);
ASSERT_EQ(2, counter);
}
|
