|
| 1 | +/* |
| 2 | + * Copyright (c) Meta Platforms, Inc. and its affiliates. |
| 3 | + * |
| 4 | + * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | + * you may not use this file except in compliance with the License. |
| 6 | + * You may obtain a copy of the License at |
| 7 | + * |
| 8 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | + * |
| 10 | + * Unless required by applicable law or agreed to in writing, software |
| 11 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | + * See the License for the specific language governing permissions and |
| 14 | + * limitations under the License. |
| 15 | + */ |
| 16 | + |
| 17 | +#include <gtest/gtest.h> |
| 18 | +#include "dwio/nimble/common/Buffer.h" |
| 19 | +#include "dwio/nimble/common/Exceptions.h" |
| 20 | +#include "folly/executors/CPUThreadPoolExecutor.h" |
| 21 | +#include "velox/common/memory/Memory.h" |
| 22 | +#include "velox/dwio/common/ExecutorBarrier.h" |
| 23 | + |
| 24 | +namespace facebook::nimble::test { |
| 25 | +using MemoryPool = velox::memory::MemoryPool; |
| 26 | +using ExecutorBarrier = velox::dwio::common::ExecutorBarrier; |
| 27 | + |
| 28 | +class BufferPoolTest : public ::testing::Test { |
| 29 | + protected: |
| 30 | + static void SetUpTestCase() {} |
| 31 | + |
| 32 | + void SetUp() override { |
| 33 | + memPool_ = velox::memory::deprecatedAddDefaultLeafMemoryPool(); |
| 34 | + } |
| 35 | + |
| 36 | + std::shared_ptr<velox::memory::MemoryPool> memPool_; |
| 37 | +}; |
| 38 | + |
| 39 | +TEST_F(BufferPoolTest, CreateBufferPool) { |
| 40 | + auto bufferPool = BufferPool{*memPool_}; |
| 41 | + EXPECT_NO_THROW(bufferPool); |
| 42 | +} |
| 43 | + |
| 44 | +TEST_F(BufferPoolTest, CreateBufferPoolWithInitialSize) { |
| 45 | + auto bufferPool = |
| 46 | + BufferPool{*memPool_, std::chrono::milliseconds{10}, 10, 10}; |
| 47 | + EXPECT_EQ(bufferPool.size(), 10); |
| 48 | +} |
| 49 | + |
| 50 | +TEST_F(BufferPoolTest, CreateBufferPoolBadTimeout) { |
| 51 | + auto throwLambda = [&]() { |
| 52 | + auto bufferPool = BufferPool{*memPool_, std::chrono::milliseconds{0}}; |
| 53 | + }; |
| 54 | + EXPECT_THROW(throwLambda(), NimbleUserError); |
| 55 | + |
| 56 | + try { |
| 57 | + throwLambda(); |
| 58 | + } catch (const NimbleUserError& e) { |
| 59 | + EXPECT_EQ(e.errorMessage(), "timeout must be > 0"); |
| 60 | + } |
| 61 | +} |
| 62 | + |
| 63 | +TEST_F(BufferPoolTest, CreateBufferPoolBadMaxPool) { |
| 64 | + auto throwLambda = [&]() { |
| 65 | + auto bufferPool = BufferPool{*memPool_, std::chrono::milliseconds{1}, 0}; |
| 66 | + }; |
| 67 | + EXPECT_THROW(throwLambda(), NimbleUserError); |
| 68 | + |
| 69 | + try { |
| 70 | + throwLambda(); |
| 71 | + } catch (const NimbleUserError& e) { |
| 72 | + EXPECT_EQ(e.errorMessage(), "max pool size must be > 0"); |
| 73 | + } |
| 74 | +} |
| 75 | + |
| 76 | +TEST_F(BufferPoolTest, CreateBufferPoolBadInitialSize) { |
| 77 | + auto throwLambda = [&]() { |
| 78 | + auto bufferPool = |
| 79 | + BufferPool{*memPool_, std::chrono::milliseconds{1}, 10, 0}; |
| 80 | + }; |
| 81 | + EXPECT_THROW(throwLambda(), NimbleUserError); |
| 82 | + try { |
| 83 | + throwLambda(); |
| 84 | + } catch (const NimbleUserError& e) { |
| 85 | + EXPECT_EQ(e.errorMessage(), "initial pool size must be > 0"); |
| 86 | + } |
| 87 | +} |
| 88 | + |
| 89 | +TEST_F(BufferPoolTest, CreateBufferPoolBadInitialSizeMaxSize) { |
| 90 | + auto throwLambda = [&]() { |
| 91 | + auto bufferPool = BufferPool{*memPool_, std::chrono::milliseconds{1}, 1, 2}; |
| 92 | + }; |
| 93 | + EXPECT_THROW(throwLambda(), NimbleUserError); |
| 94 | + |
| 95 | + try { |
| 96 | + throwLambda(); |
| 97 | + } catch (const NimbleUserError& e) { |
| 98 | + EXPECT_EQ(e.errorMessage(), "initial pool size must be <= max pool size"); |
| 99 | + } |
| 100 | +} |
| 101 | + |
| 102 | +TEST_F(BufferPoolTest, ReserveBuffer) { |
| 103 | + auto bufferPool = BufferPool{*memPool_}; |
| 104 | + auto buffer = bufferPool.reserveBuffer(); |
| 105 | + EXPECT_NE(buffer, nullptr); |
| 106 | +} |
| 107 | + |
| 108 | +TEST_F(BufferPoolTest, AddBuffer) { |
| 109 | + auto bufferPool = BufferPool{*memPool_}; |
| 110 | + auto buffer = bufferPool.reserveBuffer(); |
| 111 | + EXPECT_NE(buffer, nullptr); |
| 112 | + EXPECT_EQ(bufferPool.size(), 0); |
| 113 | + bufferPool.addBuffer(std::move(buffer)); |
| 114 | + EXPECT_EQ(bufferPool.size(), 1); |
| 115 | +} |
| 116 | + |
| 117 | +TEST_F(BufferPoolTest, DestroyBufferPool) { |
| 118 | + auto bufferPoolPtr = std::make_unique<BufferPool>(*memPool_); |
| 119 | + bufferPoolPtr.reset(); |
| 120 | + EXPECT_NO_THROW(); |
| 121 | +} |
| 122 | + |
| 123 | +TEST_F(BufferPoolTest, emptyBufferPool) { |
| 124 | + auto bufferPool = BufferPool{*memPool_, std::chrono::milliseconds{10}, 1}; |
| 125 | + EXPECT_EQ(bufferPool.size(), 1); |
| 126 | + |
| 127 | + auto buffer1 = bufferPool.reserveBuffer(); |
| 128 | + EXPECT_EQ(bufferPool.size(), 0); |
| 129 | +} |
| 130 | + |
| 131 | +TEST_F(BufferPoolTest, OverfillBufferPool) { |
| 132 | + // not guarenteed to fail at size of 2 due to DMPMCQueue |
| 133 | + auto bufferPool = BufferPool{*memPool_, std::chrono::milliseconds{10}, 1}; |
| 134 | + auto throwLambda = [&]() { |
| 135 | + for (auto i = 0; i < 5; i++) { |
| 136 | + auto buffer = std::make_unique<Buffer>(*memPool_); |
| 137 | + bufferPool.addBuffer(std::move(buffer)); |
| 138 | + } |
| 139 | + }; |
| 140 | + |
| 141 | + EXPECT_THROW(throwLambda(), NimbleInternalError); |
| 142 | +} |
| 143 | + |
| 144 | +TEST_F(BufferPoolTest, FillEmptyFillBufferPool) { |
| 145 | + size_t iterations = 10; |
| 146 | + std::vector<BufferPtr> buffers; |
| 147 | + |
| 148 | + auto bufferPool = |
| 149 | + BufferPool{*memPool_, std::chrono::milliseconds{10}, iterations}; |
| 150 | + for (auto i = 0; i < iterations; i++) { |
| 151 | + auto buffer = bufferPool.reserveBuffer(); |
| 152 | + buffers.push_back(std::move(buffer)); |
| 153 | + } |
| 154 | + EXPECT_EQ(bufferPool.size(), 0); |
| 155 | + EXPECT_EQ(buffers.size(), iterations); |
| 156 | + for (auto& buffer : buffers) { |
| 157 | + bufferPool.addBuffer(std::move(buffer)); |
| 158 | + } |
| 159 | + EXPECT_EQ(bufferPool.size(), iterations); |
| 160 | + buffers.clear(); |
| 161 | + |
| 162 | + for (auto i = 0; i < iterations; i++) { |
| 163 | + auto buffer = bufferPool.reserveBuffer(); |
| 164 | + buffers.push_back(std::move(buffer)); |
| 165 | + } |
| 166 | + EXPECT_EQ(bufferPool.size(), 0); |
| 167 | + EXPECT_EQ(buffers.size(), iterations); |
| 168 | +} |
| 169 | + |
| 170 | +TEST_F(BufferPoolTest, ParallelFillPool) { |
| 171 | + folly::CPUThreadPoolExecutor executor{10}; |
| 172 | + ExecutorBarrier barrier{executor}; |
| 173 | + auto bufferPool = |
| 174 | + BufferPool{*memPool_, std::chrono::milliseconds{1000 * 10}, 100}; |
| 175 | + auto fillPool = [&]() { |
| 176 | + for (auto i = 0; i < 10; i++) { |
| 177 | + EXPECT_NO_THROW( |
| 178 | + auto buffer = bufferPool.reserveBuffer(); |
| 179 | + std::this_thread::sleep_for(std::chrono::milliseconds{1000}); |
| 180 | + bufferPool.addBuffer(std::move(buffer));); |
| 181 | + } |
| 182 | + }; |
| 183 | + |
| 184 | + for (auto i = 0; i < 10; i++) { |
| 185 | + barrier.add(fillPool); |
| 186 | + } |
| 187 | + |
| 188 | + barrier.waitAll(); |
| 189 | +} |
| 190 | + |
| 191 | +} // namespace facebook::nimble::test |
0 commit comments