mirror of
https://github.com/PurpleI2P/i2pd.git
synced 2025-04-28 11:47:48 +02:00
request LeaseSet through destination's tunnels
This commit is contained in:
parent
6af5fa3d27
commit
05148a2579
4 changed files with 9 additions and 9 deletions
10
NetDb.cpp
10
NetDb.cpp
|
@ -368,7 +368,7 @@ namespace data
|
|||
i2p::tunnel::InboundTunnel * inbound = pool ? pool->GetNextInboundTunnel () :i2p::tunnel::tunnels.GetNextInboundTunnel ();
|
||||
if (inbound)
|
||||
{
|
||||
RequestedDestination * dest = CreateRequestedDestination (destination, isLeaseSet, pool);
|
||||
RequestedDestination * dest = CreateRequestedDestination (destination, true, false, pool);
|
||||
std::vector<i2p::tunnel::TunnelMessageBlock> msgs;
|
||||
// request 3 closests floodfills
|
||||
for (int i = 0; i < 3; i++)
|
||||
|
@ -401,7 +401,7 @@ namespace data
|
|||
}
|
||||
else // RouterInfo is requested directly
|
||||
{
|
||||
RequestedDestination * dest = CreateRequestedDestination (destination, false, pool);
|
||||
RequestedDestination * dest = CreateRequestedDestination (destination, false, false, pool);
|
||||
auto floodfill = GetClosestFloodfill (destination, dest->GetExcludedPeers ());
|
||||
if (floodfill)
|
||||
i2p::transports.SendMessage (floodfill->GetIdentHash (), dest->CreateRequestMessage (floodfill->GetIdentHash ()));
|
||||
|
@ -874,7 +874,7 @@ namespace data
|
|||
}
|
||||
else
|
||||
leaseSet->SetUnsolicited (false);
|
||||
m_Subscriptions.insert (ident);
|
||||
m_Subscriptions[ident] = pool;
|
||||
}
|
||||
|
||||
void NetDb::Unsubscribe (const IdentHash& ident)
|
||||
|
@ -886,11 +886,11 @@ namespace data
|
|||
{
|
||||
for (auto it : m_Subscriptions)
|
||||
{
|
||||
LeaseSet * leaseSet = FindLeaseSet (it);
|
||||
LeaseSet * leaseSet = FindLeaseSet (it.first);
|
||||
if (!leaseSet || leaseSet->HasExpiredLeases ())
|
||||
{
|
||||
LogPrint ("LeaseSet re-requested");
|
||||
RequestDestination (it, true);
|
||||
RequestDestination (it.first, true, it.second);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue