Topology.hpp 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
  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. #ifndef ZT_TOPOLOGY_HPP
  19. #define ZT_TOPOLOGY_HPP
  20. #include <stdio.h>
  21. #include <string.h>
  22. #include <vector>
  23. #include <stdexcept>
  24. #include <algorithm>
  25. #include <utility>
  26. #include "Constants.hpp"
  27. #include "../include/ZeroTierOne.h"
  28. #include "Address.hpp"
  29. #include "Identity.hpp"
  30. #include "Peer.hpp"
  31. #include "Path.hpp"
  32. #include "Mutex.hpp"
  33. #include "InetAddress.hpp"
  34. #include "Hashtable.hpp"
  35. #include "World.hpp"
  36. namespace ZeroTier {
  37. class RuntimeEnvironment;
  38. /**
  39. * Database of network topology
  40. */
  41. class Topology
  42. {
  43. public:
  44. Topology(const RuntimeEnvironment *renv);
  45. ~Topology();
  46. /**
  47. * Add a peer to database
  48. *
  49. * This will not replace existing peers. In that case the existing peer
  50. * record is returned.
  51. *
  52. * @param peer Peer to add
  53. * @return New or existing peer (should replace 'peer')
  54. */
  55. SharedPtr<Peer> addPeer(const SharedPtr<Peer> &peer);
  56. /**
  57. * Get a peer from its address
  58. *
  59. * @param zta ZeroTier address of peer
  60. * @return Peer or NULL if not found
  61. */
  62. SharedPtr<Peer> getPeer(const Address &zta);
  63. /**
  64. * Get a peer only if it is presently in memory (no disk cache)
  65. *
  66. * This also does not update the lastUsed() time for peers, which means
  67. * that it won't prevent them from falling out of RAM. This is currently
  68. * used in the Cluster code to update peer info without forcing all peers
  69. * across the entire cluster to remain in memory cache.
  70. *
  71. * @param zta ZeroTier address
  72. */
  73. inline SharedPtr<Peer> getPeerNoCache(const Address &zta)
  74. {
  75. Mutex::Lock _l(_lock);
  76. const SharedPtr<Peer> *const ap = _peers.get(zta);
  77. if (ap)
  78. return *ap;
  79. return SharedPtr<Peer>();
  80. }
  81. /**
  82. * Get a Path object for a given local and remote physical address, creating if needed
  83. *
  84. * @param l Local address or NULL for 'any' or 'wildcard'
  85. * @param r Remote address
  86. * @return Pointer to canonicalized Path object
  87. */
  88. inline SharedPtr<Path> getPath(const InetAddress &l,const InetAddress &r)
  89. {
  90. Mutex::Lock _l(_lock);
  91. SharedPtr<Path> &p = _paths[Path::HashKey(l,r)];
  92. if (!p)
  93. p.setToUnsafe(new Path(l,r));
  94. return p;
  95. }
  96. /**
  97. * Get the identity of a peer
  98. *
  99. * @param zta ZeroTier address of peer
  100. * @return Identity or NULL Identity if not found
  101. */
  102. Identity getIdentity(const Address &zta);
  103. /**
  104. * Cache an identity
  105. *
  106. * This is done automatically on addPeer(), and so is only useful for
  107. * cluster identity replication.
  108. *
  109. * @param id Identity to cache
  110. */
  111. void saveIdentity(const Identity &id);
  112. /**
  113. * Get the current best upstream peer
  114. *
  115. * @return Root server with lowest latency or NULL if none
  116. */
  117. inline SharedPtr<Peer> getUpstreamPeer() { return getUpstreamPeer((const Address *)0,0,false); }
  118. /**
  119. * Get the current best upstream peer, avoiding those in the supplied avoid list
  120. *
  121. * @param avoid Nodes to avoid
  122. * @param avoidCount Number of nodes to avoid
  123. * @param strictAvoid If false, consider avoided root servers anyway if no non-avoid root servers are available
  124. * @return Root server or NULL if none available
  125. */
  126. SharedPtr<Peer> getUpstreamPeer(const Address *avoid,unsigned int avoidCount,bool strictAvoid);
  127. /**
  128. * @param id Identity to check
  129. * @return True if this is a designated root server in this world
  130. */
  131. bool isRoot(const Identity &id) const;
  132. /**
  133. * @param id Identity to check
  134. * @return True if this is a root server or a network preferred relay from one of our networks
  135. */
  136. bool isUpstream(const Identity &id) const;
  137. /**
  138. * Set whether or not an address is upstream
  139. *
  140. * If the address is a root this does nothing, since roots are fixed.
  141. *
  142. * @param a Target address
  143. * @param upstream New upstream status
  144. */
  145. void setUpstream(const Address &a,bool upstream);
  146. /**
  147. * @return Vector of active upstream addresses (including roots)
  148. */
  149. inline std::vector<Address> upstreamAddresses() const
  150. {
  151. Mutex::Lock _l(_lock);
  152. return _upstreamAddresses;
  153. }
  154. /**
  155. * @return Current World (copy)
  156. */
  157. inline World world() const
  158. {
  159. Mutex::Lock _l(_lock);
  160. return _world;
  161. }
  162. /**
  163. * @return Current world ID
  164. */
  165. inline uint64_t worldId() const
  166. {
  167. return _world.id(); // safe to read without lock, and used from within eachPeer() so don't lock
  168. }
  169. /**
  170. * @return Current world timestamp
  171. */
  172. inline uint64_t worldTimestamp() const
  173. {
  174. return _world.timestamp(); // safe to read without lock, and used from within eachPeer() so don't lock
  175. }
  176. /**
  177. * Validate new world and update if newer and signature is okay
  178. *
  179. * @param newWorld Potential new world definition revision
  180. * @return True if an update actually occurred
  181. */
  182. bool worldUpdateIfValid(const World &newWorld);
  183. /**
  184. * Clean and flush database
  185. */
  186. void clean(uint64_t now);
  187. /**
  188. * @param now Current time
  189. * @return Number of peers with active direct paths
  190. */
  191. inline unsigned long countActive(uint64_t now) const
  192. {
  193. unsigned long cnt = 0;
  194. Mutex::Lock _l(_lock);
  195. Hashtable< Address,SharedPtr<Peer> >::Iterator i(const_cast<Topology *>(this)->_peers);
  196. Address *a = (Address *)0;
  197. SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
  198. while (i.next(a,p)) {
  199. cnt += (unsigned long)((*p)->hasActiveDirectPath(now));
  200. }
  201. return cnt;
  202. }
  203. /**
  204. * Apply a function or function object to all peers
  205. *
  206. * Note: explicitly template this by reference if you want the object
  207. * passed by reference instead of copied.
  208. *
  209. * Warning: be careful not to use features in these that call any other
  210. * methods of Topology that may lock _lock, otherwise a recursive lock
  211. * and deadlock or lock corruption may occur.
  212. *
  213. * @param f Function to apply
  214. * @tparam F Function or function object type
  215. */
  216. template<typename F>
  217. inline void eachPeer(F f)
  218. {
  219. Mutex::Lock _l(_lock);
  220. Hashtable< Address,SharedPtr<Peer> >::Iterator i(_peers);
  221. Address *a = (Address *)0;
  222. SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
  223. while (i.next(a,p)) {
  224. #ifdef ZT_TRACE
  225. if (!(*p)) {
  226. 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());
  227. abort();
  228. }
  229. #endif
  230. f(*this,*((const SharedPtr<Peer> *)p));
  231. }
  232. }
  233. /**
  234. * @return All currently active peers by address (unsorted)
  235. */
  236. inline std::vector< std::pair< Address,SharedPtr<Peer> > > allPeers() const
  237. {
  238. Mutex::Lock _l(_lock);
  239. return _peers.entries();
  240. }
  241. /**
  242. * @return True if I am a root server in the current World
  243. */
  244. inline bool amRoot() const throw() { return _amRoot; }
  245. /**
  246. * Get the outbound trusted path ID for a physical address, or 0 if none
  247. *
  248. * @param physicalAddress Physical address to which we are sending the packet
  249. * @return Trusted path ID or 0 if none (0 is not a valid trusted path ID)
  250. */
  251. inline uint64_t getOutboundPathTrust(const InetAddress &physicalAddress)
  252. {
  253. for(unsigned int i=0;i<_trustedPathCount;++i) {
  254. if (_trustedPathNetworks[i].containsAddress(physicalAddress))
  255. return _trustedPathIds[i];
  256. }
  257. return 0;
  258. }
  259. /**
  260. * Check whether in incoming trusted path marked packet is valid
  261. *
  262. * @param physicalAddress Originating physical address
  263. * @param trustedPathId Trusted path ID from packet (from MAC field)
  264. */
  265. inline bool shouldInboundPathBeTrusted(const InetAddress &physicalAddress,const uint64_t trustedPathId)
  266. {
  267. for(unsigned int i=0;i<_trustedPathCount;++i) {
  268. if ((_trustedPathIds[i] == trustedPathId)&&(_trustedPathNetworks[i].containsAddress(physicalAddress)))
  269. return true;
  270. }
  271. return false;
  272. }
  273. /**
  274. * Set trusted paths in this topology
  275. *
  276. * @param networks Array of networks (prefix/netmask bits)
  277. * @param ids Array of trusted path IDs
  278. * @param count Number of trusted paths (if larger than ZT_MAX_TRUSTED_PATHS overflow is ignored)
  279. */
  280. inline void setTrustedPaths(const InetAddress *networks,const uint64_t *ids,unsigned int count)
  281. {
  282. if (count > ZT_MAX_TRUSTED_PATHS)
  283. count = ZT_MAX_TRUSTED_PATHS;
  284. Mutex::Lock _l(_lock);
  285. for(unsigned int i=0;i<count;++i) {
  286. _trustedPathIds[i] = ids[i];
  287. _trustedPathNetworks[i] = networks[i];
  288. }
  289. _trustedPathCount = count;
  290. }
  291. private:
  292. Identity _getIdentity(const Address &zta);
  293. void _setWorld(const World &newWorld);
  294. const RuntimeEnvironment *const RR;
  295. uint64_t _trustedPathIds[ZT_MAX_TRUSTED_PATHS];
  296. InetAddress _trustedPathNetworks[ZT_MAX_TRUSTED_PATHS];
  297. unsigned int _trustedPathCount;
  298. World _world;
  299. Hashtable< Address,SharedPtr<Peer> > _peers;
  300. Hashtable< Path::HashKey,SharedPtr<Path> > _paths;
  301. std::vector< Address > _upstreamAddresses; // includes roots
  302. std::vector< Address > _rootAddresses; // only roots
  303. bool _amRoot; // am I a root?
  304. Mutex _lock;
  305. };
  306. } // namespace ZeroTier
  307. #endif