|
|
@ -724,22 +724,21 @@ namespace data |
|
|
|
} |
|
|
|
} |
|
|
|
if (!found) |
|
|
|
if (!found) |
|
|
|
{ |
|
|
|
{ |
|
|
|
std::set<IdentHash> excludedRouters; |
|
|
|
std::set<IdentHash> excLudedrouters; |
|
|
|
|
|
|
|
const uint8_t * exclude_ident = excluded; |
|
|
|
for (int i = 0; i < numExcluded; i++) |
|
|
|
for (int i = 0; i < numExcluded; i++) |
|
|
|
{ |
|
|
|
{ |
|
|
|
excludedRouters.insert (excluded); |
|
|
|
excludedRouters.insert (exclude_ident); |
|
|
|
excluded += 32; |
|
|
|
exclude_ident += 32; |
|
|
|
} |
|
|
|
} |
|
|
|
closestFloodfills = GetClosestFloodfills (ident, 3, excludedRouters, true); |
|
|
|
closestFloodfills = GetClosestFloodfills (ident, 3, excludedRouters, true); |
|
|
|
if (!numExcluded) // save if no excluded
|
|
|
|
if (!numExcluded) // save if no excluded
|
|
|
|
m_LookupResponses[ident] = std::make_pair(closestFloodfills, i2p::util::GetSecondsSinceEpoch ()); |
|
|
|
m_LookupResponses[ident] = std::make_pair(closestFloodfills, i2p::util::GetSecondsSinceEpoch ()); |
|
|
|
} |
|
|
|
} |
|
|
|
else |
|
|
|
|
|
|
|
excluded += numExcluded * 32; |
|
|
|
|
|
|
|
replyMsg = CreateDatabaseSearchReply (ident, closestFloodfills); |
|
|
|
replyMsg = CreateDatabaseSearchReply (ident, closestFloodfills); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
excluded += numExcluded * 32; |
|
|
|
if (replyMsg) |
|
|
|
if (replyMsg) |
|
|
|
{ |
|
|
|
{ |
|
|
|
if (replyTunnelID) |
|
|
|
if (replyTunnelID) |
|
|
|