lokinet/llarp/service/Intro.hpp
2019-02-24 23:46:44 +00:00

104 lines
2.3 KiB
C++

#ifndef LLARP_SERVICE_INTRO_HPP
#define LLARP_SERVICE_INTRO_HPP
#include <crypto/types.hpp>
#include <path/path_types.hpp>
#include <util/bencode.hpp>
#include <util/status.hpp>
#include <iostream>
namespace llarp
{
namespace service
{
struct Introduction final : public llarp::IBEncodeMessage,
public util::IStateful
{
llarp::PubKey router;
llarp::PathID_t pathID;
uint64_t latency = 0;
uint64_t version = 0;
uint64_t expiresAt = 0;
Introduction() = default;
Introduction(const Introduction& other) : IBEncodeMessage(other.version)
{
router = other.router;
pathID = other.pathID;
latency = other.latency;
version = other.version;
expiresAt = other.expiresAt;
}
util::StatusObject
ExtractStatus() const override;
bool
IsExpired(llarp_time_t now) const
{
return now >= expiresAt;
}
bool
ExpiresSoon(llarp_time_t now, llarp_time_t dlt = 15000) const
{
if(dlt)
return now >= (expiresAt - dlt);
return IsExpired(now);
}
~Introduction();
std::ostream&
print(std::ostream& stream, int level, int spaces) const;
bool
BEncode(llarp_buffer_t* buf) const override;
bool
DecodeKey(const llarp_buffer_t& key, llarp_buffer_t* buf) override;
void
Clear();
bool
operator<(const Introduction& other) const
{
return expiresAt < other.expiresAt || pathID < other.pathID
|| router < other.router || version < other.version
|| latency < other.latency;
}
bool
operator==(const Introduction& other) const
{
return pathID == other.pathID && router == other.router;
}
bool
operator!=(const Introduction& other) const
{
return pathID != other.pathID || router != other.router;
}
struct Hash
{
size_t
operator()(const Introduction& i) const
{
return PubKey::Hash()(i.router) ^ PathID_t::Hash()(i.pathID);
}
};
};
inline std::ostream&
operator<<(std::ostream& out, const Introduction& i)
{
return i.print(out, -1, -1);
}
} // namespace service
} // namespace llarp
#endif