mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-11-19 09:25:28 +00:00
465 lines
10 KiB
C++
465 lines
10 KiB
C++
#include "path.hpp"
|
|
#include "pathset.hpp"
|
|
|
|
#include <llarp/router/router.hpp>
|
|
|
|
#include <random>
|
|
|
|
namespace llarp::path
|
|
{
|
|
PathSet::PathSet(size_t num) : numDesiredPaths(num)
|
|
{}
|
|
|
|
bool
|
|
PathSet::ShouldBuildMore(llarp_time_t now) const
|
|
{
|
|
(void)now;
|
|
const auto building = NumInStatus(ePathBuilding);
|
|
if (building >= numDesiredPaths)
|
|
return false;
|
|
const auto established = NumInStatus(ePathEstablished);
|
|
return established < numDesiredPaths;
|
|
}
|
|
|
|
bool
|
|
PathSet::ShouldBuildMoreForRoles(llarp_time_t now, PathRole roles) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
const size_t required = MinRequiredForRoles(roles);
|
|
size_t has = 0;
|
|
for (const auto& item : m_Paths)
|
|
{
|
|
if (item.second->SupportsAnyRoles(roles))
|
|
{
|
|
if (!item.second->ExpiresSoon(now))
|
|
++has;
|
|
}
|
|
}
|
|
return has < required;
|
|
}
|
|
|
|
size_t
|
|
PathSet::MinRequiredForRoles(PathRole roles) const
|
|
{
|
|
(void)roles;
|
|
return 0;
|
|
}
|
|
|
|
size_t
|
|
PathSet::NumPathsExistingAt(llarp_time_t futureTime) const
|
|
{
|
|
size_t num = 0;
|
|
Lock_t l(m_PathsMutex);
|
|
for (const auto& item : m_Paths)
|
|
{
|
|
if (item.second->IsReady() && !item.second->Expired(futureTime))
|
|
++num;
|
|
}
|
|
return num;
|
|
}
|
|
|
|
void
|
|
PathSet::TickPaths(Router* r)
|
|
{
|
|
const auto now = llarp::time_now_ms();
|
|
Lock_t l{m_PathsMutex};
|
|
for (auto& item : m_Paths)
|
|
{
|
|
item.second->Tick(now, r);
|
|
}
|
|
}
|
|
|
|
void
|
|
PathSet::Tick(llarp_time_t)
|
|
{
|
|
std::unordered_set<RouterID> endpoints;
|
|
for (auto& item : m_Paths)
|
|
{
|
|
endpoints.emplace(item.second->Endpoint());
|
|
}
|
|
|
|
m_PathCache.clear();
|
|
for (const auto& ep : endpoints)
|
|
{
|
|
if (auto path = GetPathByRouter(ep))
|
|
{
|
|
m_PathCache[ep] = path->weak_from_this();
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
PathSet::ExpirePaths(llarp_time_t now, [[maybe_unused]] Router* router)
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
if (m_Paths.size() == 0)
|
|
return;
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->Expired(now))
|
|
{
|
|
// TODO: this
|
|
PathID_t txid = itr->second->TXID();
|
|
// router->outboundMessageHandler().RemovePath(std::move(txid));
|
|
PathID_t rxid = itr->second->RXID();
|
|
// router->outboundMessageHandler().RemovePath(std::move(rxid));
|
|
itr = m_Paths.erase(itr);
|
|
}
|
|
else
|
|
++itr;
|
|
}
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetEstablishedPathClosestTo(
|
|
RouterID id, std::unordered_set<RouterID> excluding, PathRole roles) const
|
|
{
|
|
Lock_t l{m_PathsMutex};
|
|
Path_ptr path = nullptr;
|
|
AlignedBuffer<32> dist;
|
|
AlignedBuffer<32> to = id;
|
|
dist.Fill(0xff);
|
|
for (const auto& item : m_Paths)
|
|
{
|
|
if (!item.second->IsReady())
|
|
continue;
|
|
if (!item.second->SupportsAnyRoles(roles))
|
|
continue;
|
|
if (excluding.count(item.second->Endpoint()))
|
|
continue;
|
|
AlignedBuffer<32> localDist = item.second->Endpoint() ^ to;
|
|
if (localDist < dist)
|
|
{
|
|
dist = localDist;
|
|
path = item.second;
|
|
}
|
|
}
|
|
return path;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetNewestPathByRouter(RouterID id, PathRole roles) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
Path_ptr chosen = nullptr;
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->SupportsAnyRoles(roles))
|
|
{
|
|
if (itr->second->Endpoint() == id)
|
|
{
|
|
// Note: revisit these, are they supposed to be redundant?
|
|
// if (chosen == nullptr)
|
|
// chosen = itr->second;
|
|
// else if (chosen->intro.expiry < itr->second->intro.expiry)
|
|
// chosen = itr->second;
|
|
chosen = itr->second;
|
|
}
|
|
}
|
|
++itr;
|
|
}
|
|
return chosen;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetPathByRouter(RouterID id, PathRole roles) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
Path_ptr chosen = nullptr;
|
|
if (roles == ePathRoleAny)
|
|
{
|
|
if (auto itr = m_PathCache.find(id); itr != m_PathCache.end())
|
|
{
|
|
return itr->second.lock();
|
|
}
|
|
}
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->SupportsAnyRoles(roles))
|
|
{
|
|
if (itr->second->Endpoint() == id)
|
|
{
|
|
// Note: revisit these as well
|
|
// if (chosen == nullptr)
|
|
// chosen = itr->second;
|
|
// else if (
|
|
// chosen->intro.latency != 0s and chosen->intro.latency > itr->second->intro.latency)
|
|
// chosen = itr->second;
|
|
chosen = itr->second;
|
|
}
|
|
}
|
|
++itr;
|
|
}
|
|
return chosen;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetRandomPathByRouter(RouterID id, PathRole roles) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
std::vector<Path_ptr> chosen;
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->SupportsAnyRoles(roles))
|
|
{
|
|
if (itr->second->Endpoint() == id)
|
|
{
|
|
chosen.emplace_back(itr->second);
|
|
}
|
|
}
|
|
++itr;
|
|
}
|
|
if (chosen.empty())
|
|
return nullptr;
|
|
size_t idx = 0;
|
|
if (chosen.size() >= 2)
|
|
{
|
|
idx = rand() % chosen.size();
|
|
}
|
|
return chosen[idx];
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetByEndpointWithID(RouterID ep, PathID_t id) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->is_endpoint(ep, id))
|
|
{
|
|
return itr->second;
|
|
}
|
|
++itr;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetPathByID(PathID_t id) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->RXID() == id)
|
|
return itr->second;
|
|
++itr;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
size_t
|
|
PathSet::AvailablePaths(PathRole roles) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
size_t count = 0;
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->Status() == ePathEstablished && itr->second->SupportsAnyRoles(roles))
|
|
++count;
|
|
++itr;
|
|
}
|
|
return count;
|
|
}
|
|
|
|
size_t
|
|
PathSet::NumInStatus(PathStatus st) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
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_ptr path)
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
const auto upstream = path->upstream(); // RouterID
|
|
const auto RXID = path->RXID(); // PathID
|
|
if (not m_Paths.emplace(std::make_pair(upstream, RXID), path).second)
|
|
{
|
|
LogError(
|
|
Name(),
|
|
" failed to add own path, duplicate info wtf? upstream=",
|
|
upstream,
|
|
" rxid=",
|
|
RXID);
|
|
}
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::GetByUpstream(RouterID remote, PathID_t rxid) const
|
|
{
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.find({remote, rxid});
|
|
if (itr == m_Paths.end())
|
|
return nullptr;
|
|
return itr->second;
|
|
}
|
|
|
|
std::optional<std::set<service::Introduction>>
|
|
PathSet::GetCurrentIntroductionsWithFilter(
|
|
std::function<bool(const service::Introduction&)> filter) const
|
|
{
|
|
std::set<service::Introduction> intros;
|
|
Lock_t l{m_PathsMutex};
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() and filter(itr->second->intro))
|
|
{
|
|
intros.insert(itr->second->intro);
|
|
}
|
|
++itr;
|
|
}
|
|
if (intros.empty())
|
|
return std::nullopt;
|
|
return intros;
|
|
}
|
|
|
|
void
|
|
PathSet::HandlePathBuildTimeout(Path_ptr p)
|
|
{
|
|
LogWarn(Name(), " path build ", p->ShortName(), " timed out");
|
|
m_BuildStats.timeouts++;
|
|
}
|
|
|
|
void
|
|
PathSet::HandlePathBuildFailedAt(Path_ptr p, RouterID hop)
|
|
{
|
|
LogWarn(Name(), " path build ", p->ShortName(), " failed at ", hop);
|
|
m_BuildStats.fails++;
|
|
}
|
|
|
|
void
|
|
PathSet::HandlePathDied(Path_ptr p)
|
|
{
|
|
LogWarn(Name(), " path ", p->ShortName(), " died");
|
|
}
|
|
|
|
void
|
|
PathSet::PathBuildStarted(Path_ptr p)
|
|
{
|
|
LogInfo(Name(), " path build ", p->ShortName(), " started");
|
|
m_BuildStats.attempts++;
|
|
}
|
|
|
|
util::StatusObject
|
|
BuildStats::ExtractStatus() const
|
|
{
|
|
return util::StatusObject{
|
|
{"success", success}, {"attempts", attempts}, {"timeouts", timeouts}, {"fails", fails}};
|
|
}
|
|
|
|
std::string
|
|
BuildStats::ToString() const
|
|
{
|
|
return fmt::format(
|
|
"{:.2f} percent success (success={} attempts={} timeouts={} fails={})",
|
|
SuccessRatio() * 100.0,
|
|
success,
|
|
attempts,
|
|
timeouts,
|
|
fails);
|
|
}
|
|
|
|
double
|
|
BuildStats::SuccessRatio() const
|
|
{
|
|
if (attempts)
|
|
return double(success) / double(attempts);
|
|
return 0.0;
|
|
}
|
|
|
|
bool
|
|
PathSet::GetNewestIntro(service::Introduction& intro) const
|
|
{
|
|
intro.Clear();
|
|
bool found = false;
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->intro.expiry > intro.expiry)
|
|
{
|
|
intro = itr->second->intro;
|
|
found = true;
|
|
}
|
|
++itr;
|
|
}
|
|
return found;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::PickRandomEstablishedPath(PathRole roles) const
|
|
{
|
|
std::vector<Path_ptr> established;
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->SupportsAnyRoles(roles))
|
|
established.push_back(itr->second);
|
|
++itr;
|
|
}
|
|
auto sz = established.size();
|
|
if (sz)
|
|
{
|
|
return established[randint() % sz];
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
Path_ptr
|
|
PathSet::PickEstablishedPath(PathRole roles) const
|
|
{
|
|
std::vector<Path_ptr> established;
|
|
Lock_t l(m_PathsMutex);
|
|
auto itr = m_Paths.begin();
|
|
while (itr != m_Paths.end())
|
|
{
|
|
if (itr->second->IsReady() && itr->second->SupportsAnyRoles(roles))
|
|
established.push_back(itr->second);
|
|
++itr;
|
|
}
|
|
Path_ptr chosen = nullptr;
|
|
llarp_time_t minLatency = 30s;
|
|
for (const auto& path : established)
|
|
{
|
|
if (path->intro.latency < minLatency and path->intro.latency != 0s)
|
|
{
|
|
minLatency = path->intro.latency;
|
|
chosen = path;
|
|
}
|
|
}
|
|
return chosen;
|
|
}
|
|
|
|
void
|
|
PathSet::UpstreamFlush(Router* r)
|
|
{
|
|
ForEachPath([r](const Path_ptr& p) { p->FlushUpstream(r); });
|
|
}
|
|
|
|
void
|
|
PathSet::DownstreamFlush(Router* r)
|
|
{
|
|
ForEachPath([r](const Path_ptr& p) { p->FlushDownstream(r); });
|
|
}
|
|
|
|
} // namespace llarp::path
|