1
1
Fork 0
mirror of https://github.com/oxen-io/lokinet synced 2023-12-14 06:53:00 +01:00
lokinet/llarp/router_contact.hpp

230 lines
4.4 KiB
C++
Raw Normal View History

2018-12-12 02:55:30 +01:00
#ifndef LLARP_RC_HPP
#define LLARP_RC_HPP
#include <constants/version.hpp>
#include <crypto/types.hpp>
#include <net/address_info.hpp>
#include <net/exit_info.hpp>
2019-01-13 15:00:50 +01:00
#include <util/aligned.hpp>
#include <util/bencode.hpp>
2019-02-08 20:43:25 +01:00
#include <util/status.hpp>
2020-01-25 17:28:07 +01:00
#include <router_version.hpp>
2018-12-12 02:55:30 +01:00
2019-01-22 02:14:02 +01:00
#include <functional>
2019-08-13 00:09:44 +02:00
#include <nlohmann/json.hpp>
2018-12-12 02:55:30 +01:00
#include <vector>
#define MAX_RC_SIZE (1024)
#define NICKLEN (32)
namespace llarp
{
/// NetID
struct NetID final : public AlignedBuffer<8>
{
static NetID&
2019-01-05 01:49:06 +01:00
DefaultValue();
NetID();
explicit NetID(const byte_t* val);
2019-01-05 01:49:06 +01:00
explicit NetID(const NetID& other) = default;
2019-01-05 01:49:06 +01:00
bool
operator==(const NetID& other) const;
bool
operator!=(const NetID& other) const
{
return !(*this == other);
}
std::ostream&
print(std::ostream& stream, int level, int spaces) const
{
2019-02-25 00:46:37 +01:00
Printer printer(stream, level, spaces);
printer.printValue(ToString());
return stream;
}
std::string
ToString() const;
bool
BDecode(llarp_buffer_t* buf);
bool
BEncode(llarp_buffer_t* buf) const;
};
inline std::ostream&
operator<<(std::ostream& out, const NetID& id)
2019-02-25 00:46:37 +01:00
{
return id.print(out, -1, -1);
}
/// RouterContact
2019-05-24 04:01:36 +02:00
struct RouterContact
2018-12-12 02:55:30 +01:00
{
/// for unit tests
2019-08-27 01:29:17 +02:00
static bool BlockBogons;
static llarp_time_t Lifetime;
static llarp_time_t UpdateInterval;
static llarp_time_t StaleInsertionAge;
2019-05-24 04:01:36 +02:00
RouterContact()
2018-12-12 02:55:30 +01:00
{
Clear();
}
2019-02-25 13:46:40 +01:00
struct Hash
{
size_t
operator()(const RouterContact& r) const
2019-02-25 13:46:40 +01:00
{
return PubKey::Hash()(r.pubkey);
}
};
2018-12-12 02:55:30 +01:00
// advertised addresses
std::vector<AddressInfo> addrs;
// network identifier
NetID netID;
2018-12-12 02:55:30 +01:00
// public encryption public key
llarp::PubKey enckey;
// public signing public key
llarp::PubKey pubkey;
// advertised exits
std::vector<ExitInfo> exits;
2018-12-12 02:55:30 +01:00
// signature
llarp::Signature signature;
/// node nickname, yw kee
llarp::AlignedBuffer<NICKLEN> nickname;
2018-12-12 02:55:30 +01:00
2020-02-24 20:40:45 +01:00
llarp_time_t last_updated = 0s;
uint64_t version = LLARP_PROTO_VERSION;
std::optional<RouterVersion> routerVersion;
2018-12-12 02:55:30 +01:00
2019-02-11 18:14:43 +01:00
util::StatusObject
2019-04-19 17:10:26 +02:00
ExtractStatus() const;
2019-02-08 20:43:25 +01:00
2019-08-13 00:09:44 +02:00
nlohmann::json
ToJson() const
{
return ExtractStatus();
2019-08-13 00:09:44 +02:00
}
std::string
ToString() const
{
return ToJson().dump();
}
2018-12-12 02:55:30 +01:00
bool
BEncode(llarp_buffer_t* buf) const;
2018-12-12 02:55:30 +01:00
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
2019-02-27 13:55:26 +01:00
{
return !(*this == other);
}
2018-12-12 02:55:30 +01:00
void
Clear();
bool
IsExit() const
{
2019-08-27 01:29:17 +02:00
return !exits.empty();
2018-12-12 02:55:30 +01:00
}
bool
BDecode(llarp_buffer_t* buf)
2018-12-12 02:55:30 +01:00
{
Clear();
return bencode_decode_dict(*this, buf);
2018-12-12 02:55:30 +01:00
}
bool
DecodeKey(const llarp_buffer_t& k, llarp_buffer_t* buf);
2018-12-12 02:55:30 +01:00
bool
HasNick() const;
std::string
Nick() const;
bool
IsPublicRouter() const;
void
SetNick(std::string_view nick);
2018-12-12 02:55:30 +01:00
bool
2019-06-04 15:19:45 +02:00
Verify(llarp_time_t now, bool allowExpired = true) const;
2018-12-12 02:55:30 +01:00
bool
Sign(const llarp::SecretKey& secret);
2018-12-12 02:55:30 +01:00
/// does this RC expire soon? default delta is 1 minute
bool
2020-02-24 20:40:45 +01:00
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;
2019-07-15 18:56:09 +02:00
/// 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;
2018-12-12 02:55:30 +01:00
bool
OtherIsNewer(const RouterContact& other) const
2018-12-12 02:55:30 +01:00
{
return last_updated < other.last_updated;
}
std::ostream&
print(std::ostream& stream, int level, int spaces) const;
2019-01-17 16:11:17 +01:00
2018-12-12 02:55:30 +01:00
bool
Read(const char* fname);
2018-12-12 02:55:30 +01:00
bool
Write(const char* fname) const;
2018-12-12 02:55:30 +01:00
bool
VerifySignature() const;
2018-12-12 02:55:30 +01:00
};
2019-01-22 02:14:02 +01:00
inline std::ostream&
operator<<(std::ostream& out, const RouterContact& rc)
2019-02-25 00:46:37 +01:00
{
return rc.print(out, -1, -1);
}
using RouterLookupHandler = std::function<void(const std::vector<RouterContact>&)>;
2018-12-12 02:55:30 +01:00
} // namespace llarp
#endif