2018-06-26 01:30:36 +00:00
|
|
|
#ifndef LLARP_CODEL_QUEUE_HPP
|
|
|
|
#define LLARP_CODEL_QUEUE_HPP
|
2018-12-12 02:52:51 +00:00
|
|
|
|
2019-01-10 19:41:51 +00:00
|
|
|
#include <util/logger.hpp>
|
|
|
|
#include <util/mem.hpp>
|
|
|
|
#include <util/threading.hpp>
|
|
|
|
#include <util/time.hpp>
|
2018-07-09 04:26:27 +00:00
|
|
|
|
2018-07-30 04:38:14 +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>
|
2018-06-27 13:14:07 +00:00
|
|
|
#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-11-07 15:30:22 +00:00
|
|
|
DummyLock(__attribute__((unused)) const DummyMutex& mtx){};
|
2018-07-02 19:24:22 +00:00
|
|
|
|
|
|
|
~DummyLock()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
};
|
2018-08-29 20:40:26 +00:00
|
|
|
|
2018-11-15 13:13:19 +00:00
|
|
|
struct GetNowSyscall
|
|
|
|
{
|
|
|
|
llarp_time_t
|
|
|
|
operator()() const
|
|
|
|
{
|
2018-11-20 12:44:18 +00:00
|
|
|
return llarp::time_now_ms();
|
2018-11-15 13:13:19 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2018-07-20 04:50:28 +00:00
|
|
|
template < typename T, typename GetTime, typename PutTime, typename Compare,
|
2018-11-15 13:13:19 +00:00
|
|
|
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
|
|
|
|
{
|
2018-11-15 13:13:19 +00:00
|
|
|
CoDelQueue(const std::string& name, const PutTime& put, const GetNow& now)
|
|
|
|
: m_name(name), _putTime(put), _getNow(now)
|
2018-06-27 13:14:07 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2018-07-02 19:24:22 +00:00
|
|
|
size_t
|
|
|
|
Size()
|
|
|
|
{
|
|
|
|
Lock_t lock(m_QueueMutex);
|
2018-08-31 18:33:08 +00:00
|
|
|
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)
|
2018-08-20 19:12:12 +00:00
|
|
|
{
|
2018-08-31 18:33:08 +00:00
|
|
|
Lock_t lock(m_QueueMutex);
|
|
|
|
if(m_QueueIdx == MaxSize)
|
2018-08-20 19:12:12 +00:00
|
|
|
return false;
|
2018-08-31 18:33:08 +00:00
|
|
|
T* t = &m_Queue[m_QueueIdx];
|
|
|
|
new(t) T(std::forward< Args >(args)...);
|
|
|
|
if(!pred(*t))
|
2018-08-20 19:12:12 +00:00
|
|
|
{
|
2018-08-31 18:33:08 +00:00
|
|
|
t->~T();
|
|
|
|
return false;
|
2018-08-20 19:12:12 +00:00
|
|
|
}
|
2018-08-31 18:33:08 +00:00
|
|
|
|
2018-10-29 16:48:36 +00:00
|
|
|
_putTime(m_Queue[m_QueueIdx]);
|
2018-08-31 18:33:08 +00:00
|
|
|
if(firstPut == 0)
|
2018-10-29 16:48:36 +00:00
|
|
|
firstPut = _getTime(m_Queue[m_QueueIdx]);
|
2018-08-31 18:33:08 +00:00
|
|
|
++m_QueueIdx;
|
|
|
|
|
2018-08-20 19:12:12 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template < typename... Args >
|
|
|
|
void
|
|
|
|
Emplace(Args&&... args)
|
|
|
|
{
|
2018-08-31 18:33:08 +00:00
|
|
|
Lock_t lock(m_QueueMutex);
|
2018-09-07 17:41:49 +00:00
|
|
|
if(m_QueueIdx == MaxSize)
|
|
|
|
return;
|
2018-08-31 18:33:08 +00:00
|
|
|
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]);
|
2018-08-31 18:33:08 +00:00
|
|
|
if(firstPut == 0)
|
2018-10-29 16:48:36 +00:00
|
|
|
firstPut = _getTime(m_Queue[m_QueueIdx]);
|
2018-08-31 18:33:08 +00:00
|
|
|
++m_QueueIdx;
|
2018-06-26 01:30:36 +00:00
|
|
|
}
|
2018-08-31 14:41:04 +00:00
|
|
|
|
2018-08-21 18:17:16 +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
|
2018-11-17 18:40:13 +00:00
|
|
|
Process(Visit visitor, Filter f)
|
2018-06-26 01:30:36 +00:00
|
|
|
{
|
2018-11-15 13:13:19 +00:00
|
|
|
llarp_time_t lowest = std::numeric_limits< llarp_time_t >::max();
|
|
|
|
if(_getNow() < nextTickAt)
|
|
|
|
return;
|
2018-07-05 15:44:06 +00:00
|
|
|
// llarp::LogInfo("CoDelQueue::Process - start at ", start);
|
2018-07-02 19:24:22 +00:00
|
|
|
Lock_t lock(m_QueueMutex);
|
2018-06-27 13:14:07 +00:00
|
|
|
auto start = firstPut;
|
2018-11-15 13:13:19 +00:00
|
|
|
|
2018-08-31 18:33:08 +00:00
|
|
|
if(m_QueueIdx == 1)
|
|
|
|
{
|
|
|
|
visitor(m_Queue[0]);
|
2018-08-31 19:48:54 +00:00
|
|
|
T* t = &m_Queue[0];
|
|
|
|
t->~T();
|
2018-08-31 18:33:08 +00:00
|
|
|
m_QueueIdx = 0;
|
|
|
|
firstPut = 0;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
size_t idx = 0;
|
|
|
|
while(m_QueueIdx)
|
2018-06-26 01:30:36 +00:00
|
|
|
{
|
2018-08-31 18:33:08 +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;
|
2018-08-31 18:33:08 +00:00
|
|
|
--m_QueueIdx;
|
2018-10-29 16:48:36 +00:00
|
|
|
auto dlt = start - _getTime(*item);
|
2018-07-05 15:44:06 +00:00
|
|
|
// llarp::LogInfo("CoDelQueue::Process - dlt ", dlt);
|
2018-06-29 12:15:15 +00:00
|
|
|
lowest = std::min(dlt, lowest);
|
2018-11-17 18:40:13 +00:00
|
|
|
if(m_QueueIdx == 0)
|
2018-06-26 01:30:36 +00:00
|
|
|
{
|
2018-07-05 15:44:06 +00:00
|
|
|
// llarp::LogInfo("CoDelQueue::Process - single item: lowest ",
|
|
|
|
// lowest, " dropMs: ", dropMs);
|
2018-06-26 01:30:36 +00:00
|
|
|
if(lowest > dropMs)
|
|
|
|
{
|
2018-08-31 18:33:08 +00:00
|
|
|
item->~T();
|
2018-06-26 13:39:29 +00:00
|
|
|
nextTickInterval += initialIntervalMs / std::sqrt(++dropNum);
|
2018-11-15 13:13:19 +00:00
|
|
|
firstPut = 0;
|
|
|
|
nextTickAt = start + nextTickInterval;
|
2018-08-29 20:40:26 +00:00
|
|
|
return;
|
2018-06-26 01:30:36 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
nextTickInterval = initialIntervalMs;
|
|
|
|
dropNum = 0;
|
|
|
|
}
|
|
|
|
}
|
2018-08-31 18:33:08 +00:00
|
|
|
visitor(*item);
|
|
|
|
item->~T();
|
2018-06-26 01:30:36 +00:00
|
|
|
}
|
2018-11-15 13:13:19 +00:00
|
|
|
firstPut = 0;
|
|
|
|
nextTickAt = start + nextTickInterval;
|
2018-06-26 01:30:36 +00:00
|
|
|
}
|
|
|
|
|
2018-06-27 13:14:07 +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-11-15 13:13:19 +00:00
|
|
|
llarp_time_t nextTickAt = 0;
|
2018-07-02 19:24:22 +00:00
|
|
|
Mutex_t m_QueueMutex;
|
2018-08-31 18:33:08 +00:00
|
|
|
size_t m_QueueIdx = 0;
|
|
|
|
T m_Queue[MaxSize];
|
2018-06-27 13:14:07 +00:00
|
|
|
std::string m_name;
|
2018-10-29 16:48:36 +00:00
|
|
|
GetTime _getTime;
|
|
|
|
PutTime _putTime;
|
2018-11-15 13:13:19 +00:00
|
|
|
GetNow _getNow;
|
2018-08-31 18:33:08 +00:00
|
|
|
}; // namespace util
|
|
|
|
} // namespace util
|
2018-06-26 01:30:36 +00:00
|
|
|
} // namespace llarp
|
|
|
|
|
2018-06-27 10:59:23 +00:00
|
|
|
#endif
|