#ifndef LLARP_PATHSET_HPP #define LLARP_PATHSET_HPP #include #include #include #include #include #include #include #include #include #include #include struct llarp_nodedb; namespace llarp { struct RouterContact; namespace dht { struct GotIntroMessage; struct GotRouterMessage; } // namespace dht namespace path { /// status of a path enum PathStatus { ePathBuilding, ePathEstablished, ePathTimeout, ePathExpired }; /// the role of this path can fulfill using PathRole = int; /// capable of any role constexpr PathRole ePathRoleAny = 0; /// outbound hs traffic capable constexpr PathRole ePathRoleOutboundHS = (1 << 0); /// inbound hs traffic capable constexpr PathRole ePathRoleInboundHS = (1 << 1); /// exit traffic capable constexpr PathRole ePathRoleExit = (1 << 2); /// service node capable constexpr PathRole ePathRoleSVC = (1 << 3); /// dht message capable constexpr PathRole ePathRoleDHT = (1 << 4); // forward declare struct Path; using Path_ptr = std::shared_ptr< Path >; struct PathSet; using PathSet_ptr = std::shared_ptr< PathSet >; /// a set of paths owned by an entity struct PathSet { /// construct /// @params numPaths the number of paths to maintain PathSet(size_t numPaths); /// get a shared_ptr of ourself virtual PathSet_ptr GetSelf() = 0; virtual void BuildOne(PathRole roles = ePathRoleAny) = 0; /// tick owned paths virtual void Tick(llarp_time_t now) = 0; /// count the number of paths that will exist at this timestamp in future size_t NumPathsExistingAt(llarp_time_t futureTime) const; void RemovePath(Path_ptr path); virtual void HandlePathBuilt(Path_ptr path) = 0; virtual void HandlePathBuildTimeout(__attribute__((unused)) Path_ptr path); /// a path died now what? virtual void HandlePathDied(Path_ptr path) = 0; bool GetNewestIntro(service::Introduction& intro) const; void AddPath(Path_ptr path); Path_ptr GetByUpstream(RouterID remote, PathID_t rxid) const; void ExpirePaths(llarp_time_t now); /// get the number of paths in this status size_t NumInStatus(PathStatus st) const; /// get the number of paths that match the role that are available size_t AvailablePaths(PathRole role) const; /// get time from event loop virtual llarp_time_t Now() const = 0; /// stop this pathset and mark it as to be removed virtual bool Stop() = 0; /// return true if we are stopped virtual bool IsStopped() const = 0; /// get the "name" of this pathset virtual std::string Name() const = 0; /// return true if we can and should remove this pathset and underlying /// resources from its parent context virtual bool ShouldRemove() const = 0; /// return true if we should build another path virtual bool ShouldBuildMore(llarp_time_t now) const; /// return true if we need another path with the given path roles virtual bool ShouldBuildMoreForRoles(llarp_time_t now, PathRole roles) const; /// return the minimum number of paths we want for given roles virtual size_t MinRequiredForRoles(PathRole roles) 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 dht::GotIntroMessage* msg) { return false; } /// override me in subtype virtual bool HandleGotRouterMessage(__attribute__((unused)) const dht::GotRouterMessage* msg) { return false; } virtual routing::IMessageHandler* GetDHTHandler() { return nullptr; } Path_ptr GetEstablishedPathClosestTo(RouterID router, PathRole roles = ePathRoleAny) const; Path_ptr PickRandomEstablishedPath(PathRole roles = ePathRoleAny) const; Path_ptr GetPathByRouter(RouterID router, PathRole roles = ePathRoleAny) const; Path_ptr GetNewestPathByRouter(RouterID router, PathRole roles = ePathRoleAny) const; Path_ptr GetPathByID(PathID_t id) const; Path_ptr GetByEndpointWithID(RouterID router, PathID_t id) const; bool GetCurrentIntroductionsWithFilter( std::set< service::Introduction >& intros, std::function< bool(const service::Introduction&) > filter) const; bool GetCurrentIntroductions(std::set< service::Introduction >& intros) const; virtual bool PublishIntroSet(__attribute__((unused)) AbstractRouter* r) { return false; } virtual bool SelectHop(llarp_nodedb* db, const RouterContact& prev, RouterContact& cur, size_t hop, PathRole roles) = 0; protected: size_t m_NumPaths; void TickPaths(llarp_time_t now, AbstractRouter* r); void ForEachPath(std::function< void(const Path_ptr&) > visit) const { Lock_t lock(&m_PathsMutex); auto itr = m_Paths.begin(); while(itr != m_Paths.end()) { visit(itr->second); ++itr; } } using PathInfo_t = std::pair< RouterID, PathID_t >; struct PathInfoHash { size_t operator()(const PathInfo_t& i) const { return RouterID::Hash()(i.first) ^ PathID_t::Hash()(i.second); } }; using Mtx_t = util::NullMutex; using Lock_t = util::NullLock; using PathMap_t = std::unordered_map< PathInfo_t, Path_ptr, PathInfoHash >; mutable Mtx_t m_PathsMutex; PathMap_t m_Paths; }; } // namespace path } // namespace llarp #endif