summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorLennart Poettering <lennart@poettering.net>2023-02-14 13:49:17 +0100
committerLennart Poettering <lennart@poettering.net>2023-02-17 15:05:13 +0100
commitc144696e124575358f123de4bd02ba4c687b1793 (patch)
tree4e1330c2af8fda580500c7fa5097f433bf87a852 /src
parenta2b052b29f8bc141e94a4af95d1653a38a57eaeb (diff)
downloadsystemd-c144696e124575358f123de4bd02ba4c687b1793.tar.gz
tests: add test for mempool logic
Diffstat (limited to 'src')
-rw-r--r--src/test/meson.build2
-rw-r--r--src/test/test-mempool.c92
2 files changed, 94 insertions, 0 deletions
diff --git a/src/test/meson.build b/src/test/meson.build
index f05e6a5694..1dbe12dc40 100644
--- a/src/test/meson.build
+++ b/src/test/meson.build
@@ -509,6 +509,8 @@ tests += [
[files('test-tpm2.c')],
+ [files('test-mempool.c')],
+
[files('test-replace-var.c')],
[files('test-calendarspec.c')],
diff --git a/src/test/test-mempool.c b/src/test/test-mempool.c
new file mode 100644
index 0000000000..d3bc173fd4
--- /dev/null
+++ b/src/test/test-mempool.c
@@ -0,0 +1,92 @@
+/* SPDX-License-Identifier: LGPL-2.1-or-later */
+
+#include "mempool.h"
+#include "random-util.h"
+#include "tests.h"
+
+struct element {
+ uint64_t value;
+};
+
+DEFINE_MEMPOOL(test_mempool, struct element, 8);
+
+TEST(mempool_trim) {
+
+#define NN 4000
+ struct element *a[NN];
+ size_t n_freed = 0;
+
+ assert_se(!test_mempool.first_pool);
+ assert_se(!test_mempool.freelist);
+
+ mempool_trim(&test_mempool);
+
+ for (size_t i = 0; i < NN; i++) {
+ assert_se(a[i] = mempool_alloc_tile(&test_mempool));
+ a[i]->value = i;
+ }
+
+ mempool_trim(&test_mempool);
+
+ /* free up to one third randomly */
+ size_t x = 0;
+ for (size_t i = 0; i < NN/3; i++) {
+ x = (x + random_u64()) % ELEMENTSOF(a);
+ assert_se(!a[x] || a[x]->value == x);
+
+ if (a[x])
+ n_freed ++;
+
+ a[x] = mempool_free_tile(&test_mempool, a[x]);
+ }
+
+ mempool_trim(&test_mempool);
+
+ /* free definitely at least one third */
+ for (size_t i = 2; i < NN; i += 3) {
+ assert_se(!a[i] || a[i]->value == i);
+ if (a[i])
+ n_freed ++;
+ a[i] = mempool_free_tile(&test_mempool, a[i]);
+ }
+
+ mempool_trim(&test_mempool);
+
+ /* Allocate another set of tiles, which will fill up the free list and allocate some new tiles */
+ struct element *b[NN];
+ for (size_t i = 0; i < NN; i++) {
+ assert_se(b[i] = mempool_alloc_tile(&test_mempool));
+ b[i]->value = ~(uint64_t) i;
+ }
+
+ mempool_trim(&test_mempool);
+
+ /* free everything from the original set*/
+
+ for (size_t i = 0; i < NN; i += 1) {
+ assert_se(!a[i] || a[i]->value == i);
+ if (a[i])
+ n_freed ++;
+ a[i] = mempool_free_tile(&test_mempool, a[i]);
+ }
+
+ mempool_trim(&test_mempool);
+
+ /* and now everything from the second set too */
+
+ for (size_t i = 0; i < NN; i += 1) {
+ assert_se(!b[i] || b[i]->value == ~(uint64_t) i);
+ if (b[i])
+ n_freed ++;
+ b[i] = mempool_free_tile(&test_mempool, b[i]);
+ }
+
+ assert_se(n_freed == NN * 2);
+
+ mempool_trim(&test_mempool);
+
+ assert_se(!test_mempool.first_pool);
+ assert_se(!test_mempool.freelist);
+}
+
+DEFINE_TEST_MAIN(LOG_DEBUG);