Topology.hpp 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2012-2013 ZeroTier Networks LLC
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. *
  18. * --
  19. *
  20. * ZeroTier may be used and distributed under the terms of the GPLv3, which
  21. * are available at: http://www.gnu.org/licenses/gpl-3.0.html
  22. *
  23. * If you would like to embed ZeroTier into a commercial application or
  24. * redistribute it in a modified binary form, please contact ZeroTier Networks
  25. * LLC. Start here: http://www.zerotier.com/
  26. */
  27. #ifndef ZT_TOPOLOGY_HPP
  28. #define ZT_TOPOLOGY_HPP
  29. #include <stdio.h>
  30. #include <string.h>
  31. #include <map>
  32. #include <set>
  33. #include <vector>
  34. #include <stdexcept>
  35. #include "Constants.hpp"
  36. #include "Address.hpp"
  37. #include "Peer.hpp"
  38. #include "Mutex.hpp"
  39. #include "InetAddress.hpp"
  40. #include "Utils.hpp"
  41. namespace ZeroTier {
  42. class RuntimeEnvironment;
  43. /**
  44. * Database of network topology
  45. */
  46. class Topology
  47. {
  48. public:
  49. Topology(const RuntimeEnvironment *renv,bool enablePermanentIdCaching);
  50. ~Topology();
  51. /**
  52. * Set up supernodes for this network
  53. *
  54. * @param sn Supernodes for this network
  55. */
  56. void setSupernodes(const std::map< Identity,std::vector<InetAddress> > &sn);
  57. /**
  58. * Add a peer to database
  59. *
  60. * This will not replace existing peers. In that case the existing peer
  61. * record is returned.
  62. *
  63. * @param peer Peer to add
  64. * @return New or existing peer (should replace 'peer')
  65. */
  66. SharedPtr<Peer> addPeer(const SharedPtr<Peer> &peer);
  67. /**
  68. * Get a peer from its address
  69. *
  70. * @param zta ZeroTier address of peer
  71. * @return Peer or NULL if not found
  72. */
  73. SharedPtr<Peer> getPeer(const Address &zta);
  74. /**
  75. * Get an identity if cached or available in a peer record
  76. *
  77. * @param zta ZeroTier address
  78. * @return Identity or NULL-identity if not found
  79. */
  80. Identity getIdentity(const Address &zta);
  81. /**
  82. * Save identity in permanent store, or do nothing if disabled
  83. *
  84. * This is called automatically by addPeer(), so it should not need to be
  85. * called manually anywhere else. The private part of the identity, if
  86. * present, is NOT cached by this.
  87. *
  88. * @param id Identity to save
  89. */
  90. void saveIdentity(const Identity &id);
  91. /**
  92. * @return Current network supernodes
  93. */
  94. inline std::map< Identity,std::vector<InetAddress> > supernodes() const
  95. {
  96. Mutex::Lock _l(_supernodes_m);
  97. return _supernodes;
  98. }
  99. /**
  100. * @return Vector of peers that are supernodes
  101. */
  102. inline std::vector< SharedPtr<Peer> > supernodePeers() const
  103. {
  104. Mutex::Lock _l(_supernodes_m);
  105. return _supernodePeers;
  106. }
  107. /**
  108. * Get the current favorite supernode
  109. *
  110. * @return Supernode with lowest latency or NULL if none
  111. */
  112. inline SharedPtr<Peer> getBestSupernode() const
  113. {
  114. return getBestSupernode((const Address *)0,0,false);
  115. }
  116. /**
  117. * Get the best supernode, avoiding supernodes listed in an array
  118. *
  119. * This will get the best supernode (lowest latency, etc.) but will
  120. * try to avoid the listed supernodes, only using them if no others
  121. * are available.
  122. *
  123. * @param avoid Nodes to avoid
  124. * @param avoidCount Number of nodes to avoid
  125. * @param strictAvoid If false, consider avoided supernodes anyway if no non-avoid supernodes are available
  126. * @return Supernode or NULL if none
  127. */
  128. SharedPtr<Peer> getBestSupernode(const Address *avoid,unsigned int avoidCount,bool strictAvoid) const;
  129. /**
  130. * @param zta ZeroTier address
  131. * @return True if this is a designated supernode
  132. */
  133. inline bool isSupernode(const Address &zta) const
  134. throw()
  135. {
  136. Mutex::Lock _l(_supernodes_m);
  137. return (_supernodeAddresses.count(zta) > 0);
  138. }
  139. /**
  140. * @return True if this node's identity is in the supernode set
  141. */
  142. inline bool amSupernode() const { return _amSupernode; }
  143. /**
  144. * Clean and flush database
  145. */
  146. void clean();
  147. /**
  148. * Apply a function or function object to all peers
  149. *
  150. * @param f Function to apply
  151. * @tparam F Function or function object type
  152. */
  153. template<typename F>
  154. inline void eachPeer(F f)
  155. {
  156. Mutex::Lock _l(_activePeers_m);
  157. for(std::map< Address,SharedPtr<Peer> >::const_iterator p(_activePeers.begin());p!=_activePeers.end();++p)
  158. f(*this,p->second);
  159. }
  160. /**
  161. * Function object to collect peers that need a firewall opener sent
  162. */
  163. class OpenPeersThatNeedFirewallOpener
  164. {
  165. public:
  166. OpenPeersThatNeedFirewallOpener(const RuntimeEnvironment *renv,uint64_t now) throw() :
  167. _now(now),
  168. _r(renv)
  169. {
  170. }
  171. inline void operator()(Topology &t,const SharedPtr<Peer> &p)
  172. {
  173. if ((p->hasDirectPath())&&((_now - std::max(p->lastFirewallOpener(),p->lastDirectSend())) >= ZT_FIREWALL_OPENER_DELAY))
  174. p->sendFirewallOpener(_r,_now);
  175. }
  176. private:
  177. uint64_t _now;
  178. const RuntimeEnvironment *_r;
  179. };
  180. /**
  181. * Function object to collect peers that need a ping sent
  182. */
  183. class PingPeersThatNeedPing
  184. {
  185. public:
  186. PingPeersThatNeedPing(const RuntimeEnvironment *renv,uint64_t now) throw() :
  187. _now(now),
  188. _r(renv)
  189. {
  190. }
  191. inline void operator()(Topology &t,const SharedPtr<Peer> &p)
  192. {
  193. if (
  194. ((_now - p->lastDirectReceive()) >= ZT_PEER_DIRECT_PING_DELAY) &&
  195. (
  196. (
  197. (p->hasDirectPath())&&
  198. ((_now - p->lastFrame()) < ZT_PEER_LINK_ACTIVITY_TIMEOUT)
  199. ) ||
  200. (t.isSupernode(p->address()))
  201. )
  202. ) {
  203. p->sendPing(_r,_now);
  204. }
  205. }
  206. private:
  207. uint64_t _now;
  208. const RuntimeEnvironment *_r;
  209. };
  210. /**
  211. * Function object to collect peers that we're talking to
  212. */
  213. class PingAllActivePeers
  214. {
  215. public:
  216. PingAllActivePeers(const RuntimeEnvironment *renv,uint64_t now) throw() :
  217. _now(now),
  218. _r(renv)
  219. {
  220. }
  221. inline void operator()(Topology &t,const SharedPtr<Peer> &p)
  222. {
  223. if (
  224. (
  225. (p->hasDirectPath())&&
  226. ((_now - p->lastFrame()) < ZT_PEER_LINK_ACTIVITY_TIMEOUT)
  227. ) ||
  228. (t.isSupernode(p->address()))
  229. ) {
  230. p->sendPing(_r,_now);
  231. }
  232. }
  233. private:
  234. uint64_t _now;
  235. const RuntimeEnvironment *_r;
  236. };
  237. /**
  238. * Function object to collect peers with any known direct path
  239. */
  240. class CollectPeersWithActiveDirectPath
  241. {
  242. public:
  243. CollectPeersWithActiveDirectPath(std::vector< SharedPtr<Peer> > &v,uint64_t now) throw() :
  244. _now(now),
  245. _v(v)
  246. {
  247. }
  248. inline void operator()(Topology &t,const SharedPtr<Peer> &p)
  249. {
  250. if (p->hasActiveDirectPath(_now))
  251. _v.push_back(p);
  252. }
  253. private:
  254. uint64_t _now;
  255. std::vector< SharedPtr<Peer> > &_v;
  256. };
  257. private:
  258. const RuntimeEnvironment *const _r;
  259. void _dumpPeers();
  260. void _loadPeers();
  261. std::string _idCacheBase; // empty if identity caching disabled
  262. std::map< Address,SharedPtr<Peer> > _activePeers;
  263. Mutex _activePeers_m;
  264. std::map< Identity,std::vector<InetAddress> > _supernodes;
  265. std::set< Address > _supernodeAddresses;
  266. std::vector< SharedPtr<Peer> > _supernodePeers;
  267. Mutex _supernodes_m;
  268. // Set to true if my identity is in _supernodes
  269. volatile bool _amSupernode;
  270. };
  271. } // namespace ZeroTier
  272. #endif