From a69e1876f10266e5578be0a469ae7498f705fe96 Mon Sep 17 00:00:00 2001 From: Adam Ierymenko Date: Thu, 2 Apr 2015 17:54:56 -0700 Subject: The concept of link desperation (escalating to less desirable transports) simplifies a ton of stuff. Loads of spaghetti logic can die since we no longer have to make these decisions down in the core. --- node/Topology.cpp | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) (limited to 'node/Topology.cpp') diff --git a/node/Topology.cpp b/node/Topology.cpp index 3687d4ee..99361cff 100644 --- a/node/Topology.cpp +++ b/node/Topology.cpp @@ -251,10 +251,7 @@ void Topology::clean(uint64_t now) for(std::map< Address,SharedPtr >::iterator p(_activePeers.begin());p!=_activePeers.end();) { if (((now - p->second->lastUsed()) >= ZT_PEER_IN_MEMORY_EXPIRATION)&&(std::find(_supernodeAddresses.begin(),_supernodeAddresses.end(),p->first) == _supernodeAddresses.end())) { _activePeers.erase(p++); - } else { - p->second->clean(now); - ++p; - } + } else ++p; } } -- cgit v1.2.3