#if defined(__GNUC__)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wshadow"
#elif defined(_MSC_VER)
#pragma warning(push)
#pragma warning(disable: 4127)
#pragma warning(disable: 4702)
#endif
#include "cameron/blockingconcurrentqueue.h"
#include "cameron/concurrentqueue.h"
#include "cameron/concurrentqueue.h"
#include "lockfree/lock-bounded-queue.hpp"
#include "lockfree/mpmc-bounded-queue.hpp"
#if defined(__GNUC__)
#pragma GCC diagnostic pop
#elif defined(_MSC_VER)
#pragma warning(pop)
#endif
#include <atomic>
#include <memory>
const int queue_bound_size = 65536;
const int items_to_produce = 10000000;
const auto settings =
CppBenchmark::Settings().
Infinite().
PCRange(1, 8, [](
int producers_from,
int producers_to,
int& producers_result) {
int r = producers_result; producers_result *= 2;
return r; },
1, 8, [](int consumers_from, int consumers_to, int& consumers_result) { int r = consumers_result; consumers_result *= 2; return r; });
template <class TConcurrentQueue>
{
public:
protected:
{
_queue = std::make_shared<TConcurrentQueue>();
_count = 1;
}
{
_queue.reset();
}
{
if (_count >= items_to_produce)
{
if (_queue->try_enqueue(0))
return;
}
if (_queue->try_enqueue(_count))
++_count;
}
{
int value = -1;
if (_queue->try_dequeue(value) && (value == 0))
}
private:
std::shared_ptr<TConcurrentQueue> _queue;
std::atomic<int> _count;
};
{
public:
protected:
{
_queue = std::make_shared<mpmc_bounded_queue_t<int>>(queue_bound_size);
_count = 1;
}
{
_queue.reset();
}
{
if (_count >= items_to_produce)
{
int value = 0;
if (_queue->enqueue(value))
return;
}
int value = _count;
if (_queue->enqueue(value))
++_count;
}
{
int value = -1;
if (_queue->dequeue(value) && (value == 0))
}
private:
std::shared_ptr<mpmc_bounded_queue_t<int>> _queue;
std::atomic<int> _count;
};
{
public:
protected:
{
_queue = std::make_shared<lock_bounded_queue_t<int>>(queue_bound_size);
_count = 1;
}
{
_queue.reset();
}
{
if (_count >= items_to_produce)
{
int value = 0;
_queue->enqueue(value);
return;
}
int value = _count;
_queue->enqueue(value);
++_count;
}
{
int value = -1;
_queue->dequeue(value);
if (value == 0)
}
private:
std::shared_ptr<lock_bounded_queue_t<int>> _queue;
std::atomic<int> _count;
};
BENCHMARK_CLASS(ConcurrentQueueBenchmark<moodycamel::BlockingConcurrentQueue<int>>,
"moodycamel::BlockingConcurrentQueue<int>", settings)
BENCHMARK_CLASS(ConcurrentQueueBenchmark<moodycamel::ConcurrentQueue<int>>,
"moodycamel::ConcurrentQueueBenchmark<int>", settings)
BENCHMARK_CLASS(MPMCBoundedQueueBenchmark,
"lockfree::mpmc_bounded_queue_t<int>", settings)
BENCHMARK_CLASS(LockBoundedQueueBenchmark,
"lockfree::lock_bounded_queue_t<int>", settings)
Producers/Consumers benchmark base class.
BenchmarkPC(const std::string &name, Types... settings)
Default class constructor.
virtual void RunConsumer(ContextPC &context)=0
Consumer run method.
virtual void RunProducer(ContextPC &context)=0
Producer run method.
Benchmark producer/consumer running context.
void StopConsume() noexcept
Stop benchmark consumption.
void StopProduce() noexcept
Stop benchmark production.
virtual void Initialize(ContextPC &context)
Initialize benchmark.
virtual void Cleanup(ContextPC &context)
Cleanup benchmark.
Settings & Infinite()
Set infinite benchmark operations flag.
Settings & PCRange(int producers_from, int producers_to, int consumers_from, int consumers_to)
Add new producers/consumers range to the benchmark running plan.
CppBenchmark definitions.
#define BENCHMARK_CLASS(type,...)
Benchmark class register macro.
#define BENCHMARK_MAIN()
Benchmark main entry point macro.