lokinet/include/llarp/pathset.hpp

164 lines
3.6 KiB
C++
Raw Normal View History

#ifndef LLARP_PATHSET_HPP
#define LLARP_PATHSET_HPP
2018-11-19 22:45:37 +00:00
#include <llarp/time.hpp>
2018-07-12 18:21:44 +00:00
#include <functional>
#include <list>
#include <llarp/path_types.hpp>
#include <llarp/router_id.hpp>
2018-07-18 03:10:21 +00:00
#include <llarp/routing/message.hpp>
#include <llarp/service/IntroSet.hpp>
2018-07-18 03:10:21 +00:00
#include <llarp/service/lookup.hpp>
2018-08-30 18:48:43 +00:00
#include <llarp/dht/messages/all.hpp>
#include <map>
#include <tuple>
namespace llarp
{
2018-07-09 17:32:11 +00:00
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*
2018-08-01 22:10:38 +00:00
GetByUpstream(const RouterID& remote, const PathID_t& rxid) const;
void
ExpirePaths(llarp_time_t now);
size_t
NumInStatus(PathStatus st) const;
2018-10-29 16:48:36 +00:00
/// get time from event loop
virtual llarp_time_t
Now() const = 0;
/// return true if we should build another path
virtual bool
2018-10-29 16:48:36 +00:00
ShouldBuildMore(llarp_time_t now) const;
2018-07-09 17:32:11 +00:00
/// return true if we should publish a new hidden service descriptor
2018-07-18 03:10:21 +00:00
virtual bool
ShouldPublishDescriptors(__attribute__((unused)) llarp_time_t now) const
2018-07-18 03:10:21 +00:00
{
return false;
}
2018-07-09 17:32:11 +00:00
2018-07-17 06:17:13 +00:00
/// override me in subtype
virtual bool
HandleGotIntroMessage(__attribute__((unused))
const llarp::dht::GotIntroMessage* msg)
{
return false;
}
2018-08-10 21:34:11 +00:00
/// override me in subtype
virtual bool
HandleGotRouterMessage(__attribute__((unused))
const llarp::dht::GotRouterMessage* msg)
2018-08-10 21:34:11 +00:00
{
return false;
}
virtual routing::IMessageHandler*
GetDHTHandler()
{
return nullptr;
}
Path*
2018-08-01 22:10:38 +00:00
GetEstablishedPathClosestTo(const RouterID& router) const;
2018-07-22 23:14:29 +00:00
Path*
2018-08-01 22:10:38 +00:00
PickRandomEstablishedPath() const;
Path*
GetPathByRouter(const RouterID& router) const;
2018-07-22 23:14:29 +00:00
Path*
GetNewestPathByRouter(const RouterID& router) const;
2018-08-10 21:34:11 +00:00
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(
2018-07-19 04:58:39 +00:00
std::set< llarp::service::Introduction >& intros) const;
2018-07-18 03:10:21 +00:00
virtual bool
PublishIntroSet(__attribute__((unused)) llarp_router* r)
2018-07-18 03:10:21 +00:00
{
return false;
}
2018-07-17 06:17:13 +00:00
virtual bool
2018-08-30 18:48:43 +00:00
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;
2018-10-03 18:17:34 +00:00
struct PathInfoHash
{
2018-10-05 07:57:48 +00:00
size_t
operator()(const PathInfo_t& i) const
2018-10-03 18:17:34 +00:00
{
return *i.first.data_l() ^ *i.second.data_l();
}
};
2018-10-05 07:57:48 +00:00
typedef std::unordered_map< PathInfo_t, Path*, PathInfoHash > PathMap_t;
PathMap_t m_Paths;
};
} // namespace path
} // namespace llarp
2018-08-18 14:01:21 +00:00
#endif