summaryrefslogtreecommitdiff
path: root/node
diff options
context:
space:
mode:
authorAdam Ierymenko <adam.ierymenko@gmail.com>2016-11-18 10:39:26 -0800
committerAdam Ierymenko <adam.ierymenko@gmail.com>2016-11-18 10:39:26 -0800
commit1fcbb1fbedad2d0aff567a0dda84a0985ba063cb (patch)
treecf021ac9fc4de0c98da685bdc51bdfc8ef670543 /node
parent39333c9e8ef3a11fdf2ccad3a5bc7c17ce697bd6 (diff)
downloadinfinitytier-1fcbb1fbedad2d0aff567a0dda84a0985ba063cb.tar.gz
infinitytier-1fcbb1fbedad2d0aff567a0dda84a0985ba063cb.zip
Proactively auto-load designated upstreams.
Diffstat (limited to 'node')
-rw-r--r--node/Topology.cpp65
1 files changed, 42 insertions, 23 deletions
diff --git a/node/Topology.cpp b/node/Topology.cpp
index 48ced7c5..81382e05 100644
--- a/node/Topology.cpp
+++ b/node/Topology.cpp
@@ -23,6 +23,7 @@
#include "Network.hpp"
#include "NetworkConfig.hpp"
#include "Buffer.hpp"
+#include "Switch.hpp"
namespace ZeroTier {
@@ -180,8 +181,8 @@ SharedPtr<Peer> Topology::getUpstreamPeer(const Address *avoid,unsigned int avoi
}
} else {
- /* If I am not a root server, the best root server is the active one with
- * the lowest quality score. (lower == better) */
+ /* Otherwise pick the best upstream from among roots and any other
+ * designated upstreams that we trust. */
unsigned int bestQualityOverall = ~((unsigned int)0);
unsigned int bestQualityNotAvoid = ~((unsigned int)0);
@@ -189,25 +190,34 @@ SharedPtr<Peer> Topology::getUpstreamPeer(const Address *avoid,unsigned int avoi
const SharedPtr<Peer> *bestNotAvoid = (const SharedPtr<Peer> *)0;
for(std::vector<Address>::const_iterator a(_upstreamAddresses.begin());a!=_upstreamAddresses.end();++a) {
- const SharedPtr<Peer> *const p = _peers.get(*a);
- if (p) {
- bool avoiding = false;
- for(unsigned int i=0;i<avoidCount;++i) {
- if (avoid[i] == (*p)->address()) {
- avoiding = true;
- break;
- }
- }
- const unsigned int q = (*p)->relayQuality(now);
- if (q <= bestQualityOverall) {
- bestQualityOverall = q;
- bestOverall = &(*p);
+ const SharedPtr<Peer> *p = _peers.get(*a);
+
+ if (!p) {
+ const Identity id(_getIdentity(*a));
+ if (id) {
+ p = &(_peers.set(*a,SharedPtr<Peer>(new Peer(RR,RR->identity,id))));
+ } else {
+ RR->sw->requestWhois(*a);
}
- if ((!avoiding)&&(q <= bestQualityNotAvoid)) {
- bestQualityNotAvoid = q;
- bestNotAvoid = &(*p);
+ continue; // always skip since even if we loaded it, it's not going to be ready
+ }
+
+ bool avoiding = false;
+ for(unsigned int i=0;i<avoidCount;++i) {
+ if (avoid[i] == (*p)->address()) {
+ avoiding = true;
+ break;
}
}
+ const unsigned int q = (*p)->relayQuality(now);
+ if (q <= bestQualityOverall) {
+ bestQualityOverall = q;
+ bestOverall = &(*p);
+ }
+ if ((!avoiding)&&(q <= bestQualityNotAvoid)) {
+ bestQualityNotAvoid = q;
+ bestNotAvoid = &(*p);
+ }
}
if (bestNotAvoid) {
@@ -238,8 +248,19 @@ void Topology::setUpstream(const Address &a,bool upstream)
Mutex::Lock _l(_lock);
if (std::find(_rootAddresses.begin(),_rootAddresses.end(),a) == _rootAddresses.end()) {
if (upstream) {
- if (std::find(_upstreamAddresses.begin(),_upstreamAddresses.end(),a) == _upstreamAddresses.end())
+ if (std::find(_upstreamAddresses.begin(),_upstreamAddresses.end(),a) == _upstreamAddresses.end()) {
_upstreamAddresses.push_back(a);
+
+ const SharedPtr<Peer> *p = _peers.get(a);
+ if (!p) {
+ const Identity id(_getIdentity(a));
+ if (id) {
+ _peers.set(a,SharedPtr<Peer>(new Peer(RR,RR->identity,id)));
+ } else {
+ RR->sw->requestWhois(a);
+ }
+ }
+ }
} else {
std::vector<Address> ua;
for(std::vector<Address>::iterator i(_upstreamAddresses.begin());i!=_upstreamAddresses.end();++i) {
@@ -326,10 +347,8 @@ void Topology::_setWorld(const World &newWorld)
_amRoot = true;
} else {
SharedPtr<Peer> *rp = _peers.get(r->identity.address());
- if (!rp) {
- SharedPtr<Peer> newrp(new Peer(RR,RR->identity,r->identity));
- _peers.set(r->identity.address(),newrp);
- }
+ if (!rp)
+ _peers.set(r->identity.address(),SharedPtr<Peer>(new Peer(RR,RR->identity,r->identity)));
}
}