Peer.cpp 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609
  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. #include "../version.h"
  14. #include "Constants.hpp"
  15. #include "Peer.hpp"
  16. #include "Switch.hpp"
  17. #include "Network.hpp"
  18. #include "SelfAwareness.hpp"
  19. #include "Packet.hpp"
  20. #include "Trace.hpp"
  21. #include "InetAddress.hpp"
  22. #include "RingBuffer.hpp"
  23. #include "Utils.hpp"
  24. namespace ZeroTier {
  25. static unsigned char s_freeRandomByteCounter = 0;
  26. Peer::Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity) :
  27. RR(renv),
  28. _lastReceive(0),
  29. _lastNontrivialReceive(0),
  30. _lastTriedMemorizedPath(0),
  31. _lastDirectPathPushSent(0),
  32. _lastDirectPathPushReceive(0),
  33. _lastEchoRequestReceived(0),
  34. _lastCredentialRequestSent(0),
  35. _lastWhoisRequestReceived(0),
  36. _lastCredentialsReceived(0),
  37. _lastTrustEstablishedPacketReceived(0),
  38. _lastSentFullHello(0),
  39. _lastEchoCheck(0),
  40. _freeRandomByte((unsigned char)((uintptr_t)this >> 4) ^ ++s_freeRandomByteCounter),
  41. _vProto(0),
  42. _vMajor(0),
  43. _vMinor(0),
  44. _vRevision(0),
  45. _id(peerIdentity),
  46. _directPathPushCutoffCount(0),
  47. _credentialsCutoffCount(0),
  48. _echoRequestCutoffCount(0),
  49. _uniqueAlivePathCount(0),
  50. _localMultipathSupported(false),
  51. _remoteMultipathSupported(false),
  52. _canUseMultipath(false),
  53. _shouldCollectPathStatistics(0),
  54. _bondingPolicy(0),
  55. _lastComputedAggregateMeanLatency(0)
  56. {
  57. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH)) {
  58. throw ZT_EXCEPTION_INVALID_ARGUMENT;
  59. }
  60. }
  61. void Peer::received(
  62. void *tPtr,
  63. const SharedPtr<Path> &path,
  64. const unsigned int hops,
  65. const uint64_t packetId,
  66. const unsigned int payloadLength,
  67. const Packet::Verb verb,
  68. const uint64_t inRePacketId,
  69. const Packet::Verb inReVerb,
  70. const bool trustEstablished,
  71. const uint64_t networkId,
  72. const int32_t flowId)
  73. {
  74. const int64_t now = RR->node->now();
  75. _lastReceive = now;
  76. switch (verb) {
  77. case Packet::VERB_FRAME:
  78. case Packet::VERB_EXT_FRAME:
  79. case Packet::VERB_NETWORK_CONFIG_REQUEST:
  80. case Packet::VERB_NETWORK_CONFIG:
  81. case Packet::VERB_MULTICAST_FRAME:
  82. _lastNontrivialReceive = now;
  83. break;
  84. default:
  85. break;
  86. }
  87. recordIncomingPacket(path, packetId, payloadLength, verb, flowId, now);
  88. if (trustEstablished) {
  89. _lastTrustEstablishedPacketReceived = now;
  90. path->trustedPacketReceived(now);
  91. }
  92. if (hops == 0) {
  93. // If this is a direct packet (no hops), update existing paths or learn new ones
  94. bool havePath = false;
  95. {
  96. Mutex::Lock _l(_paths_m);
  97. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  98. if (_paths[i].p) {
  99. if (_paths[i].p == path) {
  100. _paths[i].lr = now;
  101. havePath = true;
  102. break;
  103. }
  104. } else break;
  105. }
  106. }
  107. bool attemptToContact = false;
  108. if ((!havePath)&&(RR->node->shouldUsePathForZeroTierTraffic(tPtr,_id.address(),path->localSocket(),path->address()))) {
  109. Mutex::Lock _l(_paths_m);
  110. // Paths are redunant if they duplicate an alive path to the same IP or
  111. // with the same local socket and address family.
  112. bool redundant = false;
  113. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  114. if (_paths[i].p) {
  115. if ( (_paths[i].p->alive(now)) && ( ((_paths[i].p->localSocket() == path->localSocket())&&(_paths[i].p->address().ss_family == path->address().ss_family)) || (_paths[i].p->address().ipsEqual2(path->address())) ) ) {
  116. redundant = true;
  117. break;
  118. }
  119. } else break;
  120. }
  121. if (!redundant) {
  122. unsigned int replacePath = ZT_MAX_PEER_NETWORK_PATHS;
  123. int replacePathQuality = 0;
  124. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  125. if (_paths[i].p) {
  126. const int q = _paths[i].p->quality(now);
  127. if (q > replacePathQuality) {
  128. replacePathQuality = q;
  129. replacePath = i;
  130. if (!_paths[i].p->alive(now)) {
  131. break; // Stop searching, we found an identical dead path, replace the object
  132. }
  133. }
  134. } else {
  135. replacePath = i;
  136. break;
  137. }
  138. }
  139. if (replacePath != ZT_MAX_PEER_NETWORK_PATHS) {
  140. if (verb == Packet::VERB_OK) {
  141. RR->t->peerLearnedNewPath(tPtr,networkId,*this,path,packetId);
  142. _paths[replacePath].lr = now;
  143. _paths[replacePath].p = path;
  144. _paths[replacePath].priority = 1;
  145. } else {
  146. attemptToContact = true;
  147. }
  148. }
  149. }
  150. }
  151. if (attemptToContact) {
  152. attemptToContactAt(tPtr,path->localSocket(),path->address(),now,true);
  153. path->sent(now);
  154. RR->t->peerConfirmingUnknownPath(tPtr,networkId,*this,path,packetId,verb);
  155. }
  156. }
  157. // If we have a trust relationship periodically push a message enumerating
  158. // all known external addresses for ourselves. If we already have a path this
  159. // is done less frequently.
  160. if (this->trustEstablished(now)) {
  161. const int64_t sinceLastPush = now - _lastDirectPathPushSent;
  162. if (sinceLastPush >= ((hops == 0) ? ZT_DIRECT_PATH_PUSH_INTERVAL_HAVEPATH : ZT_DIRECT_PATH_PUSH_INTERVAL)) {
  163. _lastDirectPathPushSent = now;
  164. std::vector<InetAddress> pathsToPush(RR->node->directPaths());
  165. if (pathsToPush.size() > 0) {
  166. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  167. while (p != pathsToPush.end()) {
  168. Packet *const outp = new Packet(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  169. outp->addSize(2); // leave room for count
  170. unsigned int count = 0;
  171. while ((p != pathsToPush.end())&&((outp->size() + 24) < 1200)) {
  172. uint8_t addressType = 4;
  173. switch(p->ss_family) {
  174. case AF_INET:
  175. break;
  176. case AF_INET6:
  177. addressType = 6;
  178. break;
  179. default: // we currently only push IP addresses
  180. ++p;
  181. continue;
  182. }
  183. outp->append((uint8_t)0); // no flags
  184. outp->append((uint16_t)0); // no extensions
  185. outp->append(addressType);
  186. outp->append((uint8_t)((addressType == 4) ? 6 : 18));
  187. outp->append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  188. outp->append((uint16_t)p->port());
  189. ++count;
  190. ++p;
  191. }
  192. if (count) {
  193. outp->setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  194. outp->compress();
  195. outp->armor(_key,true);
  196. path->send(RR,tPtr,outp->data(),outp->size(),now);
  197. }
  198. delete outp;
  199. }
  200. }
  201. }
  202. }
  203. }
  204. SharedPtr<Path> Peer::getAppropriatePath(int64_t now, bool includeExpired, int32_t flowId)
  205. {
  206. if (!_bondToPeer) {
  207. Mutex::Lock _l(_paths_m);
  208. unsigned int bestPath = ZT_MAX_PEER_NETWORK_PATHS;
  209. /**
  210. * Send traffic across the highest quality path only. This algorithm will still
  211. * use the old path quality metric from protocol version 9.
  212. */
  213. long bestPathQuality = 2147483647;
  214. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  215. if (_paths[i].p) {
  216. if ((includeExpired)||((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION)) {
  217. const long q = _paths[i].p->quality(now) / _paths[i].priority;
  218. if (q <= bestPathQuality) {
  219. bestPathQuality = q;
  220. bestPath = i;
  221. }
  222. }
  223. } else break;
  224. }
  225. if (bestPath != ZT_MAX_PEER_NETWORK_PATHS) {
  226. return _paths[bestPath].p;
  227. }
  228. return SharedPtr<Path>();
  229. }
  230. return _bondToPeer->getAppropriatePath(now, flowId);
  231. }
  232. void Peer::introduce(void *const tPtr,const int64_t now,const SharedPtr<Peer> &other) const
  233. {
  234. unsigned int myBestV4ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  235. unsigned int myBestV6ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  236. long myBestV4QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  237. long myBestV6QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  238. unsigned int theirBestV4ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  239. unsigned int theirBestV6ByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  240. long theirBestV4QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  241. long theirBestV6QualityByScope[ZT_INETADDRESS_MAX_SCOPE+1];
  242. for(int i=0;i<=ZT_INETADDRESS_MAX_SCOPE;++i) {
  243. myBestV4ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  244. myBestV6ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  245. myBestV4QualityByScope[i] = 2147483647;
  246. myBestV6QualityByScope[i] = 2147483647;
  247. theirBestV4ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  248. theirBestV6ByScope[i] = ZT_MAX_PEER_NETWORK_PATHS;
  249. theirBestV4QualityByScope[i] = 2147483647;
  250. theirBestV6QualityByScope[i] = 2147483647;
  251. }
  252. Mutex::Lock _l1(_paths_m);
  253. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  254. if (_paths[i].p) {
  255. const long q = _paths[i].p->quality(now) / _paths[i].priority;
  256. const unsigned int s = (unsigned int)_paths[i].p->ipScope();
  257. switch(_paths[i].p->address().ss_family) {
  258. case AF_INET:
  259. if (q <= myBestV4QualityByScope[s]) {
  260. myBestV4QualityByScope[s] = q;
  261. myBestV4ByScope[s] = i;
  262. }
  263. break;
  264. case AF_INET6:
  265. if (q <= myBestV6QualityByScope[s]) {
  266. myBestV6QualityByScope[s] = q;
  267. myBestV6ByScope[s] = i;
  268. }
  269. break;
  270. }
  271. } else break;
  272. }
  273. Mutex::Lock _l2(other->_paths_m);
  274. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  275. if (other->_paths[i].p) {
  276. const long q = other->_paths[i].p->quality(now) / other->_paths[i].priority;
  277. const unsigned int s = (unsigned int)other->_paths[i].p->ipScope();
  278. switch(other->_paths[i].p->address().ss_family) {
  279. case AF_INET:
  280. if (q <= theirBestV4QualityByScope[s]) {
  281. theirBestV4QualityByScope[s] = q;
  282. theirBestV4ByScope[s] = i;
  283. }
  284. break;
  285. case AF_INET6:
  286. if (q <= theirBestV6QualityByScope[s]) {
  287. theirBestV6QualityByScope[s] = q;
  288. theirBestV6ByScope[s] = i;
  289. }
  290. break;
  291. }
  292. } else break;
  293. }
  294. unsigned int mine = ZT_MAX_PEER_NETWORK_PATHS;
  295. unsigned int theirs = ZT_MAX_PEER_NETWORK_PATHS;
  296. for(int s=ZT_INETADDRESS_MAX_SCOPE;s>=0;--s) {
  297. if ((myBestV6ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)&&(theirBestV6ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)) {
  298. mine = myBestV6ByScope[s];
  299. theirs = theirBestV6ByScope[s];
  300. break;
  301. }
  302. if ((myBestV4ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)&&(theirBestV4ByScope[s] != ZT_MAX_PEER_NETWORK_PATHS)) {
  303. mine = myBestV4ByScope[s];
  304. theirs = theirBestV4ByScope[s];
  305. break;
  306. }
  307. }
  308. if (mine != ZT_MAX_PEER_NETWORK_PATHS) {
  309. unsigned int alt = (unsigned int)RR->node->prng() & 1; // randomize which hint we send first for black magickal NAT-t reasons
  310. const unsigned int completed = alt + 2;
  311. while (alt != completed) {
  312. if ((alt & 1) == 0) {
  313. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  314. outp.append((uint8_t)0);
  315. other->_id.address().appendTo(outp);
  316. outp.append((uint16_t)other->_paths[theirs].p->address().port());
  317. if (other->_paths[theirs].p->address().ss_family == AF_INET6) {
  318. outp.append((uint8_t)16);
  319. outp.append(other->_paths[theirs].p->address().rawIpData(),16);
  320. } else {
  321. outp.append((uint8_t)4);
  322. outp.append(other->_paths[theirs].p->address().rawIpData(),4);
  323. }
  324. outp.armor(_key,true);
  325. _paths[mine].p->send(RR,tPtr,outp.data(),outp.size(),now);
  326. } else {
  327. Packet outp(other->_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  328. outp.append((uint8_t)0);
  329. _id.address().appendTo(outp);
  330. outp.append((uint16_t)_paths[mine].p->address().port());
  331. if (_paths[mine].p->address().ss_family == AF_INET6) {
  332. outp.append((uint8_t)16);
  333. outp.append(_paths[mine].p->address().rawIpData(),16);
  334. } else {
  335. outp.append((uint8_t)4);
  336. outp.append(_paths[mine].p->address().rawIpData(),4);
  337. }
  338. outp.armor(other->_key,true);
  339. other->_paths[theirs].p->send(RR,tPtr,outp.data(),outp.size(),now);
  340. }
  341. ++alt;
  342. }
  343. }
  344. }
  345. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now)
  346. {
  347. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  348. outp.append((unsigned char)ZT_PROTO_VERSION);
  349. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  350. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  351. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  352. outp.append(now);
  353. RR->identity.serialize(outp,false);
  354. atAddress.serialize(outp);
  355. outp.append((uint64_t)RR->topology->planetWorldId());
  356. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  357. const unsigned int startCryptedPortionAt = outp.size();
  358. std::vector<World> moons(RR->topology->moons());
  359. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  360. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  361. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  362. outp.append((uint8_t)m->type());
  363. outp.append((uint64_t)m->id());
  364. outp.append((uint64_t)m->timestamp());
  365. }
  366. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  367. outp.append((uint8_t)World::TYPE_MOON);
  368. outp.append(*m);
  369. outp.append((uint64_t)0);
  370. }
  371. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  372. RR->node->expectReplyTo(outp.packetId());
  373. if (atAddress) {
  374. outp.armor(_key,false); // false == don't encrypt full payload, but add MAC
  375. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  376. } else {
  377. RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
  378. }
  379. }
  380. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,int64_t now,bool sendFullHello)
  381. {
  382. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  383. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  384. RR->node->expectReplyTo(outp.packetId());
  385. outp.armor(_key,true);
  386. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  387. } else {
  388. sendHELLO(tPtr,localSocket,atAddress,now);
  389. }
  390. }
  391. void Peer::tryMemorizedPath(void *tPtr,int64_t now)
  392. {
  393. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  394. _lastTriedMemorizedPath = now;
  395. InetAddress mp;
  396. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp))
  397. attemptToContactAt(tPtr,-1,mp,now,true);
  398. }
  399. }
  400. void Peer::performMultipathStateCheck(void *tPtr, int64_t now)
  401. {
  402. /**
  403. * Check for conditions required for multipath bonding and create a bond
  404. * if allowed.
  405. */
  406. _localMultipathSupported = ((RR->bc->inUse()) && (ZT_PROTO_VERSION > 9));
  407. if (_localMultipathSupported) {
  408. int currAlivePathCount = 0;
  409. int duplicatePathsFound = 0;
  410. for (unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  411. if (_paths[i].p) {
  412. currAlivePathCount++;
  413. for (unsigned int j=0;j<ZT_MAX_PEER_NETWORK_PATHS;++j) {
  414. if (_paths[i].p && _paths[j].p && _paths[i].p->address().ipsEqual2(_paths[j].p->address()) && i != j) {
  415. duplicatePathsFound+=1;
  416. break;
  417. }
  418. }
  419. }
  420. }
  421. _uniqueAlivePathCount = (currAlivePathCount - (duplicatePathsFound / 2));
  422. _remoteMultipathSupported = _vProto > 9;
  423. _canUseMultipath = _localMultipathSupported && _remoteMultipathSupported && (_uniqueAlivePathCount > 1);
  424. }
  425. if (_canUseMultipath && !_bondToPeer) {
  426. if (RR->bc) {
  427. _bondToPeer = RR->bc->createTransportTriggeredBond(RR, this);
  428. /**
  429. * Allow new bond to retroactively learn all paths known to this peer
  430. */
  431. if (_bondToPeer) {
  432. for (unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  433. if (_paths[i].p) {
  434. _bondToPeer->nominatePath(_paths[i].p, now);
  435. }
  436. }
  437. }
  438. }
  439. }
  440. }
  441. unsigned int Peer::doPingAndKeepalive(void *tPtr,int64_t now)
  442. {
  443. unsigned int sent = 0;
  444. Mutex::Lock _l(_paths_m);
  445. performMultipathStateCheck(tPtr, now);
  446. const bool sendFullHello = ((now - _lastSentFullHello) >= ZT_PEER_PING_PERIOD);
  447. _lastSentFullHello = now;
  448. // Right now we only keep pinging links that have the maximum priority. The
  449. // priority is used to track cluster redirections, meaning that when a cluster
  450. // redirects us its redirect target links override all other links and we
  451. // let those old links expire.
  452. long maxPriority = 0;
  453. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  454. if (_paths[i].p)
  455. maxPriority = std::max(_paths[i].priority,maxPriority);
  456. else break;
  457. }
  458. unsigned int j = 0;
  459. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  460. if (_paths[i].p) {
  461. // Clean expired and reduced priority paths
  462. if ( ((now - _paths[i].lr) < ZT_PEER_PATH_EXPIRATION) && (_paths[i].priority == maxPriority) ) {
  463. if ((sendFullHello)||(_paths[i].p->needsHeartbeat(now))
  464. || (_canUseMultipath && _paths[i].p->needsGratuitousHeartbeat(now))) {
  465. attemptToContactAt(tPtr,_paths[i].p->localSocket(),_paths[i].p->address(),now,sendFullHello);
  466. _paths[i].p->sent(now);
  467. sent |= (_paths[i].p->address().ss_family == AF_INET) ? 0x1 : 0x2;
  468. }
  469. if (i != j)
  470. _paths[j] = _paths[i];
  471. ++j;
  472. }
  473. } else break;
  474. }
  475. return sent;
  476. }
  477. void Peer::clusterRedirect(void *tPtr,const SharedPtr<Path> &originatingPath,const InetAddress &remoteAddress,const int64_t now)
  478. {
  479. SharedPtr<Path> np(RR->topology->getPath(originatingPath->localSocket(),remoteAddress));
  480. RR->t->peerRedirected(tPtr,0,*this,np);
  481. attemptToContactAt(tPtr,originatingPath->localSocket(),remoteAddress,now,true);
  482. {
  483. Mutex::Lock _l(_paths_m);
  484. // New priority is higher than the priority of the originating path (if known)
  485. long newPriority = 1;
  486. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  487. if (_paths[i].p) {
  488. if (_paths[i].p == originatingPath) {
  489. newPriority = _paths[i].priority;
  490. break;
  491. }
  492. } else break;
  493. }
  494. newPriority += 2;
  495. // Erase any paths with lower priority than this one or that are duplicate
  496. // IPs and add this path.
  497. unsigned int j = 0;
  498. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  499. if (_paths[i].p) {
  500. if ((_paths[i].priority >= newPriority)&&(!_paths[i].p->address().ipsEqual2(remoteAddress))) {
  501. if (i != j)
  502. _paths[j] = _paths[i];
  503. ++j;
  504. }
  505. }
  506. }
  507. if (j < ZT_MAX_PEER_NETWORK_PATHS) {
  508. _paths[j].lr = now;
  509. _paths[j].p = np;
  510. _paths[j].priority = newPriority;
  511. ++j;
  512. while (j < ZT_MAX_PEER_NETWORK_PATHS) {
  513. _paths[j].lr = 0;
  514. _paths[j].p.zero();
  515. _paths[j].priority = 1;
  516. ++j;
  517. }
  518. }
  519. }
  520. }
  521. void Peer::resetWithinScope(void *tPtr,InetAddress::IpScope scope,int inetAddressFamily,int64_t now)
  522. {
  523. Mutex::Lock _l(_paths_m);
  524. for(unsigned int i=0;i<ZT_MAX_PEER_NETWORK_PATHS;++i) {
  525. if (_paths[i].p) {
  526. if ((_paths[i].p->address().ss_family == inetAddressFamily)&&(_paths[i].p->ipScope() == scope)) {
  527. attemptToContactAt(tPtr,_paths[i].p->localSocket(),_paths[i].p->address(),now,false);
  528. _paths[i].p->sent(now);
  529. _paths[i].lr = 0; // path will not be used unless it speaks again
  530. }
  531. } else break;
  532. }
  533. }
  534. void Peer::recordOutgoingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  535. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now)
  536. {
  537. if (!_shouldCollectPathStatistics || !_bondToPeer) {
  538. return;
  539. }
  540. _bondToPeer->recordOutgoingPacket(path, packetId, payloadLength, verb, flowId, now);
  541. }
  542. void Peer::recordIncomingInvalidPacket(const SharedPtr<Path>& path)
  543. {
  544. if (!_shouldCollectPathStatistics || !_bondToPeer) {
  545. return;
  546. }
  547. _bondToPeer->recordIncomingInvalidPacket(path);
  548. }
  549. void Peer::recordIncomingPacket(const SharedPtr<Path> &path, const uint64_t packetId,
  550. uint16_t payloadLength, const Packet::Verb verb, const int32_t flowId, int64_t now)
  551. {
  552. if (!_shouldCollectPathStatistics || !_bondToPeer) {
  553. return;
  554. }
  555. _bondToPeer->recordIncomingPacket(path, packetId, payloadLength, verb, flowId, now);
  556. }
  557. } // namespace ZeroTier