You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
291 lines
6.7 KiB
291 lines
6.7 KiB
/* |
|
* ZeroTier One - Global Peer to Peer Ethernet |
|
* Copyright (C) 2012-2013 ZeroTier Networks LLC |
|
* |
|
* 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/>. |
|
* |
|
* -- |
|
* |
|
* ZeroTier may be used and distributed under the terms of the GPLv3, which |
|
* are available at: http://www.gnu.org/licenses/gpl-3.0.html |
|
* |
|
* If you would like to embed ZeroTier into a commercial application or |
|
* redistribute it in a modified binary form, please contact ZeroTier Networks |
|
* LLC. Start here: http://www.zerotier.com/ |
|
*/ |
|
|
|
#ifndef _ZT_TOPOLOGY_HPP |
|
#define _ZT_TOPOLOGY_HPP |
|
|
|
#include <stdio.h> |
|
#include <string.h> |
|
|
|
#include <map> |
|
#include <set> |
|
#include <vector> |
|
#include <stdexcept> |
|
|
|
#include "Constants.hpp" |
|
#include "Address.hpp" |
|
#include "Peer.hpp" |
|
#include "Mutex.hpp" |
|
#include "InetAddress.hpp" |
|
#include "Utils.hpp" |
|
|
|
namespace ZeroTier { |
|
|
|
class RuntimeEnvironment; |
|
|
|
/** |
|
* Database of network topology |
|
*/ |
|
class Topology |
|
{ |
|
public: |
|
Topology(const RuntimeEnvironment *renv); |
|
~Topology(); |
|
|
|
/** |
|
* Set up supernodes for this network |
|
* |
|
* @param sn Supernodes for this network |
|
*/ |
|
void setSupernodes(const std::map< Identity,std::vector<InetAddress> > &sn); |
|
|
|
/** |
|
* Add a peer to database |
|
* |
|
* 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') |
|
*/ |
|
SharedPtr<Peer> addPeer(const SharedPtr<Peer> &peer); |
|
|
|
/** |
|
* Get a peer from its address |
|
* |
|
* @param zta ZeroTier address of peer |
|
* @return Peer or NULL if not found |
|
*/ |
|
SharedPtr<Peer> getPeer(const Address &zta); |
|
|
|
/** |
|
* @return Current network supernodes |
|
*/ |
|
inline std::map< Identity,std::vector<InetAddress> > supernodes() const |
|
{ |
|
Mutex::Lock _l(_supernodes_m); |
|
return _supernodes; |
|
} |
|
|
|
/** |
|
* @return Vector of peers that are supernodes |
|
*/ |
|
inline std::vector< SharedPtr<Peer> > supernodePeers() const |
|
{ |
|
Mutex::Lock _l(_supernodes_m); |
|
return _supernodePeers; |
|
} |
|
|
|
/** |
|
* Get the current favorite supernode |
|
* |
|
* @return Supernode with lowest latency or NULL if none |
|
*/ |
|
inline SharedPtr<Peer> getBestSupernode() const |
|
{ |
|
return getBestSupernode((const Address *)0,0,false); |
|
} |
|
|
|
/** |
|
* Get the best supernode, avoiding supernodes listed in an array |
|
* |
|
* This will get the best supernode (lowest latency, etc.) but will |
|
* try to avoid the listed supernodes, only using them if no others |
|
* are available. |
|
* |
|
* @param avoid Nodes to avoid |
|
* @param avoidCount Number of nodes to avoid |
|
* @param strictAvoid If false, consider avoided supernodes anyway if no non-avoid supernodes are available |
|
* @return Supernode or NULL if none |
|
*/ |
|
SharedPtr<Peer> getBestSupernode(const Address *avoid,unsigned int avoidCount,bool strictAvoid) const; |
|
|
|
/** |
|
* @param zta ZeroTier address |
|
* @return True if this is a designated supernode |
|
*/ |
|
inline bool isSupernode(const Address &zta) const |
|
throw() |
|
{ |
|
Mutex::Lock _l(_supernodes_m); |
|
return (_supernodeAddresses.count(zta) > 0); |
|
} |
|
|
|
/** |
|
* @return True if this node's identity is in the supernode set |
|
*/ |
|
inline bool amSupernode() const { return _amSupernode; } |
|
|
|
/** |
|
* Clean and flush database |
|
*/ |
|
void clean(); |
|
|
|
/** |
|
* 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) |
|
{ |
|
Mutex::Lock _l(_activePeers_m); |
|
for(std::map< Address,SharedPtr<Peer> >::const_iterator p(_activePeers.begin());p!=_activePeers.end();++p) |
|
f(*this,p->second); |
|
} |
|
|
|
/** |
|
* Function object to collect peers that need a firewall opener sent |
|
*/ |
|
class OpenPeersThatNeedFirewallOpener |
|
{ |
|
public: |
|
OpenPeersThatNeedFirewallOpener(const RuntimeEnvironment *renv,uint64_t now) throw() : |
|
_now(now), |
|
_r(renv) |
|
{ |
|
} |
|
|
|
inline void operator()(Topology &t,const SharedPtr<Peer> &p) |
|
{ |
|
if ((p->hasDirectPath())&&((_now - std::max(p->lastFirewallOpener(),p->lastDirectSend())) >= ZT_FIREWALL_OPENER_DELAY)) |
|
p->sendFirewallOpener(_r,_now); |
|
} |
|
|
|
private: |
|
uint64_t _now; |
|
const RuntimeEnvironment *_r; |
|
}; |
|
|
|
/** |
|
* Function object to collect peers that need a ping sent |
|
*/ |
|
class PingPeersThatNeedPing |
|
{ |
|
public: |
|
PingPeersThatNeedPing(const RuntimeEnvironment *renv,uint64_t now) throw() : |
|
_now(now), |
|
_r(renv) |
|
{ |
|
} |
|
|
|
inline void operator()(Topology &t,const SharedPtr<Peer> &p) |
|
{ |
|
if ( |
|
((_now - p->lastDirectReceive()) >= ZT_PEER_DIRECT_PING_DELAY) && |
|
( |
|
( |
|
(p->hasDirectPath())&& |
|
((_now - p->lastFrame()) < ZT_PEER_LINK_ACTIVITY_TIMEOUT) |
|
) || |
|
(t.isSupernode(p->address())) |
|
) |
|
) { |
|
p->sendPing(_r,_now); |
|
} |
|
} |
|
|
|
private: |
|
uint64_t _now; |
|
const RuntimeEnvironment *_r; |
|
}; |
|
|
|
/** |
|
* Function object to collect peers that we're talking to |
|
*/ |
|
class PingAllActivePeers |
|
{ |
|
public: |
|
PingAllActivePeers(const RuntimeEnvironment *renv,uint64_t now) throw() : |
|
_now(now), |
|
_r(renv) |
|
{ |
|
} |
|
|
|
inline void operator()(Topology &t,const SharedPtr<Peer> &p) |
|
{ |
|
if ( |
|
( |
|
(p->hasDirectPath())&& |
|
((_now - p->lastFrame()) < ZT_PEER_LINK_ACTIVITY_TIMEOUT) |
|
) || |
|
(t.isSupernode(p->address())) |
|
) { |
|
p->sendPing(_r,_now); |
|
} |
|
} |
|
|
|
private: |
|
uint64_t _now; |
|
const RuntimeEnvironment *_r; |
|
}; |
|
|
|
/** |
|
* Function object to collect peers with any known direct path |
|
*/ |
|
class CollectPeersWithActiveDirectPath |
|
{ |
|
public: |
|
CollectPeersWithActiveDirectPath(std::vector< SharedPtr<Peer> > &v,uint64_t now) throw() : |
|
_now(now), |
|
_v(v) |
|
{ |
|
} |
|
|
|
inline void operator()(Topology &t,const SharedPtr<Peer> &p) |
|
{ |
|
if (p->hasActiveDirectPath(_now)) |
|
_v.push_back(p); |
|
} |
|
|
|
private: |
|
uint64_t _now; |
|
std::vector< SharedPtr<Peer> > &_v; |
|
}; |
|
|
|
private: |
|
const RuntimeEnvironment *const _r; |
|
|
|
void _dumpPeers(); |
|
void _loadPeers(); |
|
|
|
std::map< Address,SharedPtr<Peer> > _activePeers; |
|
Mutex _activePeers_m; |
|
|
|
std::map< Identity,std::vector<InetAddress> > _supernodes; |
|
std::set< Address > _supernodeAddresses; |
|
std::vector< SharedPtr<Peer> > _supernodePeers; |
|
Mutex _supernodes_m; |
|
|
|
// Set to true if my identity is in _supernodes |
|
volatile bool _amSupernode; |
|
}; |
|
|
|
} // namespace ZeroTier |
|
|
|
#endif
|
|
|