lokinet/llarp/dht/taglookup.cpp

53 lines
1.4 KiB
C++
Raw Normal View History

2019-01-22 01:14:02 +00:00
#include <dht/taglookup.hpp>
#include <dht/context.hpp>
#include <dht/messages/gotintro.hpp>
namespace llarp
{
namespace dht
{
bool
TagLookup::Validate(const service::IntroSet &introset) const
{
if(!introset.Verify(parent->Now()))
2019-01-22 01:14:02 +00:00
{
llarp::LogWarn("got invalid introset from tag lookup");
return false;
}
if(introset.topic != target)
{
llarp::LogWarn("got introset with missmatched topic in tag lookup");
return false;
}
return true;
}
void
TagLookup::Start(const TXOwner &peer)
{
parent->DHTSendTo(peer.node.as_array(),
new FindIntroMessage(target, peer.txid, R));
}
void
TagLookup::SendReply()
{
2019-01-26 12:33:34 +00:00
std::set< service::IntroSet > found(valuesFound.begin(),
valuesFound.end());
2019-04-23 09:25:03 +00:00
2019-01-22 01:14:02 +00:00
// collect our local values if we haven't hit a limit
if(found.size() < 2)
{
2019-01-26 12:33:34 +00:00
auto tags =
parent->FindRandomIntroSetsWithTagExcluding(target, 1, found);
std::copy(tags.begin(), tags.end(), std::inserter(found, found.end()));
2019-01-22 01:14:02 +00:00
}
2019-01-26 12:33:34 +00:00
std::vector< service::IntroSet > values(found.begin(), found.end());
2019-01-22 01:14:02 +00:00
parent->DHTSendTo(whoasked.node.as_array(),
new GotIntroMessage(values, whoasked.txid));
}
} // namespace dht
} // namespace llarp