Peer.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481
  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. * Send pings or keepalives depending on configured timeouts
  148. *
  149. * @param now Current time
  150. * @param inetAddressFamily Keep this address family alive, or -1 for any
  151. * @return True if we have at least one direct path of the given family (or any if family is -1)
  152. */
  153. bool doPingAndKeepalive(uint64_t now,int inetAddressFamily);
  154. /**
  155. * @param now Current time
  156. * @return True if this peer has at least one active and alive direct path
  157. */
  158. bool hasActiveDirectPath(uint64_t now) const;
  159. /**
  160. * Reset paths within a given IP scope and address family
  161. *
  162. * Resetting a path involves sending an ECHO to it and then deactivating
  163. * it until or unless it responds.
  164. *
  165. * @param scope IP scope
  166. * @param inetAddressFamily Family e.g. AF_INET
  167. * @param now Current time
  168. */
  169. void resetWithinScope(InetAddress::IpScope scope,int inetAddressFamily,uint64_t now);
  170. /**
  171. * Get most recently active path addresses for IPv4 and/or IPv6
  172. *
  173. * Note that v4 and v6 are not modified if they are not found, so
  174. * initialize these to a NULL address to be able to check.
  175. *
  176. * @param now Current time
  177. * @param v4 Result parameter to receive active IPv4 address, if any
  178. * @param v6 Result parameter to receive active IPv6 address, if any
  179. */
  180. void getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const;
  181. /**
  182. * @param now Current time
  183. * @return All known direct paths to this peer and whether they are expired (true == expired)
  184. */
  185. inline std::vector< std::pair< SharedPtr<Path>,bool > > paths(const uint64_t now) const
  186. {
  187. std::vector< std::pair< SharedPtr<Path>,bool > > pp;
  188. Mutex::Lock _l(_paths_m);
  189. for(unsigned int p=0,np=_numPaths;p<np;++p)
  190. pp.push_back(std::pair< SharedPtr<Path>,bool >(_paths[p].path,(now - _paths[p].lastReceive) > ZT_PEER_PATH_EXPIRATION));
  191. return pp;
  192. }
  193. /**
  194. * @return Time of last receive of anything, whether direct or relayed
  195. */
  196. inline uint64_t lastReceive() const { return _lastReceive; }
  197. /**
  198. * @return True if we've heard from this peer in less than ZT_PEER_ACTIVITY_TIMEOUT
  199. */
  200. inline bool isAlive(const uint64_t now) const { return ((now - _lastReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  201. /**
  202. * @return True if this peer has sent us real network traffic recently
  203. */
  204. inline uint64_t isActive(uint64_t now) const { return ((now - _lastNontrivialReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  205. /**
  206. * @return Latency in milliseconds or 0 if unknown
  207. */
  208. inline unsigned int latency() const { return _latency; }
  209. /**
  210. * This computes a quality score for relays and root servers
  211. *
  212. * If we haven't heard anything from these in ZT_PEER_ACTIVITY_TIMEOUT, they
  213. * receive the worst possible quality (max unsigned int). Otherwise the
  214. * quality is a product of latency and the number of potential missed
  215. * pings. This causes roots and relays to switch over a bit faster if they
  216. * fail.
  217. *
  218. * @return Relay quality score computed from latency and other factors, lower is better
  219. */
  220. inline unsigned int relayQuality(const uint64_t now) const
  221. {
  222. const uint64_t tsr = now - _lastReceive;
  223. if (tsr >= ZT_PEER_ACTIVITY_TIMEOUT)
  224. return (~(unsigned int)0);
  225. unsigned int l = _latency;
  226. if (!l)
  227. l = 0xffff;
  228. return (l * (((unsigned int)tsr / (ZT_PEER_PING_PERIOD + 1000)) + 1));
  229. }
  230. /**
  231. * Update latency with a new direct measurment
  232. *
  233. * @param l Direct latency measurment in ms
  234. */
  235. inline void addDirectLatencyMeasurment(unsigned int l)
  236. {
  237. unsigned int ol = _latency;
  238. if ((ol > 0)&&(ol < 10000))
  239. _latency = (ol + std::min(l,(unsigned int)65535)) / 2;
  240. else _latency = std::min(l,(unsigned int)65535);
  241. }
  242. #ifdef ZT_ENABLE_CLUSTER
  243. /**
  244. * @param now Current time
  245. * @return True if this peer has at least one active direct path that is not cluster-suboptimal
  246. */
  247. inline bool hasLocalClusterOptimalPath(uint64_t now) const
  248. {
  249. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  250. if ( (_paths[p].path->alive(now)) && (!_paths[p].localClusterSuboptimal) )
  251. return true;
  252. }
  253. return false;
  254. }
  255. #endif
  256. /**
  257. * @return 256-bit secret symmetric encryption key
  258. */
  259. inline const unsigned char *key() const { return _key; }
  260. /**
  261. * Set the currently known remote version of this peer's client
  262. *
  263. * @param vproto Protocol version
  264. * @param vmaj Major version
  265. * @param vmin Minor version
  266. * @param vrev Revision
  267. */
  268. inline void setRemoteVersion(unsigned int vproto,unsigned int vmaj,unsigned int vmin,unsigned int vrev)
  269. {
  270. _vProto = (uint16_t)vproto;
  271. _vMajor = (uint16_t)vmaj;
  272. _vMinor = (uint16_t)vmin;
  273. _vRevision = (uint16_t)vrev;
  274. }
  275. inline unsigned int remoteVersionProtocol() const { return _vProto; }
  276. inline unsigned int remoteVersionMajor() const { return _vMajor; }
  277. inline unsigned int remoteVersionMinor() const { return _vMinor; }
  278. inline unsigned int remoteVersionRevision() const { return _vRevision; }
  279. inline bool remoteVersionKnown() const { return ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)); }
  280. /**
  281. * @return True if peer has received a trust established packet (e.g. common network membership) in the past ZT_TRUST_EXPIRATION ms
  282. */
  283. inline bool trustEstablished(const uint64_t now) const { return ((now - _lastTrustEstablishedPacketReceived) < ZT_TRUST_EXPIRATION); }
  284. /**
  285. * Rate limit gate for VERB_PUSH_DIRECT_PATHS
  286. */
  287. inline bool rateGatePushDirectPaths(const uint64_t now)
  288. {
  289. if ((now - _lastDirectPathPushReceive) <= ZT_PUSH_DIRECT_PATHS_CUTOFF_TIME)
  290. ++_directPathPushCutoffCount;
  291. else _directPathPushCutoffCount = 0;
  292. _lastDirectPathPushReceive = now;
  293. return (_directPathPushCutoffCount < ZT_PUSH_DIRECT_PATHS_CUTOFF_LIMIT);
  294. }
  295. /**
  296. * Rate limit gate for VERB_NETWORK_CREDENTIALS
  297. */
  298. inline bool rateGateCredentialsReceived(const uint64_t now)
  299. {
  300. if ((now - _lastCredentialsReceived) <= ZT_PEER_CREDENTIALS_CUTOFF_TIME)
  301. ++_credentialsCutoffCount;
  302. else _credentialsCutoffCount = 0;
  303. _lastCredentialsReceived = now;
  304. return (_directPathPushCutoffCount < ZT_PEER_CREDEITIALS_CUTOFF_LIMIT);
  305. }
  306. /**
  307. * Rate limit gate for sending of ERROR_NEED_MEMBERSHIP_CERTIFICATE
  308. */
  309. inline bool rateGateRequestCredentials(const uint64_t now)
  310. {
  311. if ((now - _lastCredentialRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  312. _lastCredentialRequestSent = now;
  313. return true;
  314. }
  315. return false;
  316. }
  317. /**
  318. * Rate limit gate for inbound WHOIS requests
  319. */
  320. inline bool rateGateInboundWhoisRequest(const uint64_t now)
  321. {
  322. if ((now - _lastWhoisRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  323. _lastWhoisRequestReceived = now;
  324. return true;
  325. }
  326. return false;
  327. }
  328. /**
  329. * Rate limit gate for inbound ECHO requests
  330. */
  331. inline bool rateGateEchoRequest(const uint64_t now)
  332. {
  333. if ((now - _lastEchoRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  334. _lastEchoRequestReceived = now;
  335. return true;
  336. }
  337. return false;
  338. }
  339. /**
  340. * Rate gate incoming requests for network COM
  341. */
  342. inline bool rateGateIncomingComRequest(const uint64_t now)
  343. {
  344. if ((now - _lastComRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  345. _lastComRequestReceived = now;
  346. return true;
  347. }
  348. return false;
  349. }
  350. /**
  351. * Rate gate outgoing requests for network COM
  352. */
  353. inline bool rateGateOutgoingComRequest(const uint64_t now)
  354. {
  355. if ((now - _lastComRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  356. _lastComRequestSent = now;
  357. return true;
  358. }
  359. return false;
  360. }
  361. private:
  362. inline uint64_t _pathScore(const unsigned int p,const uint64_t now) const
  363. {
  364. 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));
  365. if (_paths[p].path->address().ss_family == AF_INET) {
  366. s += (uint64_t)(ZT_PEER_PING_PERIOD * (unsigned long)(reinterpret_cast<const struct sockaddr_in *>(&(_paths[p].path->address()))->sin_addr.s_addr == _remoteClusterOptimal4));
  367. } else if (_paths[p].path->address().ss_family == AF_INET6) {
  368. uint64_t clusterWeight = ZT_PEER_PING_PERIOD;
  369. const uint8_t *a = reinterpret_cast<const uint8_t *>(reinterpret_cast<const struct sockaddr_in6 *>(&(_paths[p].path->address()))->sin6_addr.s6_addr);
  370. for(long i=0;i<16;++i) {
  371. if (a[i] != _remoteClusterOptimal6[i]) {
  372. clusterWeight = 0;
  373. break;
  374. }
  375. }
  376. s += clusterWeight;
  377. }
  378. s += (ZT_PEER_PING_PERIOD / 2) * (uint64_t)_paths[p].path->alive(now);
  379. #ifdef ZT_ENABLE_CLUSTER
  380. s -= ZT_PEER_PING_PERIOD * (uint64_t)_paths[p].localClusterSuboptimal;
  381. #endif
  382. return s;
  383. }
  384. uint8_t _key[ZT_PEER_SECRET_KEY_LENGTH];
  385. uint8_t _remoteClusterOptimal6[16];
  386. uint64_t _lastReceive; // direct or indirect
  387. uint64_t _lastNontrivialReceive; // frames, things like netconf, etc.
  388. uint64_t _lastDirectPathPushSent;
  389. uint64_t _lastDirectPathPushReceive;
  390. uint64_t _lastCredentialRequestSent;
  391. uint64_t _lastWhoisRequestReceived;
  392. uint64_t _lastEchoRequestReceived;
  393. uint64_t _lastComRequestReceived;
  394. uint64_t _lastComRequestSent;
  395. uint64_t _lastCredentialsReceived;
  396. uint64_t _lastTrustEstablishedPacketReceived;
  397. const RuntimeEnvironment *RR;
  398. uint32_t _remoteClusterOptimal4;
  399. uint16_t _vProto;
  400. uint16_t _vMajor;
  401. uint16_t _vMinor;
  402. uint16_t _vRevision;
  403. Identity _id;
  404. struct {
  405. uint64_t lastReceive;
  406. SharedPtr<Path> path;
  407. #ifdef ZT_ENABLE_CLUSTER
  408. bool localClusterSuboptimal;
  409. #endif
  410. } _paths[ZT_MAX_PEER_NETWORK_PATHS];
  411. Mutex _paths_m;
  412. unsigned int _numPaths;
  413. unsigned int _latency;
  414. unsigned int _directPathPushCutoffCount;
  415. unsigned int _credentialsCutoffCount;
  416. AtomicCounter __refCount;
  417. };
  418. } // namespace ZeroTier
  419. // Add a swap() for shared ptr's to peers to speed up peer sorts
  420. namespace std {
  421. template<>
  422. inline void swap(ZeroTier::SharedPtr<ZeroTier::Peer> &a,ZeroTier::SharedPtr<ZeroTier::Peer> &b)
  423. {
  424. a.swap(b);
  425. }
  426. }
  427. #endif