mirror of
https://github.com/PurpleI2P/i2pd.git
synced 2025-01-11 17:37:53 +00:00
implement restricted routes (initial)
This commit is contained in:
parent
b9cbdb2dc4
commit
74a7e67002
10
Config.cpp
10
Config.cpp
@ -205,7 +205,12 @@ namespace config {
|
|||||||
#endif
|
#endif
|
||||||
"Enable or disable elgamal precomputation table")
|
"Enable or disable elgamal precomputation table")
|
||||||
;
|
;
|
||||||
|
|
||||||
|
options_description trust("Trust options");
|
||||||
|
trust.add_options()
|
||||||
|
("trust.enabled", value<bool>()->default_value(false), "enable explicit trust options")
|
||||||
|
("trust.family", value<std::string>()->default_value(""), "Router Familiy to trust for first hops");
|
||||||
|
|
||||||
m_OptionsDesc
|
m_OptionsDesc
|
||||||
.add(general)
|
.add(general)
|
||||||
.add(limits)
|
.add(limits)
|
||||||
@ -216,7 +221,8 @@ namespace config {
|
|||||||
.add(bob)
|
.add(bob)
|
||||||
.add(i2cp)
|
.add(i2cp)
|
||||||
.add(i2pcontrol)
|
.add(i2pcontrol)
|
||||||
.add(precomputation)
|
.add(precomputation)
|
||||||
|
.add(trust)
|
||||||
;
|
;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
16
Daemon.cpp
16
Daemon.cpp
@ -192,7 +192,19 @@ namespace i2p
|
|||||||
i2p::context.SetFamily (family);
|
i2p::context.SetFamily (family);
|
||||||
if (family.length () > 0)
|
if (family.length () > 0)
|
||||||
LogPrint(eLogInfo, "Daemon: family set to ", family);
|
LogPrint(eLogInfo, "Daemon: family set to ", family);
|
||||||
|
|
||||||
|
bool trust; i2p::config::GetOption("trust.enabled", trust);
|
||||||
|
if (trust)
|
||||||
|
{
|
||||||
|
LogPrint(eLogInfo, "Daemon: explicit trust enabled");
|
||||||
|
std::string fam; i2p::config::GetOption("trust.family", fam);
|
||||||
|
if (fam.length() > 0)
|
||||||
|
{
|
||||||
|
LogPrint(eLogInfo, "Daemon: setting restricted routes to use family ", fam);
|
||||||
|
i2p::transport::transports.RestrictRoutes({fam});
|
||||||
|
} else
|
||||||
|
LogPrint(eLogError, "Daemon: no family specified for restricted routes");
|
||||||
|
}
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -215,7 +227,7 @@ namespace i2p
|
|||||||
d.m_UPnP.Start ();
|
d.m_UPnP.Start ();
|
||||||
#endif
|
#endif
|
||||||
LogPrint(eLogInfo, "Daemon: starting Transports");
|
LogPrint(eLogInfo, "Daemon: starting Transports");
|
||||||
i2p::transport::transports.Start();
|
i2p::transport::transports.Start();
|
||||||
|
|
||||||
LogPrint(eLogInfo, "Daemon: starting Tunnels");
|
LogPrint(eLogInfo, "Daemon: starting Tunnels");
|
||||||
i2p::tunnel::tunnels.Start();
|
i2p::tunnel::tunnels.Start();
|
||||||
|
10
NetDb.cpp
10
NetDb.cpp
@ -851,7 +851,7 @@ namespace data
|
|||||||
{
|
{
|
||||||
if (m_RouterInfos.empty())
|
if (m_RouterInfos.empty())
|
||||||
return 0;
|
return 0;
|
||||||
uint32_t ind = rand () % m_RouterInfos.size ();
|
uint32_t ind = rand () % m_RouterInfos.size ();
|
||||||
for (int j = 0; j < 2; j++)
|
for (int j = 0; j < 2; j++)
|
||||||
{
|
{
|
||||||
uint32_t i = 0;
|
uint32_t i = 0;
|
||||||
@ -955,6 +955,14 @@ namespace data
|
|||||||
return res;
|
return res;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
std::shared_ptr<const RouterInfo> NetDb::GetRandomRouterInFamily(const std::string & fam) const {
|
||||||
|
return GetRandomRouter(
|
||||||
|
[fam](std::shared_ptr<const RouterInfo> router)->bool
|
||||||
|
{
|
||||||
|
return router->IsFamily(fam);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
std::shared_ptr<const RouterInfo> NetDb::GetClosestNonFloodfill (const IdentHash& destination,
|
std::shared_ptr<const RouterInfo> NetDb::GetClosestNonFloodfill (const IdentHash& destination,
|
||||||
const std::set<IdentHash>& excluded) const
|
const std::set<IdentHash>& excluded) const
|
||||||
{
|
{
|
||||||
|
5
NetDb.h
5
NetDb.h
@ -62,6 +62,7 @@ namespace data
|
|||||||
std::vector<IdentHash> GetClosestFloodfills (const IdentHash& destination, size_t num,
|
std::vector<IdentHash> GetClosestFloodfills (const IdentHash& destination, size_t num,
|
||||||
std::set<IdentHash>& excluded, bool closeThanUsOnly = false) const;
|
std::set<IdentHash>& excluded, bool closeThanUsOnly = false) const;
|
||||||
std::shared_ptr<const RouterInfo> GetClosestNonFloodfill (const IdentHash& destination, const std::set<IdentHash>& excluded) const;
|
std::shared_ptr<const RouterInfo> GetClosestNonFloodfill (const IdentHash& destination, const std::set<IdentHash>& excluded) const;
|
||||||
|
std::shared_ptr<const RouterInfo> GetRandomRouterInFamily(const std::string & fam) const;
|
||||||
void SetUnreachable (const IdentHash& ident, bool unreachable);
|
void SetUnreachable (const IdentHash& ident, bool unreachable);
|
||||||
|
|
||||||
void PostI2NPMsg (std::shared_ptr<const I2NPMessage> msg);
|
void PostI2NPMsg (std::shared_ptr<const I2NPMessage> msg);
|
||||||
@ -86,8 +87,8 @@ namespace data
|
|||||||
void ManageRequests ();
|
void ManageRequests ();
|
||||||
void ManageLookupResponses ();
|
void ManageLookupResponses ();
|
||||||
|
|
||||||
template<typename Filter>
|
template<typename Filter>
|
||||||
std::shared_ptr<const RouterInfo> GetRandomRouter (Filter filter) const;
|
std::shared_ptr<const RouterInfo> GetRandomRouter (Filter filter) const;
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
|
||||||
|
@ -290,7 +290,11 @@ namespace data
|
|||||||
|
|
||||||
if (!m_SupportedTransports || !m_Addresses.size() || (UsesIntroducer () && !introducers))
|
if (!m_SupportedTransports || !m_Addresses.size() || (UsesIntroducer () && !introducers))
|
||||||
SetUnreachable (true);
|
SetUnreachable (true);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
bool RouterInfo::IsFamily(const std::string & fam) const {
|
||||||
|
return m_Family == fam;
|
||||||
|
}
|
||||||
|
|
||||||
void RouterInfo::ExtractCaps (const char * value)
|
void RouterInfo::ExtractCaps (const char * value)
|
||||||
{
|
{
|
||||||
|
@ -171,6 +171,9 @@ namespace data
|
|||||||
void DeleteBuffer () { delete[] m_Buffer; m_Buffer = nullptr; };
|
void DeleteBuffer () { delete[] m_Buffer; m_Buffer = nullptr; };
|
||||||
bool IsNewer (const uint8_t * buf, size_t len) const;
|
bool IsNewer (const uint8_t * buf, size_t len) const;
|
||||||
|
|
||||||
|
/** return true if we are in a router family and the signature is valid */
|
||||||
|
bool IsFamily(const std::string & fam) const;
|
||||||
|
|
||||||
// implements RoutingDestination
|
// implements RoutingDestination
|
||||||
const IdentHash& GetIdentHash () const { return m_RouterIdentity->GetIdentHash (); };
|
const IdentHash& GetIdentHash () const { return m_RouterIdentity->GetIdentHash (); };
|
||||||
const uint8_t * GetEncryptionPublicKey () const { return m_RouterIdentity->GetStandardIdentity ().publicKey; };
|
const uint8_t * GetEncryptionPublicKey () const { return m_RouterIdentity->GetStandardIdentity ().publicKey; };
|
||||||
|
@ -612,6 +612,30 @@ namespace transport
|
|||||||
std::advance (it, rand () % m_Peers.size ());
|
std::advance (it, rand () % m_Peers.size ());
|
||||||
return it != m_Peers.end () ? it->second.router : nullptr;
|
return it != m_Peers.end () ? it->second.router : nullptr;
|
||||||
}
|
}
|
||||||
|
void Transports::RestrictRoutes(std::vector<std::string> families)
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(m_FamilyMutex);
|
||||||
|
m_TrustedFamilies.clear();
|
||||||
|
for ( auto fam : families )
|
||||||
|
m_TrustedFamilies.push_back(fam);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool Transports::RoutesRestricted() const {
|
||||||
|
std::lock_guard<std::mutex> lock(m_FamilyMutex);
|
||||||
|
return m_TrustedFamilies.size() > 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** XXX: if routes are not restricted this dies */
|
||||||
|
std::shared_ptr<const i2p::data::RouterInfo> Transports::GetRestrictedPeer() const {
|
||||||
|
std::string fam;
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(m_FamilyMutex);
|
||||||
|
// TODO: random family (?)
|
||||||
|
fam = m_TrustedFamilies[0];
|
||||||
|
}
|
||||||
|
boost::to_lower(fam);
|
||||||
|
return i2p::data::netdb.GetRandomRouterInFamily(fam);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
11
Transports.h
11
Transports.h
@ -98,6 +98,13 @@ namespace transport
|
|||||||
size_t GetNumPeers () const { return m_Peers.size (); };
|
size_t GetNumPeers () const { return m_Peers.size (); };
|
||||||
std::shared_ptr<const i2p::data::RouterInfo> GetRandomPeer () const;
|
std::shared_ptr<const i2p::data::RouterInfo> GetRandomPeer () const;
|
||||||
|
|
||||||
|
/** 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 */
|
||||||
|
void RestrictRoutes(std::vector<std::string> families);
|
||||||
|
|
||||||
void PeerTest ();
|
void PeerTest ();
|
||||||
|
|
||||||
private:
|
private:
|
||||||
@ -140,6 +147,10 @@ namespace transport
|
|||||||
uint64_t m_LastInBandwidthUpdateBytes, m_LastOutBandwidthUpdateBytes;
|
uint64_t m_LastInBandwidthUpdateBytes, m_LastOutBandwidthUpdateBytes;
|
||||||
uint64_t m_LastBandwidthUpdateTime;
|
uint64_t m_LastBandwidthUpdateTime;
|
||||||
|
|
||||||
|
/** which router families to trust for first hops */
|
||||||
|
std::vector<std::string> m_TrustedFamilies;
|
||||||
|
mutable std::mutex m_FamilyMutex;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|
||||||
// for HTTP only
|
// for HTTP only
|
||||||
|
@ -331,9 +331,10 @@ namespace tunnel
|
|||||||
if (m_ExplicitPeers) return SelectExplicitPeers (peers, isInbound);
|
if (m_ExplicitPeers) return SelectExplicitPeers (peers, isInbound);
|
||||||
auto prevHop = i2p::context.GetSharedRouterInfo ();
|
auto prevHop = i2p::context.GetSharedRouterInfo ();
|
||||||
int numHops = isInbound ? m_NumInboundHops : m_NumOutboundHops;
|
int numHops = isInbound ? m_NumInboundHops : m_NumOutboundHops;
|
||||||
|
int firstHop = numHops - 1;
|
||||||
if (i2p::transport::transports.GetNumPeers () > 25)
|
if (i2p::transport::transports.GetNumPeers () > 25)
|
||||||
{
|
{
|
||||||
auto r = i2p::transport::transports.GetRandomPeer ();
|
auto r = i2p::transport::transports.GetRandomPeer ();
|
||||||
if (r && !r->GetProfile ()->IsBad ())
|
if (r && !r->GetProfile ()->IsBad ())
|
||||||
{
|
{
|
||||||
prevHop = r;
|
prevHop = r;
|
||||||
@ -352,7 +353,14 @@ namespace tunnel
|
|||||||
}
|
}
|
||||||
prevHop = hop;
|
prevHop = hop;
|
||||||
peers.push_back (hop->GetRouterIdentity ());
|
peers.push_back (hop->GetRouterIdentity ());
|
||||||
}
|
}
|
||||||
|
if(i2p::transport::transports.RoutesRestricted())
|
||||||
|
{
|
||||||
|
auto r = i2p::transport::transports.GetRestrictedPeer();
|
||||||
|
/* replace first hop with restricted router */
|
||||||
|
if(!r) return false;
|
||||||
|
peers[firstHop] = r->GetRouterIdentity();
|
||||||
|
}
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user