This repository has been archived on 2020-05-25. You can view files and clone it, but cannot push or open issues or pull requests.
tdlib-fork/tdutils/test/MpmcWaiter.cpp
levlam eaebfad034 Update copyright year.
GitOrigin-RevId: 359e2b43322222922c44c430d3814b0a4c778dc6
2019-01-01 01:02:34 +03:00

118 lines
3.5 KiB
C++

//
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2019
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include "td/utils/MpmcWaiter.h"
#include "td/utils/port/sleep.h"
#include "td/utils/port/thread.h"
#include "td/utils/Random.h"
#include "td/utils/tests.h"
#include <atomic>
#if !TD_THREAD_UNSUPPORTED
TEST(MpmcWaiter, stress_one_one) {
td::Stage run;
td::Stage check;
std::vector<td::thread> threads;
std::atomic<size_t> value;
size_t write_cnt = 10;
td::unique_ptr<td::MpmcWaiter> waiter;
size_t threads_n = 2;
for (size_t i = 0; i < threads_n; i++) {
threads.push_back(td::thread([&, id = static_cast<td::uint32>(i)] {
for (td::uint64 round = 1; round < 100000; round++) {
if (id == 0) {
value = 0;
waiter = td::make_unique<td::MpmcWaiter>();
write_cnt = td::Random::fast(1, 10);
}
run.wait(round * threads_n);
if (id == 1) {
for (size_t i = 0; i < write_cnt; i++) {
value.store(i + 1, std::memory_order_relaxed);
waiter->notify();
}
} else {
int yields = 0;
for (size_t i = 1; i <= write_cnt; i++) {
while (true) {
auto x = value.load(std::memory_order_relaxed);
if (x >= i) {
break;
}
yields = waiter->wait(yields, id);
}
yields = waiter->stop_wait(yields, id);
}
}
check.wait(round * threads_n);
}
}));
}
for (auto &thread : threads) {
thread.join();
}
}
TEST(MpmcWaiter, stress) {
td::Stage run;
td::Stage check;
std::vector<td::thread> threads;
size_t write_n;
size_t read_n;
std::atomic<size_t> write_pos;
std::atomic<size_t> read_pos;
size_t end_pos;
size_t write_cnt;
size_t threads_n = 20;
td::unique_ptr<td::MpmcWaiter> waiter;
for (size_t i = 0; i < threads_n; i++) {
threads.push_back(td::thread([&, id = static_cast<td::uint32>(i)] {
for (td::uint64 round = 1; round < 1000; round++) {
if (id == 0) {
write_n = td::Random::fast(1, 10);
read_n = td::Random::fast(1, 10);
write_cnt = td::Random::fast(1, 50);
end_pos = write_n * write_cnt;
write_pos = 0;
read_pos = 0;
waiter = td::make_unique<td::MpmcWaiter>();
}
run.wait(round * threads_n);
if (id <= write_n) {
for (size_t i = 0; i < write_cnt; i++) {
if (td::Random::fast(0, 20) == 0) {
td::usleep_for(td::Random::fast(1, 300));
}
write_pos.fetch_add(1, std::memory_order_relaxed);
waiter->notify();
}
} else if (id > 10 && id - 10 <= read_n) {
int yields = 0;
while (true) {
auto x = read_pos.load(std::memory_order_relaxed);
if (x == end_pos) {
break;
}
if (x == write_pos.load(std::memory_order_relaxed)) {
yields = waiter->wait(yields, id);
continue;
}
yields = waiter->stop_wait(yields, id);
read_pos.compare_exchange_strong(x, x + 1, std::memory_order_relaxed);
}
}
check.wait(round * threads_n);
}
}));
}
for (auto &thread : threads) {
thread.join();
}
}
#endif // !TD_THREAD_UNSUPPORTED