lokinet/include/llarp/codel.hpp

134 lines
3.3 KiB
C++
Raw Normal View History

2018-06-26 01:30:36 +00:00
#ifndef LLARP_CODEL_QUEUE_HPP
#define LLARP_CODEL_QUEUE_HPP
#ifdef _MSC_VER
#define NOMINMAX
#endif
2018-06-26 01:30:36 +00:00
#include <llarp/time.h>
2018-07-19 04:58:39 +00:00
#include <llarp/logger.hpp>
#include <llarp/threading.hpp>
2018-07-09 04:26:27 +00:00
#include <algorithm>
2018-06-26 01:30:36 +00:00
#include <cmath>
#include <functional>
2018-06-26 01:30:36 +00:00
#include <queue>
#include <string>
2018-06-26 01:30:36 +00:00
namespace llarp
{
namespace util
{
2018-07-02 19:24:22 +00:00
struct DummyMutex
{
};
struct DummyLock
{
2018-07-03 12:10:44 +00:00
DummyLock(const DummyMutex& mtx){};
2018-07-02 19:24:22 +00:00
~DummyLock()
{
}
};
2018-07-20 04:50:28 +00:00
template < typename T, typename GetTime >
struct CoDelCompareTime
{
bool
operator()(const T& left, const T& right) const
{
return GetTime()(left) < GetTime()(right);
}
};
2018-07-02 19:24:22 +00:00
2018-07-20 04:50:28 +00:00
template < typename T >
struct CoDelComparePriority
{
bool
operator()(const T& left, const T& right) const
{
return left < right;
}
};
template < typename T, typename GetTime, typename PutTime, typename Compare,
2018-07-02 19:24:22 +00:00
typename Mutex_t = std::mutex,
typename Lock_t = std::lock_guard< std::mutex >,
2018-07-20 04:50:28 +00:00
llarp_time_t dropMs = 5, llarp_time_t initialIntervalMs = 100 >
2018-06-26 01:30:36 +00:00
struct CoDelQueue
{
CoDelQueue(const std::string& name) : m_name(name)
{
}
2018-07-02 19:24:22 +00:00
size_t
Size()
{
Lock_t lock(m_QueueMutex);
return m_Queue.size();
}
2018-06-26 01:30:36 +00:00
void
2018-07-20 04:50:28 +00:00
Put(T i)
2018-06-26 01:30:36 +00:00
{
2018-07-02 19:24:22 +00:00
Lock_t lock(m_QueueMutex);
// llarp::LogInfo("CoDelQueue::Put - adding item, queue now has ",
2018-06-29 12:15:15 +00:00
// m_Queue.size(), " items at ", getTime(*item));
PutTime()(i);
m_Queue.push(i);
if(firstPut == 0)
firstPut = GetTime()(i);
2018-06-26 01:30:36 +00:00
}
2018-07-03 13:13:56 +00:00
template < typename Queue_t >
2018-06-26 01:30:36 +00:00
void
2018-07-03 13:13:56 +00:00
Process(Queue_t& result)
2018-06-26 01:30:36 +00:00
{
llarp_time_t lowest = 0xFFFFFFFFFFFFFFFFUL;
2018-06-29 12:15:15 +00:00
// auto start = llarp_time_now_ms();
// llarp::LogInfo("CoDelQueue::Process - start at ", start);
2018-07-02 19:24:22 +00:00
Lock_t lock(m_QueueMutex);
auto start = firstPut;
2018-06-26 01:30:36 +00:00
while(m_Queue.size())
{
// llarp::LogInfo("CoDelQueue::Process - queue has ", m_Queue.size());
2018-06-26 01:30:36 +00:00
const auto& item = m_Queue.top();
auto dlt = start - GetTime()(item);
// llarp::LogInfo("CoDelQueue::Process - dlt ", dlt);
2018-06-29 12:15:15 +00:00
lowest = std::min(dlt, lowest);
2018-06-26 01:30:36 +00:00
if(m_Queue.size() == 1)
{
// llarp::LogInfo("CoDelQueue::Process - single item: lowest ",
// lowest, " dropMs: ", dropMs);
2018-06-26 01:30:36 +00:00
if(lowest > dropMs)
{
// drop
2018-06-26 13:39:29 +00:00
nextTickInterval += initialIntervalMs / std::sqrt(++dropNum);
delete item;
2018-06-26 01:30:36 +00:00
m_Queue.pop();
break;
2018-06-26 01:30:36 +00:00
}
else
{
nextTickInterval = initialIntervalMs;
dropNum = 0;
}
}
// llarp::LogInfo("CoDelQueue::Process - passing");
2018-06-26 01:30:36 +00:00
result.push(item);
m_Queue.pop();
}
firstPut = 0;
2018-06-26 01:30:36 +00:00
}
llarp_time_t firstPut = 0;
2018-06-26 01:30:36 +00:00
size_t dropNum = 0;
llarp_time_t nextTickInterval = initialIntervalMs;
2018-07-02 19:24:22 +00:00
Mutex_t m_QueueMutex;
2018-07-20 04:50:28 +00:00
std::priority_queue< T, std::vector< T >, Compare > m_Queue;
std::string m_name;
2018-06-26 01:30:36 +00:00
};
} // namespace util
} // namespace llarp
#endif