i2pd/libi2pd/NetDb.hpp

164 lines
6.5 KiB
C++
Raw Normal View History

2013-11-13 12:59:21 +00:00
#ifndef NETDB_H__
#define NETDB_H__
// this file is called NetDb.hpp to resolve conflict with libc's netdb.h on case insensitive fs
2013-11-13 12:59:21 +00:00
#include <inttypes.h>
2014-01-05 14:53:44 +00:00
#include <set>
2013-11-13 12:59:21 +00:00
#include <map>
2014-11-21 18:02:46 +00:00
#include <list>
2013-11-13 12:59:21 +00:00
#include <string>
2013-11-19 01:37:38 +00:00
#include <thread>
2014-10-06 01:59:05 +00:00
#include <mutex>
2015-11-03 14:15:49 +00:00
#include "Base.h"
#include "Gzip.h"
#include "FS.h"
2013-11-20 12:46:09 +00:00
#include "Queue.h"
#include "I2NPProtocol.h"
2013-11-13 12:59:21 +00:00
#include "RouterInfo.h"
#include "LeaseSet.h"
2013-12-25 17:19:46 +00:00
#include "Tunnel.h"
2014-08-20 15:12:53 +00:00
#include "TunnelPool.h"
2015-01-19 18:57:37 +00:00
#include "Reseed.h"
2015-04-09 16:45:00 +00:00
#include "NetDbRequests.h"
2016-02-18 20:57:43 +00:00
#include "Family.h"
2013-11-13 12:59:21 +00:00
namespace i2p
{
namespace data
2018-01-06 03:48:51 +00:00
{
2016-02-24 16:31:14 +00:00
const int NETDB_MIN_ROUTERS = 90;
const int NETDB_FLOODFILL_EXPIRATION_TIMEOUT = 60*60; // 1 hour, in seconds
const int NETDB_INTRODUCEE_EXPIRATION_TIMEOUT = 65*60;
const int NETDB_MIN_EXPIRATION_TIMEOUT = 90*60; // 1.5 hours
const int NETDB_MAX_EXPIRATION_TIMEOUT = 27*60*60; // 27 hours
2016-06-30 16:27:23 +00:00
const int NETDB_PUBLISH_INTERVAL = 60*40;
2016-07-15 13:38:21 +00:00
2016-07-15 17:52:55 +00:00
/** function for visiting a leaseset stored in a floodfill */
typedef std::function<void(const IdentHash, std::shared_ptr<LeaseSet>)> LeaseSetVisitor;
2016-08-29 18:16:29 +00:00
/** function for visiting a router info we have locally */
2018-01-06 03:48:51 +00:00
typedef std::function<void(std::shared_ptr<const i2p::data::RouterInfo>)> RouterInfoVisitor;
2016-08-30 19:54:53 +00:00
/** function for visiting a router info and determining if we want to use it */
2016-08-30 23:59:24 +00:00
typedef std::function<bool(std::shared_ptr<const i2p::data::RouterInfo>)> RouterInfoFilter;
2018-01-06 03:48:51 +00:00
2013-11-13 12:59:21 +00:00
class NetDb
{
public:
NetDb ();
~NetDb ();
2013-11-19 01:37:38 +00:00
void Start ();
void Stop ();
2018-01-06 03:48:51 +00:00
2016-02-17 20:36:55 +00:00
bool AddRouterInfo (const uint8_t * buf, int len);
bool AddRouterInfo (const IdentHash& ident, const uint8_t * buf, int len);
bool AddLeaseSet (const IdentHash& ident, const uint8_t * buf, int len);
2018-12-21 20:00:03 +00:00
bool AddLeaseSet2 (const IdentHash& ident, const uint8_t * buf, int len, uint8_t storeType);
std::shared_ptr<RouterInfo> FindRouter (const IdentHash& ident) const;
2015-01-27 16:27:58 +00:00
std::shared_ptr<LeaseSet> FindLeaseSet (const IdentHash& destination) const;
2015-11-03 14:15:49 +00:00
std::shared_ptr<RouterProfile> FindRouterProfile (const IdentHash& ident) const;
2014-03-13 20:26:04 +00:00
2018-01-06 03:48:51 +00:00
void RequestDestination (const IdentHash& destination, RequestedDestination::RequestComplete requestComplete = nullptr);
void RequestDestinationFrom (const IdentHash& destination, const IdentHash & from, bool exploritory, RequestedDestination::RequestComplete requestComplete = nullptr);
2015-07-04 01:27:40 +00:00
void HandleDatabaseStoreMsg (std::shared_ptr<const I2NPMessage> msg);
void HandleDatabaseSearchReplyMsg (std::shared_ptr<const I2NPMessage> msg);
2018-01-06 03:48:51 +00:00
void HandleDatabaseLookupMsg (std::shared_ptr<const I2NPMessage> msg);
2018-11-21 16:23:48 +00:00
void HandleNTCP2RouterInfoMsg (std::shared_ptr<const I2NPMessage> m);
2014-11-20 21:20:02 +00:00
std::shared_ptr<const RouterInfo> GetRandomRouter () const;
std::shared_ptr<const RouterInfo> GetRandomRouter (std::shared_ptr<const RouterInfo> compatibleWith) const;
std::shared_ptr<const RouterInfo> GetHighBandwidthRandomRouter (std::shared_ptr<const RouterInfo> compatibleWith) const;
2016-12-02 16:17:22 +00:00
std::shared_ptr<const RouterInfo> GetRandomPeerTestRouter (bool v4only = true) const;
2019-05-23 19:59:44 +00:00
std::shared_ptr<const RouterInfo> GetRandomSSUV6Router () const; // TODO: change to v6 peer test later
2015-02-27 02:05:35 +00:00
std::shared_ptr<const RouterInfo> GetRandomIntroducer () const;
std::shared_ptr<const RouterInfo> GetClosestFloodfill (const IdentHash& destination, const std::set<IdentHash>& excluded, bool closeThanUsOnly = false) const;
2015-06-11 15:43:35 +00:00
std::vector<IdentHash> GetClosestFloodfills (const IdentHash& destination, size_t num,
std::set<IdentHash>& excluded, bool closeThanUsOnly = false) const;
2015-02-03 03:34:55 +00:00
std::shared_ptr<const RouterInfo> GetClosestNonFloodfill (const IdentHash& destination, const std::set<IdentHash>& excluded) const;
2016-06-17 15:03:33 +00:00
std::shared_ptr<const RouterInfo> GetRandomRouterInFamily(const std::string & fam) const;
2018-01-06 03:48:51 +00:00
void SetUnreachable (const IdentHash& ident, bool unreachable);
2014-10-24 19:39:53 +00:00
2015-07-04 01:27:40 +00:00
void PostI2NPMsg (std::shared_ptr<const I2NPMessage> msg);
/** set hidden mode, aka don't publish our RI to netdb and don't explore */
2018-01-06 03:48:51 +00:00
void SetHidden(bool hide);
2015-01-19 18:57:37 +00:00
void Reseed ();
Families& GetFamilies () { return m_Families; };
2015-01-19 18:57:37 +00:00
2015-04-05 17:56:41 +00:00
// for web interface
int GetNumRouters () const { return m_RouterInfos.size (); };
int GetNumFloodfills () const { return m_Floodfills.size (); };
int GetNumLeaseSets () const { return m_LeaseSets.size (); };
2016-07-15 13:38:21 +00:00
2016-07-15 17:52:55 +00:00
/** visit all lease sets we currently store */
void VisitLeaseSets(LeaseSetVisitor v);
2016-08-29 18:16:29 +00:00
/** visit all router infos we have currently on disk, usually insanely expensive, does not access in memory RI */
void VisitStoredRouterInfos(RouterInfoVisitor v);
/** visit all router infos we have loaded in memory, cheaper than VisitLocalRouterInfos but locks access while visiting */
void VisitRouterInfos(RouterInfoVisitor v);
2016-08-30 19:54:53 +00:00
/** visit N random router that match using filter, then visit them with a visitor, return number of RouterInfos that were visited */
size_t VisitRandomRouterInfos(RouterInfoFilter f, RouterInfoVisitor v, size_t n);
2016-11-14 17:05:44 +00:00
2016-11-14 21:23:42 +00:00
void ClearRouterInfos () { m_RouterInfos.clear (); };
2013-11-13 12:59:21 +00:00
private:
void Load ();
2016-02-11 00:00:00 +00:00
bool LoadRouterInfo (const std::string & path);
void SaveUpdated ();
2013-11-19 01:37:38 +00:00
void Run (); // exploratory thread
2018-01-06 03:48:51 +00:00
void Explore (int numDestinations);
2014-02-13 03:02:39 +00:00
void Publish ();
2018-11-21 18:24:54 +00:00
void Flood (const IdentHash& ident, std::shared_ptr<I2NPMessage> floodMsg);
2014-07-31 16:59:43 +00:00
void ManageLeaseSets ();
2014-12-24 16:20:38 +00:00
void ManageRequests ();
2014-01-05 14:53:44 +00:00
2018-11-21 18:24:54 +00:00
void ReseedFromFloodfill(const RouterInfo & ri, int numRouters=40, int numFloodfills=20);
2018-01-06 03:48:51 +00:00
2018-11-21 18:24:54 +00:00
std::shared_ptr<const RouterInfo> AddRouterInfo (const uint8_t * buf, int len, bool& updated);
std::shared_ptr<const RouterInfo> AddRouterInfo (const IdentHash& ident, const uint8_t * buf, int len, bool& updated);
template<typename Filter>
std::shared_ptr<const RouterInfo> GetRandomRouter (Filter filter) const;
2018-01-06 03:48:51 +00:00
2013-11-13 12:59:21 +00:00
private:
2018-01-06 03:48:51 +00:00
2016-07-15 17:52:55 +00:00
mutable std::mutex m_LeaseSetsMutex;
2015-01-27 16:27:58 +00:00
std::map<IdentHash, std::shared_ptr<LeaseSet> > m_LeaseSets;
2014-11-21 18:29:19 +00:00
mutable std::mutex m_RouterInfosMutex;
2014-11-18 16:08:10 +00:00
std::map<IdentHash, std::shared_ptr<RouterInfo> > m_RouterInfos;
2014-10-06 01:59:05 +00:00
mutable std::mutex m_FloodfillsMutex;
2014-11-21 18:02:46 +00:00
std::list<std::shared_ptr<RouterInfo> > m_Floodfills;
2018-01-06 03:48:51 +00:00
2013-11-19 01:37:38 +00:00
bool m_IsRunning;
2016-02-11 00:00:00 +00:00
uint64_t m_LastLoad;
2018-01-06 03:48:51 +00:00
std::thread * m_Thread;
2015-07-04 01:27:40 +00:00
i2p::util::Queue<std::shared_ptr<const I2NPMessage> > m_Queue; // of I2NPDatabaseStoreMsg
2014-02-01 20:57:46 +00:00
2015-11-03 14:15:49 +00:00
GzipInflator m_Inflator;
2015-01-19 18:57:37 +00:00
Reseeder * m_Reseeder;
2016-02-18 20:57:43 +00:00
Families m_Families;
i2p::fs::HashedStorage m_Storage;
2015-01-19 18:57:37 +00:00
2018-01-06 03:48:51 +00:00
friend class NetDbRequests;
2015-04-09 16:45:00 +00:00
NetDbRequests m_Requests;
2016-03-22 17:10:02 +00:00
bool m_PersistProfiles;
2016-11-14 17:05:44 +00:00
/** router info we are bootstrapping from or nullptr if we are not currently doing that*/
std::shared_ptr<RouterInfo> m_FloodfillBootstrap;
2018-01-06 03:48:51 +00:00
/** true if in hidden mode */
bool m_HiddenMode;
2013-11-13 12:59:21 +00:00
};
extern NetDb netdb;
}
}
#endif