lokinet/llarp/util/codel.hpp

166 lines
4.4 KiB
C++
Raw Normal View History

2018-06-26 01:30:36 +00:00
#ifndef LLARP_CODEL_QUEUE_HPP
#define LLARP_CODEL_QUEUE_HPP
2019-09-01 12:10:49 +00:00
#include <util/logging/logger.hpp>
#include <util/mem.hpp>
2019-09-01 13:26:16 +00:00
#include <util/thread/threading.hpp>
#include <util/time.hpp>
2018-07-09 04:26:27 +00:00
#include <algorithm>
2018-12-12 01:47:29 +00:00
#include <array>
2018-06-26 01:30:36 +00:00
#include <cmath>
#include <functional>
#include <string>
2019-07-30 23:42:13 +00:00
#include <utility>
2018-06-26 01:30:36 +00:00
namespace llarp
{
namespace util
{
struct GetNowSyscall
{
llarp_time_t
operator()() const
{
2018-11-20 12:44:18 +00:00
return llarp::time_now_ms();
}
};
2018-07-20 04:50:28 +00:00
template < typename T, typename GetTime, typename PutTime, typename Compare,
typename GetNow = GetNowSyscall, typename Mutex_t = util::Mutex,
typename Lock_t = util::Lock, llarp_time_t dropMs = 5,
llarp_time_t initialIntervalMs = 100, size_t MaxSize = 1024 >
2018-06-26 01:30:36 +00:00
struct CoDelQueue
{
2019-07-30 23:42:13 +00:00
CoDelQueue(std::string name, PutTime put, GetNow now)
: m_QueueIdx(0)
, m_name(std::move(name))
, _putTime(std::move(put))
, _getNow(std::move(now))
{
}
2018-07-02 19:24:22 +00:00
size_t
Size() LOCKS_EXCLUDED(m_QueueMutex)
2018-07-02 19:24:22 +00:00
{
Lock_t lock(m_QueueMutex);
return m_QueueIdx;
2018-07-02 19:24:22 +00:00
}
2018-08-20 19:12:12 +00:00
template < typename... Args >
bool
2018-08-31 14:41:04 +00:00
EmplaceIf(std::function< bool(T&) > pred, Args&&... args)
LOCKS_EXCLUDED(m_QueueMutex)
2018-08-20 19:12:12 +00:00
{
Lock_t lock(&m_QueueMutex);
if(m_QueueIdx == MaxSize)
2018-08-20 19:12:12 +00:00
return false;
T* t = &m_Queue[m_QueueIdx];
new(t) T(std::forward< Args >(args)...);
if(!pred(*t))
2018-08-20 19:12:12 +00:00
{
t->~T();
return false;
2018-08-20 19:12:12 +00:00
}
2018-10-29 16:48:36 +00:00
_putTime(m_Queue[m_QueueIdx]);
if(firstPut == 0)
2018-10-29 16:48:36 +00:00
firstPut = _getTime(m_Queue[m_QueueIdx]);
++m_QueueIdx;
2018-08-20 19:12:12 +00:00
return true;
}
template < typename... Args >
void
Emplace(Args&&... args) LOCKS_EXCLUDED(m_QueueMutex)
2018-08-20 19:12:12 +00:00
{
Lock_t lock(&m_QueueMutex);
2018-09-07 17:41:49 +00:00
if(m_QueueIdx == MaxSize)
return;
T* t = &m_Queue[m_QueueIdx];
new(t) T(std::forward< Args >(args)...);
2018-10-29 16:48:36 +00:00
_putTime(m_Queue[m_QueueIdx]);
if(firstPut == 0)
2018-10-29 16:48:36 +00:00
firstPut = _getTime(m_Queue[m_QueueIdx]);
++m_QueueIdx;
2018-06-26 01:30:36 +00:00
}
2018-08-31 14:41:04 +00:00
template < typename Visit >
void
2018-09-07 17:41:49 +00:00
Process(Visit v)
{
return Process(v, [](T&) -> bool { return false; });
}
template < typename Visit, typename Filter >
void
Process(Visit visitor, Filter f) LOCKS_EXCLUDED(m_QueueMutex)
2018-06-26 01:30:36 +00:00
{
llarp_time_t lowest = std::numeric_limits< llarp_time_t >::max();
if(_getNow() < nextTickAt)
return;
// llarp::LogInfo("CoDelQueue::Process - start at ", start);
Lock_t lock(&m_QueueMutex);
auto start = firstPut;
if(m_QueueIdx == 1)
{
visitor(m_Queue[0]);
2018-08-31 19:48:54 +00:00
T* t = &m_Queue[0];
t->~T();
m_QueueIdx = 0;
firstPut = 0;
return;
}
size_t idx = 0;
while(m_QueueIdx)
2018-06-26 01:30:36 +00:00
{
llarp::LogDebug(m_name, " - queue has ", m_QueueIdx);
T* item = &m_Queue[idx++];
2018-09-07 17:41:49 +00:00
if(f(*item))
break;
--m_QueueIdx;
2018-10-29 16:48:36 +00:00
auto dlt = start - _getTime(*item);
// llarp::LogInfo("CoDelQueue::Process - dlt ", dlt);
2018-06-29 12:15:15 +00:00
lowest = std::min(dlt, lowest);
if(m_QueueIdx == 0)
2018-06-26 01:30:36 +00:00
{
// llarp::LogInfo("CoDelQueue::Process - single item: lowest ",
// lowest, " dropMs: ", dropMs);
2018-06-26 01:30:36 +00:00
if(lowest > dropMs)
{
item->~T();
2018-06-26 13:39:29 +00:00
nextTickInterval += initialIntervalMs / std::sqrt(++dropNum);
firstPut = 0;
nextTickAt = start + nextTickInterval;
2018-08-29 20:40:26 +00:00
return;
2018-06-26 01:30:36 +00:00
}
2019-07-06 17:03:40 +00:00
nextTickInterval = initialIntervalMs;
dropNum = 0;
2018-06-26 01:30:36 +00:00
}
visitor(*item);
item->~T();
2018-06-26 01:30:36 +00:00
}
firstPut = 0;
nextTickAt = start + nextTickInterval;
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;
llarp_time_t nextTickAt = 0;
2018-07-02 19:24:22 +00:00
Mutex_t m_QueueMutex;
size_t m_QueueIdx GUARDED_BY(m_QueueMutex);
std::array< T, MaxSize > m_Queue GUARDED_BY(m_QueueMutex);
std::string m_name;
2018-10-29 16:48:36 +00:00
GetTime _getTime;
PutTime _putTime;
GetNow _getNow;
}; // namespace util
} // namespace util
2018-06-26 01:30:36 +00:00
} // namespace llarp
#endif