1.1 --- a/tests/test_mempool.cpp Fri Dec 29 17:27:14 2023 +0100
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,153 +0,0 @@
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/mempool.h"
1.33 -#include "util_allocator.h"
1.34 -#include <gtest/gtest.h>
1.35 -
1.36 -TEST(Mempool, Create) {
1.37 - auto pool = cxBasicMempoolCreate(16);
1.38 - ASSERT_EQ(pool->auto_destr, nullptr);
1.39 - ASSERT_NE(pool->allocator, nullptr);
1.40 - ASSERT_NE(pool->allocator->cl, nullptr);
1.41 - EXPECT_EQ(pool->allocator->data, pool);
1.42 - EXPECT_NE(pool->allocator->cl->malloc, nullptr);
1.43 - EXPECT_NE(pool->allocator->cl->calloc, nullptr);
1.44 - EXPECT_NE(pool->allocator->cl->realloc, nullptr);
1.45 - EXPECT_NE(pool->allocator->cl->free, nullptr);
1.46 - EXPECT_EQ(pool->capacity, 16);
1.47 - EXPECT_EQ(pool->size, 0);
1.48 - EXPECT_NE(pool->data, nullptr);
1.49 - cxMempoolDestroy(pool);
1.50 -}
1.51 -
1.52 -TEST(Mempool, malloc) {
1.53 - auto pool = cxBasicMempoolCreate(4);
1.54 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.55 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.56 - EXPECT_EQ(pool->size, 2);
1.57 - EXPECT_EQ(pool->capacity, 4);
1.58 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.59 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.60 - EXPECT_EQ(pool->size, 4);
1.61 - EXPECT_EQ(pool->capacity, 4);
1.62 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.63 - EXPECT_NE(cxMalloc(pool->allocator, sizeof(int)), nullptr);
1.64 - EXPECT_EQ(pool->size, 6);
1.65 - EXPECT_GE(pool->capacity, 6);
1.66 - cxMempoolDestroy(pool);
1.67 -}
1.68 -
1.69 -TEST(Mempool, calloc) {
1.70 - auto pool = cxBasicMempoolCreate(4);
1.71 -
1.72 - auto test = (int *) cxCalloc(pool->allocator, 2, sizeof(int));
1.73 - ASSERT_NE(test, nullptr);
1.74 - EXPECT_EQ(test[0], 0);
1.75 - EXPECT_EQ(test[1], 0);
1.76 - cxMempoolDestroy(pool);
1.77 -}
1.78 -
1.79 -static unsigned test_destructor_called;
1.80 -
1.81 -static void test_destructor([[maybe_unused]] void *mem) {
1.82 - test_destructor_called++;
1.83 -}
1.84 -
1.85 -TEST(Mempool, realloc) {
1.86 - auto pool = cxMempoolCreate(4, test_destructor);
1.87 - ASSERT_EQ(pool->auto_destr, test_destructor);
1.88 - auto data = cxMalloc(pool->allocator, sizeof(int));
1.89 - *((int *) data) = 13;
1.90 -
1.91 - void *rdata = data;
1.92 - unsigned n = 1;
1.93 - while (rdata == data) {
1.94 - n <<= 1;
1.95 - ASSERT_LT(n, 65536); // eventually the memory should be moved elsewhere
1.96 - rdata = cxRealloc(pool->allocator, data, n * sizeof(intptr_t));
1.97 - }
1.98 -
1.99 - EXPECT_EQ(*((int *) rdata), 13);
1.100 - // test if destructor is still intact
1.101 - test_destructor_called = 0;
1.102 - cxFree(pool->allocator, rdata);
1.103 - EXPECT_EQ(test_destructor_called, 1);
1.104 - cxMempoolDestroy(pool);
1.105 -}
1.106 -
1.107 -
1.108 -TEST(Mempool, free) {
1.109 - auto pool = cxBasicMempoolCreate(4);
1.110 -
1.111 - void *mem1;
1.112 - void *mem2;
1.113 -
1.114 - mem1 = cxMalloc(pool->allocator, 16);
1.115 - cxFree(pool->allocator, mem1);
1.116 - EXPECT_EQ(pool->size, 0);
1.117 -
1.118 - cxMalloc(pool->allocator, 16);
1.119 - cxMalloc(pool->allocator, 16);
1.120 - mem1 = cxMalloc(pool->allocator, 16);
1.121 - cxMalloc(pool->allocator, 16);
1.122 - mem2 = cxMalloc(pool->allocator, 16);
1.123 -
1.124 - EXPECT_EQ(pool->size, 5);
1.125 - cxFree(pool->allocator, mem1);
1.126 - EXPECT_EQ(pool->size, 4);
1.127 - cxFree(pool->allocator, mem2);
1.128 - EXPECT_EQ(pool->size, 3);
1.129 - cxMempoolDestroy(pool);
1.130 -}
1.131 -
1.132 -TEST(Mempool, Destroy) {
1.133 - auto pool = cxBasicMempoolCreate(4);
1.134 - auto data = cxMalloc(pool->allocator, sizeof(int));
1.135 - *((int *) data) = 13;
1.136 - cxMempoolSetDestructor(data, test_destructor);
1.137 - EXPECT_EQ(*((int *) data), 13);
1.138 - test_destructor_called = 0;
1.139 - cxFree(pool->allocator, data);
1.140 - EXPECT_EQ(test_destructor_called, 1);
1.141 - data = cxMalloc(pool->allocator, sizeof(int));
1.142 - cxMempoolSetDestructor(data, test_destructor);
1.143 - cxMempoolDestroy(pool);
1.144 - EXPECT_EQ(test_destructor_called, 2);
1.145 -}
1.146 -
1.147 -TEST(Mempool, Register) {
1.148 - auto pool = cxBasicMempoolCreate(4);
1.149 - auto data = cxMalloc(pool->allocator, sizeof(int));
1.150 - test_destructor_called = 0;
1.151 - cxMempoolSetDestructor(data, test_destructor);
1.152 - int donotfree = 0;
1.153 - cxMempoolRegister(pool, &donotfree, test_destructor);
1.154 - cxMempoolDestroy(pool);
1.155 - EXPECT_EQ(test_destructor_called, 2);
1.156 -}
