1
1
Fork 0
mirror of https://github.com/oxen-io/lokinet synced 2023-12-14 06:53:00 +01:00
lokinet/llarp/codel.hpp

83 lines
2.4 KiB
C++
Raw Normal View History

2018-06-26 03:30:36 +02:00
#ifndef LLARP_CODEL_QUEUE_HPP
#define LLARP_CODEL_QUEUE_HPP
#include <llarp/time.h>
#include <cmath>
#include <functional>
#include <mutex>
#include <queue>
namespace llarp
{
namespace util
{
template < typename T, typename GetTime, llarp_time_t dropMs = 200,
2018-06-26 03:30:36 +02:00
llarp_time_t initialIntervalMs = 100 >
struct CoDelQueue
{
struct CoDelCompare
{
GetTime getTime = GetTime();
bool
operator()(const T& left, const T& right) const
{
return getTime(left) < getTime(right);
}
};
void
Put(T* item)
{
std::unique_lock< std::mutex > lock(m_QueueMutex);
m_Queue.push(*item);
//llarp::Info("CoDelQueue::Put - adding item, queue now has ", m_Queue.size(), " items at ", getTime(*item));
2018-06-26 03:30:36 +02:00
}
void
Process(std::queue< T >& result)
{
llarp_time_t lowest = 0xFFFFFFFFFFFFFFFFUL;
auto start = llarp_time_now_ms();
//llarp::Info("CoDelQueue::Process - start at ", start);
2018-06-26 03:30:36 +02:00
std::unique_lock< std::mutex > lock(m_QueueMutex);
while(m_Queue.size())
{
//llarp::Info("CoDelQueue::Process - queue has ", m_Queue.size());
2018-06-26 03:30:36 +02:00
const auto& item = m_Queue.top();
auto dlt = start - getTime(item);
//llarp::Info("CoDelQueue::Process - dlt ", dlt);
2018-06-26 03:30:36 +02:00
lowest = std::min(dlt, lowest);
if(m_Queue.size() == 1)
{
//llarp::Info("CoDelQueue::Process - single item: lowest ", lowest, " dropMs: ", dropMs);
2018-06-26 03:30:36 +02:00
if(lowest > dropMs)
{
// drop
llarp::Error("CoDelQueue::Process - dropping");
2018-06-26 03:30:36 +02:00
nextTickInterval = initialIntervalMs / std::sqrt(++dropNum);
m_Queue.pop();
return;
}
else
{
nextTickInterval = initialIntervalMs;
dropNum = 0;
}
}
//llarp::Info("CoDelQueue::Process - passing");
2018-06-26 03:30:36 +02:00
result.push(item);
m_Queue.pop();
}
}
GetTime getTime = GetTime();
size_t dropNum = 0;
llarp_time_t nextTickInterval = initialIntervalMs;
std::mutex m_QueueMutex;
std::priority_queue< T, std::vector< T >, CoDelCompare > m_Queue;
};
} // namespace util
} // namespace llarp
#endif