lokinet/llarp/path/path.cpp

916 lines
24 KiB
C++
Raw Normal View History

2019-01-11 01:19:36 +00:00
#include <path/path.hpp>
#include <messages/dht.hpp>
#include <messages/discard.hpp>
#include <messages/exit.hpp>
#include <messages/path_latency.hpp>
#include <messages/relay_commit.hpp>
#include <messages/transfer_traffic.hpp>
2019-01-11 01:19:36 +00:00
#include <path/pathbuilder.hpp>
#include <profiling.hpp>
#include <router/abstractrouter.hpp>
#include <util/buffer.hpp>
#include <util/endian.hpp>
2018-06-12 16:45:12 +00:00
#include <deque>
2018-06-10 14:05:48 +00:00
namespace llarp
{
namespace path
2018-06-10 14:05:48 +00:00
{
2019-02-24 23:46:37 +00:00
std::ostream&
TransitHopInfo::print(std::ostream& stream, int level, int spaces) const
{
Printer printer(stream, level, spaces);
printer.printAttribute("tx", txID);
printer.printAttribute("rx", rxID);
printer.printAttribute("upstream", upstream);
printer.printAttribute("downstream", downstream);
return stream;
}
PathContext::PathContext(AbstractRouter* router)
: m_Router(router), m_AllowTransit(false)
{
}
2018-06-10 14:05:48 +00:00
PathContext::~PathContext()
{
}
2018-06-10 14:05:48 +00:00
void
PathContext::AllowTransit()
{
m_AllowTransit = true;
}
2018-06-10 14:05:48 +00:00
bool
PathContext::AllowingTransit() const
{
return m_AllowTransit;
}
2018-06-10 14:05:48 +00:00
llarp_threadpool*
PathContext::Worker()
{
return m_Router->threadpool();
}
2018-06-12 16:45:12 +00:00
Crypto*
PathContext::crypto()
{
return m_Router->crypto();
}
2018-06-12 16:45:12 +00:00
Logic*
PathContext::logic()
{
return m_Router->logic();
}
const SecretKey&
PathContext::EncryptionSecretKey()
{
return m_Router->encryption();
}
2018-06-12 16:45:12 +00:00
bool
PathContext::HopIsUs(const RouterID& k) const
{
return std::equal(m_Router->pubkey(), m_Router->pubkey() + PUBKEYSIZE,
k.begin());
}
2018-06-12 16:45:12 +00:00
bool
PathContext::ForwardLRCM(const RouterID& nextHop,
2018-08-30 18:48:43 +00:00
const std::array< EncryptedFrame, 8 >& frames)
{
LogDebug("forwarding LRCM to ", nextHop);
2019-04-30 12:22:15 +00:00
const LR_CommitMessage msg(frames);
return m_Router->SendToOrQueue(nextHop, &msg);
}
template < typename Map_t, typename Key_t, typename CheckValue_t,
typename GetFunc_t >
HopHandler_ptr
MapGet(Map_t& map, const Key_t& k, CheckValue_t check, GetFunc_t get)
2018-06-22 00:25:30 +00:00
{
util::Lock lock(&map.first);
auto range = map.second.equal_range(k);
for(auto i = range.first; i != range.second; ++i)
{
if(check(i->second))
return get(i->second);
}
return nullptr;
2018-06-22 00:25:30 +00:00
}
2018-06-12 16:45:12 +00:00
template < typename Map_t, typename Key_t, typename CheckValue_t >
bool
MapHas(Map_t& map, const Key_t& k, CheckValue_t check)
2018-06-18 22:03:50 +00:00
{
util::Lock lock(&map.first);
auto range = map.second.equal_range(k);
for(auto i = range.first; i != range.second; ++i)
{
if(check(i->second))
return true;
}
return false;
2018-06-18 22:03:50 +00:00
}
2018-06-12 16:45:12 +00:00
template < typename Map_t, typename Key_t, typename Value_t >
void
MapPut(Map_t& map, const Key_t& k, const Value_t& v)
{
util::Lock lock(&map.first);
map.second.emplace(k, v);
}
2018-06-12 16:45:12 +00:00
template < typename Map_t, typename Visit_t >
void
MapIter(Map_t& map, Visit_t v)
2018-06-22 00:25:30 +00:00
{
2018-08-12 17:22:29 +00:00
util::Lock lock(map.first);
for(const auto& item : map.second)
v(item);
2018-06-22 00:25:30 +00:00
}
template < typename Map_t, typename Key_t, typename Check_t >
void
MapDel(Map_t& map, const Key_t& k, Check_t check)
{
2018-08-12 17:22:29 +00:00
util::Lock lock(map.first);
auto range = map.second.equal_range(k);
for(auto i = range.first; i != range.second;)
{
if(check(i->second))
i = map.second.erase(i);
else
++i;
}
}
2018-06-19 17:11:24 +00:00
void
PathContext::AddOwnPath(PathSet_ptr set, Path_ptr path)
{
set->AddPath(path);
MapPut(m_OurPaths, path->TXID(), set);
MapPut(m_OurPaths, path->RXID(), set);
}
2018-06-22 00:25:30 +00:00
bool
PathContext::HasTransitHop(const TransitHopInfo& info)
{
2018-10-21 13:07:33 +00:00
return MapHas(m_TransitPaths, info.txID,
[info](const std::shared_ptr< TransitHop >& hop) -> bool {
return info == hop->info;
});
}
HopHandler_ptr
PathContext::GetByUpstream(const RouterID& remote, const PathID_t& id)
{
auto own = MapGet(
m_OurPaths, id,
[](const PathSet_ptr) -> bool {
// TODO: is this right?
return true;
},
[remote, id](PathSet_ptr p) -> HopHandler_ptr {
return p->GetByUpstream(remote, id);
});
if(own)
return own;
return MapGet(
m_TransitPaths, id,
[remote](const std::shared_ptr< TransitHop >& hop) -> bool {
return hop->info.upstream == remote;
},
[](const std::shared_ptr< TransitHop >& h) -> HopHandler_ptr {
return h;
});
}
2018-06-12 16:45:12 +00:00
bool
PathContext::TransitHopPreviousIsRouter(const PathID_t& path,
const RouterID& otherRouter)
{
util::Lock lock(&m_TransitPaths.first);
auto itr = m_TransitPaths.second.find(path);
if(itr == m_TransitPaths.second.end())
return false;
return itr->second->info.downstream == otherRouter;
}
HopHandler_ptr
PathContext::GetByDownstream(const RouterID& remote, const PathID_t& id)
{
return MapGet(
m_TransitPaths, id,
[remote](const std::shared_ptr< TransitHop >& hop) -> bool {
return hop->info.downstream == remote;
},
[](const std::shared_ptr< TransitHop >& h) -> HopHandler_ptr {
return h;
});
}
2018-06-22 00:25:30 +00:00
PathSet_ptr
2018-07-09 17:32:11 +00:00
PathContext::GetLocalPathSet(const PathID_t& id)
{
auto& map = m_OurPaths;
util::Lock lock(&map.first);
2018-07-09 17:32:11 +00:00
auto itr = map.second.find(id);
if(itr != map.second.end())
{
return itr->second;
}
return nullptr;
}
const byte_t*
PathContext::OurRouterID() const
{
return m_Router->pubkey();
}
2018-06-18 22:03:50 +00:00
AbstractRouter*
PathContext::Router()
{
return m_Router;
}
HopHandler_ptr
2018-10-09 17:09:45 +00:00
PathContext::GetPathForTransfer(const PathID_t& id)
2018-10-06 16:37:54 +00:00
{
RouterID us(OurRouterID());
auto& map = m_TransitPaths;
{
util::Lock lock(&map.first);
2018-10-06 16:37:54 +00:00
auto range = map.second.equal_range(id);
for(auto i = range.first; i != range.second; ++i)
{
if(i->second->info.upstream == us)
return i->second;
2018-10-06 16:37:54 +00:00
}
}
return nullptr;
}
2018-10-09 17:09:45 +00:00
void
2018-10-21 13:07:33 +00:00
PathContext::PutTransitHop(std::shared_ptr< TransitHop > hop)
{
MapPut(m_TransitPaths, hop->info.txID, hop);
MapPut(m_TransitPaths, hop->info.rxID, hop);
}
void
2018-10-29 16:48:36 +00:00
PathContext::ExpirePaths(llarp_time_t now)
{
{
2019-04-23 16:13:22 +00:00
util::Lock lock(&m_TransitPaths.first);
auto& map = m_TransitPaths.second;
auto itr = map.begin();
while(itr != map.end())
{
2019-04-23 16:13:22 +00:00
if(itr->second->Expired(now))
{
itr = map.erase(itr);
}
else
++itr;
}
2018-06-22 00:25:30 +00:00
}
{
2019-04-23 16:13:22 +00:00
util::Lock lock(&m_OurPaths.first);
auto& map = m_OurPaths.second;
for(auto& item : map)
{
2019-04-23 16:13:22 +00:00
item.second->ExpirePaths(now);
}
}
2018-06-18 22:03:50 +00:00
}
routing::MessageHandler_ptr
2018-08-10 21:34:11 +00:00
PathContext::GetHandler(const PathID_t& id)
{
routing::MessageHandler_ptr h = nullptr;
2019-04-23 16:13:22 +00:00
auto pathset = GetLocalPathSet(id);
2018-08-10 21:34:11 +00:00
if(pathset)
{
h = pathset->GetPathByID(id);
}
if(h)
return h;
2019-04-22 17:55:07 +00:00
const RouterID us(OurRouterID());
2018-08-10 21:34:11 +00:00
auto& map = m_TransitPaths;
{
util::Lock lock(&map.first);
2018-08-12 17:22:29 +00:00
auto range = map.second.equal_range(id);
for(auto i = range.first; i != range.second; ++i)
{
if(i->second->info.upstream == us)
return i->second;
2018-08-12 17:22:29 +00:00
}
2018-08-10 21:34:11 +00:00
}
return nullptr;
}
2018-08-18 14:01:21 +00:00
void
PathContext::RemovePathSet(PathSet_ptr set)
2018-08-18 14:01:21 +00:00
{
util::Lock lock(&m_OurPaths.first);
2018-08-18 14:01:21 +00:00
auto& map = m_OurPaths.second;
auto itr = map.begin();
while(itr != map.end())
{
if(itr->second.get() == set.get())
2018-08-18 14:01:21 +00:00
itr = map.erase(itr);
else
++itr;
}
}
2019-02-24 23:46:37 +00:00
std::ostream&
TransitHop::print(std::ostream& stream, int level, int spaces) const
{
Printer printer(stream, level, spaces);
printer.printAttribute("TransitHop", info);
printer.printAttribute("started", started);
printer.printAttribute("lifetime", lifetime);
return stream;
}
PathHopConfig::PathHopConfig()
{
2018-06-22 00:25:30 +00:00
}
PathHopConfig::~PathHopConfig()
{
}
2018-06-22 00:25:30 +00:00
2018-11-14 18:02:27 +00:00
Path::Path(const std::vector< RouterContact >& h, PathSet* parent,
PathRole startingRoles)
: m_PathSet(parent), _role(startingRoles)
{
2018-09-06 11:46:19 +00:00
hops.resize(h.size());
2018-08-30 18:48:43 +00:00
size_t hsz = h.size();
for(size_t idx = 0; idx < hsz; ++idx)
{
2018-08-30 18:48:43 +00:00
hops[idx].rc = h[idx];
hops[idx].txID.Randomize();
hops[idx].rxID.Randomize();
}
2018-08-30 18:48:43 +00:00
for(size_t idx = 0; idx < hsz - 1; ++idx)
{
hops[idx].txID = hops[idx + 1].rxID;
}
// initialize parts of the introduction
2018-08-30 18:48:43 +00:00
intro.router = hops[hsz - 1].rc.pubkey;
2018-10-06 16:37:54 +00:00
intro.pathID = hops[hsz - 1].txID;
2018-10-29 16:48:36 +00:00
EnterState(ePathBuilding, parent->Now());
}
2018-06-22 00:25:30 +00:00
void
Path::SetBuildResultHook(BuildResultHookFunc func)
{
m_BuiltHook = func;
}
2018-06-22 00:25:30 +00:00
RouterID
Path::Endpoint() const
{
2018-08-30 18:48:43 +00:00
return hops[hops.size() - 1].rc.pubkey;
}
PubKey
Path::EndpointPubKey() const
{
return hops[hops.size() - 1].rc.pubkey;
}
2018-12-18 19:03:50 +00:00
PathID_t
Path::TXID() const
2018-06-22 00:25:30 +00:00
{
return hops[0].txID;
2018-06-22 00:25:30 +00:00
}
2018-06-10 14:05:48 +00:00
2018-12-18 19:03:50 +00:00
PathID_t
Path::RXID() const
{
return hops[0].rxID;
}
2018-06-19 17:11:24 +00:00
bool
Path::IsReady() const
{
return intro.latency > 0 && _status == ePathEstablished;
}
2019-03-08 17:26:29 +00:00
bool
Path::IsEndpoint(const RouterID& r, const PathID_t& id) const
{
return hops[hops.size() - 1].rc.pubkey == r
&& hops[hops.size() - 1].txID == id;
}
RouterID
Path::Upstream() const
{
2018-08-30 18:48:43 +00:00
return hops[0].rc.pubkey;
}
std::string
Path::HopsString() const
{
std::stringstream ss;
for(const auto& hop : hops)
ss << RouterID(hop.rc.pubkey) << " -> ";
return ss.str();
}
void
2018-10-29 16:48:36 +00:00
Path::EnterState(PathStatus st, llarp_time_t now)
{
2019-04-13 14:32:07 +00:00
if(st == ePathExpired && _status == ePathBuilding)
{
2019-04-13 14:32:07 +00:00
_status = st;
m_PathSet->HandlePathBuildTimeout(shared_from_this());
}
else if(st == ePathBuilding)
{
LogInfo("path ", Name(), " is building");
2018-10-29 16:48:36 +00:00
buildStarted = now;
}
else if(st == ePathEstablished && _status == ePathBuilding)
{
LogInfo("path ", Name(), " is built, took ", now - buildStarted, " ms");
}
2019-03-30 13:02:10 +00:00
else if(st == ePathTimeout && _status == ePathEstablished)
{
2019-03-30 13:12:48 +00:00
LogInfo("path ", Name(), " died");
_status = st;
m_PathSet->HandlePathDied(shared_from_this());
2019-03-30 13:02:10 +00:00
}
2019-04-13 14:32:07 +00:00
else if(st == ePathEstablished && _status == ePathTimeout)
{
LogInfo("path ", Name(), " reanimated");
}
_status = st;
}
2019-02-11 17:14:43 +00:00
util::StatusObject
PathHopConfig::ExtractStatus() const
2019-02-08 19:43:25 +00:00
{
2019-02-11 17:14:43 +00:00
util::StatusObject obj{{"lifetime", lifetime},
{"router", rc.pubkey.ToHex()},
{"txid", txID.ToHex()},
{"rxid", rxID.ToHex()}};
return obj;
}
2019-02-08 19:43:25 +00:00
2019-02-11 17:14:43 +00:00
util::StatusObject
Path::ExtractStatus() const
{
auto now = llarp::time_now_ms();
util::StatusObject obj{{"intro", intro.ExtractStatus()},
{"lastRecvMsg", m_LastRecvMessage},
{"lastLatencyTest", m_LastLatencyTestTime},
{"buildStarted", buildStarted},
{"expired", Expired(now)},
{"expiresSoon", ExpiresSoon(now)},
{"expiresAt", ExpireTime()},
{"ready", IsReady()},
{"hasExit", SupportsAnyRoles(ePathRoleExit)}};
std::vector< util::StatusObject > hopsObj;
std::transform(hops.begin(), hops.end(), std::back_inserter(hopsObj),
[](const auto& hop) -> util::StatusObject {
return hop.ExtractStatus();
});
obj.Put("hops", hopsObj);
2019-02-08 19:43:25 +00:00
switch(_status)
{
case ePathBuilding:
2019-02-11 17:14:43 +00:00
obj.Put("status", "building");
2019-02-08 19:43:25 +00:00
break;
case ePathEstablished:
2019-02-11 17:14:43 +00:00
obj.Put("status", "established");
2019-02-08 19:43:25 +00:00
break;
case ePathTimeout:
2019-02-11 17:14:43 +00:00
obj.Put("status", "timeout");
2019-02-08 19:43:25 +00:00
break;
case ePathExpired:
2019-02-11 17:14:43 +00:00
obj.Put("status", "expired");
2019-02-08 19:43:25 +00:00
break;
default:
2019-02-11 17:14:43 +00:00
obj.Put("status", "unknown");
2019-02-08 19:43:25 +00:00
break;
}
2019-02-11 17:14:43 +00:00
return obj;
2019-02-08 19:43:25 +00:00
}
void
Path::Tick(llarp_time_t now, AbstractRouter* r)
{
if(Expired(now))
return;
if(_status == ePathBuilding)
{
if(now >= buildStarted)
{
auto dlt = now - buildStarted;
2019-04-05 14:58:22 +00:00
if(dlt >= path::build_timeout)
{
r->routerProfiling().MarkPathFail(this);
2019-04-13 14:32:07 +00:00
EnterState(ePathExpired, now);
return;
}
}
}
// check to see if this path is dead
2018-09-24 14:44:23 +00:00
if(_status == ePathEstablished)
{
2019-04-25 23:21:19 +00:00
const auto dlt = now - m_LastLatencyTestTime;
2019-04-05 14:58:22 +00:00
if(dlt > path::latency_interval && m_LastLatencyTestID == 0)
2019-02-06 13:51:05 +00:00
{
routing::PathLatencyMessage latency;
latency.T = randint();
2019-02-06 13:51:05 +00:00
m_LastLatencyTestID = latency.T;
m_LastLatencyTestTime = now;
SendRoutingMessage(latency, r);
2019-03-25 15:41:37 +00:00
return;
2019-02-06 13:51:05 +00:00
}
if(m_LastRecvMessage && now > m_LastRecvMessage)
{
2019-04-25 23:21:19 +00:00
const auto delay = now - m_LastRecvMessage;
if(m_CheckForDead && m_CheckForDead(shared_from_this(), delay))
2018-10-04 16:48:26 +00:00
{
r->routerProfiling().MarkPathFail(this);
2018-10-29 16:48:36 +00:00
EnterState(ePathTimeout, now);
2018-10-04 16:48:26 +00:00
}
}
2019-04-05 14:58:22 +00:00
else if(dlt >= path::alive_timeout && m_LastRecvMessage == 0)
{
if(m_CheckForDead && m_CheckForDead(shared_from_this(), dlt))
2019-04-10 12:56:14 +00:00
{
r->routerProfiling().MarkPathFail(this);
EnterState(ePathTimeout, now);
}
}
}
}
bool
Path::HandleUpstream(const llarp_buffer_t& buf, const TunnelNonce& Y,
AbstractRouter* r)
2018-06-20 12:34:48 +00:00
{
TunnelNonce n = Y;
for(const auto& hop : hops)
{
r->crypto()->xchacha20(buf, hop.shared, n);
n ^= hop.nonceXOR;
}
RelayUpstreamMessage msg;
msg.X = buf;
msg.Y = Y;
msg.pathid = TXID();
if(r->SendToOrQueue(Upstream(), &msg))
2018-08-10 21:34:11 +00:00
return true;
LogError("send to ", Upstream(), " failed");
2018-08-10 21:34:11 +00:00
return false;
2018-06-20 12:34:48 +00:00
}
bool
Path::Expired(llarp_time_t now) const
{
2019-04-13 14:32:07 +00:00
if(_status == ePathEstablished || _status == ePathTimeout)
2018-12-20 15:03:48 +00:00
return now >= ExpireTime();
else if(_status == ePathBuilding)
return false;
else
return true;
}
2018-06-23 00:00:44 +00:00
std::string
Path::Name() const
{
std::stringstream ss;
ss << "TX=" << TXID() << " RX=" << RXID();
2019-03-22 14:10:30 +00:00
if(m_PathSet)
ss << " on " << m_PathSet->Name();
return ss.str();
}
bool
Path::HandleDownstream(const llarp_buffer_t& buf, const TunnelNonce& Y,
AbstractRouter* r)
{
TunnelNonce n = Y;
for(const auto& hop : hops)
{
n ^= hop.nonceXOR;
r->crypto()->xchacha20(buf, hop.shared, n);
}
2019-03-25 15:41:37 +00:00
if(!HandleRoutingMessage(buf, r))
return false;
m_LastRecvMessage = r->Now();
return true;
}
bool
Path::HandleRoutingMessage(const llarp_buffer_t& buf, AbstractRouter* r)
{
if(!r->ParseRoutingMessageBuffer(buf, this, RXID()))
{
LogWarn("Failed to parse inbound routing message");
return false;
}
return true;
}
2018-11-14 12:23:08 +00:00
bool
Path::HandleUpdateExitVerifyMessage(
const routing::UpdateExitVerifyMessage& msg, AbstractRouter* r)
2018-11-14 12:23:08 +00:00
{
(void)r;
if(m_UpdateExitTX && msg.T == m_UpdateExitTX)
2018-11-14 12:23:08 +00:00
{
if(m_ExitUpdated)
return m_ExitUpdated(shared_from_this());
2018-11-14 12:23:08 +00:00
}
if(m_CloseExitTX && msg.T == m_CloseExitTX)
2018-11-14 12:23:08 +00:00
{
if(m_ExitClosed)
return m_ExitClosed(shared_from_this());
2018-11-14 12:23:08 +00:00
}
return false;
}
bool
Path::SendRoutingMessage(const routing::IMessage& msg, AbstractRouter* r)
{
2019-02-02 23:12:42 +00:00
std::array< byte_t, MAX_LINK_MSG_SIZE / 2 > tmp;
llarp_buffer_t buf(tmp);
// should help prevent bad paths with uninitialized members
// FIXME: Why would we get uninitialized IMessages?
if(msg.version != LLARP_PROTO_VERSION)
return false;
if(!msg.BEncode(&buf))
2018-08-10 21:34:11 +00:00
{
LogError("Bencode failed");
DumpBuffer(buf);
return false;
2018-08-10 21:34:11 +00:00
}
// make nonce
TunnelNonce N;
N.Randomize();
buf.sz = buf.cur - buf.base;
// pad smaller messages
2019-04-05 14:58:22 +00:00
if(buf.sz < pad_size)
{
// randomize padding
2019-04-05 14:58:22 +00:00
r->crypto()->randbytes(buf.cur, pad_size - buf.sz);
buf.sz = pad_size;
}
buf.cur = buf.base;
return HandleUpstream(buf, N, r);
}
2018-06-26 16:23:43 +00:00
bool
Path::HandlePathTransferMessage(
ABSL_ATTRIBUTE_UNUSED const routing::PathTransferMessage& msg,
ABSL_ATTRIBUTE_UNUSED AbstractRouter* r)
2018-06-26 16:23:43 +00:00
{
LogWarn("unwarranted path transfer message on tx=", TXID(),
" rx=", RXID());
2018-06-26 16:23:43 +00:00
return false;
}
bool
Path::HandleDataDiscardMessage(const routing::DataDiscardMessage& msg,
AbstractRouter* r)
{
2018-11-16 14:21:23 +00:00
MarkActive(r->Now());
if(m_DropHandler)
return m_DropHandler(shared_from_this(), msg.P, msg.S);
return true;
}
bool
Path::HandlePathConfirmMessage(
ABSL_ATTRIBUTE_UNUSED const routing::PathConfirmMessage& msg,
AbstractRouter* r)
{
2018-10-29 16:48:36 +00:00
auto now = r->Now();
if(_status == ePathBuilding)
{
// finish initializing introduction
intro.expiresAt = buildStarted + hops[0].lifetime;
r->routerProfiling().MarkPathSuccess(this);
2018-08-23 14:35:29 +00:00
// persist session with upstream router until the path is done
r->PersistSessionUntil(Upstream(), intro.expiresAt);
2018-11-16 14:21:23 +00:00
MarkActive(now);
2018-08-23 14:35:29 +00:00
// send path latency test
routing::PathLatencyMessage latency;
latency.T = randint();
2018-06-26 16:23:43 +00:00
m_LastLatencyTestID = latency.T;
2018-10-29 16:48:36 +00:00
m_LastLatencyTestTime = now;
return SendRoutingMessage(latency, r);
}
LogWarn("got unwarranted path confirm message on tx=", RXID(),
" rx=", RXID());
2018-06-22 00:25:30 +00:00
return false;
}
bool
Path::HandleHiddenServiceFrame(const service::ProtocolFrame& frame)
{
2018-11-16 14:21:23 +00:00
MarkActive(m_PathSet->Now());
return m_DataHandler && m_DataHandler(shared_from_this(), frame);
}
bool
Path::HandlePathLatencyMessage(const routing::PathLatencyMessage& msg,
AbstractRouter* r)
{
2018-10-29 16:48:36 +00:00
auto now = r->Now();
2018-11-16 14:21:23 +00:00
MarkActive(now);
if(msg.L == m_LastLatencyTestID)
2018-06-26 16:23:43 +00:00
{
intro.latency = now - m_LastLatencyTestTime;
m_LastLatencyTestID = 0;
EnterState(ePathEstablished, now);
if(m_BuiltHook)
m_BuiltHook(shared_from_this());
m_BuiltHook = nullptr;
2019-03-07 22:53:36 +00:00
LogDebug("path latency is now ", intro.latency, " for ", Name());
return true;
}
else
{
LogWarn("unwarranted path latency message via ", Upstream());
return false;
2018-06-26 16:23:43 +00:00
}
}
2018-06-19 17:11:24 +00:00
bool
Path::HandleDHTMessage(const dht::IMessage& msg, AbstractRouter* r)
{
2019-03-25 15:41:37 +00:00
MarkActive(r->Now());
routing::DHTMessage reply;
if(!msg.HandleMessage(r->dht(), reply.M))
return false;
if(reply.M.size())
return SendRoutingMessage(reply, r);
return true;
}
2018-07-09 17:32:11 +00:00
bool
Path::HandleCloseExitMessage(const routing::CloseExitMessage& msg,
AbstractRouter* r)
{
2018-11-14 18:02:27 +00:00
/// allows exits to close from their end
2018-11-21 12:31:36 +00:00
if(SupportsAnyRoles(ePathRoleExit | ePathRoleSVC))
2018-11-14 18:02:27 +00:00
{
if(msg.Verify(r->crypto(), EndpointPubKey()))
2018-11-14 18:02:27 +00:00
{
LogInfo(Name(), " had its exit closed");
2018-11-14 18:02:27 +00:00
_role &= ~ePathRoleExit;
return true;
}
else
LogError(Name(), " CXM from exit with bad signature");
2018-11-14 18:02:27 +00:00
}
else
LogError(Name(), " unwarranted CXM");
return false;
}
2018-11-14 19:34:17 +00:00
bool
Path::SendExitRequest(const routing::ObtainExitMessage& msg,
AbstractRouter* r)
2018-11-14 19:34:17 +00:00
{
LogInfo(Name(), " sending exit request to ", Endpoint());
m_ExitObtainTX = msg.T;
2018-11-14 19:34:17 +00:00
return SendRoutingMessage(msg, r);
}
bool
Path::SendExitClose(const routing::CloseExitMessage& msg, AbstractRouter* r)
{
LogInfo(Name(), " closing exit to ", Endpoint());
// mark as not exit anymore
_role &= ~ePathRoleExit;
return SendRoutingMessage(msg, r);
}
bool
Path::HandleObtainExitMessage(const routing::ObtainExitMessage& msg,
AbstractRouter* r)
{
(void)msg;
(void)r;
LogError(Name(), " got unwarranted OXM");
return false;
}
bool
Path::HandleUpdateExitMessage(const routing::UpdateExitMessage& msg,
AbstractRouter* r)
{
(void)msg;
(void)r;
LogError(Name(), " got unwarranted UXM");
return false;
}
bool
Path::HandleRejectExitMessage(const routing::RejectExitMessage& msg,
AbstractRouter* r)
{
if(m_ExitObtainTX && msg.T == m_ExitObtainTX)
2018-11-14 18:02:27 +00:00
{
if(!msg.Verify(r->crypto(), EndpointPubKey()))
2018-11-14 18:02:27 +00:00
{
LogError(Name(), "RXM invalid signature");
2018-11-14 18:02:27 +00:00
return false;
}
LogInfo(Name(), " ", Endpoint(), " Rejected exit");
2018-11-16 14:21:23 +00:00
MarkActive(r->Now());
return InformExitResult(msg.B);
2018-11-14 18:02:27 +00:00
}
LogError(Name(), " got unwarranted RXM");
return false;
}
bool
Path::HandleGrantExitMessage(const routing::GrantExitMessage& msg,
AbstractRouter* r)
{
if(m_ExitObtainTX && msg.T == m_ExitObtainTX)
2018-11-14 18:02:27 +00:00
{
if(!msg.Verify(r->crypto(), EndpointPubKey()))
2018-11-14 18:02:27 +00:00
{
LogError(Name(), " GXM signature failed");
2018-11-14 18:02:27 +00:00
return false;
}
// we now can send exit traffic
_role |= ePathRoleExit;
LogInfo(Name(), " ", Endpoint(), " Granted exit");
2018-11-16 14:21:23 +00:00
MarkActive(r->Now());
2018-11-14 18:02:27 +00:00
return InformExitResult(0);
}
LogError(Name(), " got unwarranted GXM");
return false;
}
2018-11-14 18:02:27 +00:00
bool
Path::InformExitResult(llarp_time_t B)
{
2019-04-23 16:13:22 +00:00
auto self = shared_from_this();
2018-11-14 18:02:27 +00:00
bool result = true;
for(const auto& hook : m_ObtainedExitHooks)
result &= hook(self, B);
2018-11-14 18:02:27 +00:00
m_ObtainedExitHooks.clear();
return result;
}
bool
Path::HandleTransferTrafficMessage(
const routing::TransferTrafficMessage& msg, AbstractRouter* r)
{
2018-11-14 18:02:27 +00:00
// check if we can handle exit data
2018-11-21 12:31:36 +00:00
if(!SupportsAnyRoles(ePathRoleExit | ePathRoleSVC))
2018-11-14 18:02:27 +00:00
return false;
// handle traffic if we have a handler
2018-11-28 17:58:46 +00:00
if(!m_ExitTrafficHandler)
return false;
bool sent = msg.X.size() > 0;
auto self = shared_from_this();
for(const auto& pkt : msg.X)
2018-11-29 21:19:20 +00:00
{
if(pkt.size() <= 8)
return false;
uint64_t counter = bufbe64toh(pkt.data());
2019-04-22 17:55:07 +00:00
if(m_ExitTrafficHandler(
self, llarp_buffer_t(pkt.data() + 8, pkt.size() - 8), counter))
2019-04-22 17:55:07 +00:00
{
MarkActive(r->Now());
EnterState(ePathEstablished, r->Now());
}
2018-11-29 21:19:20 +00:00
}
2018-11-28 17:58:46 +00:00
return sent;
}
} // namespace path
2018-06-21 09:31:53 +00:00
} // namespace llarp