pool_test-inl.h
5.71 KB
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
/*
* Copyright (c) 2014-2016, Siemens AG. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef CONTAINERS_CPP_TEST_POOL_TEST_INL_H_
#define CONTAINERS_CPP_TEST_POOL_TEST_INL_H_
#include <utility>
#include <algorithm>
#include <vector>
namespace embb {
namespace containers {
namespace test {
template<typename ValuePool_t>
const int PoolTest<ValuePool_t>::pool_elements_per_thread = 5;
template<typename ValuePool_t>
PoolTest<ValuePool_t>::PoolTest() :
number_threads_(static_cast<int>
(partest::TestSuite::GetDefaultNumThreads())) {
CreateUnit("PoolTestStatic").Add(&PoolTest::PoolTestStatic, this);
CreateUnit("AllocFreeParallel")
.Pre(&PoolTest::PreAllocFreeParallel, this)
.Add(&PoolTest::AllocFreeParallel, this,
static_cast<size_t>(number_threads_),
static_cast<size_t>(10000))
.Post(&PoolTest::PostAllocFreeParallel, this);
}
template<typename ValuePool_t>
void PoolTest<ValuePool_t>::PreAllocFreeParallel() {
std::vector< int > elements;
for (int i = 0; i != (number_threads_*pool_elements_per_thread); ++i) {
elements.push_back(i + 1);
}
pool = new ValuePool_t(elements.begin(), elements.end());
}
template<typename ValuePool_t>
void PoolTest<ValuePool_t>::AllocFreeParallel() {
::std::vector< ::std::pair<int, int> > allocated;
for (int i = 0; i != pool_elements_per_thread; ++i) {
int element = 0;
int index = pool->Allocate(element);
//memory is not allowed to run out
PT_ASSERT(index != -1);
//we aren't not allowed to get anything that was not contained in the
//beginning
PT_ASSERT(element > 0 &&
element <= (number_threads_*pool_elements_per_thread));
allocated.push_back(::std::make_pair(element, index));
}
for (int i = 0; i != pool_elements_per_thread; ++i) {
for (int j = 0; j != pool_elements_per_thread; ++j) {
if (i == j) continue;
//we should never get equal elements!
PT_EXPECT(allocated[static_cast<unsigned int>(i)]
.first != allocated[static_cast<unsigned int>(j)].first);
}
}
for (int i = 0; i != pool_elements_per_thread; ++i) {
pool->Free(allocated[static_cast<unsigned int>(i)].first,
allocated[static_cast<unsigned int>(i)].second);
}
}
template<typename ValuePool_t>
void PoolTest<ValuePool_t>::PostAllocFreeParallel() {
int poolsize = (number_threads_*pool_elements_per_thread);
::std::vector<int> elements;
for (int i = 0; i != poolsize; ++i) {
int element;
int index = pool->Allocate(element);
//all elements shall be returned... we shall not run out of mem.
PT_EXPECT(index != -1);
elements.push_back(element);
}
::std::sort(elements.begin(), elements.end());
//after all threads are finished, the same elements than in the beginning
//shall be contained
for (int i = 0; i != poolsize; ++i) {
PT_EXPECT(elements[static_cast<unsigned int>(i)] == i+1);
}
delete pool;
}
template<typename ValuePool_t>
void PoolTest<ValuePool_t>::PoolTestStatic() {
size_t size = 100;
int* arr = new int[size];
for (int i = 0; i != static_cast<int>(size); ++i) {
arr[static_cast<unsigned int>(i)] = i;
}
//create pool with bottom element -1, elements 0-(size-1) are added
ValuePool_t ap(arr, arr + size);
int element;
int index;
std::vector< std::pair<int, int> > allocated;
//as long as possible, allocate elements
while ((index = ap.Allocate(element)) != -1) {
//write allocated elements to vector, to be able to
//free again!
allocated.push_back(std::make_pair(element, index));
}
std::vector<int> indexes_to_free;
//determine some elements we want to free
indexes_to_free.push_back(5);
indexes_to_free.push_back(16);
indexes_to_free.push_back(43);
indexes_to_free.push_back(90);
for (int i = 0; i != static_cast<int>(indexes_to_free.size()); ++i) {
//free those elements
ap.Free(allocated[static_cast<unsigned int>(
indexes_to_free[static_cast<unsigned int>(i)])].first,
allocated[static_cast<unsigned int>(
indexes_to_free[static_cast<unsigned int>(i)])]
.second);
}
//if we allocate again, we should get those elements
for (int i = 0; i != static_cast<int>(indexes_to_free.size()); i++) {
index = ap.Allocate(element);
PT_EXPECT((index != -1));
std::vector<int>::iterator it;
it = std::find(indexes_to_free.begin(), indexes_to_free.end(), element);
PT_EXPECT(it != indexes_to_free.end());
}
}
} // namespace test
} // namespace containers
} // namespace embb
#endif // CONTAINERS_CPP_TEST_POOL_TEST_INL_H_