Peer.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445
  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. #include "Trace.hpp"
  35. namespace ZeroTier {
  36. Peer::Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity) :
  37. RR(renv),
  38. _lastReceive(0),
  39. _lastNontrivialReceive(0),
  40. _lastTriedMemorizedPath(0),
  41. _lastDirectPathPushSent(0),
  42. _lastDirectPathPushReceive(0),
  43. _lastCredentialRequestSent(0),
  44. _lastWhoisRequestReceived(0),
  45. _lastEchoRequestReceived(0),
  46. _lastComRequestReceived(0),
  47. _lastComRequestSent(0),
  48. _lastCredentialsReceived(0),
  49. _lastTrustEstablishedPacketReceived(0),
  50. _vProto(0),
  51. _vMajor(0),
  52. _vMinor(0),
  53. _vRevision(0),
  54. _id(peerIdentity),
  55. _latency(0),
  56. _directPathPushCutoffCount(0),
  57. _credentialsCutoffCount(0)
  58. {
  59. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  60. throw ZT_EXCEPTION_INVALID_ARGUMENT;
  61. }
  62. void Peer::received(
  63. void *tPtr,
  64. const SharedPtr<Path> &path,
  65. const unsigned int hops,
  66. const uint64_t packetId,
  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. {
  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 *replacablePath = (_PeerPath *)0;
  162. if (path->address().ss_family == AF_INET) {
  163. if ( ( (!_v4Path.p) || (!_v4Path.p->alive(now)) || (path->preferenceRank() >= _v4Path.p->preferenceRank()) ) && ( (now - _v4Path.sticky) > ZT_PEER_PATH_EXPIRATION ) ) {
  164. replacablePath = &_v4Path;
  165. }
  166. } else if (path->address().ss_family == AF_INET6) {
  167. if ( ( (!_v6Path.p) || (!_v6Path.p->alive(now)) || (path->preferenceRank() >= _v6Path.p->preferenceRank()) ) && ( (now - _v6Path.sticky) > ZT_PEER_PATH_EXPIRATION ) ) {
  168. replacablePath = &_v6Path;
  169. }
  170. }
  171. if (replacablePath) {
  172. if (verb == Packet::VERB_OK) {
  173. RR->t->peerLearnedNewPath(tPtr,networkId,*this,replacablePath->p,path,packetId);
  174. replacablePath->lr = now;
  175. replacablePath->p = path;
  176. } else {
  177. RR->t->peerConfirmingUnknownPath(tPtr,networkId,*this,path,packetId,verb);
  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. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  202. while (p != pathsToPush.end()) {
  203. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  204. outp.addSize(2); // leave room for count
  205. unsigned int count = 0;
  206. while ((p != pathsToPush.end())&&((outp.size() + 24) < 1200)) {
  207. uint8_t addressType = 4;
  208. switch(p->ss_family) {
  209. case AF_INET:
  210. break;
  211. case AF_INET6:
  212. addressType = 6;
  213. break;
  214. default: // we currently only push IP addresses
  215. ++p;
  216. continue;
  217. }
  218. outp.append((uint8_t)0); // no flags
  219. outp.append((uint16_t)0); // no extensions
  220. outp.append(addressType);
  221. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  222. outp.append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  223. outp.append((uint16_t)p->port());
  224. ++count;
  225. ++p;
  226. }
  227. if (count) {
  228. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  229. outp.armor(_key,true,path->nextOutgoingCounter());
  230. path->send(RR,tPtr,outp.data(),outp.size(),now);
  231. }
  232. }
  233. }
  234. }
  235. }
  236. }
  237. bool Peer::sendDirect(void *tPtr,const void *data,unsigned int len,uint64_t now,bool force)
  238. {
  239. Mutex::Lock _l(_paths_m);
  240. uint64_t v6lr = 0;
  241. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  242. v6lr = _v6Path.p->lastIn();
  243. uint64_t v4lr = 0;
  244. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  245. v4lr = _v4Path.p->lastIn();
  246. if ( (v6lr > v4lr) && ((now - v6lr) < ZT_PATH_ALIVE_TIMEOUT) ) {
  247. return _v6Path.p->send(RR,tPtr,data,len,now);
  248. } else if ((now - v4lr) < ZT_PATH_ALIVE_TIMEOUT) {
  249. return _v4Path.p->send(RR,tPtr,data,len,now);
  250. } else if (force) {
  251. if (v6lr > v4lr) {
  252. return _v6Path.p->send(RR,tPtr,data,len,now);
  253. } else if (v4lr) {
  254. return _v4Path.p->send(RR,tPtr,data,len,now);
  255. }
  256. }
  257. return false;
  258. }
  259. SharedPtr<Path> Peer::getBestPath(uint64_t now,bool includeExpired)
  260. {
  261. Mutex::Lock _l(_paths_m);
  262. uint64_t v6lr = 0;
  263. if ( ( includeExpired || ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v6Path.p) )
  264. v6lr = _v6Path.p->lastIn();
  265. uint64_t v4lr = 0;
  266. if ( ( includeExpired || ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v4Path.p) )
  267. v4lr = _v4Path.p->lastIn();
  268. if (v6lr > v4lr) {
  269. return _v6Path.p;
  270. } else if (v4lr) {
  271. return _v4Path.p;
  272. }
  273. return SharedPtr<Path>();
  274. }
  275. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,unsigned int counter)
  276. {
  277. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  278. outp.append((unsigned char)ZT_PROTO_VERSION);
  279. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  280. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  281. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  282. outp.append(now);
  283. RR->identity.serialize(outp,false);
  284. atAddress.serialize(outp);
  285. outp.append((uint64_t)RR->topology->planetWorldId());
  286. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  287. const unsigned int startCryptedPortionAt = outp.size();
  288. std::vector<World> moons(RR->topology->moons());
  289. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  290. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  291. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  292. outp.append((uint8_t)m->type());
  293. outp.append((uint64_t)m->id());
  294. outp.append((uint64_t)m->timestamp());
  295. }
  296. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  297. outp.append((uint8_t)World::TYPE_MOON);
  298. outp.append(*m);
  299. outp.append((uint64_t)0);
  300. }
  301. const unsigned int corSizeAt = outp.size();
  302. outp.addSize(2);
  303. RR->topology->appendCertificateOfRepresentation(outp);
  304. outp.setAt(corSizeAt,(uint16_t)(outp.size() - (corSizeAt + 2)));
  305. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  306. RR->node->expectReplyTo(outp.packetId());
  307. if (atAddress) {
  308. outp.armor(_key,false,counter); // false == don't encrypt full payload, but add MAC
  309. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  310. } else {
  311. RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
  312. }
  313. }
  314. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,bool sendFullHello,unsigned int counter)
  315. {
  316. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  317. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  318. RR->node->expectReplyTo(outp.packetId());
  319. outp.armor(_key,true,counter);
  320. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  321. } else {
  322. sendHELLO(tPtr,localSocket,atAddress,now,counter);
  323. }
  324. }
  325. void Peer::tryMemorizedPath(void *tPtr,uint64_t now)
  326. {
  327. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  328. _lastTriedMemorizedPath = now;
  329. InetAddress mp;
  330. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp))
  331. attemptToContactAt(tPtr,InetAddress(),mp,now,true,0);
  332. }
  333. }
  334. bool Peer::doPingAndKeepalive(void *tPtr,uint64_t now,int inetAddressFamily)
  335. {
  336. Mutex::Lock _l(_paths_m);
  337. if (inetAddressFamily < 0) {
  338. uint64_t v6lr = 0;
  339. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  340. v6lr = _v6Path.p->lastIn();
  341. uint64_t v4lr = 0;
  342. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  343. v4lr = _v4Path.p->lastIn();
  344. if (v6lr > v4lr) {
  345. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  346. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  347. _v6Path.p->sent(now);
  348. return true;
  349. }
  350. } else if (v4lr) {
  351. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  352. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  353. _v4Path.p->sent(now);
  354. return true;
  355. }
  356. }
  357. } else {
  358. if ( (inetAddressFamily == AF_INET) && ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  359. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  360. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  361. _v4Path.p->sent(now);
  362. return true;
  363. }
  364. } else if ( (inetAddressFamily == AF_INET6) && ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  365. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  366. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  367. _v6Path.p->sent(now);
  368. return true;
  369. }
  370. }
  371. }
  372. return false;
  373. }
  374. void Peer::redirect(void *tPtr,const int64_t localSocket,const InetAddress &remoteAddress,const uint64_t now)
  375. {
  376. if ((remoteAddress.ss_family != AF_INET)&&(remoteAddress.ss_family != AF_INET6)) // sanity check
  377. return;
  378. SharedPtr<Path> op;
  379. SharedPtr<Path> np(RR->topology->getPath(localSocket,remoteAddress));
  380. attemptToContactAt(tPtr,localSocket,remoteAddress,now,true,np->nextOutgoingCounter());
  381. {
  382. Mutex::Lock _l(_paths_m);
  383. if (remoteAddress.ss_family == AF_INET) {
  384. op = _v4Path.p;
  385. _v4Path.p = np;
  386. _v4Path.sticky = now;
  387. } else if (remoteAddress.ss_family == AF_INET6) {
  388. op = _v6Path.p;
  389. _v6Path.p = np;
  390. _v6Path.sticky = now;
  391. }
  392. }
  393. RR->t->peerRedirected(tPtr,0,*this,op,np);
  394. }
  395. } // namespace ZeroTier