mirror of https://github.com/PurpleI2P/i2pd.git
I2P: End-to-End encrypted and anonymous Internet
https://i2pd.website/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
341 lines
10 KiB
341 lines
10 KiB
/* |
|
* 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 |
|
*/ |
|
|
|
#include <sys/stat.h> |
|
#include <unordered_map> |
|
#include <list> |
|
#include <thread> |
|
#include <boost/property_tree/ptree.hpp> |
|
#include <boost/property_tree/ini_parser.hpp> |
|
#include "Base.h" |
|
#include "FS.h" |
|
#include "Log.h" |
|
#include "Timestamp.h" |
|
#include "Profiling.h" |
|
|
|
namespace i2p |
|
{ |
|
namespace data |
|
{ |
|
static i2p::fs::HashedStorage g_ProfilesStorage("peerProfiles", "p", "profile-", "txt"); |
|
static std::unordered_map<i2p::data::IdentHash, std::shared_ptr<RouterProfile> > g_Profiles; |
|
static std::mutex g_ProfilesMutex; |
|
|
|
static boost::posix_time::ptime GetTime () |
|
{ |
|
return boost::posix_time::second_clock::local_time(); |
|
} |
|
|
|
RouterProfile::RouterProfile (): |
|
m_LastUpdateTime (GetTime ()), m_IsUpdated (false), |
|
m_LastDeclineTime (0), m_LastUnreachableTime (0), |
|
m_NumTunnelsAgreed (0), m_NumTunnelsDeclined (0), m_NumTunnelsNonReplied (0), |
|
m_NumTimesTaken (0), m_NumTimesRejected (0), m_HasConnected (false) |
|
{ |
|
} |
|
|
|
void RouterProfile::UpdateTime () |
|
{ |
|
m_LastUpdateTime = GetTime (); |
|
m_IsUpdated = true; |
|
} |
|
|
|
void RouterProfile::Save (const IdentHash& identHash) |
|
{ |
|
// fill sections |
|
boost::property_tree::ptree participation; |
|
participation.put (PEER_PROFILE_PARTICIPATION_AGREED, m_NumTunnelsAgreed); |
|
participation.put (PEER_PROFILE_PARTICIPATION_DECLINED, m_NumTunnelsDeclined); |
|
participation.put (PEER_PROFILE_PARTICIPATION_NON_REPLIED, m_NumTunnelsNonReplied); |
|
participation.put (PEER_PROFILE_USAGE_CONNECTED, m_HasConnected); |
|
boost::property_tree::ptree usage; |
|
usage.put (PEER_PROFILE_USAGE_TAKEN, m_NumTimesTaken); |
|
usage.put (PEER_PROFILE_USAGE_REJECTED, m_NumTimesRejected); |
|
// fill property tree |
|
boost::property_tree::ptree pt; |
|
pt.put (PEER_PROFILE_LAST_UPDATE_TIME, boost::posix_time::to_simple_string (m_LastUpdateTime)); |
|
if (m_LastUnreachableTime) |
|
pt.put (PEER_PROFILE_LAST_UNREACHABLE_TIME, m_LastUnreachableTime); |
|
pt.put_child (PEER_PROFILE_SECTION_PARTICIPATION, participation); |
|
pt.put_child (PEER_PROFILE_SECTION_USAGE, usage); |
|
|
|
// save to file |
|
std::string ident = identHash.ToBase64 (); |
|
std::string path = g_ProfilesStorage.Path(ident); |
|
|
|
try { |
|
boost::property_tree::write_ini (path, pt); |
|
} catch (std::exception& ex) { |
|
/* boost exception verbose enough */ |
|
LogPrint (eLogError, "Profiling: ", ex.what ()); |
|
} |
|
} |
|
|
|
void RouterProfile::Load (const IdentHash& identHash) |
|
{ |
|
std::string ident = identHash.ToBase64 (); |
|
std::string path = g_ProfilesStorage.Path(ident); |
|
boost::property_tree::ptree pt; |
|
|
|
if (!i2p::fs::Exists(path)) |
|
{ |
|
LogPrint(eLogWarning, "Profiling: No profile yet for ", ident); |
|
return; |
|
} |
|
|
|
try |
|
{ |
|
boost::property_tree::read_ini (path, pt); |
|
} catch (std::exception& ex) |
|
{ |
|
/* boost exception verbose enough */ |
|
LogPrint (eLogError, "Profiling: ", ex.what ()); |
|
return; |
|
} |
|
|
|
try |
|
{ |
|
auto t = pt.get (PEER_PROFILE_LAST_UPDATE_TIME, ""); |
|
if (t.length () > 0) |
|
m_LastUpdateTime = boost::posix_time::time_from_string (t); |
|
if ((GetTime () - m_LastUpdateTime).hours () < PEER_PROFILE_EXPIRATION_TIMEOUT) |
|
{ |
|
m_LastUnreachableTime = pt.get (PEER_PROFILE_LAST_UNREACHABLE_TIME, 0); |
|
try |
|
{ |
|
// read participations |
|
auto participations = pt.get_child (PEER_PROFILE_SECTION_PARTICIPATION); |
|
m_NumTunnelsAgreed = participations.get (PEER_PROFILE_PARTICIPATION_AGREED, 0); |
|
m_NumTunnelsDeclined = participations.get (PEER_PROFILE_PARTICIPATION_DECLINED, 0); |
|
m_NumTunnelsNonReplied = participations.get (PEER_PROFILE_PARTICIPATION_NON_REPLIED, 0); |
|
m_HasConnected = participations.get (PEER_PROFILE_USAGE_CONNECTED, false); |
|
} |
|
catch (boost::property_tree::ptree_bad_path& ex) |
|
{ |
|
LogPrint (eLogWarning, "Profiling: Missing section ", PEER_PROFILE_SECTION_PARTICIPATION, " in profile for ", ident); |
|
} |
|
try |
|
{ |
|
// read usage |
|
auto usage = pt.get_child (PEER_PROFILE_SECTION_USAGE); |
|
m_NumTimesTaken = usage.get (PEER_PROFILE_USAGE_TAKEN, 0); |
|
m_NumTimesRejected = usage.get (PEER_PROFILE_USAGE_REJECTED, 0); |
|
} |
|
catch (boost::property_tree::ptree_bad_path& ex) |
|
{ |
|
LogPrint (eLogWarning, "Profiling: Missing section ", PEER_PROFILE_SECTION_USAGE, " in profile for ", ident); |
|
} |
|
} |
|
else |
|
*this = RouterProfile (); |
|
} |
|
catch (std::exception& ex) |
|
{ |
|
LogPrint (eLogError, "Profiling: Can't read profile ", ident, " :", ex.what ()); |
|
} |
|
} |
|
|
|
void RouterProfile::TunnelBuildResponse (uint8_t ret) |
|
{ |
|
UpdateTime (); |
|
if (ret > 0) |
|
{ |
|
m_NumTunnelsDeclined++; |
|
m_LastDeclineTime = i2p::util::GetSecondsSinceEpoch (); |
|
} |
|
else |
|
{ |
|
m_NumTunnelsAgreed++; |
|
m_LastDeclineTime = 0; |
|
} |
|
} |
|
|
|
void RouterProfile::TunnelNonReplied () |
|
{ |
|
m_NumTunnelsNonReplied++; |
|
UpdateTime (); |
|
if (m_NumTunnelsNonReplied > 2*m_NumTunnelsAgreed && m_NumTunnelsNonReplied > 3) |
|
m_LastDeclineTime = i2p::util::GetSecondsSinceEpoch (); |
|
} |
|
|
|
void RouterProfile::Unreachable () |
|
{ |
|
m_LastUnreachableTime = i2p::util::GetSecondsSinceEpoch (); |
|
UpdateTime (); |
|
} |
|
|
|
void RouterProfile::Connected () |
|
{ |
|
m_HasConnected = true; |
|
UpdateTime (); |
|
} |
|
|
|
bool RouterProfile::IsLowPartcipationRate () const |
|
{ |
|
return 4*m_NumTunnelsAgreed < m_NumTunnelsDeclined; // < 20% rate |
|
} |
|
|
|
bool RouterProfile::IsLowReplyRate () const |
|
{ |
|
auto total = m_NumTunnelsAgreed + m_NumTunnelsDeclined; |
|
return m_NumTunnelsNonReplied > 10*(total + 1); |
|
} |
|
|
|
bool RouterProfile::IsDeclinedRecently () |
|
{ |
|
if (!m_LastDeclineTime) return false; |
|
auto ts = i2p::util::GetSecondsSinceEpoch (); |
|
if (ts > m_LastDeclineTime + PEER_PROFILE_DECLINED_RECENTLY_INTERVAL || |
|
ts + PEER_PROFILE_DECLINED_RECENTLY_INTERVAL < m_LastDeclineTime) |
|
m_LastDeclineTime = 0; |
|
return (bool)m_LastDeclineTime; |
|
} |
|
|
|
bool RouterProfile::IsBad () |
|
{ |
|
if (IsDeclinedRecently () || IsUnreachable ()) return true; |
|
auto isBad = IsAlwaysDeclining () || IsLowPartcipationRate () /*|| IsLowReplyRate ()*/; |
|
if (isBad && m_NumTimesRejected > 10*(m_NumTimesTaken + 1)) |
|
{ |
|
// reset profile |
|
m_NumTunnelsAgreed = 0; |
|
m_NumTunnelsDeclined = 0; |
|
m_NumTunnelsNonReplied = 0; |
|
isBad = false; |
|
} |
|
if (isBad) m_NumTimesRejected++; else m_NumTimesTaken++; |
|
return isBad; |
|
} |
|
|
|
bool RouterProfile::IsUnreachable () |
|
{ |
|
if (!m_LastUnreachableTime) return false; |
|
auto ts = i2p::util::GetSecondsSinceEpoch (); |
|
if (ts > m_LastUnreachableTime + PEER_PROFILE_UNREACHABLE_INTERVAL || |
|
ts + PEER_PROFILE_UNREACHABLE_INTERVAL < m_LastUnreachableTime) |
|
m_LastUnreachableTime = 0; |
|
return (bool)m_LastUnreachableTime; |
|
} |
|
|
|
std::shared_ptr<RouterProfile> GetRouterProfile (const IdentHash& identHash) |
|
{ |
|
{ |
|
std::unique_lock<std::mutex> l(g_ProfilesMutex); |
|
auto it = g_Profiles.find (identHash); |
|
if (it != g_Profiles.end ()) |
|
return it->second; |
|
} |
|
auto profile = std::make_shared<RouterProfile> (); |
|
profile->Load (identHash); // if possible |
|
std::unique_lock<std::mutex> l(g_ProfilesMutex); |
|
g_Profiles.emplace (identHash, profile); |
|
return profile; |
|
} |
|
|
|
void InitProfilesStorage () |
|
{ |
|
g_ProfilesStorage.SetPlace(i2p::fs::GetDataDir()); |
|
g_ProfilesStorage.Init(i2p::data::GetBase64SubstitutionTable(), 64); |
|
} |
|
|
|
void PersistProfiles () |
|
{ |
|
auto ts = GetTime (); |
|
std::list<std::pair<i2p::data::IdentHash, std::shared_ptr<RouterProfile> > > tmp; |
|
{ |
|
std::unique_lock<std::mutex> l(g_ProfilesMutex); |
|
for (auto it = g_Profiles.begin (); it != g_Profiles.end ();) |
|
{ |
|
if ((ts - it->second->GetLastUpdateTime ()).total_seconds () > PEER_PROFILE_PERSIST_INTERVAL) |
|
{ |
|
if (it->second->IsUpdated ()) |
|
tmp.push_back (std::make_pair (it->first, it->second)); |
|
it = g_Profiles.erase (it); |
|
} |
|
else |
|
it++; |
|
} |
|
} |
|
for (auto& it: tmp) |
|
if (it.second) it.second->Save (it.first); |
|
} |
|
|
|
void SaveProfiles () |
|
{ |
|
std::unordered_map<i2p::data::IdentHash, std::shared_ptr<RouterProfile> > tmp; |
|
{ |
|
std::unique_lock<std::mutex> l(g_ProfilesMutex); |
|
tmp = g_Profiles; |
|
g_Profiles.clear (); |
|
} |
|
auto ts = GetTime (); |
|
for (auto& it: tmp) |
|
if (it.second->IsUpdated () && (ts - it.second->GetLastUpdateTime ()).total_seconds () < PEER_PROFILE_EXPIRATION_TIMEOUT*3600) |
|
it.second->Save (it.first); |
|
} |
|
|
|
void DeleteObsoleteProfiles () |
|
{ |
|
{ |
|
auto ts = GetTime (); |
|
std::unique_lock<std::mutex> l(g_ProfilesMutex); |
|
for (auto it = g_Profiles.begin (); it != g_Profiles.end ();) |
|
{ |
|
if ((ts - it->second->GetLastUpdateTime ()).total_seconds () >= PEER_PROFILE_EXPIRATION_TIMEOUT*3600) |
|
it = g_Profiles.erase (it); |
|
else |
|
it++; |
|
} |
|
} |
|
|
|
struct stat st; |
|
std::time_t now = std::time(nullptr); |
|
|
|
std::vector<std::string> files; |
|
g_ProfilesStorage.Traverse(files); |
|
for (const auto& path: files) { |
|
if (stat(path.c_str(), &st) != 0) { |
|
LogPrint(eLogWarning, "Profiling: Can't stat(): ", path); |
|
continue; |
|
} |
|
if (now - st.st_mtime >= PEER_PROFILE_EXPIRATION_TIMEOUT*3600) { |
|
LogPrint(eLogDebug, "Profiling: Removing expired peer profile: ", path); |
|
i2p::fs::Remove(path); |
|
} |
|
} |
|
} |
|
|
|
// static keys |
|
|
|
struct StaticKeyProfile |
|
{ |
|
i2p::data::IdentHash ident; |
|
boost::posix_time::ptime lastUpdateTime; |
|
}; |
|
//static i2p::fs::HashedStorage g_StaticKeysProfilesStorage("statickeysProfiles", "s", "statickey-", "txt"); |
|
static std::unordered_map<i2p::data::Tag<32>, std::shared_ptr<StaticKeyProfile> > g_StaticKeysProfiles; |
|
static std::mutex g_StaticKeysProfilesMutex; |
|
|
|
bool CheckStaticKey (const i2p::data::Tag<32>& staticKey, const i2p::data::IdentHash& ident) |
|
{ |
|
std::unique_lock<std::mutex> l(g_StaticKeysProfilesMutex); |
|
auto it = g_StaticKeysProfiles.find (staticKey); |
|
if (it != g_StaticKeysProfiles.end ()) |
|
return it->second->ident == ident; |
|
return true; |
|
} |
|
|
|
void UpdateStaticKey (const i2p::data::Tag<32>& staticKey, const i2p::data::IdentHash& ident) |
|
{ |
|
std::unique_lock<std::mutex> l(g_StaticKeysProfilesMutex); |
|
auto res = g_StaticKeysProfiles.emplace (staticKey, std::make_shared<StaticKeyProfile>(StaticKeyProfile{ident, GetTime ()})); |
|
if (!res.second) |
|
res.first->second->lastUpdateTime = GetTime (); |
|
} |
|
} |
|
}
|
|
|