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/router_contact.hpp

239 lines
4.7 KiB
C++

#pragma once
#include "llarp/constants/version.hpp"
#include "llarp/crypto/types.hpp"
#include "llarp/net/address_info.hpp"
#include "llarp/net/exit_info.hpp"
#include "llarp/util/aligned.hpp"
#include "llarp/util/bencode.hpp"
#include "llarp/util/status.hpp"
#include "router_version.hpp"
#include "llarp/dns/srv_data.hpp"
#include <functional>
#include <nlohmann/json.hpp>
#include <vector>
#define MAX_RC_SIZE (1024)
#define NICKLEN (32)
namespace oxenc
{
class bt_list_consumer;
} // namespace oxenc
namespace llarp
{
/// NetID
struct NetID final : public AlignedBuffer<8>
{
static NetID&
DefaultValue();
NetID();
explicit NetID(const byte_t* val);
NetID(const NetID& other) = default;
NetID&
operator=(const NetID& other) = default;
bool
operator==(const NetID& other) const;
bool
operator!=(const NetID& other) const
{
return !(*this == other);
}
std::string
ToString() const;
bool
BDecode(llarp_buffer_t* buf);
bool
BEncode(llarp_buffer_t* buf) const;
};
/// RouterContact
struct RouterContact
{
/// for unit tests
static bool BlockBogons;
static llarp_time_t Lifetime;
static llarp_time_t UpdateInterval;
static llarp_time_t StaleInsertionAge;
RouterContact()
{
Clear();
}
// advertised addresses
std::vector<AddressInfo> addrs;
// network identifier
NetID netID;
// public encryption public key
llarp::PubKey enckey;
// public signing public key
llarp::PubKey pubkey;
// signature
llarp::Signature signature;
/// node nickname, yw kee
llarp::AlignedBuffer<NICKLEN> nickname;
llarp_time_t last_updated = 0s;
uint64_t version = llarp::constants::proto_version;
std::optional<RouterVersion> routerVersion;
/// should we serialize the exit info?
const static bool serializeExit = true;
std::string signed_bt_dict;
std::vector<dns::SRVData> srvRecords;
util::StatusObject
ExtractStatus() const;
nlohmann::json
ToJson() const
{
return ExtractStatus();
}
std::string
ToString() const;
bool
BEncode(llarp_buffer_t* buf) const;
bool
BEncodeSignedSection(llarp_buffer_t* buf) const;
std::string
ToTXTRecord() const;
bool
operator==(const RouterContact& other) const
{
return addrs == other.addrs && enckey == other.enckey && pubkey == other.pubkey
&& signature == other.signature && nickname == other.nickname
&& last_updated == other.last_updated && netID == other.netID;
}
bool
operator<(const RouterContact& other) const
{
return pubkey < other.pubkey;
}
bool
operator!=(const RouterContact& other) const
{
return !(*this == other);
}
void
Clear();
bool
IsExit() const
{
return false;
}
bool
BDecode(llarp_buffer_t* buf);
bool
DecodeKey(const llarp_buffer_t& k, llarp_buffer_t* buf);
bool
HasNick() const;
std::string
Nick() const;
bool
IsPublicRouter() const;
void
SetNick(std::string_view nick);
bool
Verify(llarp_time_t now, bool allowExpired = true) const;
bool
Sign(const llarp::SecretKey& secret);
/// does this RC expire soon? default delta is 1 minute
bool
ExpiresSoon(llarp_time_t now, llarp_time_t dlt = 1min) const;
/// returns true if this RC is expired and should be removed
bool
IsExpired(llarp_time_t now) const;
/// returns time in ms until we expire or 0 if we have expired
llarp_time_t
TimeUntilExpires(llarp_time_t now) const;
/// get the age of this RC in ms
llarp_time_t
Age(llarp_time_t now) const;
bool
OtherIsNewer(const RouterContact& other) const
{
return last_updated < other.last_updated;
}
bool
Read(const fs::path& fname);
bool
Write(const fs::path& fname) const;
bool
VerifySignature() const;
/// return true if the netid in this rc is for the network id we are using
bool
FromOurNetwork() const;
bool
IsObsoleteBootstrap() const;
private:
bool
DecodeVersion_0(llarp_buffer_t* buf);
bool
DecodeVersion_1(oxenc::bt_list_consumer& btlist);
};
template <>
constexpr inline bool IsToStringFormattable<NetID> = true;
template <>
constexpr inline bool IsToStringFormattable<RouterContact> = true;
using RouterLookupHandler = std::function<void(const std::vector<RouterContact>&)>;
} // namespace llarp
namespace std
{
template <>
struct hash<llarp::RouterContact>
{
size_t
operator()(const llarp::RouterContact& r) const
{
return std::hash<llarp::PubKey>{}(r.pubkey);
}
};
} // namespace std