lokinet/llarp/exit/session.hpp

154 lines
4.0 KiB
C++
Raw Normal View History

#ifndef LLARP_EXIT_SESSION_HPP
#define LLARP_EXIT_SESSION_HPP
#include <messages/exit.hpp>
#include <messages/transfer_traffic.hpp>
#include <net/ip.hpp>
2019-01-11 01:19:36 +00:00
#include <path/pathbuilder.hpp>
2018-11-28 16:38:20 +00:00
#include <deque>
2018-12-20 12:41:17 +00:00
#include <queue>
namespace llarp
{
namespace exit
{
/// a persisting exit session with an exit router
struct BaseSession : public llarp::path::Builder
{
2018-11-29 13:12:35 +00:00
static constexpr size_t MaxUpstreamQueueLength = 256;
2018-12-13 12:27:14 +00:00
static constexpr llarp_time_t LifeSpan = 60 * 10 * 1000;
2018-11-29 13:12:35 +00:00
2018-11-14 19:34:17 +00:00
BaseSession(const llarp::RouterID& exitRouter,
std::function< bool(const llarp_buffer_t&) > writepkt,
llarp::Router* r, size_t numpaths, size_t hoplen);
2018-11-29 13:12:35 +00:00
virtual ~BaseSession();
2019-02-08 19:43:25 +00:00
void
ExtractStatus(util::StatusObject& obj) const override;
bool
SelectHop(llarp_nodedb* db, const RouterContact& prev, RouterContact& cur,
2018-11-14 18:02:27 +00:00
size_t hop, llarp::path::PathRole roles) override;
bool
ShouldBuildMore(llarp_time_t now) const override;
2018-11-14 19:34:17 +00:00
void
HandlePathBuilt(llarp::path::Path* p) override;
bool
2018-11-28 16:38:20 +00:00
QueueUpstreamTraffic(llarp::net::IPv4Packet pkt, const size_t packSize);
2018-12-20 12:41:17 +00:00
/// flush upstream and downstream traffic
2018-11-28 16:38:20 +00:00
bool
2018-12-20 12:41:17 +00:00
Flush();
2018-11-28 16:38:20 +00:00
/// send close and stop session
bool
Stop() override;
bool
2018-11-29 13:12:35 +00:00
IsReady() const;
2018-12-10 15:44:18 +00:00
const llarp::RouterID
Endpoint() const
{
return m_ExitRouter;
}
2018-12-13 12:27:14 +00:00
bool
IsExpired(llarp_time_t now) const;
bool
LoadIdentityFromFile(const char* fname);
protected:
llarp::RouterID m_ExitRouter;
llarp::SecretKey m_ExitIdentity;
std::function< bool(const llarp_buffer_t&) > m_WritePacket;
virtual void
PopulateRequest(llarp::routing::ObtainExitMessage& msg) const = 0;
2018-11-14 19:34:17 +00:00
bool
HandleTrafficDrop(llarp::path::Path* p, const llarp::PathID_t& path,
uint64_t s);
2018-11-14 19:34:17 +00:00
bool
HandleGotExit(llarp::path::Path* p, llarp_time_t b);
bool
HandleTraffic(llarp::path::Path* p, const llarp_buffer_t& buf,
uint64_t seqno);
2018-11-14 19:34:17 +00:00
private:
using UpstreamTrafficQueue_t =
std::deque< llarp::routing::TransferTrafficMessage >;
using TieredQueue_t = std::map< uint8_t, UpstreamTrafficQueue_t >;
TieredQueue_t m_Upstream;
2018-12-20 12:41:17 +00:00
using DownstreamPkt = std::pair< uint64_t, llarp::net::IPv4Packet >;
struct DownstreamPktSorter
{
bool
operator()(const DownstreamPkt& left, const DownstreamPkt& right) const
{
2018-12-20 13:06:36 +00:00
return left.first < right.first;
2018-12-20 12:41:17 +00:00
}
};
using DownstreamTrafficQueue_t =
std::priority_queue< DownstreamPkt, std::vector< DownstreamPkt >,
DownstreamPktSorter >;
DownstreamTrafficQueue_t m_Downstream;
2018-11-29 21:19:20 +00:00
uint64_t m_Counter;
2018-12-13 12:27:14 +00:00
llarp_time_t m_LastUse;
};
2018-11-29 13:12:35 +00:00
struct ExitSession final : public BaseSession
{
ExitSession(const llarp::RouterID& snodeRouter,
std::function< bool(const llarp_buffer_t&) > writepkt,
llarp::Router* r, size_t numpaths, size_t hoplen)
: BaseSession(snodeRouter, writepkt, r, numpaths, hoplen){};
~ExitSession(){};
protected:
virtual void
PopulateRequest(llarp::routing::ObtainExitMessage& msg) const override
2018-11-29 13:12:35 +00:00
{
// TODO: set expiration time
msg.X = 0;
msg.E = 1;
}
};
struct SNodeSession final : public BaseSession
{
SNodeSession(const llarp::RouterID& snodeRouter,
std::function< bool(const llarp_buffer_t&) > writepkt,
llarp::Router* r, size_t numpaths, size_t hoplen,
bool useRouterSNodeKey = false);
2018-11-29 13:12:35 +00:00
~SNodeSession(){};
2018-11-29 13:12:35 +00:00
protected:
void
PopulateRequest(llarp::routing::ObtainExitMessage& msg) const override
2018-11-29 13:12:35 +00:00
{
// TODO: set expiration time
msg.X = 0;
msg.E = 0;
}
};
} // namespace exit
} // namespace llarp
2018-12-10 15:44:18 +00:00
#endif