Peer.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489
  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_PEER_HPP
  19. #define ZT_PEER_HPP
  20. #include <stdint.h>
  21. #include "Constants.hpp"
  22. #include <algorithm>
  23. #include <utility>
  24. #include <vector>
  25. #include <stdexcept>
  26. #include "../include/ZeroTierOne.h"
  27. #include "RuntimeEnvironment.hpp"
  28. #include "Path.hpp"
  29. #include "Address.hpp"
  30. #include "Utils.hpp"
  31. #include "Identity.hpp"
  32. #include "InetAddress.hpp"
  33. #include "Packet.hpp"
  34. #include "SharedPtr.hpp"
  35. #include "AtomicCounter.hpp"
  36. #include "Hashtable.hpp"
  37. #include "Mutex.hpp"
  38. #include "NonCopyable.hpp"
  39. namespace ZeroTier {
  40. /**
  41. * Peer on P2P Network (virtual layer 1)
  42. */
  43. class Peer : NonCopyable
  44. {
  45. friend class SharedPtr<Peer>;
  46. private:
  47. Peer() {} // disabled to prevent bugs -- should not be constructed uninitialized
  48. public:
  49. ~Peer() { Utils::burn(_key,sizeof(_key)); }
  50. /**
  51. * Construct a new peer
  52. *
  53. * @param renv Runtime environment
  54. * @param myIdentity Identity of THIS node (for key agreement)
  55. * @param peerIdentity Identity of peer
  56. * @throws std::runtime_error Key agreement with peer's identity failed
  57. */
  58. Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity);
  59. /**
  60. * @return This peer's ZT address (short for identity().address())
  61. */
  62. inline const Address &address() const throw() { return _id.address(); }
  63. /**
  64. * @return This peer's identity
  65. */
  66. inline const Identity &identity() const throw() { return _id; }
  67. /**
  68. * Log receipt of an authenticated packet
  69. *
  70. * This is called by the decode pipe when a packet is proven to be authentic
  71. * and appears to be valid.
  72. *
  73. * @param path Path over which packet was received
  74. * @param hops ZeroTier (not IP) hops
  75. * @param packetId Packet ID
  76. * @param verb Packet verb
  77. * @param inRePacketId Packet ID in reply to (default: none)
  78. * @param inReVerb Verb in reply to (for OK/ERROR, default: VERB_NOP)
  79. * @param trustEstablished If true, some form of non-trivial trust (like allowed in network) has been established
  80. */
  81. void received(
  82. const SharedPtr<Path> &path,
  83. const unsigned int hops,
  84. const uint64_t packetId,
  85. const Packet::Verb verb,
  86. const uint64_t inRePacketId,
  87. const Packet::Verb inReVerb,
  88. const bool trustEstablished);
  89. /**
  90. * @param now Current time
  91. * @param addr Remote address
  92. * @return True if we have an active path to this destination
  93. */
  94. bool hasActivePathTo(uint64_t now,const InetAddress &addr) const;
  95. /**
  96. * Set which known path for an address family is optimal
  97. *
  98. * @param addr Address to make exclusive
  99. */
  100. inline void setClusterOptimal(const InetAddress &addr)
  101. {
  102. if (addr.ss_family == AF_INET) {
  103. _remoteClusterOptimal4 = (uint32_t)reinterpret_cast<const struct sockaddr_in *>(&addr)->sin_addr.s_addr;
  104. } else if (addr.ss_family == AF_INET6) {
  105. memcpy(_remoteClusterOptimal6,reinterpret_cast<const struct sockaddr_in6 *>(&addr)->sin6_addr.s6_addr,16);
  106. }
  107. }
  108. /**
  109. * Send via best direct path
  110. *
  111. * @param data Packet data
  112. * @param len Packet length
  113. * @param now Current time
  114. * @param forceEvenIfDead If true, send even if the path is not 'alive'
  115. * @return True if we actually sent something
  116. */
  117. bool sendDirect(const void *data,unsigned int len,uint64_t now,bool forceEvenIfDead);
  118. /**
  119. * Get the best current direct path
  120. *
  121. * @param now Current time
  122. * @param includeDead If true, include even expired paths
  123. * @return Best current path or NULL if none
  124. */
  125. SharedPtr<Path> getBestPath(uint64_t now,bool includeExpired);
  126. /**
  127. * Send a HELLO to this peer at a specified physical address
  128. *
  129. * No statistics or sent times are updated here.
  130. *
  131. * @param localAddr Local address
  132. * @param atAddress Destination address
  133. * @param now Current time
  134. */
  135. void sendHELLO(const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now);
  136. /**
  137. * Send ECHO (or HELLO for older peers) to this peer at the given address
  138. *
  139. * No statistics or sent times are updated here.
  140. *
  141. * @param localAddr Local address
  142. * @param atAddress Destination address
  143. * @param now Current time
  144. */
  145. void attemptToContactAt(const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now);
  146. /**
  147. * Try a memorized or statically defined path if any are known
  148. *
  149. * Under the hood this is done periodically based on ZT_TRY_MEMORIZED_PATH_INTERVAL.
  150. */
  151. void tryMemorizedPath(uint64_t now);
  152. /**
  153. * Send pings or keepalives depending on configured timeouts
  154. *
  155. * @param now Current time
  156. * @param inetAddressFamily Keep this address family alive, or -1 for any
  157. * @return True if we have at least one direct path of the given family (or any if family is -1)
  158. */
  159. bool doPingAndKeepalive(uint64_t now,int inetAddressFamily);
  160. /**
  161. * @param now Current time
  162. * @return True if this peer has at least one active and alive direct path
  163. */
  164. bool hasActiveDirectPath(uint64_t now) const;
  165. /**
  166. * Reset paths within a given IP scope and address family
  167. *
  168. * Resetting a path involves sending an ECHO to it and then deactivating
  169. * it until or unless it responds.
  170. *
  171. * @param scope IP scope
  172. * @param inetAddressFamily Family e.g. AF_INET
  173. * @param now Current time
  174. */
  175. void resetWithinScope(InetAddress::IpScope scope,int inetAddressFamily,uint64_t now);
  176. /**
  177. * Get most recently active path addresses for IPv4 and/or IPv6
  178. *
  179. * Note that v4 and v6 are not modified if they are not found, so
  180. * initialize these to a NULL address to be able to check.
  181. *
  182. * @param now Current time
  183. * @param v4 Result parameter to receive active IPv4 address, if any
  184. * @param v6 Result parameter to receive active IPv6 address, if any
  185. */
  186. void getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const;
  187. /**
  188. * @param now Current time
  189. * @return All known direct paths to this peer and whether they are expired (true == expired)
  190. */
  191. inline std::vector< std::pair< SharedPtr<Path>,bool > > paths(const uint64_t now) const
  192. {
  193. std::vector< std::pair< SharedPtr<Path>,bool > > pp;
  194. Mutex::Lock _l(_paths_m);
  195. for(unsigned int p=0,np=_numPaths;p<np;++p)
  196. pp.push_back(std::pair< SharedPtr<Path>,bool >(_paths[p].path,(now - _paths[p].lastReceive) > ZT_PEER_PATH_EXPIRATION));
  197. return pp;
  198. }
  199. /**
  200. * @return Time of last receive of anything, whether direct or relayed
  201. */
  202. inline uint64_t lastReceive() const { return _lastReceive; }
  203. /**
  204. * @return True if we've heard from this peer in less than ZT_PEER_ACTIVITY_TIMEOUT
  205. */
  206. inline bool isAlive(const uint64_t now) const { return ((now - _lastReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  207. /**
  208. * @return True if this peer has sent us real network traffic recently
  209. */
  210. inline uint64_t isActive(uint64_t now) const { return ((now - _lastNontrivialReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  211. /**
  212. * @return Latency in milliseconds or 0 if unknown
  213. */
  214. inline unsigned int latency() const { return _latency; }
  215. /**
  216. * This computes a quality score for relays and root servers
  217. *
  218. * If we haven't heard anything from these in ZT_PEER_ACTIVITY_TIMEOUT, they
  219. * receive the worst possible quality (max unsigned int). Otherwise the
  220. * quality is a product of latency and the number of potential missed
  221. * pings. This causes roots and relays to switch over a bit faster if they
  222. * fail.
  223. *
  224. * @return Relay quality score computed from latency and other factors, lower is better
  225. */
  226. inline unsigned int relayQuality(const uint64_t now) const
  227. {
  228. const uint64_t tsr = now - _lastReceive;
  229. if (tsr >= ZT_PEER_ACTIVITY_TIMEOUT)
  230. return (~(unsigned int)0);
  231. unsigned int l = _latency;
  232. if (!l)
  233. l = 0xffff;
  234. return (l * (((unsigned int)tsr / (ZT_PEER_PING_PERIOD + 1000)) + 1));
  235. }
  236. /**
  237. * Update latency with a new direct measurment
  238. *
  239. * @param l Direct latency measurment in ms
  240. */
  241. inline void addDirectLatencyMeasurment(unsigned int l)
  242. {
  243. unsigned int ol = _latency;
  244. if ((ol > 0)&&(ol < 10000))
  245. _latency = (ol + std::min(l,(unsigned int)65535)) / 2;
  246. else _latency = std::min(l,(unsigned int)65535);
  247. }
  248. #ifdef ZT_ENABLE_CLUSTER
  249. /**
  250. * @param now Current time
  251. * @return True if this peer has at least one active direct path that is not cluster-suboptimal
  252. */
  253. inline bool hasLocalClusterOptimalPath(uint64_t now) const
  254. {
  255. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  256. if ( (_paths[p].path->alive(now)) && (!_paths[p].localClusterSuboptimal) )
  257. return true;
  258. }
  259. return false;
  260. }
  261. #endif
  262. /**
  263. * @return 256-bit secret symmetric encryption key
  264. */
  265. inline const unsigned char *key() const { return _key; }
  266. /**
  267. * Set the currently known remote version of this peer's client
  268. *
  269. * @param vproto Protocol version
  270. * @param vmaj Major version
  271. * @param vmin Minor version
  272. * @param vrev Revision
  273. */
  274. inline void setRemoteVersion(unsigned int vproto,unsigned int vmaj,unsigned int vmin,unsigned int vrev)
  275. {
  276. _vProto = (uint16_t)vproto;
  277. _vMajor = (uint16_t)vmaj;
  278. _vMinor = (uint16_t)vmin;
  279. _vRevision = (uint16_t)vrev;
  280. }
  281. inline unsigned int remoteVersionProtocol() const { return _vProto; }
  282. inline unsigned int remoteVersionMajor() const { return _vMajor; }
  283. inline unsigned int remoteVersionMinor() const { return _vMinor; }
  284. inline unsigned int remoteVersionRevision() const { return _vRevision; }
  285. inline bool remoteVersionKnown() const { return ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)); }
  286. /**
  287. * @return True if peer has received a trust established packet (e.g. common network membership) in the past ZT_TRUST_EXPIRATION ms
  288. */
  289. inline bool trustEstablished(const uint64_t now) const { return ((now - _lastTrustEstablishedPacketReceived) < ZT_TRUST_EXPIRATION); }
  290. /**
  291. * Rate limit gate for VERB_PUSH_DIRECT_PATHS
  292. */
  293. inline bool rateGatePushDirectPaths(const uint64_t now)
  294. {
  295. if ((now - _lastDirectPathPushReceive) <= ZT_PUSH_DIRECT_PATHS_CUTOFF_TIME)
  296. ++_directPathPushCutoffCount;
  297. else _directPathPushCutoffCount = 0;
  298. _lastDirectPathPushReceive = now;
  299. return (_directPathPushCutoffCount < ZT_PUSH_DIRECT_PATHS_CUTOFF_LIMIT);
  300. }
  301. /**
  302. * Rate limit gate for VERB_NETWORK_CREDENTIALS
  303. */
  304. inline bool rateGateCredentialsReceived(const uint64_t now)
  305. {
  306. if ((now - _lastCredentialsReceived) <= ZT_PEER_CREDENTIALS_CUTOFF_TIME)
  307. ++_credentialsCutoffCount;
  308. else _credentialsCutoffCount = 0;
  309. _lastCredentialsReceived = now;
  310. return (_directPathPushCutoffCount < ZT_PEER_CREDEITIALS_CUTOFF_LIMIT);
  311. }
  312. /**
  313. * Rate limit gate for sending of ERROR_NEED_MEMBERSHIP_CERTIFICATE
  314. */
  315. inline bool rateGateRequestCredentials(const uint64_t now)
  316. {
  317. if ((now - _lastCredentialRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  318. _lastCredentialRequestSent = now;
  319. return true;
  320. }
  321. return false;
  322. }
  323. /**
  324. * Rate limit gate for inbound WHOIS requests
  325. */
  326. inline bool rateGateInboundWhoisRequest(const uint64_t now)
  327. {
  328. if ((now - _lastWhoisRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  329. _lastWhoisRequestReceived = now;
  330. return true;
  331. }
  332. return false;
  333. }
  334. /**
  335. * Rate limit gate for inbound ECHO requests
  336. */
  337. inline bool rateGateEchoRequest(const uint64_t now)
  338. {
  339. if ((now - _lastEchoRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  340. _lastEchoRequestReceived = now;
  341. return true;
  342. }
  343. return false;
  344. }
  345. /**
  346. * Rate gate incoming requests for network COM
  347. */
  348. inline bool rateGateIncomingComRequest(const uint64_t now)
  349. {
  350. if ((now - _lastComRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  351. _lastComRequestReceived = now;
  352. return true;
  353. }
  354. return false;
  355. }
  356. /**
  357. * Rate gate outgoing requests for network COM
  358. */
  359. inline bool rateGateOutgoingComRequest(const uint64_t now)
  360. {
  361. if ((now - _lastComRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  362. _lastComRequestSent = now;
  363. return true;
  364. }
  365. return false;
  366. }
  367. private:
  368. inline uint64_t _pathScore(const unsigned int p,const uint64_t now) const
  369. {
  370. uint64_t s = ZT_PEER_PING_PERIOD + _paths[p].lastReceive + (uint64_t)(_paths[p].path->preferenceRank() * (ZT_PEER_PING_PERIOD / ZT_PATH_MAX_PREFERENCE_RANK));
  371. if (_paths[p].path->address().ss_family == AF_INET) {
  372. s += (uint64_t)(ZT_PEER_PING_PERIOD * (unsigned long)(reinterpret_cast<const struct sockaddr_in *>(&(_paths[p].path->address()))->sin_addr.s_addr == _remoteClusterOptimal4));
  373. } else if (_paths[p].path->address().ss_family == AF_INET6) {
  374. uint64_t clusterWeight = ZT_PEER_PING_PERIOD;
  375. const uint8_t *a = reinterpret_cast<const uint8_t *>(reinterpret_cast<const struct sockaddr_in6 *>(&(_paths[p].path->address()))->sin6_addr.s6_addr);
  376. for(long i=0;i<16;++i) {
  377. if (a[i] != _remoteClusterOptimal6[i]) {
  378. clusterWeight = 0;
  379. break;
  380. }
  381. }
  382. s += clusterWeight;
  383. }
  384. s += (ZT_PEER_PING_PERIOD / 2) * (uint64_t)_paths[p].path->alive(now);
  385. #ifdef ZT_ENABLE_CLUSTER
  386. s -= ZT_PEER_PING_PERIOD * (uint64_t)_paths[p].localClusterSuboptimal;
  387. #endif
  388. return s;
  389. }
  390. uint8_t _key[ZT_PEER_SECRET_KEY_LENGTH];
  391. uint8_t _remoteClusterOptimal6[16];
  392. uint64_t _lastReceive; // direct or indirect
  393. uint64_t _lastNontrivialReceive; // frames, things like netconf, etc.
  394. uint64_t _lastTriedMemorizedPath;
  395. uint64_t _lastDirectPathPushSent;
  396. uint64_t _lastDirectPathPushReceive;
  397. uint64_t _lastCredentialRequestSent;
  398. uint64_t _lastWhoisRequestReceived;
  399. uint64_t _lastEchoRequestReceived;
  400. uint64_t _lastComRequestReceived;
  401. uint64_t _lastComRequestSent;
  402. uint64_t _lastCredentialsReceived;
  403. uint64_t _lastTrustEstablishedPacketReceived;
  404. const RuntimeEnvironment *RR;
  405. uint32_t _remoteClusterOptimal4;
  406. uint16_t _vProto;
  407. uint16_t _vMajor;
  408. uint16_t _vMinor;
  409. uint16_t _vRevision;
  410. Identity _id;
  411. struct {
  412. uint64_t lastReceive;
  413. SharedPtr<Path> path;
  414. #ifdef ZT_ENABLE_CLUSTER
  415. bool localClusterSuboptimal;
  416. #endif
  417. } _paths[ZT_MAX_PEER_NETWORK_PATHS];
  418. Mutex _paths_m;
  419. unsigned int _numPaths;
  420. unsigned int _latency;
  421. unsigned int _directPathPushCutoffCount;
  422. unsigned int _credentialsCutoffCount;
  423. AtomicCounter __refCount;
  424. };
  425. } // namespace ZeroTier
  426. // Add a swap() for shared ptr's to peers to speed up peer sorts
  427. namespace std {
  428. template<>
  429. inline void swap(ZeroTier::SharedPtr<ZeroTier::Peer> &a,ZeroTier::SharedPtr<ZeroTier::Peer> &b)
  430. {
  431. a.swap(b);
  432. }
  433. }
  434. #endif