i2pd/libi2pd/NetDbRequests.cpp

233 lines
7.1 KiB
C++
Raw Normal View History

/*
* Copyright (c) 2013-2024, 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
*/
2015-04-09 16:45:00 +00:00
#include "Log.h"
#include "I2NPProtocol.h"
#include "Transports.h"
#include "NetDb.hpp"
2015-04-09 16:45:00 +00:00
#include "NetDbRequests.h"
#include "ECIESX25519AEADRatchetSession.h"
2015-04-09 16:45:00 +00:00
namespace i2p
{
namespace data
{
RequestedDestination::RequestedDestination (const IdentHash& destination, bool isExploratory, bool direct):
m_Destination (destination), m_IsExploratory (isExploratory), m_IsDirect (direct),
m_CreationTime (i2p::util::GetSecondsSinceEpoch ()), m_LastRequestTime (0)
{
}
RequestedDestination::~RequestedDestination ()
{
if (m_RequestComplete) m_RequestComplete (nullptr);
}
2015-06-22 19:47:45 +00:00
std::shared_ptr<I2NPMessage> RequestedDestination::CreateRequestMessage (std::shared_ptr<const RouterInfo> router,
2015-04-09 16:45:00 +00:00
std::shared_ptr<const i2p::tunnel::InboundTunnel> replyTunnel)
{
2016-11-14 17:05:44 +00:00
std::shared_ptr<I2NPMessage> msg;
if(replyTunnel)
2018-01-06 03:48:51 +00:00
msg = i2p::CreateRouterInfoDatabaseLookupMsg (m_Destination,
replyTunnel->GetNextIdentHash (), replyTunnel->GetNextTunnelID (), m_IsExploratory,
&m_ExcludedPeers);
2016-11-14 17:05:44 +00:00
else
msg = i2p::CreateRouterInfoDatabaseLookupMsg(m_Destination, i2p::context.GetIdentHash(), 0, m_IsExploratory, &m_ExcludedPeers);
if(router)
m_ExcludedPeers.insert (router->GetIdentHash ());
m_LastRequestTime = i2p::util::GetSecondsSinceEpoch ();
2015-11-03 14:15:49 +00:00
return msg;
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
std::shared_ptr<I2NPMessage> RequestedDestination::CreateRequestMessage (const IdentHash& floodfill)
2015-04-09 16:45:00 +00:00
{
2018-01-06 03:48:51 +00:00
auto msg = i2p::CreateRouterInfoDatabaseLookupMsg (m_Destination,
2015-04-09 16:45:00 +00:00
i2p::context.GetRouterInfo ().GetIdentHash () , 0, false, &m_ExcludedPeers);
m_ExcludedPeers.insert (floodfill);
m_LastRequestTime = i2p::util::GetSecondsSinceEpoch ();
2015-11-03 14:15:49 +00:00
return msg;
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
void RequestedDestination::ClearExcludedPeers ()
{
m_ExcludedPeers.clear ();
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
void RequestedDestination::Success (std::shared_ptr<RouterInfo> r)
{
if (m_RequestComplete)
{
m_RequestComplete (r);
m_RequestComplete = nullptr;
}
}
void RequestedDestination::Fail ()
{
if (m_RequestComplete)
{
m_RequestComplete (nullptr);
m_RequestComplete = nullptr;
}
}
void NetDbRequests::Start ()
{
}
void NetDbRequests::Stop ()
{
m_RequestedDestinations.clear ();
}
std::shared_ptr<RequestedDestination> NetDbRequests::CreateRequest (const IdentHash& destination,
bool isExploratory, bool direct, RequestedDestination::RequestComplete requestComplete)
2015-04-09 16:45:00 +00:00
{
// request RouterInfo directly
auto dest = std::make_shared<RequestedDestination> (destination, isExploratory, direct);
2015-04-09 16:45:00 +00:00
dest->SetRequestComplete (requestComplete);
{
std::unique_lock<std::mutex> l(m_RequestedDestinationsMutex);
auto ret = m_RequestedDestinations.emplace (destination, dest);
if (!ret.second) // not inserted
{
dest->SetRequestComplete (nullptr); // don't call requestComplete in destructor
if (requestComplete)
{
auto prev = ret.first->second->GetRequestComplete ();
if (prev) // if already set
ret.first->second->SetRequestComplete (
[requestComplete, prev](std::shared_ptr<RouterInfo> r)
{
prev (r); // call previous
requestComplete (r); // then new
});
else
ret.first->second->SetRequestComplete (requestComplete);
}
if (i2p::util::GetSecondsSinceEpoch () > ret.first->second->GetLastRequestTime () + MIN_REQUEST_TIME)
if (!SendNextRequest (ret.first->second)) // try next floodfill
m_RequestedDestinations.erase (ret.first); // delete request if failed
2018-01-06 03:48:51 +00:00
return nullptr;
}
2015-04-09 16:45:00 +00:00
}
return dest;
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
void NetDbRequests::RequestComplete (const IdentHash& ident, std::shared_ptr<RouterInfo> r)
{
2016-08-16 02:36:58 +00:00
std::shared_ptr<RequestedDestination> request;
{
std::unique_lock<std::mutex> l(m_RequestedDestinationsMutex);
auto it = m_RequestedDestinations.find (ident);
if (it != m_RequestedDestinations.end ())
2018-01-06 03:48:51 +00:00
{
2016-08-16 02:36:58 +00:00
request = it->second;
m_RequestedDestinations.erase (it);
2018-01-06 03:48:51 +00:00
}
}
2016-08-16 02:36:58 +00:00
if (request)
{
2015-04-09 16:45:00 +00:00
if (r)
2016-08-16 02:36:58 +00:00
request->Success (r);
2015-04-09 16:45:00 +00:00
else
2016-08-16 02:36:58 +00:00
request->Fail ();
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
}
std::shared_ptr<RequestedDestination> NetDbRequests::FindRequest (const IdentHash& ident) const
{
2016-08-16 02:36:58 +00:00
std::unique_lock<std::mutex> l(m_RequestedDestinationsMutex);
2015-04-09 16:45:00 +00:00
auto it = m_RequestedDestinations.find (ident);
if (it != m_RequestedDestinations.end ())
return it->second;
return nullptr;
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
void NetDbRequests::ManageRequests ()
{
2018-01-06 03:48:51 +00:00
uint64_t ts = i2p::util::GetSecondsSinceEpoch ();
std::unique_lock<std::mutex> l(m_RequestedDestinationsMutex);
2015-04-09 16:45:00 +00:00
for (auto it = m_RequestedDestinations.begin (); it != m_RequestedDestinations.end ();)
{
auto& dest = it->second;
bool done = false;
if (ts < dest->GetCreationTime () + MAX_REQUEST_TIME) // request becomes worthless
2015-04-09 16:45:00 +00:00
{
if (ts > dest->GetLastRequestTime () + MIN_REQUEST_TIME) // try next floodfill if no response after min interval
done = !SendNextRequest (dest);
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
else // delete obsolete request
done = true;
if (done)
it = m_RequestedDestinations.erase (it);
else
2016-08-05 18:23:54 +00:00
++it;
2018-01-06 03:48:51 +00:00
}
2015-04-09 16:45:00 +00:00
}
bool NetDbRequests::SendNextRequest (std::shared_ptr<RequestedDestination> dest)
{
if (!dest) return false;
bool ret = true;
auto count = dest->GetExcludedPeers ().size ();
if (!dest->IsExploratory () && count < MAX_NUM_REQUEST_ATTEMPTS)
{
auto nextFloodfill = netdb.GetClosestFloodfill (dest->GetDestination (), dest->GetExcludedPeers ());
if (nextFloodfill)
{
bool direct = dest->IsDirect ();
if (direct && !nextFloodfill->IsReachableFrom (i2p::context.GetRouterInfo ()) &&
!i2p::transport::transports.IsConnected (nextFloodfill->GetIdentHash ()))
direct = false; // floodfill can't be reached directly
if (direct)
2024-01-30 00:54:43 +00:00
{
auto msg = dest->CreateRequestMessage (nextFloodfill->GetIdentHash ());
msg->onDrop = [this, dest]() { this->SendNextRequest (dest); };
i2p::transport::transports.SendMessage (nextFloodfill->GetIdentHash (), msg);
}
else
{
auto pool = i2p::tunnel::tunnels.GetExploratoryPool ();
auto outbound = pool->GetNextOutboundTunnel ();
auto inbound = pool->GetNextInboundTunnel ();
if (nextFloodfill && outbound && inbound)
{
LogPrint (eLogDebug, "NetDbReq: Try ", dest->GetDestination (), " at ", count, " floodfill ", nextFloodfill->GetIdentHash ().ToBase64 ());
auto msg = dest->CreateRequestMessage (nextFloodfill, inbound);
2024-01-30 20:41:57 +00:00
msg->onDrop = [this, dest]() { this->SendNextRequest (dest); };
outbound->SendTunnelDataMsgTo (nextFloodfill->GetIdentHash (), 0,
i2p::garlic::WrapECIESX25519MessageForRouter (msg, nextFloodfill->GetIdentity ()->GetEncryptionPublicKey ()));
}
else
{
ret = false;
if (!inbound) LogPrint (eLogWarning, "NetDbReq: No inbound tunnels");
if (!outbound) LogPrint (eLogWarning, "NetDbReq: No outbound tunnels");
}
}
}
else
{
ret = false;
if (!nextFloodfill) LogPrint (eLogWarning, "NetDbReq: No more floodfills");
}
}
else
{
if (!dest->IsExploratory ())
LogPrint (eLogWarning, "NetDbReq: ", dest->GetDestination ().ToBase64 (), " not found after 7 attempts");
ret = false;
}
return ret;
}
2015-04-09 16:45:00 +00:00
}
}