Debian Codegraph @

unittests/unit/common/test_PoolAllocator.cpp

raw
1 /*
2 * Copyright (c) 2011-2022, The DART development contributors
3 * All rights reserved.
4 *
5 * The list of contributors can be found at:
6 * https://github.com/dartsim/dart/blob/master/LICENSE
7 *
8 * This file is provided under the following "BSD-style" License:
9 * Redistribution and use in source and binary forms, with or
10 * without modification, are permitted provided that the following
11 * conditions are met:
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
26 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
27 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
29 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
31 */
32
33 #include <dart/common/PoolAllocator.hpp>
34 #include <gtest/gtest.h>
35
36 #include "TestHelpers.hpp"
37
38 using namespace dart;
39 using namespace common;
40
41 //==============================================================================
42 TEST(PoolAllocatorTest, Constructors)
43 {
44 auto a = PoolAllocator::Debug();
45 EXPECT_EQ(
46 &a.getInternalAllocator().getBaseAllocator(),
47 &MemoryAllocator::GetDefault());
48
49 auto b = PoolAllocator::Debug(MemoryAllocator::GetDefault());
50 EXPECT_EQ(
51 &b.getInternalAllocator().getBaseAllocator(),
52 &MemoryAllocator::GetDefault());
53
54 EXPECT_EQ(b.getInternalAllocator().getNumAllocatedMemoryBlocks(), 0);
55
56 EXPECT_TRUE(a.isEmpty());
57 EXPECT_TRUE(b.isEmpty());
58 }
59
60 //==============================================================================
61 TEST(PoolAllocatorTest, Allocate)
62 {
63 auto a = PoolAllocator::Debug();
64 EXPECT_TRUE(a.isEmpty());
65
66 // Cannot allocate 0 bytes
67 EXPECT_EQ(a.allocate(0), nullptr);
68
69 // Allocate small memory
70 auto ptr1 = a.allocate(1);
71 EXPECT_NE(ptr1, nullptr);
72 EXPECT_TRUE(a.hasAllocated(ptr1, 1));
73 EXPECT_FALSE(a.hasAllocated(0, 1)); // incorrect address
74 EXPECT_FALSE(a.hasAllocated(ptr1, 1 * 2)); // incorrect size
75 EXPECT_EQ(a.getInternalAllocator().getNumAllocatedMemoryBlocks(), 1);
76
77 // Allocate the same size, which doesn't increase the number of memory block
78 auto ptr2 = a.allocate(1);
79 EXPECT_NE(ptr2, nullptr);
80 EXPECT_EQ(a.getInternalAllocator().getNumAllocatedMemoryBlocks(), 1);
81
82 // Allocate different size
83 auto ptr3 = a.allocate(64);
84 EXPECT_NE(ptr3, nullptr);
85 EXPECT_EQ(a.getInternalAllocator().getNumAllocatedMemoryBlocks(), 2);
86
87 // Allocate memory of the max size (= 1024)
88 auto ptr4 = a.allocate(1024);
89 EXPECT_NE(ptr4, nullptr);
90 EXPECT_TRUE(a.hasAllocated(ptr4, 1024));
91 EXPECT_FALSE(a.hasAllocated(0, 1024));
92 EXPECT_FALSE(a.hasAllocated(ptr4, 1024 * 2));
93 EXPECT_EQ(a.getInternalAllocator().getNumAllocatedMemoryBlocks(), 3);
94
95 // Allocate oversized memory (> 1024)
96 auto ptr5 = a.allocate(2048);
97 EXPECT_NE(ptr5, nullptr);
98 EXPECT_TRUE(a.hasAllocated(ptr5, 2048));
99 EXPECT_FALSE(a.hasAllocated(0, 2048));
100 EXPECT_FALSE(a.hasAllocated(ptr5, 2048 * 2));
101 EXPECT_EQ(a.getInternalAllocator().getNumAllocatedMemoryBlocks(), 3);
102
103 EXPECT_FALSE(a.isEmpty());
104
105 a.deallocate(ptr1, 1);
106 a.deallocate(ptr2, 1);
107 a.deallocate(ptr3, 64);
108 a.deallocate(ptr4, 1024);
109 a.deallocate(ptr5, 2048);
110
111 EXPECT_TRUE(a.isEmpty());
112 }