mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-10-31 09:20:21 +00:00
8dd1358cc6
* introset path haodver tweaks * improve warn/error messages to convey more information * dont block on queue insertion * reset convotag on decrypt/verify fail * add multiple ready hooks on outbound context * lookup introsets from close routers on dht * continue to tick dead sessions so they expire their paths * introset spacing * reduce lns lookup diversity requirement for speed * add a function to send reset convotag message * only have 1 outbound context at a time
218 lines
5.4 KiB
C++
218 lines
5.4 KiB
C++
#pragma once
|
|
|
|
#include <llarp/crypto/types.hpp>
|
|
#include <llarp/pow.hpp>
|
|
#include "info.hpp"
|
|
#include "intro.hpp"
|
|
#include "tag.hpp"
|
|
#include "protocol_type.hpp"
|
|
#include <llarp/util/bencode.hpp>
|
|
#include <llarp/util/time.hpp>
|
|
#include <llarp/util/status.hpp>
|
|
#include <llarp/dns/srv_data.hpp>
|
|
|
|
#include <llarp/net/ip_range.hpp>
|
|
#include <llarp/net/traffic_policy.hpp>
|
|
|
|
#include <optional>
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace service
|
|
{
|
|
constexpr std::size_t MAX_INTROSET_SIZE = 4096;
|
|
// 10 seconds clock skew permitted for introset expiration
|
|
constexpr llarp_time_t MAX_INTROSET_TIME_DELTA = 10s;
|
|
|
|
struct IntroSet
|
|
{
|
|
ServiceInfo addressKeys;
|
|
std::vector<Introduction> intros;
|
|
PQPubKey sntrupKey;
|
|
Tag topic;
|
|
std::vector<llarp::dns::SRVTuple> SRVs;
|
|
llarp_time_t timestampSignedAt = 0s;
|
|
|
|
/// ethertypes we advertise that we speak
|
|
std::vector<ProtocolType> supportedProtocols;
|
|
/// aonnuce that these ranges are reachable via our endpoint
|
|
/// only set when we support exit traffic ethertype is supported
|
|
std::set<IPRange> ownedRanges;
|
|
|
|
/// policies about traffic that we are willing to carry
|
|
/// a protocol/range whitelist or blacklist
|
|
/// only set when we support exit traffic ethertype
|
|
std::optional<net::TrafficPolicy> exitTrafficPolicy;
|
|
|
|
Signature signature;
|
|
uint64_t version = LLARP_PROTO_VERSION;
|
|
|
|
bool
|
|
OtherIsNewer(const IntroSet& other) const
|
|
{
|
|
return timestampSignedAt < other.timestampSignedAt;
|
|
}
|
|
|
|
std::ostream&
|
|
print(std::ostream& stream, int level, int spaces) const;
|
|
|
|
llarp_time_t
|
|
GetNewestIntroExpiration() const;
|
|
|
|
bool
|
|
GetNewestIntro(Introduction& intro) const;
|
|
|
|
bool
|
|
HasExpiredIntros(llarp_time_t now) const;
|
|
|
|
/// return true if any of our intros expires soon given a delta
|
|
bool
|
|
HasStaleIntros(llarp_time_t now, llarp_time_t delta) const;
|
|
|
|
bool
|
|
IsExpired(llarp_time_t now) const;
|
|
|
|
std::vector<llarp::dns::SRVData>
|
|
GetMatchingSRVRecords(std::string_view service_proto) const;
|
|
|
|
bool
|
|
BEncode(llarp_buffer_t* buf) const;
|
|
|
|
bool
|
|
BDecode(llarp_buffer_t* buf)
|
|
{
|
|
return bencode_decode_dict(*this, buf);
|
|
}
|
|
|
|
bool
|
|
DecodeKey(const llarp_buffer_t& key, llarp_buffer_t* buf);
|
|
|
|
bool
|
|
Verify(llarp_time_t now) const;
|
|
|
|
util::StatusObject
|
|
ExtractStatus() const;
|
|
};
|
|
|
|
inline bool
|
|
operator<(const IntroSet& lhs, const IntroSet& rhs)
|
|
{
|
|
return lhs.addressKeys < rhs.addressKeys;
|
|
}
|
|
|
|
inline bool
|
|
operator==(const IntroSet& lhs, const IntroSet& rhs)
|
|
{
|
|
return std::tie(
|
|
lhs.addressKeys,
|
|
lhs.intros,
|
|
lhs.sntrupKey,
|
|
lhs.timestampSignedAt,
|
|
lhs.version,
|
|
lhs.topic,
|
|
lhs.signature)
|
|
== std::tie(
|
|
rhs.addressKeys,
|
|
rhs.intros,
|
|
rhs.sntrupKey,
|
|
rhs.timestampSignedAt,
|
|
rhs.version,
|
|
rhs.topic,
|
|
rhs.signature);
|
|
}
|
|
|
|
inline bool
|
|
operator!=(const IntroSet& lhs, const IntroSet& rhs)
|
|
{
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const IntroSet& i)
|
|
{
|
|
return i.print(out, -1, -1);
|
|
}
|
|
|
|
/// public version of the introset that is encrypted
|
|
struct EncryptedIntroSet
|
|
{
|
|
using Payload_t = std::vector<byte_t>;
|
|
|
|
PubKey derivedSigningKey;
|
|
llarp_time_t signedAt = 0s;
|
|
Payload_t introsetPayload;
|
|
TunnelNonce nounce;
|
|
std::optional<Tag> topic;
|
|
Signature sig;
|
|
|
|
bool
|
|
Sign(const PrivateKey& k);
|
|
|
|
bool
|
|
IsExpired(llarp_time_t now) const;
|
|
|
|
bool
|
|
BEncode(llarp_buffer_t* buf) const;
|
|
|
|
bool
|
|
BDecode(llarp_buffer_t* buf)
|
|
{
|
|
return bencode_decode_dict(*this, buf);
|
|
}
|
|
|
|
bool
|
|
DecodeKey(const llarp_buffer_t& key, llarp_buffer_t* buf);
|
|
|
|
bool
|
|
OtherIsNewer(const EncryptedIntroSet& other) const;
|
|
|
|
/// verify signature and timestamp
|
|
bool
|
|
Verify(llarp_time_t now) const;
|
|
|
|
std::ostream&
|
|
print(std::ostream& stream, int level, int spaces) const;
|
|
|
|
util::StatusObject
|
|
ExtractStatus() const;
|
|
|
|
std::optional<IntroSet>
|
|
MaybeDecrypt(const PubKey& rootKey) const;
|
|
};
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const EncryptedIntroSet& i)
|
|
{
|
|
return i.print(out, -1, -1);
|
|
}
|
|
|
|
inline bool
|
|
operator<(const EncryptedIntroSet& lhs, const EncryptedIntroSet& rhs)
|
|
{
|
|
return lhs.derivedSigningKey < rhs.derivedSigningKey;
|
|
}
|
|
|
|
inline bool
|
|
operator==(const EncryptedIntroSet& lhs, const EncryptedIntroSet& rhs)
|
|
{
|
|
return std::tie(lhs.signedAt, lhs.derivedSigningKey, lhs.nounce, lhs.sig)
|
|
== std::tie(rhs.signedAt, rhs.derivedSigningKey, rhs.nounce, rhs.sig);
|
|
}
|
|
|
|
inline bool
|
|
operator!=(const EncryptedIntroSet& lhs, const EncryptedIntroSet& rhs)
|
|
{
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
using EncryptedIntroSetLookupHandler =
|
|
std::function<void(const std::vector<EncryptedIntroSet>&)>;
|
|
using IntroSetLookupHandler = std::function<void(const std::vector<IntroSet>&)>;
|
|
|
|
} // namespace service
|
|
} // namespace llarp
|