-
Notifications
You must be signed in to change notification settings - Fork 47
Expand file tree
/
Copy pathdisjoint_pool.cpp
More file actions
457 lines (366 loc) · 16.3 KB
/
Copy pathdisjoint_pool.cpp
File metadata and controls
457 lines (366 loc) · 16.3 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
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
445
446
447
448
449
450
451
452
453
454
455
456
457
// Copyright (C) 2023-2025 Intel Corporation
// Under the Apache License v2.0 with LLVM Exceptions. See LICENSE.TXT.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
#include <memory>
#include <umf/pools/pool_disjoint.h>
#include "pool.hpp"
#include "pool/pool_disjoint_internal.h"
#include "poolFixtures.hpp"
#include "provider.hpp"
#include "provider_null.h"
#include "provider_trace.h"
using umf_test::test;
using namespace umf_test;
TEST_F(test, internals) {
static umf_result_t expectedResult = UMF_RESULT_SUCCESS;
struct memory_provider : public umf_test::provider_base_t {
umf_result_t alloc(size_t size, size_t alignment, void **ptr) noexcept {
*ptr = umf_ba_global_aligned_alloc(size, alignment);
return UMF_RESULT_SUCCESS;
}
umf_result_t free(void *ptr, [[maybe_unused]] size_t size) noexcept {
// do the actual free only when we expect the success
if (expectedResult == UMF_RESULT_SUCCESS) {
umf_ba_global_free(ptr);
}
return expectedResult;
}
umf_result_t
get_min_page_size([[maybe_unused]] const void *ptr,
[[maybe_unused]] size_t *pageSize) noexcept {
*pageSize = 1024;
return UMF_RESULT_SUCCESS;
}
};
umf_memory_provider_ops_t provider_ops =
umf_test::providerMakeCOps<memory_provider, void>();
auto providerUnique =
wrapProviderUnique(createProviderChecked(&provider_ops, nullptr));
umf_memory_provider_handle_t provider_handle;
provider_handle = providerUnique.get();
umf_disjoint_pool_params_handle_t params =
(umf_disjoint_pool_params_handle_t)defaultDisjointPoolConfig();
// set to maximum tracing
params->pool_trace = 3;
params->max_poolable_size = 1024 * 1024;
// in "internals" test we use ops interface to directly manipulate the pool
// structure
const umf_memory_pool_ops_t *ops = umfDisjointPoolOps();
EXPECT_NE(ops, nullptr);
disjoint_pool_t *pool;
umf_result_t res = ops->initialize(provider_handle, params, (void **)&pool);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
EXPECT_NE(pool, nullptr);
EXPECT_EQ(pool->provider_min_page_size, 1024);
// check buckets sizes
size_t expected_size = DEFAULT_DISJOINT_MIN_BUCKET_SIZE;
EXPECT_EQ(pool->buckets[0]->size, expected_size);
EXPECT_EQ(pool->buckets[pool->buckets_num - 1]->size,
(size_t)1 << 31); // 2GB
for (size_t i = 0; i < pool->buckets_num; i++) {
bucket_t *bucket = pool->buckets[i];
EXPECT_NE(bucket, nullptr);
EXPECT_EQ(bucket->size, expected_size);
// assuming DEFAULT_DISJOINT_MIN_BUCKET_SIZE = 64, expected bucket
// sizes are: 64, 96, 128, 192, 256, ..., 2GB
if (i % 2 == 0) {
expected_size += expected_size / 2;
} else {
expected_size = DEFAULT_DISJOINT_MIN_BUCKET_SIZE << ((i + 1) / 2);
}
}
// test small allocations
size_t size = 8;
void *ptr = ops->malloc(pool, size);
EXPECT_NE(ptr, nullptr);
// get bucket - because of small size this should be the first bucket in
// the pool
bucket_t *bucket = pool->buckets[0];
EXPECT_NE(bucket, nullptr);
// check bucket stats
EXPECT_EQ(bucket->alloc_count, 1);
// first allocation will always use external memory (newly added to the
// pool) and this is counted as allocation from the outside of the pool
EXPECT_EQ(bucket->alloc_pool_count, 0);
EXPECT_EQ(bucket->curr_slabs_in_use, 1);
// check slab - there should be only single slab allocated
EXPECT_NE(bucket->available_slabs, nullptr);
EXPECT_EQ(bucket->available_slabs_num, 1);
EXPECT_EQ(bucket->available_slabs->next, nullptr);
slab_t *slab = bucket->available_slabs->val;
// check slab stats
EXPECT_GE(slab->slab_size, params->slab_min_size);
EXPECT_GE(slab->num_chunks_total, slab->slab_size / bucket->size);
// check allocation in slab
EXPECT_EQ(slab_read_chunk_bit(slab, 0), false);
EXPECT_EQ(slab_read_chunk_bit(slab, 1), true);
// TODO:
// * multiple alloc + free from single bucket
// * alignments
// * full slab alloc
// * slab overflow
// * chunked slabs
// * multiple alloc + free from different buckets
// * alloc something outside pool (> MaxPoolableSize)
// * test capacity
// * check minBucketSize
// * test large objects
// * check available_slabs_num
// cleanup
ops->finalize(pool);
umfDisjointPoolParamsDestroy(params);
}
TEST_F(test, internals_reuse) {
static umf_result_t expectedResult = UMF_RESULT_SUCCESS;
struct memory_provider : public umf_test::provider_base_t {
umf_result_t alloc(size_t size, size_t alignment, void **ptr) noexcept {
*ptr = umf_ba_global_aligned_alloc(size, alignment);
return UMF_RESULT_SUCCESS;
}
umf_result_t free(void *ptr, [[maybe_unused]] size_t size) noexcept {
// do the actual free only when we expect the success
if (expectedResult == UMF_RESULT_SUCCESS) {
umf_ba_global_free(ptr);
}
return expectedResult;
}
umf_result_t
get_min_page_size([[maybe_unused]] const void *ptr,
[[maybe_unused]] size_t *pageSize) noexcept {
*pageSize = 1024;
return UMF_RESULT_SUCCESS;
}
};
umf_memory_provider_ops_t provider_ops =
umf_test::providerMakeCOps<memory_provider, void>();
auto providerUnique =
wrapProviderUnique(createProviderChecked(&provider_ops, nullptr));
umf_memory_provider_handle_t provider_handle;
provider_handle = providerUnique.get();
umf_disjoint_pool_params_handle_t params =
(umf_disjoint_pool_params_handle_t)defaultDisjointPoolConfig();
// set to maximum tracing
params->pool_trace = 3;
params->max_poolable_size = 1024 * 1024;
params->capacity = 4;
params->reuse_strategy = 1;
// in "internals" test we use ops interface to directly manipulate the pool
// structure
const umf_memory_pool_ops_t *ops = umfDisjointPoolOps();
EXPECT_NE(ops, nullptr);
disjoint_pool_t *pool;
umf_result_t res = ops->initialize(provider_handle, params, (void **)&pool);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
EXPECT_NE(pool, nullptr);
EXPECT_EQ(pool->provider_min_page_size, 1024);
// allocate large object, free, then allocate small object and check if
// it is allocated from the same slab
size_t large_size = 1024;
void *ptr = ops->malloc(pool, large_size);
EXPECT_NE(ptr, nullptr);
// get slab and bucket
slab_t *large_slab =
(slab_t *)critnib_find_le(pool->known_slabs, (uintptr_t)ptr);
EXPECT_NE(large_slab, nullptr);
bucket_t *large_bucket = large_slab->bucket;
EXPECT_EQ(large_bucket->size, large_size);
// there is 1 slab in use and 0 completely free slabs available in the pool
EXPECT_EQ(large_bucket->curr_slabs_in_use, 1);
EXPECT_EQ(large_bucket->curr_slabs_in_pool, 0);
ops->free(pool, ptr);
EXPECT_EQ(large_bucket->available_slabs_num, 1);
EXPECT_EQ(large_bucket->curr_slabs_in_use, 0);
EXPECT_EQ(large_bucket->curr_slabs_in_pool, 1);
size_t small_size = 64;
ptr = ops->malloc(pool, small_size);
EXPECT_NE(ptr, nullptr);
// we should reuse the slab from the large bucket
EXPECT_EQ(large_bucket->available_slabs_num, 0);
EXPECT_EQ(large_bucket->curr_slabs_in_use, 0);
EXPECT_EQ(large_bucket->curr_slabs_in_pool, 0);
// get slab and bucket
slab_t *small_slab =
(slab_t *)critnib_find_le(pool->known_slabs, (uintptr_t)ptr);
EXPECT_NE(small_slab, nullptr);
bucket_t *small_bucket = small_slab->bucket;
EXPECT_EQ(small_bucket->size, small_size);
EXPECT_EQ(small_bucket->available_slabs_num, 1);
EXPECT_EQ(small_bucket->curr_slabs_in_use, 1);
EXPECT_EQ(small_bucket->curr_slabs_in_pool, 0);
// check if small object is allocated from the same memory as large
EXPECT_EQ(large_slab->mem_ptr, small_slab->mem_ptr);
// check that the whole large slab was divided into correct number of small
// chunks
EXPECT_EQ(small_slab->num_chunks_total,
large_size / small_size * large_slab->num_chunks_total);
// cleanup
ops->finalize(pool);
umfDisjointPoolParamsDestroy(params);
}
TEST_F(test, freeErrorPropagation) {
static umf_result_t expectedResult = UMF_RESULT_SUCCESS;
struct memory_provider : public umf_test::provider_base_t {
umf_result_t alloc(size_t size, size_t alignment, void **ptr) noexcept {
*ptr = umf_ba_global_aligned_alloc(size, alignment);
return UMF_RESULT_SUCCESS;
}
umf_result_t free(void *ptr, [[maybe_unused]] size_t size) noexcept {
// do the actual free only when we expect the success
if (expectedResult == UMF_RESULT_SUCCESS) {
umf_ba_global_free(ptr);
}
return expectedResult;
}
};
umf_memory_provider_ops_t provider_ops =
umf_test::providerMakeCOps<memory_provider, void>();
auto providerUnique =
wrapProviderUnique(createProviderChecked(&provider_ops, nullptr));
umf_memory_provider_handle_t provider_handle;
provider_handle = providerUnique.get();
// force all allocations to go to memory provider
umf_disjoint_pool_params_handle_t params;
umf_result_t retp = umfDisjointPoolParamsCreate(¶ms);
EXPECT_EQ(retp, UMF_RESULT_SUCCESS);
retp = umfDisjointPoolParamsSetMaxPoolableSize(params, 0);
EXPECT_EQ(retp, UMF_RESULT_SUCCESS);
umf_memory_pool_handle_t pool = NULL;
retp =
umfPoolCreate(umfDisjointPoolOps(), provider_handle, params, 0, &pool);
EXPECT_EQ(retp, UMF_RESULT_SUCCESS);
auto poolHandle = umf_test::wrapPoolUnique(pool);
retp = umfDisjointPoolParamsDestroy(params);
EXPECT_EQ(retp, UMF_RESULT_SUCCESS);
static constexpr size_t size = 1024;
void *ptr = umfPoolMalloc(pool, size);
// this umfPoolFree() will not free the memory
expectedResult = UMF_RESULT_ERROR_MEMORY_PROVIDER_SPECIFIC;
umf_result_t testResult = umfPoolFree(pool, ptr);
EXPECT_EQ(testResult, expectedResult);
expectedResult = UMF_RESULT_SUCCESS;
// free the memory to avoid memory leak
testResult = umfPoolFree(pool, ptr);
EXPECT_EQ(testResult, expectedResult);
}
TEST_F(test, sharedLimits) {
static size_t numAllocs = 0;
static size_t numFrees = 0;
struct memory_provider : public umf_test::provider_base_t {
umf_result_t alloc(size_t size, size_t alignment, void **ptr) noexcept {
*ptr = umf_ba_global_aligned_alloc(size, alignment);
numAllocs++;
return UMF_RESULT_SUCCESS;
}
umf_result_t free(void *ptr, [[maybe_unused]] size_t size) noexcept {
umf_ba_global_free(ptr);
numFrees++;
return UMF_RESULT_SUCCESS;
}
};
umf_memory_provider_ops_t provider_ops =
umf_test::providerMakeCOps<memory_provider, void>();
static constexpr size_t SlabMinSize = 1024;
static constexpr size_t MaxSize = 4 * SlabMinSize;
umf_disjoint_pool_params_handle_t params =
(umf_disjoint_pool_params_handle_t)defaultDisjointPoolConfig();
umf_result_t ret = umfDisjointPoolParamsSetSlabMinSize(params, SlabMinSize);
EXPECT_EQ(ret, UMF_RESULT_SUCCESS);
auto limits =
std::unique_ptr<umf_disjoint_pool_shared_limits_t,
decltype(&umfDisjointPoolSharedLimitsDestroy)>(
umfDisjointPoolSharedLimitsCreate(MaxSize),
&umfDisjointPoolSharedLimitsDestroy);
ret = umfDisjointPoolParamsSetSharedLimits(params, limits.get());
EXPECT_EQ(ret, UMF_RESULT_SUCCESS);
auto provider =
wrapProviderUnique(createProviderChecked(&provider_ops, nullptr));
umf_memory_pool_handle_t pool1 = NULL;
umf_memory_pool_handle_t pool2 = NULL;
ret =
umfPoolCreate(umfDisjointPoolOps(), provider.get(), params, 0, &pool1);
EXPECT_EQ(ret, UMF_RESULT_SUCCESS);
auto poolHandle1 = umf_test::wrapPoolUnique(pool1);
ret =
umfPoolCreate(umfDisjointPoolOps(), provider.get(), params, 0, &pool2);
EXPECT_EQ(ret, UMF_RESULT_SUCCESS);
auto poolHandle2 = umf_test::wrapPoolUnique(pool2);
ret = umfDisjointPoolParamsDestroy(params);
EXPECT_EQ(ret, UMF_RESULT_SUCCESS);
EXPECT_EQ(0, numAllocs);
EXPECT_EQ(0, numFrees);
std::vector<std::unique_ptr<void, decltype(&umfFree)>> ptrs;
for (size_t i = 0; i < MaxSize / SlabMinSize; i++) {
ptrs.emplace_back(umfPoolMalloc(pool1, SlabMinSize), &umfFree);
ptrs.emplace_back(umfPoolMalloc(pool2, SlabMinSize), &umfFree);
}
EXPECT_EQ(MaxSize / SlabMinSize * 2, numAllocs);
EXPECT_EQ(0, numFrees);
ptrs.clear();
// There should still be MaxSize memory in the pool (MaxSize/SlabMinSize allocations)
EXPECT_EQ(MaxSize / SlabMinSize * 2, numAllocs);
EXPECT_EQ(MaxSize / SlabMinSize, numFrees);
poolHandle1.reset();
poolHandle2.reset();
// All memory should be freed now
EXPECT_EQ(MaxSize / SlabMinSize * 2, numAllocs);
EXPECT_EQ(MaxSize / SlabMinSize * 2, numFrees);
}
TEST_F(test, disjointPoolNullParams) {
umf_result_t res = umfDisjointPoolParamsCreate(nullptr);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
umf_disjoint_pool_params_handle_t params = nullptr;
res = umfDisjointPoolParamsSetSlabMinSize(params, 4096);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetMaxPoolableSize(params, 4096);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetCapacity(params, 4);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetMinBucketSize(params, 64);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetTrace(params, 0);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetSharedLimits(params, nullptr);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetName(params, "test_disjoint_pool");
}
TEST_F(test, disjointPoolInvalidBucketSize) {
umf_disjoint_pool_params_handle_t params = nullptr;
umf_result_t res = umfDisjointPoolParamsCreate(¶ms);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
res = umfDisjointPoolParamsSetMinBucketSize(params, 0);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetMinBucketSize(params, 1);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
res = umfDisjointPoolParamsSetMinBucketSize(params, 2);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
res = umfDisjointPoolParamsSetMinBucketSize(params, 3);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetMinBucketSize(params, 4);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
res = umfDisjointPoolParamsSetMinBucketSize(params, 6);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
res = umfDisjointPoolParamsSetMinBucketSize(params, 8);
EXPECT_EQ(res, UMF_RESULT_SUCCESS);
res = umfDisjointPoolParamsSetMinBucketSize(params, 24);
EXPECT_EQ(res, UMF_RESULT_ERROR_INVALID_ARGUMENT);
umfDisjointPoolParamsDestroy(params);
}
INSTANTIATE_TEST_SUITE_P(disjointPoolTests, umfPoolTest,
::testing::Values(poolCreateExtParams{
umfDisjointPoolOps(), defaultDisjointPoolConfig,
defaultDisjointPoolConfigDestroy,
&BA_GLOBAL_PROVIDER_OPS, nullptr, nullptr}));
void *memProviderParams() { return (void *)&DEFAULT_DISJOINT_CAPACITY; }
INSTANTIATE_TEST_SUITE_P(
disjointPoolTests, umfMemTest,
::testing::Values(std::make_tuple(
poolCreateExtParams{umfDisjointPoolOps(), defaultDisjointPoolConfig,
defaultDisjointPoolConfigDestroy,
&MOCK_OUT_OF_MEM_PROVIDER_OPS, memProviderParams,
nullptr},
static_cast<int>(DEFAULT_DISJOINT_CAPACITY) / 2)));
INSTANTIATE_TEST_SUITE_P(disjointMultiPoolTests, umfMultiPoolTest,
::testing::Values(poolCreateExtParams{
umfDisjointPoolOps(), defaultDisjointPoolConfig,
defaultDisjointPoolConfigDestroy,
&BA_GLOBAL_PROVIDER_OPS, nullptr, nullptr}));