Peer.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2015 ZeroTier, Inc.
  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_PEER_HPP
  28. #define ZT_PEER_HPP
  29. #include <stdint.h>
  30. #include "Constants.hpp"
  31. #include <algorithm>
  32. #include <utility>
  33. #include <vector>
  34. #include <stdexcept>
  35. #include "../include/ZeroTierOne.h"
  36. #include "RuntimeEnvironment.hpp"
  37. #include "RemotePath.hpp"
  38. #include "Address.hpp"
  39. #include "Utils.hpp"
  40. #include "Identity.hpp"
  41. #include "InetAddress.hpp"
  42. #include "Packet.hpp"
  43. #include "SharedPtr.hpp"
  44. #include "AtomicCounter.hpp"
  45. #include "NonCopyable.hpp"
  46. namespace ZeroTier {
  47. /**
  48. * Peer on P2P Network (virtual layer 1)
  49. */
  50. class Peer : NonCopyable
  51. {
  52. friend class SharedPtr<Peer>;
  53. private:
  54. Peer() {} // disabled to prevent bugs -- should not be constructed uninitialized
  55. public:
  56. ~Peer() { Utils::burn(_key,sizeof(_key)); }
  57. /**
  58. * Construct a new peer
  59. *
  60. * @param myIdentity Identity of THIS node (for key agreement)
  61. * @param peerIdentity Identity of peer
  62. * @throws std::runtime_error Key agreement with peer's identity failed
  63. */
  64. Peer(const Identity &myIdentity,const Identity &peerIdentity)
  65. throw(std::runtime_error);
  66. /**
  67. * @return Time peer record was last used in any way
  68. */
  69. inline uint64_t lastUsed() const throw() { return _lastUsed; }
  70. /**
  71. * Log a use of this peer record (done by Topology when peers are looked up)
  72. *
  73. * @param now New time of last use
  74. */
  75. inline void use(uint64_t now) throw() { _lastUsed = now; }
  76. /**
  77. * @return This peer's ZT address (short for identity().address())
  78. */
  79. inline const Address &address() const throw() { return _id.address(); }
  80. /**
  81. * @return This peer's identity
  82. */
  83. inline const Identity &identity() const throw() { return _id; }
  84. /**
  85. * Log receipt of an authenticated packet
  86. *
  87. * This is called by the decode pipe when a packet is proven to be authentic
  88. * and appears to be valid.
  89. *
  90. * @param RR Runtime environment
  91. * @param remoteAddr Internet address of sender
  92. * @param hops ZeroTier (not IP) hops
  93. * @param packetId Packet ID
  94. * @param verb Packet verb
  95. * @param inRePacketId Packet ID in reply to (default: none)
  96. * @param inReVerb Verb in reply to (for OK/ERROR, default: VERB_NOP)
  97. */
  98. void received(
  99. const RuntimeEnvironment *RR,
  100. const InetAddress &remoteAddr,
  101. unsigned int hops,
  102. uint64_t packetId,
  103. Packet::Verb verb,
  104. uint64_t inRePacketId = 0,
  105. Packet::Verb inReVerb = Packet::VERB_NOP);
  106. /**
  107. * Get the best direct path to this peer
  108. *
  109. * @param now Current time
  110. * @return Best path or NULL if there are no active (or fixed) direct paths
  111. */
  112. RemotePath *getBestPath(uint64_t now);
  113. /**
  114. * Send via best path
  115. *
  116. * @param RR Runtime environment
  117. * @param data Packet data
  118. * @param len Packet length
  119. * @param now Current time
  120. * @return Path used on success or NULL on failure
  121. */
  122. inline RemotePath *send(const RuntimeEnvironment *RR,const void *data,unsigned int len,uint64_t now)
  123. {
  124. RemotePath *bestPath = getBestPath(now);
  125. if (bestPath) {
  126. if (bestPath->send(RR,data,len,now))
  127. return bestPath;
  128. }
  129. return (RemotePath *)0;
  130. }
  131. /**
  132. * Send a HELLO to this peer at a specified physical address
  133. *
  134. * This does not update any statistics. It's used to send initial HELLOs
  135. * for NAT traversal and path verification.
  136. *
  137. * @param RR Runtime environment
  138. * @param atAddress Destination address
  139. * @param now Current time
  140. */
  141. void attemptToContactAt(const RuntimeEnvironment *RR,const InetAddress &atAddress,uint64_t now);
  142. /**
  143. * Send pings or keepalives depending on configured timeouts
  144. *
  145. * @param RR Runtime environment
  146. * @param now Current time
  147. */
  148. void doPingAndKeepalive(const RuntimeEnvironment *RR,uint64_t now);
  149. /**
  150. * Push direct paths if we haven't done so in [rate limit] milliseconds
  151. *
  152. * @param RR Runtime environment
  153. * @param path Remote path to use to send the push
  154. * @param now Current time
  155. * @param force If true, push regardless of rate limit
  156. */
  157. void pushDirectPaths(const RuntimeEnvironment *RR,RemotePath *path,uint64_t now,bool force);
  158. /**
  159. * @return All known direct paths to this peer
  160. */
  161. inline std::vector<RemotePath> paths() const
  162. {
  163. std::vector<RemotePath> pp;
  164. for(unsigned int p=0,np=_numPaths;p<np;++p)
  165. pp.push_back(_paths[p]);
  166. return pp;
  167. }
  168. /**
  169. * @return Time of last direct packet receive for any path
  170. */
  171. inline uint64_t lastDirectReceive() const
  172. throw()
  173. {
  174. uint64_t x = 0;
  175. for(unsigned int p=0,np=_numPaths;p<np;++p)
  176. x = std::max(x,_paths[p].lastReceived());
  177. return x;
  178. }
  179. /**
  180. * @return Time of last direct packet send for any path
  181. */
  182. inline uint64_t lastDirectSend() const
  183. throw()
  184. {
  185. uint64_t x = 0;
  186. for(unsigned int p=0,np=_numPaths;p<np;++p)
  187. x = std::max(x,_paths[p].lastSend());
  188. return x;
  189. }
  190. /**
  191. * @return Time of last receive of anything, whether direct or relayed
  192. */
  193. inline uint64_t lastReceive() const throw() { return _lastReceive; }
  194. /**
  195. * @return Time of most recent unicast frame received
  196. */
  197. inline uint64_t lastUnicastFrame() const throw() { return _lastUnicastFrame; }
  198. /**
  199. * @return Time of most recent multicast frame received
  200. */
  201. inline uint64_t lastMulticastFrame() const throw() { return _lastMulticastFrame; }
  202. /**
  203. * @return Time of most recent frame of any kind (unicast or multicast)
  204. */
  205. inline uint64_t lastFrame() const throw() { return std::max(_lastUnicastFrame,_lastMulticastFrame); }
  206. /**
  207. * @return Time we last announced state TO this peer, such as multicast LIKEs
  208. */
  209. inline uint64_t lastAnnouncedTo() const throw() { return _lastAnnouncedTo; }
  210. /**
  211. * @return True if peer has received an actual data frame within ZT_PEER_ACTIVITY_TIMEOUT milliseconds
  212. */
  213. inline uint64_t alive(uint64_t now) const throw() { return ((now - lastFrame()) < ZT_PEER_ACTIVITY_TIMEOUT); }
  214. /**
  215. * @return Current latency or 0 if unknown (max: 65535)
  216. */
  217. inline unsigned int latency() const
  218. throw()
  219. {
  220. unsigned int l = _latency;
  221. return std::min(l,(unsigned int)65535);
  222. }
  223. /**
  224. * Update latency with a new direct measurment
  225. *
  226. * @param l Direct latency measurment in ms
  227. */
  228. inline void addDirectLatencyMeasurment(unsigned int l)
  229. throw()
  230. {
  231. unsigned int ol = _latency;
  232. if ((ol > 0)&&(ol < 10000))
  233. _latency = (ol + std::min(l,(unsigned int)65535)) / 2;
  234. else _latency = std::min(l,(unsigned int)65535);
  235. }
  236. /**
  237. * @return True if this peer has at least one direct IP address path
  238. */
  239. inline bool hasDirectPath() const throw() { return (_numPaths != 0); }
  240. /**
  241. * @param now Current time
  242. * @return True if this peer has at least one active or fixed direct path
  243. */
  244. inline bool hasActiveDirectPath(uint64_t now) const
  245. throw()
  246. {
  247. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  248. if (_paths[p].active(now))
  249. return true;
  250. }
  251. return false;
  252. }
  253. /**
  254. * Add a path (if we don't already have it)
  255. *
  256. * @param p New path to add
  257. */
  258. void addPath(const RemotePath &newp);
  259. /**
  260. * Clear paths
  261. *
  262. * @param fixedToo If true, clear fixed paths as well as learned ones
  263. */
  264. void clearPaths(bool fixedToo);
  265. /**
  266. * Reset paths within a given scope
  267. *
  268. * For fixed paths in this scope, a packet is sent. Non-fixed paths in this
  269. * scope are forgotten.
  270. *
  271. * @param RR Runtime environment
  272. * @param scope IP scope of paths to reset
  273. * @param now Current time
  274. * @return True if at least one path was forgotten
  275. */
  276. bool resetWithinScope(const RuntimeEnvironment *RR,InetAddress::IpScope scope,uint64_t now);
  277. /**
  278. * @return 256-bit secret symmetric encryption key
  279. */
  280. inline const unsigned char *key() const throw() { return _key; }
  281. /**
  282. * Set the currently known remote version of this peer's client
  283. *
  284. * @param vproto Protocol version
  285. * @param vmaj Major version
  286. * @param vmin Minor version
  287. * @param vrev Revision
  288. */
  289. inline void setRemoteVersion(unsigned int vproto,unsigned int vmaj,unsigned int vmin,unsigned int vrev)
  290. {
  291. _vProto = (uint16_t)vproto;
  292. _vMajor = (uint16_t)vmaj;
  293. _vMinor = (uint16_t)vmin;
  294. _vRevision = (uint16_t)vrev;
  295. }
  296. inline unsigned int remoteVersionProtocol() const throw() { return _vProto; }
  297. inline unsigned int remoteVersionMajor() const throw() { return _vMajor; }
  298. inline unsigned int remoteVersionMinor() const throw() { return _vMinor; }
  299. inline unsigned int remoteVersionRevision() const throw() { return _vRevision; }
  300. inline bool remoteVersionKnown() const throw() { return ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)); }
  301. /**
  302. * Check whether this peer's version is both known and is at least what is specified
  303. *
  304. * @param major Major version to check against
  305. * @param minor Minor version
  306. * @param rev Revision
  307. * @return True if peer's version is at least supplied tuple
  308. */
  309. inline bool atLeastVersion(unsigned int major,unsigned int minor,unsigned int rev)
  310. throw()
  311. {
  312. if ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)) {
  313. if (_vMajor > major)
  314. return true;
  315. else if (_vMajor == major) {
  316. if (_vMinor > minor)
  317. return true;
  318. else if (_vMinor == minor) {
  319. if (_vRevision >= rev)
  320. return true;
  321. }
  322. }
  323. }
  324. return false;
  325. }
  326. /**
  327. * Get most recently active path addresses for IPv4 and/or IPv6
  328. *
  329. * Note that v4 and v6 are not modified if they are not found, so
  330. * initialize these to a NULL address to be able to check.
  331. *
  332. * @param now Current time
  333. * @param v4 Result parameter to receive active IPv4 address, if any
  334. * @param v6 Result parameter to receive active IPv6 address, if any
  335. */
  336. void getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const;
  337. /**
  338. * Find a common set of addresses by which two peers can link, if any
  339. *
  340. * @param a Peer A
  341. * @param b Peer B
  342. * @param now Current time
  343. * @return Pair: B's address (to send to A), A's address (to send to B)
  344. */
  345. static inline std::pair<InetAddress,InetAddress> findCommonGround(const Peer &a,const Peer &b,uint64_t now)
  346. {
  347. std::pair<InetAddress,InetAddress> v4,v6;
  348. b.getBestActiveAddresses(now,v4.first,v6.first);
  349. a.getBestActiveAddresses(now,v4.second,v6.second);
  350. if ((v6.first)&&(v6.second)) // prefer IPv6 if both have it since NAT-t is (almost) unnecessary
  351. return v6;
  352. else if ((v4.first)&&(v4.second))
  353. return v4;
  354. else return std::pair<InetAddress,InetAddress>();
  355. }
  356. private:
  357. void _announceMulticastGroups(const RuntimeEnvironment *RR,uint64_t now);
  358. unsigned char _key[ZT_PEER_SECRET_KEY_LENGTH];
  359. uint64_t _lastUsed;
  360. uint64_t _lastReceive; // direct or indirect
  361. uint64_t _lastUnicastFrame;
  362. uint64_t _lastMulticastFrame;
  363. uint64_t _lastAnnouncedTo;
  364. uint64_t _lastPathConfirmationSent;
  365. uint64_t _lastDirectPathPush;
  366. uint16_t _vProto;
  367. uint16_t _vMajor;
  368. uint16_t _vMinor;
  369. uint16_t _vRevision;
  370. Identity _id;
  371. RemotePath _paths[ZT1_MAX_PEER_NETWORK_PATHS];
  372. unsigned int _numPaths;
  373. unsigned int _latency;
  374. AtomicCounter __refCount;
  375. };
  376. } // namespace ZeroTier
  377. // Add a swap() for shared ptr's to peers to speed up peer sorts
  378. namespace std {
  379. template<>
  380. inline void swap(ZeroTier::SharedPtr<ZeroTier::Peer> &a,ZeroTier::SharedPtr<ZeroTier::Peer> &b)
  381. {
  382. a.swap(b);
  383. }
  384. }
  385. #endif