lokinet/llarp/messages/dht.hpp

100 lines
2.3 KiB
C++

#pragma once
#include "common.hpp"
namespace llarp
{
namespace FindIntroMessage
{
inline auto NOT_FOUND = "NOT FOUND"sv;
inline auto INVALID_ORDER = "INVALID ORDER"sv;
inline auto INSUFFICIENT_NODES = "INSUFFICIENT NODES"sv;
inline static std::string
serialize(const dht::Key_t& location, bool is_relayed, uint64_t order)
{
oxenc::bt_dict_producer btdp;
try
{
btdp.append("O", order);
btdp.append("R", is_relayed ? 1 : 0);
btdp.append("S", location.ToView());
}
catch (...)
{
log::error(link_cat, "Error: FindIntroMessage failed to bt encode contents!");
}
return std::move(btdp).str();
}
} // namespace FindIntroMessage
namespace FindNameMessage
{
inline auto NOT_FOUND = "NOT FOUND"sv;
// NOT USED
inline static std::string
serialize(dht::Key_t name_hash)
{
oxenc::bt_dict_producer btdp;
try
{
btdp.append("H", name_hash.ToView());
}
catch (...)
{
log::error(link_cat, "Error: FindNameMessage failed to bt encode contents!");
}
return std::move(btdp).str();
}
inline static std::string
serialize(std::string name_hash)
{
oxenc::bt_dict_producer btdp;
try
{
btdp.append("H", std::move(name_hash));
}
catch (...)
{
log::error(link_cat, "Error: FindNameMessage failed to bt encode contents!");
}
return std::move(btdp).str();
}
} // namespace FindNameMessage
namespace PublishIntroMessage
{
inline auto INVALID_INTROSET = "INVALID INTROSET"sv;
inline auto EXPIRED = "EXPIRED INTROSET"sv;
inline auto INSUFFICIENT = "INSUFFICIENT NODES"sv;
inline auto INVALID_ORDER = "INVALID ORDER"sv;
inline static std::string
serialize(std::string introset, uint64_t relay_order, uint64_t is_relayed)
{
oxenc::bt_dict_producer btdp;
try
{
btdp.append("I", introset);
btdp.append("O", relay_order);
btdp.append("R", is_relayed);
}
catch (...)
{
log::error(link_cat, "Error: FindNameMessage failed to bt encode contents!");
}
return std::move(btdp).str();
}
} // namespace PublishIntroMessage
} // namespace llarp