Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 1 | //===- LinearAllocatorTest.cpp --------------------------------------------===// |
| 2 | // |
| 3 | // The MCLinker Project |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | #include "LinearAllocatorTest.h" |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 10 | #include "mcld/Support/Allocators.h" |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 11 | |
| 12 | using namespace mcld; |
| 13 | using namespace mcldtest; |
| 14 | |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 15 | // Constructor can do set-up work for all test here. |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 16 | LinearAllocatorTest::LinearAllocatorTest() { |
| 17 | // create testee. modify it if need |
| 18 | m_pTestee = new LinearAllocator<Data, CHUNK_SIZE>(); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 19 | } |
| 20 | |
| 21 | // Destructor can do clean-up work that doesn't throw exceptions here. |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 22 | LinearAllocatorTest::~LinearAllocatorTest() { |
| 23 | delete m_pTestee; |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 24 | } |
| 25 | |
| 26 | // SetUp() will be called immediately before each test. |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 27 | void LinearAllocatorTest::SetUp() { |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 28 | } |
| 29 | |
| 30 | // TearDown() will be called immediately after each test. |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 31 | void LinearAllocatorTest::TearDown() { |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 32 | } |
| 33 | |
| 34 | //==========================================================================// |
| 35 | // Testcases |
| 36 | // |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 37 | TEST_F(LinearAllocatorTest, allocateN) { |
| 38 | Data* pointer = m_pTestee->allocate(10); |
| 39 | ASSERT_FALSE(0 == pointer); |
| 40 | ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size()); |
| 41 | ASSERT_FALSE(m_pTestee->empty()); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 42 | } |
| 43 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 44 | TEST_F(LinearAllocatorTest, allocate) { |
| 45 | Data* pointer = m_pTestee->allocate(); |
| 46 | ASSERT_FALSE(0 == pointer); |
| 47 | ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size()); |
| 48 | ASSERT_FALSE(m_pTestee->empty()); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 49 | } |
| 50 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 51 | TEST_F(LinearAllocatorTest, allocateOver) { |
| 52 | Data* pointer = m_pTestee->allocate(CHUNK_SIZE + 1); |
| 53 | ASSERT_TRUE(0 == pointer); |
| 54 | ASSERT_TRUE(0 == m_pTestee->max_size()); |
| 55 | ASSERT_TRUE(m_pTestee->empty()); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 56 | } |
| 57 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 58 | TEST_F(LinearAllocatorTest, alloc_construct) { |
| 59 | Data* pointer = m_pTestee->allocate(); |
| 60 | m_pTestee->construct(pointer); |
| 61 | ASSERT_TRUE(1 == pointer->one); |
| 62 | ASSERT_TRUE(2 == pointer->two); |
| 63 | ASSERT_TRUE(3 == pointer->three); |
| 64 | ASSERT_TRUE(4 == pointer->four); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 65 | } |
| 66 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 67 | TEST_F(LinearAllocatorTest, alloc_constructCopy) { |
| 68 | Data* pointer = m_pTestee->allocate(); |
| 69 | Data data(7, 7, 7, 7); |
| 70 | m_pTestee->construct(pointer, data); |
| 71 | |
| 72 | ASSERT_TRUE(7 == pointer->one); |
| 73 | ASSERT_TRUE(7 == pointer->two); |
| 74 | ASSERT_TRUE(7 == pointer->three); |
| 75 | ASSERT_TRUE(7 == pointer->four); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 76 | } |
| 77 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 78 | TEST_F(LinearAllocatorTest, allocN_construct) { |
| 79 | Data* pointer = m_pTestee->allocate(10); |
| 80 | m_pTestee->construct(pointer); |
| 81 | ASSERT_TRUE(1 == pointer->one); |
| 82 | ASSERT_TRUE(2 == pointer->two); |
| 83 | ASSERT_TRUE(3 == pointer->three); |
| 84 | ASSERT_TRUE(4 == pointer->four); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 85 | } |
| 86 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 87 | TEST_F(LinearAllocatorTest, allocN_constructCopy) { |
| 88 | Data* pointer = m_pTestee->allocate(10); |
| 89 | Data data(7, 7, 7, 7); |
| 90 | m_pTestee->construct(pointer, data); |
| 91 | |
| 92 | ASSERT_TRUE(7 == pointer->one); |
| 93 | ASSERT_TRUE(7 == pointer->two); |
| 94 | ASSERT_TRUE(7 == pointer->three); |
| 95 | ASSERT_TRUE(7 == pointer->four); |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 96 | } |
| 97 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 98 | TEST_F(LinearAllocatorTest, multi_alloc_ctor_iterate) { |
| 99 | for (int i = 0; i < 101; ++i) { |
| 100 | Data* pointer = m_pTestee->allocate(); |
| 101 | m_pTestee->construct(pointer); |
| 102 | pointer->one = i; |
| 103 | } |
| 104 | /** |
| 105 | Alloc::iterator data, dEnd = m_pTestee->end(); |
| 106 | int counter = 0; |
| 107 | for (data=m_pTestee->begin(); data!=dEnd; ++data) { |
| 108 | ASSERT_EQ(counter, (*data).one); |
| 109 | ++counter; |
| 110 | } |
| 111 | **/ |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 112 | } |
| 113 | |
Stephen Hines | 37b74a3 | 2014-11-26 18:48:20 -0800 | [diff] [blame] | 114 | TEST_F(LinearAllocatorTest, multi_allocN_ctor_iterate) { |
| 115 | int counter = 0; |
| 116 | for (int i = 0; i < 10000; ++i) { |
| 117 | Data* pointer = m_pTestee->allocate(10); |
| 118 | for (int j = 0; j < 10; ++j) { |
| 119 | m_pTestee->construct(pointer); |
| 120 | pointer->one = counter; |
| 121 | ++pointer; |
| 122 | ++counter; |
| 123 | } |
| 124 | } |
| 125 | /** |
| 126 | Alloc::iterator data, dEnd = m_pTestee->end(); |
| 127 | counter = 0; |
| 128 | for (data=m_pTestee->begin(); data!=dEnd; ++data) { |
| 129 | ASSERT_EQ(counter, (*data).one); |
| 130 | ++counter; |
| 131 | } |
| 132 | **/ |
Shih-wei Liao | 5460a1f | 2012-03-16 22:41:16 -0700 | [diff] [blame] | 133 | } |