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
|
/*
* Copyright (c) 2020 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <gtest/gtest.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <unistd.h>
#include <netinet/in.h>
extern "C" {
#define WITH_TESTS
#include <hicn/base/pool.h>
}
/*
* TODO
* - test max_size
*/
#define DEFAULT_SIZE 10
class PoolTest : public ::testing::Test {
protected:
PoolTest() { }
virtual ~PoolTest() { }
int *pool;
};
TEST_F(PoolTest, PoolAllocation)
{
int rc;
pool_init(pool, DEFAULT_SIZE, 0);
size_t pool_size = next_pow2(DEFAULT_SIZE);
EXPECT_EQ(pool_get_alloc_size(pool), pool_size);
/* Check that free indices and bitmaps are correctly initialize */
off_t * fi = pool_get_free_indices(pool);
EXPECT_EQ(vector_len(fi), pool_size);
EXPECT_EQ(fi[0], (long) (pool_size - 1));
EXPECT_EQ(fi[pool_size - 1], 0);
/* The allocated size of the underlying vector should be the next power of two */
EXPECT_EQ(vector_get_alloc_size(fi), pool_size);
bitmap_t * fb = pool_get_free_bitmap(pool);
EXPECT_TRUE(bitmap_is_set(fb, 0));
EXPECT_TRUE(bitmap_is_set(fb, pool_size - 2));
EXPECT_TRUE(bitmap_is_set(fb, pool_size - 1));
EXPECT_TRUE(bitmap_is_unset(fb, pool_size));
/* Getting elements from the pool should correctly update the free indices
* and bitmap */
int * elt;
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
EXPECT_EQ(vector_len(fi), pool_size - 1);
EXPECT_TRUE(bitmap_is_unset(fb, 0));
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
EXPECT_EQ(vector_len(fi), pool_size - 2);
EXPECT_TRUE(bitmap_is_unset(fb, 1));
for (unsigned i = 0; i < pool_size - 4; i++) {
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
}
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
EXPECT_EQ(vector_len(fi), 1UL);
EXPECT_TRUE(bitmap_is_unset(fb, pool_size - 2));
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
EXPECT_EQ(vector_len(fi), 0UL);
EXPECT_TRUE(bitmap_is_unset(fb, pool_size - 1));
/*
* Getting elements within the allocated range should not have triggered a
* resize
*/
EXPECT_EQ(pool_len(pool), pool_size);
/*
* Getting elements once the allocated range has been exceeded should
* trigger a resize
*/
rc = pool_get(pool, elt);
EXPECT_GE(rc, 0);
EXPECT_EQ(pool_get_alloc_size(pool), pool_size * 2);
EXPECT_EQ(pool_len(pool), pool_size + 1);
/*
* Doubling the size, we should have again pool_size elements free, minus 1
*/
EXPECT_EQ(pool_get_free_indices_size(pool), pool_size - 1);
/*
* NOTE: this is wrong as there has been a realloc and the old fi
* pointer is now invalid
*/
//EXPECT_EQ(vector_len(fi), pool_size - 1);
/* And the bitmap should also be correctly modified */
fb = pool_get_free_bitmap(pool);
EXPECT_TRUE(bitmap_is_unset(fb, pool_size));
/* Check that surrounding values are also correct */
EXPECT_TRUE(bitmap_is_unset(fb, pool_size - 1));
EXPECT_TRUE(bitmap_is_set(fb, pool_size + 1));
/* Setting elements after should through */
/* Check that free indices and bitmaps are correctly updated */
pool_free(pool);
}
TEST_F(PoolTest, PoolPut)
{
pool_init(pool, DEFAULT_SIZE, 0);
int* elt;
pool_get(pool, elt);
*elt = 10;
pool_put(pool, elt);
pool_free(pool);
}
TEST_F(PoolTest, PoolGetForceBitmapRealloc)
{
const int N = 64;
int *elts[N];
int *elt = NULL;
pool_init(pool, N, 0);
for (int i = 0; i < N; i++)
pool_get(pool, elts[i]);
pool_get(pool, elt);
pool_free(pool);
}
TEST_F(PoolTest, PoolGetAfterReleasing)
{
int *elt1 = NULL, *elt2 = NULL, *tmp = NULL;
pool_init(pool, DEFAULT_SIZE, 0);
// If two elements are requested...
off_t id1 = pool_get(pool, elt1);
pool_get(pool, tmp);
// ...and the first one is released...
pool_put(pool, elt1);
// ...requesting a new one should return
// the first one (that was freed)
off_t id2 = pool_get(pool, elt2);
EXPECT_EQ(id1, id2);
EXPECT_EQ(elt1, elt2);
pool_free(pool);
}
TEST_F(PoolTest, PoolGetMultipleElementsAfterReleasing)
{
const int N = 2;
int *elts[N];
pool_init(pool, N, 0);
for (int i = 0; i < N; i++)
pool_get(pool, elts[i]);
for (int i = 0; i < N; i++)
pool_put(pool, elts[i]);
for (int i = 0; i < N; i++)
pool_get(pool, elts[i]);
pool_free(pool);
}
int main(int argc, char **argv)
{
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
|
