You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
lokinet/llarp/dht/messages/findrouter.hpp

58 lines
1.5 KiB
C++

#pragma once
#include <llarp/dht/message.hpp>
1 year ago
namespace llarp::dht
{
1 year ago
struct FindRouterMessage : public AbstractDHTMessage
{
1 year ago
// inbound parsing
FindRouterMessage(const Key_t& from) : AbstractDHTMessage(from)
{}
// find by routerid
FindRouterMessage(uint64_t id, const RouterID& target)
: AbstractDHTMessage({}), targetKey(target), txid(id)
{}
// exploritory
FindRouterMessage(uint64_t id) : AbstractDHTMessage({}), exploratory(true), txid(id)
{
1 year ago
targetKey.Randomize();
}
~FindRouterMessage() override;
void
bt_encode(oxenc::bt_dict_producer& btdp) const override;
bool
decode_key(const llarp_buffer_t& key, llarp_buffer_t* val) override;
bool
handle_message(
llarp_dht_context* ctx,
std::vector<std::unique_ptr<AbstractDHTMessage>>& replies) const override;
RouterID targetKey;
bool iterative = false;
bool exploratory = false;
uint64_t txid = 0;
uint64_t version = 0;
};
/// variant of FindRouterMessage relayed via path
struct RelayedFindRouterMessage final : public FindRouterMessage
{
RelayedFindRouterMessage(const Key_t& from) : FindRouterMessage(from)
{}
/// handle a relayed FindRouterMessage, do a lookup on the dht and inform
/// the path of the result
/// TODO: smart path expiration logic needs to be implemented
bool
handle_message(
llarp_dht_context* ctx,
std::vector<std::unique_ptr<AbstractDHTMessage>>& replies) const override;
1 year ago
};
} // namespace llarp::dht