Peer.hpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592
  1. /*
  2. * Copyright (c)2013-2020 ZeroTier, Inc.
  3. *
  4. * Use of this software is governed by the Business Source License included
  5. * in the LICENSE.TXT file in the project's root directory.
  6. *
  7. * Change Date: 2025-01-01
  8. *
  9. * On the date above, in accordance with the Business Source License, use
  10. * of this software will be governed by version 2.0 of the Apache License.
  11. */
  12. /****/
  13. #ifndef ZT_PEER_HPP
  14. #define ZT_PEER_HPP
  15. #include <vector>
  16. #include <list>
  17. #include "../include/ZeroTierOne.h"
  18. #include "Constants.hpp"
  19. #include "RuntimeEnvironment.hpp"
  20. #include "Node.hpp"
  21. #include "Path.hpp"
  22. #include "Address.hpp"
  23. #include "Utils.hpp"
  24. #include "Identity.hpp"
  25. #include "InetAddress.hpp"
  26. #include "Packet.hpp"
  27. #include "SharedPtr.hpp"
  28. #include "AtomicCounter.hpp"
  29. #include "Hashtable.hpp"
  30. #include "Mutex.hpp"
  31. #include "Bond.hpp"
  32. #include "AES.hpp"
  33. #define ZT_PEER_MAX_SERIALIZED_STATE_SIZE (sizeof(Peer) + 32 + (sizeof(Path) * 2))
  34. namespace ZeroTier {
  35. /**
  36. * Peer on P2P Network (virtual layer 1)
  37. */
  38. class Peer
  39. {
  40. friend class SharedPtr<Peer>;
  41. friend class SharedPtr<Bond>;
  42. friend class Switch;
  43. friend class Bond;
  44. private:
  45. Peer() {} // disabled to prevent bugs -- should not be constructed uninitialized
  46. public:
  47. ~Peer() {
  48. Utils::burn(_key,sizeof(_key));
  49. RR->bc->destroyBond(_id.address().toInt());
  50. }
  51. /**
  52. * Construct a new peer
  53. *
  54. * @param renv Runtime environment
  55. * @param myIdentity Identity of THIS node (for key agreement)
  56. * @param peerIdentity Identity of peer
  57. * @throws std::runtime_error Key agreement with peer's identity failed
  58. */
  59. Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity);
  60. /**
  61. * @return This peer's ZT address (short for identity().address())
  62. */
  63. inline const Address &address() const { return _id.address(); }
  64. /**
  65. * @return This peer's identity
  66. */
  67. inline const Identity &identity() const { return _id; }
  68. /**
  69. * Log receipt of an authenticated packet
  70. *
  71. * This is called by the decode pipe when a packet is proven to be authentic
  72. * and appears to be valid.
  73. *
  74. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  75. * @param path Path over which packet was received
  76. * @param hops ZeroTier (not IP) hops
  77. * @param packetId Packet ID
  78. * @param verb Packet verb
  79. * @param inRePacketId Packet ID in reply to (default: none)
  80. * @param inReVerb Verb in reply to (for OK/ERROR, default: VERB_NOP)
  81. * @param trustEstablished If true, some form of non-trivial trust (like allowed in network) has been established
  82. * @param networkId Network ID if this pertains to a network, or 0 otherwise
  83. */
  84. void received(
  85. void *tPtr,
  86. const SharedPtr<Path> &path,
  87. const unsigned int hops,
  88. const uint64_t packetId,
  89. const unsigned int payloadLength,
  90. const Packet::Verb verb,
  91. const uint64_t inRePacketId,
  92. const Packet::Verb inReVerb,
  93. const bool trustEstablished,
  94. const uint64_t networkId,
  95. const int32_t flowId);
  96. /**
  97. * Check whether we have an active path to this peer via the given address
  98. *
  99. * @param now Current time
  100. * @param addr Remote address
  101. * @return True if we have an active path to this destination
  102. */
  103. inline bool hasActivePathTo(int64_t now,const InetAddress &addr) const
  104. {
  105. Mutex::Lock _l(_paths_m);
  106. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  107. if (_paths[i].p) {
  108. if (((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION)&&(_paths[i].p->address() == addr))
  109. return true;
  110. } else break;
  111. }
  112. return false;
  113. }
  114. /**
  115. * Send via best direct path
  116. *
  117. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  118. * @param data Packet data
  119. * @param len Packet length
  120. * @param now Current time
  121. * @param force If true, send even if path is not alive
  122. * @return True if we actually sent something
  123. */
  124. inline bool sendDirect(void *tPtr,const void *data,unsigned int len,int64_t now,bool force)
  125. {
  126. SharedPtr<Path> bp(getAppropriatePath(now,force));
  127. if (bp)
  128. return bp->send(RR,tPtr,data,len,now);
  129. return false;
  130. }
  131. /**
  132. * Record incoming packets to
  133. *
  134. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  135. * @param path Path over which packet was received
  136. * @param packetId Packet ID
  137. * @param payloadLength Length of packet data payload
  138. * @param verb Packet verb
  139. * @param flowId Flow ID
  140. * @param now Current time
  141. */
  142. void recordIncomingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  143. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now);
  144. /**
  145. *
  146. * @param path Path over which packet is being sent
  147. * @param packetId Packet ID
  148. * @param payloadLength Length of packet data payload
  149. * @param verb Packet verb
  150. * @param flowId Flow ID
  151. * @param now Current time
  152. */
  153. void recordOutgoingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  154. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now);
  155. /**
  156. * Record an invalid incoming packet. This packet failed
  157. * MAC/compression/cipher checks and will now contribute to a
  158. * Packet Error Ratio (PER).
  159. *
  160. * @param path Path over which packet was received
  161. */
  162. void recordIncomingInvalidPacket(const SharedPtr<Path>& path);
  163. /**
  164. * Get the most appropriate direct path based on current multipath and QoS configuration
  165. *
  166. * @param now Current time
  167. * @param includeExpired If true, include even expired paths
  168. * @return Best current path or NULL if none
  169. */
  170. SharedPtr<Path> getAppropriatePath(int64_t now, bool includeExpired, int32_t flowId = -1);
  171. /**
  172. * Send VERB_RENDEZVOUS to this and another peer via the best common IP scope and path
  173. */
  174. void introduce(void *const tPtr,const int64_t now,const SharedPtr<Peer> &other) const;
  175. /**
  176. * Send a HELLO to this peer at a specified physical address
  177. *
  178. * No statistics or sent times are updated here.
  179. *
  180. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  181. * @param localSocket Local source socket
  182. * @param atAddress Destination address
  183. * @param now Current time
  184. */
  185. void sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now);
  186. /**
  187. * Send ECHO (or HELLO for older peers) to this peer at the given address
  188. *
  189. * No statistics or sent times are updated here.
  190. *
  191. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  192. * @param localSocket Local source socket
  193. * @param atAddress Destination address
  194. * @param now Current time
  195. * @param sendFullHello If true, always send a full HELLO instead of just an ECHO
  196. */
  197. void attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now,bool sendFullHello);
  198. /**
  199. * Try a memorized or statically defined path if any are known
  200. *
  201. * Under the hood this is done periodically based on ZT_TRY_MEMORIZED_PATH_INTERVAL.
  202. *
  203. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  204. * @param now Current time
  205. */
  206. void tryMemorizedPath(void *tPtr,int64_t now);
  207. /**
  208. * A check to be performed periodically which determines whether multipath communication is
  209. * possible with this peer. This check should be performed early in the life-cycle of the peer
  210. * as well as during the process of learning new paths.
  211. */
  212. void performMultipathStateCheck(void *tPtr, int64_t now);
  213. /**
  214. * Send pings or keepalives depending on configured timeouts
  215. *
  216. * This also cleans up some internal data structures. It's called periodically from Node.
  217. *
  218. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  219. * @param now Current time
  220. * @param inetAddressFamily Keep this address family alive, or -1 for any
  221. * @return 0 if nothing sent or bit mask: bit 0x1 if IPv4 sent, bit 0x2 if IPv6 sent (0x3 means both sent)
  222. */
  223. unsigned int doPingAndKeepalive(void *tPtr,int64_t now);
  224. /**
  225. * Process a cluster redirect sent by this peer
  226. *
  227. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  228. * @param originatingPath Path from which redirect originated
  229. * @param remoteAddress Remote address
  230. * @param now Current time
  231. */
  232. void clusterRedirect(void *tPtr,const SharedPtr<Path> &originatingPath,const InetAddress &remoteAddress,const int64_t now);
  233. /**
  234. * Reset paths within a given IP scope and address family
  235. *
  236. * Resetting a path involves sending an ECHO to it and then deactivating
  237. * it until or unless it responds. This is done when we detect a change
  238. * to our external IP or another system change that might invalidate
  239. * many or all current paths.
  240. *
  241. * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
  242. * @param scope IP scope
  243. * @param inetAddressFamily Family e.g. AF_INET
  244. * @param now Current time
  245. */
  246. void resetWithinScope(void *tPtr,InetAddress::IpScope scope,int inetAddressFamily,int64_t now);
  247. /**
  248. * @param now Current time
  249. * @return All known paths to this peer
  250. */
  251. inline std::vector< SharedPtr<Path> > paths(const int64_t now) const
  252. {
  253. std::vector< SharedPtr<Path> > pp;
  254. Mutex::Lock _l(_paths_m);
  255. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  256. if (!_paths[i].p) break;
  257. pp.push_back(_paths[i].p);
  258. }
  259. return pp;
  260. }
  261. /**
  262. * @return Time of last receive of anything, whether direct or relayed
  263. */
  264. inline int64_t lastReceive() const { return _lastReceive; }
  265. /**
  266. * @return True if we've heard from this peer in less than ZT_PEER_ACTIVITY_TIMEOUT
  267. */
  268. inline bool isAlive(const int64_t now) const { return ((now - _lastReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  269. /**
  270. * @return True if this peer has sent us real network traffic recently
  271. */
  272. inline int64_t isActive(int64_t now) const { return ((now - _lastNontrivialReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
  273. inline int64_t lastSentFullHello() { return _lastSentFullHello; }
  274. /**
  275. * @return Latency in milliseconds of best/aggregate path or 0xffff if unknown / no paths
  276. */
  277. inline unsigned int latency(const int64_t now)
  278. {
  279. if (_localMultipathSupported) {
  280. return (int)_lastComputedAggregateMeanLatency;
  281. } else {
  282. SharedPtr<Path> bp(getAppropriatePath(now,false));
  283. if (bp) {
  284. return bp->latency();
  285. }
  286. return 0xffff;
  287. }
  288. }
  289. /**
  290. * This computes a quality score for relays and root servers
  291. *
  292. * If we haven't heard anything from these in ZT_PEER_ACTIVITY_TIMEOUT, they
  293. * receive the worst possible quality (max unsigned int). Otherwise the
  294. * quality is a product of latency and the number of potential missed
  295. * pings. This causes roots and relays to switch over a bit faster if they
  296. * fail.
  297. *
  298. * @return Relay quality score computed from latency and other factors, lower is better
  299. */
  300. inline unsigned int relayQuality(const int64_t now)
  301. {
  302. const uint64_t tsr = now - _lastReceive;
  303. if (tsr >= ZT_PEER_ACTIVITY_TIMEOUT)
  304. return (~(unsigned int)0);
  305. unsigned int l = latency(now);
  306. if (!l)
  307. l = 0xffff;
  308. return (l * (((unsigned int)tsr / (ZT_PEER_PING_PERIOD + 1000)) + 1));
  309. }
  310. /**
  311. * @return 256-bit secret symmetric encryption key
  312. */
  313. inline const unsigned char *key() const { return _key; }
  314. /**
  315. * Set the currently known remote version of this peer's client
  316. *
  317. * @param vproto Protocol version
  318. * @param vmaj Major version
  319. * @param vmin Minor version
  320. * @param vrev Revision
  321. */
  322. inline void setRemoteVersion(unsigned int vproto,unsigned int vmaj,unsigned int vmin,unsigned int vrev)
  323. {
  324. _vProto = (uint16_t)vproto;
  325. _vMajor = (uint16_t)vmaj;
  326. _vMinor = (uint16_t)vmin;
  327. _vRevision = (uint16_t)vrev;
  328. }
  329. inline unsigned int remoteVersionProtocol() const { return _vProto; }
  330. inline unsigned int remoteVersionMajor() const { return _vMajor; }
  331. inline unsigned int remoteVersionMinor() const { return _vMinor; }
  332. inline unsigned int remoteVersionRevision() const { return _vRevision; }
  333. inline bool remoteVersionKnown() const { return ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)); }
  334. /**
  335. * @return True if peer has received a trust established packet (e.g. common network membership) in the past ZT_TRUST_EXPIRATION ms
  336. */
  337. inline bool trustEstablished(const int64_t now) const { return ((now - _lastTrustEstablishedPacketReceived) < ZT_TRUST_EXPIRATION); }
  338. /**
  339. * Rate limit gate for VERB_PUSH_DIRECT_PATHS
  340. */
  341. inline bool rateGatePushDirectPaths(const int64_t now)
  342. {
  343. if ((now - _lastDirectPathPushReceive) <= ZT_PUSH_DIRECT_PATHS_CUTOFF_TIME)
  344. ++_directPathPushCutoffCount;
  345. else _directPathPushCutoffCount = 0;
  346. _lastDirectPathPushReceive = now;
  347. return (_directPathPushCutoffCount < ZT_PUSH_DIRECT_PATHS_CUTOFF_LIMIT);
  348. }
  349. /**
  350. * Rate limit gate for VERB_NETWORK_CREDENTIALS
  351. */
  352. inline bool rateGateCredentialsReceived(const int64_t now)
  353. {
  354. if ((now - _lastCredentialsReceived) >= ZT_PEER_CREDENTIALS_RATE_LIMIT) {
  355. _lastCredentialsReceived = now;
  356. return true;
  357. }
  358. return false;
  359. }
  360. /**
  361. * Rate limit gate for sending of ERROR_NEED_MEMBERSHIP_CERTIFICATE
  362. */
  363. inline bool rateGateRequestCredentials(const int64_t now)
  364. {
  365. if ((now - _lastCredentialRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
  366. _lastCredentialRequestSent = now;
  367. return true;
  368. }
  369. return false;
  370. }
  371. /**
  372. * Rate limit gate for inbound WHOIS requests
  373. */
  374. inline bool rateGateInboundWhoisRequest(const int64_t now)
  375. {
  376. if ((now - _lastWhoisRequestReceived) >= ZT_PEER_WHOIS_RATE_LIMIT) {
  377. _lastWhoisRequestReceived = now;
  378. return true;
  379. }
  380. return false;
  381. }
  382. /**
  383. * Serialize a peer for storage in local cache
  384. *
  385. * This does not serialize everything, just non-ephemeral information.
  386. */
  387. template<unsigned int C>
  388. inline void serializeForCache(Buffer<C> &b) const
  389. {
  390. b.append((uint8_t)2);
  391. _id.serialize(b);
  392. b.append((uint16_t)_vProto);
  393. b.append((uint16_t)_vMajor);
  394. b.append((uint16_t)_vMinor);
  395. b.append((uint16_t)_vRevision);
  396. {
  397. Mutex::Lock _l(_paths_m);
  398. unsigned int pc = 0;
  399. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  400. if (_paths[i].p)
  401. ++pc;
  402. else break;
  403. }
  404. b.append((uint16_t)pc);
  405. for(unsigned int i=0;i<pc;++i)
  406. _paths[i].p->address().serialize(b);
  407. }
  408. }
  409. template<unsigned int C>
  410. inline static SharedPtr<Peer> deserializeFromCache(int64_t now,void *tPtr,Buffer<C> &b,const RuntimeEnvironment *renv)
  411. {
  412. try {
  413. unsigned int ptr = 0;
  414. if (b[ptr++] != 2)
  415. return SharedPtr<Peer>();
  416. Identity id;
  417. ptr += id.deserialize(b,ptr);
  418. if (!id)
  419. return SharedPtr<Peer>();
  420. SharedPtr<Peer> p(new Peer(renv,renv->identity,id));
  421. p->_vProto = b.template at<uint16_t>(ptr); ptr += 2;
  422. p->_vMajor = b.template at<uint16_t>(ptr); ptr += 2;
  423. p->_vMinor = b.template at<uint16_t>(ptr); ptr += 2;
  424. p->_vRevision = b.template at<uint16_t>(ptr); ptr += 2;
  425. // When we deserialize from the cache we don't actually restore paths. We
  426. // just try them and then re-learn them if they happen to still be up.
  427. // Paths are fairly ephemeral in the real world in most cases.
  428. const unsigned int tryPathCount = b.template at<uint16_t>(ptr); ptr += 2;
  429. for(unsigned int i=0;i<tryPathCount;++i) {
  430. InetAddress inaddr;
  431. try {
  432. ptr += inaddr.deserialize(b,ptr);
  433. if (inaddr)
  434. p->attemptToContactAt(tPtr,-1,inaddr,now,true);
  435. } catch ( ... ) {
  436. break;
  437. }
  438. }
  439. return p;
  440. } catch ( ... ) {
  441. return SharedPtr<Peer>();
  442. }
  443. }
  444. /**
  445. * @return The bonding policy used to reach this peer
  446. */
  447. SharedPtr<Bond> bond() { return _bond; }
  448. /**
  449. * @return The bonding policy used to reach this peer
  450. */
  451. inline int8_t bondingPolicy() {
  452. Mutex::Lock _l(_paths_m);
  453. if (_bond) {
  454. return _bond->policy();
  455. }
  456. return ZT_BOND_POLICY_NONE;
  457. }
  458. //inline const AES *aesKeysIfSupported() const
  459. //{ return (const AES *)0; }
  460. inline const AES *aesKeysIfSupported() const
  461. { return (_vProto >= 12) ? _aesKeys : (const AES *)0; }
  462. inline const AES *aesKeys() const
  463. { return _aesKeys; }
  464. private:
  465. struct _PeerPath
  466. {
  467. _PeerPath() : lr(0),p(),priority(1) {}
  468. int64_t lr; // time of last valid ZeroTier packet
  469. SharedPtr<Path> p;
  470. long priority; // >= 1, higher is better
  471. };
  472. uint8_t _key[ZT_SYMMETRIC_KEY_SIZE];
  473. AES _aesKeys[2];
  474. const RuntimeEnvironment *RR;
  475. int64_t _lastReceive; // direct or indirect
  476. int64_t _lastNontrivialReceive; // frames, things like netconf, etc.
  477. int64_t _lastTriedMemorizedPath;
  478. int64_t _lastDirectPathPushSent;
  479. int64_t _lastDirectPathPushReceive;
  480. int64_t _lastCredentialRequestSent;
  481. int64_t _lastWhoisRequestReceived;
  482. int64_t _lastCredentialsReceived;
  483. int64_t _lastTrustEstablishedPacketReceived;
  484. int64_t _lastSentFullHello;
  485. int64_t _lastEchoCheck;
  486. unsigned char _freeRandomByte;
  487. uint16_t _vProto;
  488. uint16_t _vMajor;
  489. uint16_t _vMinor;
  490. uint16_t _vRevision;
  491. std::list< std::pair< Path *, int64_t > > _lastTriedPath;
  492. Mutex _lastTriedPath_m;
  493. _PeerPath _paths[ZT_MAX_PEER_NETWORK_PATHS];
  494. Mutex _paths_m;
  495. Mutex _bond_m;
  496. bool _isLeaf;
  497. Identity _id;
  498. unsigned int _directPathPushCutoffCount;
  499. unsigned int _echoRequestCutoffCount;
  500. AtomicCounter __refCount;
  501. bool _localMultipathSupported;
  502. volatile bool _shouldCollectPathStatistics;
  503. int32_t _lastComputedAggregateMeanLatency;
  504. SharedPtr<Bond> _bond;
  505. };
  506. } // namespace ZeroTier
  507. // Add a swap() for shared ptr's to peers to speed up peer sorts
  508. namespace std {
  509. template<>
  510. inline void swap(ZeroTier::SharedPtr<ZeroTier::Peer> &a,ZeroTier::SharedPtr<ZeroTier::Peer> &b)
  511. {
  512. a.swap(b);
  513. }
  514. }
  515. #endif