i2pd/libi2pd/Transports.h

233 lines
7.9 KiB
C
Raw Normal View History

/*
2023-01-02 00:42:40 +00:00
* Copyright (c) 2013-2023, The PurpleI2P Project
*
* This file is part of Purple i2pd project and licensed under BSD3
*
* See full license text in LICENSE file at top of project tree
*/
2013-10-27 15:26:39 +00:00
#ifndef TRANSPORTS_H__
#define TRANSPORTS_H__
#include <thread>
2014-04-04 20:29:40 +00:00
#include <mutex>
#include <condition_variable>
2013-10-27 15:26:39 +00:00
#include <functional>
2020-06-29 22:19:31 +00:00
#include <unordered_map>
2015-01-21 02:05:57 +00:00
#include <vector>
2014-04-04 20:29:40 +00:00
#include <queue>
2013-10-27 15:26:39 +00:00
#include <string>
2014-11-25 21:30:15 +00:00
#include <memory>
2015-03-16 23:33:59 +00:00
#include <atomic>
2013-10-27 15:26:39 +00:00
#include <boost/asio.hpp>
2014-10-20 20:09:59 +00:00
#include "TransportSession.h"
2022-03-11 21:17:44 +00:00
#include "SSU2.h"
2018-07-13 19:59:28 +00:00
#include "NTCP2.h"
2013-10-27 15:26:39 +00:00
#include "RouterInfo.h"
#include "I2NPProtocol.h"
2014-04-04 17:30:13 +00:00
#include "Identity.h"
2013-10-27 15:26:39 +00:00
namespace i2p
{
namespace transport
2013-10-27 15:26:39 +00:00
{
template<typename Keys>
class EphemeralKeysSupplier
2014-04-04 20:29:40 +00:00
{
// called from this file only, so implementation is in Transports.cpp
2014-04-04 20:29:40 +00:00
public:
EphemeralKeysSupplier (int size);
~EphemeralKeysSupplier ();
2014-04-04 20:29:40 +00:00
void Start ();
void Stop ();
std::shared_ptr<Keys> Acquire ();
void Return (std::shared_ptr<Keys> pair);
2014-04-04 20:29:40 +00:00
private:
void Run ();
void CreateEphemeralKeys (int num);
2014-04-04 20:29:40 +00:00
private:
const int m_QueueSize;
std::queue<std::shared_ptr<Keys> > m_Queue;
2014-04-04 20:29:40 +00:00
bool m_IsRunning;
2017-05-29 05:28:16 +00:00
std::thread * m_Thread;
2014-04-04 20:29:40 +00:00
std::condition_variable m_Acquired;
std::mutex m_AcquiredMutex;
};
typedef EphemeralKeysSupplier<i2p::crypto::X25519Keys> X25519KeysPairSupplier;
const int PEER_ROUTER_INFO_UPDATE_INTERVAL = 31*60; // in seconds
const int PEER_ROUTER_INFO_UPDATE_INTERVAL_VARIANCE = 7*60; // in seconds
2023-01-02 00:42:40 +00:00
const size_t PEER_ROUTER_INFO_OVERLOAD_QUEUE_SIZE = 25;
2015-01-13 03:53:35 +00:00
struct Peer
{
2015-01-14 02:31:39 +00:00
int numAttempts;
2015-01-13 03:53:35 +00:00
std::shared_ptr<const i2p::data::RouterInfo> router;
std::list<std::shared_ptr<TransportSession> > sessions;
uint64_t creationTime, nextRouterInfoUpdateTime;
std::vector<std::shared_ptr<i2p::I2NPMessage> > delayedMessages;
2022-09-30 23:24:36 +00:00
std::vector<i2p::data::RouterInfo::SupportedTransports> priority;
bool isHighBandwidth;
2015-01-13 03:53:35 +00:00
2022-09-30 23:24:36 +00:00
Peer (std::shared_ptr<const i2p::data::RouterInfo> r, uint64_t ts):
numAttempts (0), router (r), creationTime (ts),
nextRouterInfoUpdateTime (ts + PEER_ROUTER_INFO_UPDATE_INTERVAL),
isHighBandwidth (false)
2022-09-30 23:24:36 +00:00
{
if (router)
isHighBandwidth = router->IsHighBandwidth ();
}
void Done ()
{
2016-08-08 22:53:37 +00:00
for (auto& it: sessions)
it->Done ();
2017-05-29 05:28:16 +00:00
}
void SetRouter (std::shared_ptr<const i2p::data::RouterInfo> r)
{
router = r;
if (router)
isHighBandwidth = router->IsHighBandwidth ();
}
2017-05-29 05:28:16 +00:00
};
const uint64_t SESSION_CREATION_TIMEOUT = 15; // in seconds
2016-11-13 14:14:05 +00:00
const int PEER_TEST_INTERVAL = 71; // in minutes
const int MAX_NUM_DELAYED_MESSAGES = 150;
2013-10-27 15:26:39 +00:00
class Transports
{
public:
Transports ();
~Transports ();
2022-11-23 00:29:20 +00:00
void Start (bool enableNTCP2=true, bool enableSSU2=true);
2013-10-27 15:26:39 +00:00
void Stop ();
2016-06-13 15:34:44 +00:00
bool IsBoundSSU2() const { return m_SSU2Server != nullptr; }
2018-08-10 19:35:43 +00:00
bool IsBoundNTCP2() const { return m_NTCP2Server != nullptr; }
2017-05-29 05:28:16 +00:00
2016-07-13 14:09:22 +00:00
bool IsOnline() const { return m_IsOnline; };
2020-10-11 21:51:40 +00:00
void SetOnline (bool online);
2016-07-13 14:09:22 +00:00
boost::asio::io_service& GetService () { return *m_Service; };
std::shared_ptr<i2p::crypto::X25519Keys> GetNextX25519KeysPair ();
void ReuseX25519KeysPair (std::shared_ptr<i2p::crypto::X25519Keys> pair);
2013-10-27 15:26:39 +00:00
2015-06-17 15:41:07 +00:00
void SendMessage (const i2p::data::IdentHash& ident, std::shared_ptr<i2p::I2NPMessage> msg);
void SendMessages (const i2p::data::IdentHash& ident, const std::vector<std::shared_ptr<i2p::I2NPMessage> >& msgs);
2015-01-13 03:53:35 +00:00
void PeerConnected (std::shared_ptr<TransportSession> session);
void PeerDisconnected (std::shared_ptr<TransportSession> session);
bool IsConnected (const i2p::data::IdentHash& ident) const;
2017-05-29 05:28:16 +00:00
2015-03-16 23:33:59 +00:00
void UpdateSentBytes (uint64_t numBytes) { m_TotalSentBytes += numBytes; };
void UpdateReceivedBytes (uint64_t numBytes) { m_TotalReceivedBytes += numBytes; };
uint64_t GetTotalSentBytes () const { return m_TotalSentBytes; };
2017-05-02 18:20:00 +00:00
uint64_t GetTotalReceivedBytes () const { return m_TotalReceivedBytes; };
uint64_t GetTotalTransitTransmittedBytes () const { return m_TotalTransitTransmittedBytes; }
void UpdateTotalTransitTransmittedBytes (uint32_t add) { m_TotalTransitTransmittedBytes += add; };
uint32_t GetInBandwidth () const { return m_InBandwidth; };
uint32_t GetOutBandwidth () const { return m_OutBandwidth; };
2017-05-02 18:20:00 +00:00
uint32_t GetTransitBandwidth () const { return m_TransitBandwidth; };
uint32_t GetInBandwidth15s () const { return m_InBandwidth15s; };
uint32_t GetOutBandwidth15s () const { return m_OutBandwidth15s; };
uint32_t GetTransitBandwidth15s () const { return m_TransitBandwidth15s; };
bool IsBandwidthExceeded () const;
bool IsTransitBandwidthExceeded () const;
size_t GetNumPeers () const { return m_Peers.size (); };
std::shared_ptr<const i2p::data::RouterInfo> GetRandomPeer (bool isHighBandwidth) const;
2015-03-17 19:19:38 +00:00
/** get a trusted first hop for restricted routes */
std::shared_ptr<const i2p::data::RouterInfo> GetRestrictedPeer() const;
/** do we want to use restricted routes? */
bool RoutesRestricted() const;
/** restrict routes to use only these router families for first hops */
2022-03-24 19:50:20 +00:00
void RestrictRoutesToFamilies(const std::set<std::string>& families);
/** restrict routes to use only these routers for first hops */
void RestrictRoutesToRouters(std::set<i2p::data::IdentHash> routers);
bool IsRestrictedPeer(const i2p::data::IdentHash & ident) const;
2017-05-29 05:28:16 +00:00
void PeerTest (bool ipv4 = true, bool ipv6 = true);
2017-05-29 05:28:16 +00:00
void SetCheckReserved (bool check) { m_CheckReserved = check; };
bool IsCheckReserved () { return m_CheckReserved; };
2013-10-27 15:26:39 +00:00
private:
2013-11-29 12:52:09 +00:00
void Run ();
void RequestComplete (std::shared_ptr<const i2p::data::RouterInfo> r, const i2p::data::IdentHash& ident);
void HandleRequestComplete (std::shared_ptr<const i2p::data::RouterInfo> r, i2p::data::IdentHash ident);
2015-06-17 15:41:07 +00:00
void PostMessages (i2p::data::IdentHash ident, std::vector<std::shared_ptr<i2p::I2NPMessage> > msgs);
2015-01-14 02:31:39 +00:00
bool ConnectToPeer (const i2p::data::IdentHash& ident, Peer& peer);
2022-09-30 23:24:36 +00:00
void SetPriority (Peer& peer) const;
2017-05-29 05:28:16 +00:00
void HandlePeerCleanupTimer (const boost::system::error_code& ecode);
2016-11-13 14:14:05 +00:00
void HandlePeerTestTimer (const boost::system::error_code& ecode);
void HandleUpdateBandwidthTimer (const boost::system::error_code& ecode);
2017-05-29 05:28:16 +00:00
2014-02-09 02:06:40 +00:00
void DetectExternalIP ();
2017-05-29 05:28:16 +00:00
2023-02-01 21:04:09 +00:00
template<typename Filter>
std::shared_ptr<const i2p::data::RouterInfo> GetRandomPeer (Filter filter) const;
2013-10-27 15:26:39 +00:00
private:
2020-10-11 21:51:40 +00:00
volatile bool m_IsOnline;
bool m_IsRunning, m_IsNAT, m_CheckReserved;
2017-05-29 05:28:16 +00:00
std::thread * m_Thread;
boost::asio::io_service * m_Service;
boost::asio::io_service::work * m_Work;
boost::asio::deadline_timer * m_PeerCleanupTimer, * m_PeerTestTimer, * m_UpdateBandwidthTimer;
2013-10-27 15:26:39 +00:00
2022-03-11 21:17:44 +00:00
SSU2Server * m_SSU2Server;
2018-07-13 19:59:28 +00:00
NTCP2Server * m_NTCP2Server;
2016-01-15 21:23:03 +00:00
mutable std::mutex m_PeersMutex;
2020-06-29 22:19:31 +00:00
std::unordered_map<i2p::data::IdentHash, Peer> m_Peers;
2017-05-29 05:28:16 +00:00
X25519KeysPairSupplier m_X25519KeysPairSupplier;
2015-03-17 19:19:38 +00:00
2017-05-02 18:20:00 +00:00
std::atomic<uint64_t> m_TotalSentBytes, m_TotalReceivedBytes, m_TotalTransitTransmittedBytes;
// Bandwidth per second
uint32_t m_InBandwidth, m_OutBandwidth, m_TransitBandwidth;
2017-05-29 05:28:16 +00:00
uint64_t m_LastInBandwidthUpdateBytes, m_LastOutBandwidthUpdateBytes, m_LastTransitBandwidthUpdateBytes;
// Bandwidth every 15 seconds
uint32_t m_InBandwidth15s, m_OutBandwidth15s, m_TransitBandwidth15s;
uint64_t m_LastInBandwidth15sUpdateBytes, m_LastOutBandwidth15sUpdateBytes, m_LastTransitBandwidth15sUpdateBytes;
uint64_t m_LastBandwidth15sUpdateTime;
2015-03-17 19:19:38 +00:00
2016-11-15 19:11:55 +00:00
/** which router families to trust for first hops */
2022-03-24 19:50:20 +00:00
std::vector<i2p::data::FamilyID> m_TrustedFamilies;
2016-11-15 19:11:55 +00:00
mutable std::mutex m_FamilyMutex;
2016-11-15 19:11:55 +00:00
/** which routers for first hop to trust */
std::vector<i2p::data::IdentHash> m_TrustedRouters;
mutable std::mutex m_TrustedRoutersMutex;
2017-05-29 05:28:16 +00:00
i2p::I2NPMessagesHandler m_LoopbackHandler;
2013-12-10 13:10:49 +00:00
public:
// for HTTP only
2018-07-13 19:59:28 +00:00
const NTCP2Server * GetNTCP2Server () const { return m_NTCP2Server; };
2022-03-27 23:29:50 +00:00
const SSU2Server * GetSSU2Server () const { return m_SSU2Server; };
2015-01-14 18:21:41 +00:00
const decltype(m_Peers)& GetPeers () const { return m_Peers; };
2017-05-29 05:28:16 +00:00
};
2013-10-27 15:26:39 +00:00
extern Transports transports;
void InitAddressFromIface ();
void InitTransports ();
2017-05-29 05:28:16 +00:00
}
}
2013-10-27 15:26:39 +00:00
#endif