lokinet/llarp/pathset.cpp
Jeff Becker 19e3b9c642 * more hidden service code
* begin lokinet api
2018-07-23 17:38:29 +10:00

147 lines
3.0 KiB
C++

#include <llarp/dht/messages/pubintro.hpp>
#include <llarp/messages/dht.hpp>
#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;
}
}
Path*
PathSet::GetPathByRouter(const RouterID& id)
{
auto itr = m_Paths.begin();
while(itr != m_Paths.end())
{
if(itr->second->IsReady())
{
if(itr->second->Endpoint() == id)
return itr->second;
}
++itr;
}
return nullptr;
}
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::LogInfo("Path build took ", dlt, "ms for tx=", path->TXID(),
" rx=", path->RXID());
}
bool
PathSet::GetCurrentIntroductions(
std::set< llarp::service::Introduction >& intros) const
{
intros.clear();
size_t count = 0;
auto itr = m_Paths.begin();
while(itr != m_Paths.end())
{
if(itr->second->IsReady())
{
intros.insert(itr->second->intro);
++count;
}
++itr;
}
return count > 0;
}
Path*
PathSet::PickRandomEstablishedPath()
{
std::vector< Path* > established;
auto itr = m_Paths.begin();
while(itr != m_Paths.end())
{
if(itr->second->IsReady())
established.push_back(itr->second);
++itr;
}
auto sz = established.size();
if(sz)
{
return established[llarp_randint() % sz];
}
else
return nullptr;
}
} // namespace path
} // namespace llarp