Peer.cpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2017 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. * --
  19. *
  20. * You can be released from the requirements of the license by purchasing
  21. * a commercial license. Buying such a license is mandatory as soon as you
  22. * develop commercial closed-source software that incorporates or links
  23. * directly against ZeroTier software without disclosing the source code
  24. * of your own application.
  25. */
  26. #include "../version.h"
  27. #include "Constants.hpp"
  28. #include "Peer.hpp"
  29. #include "Node.hpp"
  30. #include "Switch.hpp"
  31. #include "Network.hpp"
  32. #include "SelfAwareness.hpp"
  33. #include "Packet.hpp"
  34. namespace ZeroTier {
  35. Peer::Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity) :
  36. RR(renv),
  37. _lastWroteState(0),
  38. _lastReceivedStateTimestamp(0),
  39. _lastReceive(0),
  40. _lastNontrivialReceive(0),
  41. _lastTriedMemorizedPath(0),
  42. _lastDirectPathPushSent(0),
  43. _lastDirectPathPushReceive(0),
  44. _lastCredentialRequestSent(0),
  45. _lastWhoisRequestReceived(0),
  46. _lastEchoRequestReceived(0),
  47. _lastComRequestReceived(0),
  48. _lastComRequestSent(0),
  49. _lastCredentialsReceived(0),
  50. _lastTrustEstablishedPacketReceived(0),
  51. _vProto(0),
  52. _vMajor(0),
  53. _vMinor(0),
  54. _vRevision(0),
  55. _id(peerIdentity),
  56. _latency(0),
  57. _directPathPushCutoffCount(0),
  58. _credentialsCutoffCount(0)
  59. {
  60. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  61. throw std::runtime_error("new peer identity key agreement failed");
  62. }
  63. void Peer::received(
  64. void *tPtr,
  65. const SharedPtr<Path> &path,
  66. const unsigned int hops,
  67. const uint64_t packetId,
  68. const Packet::Verb verb,
  69. const uint64_t inRePacketId,
  70. const Packet::Verb inReVerb,
  71. const bool trustEstablished)
  72. {
  73. const uint64_t now = RR->node->now();
  74. /*
  75. #ifdef ZT_ENABLE_CLUSTER
  76. bool isClusterSuboptimalPath = false;
  77. if ((RR->cluster)&&(hops == 0)) {
  78. // Note: findBetterEndpoint() is first since we still want to check
  79. // for a better endpoint even if we don't actually send a redirect.
  80. InetAddress redirectTo;
  81. if ( (verb != Packet::VERB_OK) && (verb != Packet::VERB_ERROR) && (verb != Packet::VERB_RENDEZVOUS) && (verb != Packet::VERB_PUSH_DIRECT_PATHS) && (RR->cluster->findBetterEndpoint(redirectTo,_id.address(),path->address(),false)) ) {
  82. if (_vProto >= 5) {
  83. // For newer peers we can send a more idiomatic verb: PUSH_DIRECT_PATHS.
  84. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  85. outp.append((uint16_t)1); // count == 1
  86. outp.append((uint8_t)ZT_PUSH_DIRECT_PATHS_FLAG_CLUSTER_REDIRECT); // flags: cluster redirect
  87. outp.append((uint16_t)0); // no extensions
  88. if (redirectTo.ss_family == AF_INET) {
  89. outp.append((uint8_t)4);
  90. outp.append((uint8_t)6);
  91. outp.append(redirectTo.rawIpData(),4);
  92. } else {
  93. outp.append((uint8_t)6);
  94. outp.append((uint8_t)18);
  95. outp.append(redirectTo.rawIpData(),16);
  96. }
  97. outp.append((uint16_t)redirectTo.port());
  98. outp.armor(_key,true,path->nextOutgoingCounter());
  99. path->send(RR,tPtr,outp.data(),outp.size(),now);
  100. } else {
  101. // For older peers we use RENDEZVOUS to coax them into contacting us elsewhere.
  102. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  103. outp.append((uint8_t)0); // no flags
  104. RR->identity.address().appendTo(outp);
  105. outp.append((uint16_t)redirectTo.port());
  106. if (redirectTo.ss_family == AF_INET) {
  107. outp.append((uint8_t)4);
  108. outp.append(redirectTo.rawIpData(),4);
  109. } else {
  110. outp.append((uint8_t)16);
  111. outp.append(redirectTo.rawIpData(),16);
  112. }
  113. outp.armor(_key,true,path->nextOutgoingCounter());
  114. path->send(RR,tPtr,outp.data(),outp.size(),now);
  115. }
  116. isClusterSuboptimalPath = true;
  117. }
  118. }
  119. #endif
  120. */
  121. _lastReceive = now;
  122. switch (verb) {
  123. case Packet::VERB_FRAME:
  124. case Packet::VERB_EXT_FRAME:
  125. case Packet::VERB_NETWORK_CONFIG_REQUEST:
  126. case Packet::VERB_NETWORK_CONFIG:
  127. case Packet::VERB_MULTICAST_FRAME:
  128. _lastNontrivialReceive = now;
  129. break;
  130. default: break;
  131. }
  132. if (trustEstablished) {
  133. _lastTrustEstablishedPacketReceived = now;
  134. path->trustedPacketReceived(now);
  135. }
  136. if (_vProto >= 9)
  137. path->updateLinkQuality((unsigned int)(packetId & 7));
  138. if (hops == 0) {
  139. // If this is a direct packet (no hops), update existing paths or learn new ones
  140. bool pathAlreadyKnown = false;
  141. {
  142. Mutex::Lock _l(_paths_m);
  143. if ((path->address().ss_family == AF_INET)&&(_v4Path.p)) {
  144. const struct sockaddr_in *const r = reinterpret_cast<const struct sockaddr_in *>(&(path->address()));
  145. const struct sockaddr_in *const l = reinterpret_cast<const struct sockaddr_in *>(&(_v4Path.p->address()));
  146. if ((r->sin_addr.s_addr == l->sin_addr.s_addr)&&(r->sin_port == l->sin_port)&&(path->localSocket() == _v4Path.p->localSocket())) {
  147. _v4Path.lr = now;
  148. pathAlreadyKnown = true;
  149. }
  150. } else if ((path->address().ss_family == AF_INET6)&&(_v6Path.p)) {
  151. const struct sockaddr_in6 *const r = reinterpret_cast<const struct sockaddr_in6 *>(&(path->address()));
  152. const struct sockaddr_in6 *const l = reinterpret_cast<const struct sockaddr_in6 *>(&(_v6Path.p->address()));
  153. if ((!memcmp(r->sin6_addr.s6_addr,l->sin6_addr.s6_addr,16))&&(r->sin6_port == l->sin6_port)&&(path->localSocket() == _v6Path.p->localSocket())) {
  154. _v6Path.lr = now;
  155. pathAlreadyKnown = true;
  156. }
  157. }
  158. }
  159. if ( (!pathAlreadyKnown) && (RR->node->shouldUsePathForZeroTierTraffic(tPtr,_id.address(),path->localSocket(),path->address())) ) {
  160. Mutex::Lock _l(_paths_m);
  161. _PeerPath *potentialNewPeerPath = (_PeerPath *)0;
  162. if (path->address().ss_family == AF_INET) {
  163. if ( (!_v4Path.p) || (!_v4Path.p->alive(now)) || (path->preferenceRank() >= _v4Path.p->preferenceRank()) ) {
  164. potentialNewPeerPath = &_v4Path;
  165. }
  166. } else if (path->address().ss_family == AF_INET6) {
  167. if ( (!_v6Path.p) || (!_v6Path.p->alive(now)) || (path->preferenceRank() >= _v6Path.p->preferenceRank()) ) {
  168. potentialNewPeerPath = &_v6Path;
  169. }
  170. }
  171. if (potentialNewPeerPath) {
  172. if (verb == Packet::VERB_OK) {
  173. potentialNewPeerPath->lr = now;
  174. potentialNewPeerPath->p = path;
  175. _lastWroteState = 0; // force state write now
  176. } else {
  177. TRACE("got %s via unknown path %s(%s), confirming...",Packet::verbString(verb),_id.address().toString().c_str(),path->address().toString().c_str());
  178. attemptToContactAt(tPtr,path->localSocket(),path->address(),now,true,path->nextOutgoingCounter());
  179. path->sent(now);
  180. }
  181. }
  182. }
  183. } else if (this->trustEstablished(now)) {
  184. // Send PUSH_DIRECT_PATHS if hops>0 (relayed) and we have a trust relationship (common network membership)
  185. if ((now - _lastDirectPathPushSent) >= ZT_DIRECT_PATH_PUSH_INTERVAL) {
  186. _lastDirectPathPushSent = now;
  187. std::vector<InetAddress> pathsToPush;
  188. std::vector<InetAddress> dps(RR->node->directPaths());
  189. for(std::vector<InetAddress>::const_iterator i(dps.begin());i!=dps.end();++i)
  190. pathsToPush.push_back(*i);
  191. std::vector<InetAddress> sym(RR->sa->getSymmetricNatPredictions());
  192. for(unsigned long i=0,added=0;i<sym.size();++i) {
  193. InetAddress tmp(sym[(unsigned long)RR->node->prng() % sym.size()]);
  194. if (std::find(pathsToPush.begin(),pathsToPush.end(),tmp) == pathsToPush.end()) {
  195. pathsToPush.push_back(tmp);
  196. if (++added >= ZT_PUSH_DIRECT_PATHS_MAX_PER_SCOPE_AND_FAMILY)
  197. break;
  198. }
  199. }
  200. if (pathsToPush.size() > 0) {
  201. #ifdef ZT_TRACE
  202. std::string ps;
  203. for(std::vector<InetAddress>::const_iterator p(pathsToPush.begin());p!=pathsToPush.end();++p) {
  204. if (ps.length() > 0)
  205. ps.push_back(',');
  206. ps.append(p->toString());
  207. }
  208. TRACE("pushing %u direct paths to %s: %s",(unsigned int)pathsToPush.size(),_id.address().toString().c_str(),ps.c_str());
  209. #endif
  210. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  211. while (p != pathsToPush.end()) {
  212. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  213. outp.addSize(2); // leave room for count
  214. unsigned int count = 0;
  215. while ((p != pathsToPush.end())&&((outp.size() + 24) < 1200)) {
  216. uint8_t addressType = 4;
  217. switch(p->ss_family) {
  218. case AF_INET:
  219. break;
  220. case AF_INET6:
  221. addressType = 6;
  222. break;
  223. default: // we currently only push IP addresses
  224. ++p;
  225. continue;
  226. }
  227. outp.append((uint8_t)0); // no flags
  228. outp.append((uint16_t)0); // no extensions
  229. outp.append(addressType);
  230. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  231. outp.append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  232. outp.append((uint16_t)p->port());
  233. ++count;
  234. ++p;
  235. }
  236. if (count) {
  237. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  238. outp.armor(_key,true,path->nextOutgoingCounter());
  239. path->send(RR,tPtr,outp.data(),outp.size(),now);
  240. }
  241. }
  242. }
  243. }
  244. }
  245. if ((now - _lastWroteState) > ZT_PEER_STATE_WRITE_PERIOD)
  246. writeState(tPtr,now);
  247. }
  248. bool Peer::sendDirect(void *tPtr,const void *data,unsigned int len,uint64_t now,bool force)
  249. {
  250. Mutex::Lock _l(_paths_m);
  251. uint64_t v6lr = 0;
  252. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  253. v6lr = _v6Path.p->lastIn();
  254. uint64_t v4lr = 0;
  255. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  256. v4lr = _v4Path.p->lastIn();
  257. if ( (v6lr > v4lr) && ((now - v6lr) < ZT_PATH_ALIVE_TIMEOUT) ) {
  258. return _v6Path.p->send(RR,tPtr,data,len,now);
  259. } else if ((now - v4lr) < ZT_PATH_ALIVE_TIMEOUT) {
  260. return _v4Path.p->send(RR,tPtr,data,len,now);
  261. } else if (force) {
  262. if (v6lr > v4lr) {
  263. return _v6Path.p->send(RR,tPtr,data,len,now);
  264. } else if (v4lr) {
  265. return _v4Path.p->send(RR,tPtr,data,len,now);
  266. }
  267. }
  268. return false;
  269. }
  270. SharedPtr<Path> Peer::getBestPath(uint64_t now,bool includeExpired)
  271. {
  272. Mutex::Lock _l(_paths_m);
  273. uint64_t v6lr = 0;
  274. if ( ( includeExpired || ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v6Path.p) )
  275. v6lr = _v6Path.p->lastIn();
  276. uint64_t v4lr = 0;
  277. if ( ( includeExpired || ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v4Path.p) )
  278. v4lr = _v4Path.p->lastIn();
  279. if (v6lr > v4lr) {
  280. return _v6Path.p;
  281. } else if (v4lr) {
  282. return _v4Path.p;
  283. }
  284. return SharedPtr<Path>();
  285. }
  286. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,unsigned int counter)
  287. {
  288. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  289. outp.append((unsigned char)ZT_PROTO_VERSION);
  290. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  291. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  292. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  293. outp.append(now);
  294. RR->identity.serialize(outp,false);
  295. atAddress.serialize(outp);
  296. outp.append((uint64_t)RR->topology->planetWorldId());
  297. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  298. const unsigned int startCryptedPortionAt = outp.size();
  299. std::vector<World> moons(RR->topology->moons());
  300. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  301. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  302. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  303. outp.append((uint8_t)m->type());
  304. outp.append((uint64_t)m->id());
  305. outp.append((uint64_t)m->timestamp());
  306. }
  307. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  308. outp.append((uint8_t)World::TYPE_MOON);
  309. outp.append(*m);
  310. outp.append((uint64_t)0);
  311. }
  312. const unsigned int corSizeAt = outp.size();
  313. outp.addSize(2);
  314. RR->topology->appendCertificateOfRepresentation(outp);
  315. outp.setAt(corSizeAt,(uint16_t)(outp.size() - (corSizeAt + 2)));
  316. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  317. RR->node->expectReplyTo(outp.packetId());
  318. if (atAddress) {
  319. outp.armor(_key,false,counter); // false == don't encrypt full payload, but add MAC
  320. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  321. } else {
  322. RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
  323. }
  324. }
  325. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,bool sendFullHello,unsigned int counter)
  326. {
  327. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  328. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  329. RR->node->expectReplyTo(outp.packetId());
  330. outp.armor(_key,true,counter);
  331. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  332. } else {
  333. sendHELLO(tPtr,localSocket,atAddress,now,counter);
  334. }
  335. }
  336. void Peer::tryMemorizedPath(void *tPtr,uint64_t now)
  337. {
  338. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  339. _lastTriedMemorizedPath = now;
  340. InetAddress mp;
  341. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp))
  342. attemptToContactAt(tPtr,InetAddress(),mp,now,true,0);
  343. }
  344. }
  345. bool Peer::doPingAndKeepalive(void *tPtr,uint64_t now,int inetAddressFamily)
  346. {
  347. Mutex::Lock _l(_paths_m);
  348. if (inetAddressFamily < 0) {
  349. uint64_t v6lr = 0;
  350. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  351. v6lr = _v6Path.p->lastIn();
  352. uint64_t v4lr = 0;
  353. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  354. v4lr = _v4Path.p->lastIn();
  355. if (v6lr > v4lr) {
  356. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  357. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  358. _v6Path.p->sent(now);
  359. return true;
  360. }
  361. } else if (v4lr) {
  362. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  363. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  364. _v4Path.p->sent(now);
  365. return true;
  366. }
  367. }
  368. } else {
  369. if ( (inetAddressFamily == AF_INET) && ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  370. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  371. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  372. _v4Path.p->sent(now);
  373. return true;
  374. }
  375. } else if ( (inetAddressFamily == AF_INET6) && ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  376. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  377. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  378. _v6Path.p->sent(now);
  379. return true;
  380. }
  381. }
  382. }
  383. return false;
  384. }
  385. void Peer::writeState(void *tPtr,const uint64_t now)
  386. {
  387. try {
  388. Buffer<ZT_PEER_MAX_SERIALIZED_STATE_SIZE> b;
  389. b.append((uint8_t)1); // version
  390. b.append(now);
  391. _id.serialize(b);
  392. {
  393. Mutex::Lock _l(_paths_m);
  394. unsigned int count = 0;
  395. if (_v4Path.lr)
  396. ++count;
  397. if (_v6Path.lr)
  398. ++count;
  399. b.append((uint8_t)count);
  400. if (_v4Path.lr) {
  401. b.append(_v4Path.lr);
  402. b.append(_v4Path.p->lastOut());
  403. b.append(_v4Path.p->lastIn());
  404. b.append(_v4Path.p->lastTrustEstablishedPacketReceived());
  405. _v4Path.p->address().serialize(b);
  406. }
  407. if (_v6Path.lr) {
  408. b.append(_v6Path.lr);
  409. b.append(_v6Path.p->lastOut());
  410. b.append(_v6Path.p->lastIn());
  411. b.append(_v6Path.p->lastTrustEstablishedPacketReceived());
  412. _v6Path.p->address().serialize(b);
  413. }
  414. }
  415. // Save space by sending these as time since now at 100ms resolution
  416. b.append((uint16_t)(std::max(now - _lastReceive,(uint64_t)6553500) / 100));
  417. b.append((uint16_t)(std::max(now - _lastNontrivialReceive,(uint64_t)6553500) / 100));
  418. b.append((uint16_t)(std::max(now - _lastTriedMemorizedPath,(uint64_t)6553500) / 100));
  419. b.append((uint16_t)(std::max(now - _lastDirectPathPushSent,(uint64_t)6553500) / 100));
  420. b.append((uint16_t)(std::max(now - _lastDirectPathPushReceive,(uint64_t)6553500) / 100));
  421. b.append((uint16_t)(std::max(now - _lastCredentialRequestSent,(uint64_t)6553500) / 100));
  422. b.append((uint16_t)(std::max(now - _lastWhoisRequestReceived,(uint64_t)6553500) / 100));
  423. b.append((uint16_t)(std::max(now - _lastEchoRequestReceived,(uint64_t)6553500) / 100));
  424. b.append((uint16_t)(std::max(now - _lastComRequestReceived,(uint64_t)6553500) / 100));
  425. b.append((uint16_t)(std::max(now - _lastComRequestSent,(uint64_t)6553500) / 100));
  426. b.append((uint16_t)(std::max(now - _lastCredentialsReceived,(uint64_t)6553500) / 100));
  427. b.append((uint16_t)(std::max(now - _lastTrustEstablishedPacketReceived,(uint64_t)6553500) / 100));
  428. b.append((uint8_t)_vProto);
  429. b.append((uint8_t)_vMajor);
  430. b.append((uint8_t)_vMinor);
  431. b.append((uint16_t)_vRevision);
  432. b.append((uint16_t)0); // length of additional fields
  433. uint64_t tmp[2];
  434. tmp[0] = _id.address().toInt(); tmp[1] = 0;
  435. //RR->node->stateObjectPut(tPtr,ZT_STATE_OBJECT_PEER_STATE,tmp,b.data(),b.size());
  436. _lastWroteState = now;
  437. } catch ( ... ) {} // sanity check, should not be possible
  438. }
  439. bool Peer::applyStateUpdate(const void *data,unsigned int len)
  440. {
  441. try {
  442. Buffer<ZT_PEER_MAX_SERIALIZED_STATE_SIZE> b(data,len);
  443. unsigned int ptr = 0;
  444. if (b[ptr++] != 1)
  445. return false;
  446. const uint64_t ts = b.at<uint64_t>(ptr); ptr += 8;
  447. if (ts <= _lastReceivedStateTimestamp)
  448. return false;
  449. Identity id;
  450. ptr += id.deserialize(b,ptr);
  451. if (id != _id) // sanity check
  452. return false;
  453. const unsigned int pathCount = (unsigned int)b[ptr++];
  454. {
  455. Mutex::Lock _l(_paths_m);
  456. for(unsigned int i=0;i<pathCount;++i) {
  457. const uint64_t lr = b.at<uint64_t>(ptr); ptr += 8;
  458. const uint64_t lastOut = b.at<uint64_t>(ptr); ptr += 8;
  459. const uint64_t lastIn = b.at<uint64_t>(ptr); ptr += 8;
  460. const uint64_t lastTrustEstablishedPacketReceived = b.at<uint64_t>(ptr); ptr += 8;
  461. InetAddress addr;
  462. ptr += addr.deserialize(b,ptr);
  463. _PeerPath *p = (_PeerPath *)0;
  464. switch(addr.ss_family) {
  465. case AF_INET: p = &_v4Path; break;
  466. case AF_INET6: p = &_v6Path; break;
  467. }
  468. if (p) {
  469. if ( (!p->p) || (p->p->address() != addr) ) {
  470. p->p = RR->topology->getPath(-1,addr);
  471. }
  472. p->lr = lr;
  473. p->p->updateFromRemoteState(lastOut,lastIn,lastTrustEstablishedPacketReceived);
  474. }
  475. }
  476. }
  477. _lastReceive = std::max(_lastReceive,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  478. _lastNontrivialReceive = std::max(_lastNontrivialReceive,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  479. _lastTriedMemorizedPath = std::max(_lastTriedMemorizedPath,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  480. _lastDirectPathPushSent = std::max(_lastDirectPathPushSent,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  481. _lastDirectPathPushReceive = std::max(_lastDirectPathPushReceive,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  482. _lastCredentialRequestSent = std::max(_lastCredentialRequestSent,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  483. _lastWhoisRequestReceived = std::max(_lastWhoisRequestReceived,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  484. _lastEchoRequestReceived = std::max(_lastEchoRequestReceived,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  485. _lastComRequestReceived = std::max(_lastComRequestReceived,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  486. _lastComRequestSent = std::max(_lastComRequestSent,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  487. _lastCredentialsReceived = std::max(_lastCredentialsReceived,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  488. _lastTrustEstablishedPacketReceived = std::max(_lastTrustEstablishedPacketReceived,ts - ((uint64_t)b.at<uint16_t>(ptr) * 100ULL)); ptr += 2;
  489. _vProto = (uint16_t)b[ptr++];
  490. _vMajor = (uint16_t)b[ptr++];
  491. _vMinor = (uint16_t)b[ptr++];
  492. _vRevision = b.at<uint16_t>(ptr); ptr += 2;
  493. _lastReceivedStateTimestamp = ts;
  494. return true;
  495. } catch ( ... ) {} // ignore invalid state updates
  496. return false;
  497. }
  498. SharedPtr<Peer> Peer::createFromStateUpdate(const RuntimeEnvironment *renv,void *tPtr,const void *data,unsigned int len)
  499. {
  500. try {
  501. Identity id;
  502. {
  503. Buffer<ZT_PEER_MAX_SERIALIZED_STATE_SIZE> b(data,len);
  504. unsigned int ptr = 0;
  505. if (b[ptr++] != 1)
  506. return SharedPtr<Peer>();
  507. ptr += 8; // skip TS, don't care
  508. id.deserialize(b,ptr);
  509. }
  510. if (id) {
  511. const SharedPtr<Peer> p(new Peer(renv,renv->identity,id));
  512. if (p->applyStateUpdate(data,len))
  513. return renv->topology->addPeer(tPtr,p);
  514. }
  515. } catch ( ... ) {}
  516. return SharedPtr<Peer>();
  517. }
  518. } // namespace ZeroTier