|
| 1 | +// Copyright 2025, DragonflyDB authors. All rights reserved. |
| 2 | +// See LICENSE for licensing terms. |
| 3 | +// |
| 4 | + |
| 5 | +#include "core/search/mrmw_mutex.h" |
| 6 | + |
| 7 | +#include <random> |
| 8 | +#include <thread> |
| 9 | + |
| 10 | +#include "absl/flags/flag.h" |
| 11 | +#include "base/gtest.h" |
| 12 | +#include "base/logging.h" |
| 13 | +#include "util/fibers/pool.h" |
| 14 | + |
| 15 | +ABSL_FLAG(bool, force_epoll, false, "If true, uses epoll api instead iouring to run tests"); |
| 16 | + |
| 17 | +namespace dfly::search { |
| 18 | + |
| 19 | +namespace { |
| 20 | + |
| 21 | +// Helper function to simulate reading operation |
| 22 | +void ReadTask(MRMWMutex* mutex, std::atomic<size_t>& read_count, size_t sleep_time) { |
| 23 | + read_count.fetch_add(1, std::memory_order_relaxed); |
| 24 | + MRMWMutexLock lock(mutex, MRMWMutex::LockMode::kReadLock); |
| 25 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(sleep_time)); |
| 26 | + read_count.fetch_sub(1, std::memory_order_relaxed); |
| 27 | +} |
| 28 | + |
| 29 | +// Helper function to simulate writing operation |
| 30 | +void WriteTask(MRMWMutex* mutex, std::atomic<size_t>& write_count, size_t sleep_time) { |
| 31 | + write_count.fetch_add(1, std::memory_order_relaxed); |
| 32 | + MRMWMutexLock lock(mutex, MRMWMutex::LockMode::kWriteLock); |
| 33 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(sleep_time)); |
| 34 | + write_count.fetch_sub(1, std::memory_order_relaxed); |
| 35 | +} |
| 36 | + |
| 37 | +constexpr size_t kReadTaskSleepTime = 50; |
| 38 | +constexpr size_t kWriteTaskSleepTime = 100; |
| 39 | + |
| 40 | +} // namespace |
| 41 | + |
| 42 | +class MRMWMutexTest : public ::testing::Test { |
| 43 | + protected: |
| 44 | + MRMWMutex mutex_; |
| 45 | + std::mt19937 generator_; |
| 46 | + void SetUp() override { |
| 47 | +#ifdef __linux__ |
| 48 | + if (absl::GetFlag(FLAGS_force_epoll)) { |
| 49 | + pp_.reset(util::fb2::Pool::Epoll(2)); |
| 50 | + } else { |
| 51 | + pp_.reset(util::fb2::Pool::IOUring(16, 2)); |
| 52 | + } |
| 53 | +#else |
| 54 | + pp_.reset(fb2::Pool::Epoll(2)); |
| 55 | +#endif |
| 56 | + pp_->Run(); |
| 57 | + } |
| 58 | + void TearDown() override { |
| 59 | + pp_->Stop(); |
| 60 | + pp_.reset(); |
| 61 | + } |
| 62 | + std::unique_ptr<util::ProactorPool> pp_; |
| 63 | +}; |
| 64 | + |
| 65 | +// Test 1: Multiple readers can lock concurrently |
| 66 | +TEST_F(MRMWMutexTest, MultipleReadersConcurrently) { |
| 67 | + std::atomic<size_t> read_count(0); |
| 68 | + const int num_readers = 5; |
| 69 | + |
| 70 | + std::vector<util::fb2::Fiber> readers; |
| 71 | + readers.reserve(num_readers); |
| 72 | + |
| 73 | + for (int i = 0; i < num_readers; ++i) { |
| 74 | + readers.emplace_back(pp_->at(0)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 75 | + ReadTask(&mutex_, std::ref(read_count), kReadTaskSleepTime); |
| 76 | + })); |
| 77 | + } |
| 78 | + |
| 79 | + // Wait for all reader threads to finish |
| 80 | + for (auto& t : readers) { |
| 81 | + t.Join(); |
| 82 | + } |
| 83 | + |
| 84 | + // All readers should have been able to lock the mutex concurrently |
| 85 | + EXPECT_EQ(read_count.load(), 0); |
| 86 | +} |
| 87 | + |
| 88 | +// Test 2: Writer blocks readers and writer should get the lock exclusively |
| 89 | +TEST_F(MRMWMutexTest, ReadersBlockWriters) { |
| 90 | + std::atomic<size_t> read_count(0); |
| 91 | + std::atomic<size_t> write_count(0); |
| 92 | + |
| 93 | + const int num_readers = 10; |
| 94 | + |
| 95 | + // Start multiple readers |
| 96 | + std::vector<util::fb2::Fiber> readers; |
| 97 | + readers.reserve(num_readers); |
| 98 | + |
| 99 | + for (int i = 0; i < num_readers; ++i) { |
| 100 | + readers.emplace_back(pp_->at(0)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 101 | + ReadTask(&mutex_, std::ref(read_count), kReadTaskSleepTime); |
| 102 | + })); |
| 103 | + } |
| 104 | + |
| 105 | + // Give readers time to acquire the lock |
| 106 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(10)); |
| 107 | + |
| 108 | + pp_->at(1) |
| 109 | + ->LaunchFiber(util::fb2::Launch::post, |
| 110 | + [&] { WriteTask(&mutex_, std::ref(write_count), kWriteTaskSleepTime); }) |
| 111 | + .Join(); |
| 112 | + |
| 113 | + // Wait for all reader threads to finish |
| 114 | + for (auto& t : readers) { |
| 115 | + t.Join(); |
| 116 | + } |
| 117 | + |
| 118 | + EXPECT_EQ(read_count.load(), 0); |
| 119 | + EXPECT_EQ(write_count.load(), 0); |
| 120 | +} |
| 121 | + |
| 122 | +// Test 3: Unlock transitions correctly and wakes up waiting threads |
| 123 | +TEST_F(MRMWMutexTest, ReaderAfterWriter) { |
| 124 | + std::atomic<size_t> write_count(0); |
| 125 | + std::atomic<size_t> read_count(0); |
| 126 | + |
| 127 | + // Start a writer thread |
| 128 | + auto writer = pp_->at(1)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 129 | + WriteTask(&mutex_, std::ref(write_count), kWriteTaskSleepTime); |
| 130 | + }); |
| 131 | + |
| 132 | + // Give writer time to acquire the lock |
| 133 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(10)); |
| 134 | + |
| 135 | + // Now start a reader task that will block until the writer is done |
| 136 | + pp_->at(0) |
| 137 | + ->LaunchFiber(util::fb2::Launch::post, |
| 138 | + [&] { ReadTask(&mutex_, std::ref(read_count), kReadTaskSleepTime); }) |
| 139 | + .Join(); |
| 140 | + |
| 141 | + // Ensure that writer has completed |
| 142 | + writer.Join(); |
| 143 | + |
| 144 | + EXPECT_EQ(read_count.load(), 0); |
| 145 | + EXPECT_EQ(write_count.load(), 0); |
| 146 | +} |
| 147 | + |
| 148 | +// Test 4: Ensure writer gets the lock after readers finish |
| 149 | +TEST_F(MRMWMutexTest, WriterAfterReaders) { |
| 150 | + std::atomic<size_t> read_count(0); |
| 151 | + std::atomic<size_t> write_count(0); |
| 152 | + |
| 153 | + // Start multiple readers |
| 154 | + const int num_readers = 10; |
| 155 | + std::vector<util::fb2::Fiber> readers; |
| 156 | + readers.reserve(num_readers); |
| 157 | + |
| 158 | + for (int i = 0; i < num_readers; ++i) { |
| 159 | + readers.emplace_back(pp_->at(0)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 160 | + ReadTask(&mutex_, std::ref(read_count), kReadTaskSleepTime); |
| 161 | + })); |
| 162 | + } |
| 163 | + |
| 164 | + // Wait for all readers to acquire and release the lock |
| 165 | + for (auto& t : readers) { |
| 166 | + t.Join(); |
| 167 | + } |
| 168 | + |
| 169 | + // Start the writer after all readers are done |
| 170 | + pp_->at(1) |
| 171 | + ->LaunchFiber(util::fb2::Launch::post, |
| 172 | + [&] { WriteTask(&mutex_, std::ref(write_count), kWriteTaskSleepTime); }) |
| 173 | + .Join(); |
| 174 | + |
| 175 | + EXPECT_EQ(read_count.load(), 0); |
| 176 | + EXPECT_EQ(write_count.load(), 0); |
| 177 | +} |
| 178 | + |
| 179 | +// Test 5: Mix of readers and writes |
| 180 | +TEST_F(MRMWMutexTest, MixWritersReaders) { |
| 181 | + std::atomic<size_t> read_count(0); |
| 182 | + std::atomic<size_t> write_count(0); |
| 183 | + |
| 184 | + // Start multiple readers and writers |
| 185 | + const int num_threads = 100; |
| 186 | + std::vector<util::fb2::Fiber> threads; |
| 187 | + threads.reserve(num_threads + 1); |
| 188 | + |
| 189 | + // Add long read task that will block all write tasks |
| 190 | + threads.emplace_back( |
| 191 | + pp_->at(0)->LaunchFiber([&] { ReadTask(&mutex_, std::ref(read_count), 2000); })); |
| 192 | + |
| 193 | + // Give long writer time to acquire the lock |
| 194 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(100)); |
| 195 | + |
| 196 | + size_t write_threads = 0; |
| 197 | + for (int i = 0; i < num_threads; ++i) { |
| 198 | + size_t fiber_id = rand() % 2; |
| 199 | + if (rand() % 3) { |
| 200 | + threads.emplace_back(pp_->at(fiber_id)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 201 | + ReadTask(&mutex_, std::ref(read_count), kReadTaskSleepTime); |
| 202 | + })); |
| 203 | + } else { |
| 204 | + write_threads++; |
| 205 | + threads.emplace_back(pp_->at(fiber_id)->LaunchFiber(util::fb2::Launch::post, [&] { |
| 206 | + WriteTask(&mutex_, std::ref(write_count), kWriteTaskSleepTime); |
| 207 | + })); |
| 208 | + } |
| 209 | + } |
| 210 | + |
| 211 | + // All shorter threads should be done and only long one remains |
| 212 | + util::ThisFiber::SleepFor(std::chrono::milliseconds(500)); |
| 213 | + |
| 214 | + EXPECT_EQ(read_count.load(), 1); |
| 215 | + |
| 216 | + EXPECT_EQ(write_count.load(), write_threads); |
| 217 | + |
| 218 | + // Wait for all readers to acquire and release the lock |
| 219 | + for (auto& t : threads) { |
| 220 | + t.Join(); |
| 221 | + } |
| 222 | +} |
| 223 | + |
| 224 | +} // namespace dfly::search |
0 commit comments