lokinet/llarp/pathset.cpp

90 lines
1.8 KiB
C++
Raw Normal View History

#include <llarp/path.hpp>
#include <llarp/pathset.hpp>
namespace llarp
{
namespace path
{
PathSet::PathSet(size_t num) : m_NumPaths(num)
{
}
bool
PathSet::ShouldBuildMore() const
{
return m_Paths.size() < m_NumPaths;
}
void
PathSet::Tick(llarp_time_t now, llarp_router* r)
{
for(auto& item : m_Paths)
{
if(item.second->status == ePathEstablished)
{
item.second->Tick(now, r);
}
}
}
void
PathSet::ExpirePaths(llarp_time_t now)
{
auto itr = m_Paths.begin();
while(itr != m_Paths.end())
{
if(itr->second->Expired(now))
{
delete itr->second;
itr = m_Paths.erase(itr);
}
else
++itr;
}
}
size_t
PathSet::NumInStatus(PathStatus st) const
{
size_t count = 0;
auto itr = m_Paths.begin();
while(itr != m_Paths.end())
{
if(itr->second->status == st)
++count;
++itr;
}
return count;
}
void
PathSet::AddPath(Path* path)
{
m_Paths.emplace(std::make_pair(path->Upstream(), path->RXID()), path);
}
void
PathSet::RemovePath(Path* path)
{
m_Paths.erase({path->Upstream(), path->RXID()});
}
Path*
PathSet::GetByUpstream(const RouterID& remote, const PathID_t& rxid)
{
auto itr = m_Paths.find({remote, rxid});
if(itr == m_Paths.end())
return nullptr;
return itr->second;
}
void
PathSet::HandlePathBuilt(Path* path)
{
auto dlt = llarp_time_now_ms() - path->buildStarted;
llarp::Info("Path build took ", dlt, "ms for tx=", path->TXID(),
" rx=", path->RXID());
}
} // namespace path
} // namespace llarp