Peer.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  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. _lastReceive(0),
  38. _lastNontrivialReceive(0),
  39. _lastTriedMemorizedPath(0),
  40. _lastDirectPathPushSent(0),
  41. _lastDirectPathPushReceive(0),
  42. _lastCredentialRequestSent(0),
  43. _lastWhoisRequestReceived(0),
  44. _lastEchoRequestReceived(0),
  45. _lastComRequestReceived(0),
  46. _lastComRequestSent(0),
  47. _lastCredentialsReceived(0),
  48. _lastTrustEstablishedPacketReceived(0),
  49. _vProto(0),
  50. _vMajor(0),
  51. _vMinor(0),
  52. _vRevision(0),
  53. _id(peerIdentity),
  54. _latency(0),
  55. _directPathPushCutoffCount(0),
  56. _credentialsCutoffCount(0)
  57. {
  58. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  59. throw std::runtime_error("new peer identity key agreement failed");
  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 Packet::Verb verb,
  67. const uint64_t inRePacketId,
  68. const Packet::Verb inReVerb,
  69. const bool trustEstablished)
  70. {
  71. const uint64_t now = RR->node->now();
  72. /*
  73. #ifdef ZT_ENABLE_CLUSTER
  74. bool isClusterSuboptimalPath = false;
  75. if ((RR->cluster)&&(hops == 0)) {
  76. // Note: findBetterEndpoint() is first since we still want to check
  77. // for a better endpoint even if we don't actually send a redirect.
  78. InetAddress redirectTo;
  79. 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)) ) {
  80. if (_vProto >= 5) {
  81. // For newer peers we can send a more idiomatic verb: PUSH_DIRECT_PATHS.
  82. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  83. outp.append((uint16_t)1); // count == 1
  84. outp.append((uint8_t)ZT_PUSH_DIRECT_PATHS_FLAG_CLUSTER_REDIRECT); // flags: cluster redirect
  85. outp.append((uint16_t)0); // no extensions
  86. if (redirectTo.ss_family == AF_INET) {
  87. outp.append((uint8_t)4);
  88. outp.append((uint8_t)6);
  89. outp.append(redirectTo.rawIpData(),4);
  90. } else {
  91. outp.append((uint8_t)6);
  92. outp.append((uint8_t)18);
  93. outp.append(redirectTo.rawIpData(),16);
  94. }
  95. outp.append((uint16_t)redirectTo.port());
  96. outp.armor(_key,true,path->nextOutgoingCounter());
  97. path->send(RR,tPtr,outp.data(),outp.size(),now);
  98. } else {
  99. // For older peers we use RENDEZVOUS to coax them into contacting us elsewhere.
  100. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  101. outp.append((uint8_t)0); // no flags
  102. RR->identity.address().appendTo(outp);
  103. outp.append((uint16_t)redirectTo.port());
  104. if (redirectTo.ss_family == AF_INET) {
  105. outp.append((uint8_t)4);
  106. outp.append(redirectTo.rawIpData(),4);
  107. } else {
  108. outp.append((uint8_t)16);
  109. outp.append(redirectTo.rawIpData(),16);
  110. }
  111. outp.armor(_key,true,path->nextOutgoingCounter());
  112. path->send(RR,tPtr,outp.data(),outp.size(),now);
  113. }
  114. isClusterSuboptimalPath = true;
  115. }
  116. }
  117. #endif
  118. */
  119. _lastReceive = now;
  120. switch (verb) {
  121. case Packet::VERB_FRAME:
  122. case Packet::VERB_EXT_FRAME:
  123. case Packet::VERB_NETWORK_CONFIG_REQUEST:
  124. case Packet::VERB_NETWORK_CONFIG:
  125. case Packet::VERB_MULTICAST_FRAME:
  126. _lastNontrivialReceive = now;
  127. break;
  128. default: break;
  129. }
  130. if (trustEstablished) {
  131. _lastTrustEstablishedPacketReceived = now;
  132. path->trustedPacketReceived(now);
  133. }
  134. if (_vProto >= 9)
  135. path->updateLinkQuality((unsigned int)(packetId & 7));
  136. if (hops == 0) {
  137. // If this is a direct packet (no hops), update existing paths or learn new ones
  138. bool pathAlreadyKnown = false;
  139. {
  140. Mutex::Lock _l(_paths_m);
  141. if ((path->address().ss_family == AF_INET)&&(_v4Path.p)) {
  142. const struct sockaddr_in *const r = reinterpret_cast<const struct sockaddr_in *>(&(path->address()));
  143. const struct sockaddr_in *const l = reinterpret_cast<const struct sockaddr_in *>(&(_v4Path.p->address()));
  144. if ((r->sin_addr.s_addr == l->sin_addr.s_addr)&&(r->sin_port == l->sin_port)&&(path->localSocket() == _v4Path.p->localSocket())) {
  145. _v4Path.lr = now;
  146. pathAlreadyKnown = true;
  147. }
  148. } else if ((path->address().ss_family == AF_INET6)&&(_v6Path.p)) {
  149. const struct sockaddr_in6 *const r = reinterpret_cast<const struct sockaddr_in6 *>(&(path->address()));
  150. const struct sockaddr_in6 *const l = reinterpret_cast<const struct sockaddr_in6 *>(&(_v6Path.p->address()));
  151. if ((!memcmp(r->sin6_addr.s6_addr,l->sin6_addr.s6_addr,16))&&(r->sin6_port == l->sin6_port)&&(path->localSocket() == _v6Path.p->localSocket())) {
  152. _v6Path.lr = now;
  153. pathAlreadyKnown = true;
  154. }
  155. }
  156. }
  157. if ( (!pathAlreadyKnown) && (RR->node->shouldUsePathForZeroTierTraffic(tPtr,_id.address(),path->localSocket(),path->address())) ) {
  158. Mutex::Lock _l(_paths_m);
  159. _PeerPath *potentialNewPeerPath = (_PeerPath *)0;
  160. if (path->address().ss_family == AF_INET) {
  161. if ( (!_v4Path.p) || (!_v4Path.p->alive(now)) || (path->preferenceRank() >= _v4Path.p->preferenceRank()) ) {
  162. potentialNewPeerPath = &_v4Path;
  163. }
  164. } else if (path->address().ss_family == AF_INET6) {
  165. if ( (!_v6Path.p) || (!_v6Path.p->alive(now)) || (path->preferenceRank() >= _v6Path.p->preferenceRank()) ) {
  166. potentialNewPeerPath = &_v6Path;
  167. }
  168. }
  169. if (potentialNewPeerPath) {
  170. if (verb == Packet::VERB_OK) {
  171. potentialNewPeerPath->lr = now;
  172. potentialNewPeerPath->p = path;
  173. } else {
  174. TRACE("got %s via unknown path %s(%s), confirming...",Packet::verbString(verb),_id.address().toString().c_str(),path->address().toString().c_str());
  175. attemptToContactAt(tPtr,path->localSocket(),path->address(),now,true,path->nextOutgoingCounter());
  176. path->sent(now);
  177. }
  178. }
  179. }
  180. } else if (this->trustEstablished(now)) {
  181. // Send PUSH_DIRECT_PATHS if hops>0 (relayed) and we have a trust relationship (common network membership)
  182. if ((now - _lastDirectPathPushSent) >= ZT_DIRECT_PATH_PUSH_INTERVAL) {
  183. _lastDirectPathPushSent = now;
  184. std::vector<InetAddress> pathsToPush;
  185. std::vector<InetAddress> dps(RR->node->directPaths());
  186. for(std::vector<InetAddress>::const_iterator i(dps.begin());i!=dps.end();++i)
  187. pathsToPush.push_back(*i);
  188. std::vector<InetAddress> sym(RR->sa->getSymmetricNatPredictions());
  189. for(unsigned long i=0,added=0;i<sym.size();++i) {
  190. InetAddress tmp(sym[(unsigned long)RR->node->prng() % sym.size()]);
  191. if (std::find(pathsToPush.begin(),pathsToPush.end(),tmp) == pathsToPush.end()) {
  192. pathsToPush.push_back(tmp);
  193. if (++added >= ZT_PUSH_DIRECT_PATHS_MAX_PER_SCOPE_AND_FAMILY)
  194. break;
  195. }
  196. }
  197. if (pathsToPush.size() > 0) {
  198. #ifdef ZT_TRACE
  199. std::string ps;
  200. for(std::vector<InetAddress>::const_iterator p(pathsToPush.begin());p!=pathsToPush.end();++p) {
  201. if (ps.length() > 0)
  202. ps.push_back(',');
  203. ps.append(p->toString());
  204. }
  205. TRACE("pushing %u direct paths to %s: %s",(unsigned int)pathsToPush.size(),_id.address().toString().c_str(),ps.c_str());
  206. #endif
  207. std::vector<InetAddress>::const_iterator p(pathsToPush.begin());
  208. while (p != pathsToPush.end()) {
  209. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  210. outp.addSize(2); // leave room for count
  211. unsigned int count = 0;
  212. while ((p != pathsToPush.end())&&((outp.size() + 24) < 1200)) {
  213. uint8_t addressType = 4;
  214. switch(p->ss_family) {
  215. case AF_INET:
  216. break;
  217. case AF_INET6:
  218. addressType = 6;
  219. break;
  220. default: // we currently only push IP addresses
  221. ++p;
  222. continue;
  223. }
  224. outp.append((uint8_t)0); // no flags
  225. outp.append((uint16_t)0); // no extensions
  226. outp.append(addressType);
  227. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  228. outp.append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  229. outp.append((uint16_t)p->port());
  230. ++count;
  231. ++p;
  232. }
  233. if (count) {
  234. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  235. outp.armor(_key,true,path->nextOutgoingCounter());
  236. path->send(RR,tPtr,outp.data(),outp.size(),now);
  237. }
  238. }
  239. }
  240. }
  241. }
  242. }
  243. bool Peer::sendDirect(void *tPtr,const void *data,unsigned int len,uint64_t now,bool force)
  244. {
  245. Mutex::Lock _l(_paths_m);
  246. uint64_t v6lr = 0;
  247. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  248. v6lr = _v6Path.p->lastIn();
  249. uint64_t v4lr = 0;
  250. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  251. v4lr = _v4Path.p->lastIn();
  252. if ( (v6lr > v4lr) && ((now - v6lr) < ZT_PATH_ALIVE_TIMEOUT) ) {
  253. return _v6Path.p->send(RR,tPtr,data,len,now);
  254. } else if ((now - v4lr) < ZT_PATH_ALIVE_TIMEOUT) {
  255. return _v4Path.p->send(RR,tPtr,data,len,now);
  256. } else if (force) {
  257. if (v6lr > v4lr) {
  258. return _v6Path.p->send(RR,tPtr,data,len,now);
  259. } else if (v4lr) {
  260. return _v4Path.p->send(RR,tPtr,data,len,now);
  261. }
  262. }
  263. return false;
  264. }
  265. SharedPtr<Path> Peer::getBestPath(uint64_t now,bool includeExpired)
  266. {
  267. Mutex::Lock _l(_paths_m);
  268. uint64_t v6lr = 0;
  269. if ( ( includeExpired || ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v6Path.p) )
  270. v6lr = _v6Path.p->lastIn();
  271. uint64_t v4lr = 0;
  272. if ( ( includeExpired || ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) && (_v4Path.p) )
  273. v4lr = _v4Path.p->lastIn();
  274. if (v6lr > v4lr) {
  275. return _v6Path.p;
  276. } else if (v4lr) {
  277. return _v4Path.p;
  278. }
  279. return SharedPtr<Path>();
  280. }
  281. void Peer::sendHELLO(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,unsigned int counter)
  282. {
  283. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  284. outp.append((unsigned char)ZT_PROTO_VERSION);
  285. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  286. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  287. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  288. outp.append(now);
  289. RR->identity.serialize(outp,false);
  290. atAddress.serialize(outp);
  291. outp.append((uint64_t)RR->topology->planetWorldId());
  292. outp.append((uint64_t)RR->topology->planetWorldTimestamp());
  293. const unsigned int startCryptedPortionAt = outp.size();
  294. std::vector<World> moons(RR->topology->moons());
  295. std::vector<uint64_t> moonsWanted(RR->topology->moonsWanted());
  296. outp.append((uint16_t)(moons.size() + moonsWanted.size()));
  297. for(std::vector<World>::const_iterator m(moons.begin());m!=moons.end();++m) {
  298. outp.append((uint8_t)m->type());
  299. outp.append((uint64_t)m->id());
  300. outp.append((uint64_t)m->timestamp());
  301. }
  302. for(std::vector<uint64_t>::const_iterator m(moonsWanted.begin());m!=moonsWanted.end();++m) {
  303. outp.append((uint8_t)World::TYPE_MOON);
  304. outp.append(*m);
  305. outp.append((uint64_t)0);
  306. }
  307. const unsigned int corSizeAt = outp.size();
  308. outp.addSize(2);
  309. RR->topology->appendCertificateOfRepresentation(outp);
  310. outp.setAt(corSizeAt,(uint16_t)(outp.size() - (corSizeAt + 2)));
  311. outp.cryptField(_key,startCryptedPortionAt,outp.size() - startCryptedPortionAt);
  312. RR->node->expectReplyTo(outp.packetId());
  313. if (atAddress) {
  314. outp.armor(_key,false,counter); // false == don't encrypt full payload, but add MAC
  315. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  316. } else {
  317. RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
  318. }
  319. }
  320. void Peer::attemptToContactAt(void *tPtr,const int64_t localSocket,const InetAddress &atAddress,uint64_t now,bool sendFullHello,unsigned int counter)
  321. {
  322. if ( (!sendFullHello) && (_vProto >= 5) && (!((_vMajor == 1)&&(_vMinor == 1)&&(_vRevision == 0))) ) {
  323. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_ECHO);
  324. RR->node->expectReplyTo(outp.packetId());
  325. outp.armor(_key,true,counter);
  326. RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
  327. } else {
  328. sendHELLO(tPtr,localSocket,atAddress,now,counter);
  329. }
  330. }
  331. void Peer::tryMemorizedPath(void *tPtr,uint64_t now)
  332. {
  333. if ((now - _lastTriedMemorizedPath) >= ZT_TRY_MEMORIZED_PATH_INTERVAL) {
  334. _lastTriedMemorizedPath = now;
  335. InetAddress mp;
  336. if (RR->node->externalPathLookup(tPtr,_id.address(),-1,mp))
  337. attemptToContactAt(tPtr,InetAddress(),mp,now,true,0);
  338. }
  339. }
  340. bool Peer::doPingAndKeepalive(void *tPtr,uint64_t now,int inetAddressFamily)
  341. {
  342. Mutex::Lock _l(_paths_m);
  343. if (inetAddressFamily < 0) {
  344. uint64_t v6lr = 0;
  345. if ( ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v6Path.p) )
  346. v6lr = _v6Path.p->lastIn();
  347. uint64_t v4lr = 0;
  348. if ( ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) && (_v4Path.p) )
  349. v4lr = _v4Path.p->lastIn();
  350. if (v6lr > v4lr) {
  351. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  352. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  353. _v6Path.p->sent(now);
  354. return true;
  355. }
  356. } else if (v4lr) {
  357. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  358. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  359. _v4Path.p->sent(now);
  360. return true;
  361. }
  362. }
  363. } else {
  364. if ( (inetAddressFamily == AF_INET) && ((now - _v4Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  365. if ( ((now - _v4Path.lr) >= ZT_PEER_PING_PERIOD) || (_v4Path.p->needsHeartbeat(now)) ) {
  366. attemptToContactAt(tPtr,_v4Path.p->localSocket(),_v4Path.p->address(),now,false,_v4Path.p->nextOutgoingCounter());
  367. _v4Path.p->sent(now);
  368. return true;
  369. }
  370. } else if ( (inetAddressFamily == AF_INET6) && ((now - _v6Path.lr) < ZT_PEER_PATH_EXPIRATION) ) {
  371. if ( ((now - _v6Path.lr) >= ZT_PEER_PING_PERIOD) || (_v6Path.p->needsHeartbeat(now)) ) {
  372. attemptToContactAt(tPtr,_v6Path.p->localSocket(),_v6Path.p->address(),now,false,_v6Path.p->nextOutgoingCounter());
  373. _v6Path.p->sent(now);
  374. return true;
  375. }
  376. }
  377. }
  378. return false;
  379. }
  380. } // namespace ZeroTier