66 lines
1.4 KiB
C++
66 lines
1.4 KiB
C++
#include "ringloop.h"
|
|
|
|
ring_loop_t::ring_loop_t(int qd)
|
|
{
|
|
int ret = io_uring_queue_init(qd, &ring, 0);
|
|
if (ret < 0)
|
|
{
|
|
throw std::runtime_error(std::string("io_uring_queue_init: ") + strerror(-ret));
|
|
}
|
|
ring_data = (struct ring_data_t*)malloc(sizeof(ring_data_t) * ring.sq.ring_sz);
|
|
if (!ring_data)
|
|
{
|
|
throw std::bad_alloc();
|
|
}
|
|
}
|
|
|
|
ring_loop_t::~ring_loop_t()
|
|
{
|
|
free(ring_data);
|
|
io_uring_queue_exit(&ring);
|
|
}
|
|
|
|
int ring_loop_t::register_consumer(ring_consumer_t & consumer)
|
|
{
|
|
consumer.number = consumers.size();
|
|
consumers.push_back(consumer);
|
|
return consumer.number;
|
|
}
|
|
|
|
void ring_loop_t::wakeup()
|
|
{
|
|
loop_again = true;
|
|
}
|
|
|
|
void ring_loop_t::unregister_consumer(ring_consumer_t & consumer)
|
|
{
|
|
if (consumer.number >= 0 && consumer.number < consumers.size())
|
|
{
|
|
consumers[consumer.number].loop = NULL;
|
|
consumer.number = -1;
|
|
}
|
|
}
|
|
|
|
void ring_loop_t::loop()
|
|
{
|
|
struct io_uring_cqe *cqe;
|
|
while (!io_uring_peek_cqe(&ring, &cqe))
|
|
{
|
|
struct ring_data_t *d = (struct ring_data_t*)cqe->user_data;
|
|
if (d->callback)
|
|
{
|
|
d->res = cqe->res;
|
|
d->callback(d);
|
|
}
|
|
io_uring_cqe_seen(&ring, cqe);
|
|
}
|
|
do
|
|
{
|
|
loop_again = false;
|
|
for (int i = 0; i < consumers.size(); i++)
|
|
{
|
|
consumers[i].loop();
|
|
}
|
|
} while (loop_again);
|
|
}
|