63 lines
1.7 KiB
C++
63 lines
1.7 KiB
C++
#include <iostream>
|
|
#include <future>
|
|
|
|
#include "daggy/ThreadPool.hpp"
|
|
|
|
#include <catch2/catch.hpp>
|
|
|
|
using namespace daggy;
|
|
|
|
TEST_CASE("threadpool", "[threadpool]") {
|
|
std::atomic<uint32_t> cnt(0);
|
|
ThreadPool tp(10);
|
|
|
|
std::vector<std::future<uint32_t>> rets;
|
|
|
|
SECTION("Adding large tasks queues with return values") {
|
|
auto tq = std::make_shared<daggy::TaskQueue>();
|
|
std::vector<std::future<uint32_t>> res;
|
|
for (size_t i = 0; i < 100; ++i)
|
|
res.emplace_back(std::move(tq->addTask([&cnt]() {
|
|
cnt++;
|
|
return cnt.load();
|
|
})));
|
|
tp.addTasks(tq);
|
|
for (auto &r: res) r.get();
|
|
REQUIRE(cnt == 100);
|
|
}
|
|
|
|
SECTION("Slow runs") {
|
|
std::vector<std::future<void>> res;
|
|
using namespace std::chrono_literals;
|
|
for (size_t i = 0; i < 100; ++i)
|
|
res.push_back(tp.addTask([&cnt]() {
|
|
std::this_thread::sleep_for(20ms);
|
|
cnt++;
|
|
return;
|
|
}));
|
|
for (auto &r: res) r.get();
|
|
REQUIRE(cnt == 100);
|
|
}
|
|
|
|
SECTION("parallel") {
|
|
std::vector<std::future<void>> res;
|
|
using namespace std::chrono_literals;
|
|
std::atomic<uint32_t> maxCnt{0};
|
|
for (size_t i = 0; i < 100; ++i)
|
|
res.push_back(tp.addTask([&cnt,&maxCnt, i]() {
|
|
auto delay = 20ms;
|
|
uint32_t current = cnt.fetch_add(1);
|
|
delay += i * 1ms;
|
|
std::this_thread::sleep_for(delay);
|
|
if (current > maxCnt) {
|
|
maxCnt = current;
|
|
}
|
|
cnt--;
|
|
return;
|
|
}));
|
|
for (auto &r: res) r.get();
|
|
REQUIRE(maxCnt > 1);
|
|
}
|
|
|
|
}
|