107 lines
2.8 KiB
C++
107 lines
2.8 KiB
C++
#include "includes.h"
|
|
|
|
using namespace std::chrono;
|
|
using std::chrono::milliseconds;
|
|
using test_clock = std::chrono::high_resolution_clock;
|
|
|
|
static milliseconds millis_from(const test_clock::time_point &tp0)
|
|
{
|
|
return std::chrono::duration_cast<milliseconds>(test_clock::now() - tp0);
|
|
}
|
|
TEST_CASE("dequeue-empty-nowait", "[mpmc_blocking_q]")
|
|
{
|
|
size_t q_size = 100;
|
|
milliseconds tolerance_wait(10);
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
int popped_item;
|
|
|
|
auto start = test_clock::now();
|
|
auto rv = q.dequeue_for(popped_item, milliseconds::zero());
|
|
auto delta_ms = millis_from(start);
|
|
|
|
REQUIRE(rv == false);
|
|
INFO("Delta " << delta_ms.count() << " millis");
|
|
REQUIRE(delta_ms <= tolerance_wait);
|
|
}
|
|
|
|
TEST_CASE("dequeue-empty-wait", "[mpmc_blocking_q]")
|
|
{
|
|
|
|
size_t q_size = 100;
|
|
milliseconds wait_ms(250);
|
|
milliseconds tolerance_wait(50);
|
|
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
int popped_item;
|
|
auto start = test_clock::now();
|
|
auto rv = q.dequeue_for(popped_item, wait_ms);
|
|
auto delta_ms = millis_from(start);
|
|
|
|
REQUIRE(rv == false);
|
|
|
|
INFO("Delta " << delta_ms.count() << " millis");
|
|
REQUIRE(delta_ms >= wait_ms - tolerance_wait);
|
|
REQUIRE(delta_ms <= wait_ms + tolerance_wait);
|
|
}
|
|
|
|
TEST_CASE("enqueue_nowait", "[mpmc_blocking_q]")
|
|
{
|
|
|
|
size_t q_size = 1;
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
milliseconds tolerance_wait(10);
|
|
|
|
q.enqueue(1);
|
|
REQUIRE(q.overrun_counter() == 0);
|
|
|
|
auto start = test_clock::now();
|
|
q.enqueue_nowait(2);
|
|
auto delta_ms = millis_from(start);
|
|
|
|
INFO("Delta " << delta_ms.count() << " millis");
|
|
REQUIRE(delta_ms <= tolerance_wait);
|
|
REQUIRE(q.overrun_counter() == 1);
|
|
}
|
|
|
|
TEST_CASE("bad_queue", "[mpmc_blocking_q]")
|
|
{
|
|
size_t q_size = 0;
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
q.enqueue_nowait(1);
|
|
REQUIRE(q.overrun_counter() == 1);
|
|
int i;
|
|
REQUIRE(q.dequeue_for(i, milliseconds(0)) == false);
|
|
}
|
|
|
|
TEST_CASE("empty_queue", "[mpmc_blocking_q]")
|
|
{
|
|
size_t q_size = 10;
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
int i;
|
|
REQUIRE(q.dequeue_for(i, milliseconds(10)) == false);
|
|
}
|
|
|
|
TEST_CASE("full_queue", "[mpmc_blocking_q]")
|
|
{
|
|
size_t q_size = 100;
|
|
spdlog::details::mpmc_blocking_queue<int> q(q_size);
|
|
for (int i = 0; i < static_cast<int>(q_size); i++)
|
|
{
|
|
q.enqueue(std::move(i));
|
|
}
|
|
|
|
q.enqueue_nowait(123456);
|
|
REQUIRE(q.overrun_counter() == 1);
|
|
|
|
for (int i = 1; i < static_cast<int>(q_size); i++)
|
|
{
|
|
int item = -1;
|
|
q.dequeue_for(item, milliseconds(0));
|
|
REQUIRE(item == i);
|
|
}
|
|
|
|
// last item pushed has overridden the oldest.
|
|
int item = -1;
|
|
q.dequeue_for(item, milliseconds(0));
|
|
REQUIRE(item == 123456);
|
|
} |