2013-07-04 20:56:19 +00:00
|
|
|
/*
|
2015-02-17 21:11:34 +00:00
|
|
|
* ZeroTier One - Network Virtualization Everywhere
|
2016-01-12 22:04:55 +00:00
|
|
|
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
|
2013-07-04 20:56:19 +00:00
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2013-12-07 00:49:20 +00:00
|
|
|
#ifndef ZT_TOPOLOGY_HPP
|
|
|
|
#define ZT_TOPOLOGY_HPP
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-07-06 18:58:34 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
2013-09-17 19:53:59 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
#include <vector>
|
|
|
|
#include <stdexcept>
|
2014-10-14 23:38:27 +00:00
|
|
|
#include <algorithm>
|
2015-10-13 15:49:36 +00:00
|
|
|
#include <utility>
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-10-05 14:19:12 +00:00
|
|
|
#include "Constants.hpp"
|
2016-07-12 15:29:50 +00:00
|
|
|
#include "../include/ZeroTierOne.h"
|
2014-08-14 23:52:22 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Address.hpp"
|
2014-08-14 23:52:22 +00:00
|
|
|
#include "Identity.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Peer.hpp"
|
2016-09-01 22:43:07 +00:00
|
|
|
#include "Path.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Mutex.hpp"
|
|
|
|
#include "InetAddress.hpp"
|
2015-09-04 19:14:21 +00:00
|
|
|
#include "Hashtable.hpp"
|
2015-10-13 01:25:29 +00:00
|
|
|
#include "World.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
|
|
|
|
namespace ZeroTier {
|
|
|
|
|
|
|
|
class RuntimeEnvironment;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Database of network topology
|
|
|
|
*/
|
2013-08-05 20:06:16 +00:00
|
|
|
class Topology
|
2013-07-04 20:56:19 +00:00
|
|
|
{
|
|
|
|
public:
|
2014-10-13 21:12:51 +00:00
|
|
|
Topology(const RuntimeEnvironment *renv);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
|
|
|
/**
|
2013-10-05 14:19:12 +00:00
|
|
|
* Add a peer to database
|
2013-07-04 20:56:19 +00:00
|
|
|
*
|
2013-10-05 14:19:12 +00:00
|
|
|
* This will not replace existing peers. In that case the existing peer
|
|
|
|
* record is returned.
|
|
|
|
*
|
|
|
|
* @param peer Peer to add
|
|
|
|
* @return New or existing peer (should replace 'peer')
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2013-10-05 14:19:12 +00:00
|
|
|
SharedPtr<Peer> addPeer(const SharedPtr<Peer> &peer);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Get a peer from its address
|
2015-07-28 00:02:43 +00:00
|
|
|
*
|
2013-07-04 20:56:19 +00:00
|
|
|
* @param zta ZeroTier address of peer
|
|
|
|
* @return Peer or NULL if not found
|
|
|
|
*/
|
2014-10-13 21:12:51 +00:00
|
|
|
SharedPtr<Peer> getPeer(const Address &zta);
|
2013-10-21 18:12:00 +00:00
|
|
|
|
2015-10-27 23:52:44 +00:00
|
|
|
/**
|
|
|
|
* Get a peer only if it is presently in memory (no disk cache)
|
|
|
|
*
|
2015-11-02 23:38:53 +00:00
|
|
|
* This also does not update the lastUsed() time for peers, which means
|
|
|
|
* that it won't prevent them from falling out of RAM. This is currently
|
|
|
|
* used in the Cluster code to update peer info without forcing all peers
|
|
|
|
* across the entire cluster to remain in memory cache.
|
|
|
|
*
|
2015-10-27 23:52:44 +00:00
|
|
|
* @param zta ZeroTier address
|
|
|
|
*/
|
2015-11-06 01:22:22 +00:00
|
|
|
inline SharedPtr<Peer> getPeerNoCache(const Address &zta)
|
2015-10-27 23:52:44 +00:00
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_peers_m);
|
2015-10-30 20:39:28 +00:00
|
|
|
const SharedPtr<Peer> *const ap = _peers.get(zta);
|
2015-11-02 23:38:53 +00:00
|
|
|
if (ap)
|
2015-10-27 23:52:44 +00:00
|
|
|
return *ap;
|
|
|
|
return SharedPtr<Peer>();
|
|
|
|
}
|
|
|
|
|
2016-09-01 22:43:07 +00:00
|
|
|
/**
|
|
|
|
* Get a Path object for a given local and remote physical address, creating if needed
|
|
|
|
*
|
|
|
|
* @param l Local address or NULL for 'any' or 'wildcard'
|
|
|
|
* @param r Remote address
|
|
|
|
* @return Pointer to canonicalized Path object
|
|
|
|
*/
|
|
|
|
inline SharedPtr<Path> getPath(const InetAddress &l,const InetAddress &r)
|
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_paths_m);
|
2016-09-01 22:43:07 +00:00
|
|
|
SharedPtr<Path> &p = _paths[Path::HashKey(l,r)];
|
|
|
|
if (!p)
|
|
|
|
p.setToUnsafe(new Path(l,r));
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2015-10-14 21:12:12 +00:00
|
|
|
/**
|
|
|
|
* Get the identity of a peer
|
|
|
|
*
|
|
|
|
* @param zta ZeroTier address of peer
|
|
|
|
* @return Identity or NULL Identity if not found
|
|
|
|
*/
|
|
|
|
Identity getIdentity(const Address &zta);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Cache an identity
|
|
|
|
*
|
|
|
|
* This is done automatically on addPeer(), and so is only useful for
|
|
|
|
* cluster identity replication.
|
|
|
|
*
|
|
|
|
* @param id Identity to cache
|
|
|
|
*/
|
|
|
|
void saveIdentity(const Identity &id);
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
2016-11-18 00:20:41 +00:00
|
|
|
* Get the current best upstream peer
|
2015-07-28 00:02:43 +00:00
|
|
|
*
|
2015-06-19 17:23:25 +00:00
|
|
|
* @return Root server with lowest latency or NULL if none
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2016-11-18 00:20:41 +00:00
|
|
|
inline SharedPtr<Peer> getUpstreamPeer() { return getUpstreamPeer((const Address *)0,0,false); }
|
2013-07-04 20:56:19 +00:00
|
|
|
|
|
|
|
/**
|
2016-11-18 00:20:41 +00:00
|
|
|
* Get the current best upstream peer, avoiding those in the supplied avoid list
|
2015-07-28 00:02:43 +00:00
|
|
|
*
|
2013-07-04 20:56:19 +00:00
|
|
|
* @param avoid Nodes to avoid
|
|
|
|
* @param avoidCount Number of nodes to avoid
|
2015-06-19 17:23:25 +00:00
|
|
|
* @param strictAvoid If false, consider avoided root servers anyway if no non-avoid root servers are available
|
|
|
|
* @return Root server or NULL if none available
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2016-11-18 00:20:41 +00:00
|
|
|
SharedPtr<Peer> getUpstreamPeer(const Address *avoid,unsigned int avoidCount,bool strictAvoid);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2015-10-19 19:56:29 +00:00
|
|
|
/**
|
|
|
|
* @param id Identity to check
|
|
|
|
* @return True if this is a root server or a network preferred relay from one of our networks
|
|
|
|
*/
|
|
|
|
bool isUpstream(const Identity &id) const;
|
|
|
|
|
2016-11-18 00:20:41 +00:00
|
|
|
/**
|
2017-01-27 21:27:52 +00:00
|
|
|
* @param ztaddr ZeroTier address
|
|
|
|
* @return Peer role for this device
|
2016-11-18 00:20:41 +00:00
|
|
|
*/
|
2017-01-27 21:27:52 +00:00
|
|
|
ZT_PeerRole role(const Address &ztaddr) const;
|
2016-11-18 00:20:41 +00:00
|
|
|
|
2016-12-06 00:09:42 +00:00
|
|
|
/**
|
|
|
|
* Check for prohibited endpoints
|
|
|
|
*
|
|
|
|
* Right now this returns true if the designated ZT address is a root and if
|
|
|
|
* the IP (IP only, not port) does not equal any of the IPs defined in the
|
|
|
|
* current World. This is an extra little security feature in case root keys
|
|
|
|
* get appropriated or something.
|
|
|
|
*
|
|
|
|
* Otherwise it returns false.
|
|
|
|
*
|
|
|
|
* @param ztaddr ZeroTier address
|
|
|
|
* @param ipaddr IP address
|
|
|
|
* @return True if this ZT/IP pair should not be allowed to be used
|
|
|
|
*/
|
|
|
|
bool isProhibitedEndpoint(const Address &ztaddr,const InetAddress &ipaddr) const;
|
|
|
|
|
2017-01-27 21:27:52 +00:00
|
|
|
/**
|
2017-01-27 23:27:26 +00:00
|
|
|
* This gets the known stable endpoints for any upstream
|
|
|
|
*
|
|
|
|
* It also adds empty entries for any upstreams we are attempting to
|
|
|
|
* contact.
|
|
|
|
*
|
2017-01-27 21:27:52 +00:00
|
|
|
* @param eps Hash table to fill with addresses and their stable endpoints
|
|
|
|
*/
|
|
|
|
inline void getUpstreamStableEndpoints(Hashtable< Address,std::vector<InetAddress> > &eps) const
|
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_upstreams_m);
|
2017-01-27 21:27:52 +00:00
|
|
|
for(std::vector<World::Root>::const_iterator i(_planet.roots().begin());i!=_planet.roots().end();++i) {
|
|
|
|
std::vector<InetAddress> &ips = eps[i->identity.address()];
|
|
|
|
for(std::vector<InetAddress>::const_iterator j(i->stableEndpoints.begin());j!=i->stableEndpoints.end();++j) {
|
|
|
|
if (std::find(ips.begin(),ips.end(),*j) == ips.end())
|
|
|
|
ips.push_back(*j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for(std::vector<World>::const_iterator m(_moons.begin());m!=_moons.end();++m) {
|
|
|
|
for(std::vector<World::Root>::const_iterator i(m->roots().begin());i!=m->roots().end();++i) {
|
|
|
|
std::vector<InetAddress> &ips = eps[i->identity.address()];
|
|
|
|
for(std::vector<InetAddress>::const_iterator j(i->stableEndpoints.begin());j!=i->stableEndpoints.end();++j) {
|
|
|
|
if (std::find(ips.begin(),ips.end(),*j) == ips.end())
|
|
|
|
ips.push_back(*j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-01-27 23:35:21 +00:00
|
|
|
for(std::vector<Address>::const_iterator m(_contactingMoons.begin());m!=_contactingMoons.end();++m)
|
2017-01-27 23:27:26 +00:00
|
|
|
eps[*m];
|
2017-01-27 21:27:52 +00:00
|
|
|
}
|
|
|
|
|
2016-08-04 17:18:33 +00:00
|
|
|
/**
|
|
|
|
* @return Vector of active upstream addresses (including roots)
|
|
|
|
*/
|
|
|
|
inline std::vector<Address> upstreamAddresses() const
|
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_upstreams_m);
|
2017-01-27 23:27:26 +00:00
|
|
|
std::vector<Address> u(_upstreamAddresses);
|
2017-01-27 23:35:21 +00:00
|
|
|
for(std::vector<Address>::const_iterator m(_contactingMoons.begin());m!=_contactingMoons.end();++m) {
|
2017-01-27 23:27:26 +00:00
|
|
|
if (std::find(u.begin(),u.end(),*m) == u.end())
|
|
|
|
u.push_back(*m);
|
|
|
|
}
|
|
|
|
return u;
|
2016-08-04 17:18:33 +00:00
|
|
|
}
|
|
|
|
|
2017-01-27 21:50:56 +00:00
|
|
|
/**
|
|
|
|
* @return Current moons
|
|
|
|
*/
|
|
|
|
inline std::vector<World> moons() const
|
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_upstreams_m);
|
2017-01-27 21:50:56 +00:00
|
|
|
return _moons;
|
|
|
|
}
|
|
|
|
|
2015-10-13 01:25:29 +00:00
|
|
|
/**
|
2017-01-27 21:27:52 +00:00
|
|
|
* @return Current planet
|
2015-10-13 01:25:29 +00:00
|
|
|
*/
|
2017-01-27 21:27:52 +00:00
|
|
|
inline World planet() const
|
2015-10-13 01:25:29 +00:00
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_upstreams_m);
|
2017-01-27 21:27:52 +00:00
|
|
|
return _planet;
|
2015-10-13 01:25:29 +00:00
|
|
|
}
|
|
|
|
|
2015-10-13 15:49:36 +00:00
|
|
|
/**
|
2017-01-27 21:27:52 +00:00
|
|
|
* @return Current planet's world ID
|
2015-10-13 15:49:36 +00:00
|
|
|
*/
|
2017-01-27 21:27:52 +00:00
|
|
|
inline uint64_t planetWorldId() const
|
2015-10-13 15:49:36 +00:00
|
|
|
{
|
2017-01-27 21:27:52 +00:00
|
|
|
return _planet.id(); // safe to read without lock, and used from within eachPeer() so don't lock
|
2015-10-13 19:10:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2017-01-27 21:27:52 +00:00
|
|
|
* @return Current planet's world timestamp
|
2015-10-13 19:10:44 +00:00
|
|
|
*/
|
2017-01-27 21:27:52 +00:00
|
|
|
inline uint64_t planetWorldTimestamp() const
|
2015-10-13 19:10:44 +00:00
|
|
|
{
|
2017-01-27 21:27:52 +00:00
|
|
|
return _planet.timestamp(); // safe to read without lock, and used from within eachPeer() so don't lock
|
2015-10-13 15:49:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Validate new world and update if newer and signature is okay
|
|
|
|
*
|
2017-01-27 21:27:52 +00:00
|
|
|
* @param newWorld A new or updated planet or moon to learn
|
|
|
|
* @return True if it was valid and newer than current (or totally new for moons)
|
2015-10-13 15:49:36 +00:00
|
|
|
*/
|
2017-01-27 23:35:21 +00:00
|
|
|
bool addWorld(const World &newWorld);
|
2015-10-13 15:49:36 +00:00
|
|
|
|
2017-01-27 23:27:26 +00:00
|
|
|
/**
|
|
|
|
* Add a moon
|
|
|
|
*
|
|
|
|
* This loads it from moons.d if present, and if not adds it to
|
|
|
|
* a list of moons that we want to contact. It does not actually
|
|
|
|
* send anything, though this will happen on the next background
|
|
|
|
* task loop where pings etc. are checked.
|
|
|
|
*
|
|
|
|
* @param id Moon ID
|
|
|
|
*/
|
|
|
|
void addMoon(const uint64_t id);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Remove a moon
|
|
|
|
*
|
|
|
|
* @param id Moon's world ID
|
|
|
|
*/
|
|
|
|
void removeMoon(const uint64_t id);
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
2013-10-05 14:19:12 +00:00
|
|
|
* Clean and flush database
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2014-10-01 21:05:25 +00:00
|
|
|
void clean(uint64_t now);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2015-10-26 19:41:08 +00:00
|
|
|
/**
|
2015-11-13 20:14:28 +00:00
|
|
|
* @param now Current time
|
2015-10-28 21:29:08 +00:00
|
|
|
* @return Number of peers with active direct paths
|
2015-10-26 19:41:08 +00:00
|
|
|
*/
|
2015-11-13 20:14:28 +00:00
|
|
|
inline unsigned long countActive(uint64_t now) const
|
|
|
|
{
|
|
|
|
unsigned long cnt = 0;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_peers_m);
|
2015-11-13 20:14:28 +00:00
|
|
|
Hashtable< Address,SharedPtr<Peer> >::Iterator i(const_cast<Topology *>(this)->_peers);
|
|
|
|
Address *a = (Address *)0;
|
|
|
|
SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
|
|
|
|
while (i.next(a,p)) {
|
|
|
|
cnt += (unsigned long)((*p)->hasActiveDirectPath(now));
|
|
|
|
}
|
|
|
|
return cnt;
|
|
|
|
}
|
2015-10-26 19:41:08 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
|
|
|
* Apply a function or function object to all peers
|
|
|
|
*
|
|
|
|
* @param f Function to apply
|
|
|
|
* @tparam F Function or function object type
|
|
|
|
*/
|
|
|
|
template<typename F>
|
|
|
|
inline void eachPeer(F f)
|
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_peers_m);
|
2015-10-02 00:09:01 +00:00
|
|
|
Hashtable< Address,SharedPtr<Peer> >::Iterator i(_peers);
|
2015-09-04 19:14:21 +00:00
|
|
|
Address *a = (Address *)0;
|
|
|
|
SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
|
2015-10-30 21:11:10 +00:00
|
|
|
while (i.next(a,p)) {
|
|
|
|
#ifdef ZT_TRACE
|
|
|
|
if (!(*p)) {
|
2015-11-15 02:19:33 +00:00
|
|
|
fprintf(stderr,"FATAL BUG: eachPeer() caught NULL peer for %s -- peer pointers in Topology should NEVER be NULL" ZT_EOL_S,a->toString().c_str());
|
2015-10-30 21:11:10 +00:00
|
|
|
abort();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
f(*this,*((const SharedPtr<Peer> *)p));
|
|
|
|
}
|
2013-07-04 20:56:19 +00:00
|
|
|
}
|
|
|
|
|
2015-04-09 01:45:21 +00:00
|
|
|
/**
|
2015-10-13 15:49:36 +00:00
|
|
|
* @return All currently active peers by address (unsorted)
|
2015-04-09 01:45:21 +00:00
|
|
|
*/
|
2015-09-04 19:14:21 +00:00
|
|
|
inline std::vector< std::pair< Address,SharedPtr<Peer> > > allPeers() const
|
2015-04-09 01:45:21 +00:00
|
|
|
{
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_peers_m);
|
2015-10-02 00:09:01 +00:00
|
|
|
return _peers.entries();
|
2015-04-09 01:45:21 +00:00
|
|
|
}
|
|
|
|
|
2015-10-23 20:57:02 +00:00
|
|
|
/**
|
2017-01-27 21:27:52 +00:00
|
|
|
* @return True if I am a root server in a planet or moon
|
2015-10-23 20:57:02 +00:00
|
|
|
*/
|
2017-01-27 21:27:52 +00:00
|
|
|
inline bool amRoot() const { return _amRoot; }
|
2015-10-23 20:57:02 +00:00
|
|
|
|
2016-07-12 15:29:50 +00:00
|
|
|
/**
|
|
|
|
* Get the outbound trusted path ID for a physical address, or 0 if none
|
|
|
|
*
|
|
|
|
* @param physicalAddress Physical address to which we are sending the packet
|
|
|
|
* @return Trusted path ID or 0 if none (0 is not a valid trusted path ID)
|
|
|
|
*/
|
|
|
|
inline uint64_t getOutboundPathTrust(const InetAddress &physicalAddress)
|
|
|
|
{
|
|
|
|
for(unsigned int i=0;i<_trustedPathCount;++i) {
|
|
|
|
if (_trustedPathNetworks[i].containsAddress(physicalAddress))
|
|
|
|
return _trustedPathIds[i];
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check whether in incoming trusted path marked packet is valid
|
|
|
|
*
|
|
|
|
* @param physicalAddress Originating physical address
|
|
|
|
* @param trustedPathId Trusted path ID from packet (from MAC field)
|
|
|
|
*/
|
|
|
|
inline bool shouldInboundPathBeTrusted(const InetAddress &physicalAddress,const uint64_t trustedPathId)
|
|
|
|
{
|
|
|
|
for(unsigned int i=0;i<_trustedPathCount;++i) {
|
|
|
|
if ((_trustedPathIds[i] == trustedPathId)&&(_trustedPathNetworks[i].containsAddress(physicalAddress)))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Set trusted paths in this topology
|
|
|
|
*
|
|
|
|
* @param networks Array of networks (prefix/netmask bits)
|
|
|
|
* @param ids Array of trusted path IDs
|
|
|
|
* @param count Number of trusted paths (if larger than ZT_MAX_TRUSTED_PATHS overflow is ignored)
|
|
|
|
*/
|
|
|
|
inline void setTrustedPaths(const InetAddress *networks,const uint64_t *ids,unsigned int count)
|
|
|
|
{
|
|
|
|
if (count > ZT_MAX_TRUSTED_PATHS)
|
|
|
|
count = ZT_MAX_TRUSTED_PATHS;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex::Lock _l(_trustedPaths_m);
|
2016-07-12 15:29:50 +00:00
|
|
|
for(unsigned int i=0;i<count;++i) {
|
|
|
|
_trustedPathIds[i] = ids[i];
|
|
|
|
_trustedPathNetworks[i] = networks[i];
|
|
|
|
}
|
|
|
|
_trustedPathCount = count;
|
|
|
|
}
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
private:
|
2014-10-13 21:12:51 +00:00
|
|
|
Identity _getIdentity(const Address &zta);
|
2017-01-27 23:27:26 +00:00
|
|
|
void _memoizeUpstreams();
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2015-11-13 20:14:28 +00:00
|
|
|
const RuntimeEnvironment *const RR;
|
2013-10-21 15:15:47 +00:00
|
|
|
|
2016-07-12 15:29:50 +00:00
|
|
|
uint64_t _trustedPathIds[ZT_MAX_TRUSTED_PATHS];
|
|
|
|
InetAddress _trustedPathNetworks[ZT_MAX_TRUSTED_PATHS];
|
|
|
|
unsigned int _trustedPathCount;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex _trustedPaths_m;
|
2016-09-01 22:43:07 +00:00
|
|
|
|
2015-10-02 00:09:01 +00:00
|
|
|
Hashtable< Address,SharedPtr<Peer> > _peers;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex _peers_m;
|
|
|
|
|
2016-09-01 22:43:07 +00:00
|
|
|
Hashtable< Path::HashKey,SharedPtr<Path> > _paths;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex _paths_m;
|
2016-09-01 22:43:07 +00:00
|
|
|
|
2017-01-28 00:16:06 +00:00
|
|
|
World _planet;
|
|
|
|
std::vector<World> _moons;
|
2017-01-27 23:35:21 +00:00
|
|
|
std::vector<Address> _contactingMoons;
|
2017-01-27 23:27:26 +00:00
|
|
|
std::vector<Address> _upstreamAddresses;
|
|
|
|
bool _amRoot;
|
2017-01-28 00:16:06 +00:00
|
|
|
Mutex _upstreams_m; // locks worlds, upstream info, moon info, etc.
|
2013-07-04 20:56:19 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|
|
|
|
|
|
|
|
#endif
|