mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-11-17 15:25:35 +00:00
81 lines
2.1 KiB
C++
81 lines
2.1 KiB
C++
#include <dht/recursiverouterlookup.hpp>
|
|
|
|
#include <dht/context.hpp>
|
|
#include <dht/messages/findrouter.hpp>
|
|
#include <dht/messages/gotrouter.hpp>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace dht
|
|
{
|
|
RecursiveRouterLookup::RecursiveRouterLookup(const TXOwner &whoasked,
|
|
const RouterID &target,
|
|
AbstractContext *ctx,
|
|
RouterLookupHandler result)
|
|
: TX< RouterID, RouterContact >(whoasked, target, ctx)
|
|
, resultHandler(result)
|
|
|
|
{
|
|
peersAsked.insert(ctx->OurKey());
|
|
}
|
|
|
|
bool
|
|
RecursiveRouterLookup::Validate(const RouterContact &rc) const
|
|
{
|
|
if(!rc.Verify(parent->Now()))
|
|
{
|
|
llarp::LogWarn("rc from lookup result is invalid");
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
RecursiveRouterLookup::GetNextPeer(Key_t &nextPeer,
|
|
const std::set< Key_t > &exclude)
|
|
{
|
|
const Key_t K(target.as_array());
|
|
return parent->Nodes()->FindCloseExcluding(K, nextPeer, exclude);
|
|
}
|
|
|
|
void
|
|
RecursiveRouterLookup::DoNextRequest(const Key_t &peer)
|
|
{
|
|
parent->LookupRouterRecursive(target, whoasked.node, whoasked.txid, peer,
|
|
resultHandler);
|
|
}
|
|
|
|
void
|
|
RecursiveRouterLookup::Start(const TXOwner &peer)
|
|
{
|
|
parent->DHTSendTo(peer.node.as_array(),
|
|
new FindRouterMessage(peer.txid, target));
|
|
}
|
|
|
|
void
|
|
RecursiveRouterLookup::SendReply()
|
|
{
|
|
if(valuesFound.size())
|
|
{
|
|
RouterContact found;
|
|
for(const auto &rc : valuesFound)
|
|
{
|
|
if(found.OtherIsNewer(rc))
|
|
found = rc;
|
|
}
|
|
valuesFound.clear();
|
|
valuesFound.emplace_back(found);
|
|
}
|
|
if(resultHandler)
|
|
{
|
|
resultHandler(valuesFound);
|
|
}
|
|
|
|
if(whoasked.node != parent->OurKey())
|
|
parent->DHTSendTo(
|
|
whoasked.node.as_array(),
|
|
new GotRouterMessage({}, whoasked.txid, valuesFound, false), false);
|
|
}
|
|
} // namespace dht
|
|
} // namespace llarp
|