libcruft-util/test/job/queue.cpp

46 lines
1.4 KiB
C++
Raw Normal View History

///////////////////////////////////////////////////////////////////////////////
#include "job/queue.hpp"
#include "tap.hpp"
#include <chrono>
#include <iostream>
///////////////////////////////////////////////////////////////////////////////
int
main (void)
{
util::TAP::logger tap;
// dispatch `INNER' simple jobs `OUTTER' times that simply increment an
// atomic variable and quit. this tests that all threads are created,
// executed, and finished. it's not definitive, but executing this many
// items this many times seems reasonably reliable in exposing deadlocks.
bool success = true;
constexpr int OUTTER = 1;
constexpr int INNER = 1;
for (auto i = 0; i < OUTTER && success; ++i) {
std::atomic<int> count = 0;
{
util::job::queue q {1};
std::vector<util::job::queue::cookie> cookies;
for (int j = 0; j < INNER; ++j) {
cookies.push_back (
q.submit ([&count] (int sleep_for) noexcept {
std::this_thread::sleep_for (std::chrono::microseconds (sleep_for % 25));
++count;
}, j)
);
}
}
std::cout << count << '\n';
success = count == INNER && success;
}
tap.expect (success, "trivial increment jobs");
return tap.status ();
}