1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/tests/test_basic_mempool.cpp Tue Feb 07 21:55:37 2023 +0100
1.3 @@ -0,0 +1,154 @@
1.4 +/*
1.5 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
1.6 + *
1.7 + * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
1.8 + *
1.9 + * Redistribution and use in source and binary forms, with or without
1.10 + * modification, are permitted provided that the following conditions are met:
1.11 + *
1.12 + * 1. Redistributions of source code must retain the above copyright
1.13 + * notice, this list of conditions and the following disclaimer.
1.14 + *
1.15 + * 2. Redistributions in binary form must reproduce the above copyright
1.16 + * notice, this list of conditions and the following disclaimer in the
1.17 + * documentation and/or other materials provided with the distribution.
1.18 + *
1.19 + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.20 + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.21 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.22 + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
1.23 + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.24 + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.25 + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.26 + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.27 + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.28 + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.29 + * POSSIBILITY OF SUCH DAMAGE.
1.30 + */
1.31 +
1.32 +#include "cx/basic_mempool.h"
1.33 +#include "util_allocator.h"
1.34 +#include <gtest/gtest.h>
1.35 +
1.36 +class CxBasicMempool : public ::testing::Test {
1.37 +protected:
1.38 + CxMempool *pool = nullptr;
1.39 +
1.40 + void TearDown() override {
1.41 + if (pool != nullptr) {
1.42 + cxMempoolDestroy(pool);
1.43 + }
1.44 + }
1.45 +};
1.46 +
1.47 +TEST_F(CxBasicMempool, Create) {
1.48 + pool = cxBasicMempoolCreate(16);
1.49 + ASSERT_NE(pool->allocator, nullptr);
1.50 + ASSERT_NE(pool->cl, nullptr);
1.51 + EXPECT_NE(pool->cl->destroy, nullptr);
1.52 + ASSERT_NE(pool->allocator->cl, nullptr);
1.53 + EXPECT_EQ(pool->allocator->data, pool);
1.54 + EXPECT_NE(pool->allocator->cl->malloc, nullptr);
1.55 + EXPECT_NE(pool->allocator->cl->calloc, nullptr);
1.56 + EXPECT_NE(pool->allocator->cl->realloc, nullptr);
1.57 + EXPECT_NE(pool->allocator->cl->free, nullptr);
1.58 +
1.59 + auto basic_pool = reinterpret_cast<cx_basic_mempool_s *>(pool);
1.60 + EXPECT_EQ(basic_pool->size, 16);
1.61 + EXPECT_EQ(basic_pool->ndata, 0);
1.62 + EXPECT_NE(basic_pool->data, nullptr);
1.63 +}
1.64 +
1.65 +TEST_F(CxBasicMempool, malloc) {
1.66 + pool = cxBasicMempoolCreate(4);
1.67 + auto basic_pool = reinterpret_cast<cx_basic_mempool_s *>(pool);
1.68 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.69 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.70 + EXPECT_EQ(basic_pool->ndata, 2);
1.71 + EXPECT_EQ(basic_pool->size, 4);
1.72 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.73 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.74 + EXPECT_EQ(basic_pool->ndata, 4);
1.75 + EXPECT_EQ(basic_pool->size, 4);
1.76 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.77 + EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.78 + EXPECT_EQ(basic_pool->ndata, 6);
1.79 + EXPECT_GE(basic_pool->size, 6);
1.80 +}
1.81 +
1.82 +TEST_F(CxBasicMempool, calloc) {
1.83 + pool = cxBasicMempoolCreate(4);
1.84 +
1.85 + auto test = (int *) cxCalloc(pool->allocator, 2, sizeof(int));
1.86 + ASSERT_NE(test, nullptr);
1.87 + EXPECT_EQ(test[0], 0);
1.88 + EXPECT_EQ(test[1], 0);
1.89 +}
1.90 +
1.91 +static unsigned test_destructor_called = 0;
1.92 +
1.93 +static void test_destructor([[maybe_unused]] void *mem) {
1.94 + test_destructor_called++;
1.95 +}
1.96 +
1.97 +TEST_F(CxBasicMempool, destructor) {
1.98 + pool = cxBasicMempoolCreate(4);
1.99 + auto data = cxMalloc(pool->allocator, sizeof(int));
1.100 + *((int *) data) = 13;
1.101 + cxMempoolSetDestructor(pool, data, test_destructor);
1.102 + EXPECT_EQ(*((int *) data), 13);
1.103 + test_destructor_called = 0;
1.104 + cxFree(pool->allocator, data);
1.105 + EXPECT_EQ(test_destructor_called, 1);
1.106 + data = cxMalloc(pool->allocator, sizeof(int));
1.107 + cxMempoolSetDestructor(pool, data, test_destructor);
1.108 + cxMempoolDestroy(pool);
1.109 + pool = nullptr;
1.110 + EXPECT_EQ(test_destructor_called, 2);
1.111 +}
1.112 +
1.113 +TEST_F(CxBasicMempool, realloc) {
1.114 + pool = cxBasicMempoolCreate(4);
1.115 + auto data = cxMalloc(pool->allocator, sizeof(int));
1.116 + *((int *) data) = 13;
1.117 + cxMempoolSetDestructor(pool, data, test_destructor);
1.118 +
1.119 + void *rdata = data;
1.120 + unsigned n = 1;
1.121 + while (rdata == data) {
1.122 + n <<= 1;
1.123 + ASSERT_LT(n, 65536); // eventually the memory should be moved elsewhere
1.124 + rdata = cxRealloc(pool->allocator, data, n * sizeof(intptr_t));
1.125 + }
1.126 +
1.127 + EXPECT_EQ(*((int *) rdata), 13);
1.128 + // test if destructor is still intact
1.129 + test_destructor_called = 0;
1.130 + cxFree(pool->allocator, rdata);
1.131 + EXPECT_EQ(test_destructor_called, 1);
1.132 +}
1.133 +
1.134 +
1.135 +TEST_F(CxBasicMempool, free) {
1.136 + pool = cxBasicMempoolCreate(4);
1.137 + auto basic_pool = reinterpret_cast<cx_basic_mempool_s *>(pool);
1.138 +
1.139 + void *mem1;
1.140 + void *mem2;
1.141 +
1.142 + mem1 = cxMalloc(pool->allocator, 16);
1.143 + cxFree(pool->allocator, mem1);
1.144 + EXPECT_EQ(basic_pool->ndata, 0);
1.145 +
1.146 + cxMalloc(pool->allocator, 16);
1.147 + cxMalloc(pool->allocator, 16);
1.148 + mem1 = cxMalloc(pool->allocator, 16);
1.149 + cxMalloc(pool->allocator, 16);
1.150 + mem2 = cxMalloc(pool->allocator, 16);
1.151 +
1.152 + EXPECT_EQ(basic_pool->ndata, 5);
1.153 + cxFree(pool->allocator, mem1);
1.154 + EXPECT_EQ(basic_pool->ndata, 4);
1.155 + cxFree(pool->allocator, mem2);
1.156 + EXPECT_EQ(basic_pool->ndata, 3);
1.157 +}
1.158 \ No newline at end of file
