lokinet/llarp/service/hidden_service_address_lookup.cpp
dr7ana 11e54f6552 More message refactoring
- routing messages and surrounding code
- shim code in place for iteration and optimization after deciding what to do with buffer, string handling, and subsequent function calls
2023-08-31 09:28:16 -07:00

59 lines
1.5 KiB
C++

#include "hidden_service_address_lookup.hpp"
#include <llarp/dht/messages/findintro.hpp>
#include "endpoint.hpp"
#include <utility>
namespace llarp::service
{
HiddenServiceAddressLookup::HiddenServiceAddressLookup(
Endpoint* p,
HandlerFunc h,
const dht::Key_t& l,
const PubKey& k,
const RouterID& ep,
uint64_t order,
uint64_t tx,
llarp_time_t timeout)
: IServiceLookup(p, tx, "HSLookup", timeout)
, rootkey(k)
, relayOrder(order)
, location(l)
, handle(std::move(h))
{
endpoint = ep;
}
bool
HiddenServiceAddressLookup::HandleIntrosetResponse(const std::set<EncryptedIntroSet>& results)
{
std::optional<IntroSet> found;
const Address remote{rootkey};
if (results.size() > 0)
{
EncryptedIntroSet selected;
for (const auto& introset : results)
{
if (selected.OtherIsNewer(introset))
selected = introset;
}
const auto maybe = selected.MaybeDecrypt(rootkey);
if (maybe)
{
LogInfo("found result for ", remote.ToString());
found = *maybe;
}
}
return handle(remote, found, endpoint, TimeLeft(time_now_ms()), relayOrder);
}
std::shared_ptr<routing::AbstractRoutingMessage>
HiddenServiceAddressLookup::BuildRequestMessage()
{
auto msg = std::make_shared<routing::PathDHTMessage>();
msg->dht_msgs.emplace_back(std::make_unique<dht::FindIntroMessage>(txid, location, relayOrder));
return msg;
}
} // namespace llarp::service