mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-10-29 11:05:43 +00:00
125 lines
3.2 KiB
C++
125 lines
3.2 KiB
C++
#include <dht/context.hpp>
|
|
#include <dht/messages/gotintro.hpp>
|
|
#include <messages/dht.hpp>
|
|
#include <router.hpp>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace dht
|
|
{
|
|
GotIntroMessage::GotIntroMessage(
|
|
const std::vector< llarp::service::IntroSet > &results, uint64_t tx)
|
|
: IMessage({}), I(results), T(tx)
|
|
{
|
|
}
|
|
|
|
GotIntroMessage::~GotIntroMessage()
|
|
{
|
|
}
|
|
|
|
bool
|
|
GotIntroMessage::HandleMessage(
|
|
llarp_dht_context *ctx,
|
|
__attribute__((unused))
|
|
std::vector< std::unique_ptr< IMessage > > &replies) const
|
|
{
|
|
auto &dht = ctx->impl;
|
|
auto crypto = &dht.router->crypto;
|
|
|
|
for(const auto &introset : I)
|
|
{
|
|
if(!introset.Verify(crypto, dht.Now()))
|
|
{
|
|
llarp::LogWarn(
|
|
"Invalid introset while handling direct GotIntro "
|
|
"from ",
|
|
From);
|
|
return false;
|
|
}
|
|
}
|
|
TXOwner owner(From, T);
|
|
auto tagLookup = dht.pendingTagLookups.GetPendingLookupFrom(owner);
|
|
if(tagLookup)
|
|
{
|
|
dht.pendingTagLookups.Found(owner, tagLookup->target, I);
|
|
return true;
|
|
}
|
|
auto serviceLookup =
|
|
dht.pendingIntrosetLookups.GetPendingLookupFrom(owner);
|
|
if(serviceLookup)
|
|
{
|
|
if(I.size())
|
|
{
|
|
dht.pendingIntrosetLookups.Found(owner, serviceLookup->target, I);
|
|
}
|
|
else
|
|
{
|
|
dht.pendingIntrosetLookups.NotFound(owner, K);
|
|
}
|
|
return true;
|
|
}
|
|
llarp::LogError("no pending TX for GIM from ", From, " txid=", T);
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
RelayedGotIntroMessage::HandleMessage(
|
|
llarp_dht_context *ctx,
|
|
__attribute__((unused))
|
|
std::vector< std::unique_ptr< IMessage > > &replies) const
|
|
{
|
|
// TODO: implement me better?
|
|
auto pathset = ctx->impl.router->paths.GetLocalPathSet(pathID);
|
|
if(pathset)
|
|
{
|
|
return pathset->HandleGotIntroMessage(this);
|
|
}
|
|
llarp::LogWarn("No path for got intro message pathid=", pathID);
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
GotIntroMessage::DecodeKey(llarp_buffer_t key, llarp_buffer_t *buf)
|
|
{
|
|
if(llarp_buffer_eq(key, "I"))
|
|
{
|
|
return BEncodeReadList(I, buf);
|
|
}
|
|
if(llarp_buffer_eq(key, "K"))
|
|
{
|
|
if(K) // duplicate key?
|
|
return false;
|
|
K.reset(new dht::Key_t());
|
|
return K->BDecode(buf);
|
|
}
|
|
bool read = false;
|
|
if(!BEncodeMaybeReadDictInt("T", T, read, key, buf))
|
|
return false;
|
|
if(!BEncodeMaybeReadDictInt("V", version, read, key, buf))
|
|
return false;
|
|
return read;
|
|
}
|
|
|
|
bool
|
|
GotIntroMessage::BEncode(llarp_buffer_t *buf) const
|
|
{
|
|
if(!bencode_start_dict(buf))
|
|
return false;
|
|
if(!BEncodeWriteDictMsgType(buf, "A", "G"))
|
|
return false;
|
|
if(!BEncodeWriteDictList("I", I, buf))
|
|
return false;
|
|
if(K)
|
|
{
|
|
if(!BEncodeWriteDictEntry("K", *K.get(), buf))
|
|
return false;
|
|
}
|
|
if(!BEncodeWriteDictInt("T", T, buf))
|
|
return false;
|
|
if(!BEncodeWriteDictInt("V", version, buf))
|
|
return false;
|
|
return bencode_end(buf);
|
|
}
|
|
} // namespace dht
|
|
} // namespace llarp
|