Peer.cpp 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704
  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: 2026-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. #include "../version.h"
  14. #include "Constants.hpp"
  15. #include "Peer.hpp"
  16. #include "Identity.hpp"
  17. #include "Switch.hpp"
  18. #include "Network.hpp"
  19. #include "SelfAwareness.hpp"
  20. #include "Packet.hpp"
  21. #include "Trace.hpp"
  22. #include "InetAddress.hpp"
  23. #include "RingBuffer.hpp"
  24. #include "Utils.hpp"
  25. #include "Metrics.hpp"
  26. namespace ZeroTier {
  27. static unsigned char s_freeRandomByteCounter = 0;
  28. Peer::Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity)
  29. : RR(renv)
  30. , _lastReceive(0)
  31. , _lastNontrivialReceive(0)
  32. , _lastTriedMemorizedPath(0)
  33. , _lastDirectPathPushSent(0)
  34. , _lastDirectPathPushReceive(0)
  35. , _lastCredentialRequestSent(0)
  36. , _lastWhoisRequestReceived(0)
  37. , _lastCredentialsReceived(0)
  38. , _lastTrustEstablishedPacketReceived(0)
  39. , _lastSentFullHello(0)
  40. , _lastEchoCheck(0)
  41. , _freeRandomByte((unsigned char)((uintptr_t)this >> 4) ^ ++s_freeRandomByteCounter)
  42. , _vProto(0)
  43. , _vMajor(0)
  44. , _vMinor(0)
  45. , _vRevision(0)
  46. , _id(peerIdentity)
  47. , _directPathPushCutoffCount(0)
  48. , _echoRequestCutoffCount(0)
  49. , _localMultipathSupported(false)
  50. , _lastComputedAggregateMeanLatency(0)
  51. #ifndef ZT_NO_PEER_METRICS
  52. , _peer_latency{Metrics::peer_latency.Add({{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())}}, std::vector<uint64_t>{1,3,6,10,30,60,100,300,600,1000})}
  53. , _alive_path_count{Metrics::peer_path_count.Add({{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())},{"status","alive"}})}
  54. , _dead_path_count{Metrics::peer_path_count.Add({{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())},{"status","dead"}})}
  55. , _incoming_packet{Metrics::peer_packets.Add({{"direction", "rx"},{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())}})}
  56. , _outgoing_packet{Metrics::peer_packets.Add({{"direction", "tx"},{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())}})}
  57. , _packet_errors{Metrics::peer_packet_errors.Add({{"node_id", OSUtils::nodeIDStr(peerIdentity.address().toInt())}})}
  58. #endif
  59. {
  60. if (!myIdentity.agree(peerIdentity,_key)) {
  61. throw ZT_EXCEPTION_INVALID_ARGUMENT;
  62. }
  63. uint8_t ktmp[ZT_SYMMETRIC_KEY_SIZE];
  64. KBKDFHMACSHA384(_key,ZT_KBKDF_LABEL_AES_GMAC_SIV_K0,0,0,ktmp);
  65. _aesKeys[0].init(ktmp);
  66. KBKDFHMACSHA384(_key,ZT_KBKDF_LABEL_AES_GMAC_SIV_K1,0,0,ktmp);
  67. _aesKeys[1].init(ktmp);
  68. Utils::burn(ktmp,ZT_SYMMETRIC_KEY_SIZE);
  69. }
  70. void Peer::received(
  71. void *tPtr,
  72. const SharedPtr<Path> &path,
  73. const unsigned int hops,
  74. const uint64_t packetId,
  75. const unsigned int payloadLength,
  76. const Packet::Verb verb,
  77. const uint64_t inRePacketId,
  78. const Packet::Verb inReVerb,
  79. const bool trustEstablished,
  80. const uint64_t networkId,
  81. const int32_t flowId)
  82. {
  83. const int64_t now = RR->node->now();
  84. _lastReceive = now;
  85. switch (verb) {
  86. case Packet::VERB_FRAME:
  87. case Packet::VERB_EXT_FRAME:
  88. case Packet::VERB_NETWORK_CONFIG_REQUEST:
  89. case Packet::VERB_NETWORK_CONFIG:
  90. case Packet::VERB_MULTICAST_FRAME:
  91. _lastNontrivialReceive = now;
  92. break;
  93. default:
  94. break;
  95. }
  96. #ifndef ZT_NO_PEER_METRICS
  97. _incoming_packet++;
  98. #endif
  99. recordIncomingPacket(path, packetId, payloadLength, verb, flowId, now);
  100. if (trustEstablished) {
  101. _lastTrustEstablishedPacketReceived = now;
  102. path->trustedPacketReceived(now);
  103. }
  104. if (hops == 0) {
  105. // If this is a direct packet (no hops), update existing paths or learn new ones
  106. bool havePath = false;
  107. {
  108. Mutex::Lock _l(_paths_m);
  109. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  110. if (_paths[i].p) {
  111. if (_paths[i].p == path) {
  112. _paths[i].lr = now;
  113. havePath = true;
  114. break;
  115. }
  116. // If same address on same interface then don't learn unless existing path isn't alive (prevents learning loop)
  117. if (_paths[i].p->address().ipsEqual(path->address()) && _paths[i].p->localSocket() == path->localSocket()) {
  118. if (_paths[i].p->alive(now) && !_bond) {
  119. havePath = true;
  120. break;
  121. }
  122. }
  123. } else {
  124. break;
  125. }
  126. }
  127. }
  128. if ( (!havePath) && RR->node->shouldUsePathForZeroTierTraffic(tPtr,_id.address(),path->localSocket(),path->address()) ) {
  129. if (verb == Packet::VERB_OK) {
  130. Mutex::Lock _l(_paths_m);
  131. unsigned int oldestPathIdx = ZT_MAX_PEER_NETWORK_PATHS;
  132. unsigned int oldestPathAge = 0;
  133. unsigned int replacePath = ZT_MAX_PEER_NETWORK_PATHS;
  134. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  135. if (_paths[i].p) {
  136. // Keep track of oldest path as a last resort option
  137. unsigned int currAge = _paths[i].p->age(now);
  138. if (currAge > oldestPathAge) {
  139. oldestPathAge = currAge;
  140. oldestPathIdx = i;
  141. }
  142. if (_paths[i].p->address().ipsEqual(path->address())) {
  143. if (_paths[i].p->localSocket() == path->localSocket()) {
  144. if (!_paths[i].p->alive(now)) {
  145. replacePath = i;
  146. break;
  147. }
  148. }
  149. }
  150. } else {
  151. replacePath = i;
  152. break;
  153. }
  154. }
  155. // If we didn't find a good candidate then resort to replacing oldest path
  156. replacePath = (replacePath == ZT_MAX_PEER_NETWORK_PATHS) ? oldestPathIdx : replacePath;
  157. if (replacePath != ZT_MAX_PEER_NETWORK_PATHS) {
  158. RR->t->peerLearnedNewPath(tPtr, networkId, *this, path, packetId);
  159. _paths[replacePath].lr = now;
  160. _paths[replacePath].p = path;
  161. _paths[replacePath].priority = 1;
  162. Mutex::Lock _l(_bond_m);
  163. if(_bond) {
  164. _bond->nominatePathToBond(_paths[replacePath].p, now);
  165. }
  166. }
  167. } else {
  168. Mutex::Lock ltl(_lastTriedPath_m);
  169. bool triedTooRecently = false;
  170. for(std::list< std::pair< Path *, int64_t > >::iterator i(_lastTriedPath.begin());i!=_lastTriedPath.end();) {
  171. if ((now - i->second) > 1000) {
  172. _lastTriedPath.erase(i++);
  173. } else if (i->first == path.ptr()) {
  174. ++i;
  175. triedTooRecently = true;
  176. } else {
  177. ++i;
  178. }
  179. }
  180. if (!triedTooRecently) {
  181. _lastTriedPath.push_back(std::pair< Path *, int64_t >(path.ptr(), now));
  182. attemptToContactAt(tPtr,path->localSocket(),path->address(),now,true);
  183. path->sent(now);
  184. RR->t->peerConfirmingUnknownPath(tPtr,networkId,*this,path,packetId,verb);
  185. }
  186. }
  187. }
  188. }
  189. // If we have a trust relationship periodically push a message enumerating
  190. // all known external addresses for ourselves. If we already have a path this
  191. // is done less frequently.
  192. if (this->trustEstablished(now)) {
  193. const int64_t sinceLastPush = now - _lastDirectPathPushSent;
  194. bool lowBandwidth = RR->node->lowBandwidthModeEnabled();
  195. int timerScale = lowBandwidth ? 16 : 1;
  196. if (sinceLastPush >= ((hops == 0) ? ZT_DIRECT_PATH_PUSH_INTERVAL_HAVEPATH * timerScale : ZT_DIRECT_PATH_PUSH_INTERVAL)) {
  197. _lastDirectPathPushSent = now;
  198. std::vector<InetAddress> pathsToPush(RR->node->directPaths());
  199. std::vector<InetAddress> ma = RR->sa->whoami();
  200. pathsToPush.insert(pathsToPush.end(), ma.begin(), ma.end());
  201. if (!pathsToPush.empty()) {
  202. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  203. while (p != pathsToPush.end()) {
  204. Packet *const outp = new Packet(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  205. outp->addSize(2); // leave room for count
  206. unsigned int count = 0;
  207. while ((p != pathsToPush.end())&&((outp->size() + 24) < 1200)) {
  208. uint8_t addressType = 4;
  209. switch(p->ss_family) {
  210. case AF_INET:
  211. break;
  212. case AF_INET6:
  213. addressType = 6;
  214. break;
  215. default: // we currently only push IP addresses
  216. ++p;
  217. continue;
  218. }
  219. outp->append((uint8_t)0); // no flags
  220. outp->append((uint16_t)0); // no extensions
  221. outp->append(addressType);
  222. outp->append((uint8_t)((addressType == 4) ? 6 : 18));
  223. outp->append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  224. outp->append((uint16_t)p->port());
  225. ++count;
  226. ++p;
  227. }
  228. if (count) {
  229. Metrics::pkt_push_direct_paths_out++;
  230. outp->setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  231. outp->compress();
  232. outp->armor(_key,true,false,aesKeysIfSupported(),_id);
  233. Metrics::pkt_push_direct_paths_out++;
  234. path->send(RR,tPtr,outp->data(),outp->size(),now);
  235. }
  236. delete outp;
  237. }
  238. }
  239. }
  240. }
  241. }
  242. SharedPtr<Path> Peer::getAppropriatePath(int64_t now, bool includeExpired, int32_t flowId)
  243. {
  244. Mutex::Lock _l(_paths_m);
  245. Mutex::Lock _lb(_bond_m);
  246. if(_bond && _bond->isReady()) {
  247. return _bond->getAppropriatePath(now, flowId);
  248. }
  249. unsigned int bestPath = ZT_MAX_PEER_NETWORK_PATHS;
  250. /**
  251. * Send traffic across the highest quality path only. This algorithm will still
  252. * use the old path quality metric from protocol version 9.
  253. */
  254. long bestPathQuality = 2147483647;
  255. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  256. if (_paths[i].p) {
  257. if ((includeExpired)||((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION)) {
  258. const long q = _paths[i].p->quality(now) / _paths[i].priority;
  259. if (q <= bestPathQuality) {
  260. bestPathQuality = q;
  261. bestPath = i;
  262. }
  263. }
  264. } else {
  265. break;
  266. }
  267. }
  268. if (bestPath != ZT_MAX_PEER_NETWORK_PATHS) {
  269. return _paths[bestPath].p;
  270. }
  271. return SharedPtr<Path>();
  272. }
  273. void Peer::introduce(void *const tPtr,const int64_t now,const SharedPtr<Peer> &other) const
  274. {
  275. unsigned int myBestV4ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  276. unsigned int myBestV6ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  277. long myBestV4QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  278. long myBestV6QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  279. unsigned int theirBestV4ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  280. unsigned int theirBestV6ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  281. long theirBestV4QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  282. long theirBestV6QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  283. for(int i=0;i<=ZT_INETADDRESS_MAX_SCOPE;++i) {
  284. myBestV4ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  285. myBestV6ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  286. myBestV4QualityByScope[i] = 2147483647;
  287. myBestV6QualityByScope[i] = 2147483647;
  288. theirBestV4ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  289. theirBestV6ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  290. theirBestV4QualityByScope[i] = 2147483647;
  291. theirBestV6QualityByScope[i] = 2147483647;
  292. }
  293. Mutex::Lock _l1(_paths_m);
  294. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  295. if (_paths[i].p) {
  296. const long q = _paths[i].p->quality(now) / _paths[i].priority;
  297. const unsigned int s = (unsigned int)_paths[i].p->ipScope();
  298. switch(_paths[i].p->address().ss_family) {
  299. case AF_INET:
  300. if (q <= myBestV4QualityByScope[s]) {
  301. myBestV4QualityByScope[s] = q;
  302. myBestV4ByScope[s] = i;
  303. }
  304. break;
  305. case AF_INET6:
  306. if (q <= myBestV6QualityByScope[s]) {
  307. myBestV6QualityByScope[s] = q;
  308. myBestV6ByScope[s] = i;
  309. }
  310. break;
  311. }
  312. } else {
  313. break;
  314. }
  315. }
  316. Mutex::Lock _l2(other->_paths_m);
  317. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  318. if (other->_paths[i].p) {
  319. const long q = other->_paths[i].p->quality(now) / other->_paths[i].priority;
  320. const unsigned int s = (unsigned int)other->_paths[i].p->ipScope();
  321. switch(other->_paths[i].p->address().ss_family) {
  322. case AF_INET:
  323. if (q <= theirBestV4QualityByScope[s]) {
  324. theirBestV4QualityByScope[s] = q;
  325. theirBestV4ByScope[s] = i;
  326. }
  327. break;
  328. case AF_INET6:
  329. if (q <= theirBestV6QualityByScope[s]) {
  330. theirBestV6QualityByScope[s] = q;
  331. theirBestV6ByScope[s] = i;
  332. }
  333. break;
  334. }
  335. } else {
  336. break;
  337. }
  338. }
  339. unsigned int mine = ZT_MAX_PEER_NETWORK_PATHS;
  340. unsigned int theirs = ZT_MAX_PEER_NETWORK_PATHS;
  341. for(int s=ZT_INETADDRESS_MAX_SCOPE;s>=0;--s) {
  342. if ((myBestV6ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)&&(theirBestV6ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)) {
  343. mine = myBestV6ByScope[s];
  344. theirs = theirBestV6ByScope[s];
  345. break;
  346. }
  347. if ((myBestV4ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)&&(theirBestV4ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)) {
  348. mine = myBestV4ByScope[s];
  349. theirs = theirBestV4ByScope[s];
  350. break;
  351. }
  352. }
  353. if (mine != ZT_MAX_PEER_NETWORK_PATHS) {
  354. unsigned int alt = (unsigned int)RR->node->prng() & 1; // randomize which hint we send first for black magickal NAT-t reasons
  355. const unsigned int completed = alt + 2;
  356. while (alt != completed) {
  357. if ((alt & 1) == 0) {
  358. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  359. outp.append((uint8_t)0);
  360. other->_id.address().appendTo(outp);
  361. outp.append((uint16_t)other->_paths[theirs].p->address().port());
  362. if (other->_paths[theirs].p->address().ss_family == AF_INET6) {
  363. outp.append((uint8_t)16);
  364. outp.append(other->_paths[theirs].p->address().rawIpData(),16);
  365. } else {
  366. outp.append((uint8_t)4);
  367. outp.append(other->_paths[theirs].p->address().rawIpData(),4);
  368. }
  369. outp.armor(_key,true,false,aesKeysIfSupported(),_id);
  370. Metrics::pkt_rendezvous_out++;
  371. _paths[mine].p->send(RR,tPtr,outp.data(),outp.size(),now);
  372. } else {
  373. Packet outp(other->_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  374. outp.append((uint8_t)0);
  375. _id.address().appendTo(outp);
  376. outp.append((uint16_t)_paths[mine].p->address().port());
  377. if (_paths[mine].p->address().ss_family == AF_INET6) {
  378. outp.append((uint8_t)16);
  379. outp.append(_paths[mine].p->address().rawIpData(),16);
  380. } else {
  381. outp.append((uint8_t)4);
  382. outp.append(_paths[mine].p->address().rawIpData(),4);
  383. }
  384. outp.armor(other->_key,true,false,other->aesKeysIfSupported(),other->identity());
  385. Metrics::pkt_rendezvous_out++;
  386. other->_paths[theirs].p->send(RR,tPtr,outp.data(),outp.size(),now);
  387. }
  388. ++alt;
  389. }
  390. }
  391. }
  392. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now)
  393. {
  394. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  395. outp.append((unsigned char)ZT_PROTO_VERSION);
  396. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  397. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  398. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  399. outp.append(now);
  400. RR->identity.serialize(outp,false);
  401. atAddress.serialize(outp);
  402. outp.append((uint64_t)RR->topology->planetWorldId());
  403. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  404. const unsigned int startCryptedPortionAt = outp.size();
  405. std::vector<World> moons(RR->topology->moons());
  406. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  407. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  408. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  409. outp.append((uint8_t)m->type());
  410. outp.append((uint64_t)m->id());
  411. outp.append((uint64_t)m->timestamp());
  412. }
  413. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  414. outp.append((uint8_t)World::TYPE_MOON);
  415. outp.append(*m);
  416. outp.append((uint64_t)0);
  417. }
  418. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  419. Metrics::pkt_hello_out++;
  420. if (atAddress) {
  421. // TODO: this is where extended armor should be invoked
  422. outp.armor(_key,false,false,nullptr,_id);
  423. RR->node->expectReplyTo(outp.packetId());
  424. RR->node->putPacket(tPtr,RR->node->lowBandwidthModeEnabled() ? localSocket : -1,atAddress,outp.data(),outp.size());
  425. } else {
  426. RR->node->expectReplyTo(outp.packetId());
  427. RR->sw->send(tPtr,outp,true);
  428. }
  429. }
  430. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now,bool sendFullHello)
  431. {
  432. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  433. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  434. outp.armor(_key,true,false,aesKeysIfSupported(),_id);
  435. Metrics::pkt_echo_out++;
  436. RR->node->expectReplyTo(outp.packetId());
  437. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  438. } else {
  439. sendHELLO(tPtr,localSocket,atAddress,now);
  440. }
  441. }
  442. void Peer::tryMemorizedPath(void *tPtr,int64_t now)
  443. {
  444. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  445. _lastTriedMemorizedPath = now;
  446. InetAddress mp;
  447. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp)) {
  448. attemptToContactAt(tPtr,-1,mp,now,true);
  449. }
  450. }
  451. }
  452. void Peer::performMultipathStateCheck(void *tPtr, int64_t now)
  453. {
  454. Mutex::Lock _l(_bond_m);
  455. /**
  456. * Check for conditions required for multipath bonding and create a bond
  457. * if allowed.
  458. */
  459. int numAlivePaths = 0;
  460. bool atLeastOneNonExpired = false;
  461. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  462. if (_paths[i].p) {
  463. if(_paths[i].p->alive(now)) {
  464. numAlivePaths++;
  465. }
  466. if ((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION) {
  467. atLeastOneNonExpired = true;
  468. }
  469. }
  470. }
  471. if (_bond) {
  472. if (numAlivePaths == 0 && !atLeastOneNonExpired) {
  473. _bond = SharedPtr<Bond>();
  474. RR->bc->destroyBond(_id.address().toInt());
  475. }
  476. return;
  477. }
  478. _localMultipathSupported = ((numAlivePaths >= 1) && (RR->bc->inUse()) && (ZT_PROTO_VERSION > 9));
  479. if (_localMultipathSupported && !_bond) {
  480. if (RR->bc) {
  481. _bond = RR->bc->createBond(RR, this);
  482. /**
  483. * Allow new bond to retroactively learn all paths known to this peer
  484. */
  485. if (_bond) {
  486. for (unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  487. if (_paths[i].p) {
  488. _bond->nominatePathToBond(_paths[i].p, now);
  489. }
  490. }
  491. }
  492. }
  493. }
  494. }
  495. unsigned int Peer::doPingAndKeepalive(void *tPtr,int64_t now)
  496. {
  497. unsigned int sent = 0;
  498. {
  499. Mutex::Lock _l(_paths_m);
  500. performMultipathStateCheck(tPtr, now);
  501. const bool sendFullHello = ((now - _lastSentFullHello) >= ZT_PEER_PING_PERIOD);
  502. if (sendFullHello) {
  503. _lastSentFullHello = now;
  504. }
  505. // Right now we only keep pinging links that have the maximum priority. The
  506. // priority is used to track cluster redirections, meaning that when a cluster
  507. // redirects us its redirect target links override all other links and we
  508. // let those old links expire.
  509. long maxPriority = 0;
  510. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  511. if (_paths[i].p) {
  512. maxPriority = std::max(_paths[i].priority,maxPriority);
  513. } else {
  514. break;
  515. }
  516. }
  517. bool deletionOccurred = false;
  518. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  519. if (_paths[i].p) {
  520. // Clean expired and reduced priority paths
  521. if ( ((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION) && (_paths[i].priority == maxPriority) ) {
  522. if ((sendFullHello)||(_paths[i].p->needsHeartbeat(now))) {
  523. attemptToContactAt(tPtr,_paths[i].p->localSocket(),_paths[i].p->address(),now,sendFullHello);
  524. _paths[i].p->sent(now);
  525. sent |= (_paths[i].p->address().ss_family == AF_INET) ? 0x1 : 0x2;
  526. }
  527. } else {
  528. _paths[i] = _PeerPath();
  529. deletionOccurred = true;
  530. }
  531. }
  532. if (!_paths[i].p || deletionOccurred) {
  533. for(unsigned int j=i;j<ZT_MAX_PEER_NETWORK_PATHS;++j) {
  534. if (_paths[j].p && i != j) {
  535. _paths[i] = _paths[j];
  536. _paths[j] = _PeerPath();
  537. break;
  538. }
  539. }
  540. deletionOccurred = false;
  541. }
  542. }
  543. #ifndef ZT_NO_PEER_METRICS
  544. uint16_t alive_path_count_tmp = 0, dead_path_count_tmp = 0;
  545. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  546. if (_paths[i].p) {
  547. if (_paths[i].p->alive(now)) {
  548. alive_path_count_tmp++;
  549. }
  550. else {
  551. dead_path_count_tmp++;
  552. }
  553. }
  554. }
  555. _alive_path_count = alive_path_count_tmp;
  556. _dead_path_count = dead_path_count_tmp;
  557. #endif
  558. }
  559. #ifndef ZT_NO_PEER_METRICS
  560. _peer_latency.Observe(latency(now));
  561. #endif
  562. return sent;
  563. }
  564. void Peer::clusterRedirect(void *tPtr,const SharedPtr<Path> &originatingPath,const InetAddress &remoteAddress,const int64_t now)
  565. {
  566. SharedPtr<Path> np(RR->topology->getPath(originatingPath->localSocket(),remoteAddress));
  567. RR->t->peerRedirected(tPtr,0,*this,np);
  568. attemptToContactAt(tPtr,originatingPath->localSocket(),remoteAddress,now,true);
  569. {
  570. Mutex::Lock _l(_paths_m);
  571. // New priority is higher than the priority of the originating path (if known)
  572. long newPriority = 1;
  573. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  574. if (_paths[i].p) {
  575. if (_paths[i].p == originatingPath) {
  576. newPriority = _paths[i].priority;
  577. break;
  578. }
  579. } else {
  580. break;
  581. }
  582. }
  583. newPriority += 2;
  584. // Erase any paths with lower priority than this one or that are duplicate
  585. // IPs and add this path.
  586. unsigned int j = 0;
  587. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  588. if (_paths[i].p) {
  589. if ((_paths[i].priority >= newPriority)&&(!_paths[i].p->address().ipsEqual2(remoteAddress))) {
  590. if (i != j) {
  591. _paths[j] = _paths[i];
  592. }
  593. ++j;
  594. }
  595. }
  596. }
  597. if (j < ZT_MAX_PEER_NETWORK_PATHS) {
  598. _paths[j].lr = now;
  599. _paths[j].p = np;
  600. _paths[j].priority = newPriority;
  601. ++j;
  602. while (j < ZT_MAX_PEER_NETWORK_PATHS) {
  603. _paths[j].lr = 0;
  604. _paths[j].p.zero();
  605. _paths[j].priority = 1;
  606. ++j;
  607. }
  608. }
  609. }
  610. }
  611. void Peer::resetWithinScope(void *tPtr,InetAddress::IpScope scope,int inetAddressFamily,int64_t now)
  612. {
  613. Mutex::Lock _l(_paths_m);
  614. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  615. if (_paths[i].p) {
  616. if ((_paths[i].p->address().ss_family == inetAddressFamily)&&(_paths[i].p->ipScope() == scope)) {
  617. attemptToContactAt(tPtr,_paths[i].p->localSocket(),_paths[i].p->address(),now,false);
  618. _paths[i].p->sent(now);
  619. _paths[i].lr = 0; // path will not be used unless it speaks again
  620. }
  621. } else {
  622. break;
  623. }
  624. }
  625. }
  626. void Peer::recordOutgoingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  627. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now)
  628. {
  629. #ifndef ZT_NO_PEER_METRICS
  630. _outgoing_packet++;
  631. #endif
  632. if (_localMultipathSupported && _bond) {
  633. _bond->recordOutgoingPacket(path, packetId, payloadLength, verb, flowId, now);
  634. }
  635. }
  636. void Peer::recordIncomingInvalidPacket(const SharedPtr<Path>& path)
  637. {
  638. #ifndef ZT_NO_PEER_METRICS
  639. _packet_errors++;
  640. #endif
  641. if (_localMultipathSupported && _bond) {
  642. _bond->recordIncomingInvalidPacket(path);
  643. }
  644. }
  645. void Peer::recordIncomingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  646. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now)
  647. {
  648. if (_localMultipathSupported && _bond) {
  649. _bond->recordIncomingPacket(path, packetId, payloadLength, verb, flowId, now);
  650. }
  651. }
  652. } // namespace ZeroTier