mirror of https://github.com/oxen-io/lokinet
164 lines
3.6 KiB
C++
164 lines
3.6 KiB
C++
#ifndef LLARP_PATHSET_HPP
|
|
#define LLARP_PATHSET_HPP
|
|
#include <llarp/time.h>
|
|
#include <functional>
|
|
#include <list>
|
|
#include <llarp/path_types.hpp>
|
|
#include <llarp/router_id.hpp>
|
|
#include <llarp/routing/message.hpp>
|
|
#include <llarp/service/IntroSet.hpp>
|
|
#include <llarp/service/lookup.hpp>
|
|
#include <llarp/dht/messages/all.hpp>
|
|
#include <map>
|
|
#include <tuple>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace dht
|
|
{
|
|
struct GotIntroMessage;
|
|
}
|
|
|
|
namespace path
|
|
{
|
|
enum PathStatus
|
|
{
|
|
ePathBuilding,
|
|
ePathEstablished,
|
|
ePathTimeout,
|
|
ePathExpired
|
|
};
|
|
// forward declare
|
|
struct Path;
|
|
|
|
/// a set of paths owned by an entity
|
|
struct PathSet
|
|
{
|
|
/// construct
|
|
/// @params numPaths the number of paths to maintain
|
|
PathSet(size_t numPaths);
|
|
|
|
/// tick owned paths
|
|
void
|
|
Tick(llarp_time_t now, llarp_router* r);
|
|
|
|
void
|
|
RemovePath(Path* path);
|
|
|
|
virtual void
|
|
HandlePathBuilt(__attribute__((unused)) Path* path);
|
|
|
|
virtual void
|
|
HandlePathBuildTimeout(__attribute__((unused)) Path* path);
|
|
|
|
bool
|
|
GetNewestIntro(service::Introduction& intro) const;
|
|
|
|
void
|
|
AddPath(Path* path);
|
|
|
|
Path*
|
|
GetByUpstream(const RouterID& remote, const PathID_t& rxid) const;
|
|
|
|
void
|
|
ExpirePaths(llarp_time_t now);
|
|
|
|
size_t
|
|
NumInStatus(PathStatus st) const;
|
|
|
|
/// get time from event loop
|
|
virtual llarp_time_t
|
|
Now() const = 0;
|
|
|
|
/// return true if we should build another path
|
|
virtual bool
|
|
ShouldBuildMore(llarp_time_t now) const;
|
|
|
|
/// return true if we should publish a new hidden service descriptor
|
|
virtual bool
|
|
ShouldPublishDescriptors(__attribute__((unused)) llarp_time_t now) const
|
|
{
|
|
return false;
|
|
}
|
|
|
|
/// override me in subtype
|
|
virtual bool
|
|
HandleGotIntroMessage(__attribute__((unused))
|
|
const llarp::dht::GotIntroMessage* msg)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
/// override me in subtype
|
|
virtual bool
|
|
HandleGotRouterMessage(__attribute__((unused))
|
|
const llarp::dht::GotRouterMessage* msg)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
virtual routing::IMessageHandler*
|
|
GetDHTHandler()
|
|
{
|
|
return nullptr;
|
|
}
|
|
|
|
Path*
|
|
GetEstablishedPathClosestTo(const RouterID& router) const;
|
|
|
|
Path*
|
|
PickRandomEstablishedPath() const;
|
|
|
|
Path*
|
|
GetPathByRouter(const RouterID& router) const;
|
|
|
|
Path*
|
|
GetNewestPathByRouter(const RouterID& router) const;
|
|
|
|
Path*
|
|
GetPathByID(const PathID_t& id) const;
|
|
|
|
bool
|
|
GetCurrentIntroductionsWithFilter(
|
|
std::set< llarp::service::Introduction >& intros,
|
|
std::function< bool(const llarp::service::Introduction&) > filter)
|
|
const;
|
|
|
|
bool
|
|
GetCurrentIntroductions(
|
|
std::set< llarp::service::Introduction >& intros) const;
|
|
|
|
virtual bool
|
|
PublishIntroSet(__attribute__((unused)) llarp_router* r)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
virtual bool
|
|
SelectHop(llarp_nodedb* db, const RouterContact& prev, RouterContact& cur,
|
|
size_t hop) = 0;
|
|
|
|
protected:
|
|
size_t m_NumPaths;
|
|
|
|
private:
|
|
typedef std::pair< RouterID, PathID_t > PathInfo_t;
|
|
|
|
struct PathInfoHash
|
|
{
|
|
size_t
|
|
operator()(const PathInfo_t& i) const
|
|
{
|
|
return *i.first.data_l() ^ *i.second.data_l();
|
|
}
|
|
};
|
|
|
|
typedef std::unordered_map< PathInfo_t, Path*, PathInfoHash > PathMap_t;
|
|
PathMap_t m_Paths;
|
|
};
|
|
|
|
} // namespace path
|
|
} // namespace llarp
|
|
|
|
#endif
|