Peer.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454
  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. }
  184. // If we are being relayed or if we're using a global address, send PUSH_DIRECT_PATHS.
  185. // In the global address case we push only configured direct paths to accomplish
  186. // fall-forward to local backplane networks over e.g. LAN or Amazon VPC.
  187. if ( ((hops > 0)||(path->ipScope() == InetAddress::IP_SCOPE_GLOBAL)) && (this->trustEstablished(now)) ) {
  188. if ((now - _lastDirectPathPushSent) >= ZT_DIRECT_PATH_PUSH_INTERVAL) {
  189. _lastDirectPathPushSent = now;
  190. std::vector<InetAddress> pathsToPush;
  191. std::vector<InetAddress> dps(RR->node->directPaths());
  192. for(std::vector<InetAddress>::const_iterator i(dps.begin());i!=dps.end();++i)
  193. pathsToPush.push_back(*i);
  194. if (hops > 0) {
  195. std::vector<InetAddress> sym(RR->sa->getSymmetricNatPredictions());
  196. for(unsigned long i=0,added=0;i<sym.size();++i) {
  197. InetAddress tmp(sym[(unsigned long)RR->node->prng() % sym.size()]);
  198. if (std::find(pathsToPush.begin(),pathsToPush.end(),tmp) == pathsToPush.end()) {
  199. pathsToPush.push_back(tmp);
  200. if (++added >= ZT_PUSH_DIRECT_PATHS_MAX_PER_SCOPE_AND_FAMILY)
  201. break;
  202. }
  203. }
  204. }
  205. if (pathsToPush.size() > 0) {
  206. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  207. while (p != pathsToPush.end()) {
  208. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  209. outp.addSize(2); // leave room for count
  210. unsigned int count = 0;
  211. while ((p != pathsToPush.end())&&((outp.size() + 24) < 1200)) {
  212. uint8_t addressType = 4;
  213. switch(p->ss_family) {
  214. case AF_INET:
  215. break;
  216. case AF_INET6:
  217. addressType = 6;
  218. break;
  219. default: // we currently only push IP addresses
  220. ++p;
  221. continue;
  222. }
  223. outp.append((uint8_t)0); // no flags
  224. outp.append((uint16_t)0); // no extensions
  225. outp.append(addressType);
  226. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  227. outp.append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  228. outp.append((uint16_t)p->port());
  229. ++count;
  230. ++p;
  231. }
  232. if (count) {
  233. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  234. outp.armor(_key,true,path->nextOutgoingCounter());
  235. path->send(RR,tPtr,outp.data(),outp.size(),now);
  236. }
  237. }
  238. }
  239. }
  240. }
  241. }
  242. bool Peer::sendDirect(void *tPtr,const void *data,unsigned int len,uint64_t now,bool force)
  243. {
  244. Mutex::Lock _l(_paths_m);
  245. uint64_t v6lr = 0;
  246. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  247. v6lr = _v6Path.p->lastIn();
  248. uint64_t v4lr = 0;
  249. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  250. v4lr = _v4Path.p->lastIn();
  251. if ( (v6lr > v4lr) && ((now - v6lr) < ZT_PATH_ALIVE_TIMEOUT) ) {
  252. return _v6Path.p->send(RR,tPtr,data,len,now);
  253. } else if ((now - v4lr) < ZT_PATH_ALIVE_TIMEOUT) {
  254. return _v4Path.p->send(RR,tPtr,data,len,now);
  255. } else if (force) {
  256. if (v6lr > v4lr) {
  257. return _v6Path.p->send(RR,tPtr,data,len,now);
  258. } else if (v4lr) {
  259. return _v4Path.p->send(RR,tPtr,data,len,now);
  260. }
  261. }
  262. return false;
  263. }
  264. SharedPtr<Path> Peer::getBestPath(uint64_t now,bool includeExpired)
  265. {
  266. Mutex::Lock _l(_paths_m);
  267. uint64_t v6lr = 0;
  268. if ( ( includeExpired || ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v6Path.p) )
  269. v6lr = _v6Path.p->lastIn();
  270. uint64_t v4lr = 0;
  271. if ( ( includeExpired || ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v4Path.p) )
  272. v4lr = _v4Path.p->lastIn();
  273. if (v6lr > v4lr) {
  274. return _v6Path.p;
  275. } else if (v4lr) {
  276. return _v4Path.p;
  277. }
  278. return SharedPtr<Path>();
  279. }
  280. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,unsigned int counter)
  281. {
  282. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  283. outp.append((unsigned char)ZT_PROTO_VERSION);
  284. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  285. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  286. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  287. outp.append(now);
  288. RR->identity.serialize(outp,false);
  289. atAddress.serialize(outp);
  290. outp.append((uint64_t)RR->topology->planetWorldId());
  291. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  292. const unsigned int startCryptedPortionAt = outp.size();
  293. std::vector<World> moons(RR->topology->moons());
  294. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  295. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  296. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  297. outp.append((uint8_t)m->type());
  298. outp.append((uint64_t)m->id());
  299. outp.append((uint64_t)m->timestamp());
  300. }
  301. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  302. outp.append((uint8_t)World::TYPE_MOON);
  303. outp.append(*m);
  304. outp.append((uint64_t)0);
  305. }
  306. const unsigned int corSizeAt = outp.size();
  307. outp.addSize(2);
  308. RR->topology->appendCertificateOfRepresentation(outp);
  309. outp.setAt(corSizeAt,(uint16_t)(outp.size() - (corSizeAt + 2)));
  310. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  311. RR->node->expectReplyTo(outp.packetId());
  312. if (atAddress) {
  313. outp.armor(_key,false,counter); // false == don't encrypt full payload, but add MAC
  314. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  315. } else {
  316. RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
  317. }
  318. }
  319. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,bool sendFullHello,unsigned int counter)
  320. {
  321. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  322. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  323. RR->node->expectReplyTo(outp.packetId());
  324. outp.armor(_key,true,counter);
  325. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  326. } else {
  327. sendHELLO(tPtr,localSocket,atAddress,now,counter);
  328. }
  329. }
  330. void Peer::tryMemorizedPath(void *tPtr,uint64_t now)
  331. {
  332. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  333. _lastTriedMemorizedPath = now;
  334. InetAddress mp;
  335. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp))
  336. attemptToContactAt(tPtr,-1,mp,now,true,0);
  337. }
  338. }
  339. bool Peer::doPingAndKeepalive(void *tPtr,uint64_t now,int inetAddressFamily)
  340. {
  341. Mutex::Lock _l(_paths_m);
  342. if (inetAddressFamily < 0) {
  343. uint64_t v6lr = 0;
  344. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  345. v6lr = _v6Path.p->lastIn();
  346. uint64_t v4lr = 0;
  347. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  348. v4lr = _v4Path.p->lastIn();
  349. if (v6lr > v4lr) {
  350. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  351. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  352. _v6Path.p->sent(now);
  353. return true;
  354. }
  355. } else if (v4lr) {
  356. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  357. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  358. _v4Path.p->sent(now);
  359. return true;
  360. }
  361. }
  362. } else {
  363. if ( (inetAddressFamily == AF_INET) && ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  364. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  365. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  366. _v4Path.p->sent(now);
  367. return true;
  368. }
  369. } else if ( (inetAddressFamily == AF_INET6) && ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  370. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  371. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  372. _v6Path.p->sent(now);
  373. return true;
  374. }
  375. }
  376. }
  377. return false;
  378. }
  379. void Peer::redirect(void *tPtr,const int64_t localSocket,const InetAddress &remoteAddress,const uint64_t now)
  380. {
  381. if ((remoteAddress.ss_family != AF_INET)&&(remoteAddress.ss_family != AF_INET6)) // sanity check
  382. return;
  383. SharedPtr<Path> op;
  384. SharedPtr<Path> np(RR->topology->getPath(localSocket,remoteAddress));
  385. np->received(now);
  386. attemptToContactAt(tPtr,localSocket,remoteAddress,now,true,np->nextOutgoingCounter());
  387. {
  388. Mutex::Lock _l(_paths_m);
  389. if (remoteAddress.ss_family == AF_INET) {
  390. op = _v4Path.p;
  391. _v4Path.lr = now;
  392. _v4Path.sticky = now;
  393. _v4Path.p = np;
  394. } else if (remoteAddress.ss_family == AF_INET6) {
  395. op = _v6Path.p;
  396. _v6Path.lr = now;
  397. _v6Path.sticky = now;
  398. _v6Path.p = np;
  399. }
  400. }
  401. RR->t->peerRedirected(tPtr,0,*this,op,np);
  402. }
  403. } // namespace ZeroTier