Peer.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2015 ZeroTier, Inc.
  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. * ZeroTier may be used and distributed under the terms of the GPLv3, which
  21. * are available at: http://www.gnu.org/licenses/gpl-3.0.html
  22. *
  23. * If you would like to embed ZeroTier into a commercial application or
  24. * redistribute it in a modified binary form, please contact ZeroTier Networks
  25. * LLC. Start here: http://www.zerotier.com/
  26. */
  27. #include "../version.h"
  28. #include "Constants.hpp"
  29. #include "Peer.hpp"
  30. #include "Node.hpp"
  31. #include "Switch.hpp"
  32. #include "Network.hpp"
  33. #include "AntiRecursion.hpp"
  34. #include "SelfAwareness.hpp"
  35. #include "Cluster.hpp"
  36. #include "Packet.hpp"
  37. #include <algorithm>
  38. #define ZT_PEER_PATH_SORT_INTERVAL 5000
  39. namespace ZeroTier {
  40. // Used to send varying values for NAT keepalive
  41. static uint32_t _natKeepaliveBuf = 0;
  42. Peer::Peer(const Identity &myIdentity,const Identity &peerIdentity)
  43. throw(std::runtime_error) :
  44. _lastUsed(0),
  45. _lastReceive(0),
  46. _lastUnicastFrame(0),
  47. _lastMulticastFrame(0),
  48. _lastAnnouncedTo(0),
  49. _lastPathConfirmationSent(0),
  50. _lastDirectPathPushSent(0),
  51. _lastDirectPathPushReceive(0),
  52. _lastPathSort(0),
  53. _vProto(0),
  54. _vMajor(0),
  55. _vMinor(0),
  56. _vRevision(0),
  57. _id(peerIdentity),
  58. _numPaths(0),
  59. _latency(0),
  60. _directPathPushCutoffCount(0),
  61. _networkComs(4),
  62. _lastPushedComs(4)
  63. {
  64. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  65. throw std::runtime_error("new peer identity key agreement failed");
  66. }
  67. void Peer::received(
  68. const RuntimeEnvironment *RR,
  69. const InetAddress &localAddr,
  70. const InetAddress &remoteAddr,
  71. unsigned int hops,
  72. uint64_t packetId,
  73. Packet::Verb verb,
  74. uint64_t inRePacketId,
  75. Packet::Verb inReVerb)
  76. {
  77. #ifdef ZT_ENABLE_CLUSTER
  78. if ((RR->cluster)&&(hops == 0)) {
  79. // Note: findBetterEndpoint() is first since we still want to check
  80. // for a better endpoint even if we don't actually send a redirect.
  81. InetAddress redirectTo;
  82. if ( (RR->cluster->findBetterEndpoint(redirectTo,_id.address(),remoteAddr,false)) && (verb != Packet::VERB_OK)&&(verb != Packet::VERB_ERROR)&&(verb != Packet::VERB_RENDEZVOUS)&&(verb != Packet::VERB_PUSH_DIRECT_PATHS) ) {
  83. if (_vProto >= 5) {
  84. // For newer peers we can send a more idiomatic verb: PUSH_DIRECT_PATHS.
  85. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  86. outp.append((uint16_t)1); // count == 1
  87. outp.append((uint8_t)0); // no flags
  88. outp.append((uint16_t)0); // no extensions
  89. if (redirectTo.ss_family == AF_INET) {
  90. outp.append((uint8_t)4);
  91. outp.append((uint8_t)6);
  92. outp.append(redirectTo.rawIpData(),4);
  93. } else {
  94. outp.append((uint8_t)6);
  95. outp.append((uint8_t)18);
  96. outp.append(redirectTo.rawIpData(),16);
  97. }
  98. outp.append((uint16_t)redirectTo.port());
  99. outp.armor(_key,true);
  100. RR->antiRec->logOutgoingZT(outp.data(),outp.size());
  101. RR->node->putPacket(localAddr,remoteAddr,outp.data(),outp.size());
  102. } else {
  103. // For older peers we use RENDEZVOUS to coax them into contacting us elsewhere.
  104. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_RENDEZVOUS);
  105. outp.append((uint8_t)0); // no flags
  106. RR->identity.address().appendTo(outp);
  107. outp.append((uint16_t)redirectTo.port());
  108. if (redirectTo.ss_family == AF_INET) {
  109. outp.append((uint8_t)4);
  110. outp.append(redirectTo.rawIpData(),4);
  111. } else {
  112. outp.append((uint8_t)16);
  113. outp.append(redirectTo.rawIpData(),16);
  114. }
  115. outp.armor(_key,true);
  116. RR->antiRec->logOutgoingZT(outp.data(),outp.size());
  117. RR->node->putPacket(localAddr,remoteAddr,outp.data(),outp.size());
  118. }
  119. }
  120. }
  121. #endif
  122. const uint64_t now = RR->node->now();
  123. bool needMulticastGroupAnnounce = false;
  124. bool pathIsConfirmed = false;
  125. { // begin _lock
  126. Mutex::Lock _l(_lock);
  127. _lastReceive = now;
  128. if ((verb == Packet::VERB_FRAME)||(verb == Packet::VERB_EXT_FRAME))
  129. _lastUnicastFrame = now;
  130. else if (verb == Packet::VERB_MULTICAST_FRAME)
  131. _lastMulticastFrame = now;
  132. if ((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000)) {
  133. _lastAnnouncedTo = now;
  134. needMulticastGroupAnnounce = true;
  135. }
  136. if (hops == 0) {
  137. unsigned int np = _numPaths;
  138. for(unsigned int p=0;p<np;++p) {
  139. if ((_paths[p].address() == remoteAddr)&&(_paths[p].localAddress() == localAddr)) {
  140. _paths[p].received(now);
  141. pathIsConfirmed = true;
  142. break;
  143. }
  144. }
  145. if (!pathIsConfirmed) {
  146. if (verb == Packet::VERB_OK) {
  147. Path *slot = (Path *)0;
  148. if (np < ZT_MAX_PEER_NETWORK_PATHS) {
  149. slot = &(_paths[np++]);
  150. } else {
  151. uint64_t slotLRmin = 0xffffffffffffffffULL;
  152. for(unsigned int p=0;p<ZT_MAX_PEER_NETWORK_PATHS;++p) {
  153. if (_paths[p].lastReceived() <= slotLRmin) {
  154. slotLRmin = _paths[p].lastReceived();
  155. slot = &(_paths[p]);
  156. }
  157. }
  158. }
  159. if (slot) {
  160. *slot = Path(localAddr,remoteAddr);
  161. slot->received(now);
  162. _numPaths = np;
  163. pathIsConfirmed = true;
  164. _sortPaths(now);
  165. }
  166. } else {
  167. /* If this path is not known, send a HELLO. We don't learn
  168. * paths without confirming that a bidirectional link is in
  169. * fact present, but any packet that decodes and authenticates
  170. * correctly is considered valid. */
  171. if ((now - _lastPathConfirmationSent) >= ZT_MIN_PATH_CONFIRMATION_INTERVAL) {
  172. _lastPathConfirmationSent = now;
  173. TRACE("got %s via unknown path %s(%s), confirming...",Packet::verbString(verb),_id.address().toString().c_str(),remoteAddr.toString().c_str());
  174. sendHELLO(RR,localAddr,remoteAddr,now);
  175. }
  176. }
  177. }
  178. }
  179. } // end _lock
  180. if (needMulticastGroupAnnounce) {
  181. const std::vector< SharedPtr<Network> > networks(RR->node->allNetworks());
  182. for(std::vector< SharedPtr<Network> >::const_iterator n(networks.begin());n!=networks.end();++n)
  183. (*n)->tryAnnounceMulticastGroupsTo(SharedPtr<Peer>(this));
  184. }
  185. }
  186. void Peer::sendHELLO(const RuntimeEnvironment *RR,const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now)
  187. {
  188. // _lock not required here since _id is immutable and nothing else is accessed
  189. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  190. outp.append((unsigned char)ZT_PROTO_VERSION);
  191. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  192. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  193. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  194. outp.append(now);
  195. RR->identity.serialize(outp,false);
  196. atAddress.serialize(outp);
  197. outp.append((uint64_t)RR->topology->worldId());
  198. outp.append((uint64_t)RR->topology->worldTimestamp());
  199. outp.armor(_key,false); // HELLO is sent in the clear
  200. RR->antiRec->logOutgoingZT(outp.data(),outp.size());
  201. RR->node->putPacket(localAddr,atAddress,outp.data(),outp.size());
  202. }
  203. bool Peer::doPingAndKeepalive(const RuntimeEnvironment *RR,uint64_t now,int inetAddressFamily)
  204. {
  205. Path *p = (Path *)0;
  206. Mutex::Lock _l(_lock);
  207. if (inetAddressFamily != 0) {
  208. p = _getBestPath(now,inetAddressFamily);
  209. } else {
  210. p = _getBestPath(now);
  211. }
  212. if (p) {
  213. if ((now - p->lastReceived()) >= ZT_PEER_DIRECT_PING_DELAY) {
  214. //TRACE("PING %s(%s) after %llums/%llums send/receive inactivity",_id.address().toString().c_str(),p->address().toString().c_str(),now - p->lastSend(),now - p->lastReceived());
  215. sendHELLO(RR,p->localAddress(),p->address(),now);
  216. p->sent(now);
  217. } else if (((now - p->lastSend()) >= ZT_NAT_KEEPALIVE_DELAY)&&(!p->reliable())) {
  218. //TRACE("NAT keepalive %s(%s) after %llums/%llums send/receive inactivity",_id.address().toString().c_str(),p->address().toString().c_str(),now - p->lastSend(),now - p->lastReceived());
  219. _natKeepaliveBuf += (uint32_t)((now * 0x9e3779b1) >> 1); // tumble this around to send constantly varying (meaningless) payloads
  220. RR->node->putPacket(p->localAddress(),p->address(),&_natKeepaliveBuf,sizeof(_natKeepaliveBuf));
  221. p->sent(now);
  222. } else {
  223. //TRACE("no PING or NAT keepalive: addr==%s reliable==%d %llums/%llums send/receive inactivity",p->address().toString().c_str(),(int)p->reliable(),now - p->lastSend(),now - p->lastReceived());
  224. }
  225. return true;
  226. }
  227. return false;
  228. }
  229. void Peer::pushDirectPaths(const RuntimeEnvironment *RR,Path *path,uint64_t now,bool force)
  230. {
  231. #ifdef ZT_ENABLE_CLUSTER
  232. // Cluster mode disables normal PUSH_DIRECT_PATHS in favor of cluster-based peer redirection
  233. if (RR->cluster)
  234. return;
  235. #endif
  236. Mutex::Lock _l(_lock);
  237. if (((now - _lastDirectPathPushSent) >= ZT_DIRECT_PATH_PUSH_INTERVAL)||(force)) {
  238. _lastDirectPathPushSent = now;
  239. std::vector<InetAddress> dps(RR->node->directPaths());
  240. if (dps.empty())
  241. return;
  242. #ifdef ZT_TRACE
  243. {
  244. std::string ps;
  245. for(std::vector<InetAddress>::const_iterator p(dps.begin());p!=dps.end();++p) {
  246. if (ps.length() > 0)
  247. ps.push_back(',');
  248. ps.append(p->toString());
  249. }
  250. TRACE("pushing %u direct paths to %s: %s",(unsigned int)dps.size(),_id.address().toString().c_str(),ps.c_str());
  251. }
  252. #endif
  253. std::vector<InetAddress>::const_iterator p(dps.begin());
  254. while (p != dps.end()) {
  255. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  256. outp.addSize(2); // leave room for count
  257. unsigned int count = 0;
  258. while ((p != dps.end())&&((outp.size() + 24) < ZT_PROTO_MAX_PACKET_LENGTH)) {
  259. uint8_t addressType = 4;
  260. switch(p->ss_family) {
  261. case AF_INET:
  262. break;
  263. case AF_INET6:
  264. addressType = 6;
  265. break;
  266. default: // we currently only push IP addresses
  267. ++p;
  268. continue;
  269. }
  270. uint8_t flags = 0;
  271. /* TODO: path trust is not implemented yet
  272. switch(p->trust()) {
  273. default:
  274. break;
  275. case Path::TRUST_PRIVACY:
  276. flags |= 0x04; // no encryption
  277. break;
  278. case Path::TRUST_ULTIMATE:
  279. flags |= (0x04 | 0x08); // no encryption, no authentication (redundant but go ahead and set both)
  280. break;
  281. }
  282. */
  283. outp.append(flags);
  284. outp.append((uint16_t)0); // no extensions
  285. outp.append(addressType);
  286. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  287. outp.append(p->rawIpData(),((addressType == 4) ? 4 : 16));
  288. outp.append((uint16_t)p->port());
  289. ++count;
  290. ++p;
  291. }
  292. if (count) {
  293. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  294. outp.armor(_key,true);
  295. path->send(RR,outp.data(),outp.size(),now);
  296. }
  297. }
  298. }
  299. }
  300. bool Peer::resetWithinScope(const RuntimeEnvironment *RR,InetAddress::IpScope scope,uint64_t now)
  301. {
  302. Mutex::Lock _l(_lock);
  303. unsigned int np = _numPaths;
  304. unsigned int x = 0;
  305. unsigned int y = 0;
  306. while (x < np) {
  307. if (_paths[x].address().ipScope() == scope) {
  308. sendHELLO(RR,_paths[x].localAddress(),_paths[x].address(),now);
  309. } else {
  310. _paths[y++] = _paths[x];
  311. }
  312. ++x;
  313. }
  314. _numPaths = y;
  315. _sortPaths(now);
  316. return (y < np);
  317. }
  318. void Peer::getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const
  319. {
  320. Mutex::Lock _l(_lock);
  321. uint64_t bestV4 = 0,bestV6 = 0;
  322. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  323. if (_paths[p].active(now)) {
  324. uint64_t lr = _paths[p].lastReceived();
  325. if (lr) {
  326. if (_paths[p].address().isV4()) {
  327. if (lr >= bestV4) {
  328. bestV4 = lr;
  329. v4 = _paths[p].address();
  330. }
  331. } else if (_paths[p].address().isV6()) {
  332. if (lr >= bestV6) {
  333. bestV6 = lr;
  334. v6 = _paths[p].address();
  335. }
  336. }
  337. }
  338. }
  339. }
  340. }
  341. bool Peer::networkMembershipCertificatesAgree(uint64_t nwid,const CertificateOfMembership &com) const
  342. {
  343. Mutex::Lock _l(_lock);
  344. const _NetworkCom *ourCom = _networkComs.get(nwid);
  345. if (ourCom)
  346. return ourCom->com.agreesWith(com);
  347. return false;
  348. }
  349. bool Peer::validateAndSetNetworkMembershipCertificate(const RuntimeEnvironment *RR,uint64_t nwid,const CertificateOfMembership &com)
  350. {
  351. // Sanity checks
  352. if ((!com)||(com.issuedTo() != _id.address()))
  353. return false;
  354. // Return true if we already have this *exact* COM
  355. {
  356. Mutex::Lock _l(_lock);
  357. _NetworkCom *ourCom = _networkComs.get(nwid);
  358. if ((ourCom)&&(ourCom->com == com))
  359. return true;
  360. }
  361. // Check signature, log and return if cert is invalid
  362. if (com.signedBy() != Network::controllerFor(nwid)) {
  363. TRACE("rejected network membership certificate for %.16llx signed by %s: signer not a controller of this network",(unsigned long long)_id,com.signedBy().toString().c_str());
  364. return false; // invalid signer
  365. }
  366. if (com.signedBy() == RR->identity.address()) {
  367. // We are the controller: RR->identity.address() == controller() == cert.signedBy()
  368. // So, verify that we signed th cert ourself
  369. if (!com.verify(RR->identity)) {
  370. TRACE("rejected network membership certificate for %.16llx self signed by %s: signature check failed",(unsigned long long)_id,com.signedBy().toString().c_str());
  371. return false; // invalid signature
  372. }
  373. } else {
  374. SharedPtr<Peer> signer(RR->topology->getPeer(com.signedBy()));
  375. if (!signer) {
  376. // This would be rather odd, since this is our controller... could happen
  377. // if we get packets before we've gotten config.
  378. RR->sw->requestWhois(com.signedBy());
  379. return false; // signer unknown
  380. }
  381. if (!com.verify(signer->identity())) {
  382. TRACE("rejected network membership certificate for %.16llx signed by %s: signature check failed",(unsigned long long)_id,com.signedBy().toString().c_str());
  383. return false; // invalid signature
  384. }
  385. }
  386. // If we made it past all those checks, add or update cert in our cert info store
  387. {
  388. Mutex::Lock _l(_lock);
  389. _networkComs.set(nwid,_NetworkCom(RR->node->now(),com));
  390. }
  391. return true;
  392. }
  393. bool Peer::needsOurNetworkMembershipCertificate(uint64_t nwid,uint64_t now,bool updateLastPushedTime)
  394. {
  395. Mutex::Lock _l(_lock);
  396. uint64_t &lastPushed = _lastPushedComs[nwid];
  397. const uint64_t tmp = lastPushed;
  398. if (updateLastPushedTime)
  399. lastPushed = now;
  400. return ((now - tmp) >= (ZT_NETWORK_AUTOCONF_DELAY / 2));
  401. }
  402. void Peer::clean(const RuntimeEnvironment *RR,uint64_t now)
  403. {
  404. Mutex::Lock _l(_lock);
  405. {
  406. unsigned int np = _numPaths;
  407. unsigned int x = 0;
  408. unsigned int y = 0;
  409. while (x < np) {
  410. if (_paths[x].active(now))
  411. _paths[y++] = _paths[x];
  412. ++x;
  413. }
  414. _numPaths = y;
  415. }
  416. {
  417. uint64_t *k = (uint64_t *)0;
  418. _NetworkCom *v = (_NetworkCom *)0;
  419. Hashtable< uint64_t,_NetworkCom >::Iterator i(_networkComs);
  420. while (i.next(k,v)) {
  421. if ( (!RR->node->belongsToNetwork(*k)) && ((now - v->ts) >= ZT_PEER_NETWORK_COM_EXPIRATION) )
  422. _networkComs.erase(*k);
  423. }
  424. }
  425. {
  426. uint64_t *k = (uint64_t *)0;
  427. uint64_t *v = (uint64_t *)0;
  428. Hashtable< uint64_t,uint64_t >::Iterator i(_lastPushedComs);
  429. while (i.next(k,v)) {
  430. if ((now - *v) > (ZT_NETWORK_AUTOCONF_DELAY * 2))
  431. _lastPushedComs.erase(*k);
  432. }
  433. }
  434. }
  435. struct _SortPathsByQuality
  436. {
  437. uint64_t _now;
  438. _SortPathsByQuality(const uint64_t now) : _now(now) {}
  439. inline bool operator()(const Path &a,const Path &b) const
  440. {
  441. const uint64_t qa = (
  442. ((uint64_t)a.active(_now) << 63) |
  443. (((uint64_t)(a.preferenceRank() & 0xfff)) << 51) |
  444. ((uint64_t)a.lastReceived() & 0x7ffffffffffffULL) );
  445. const uint64_t qb = (
  446. ((uint64_t)b.active(_now) << 63) |
  447. (((uint64_t)(b.preferenceRank() & 0xfff)) << 51) |
  448. ((uint64_t)b.lastReceived() & 0x7ffffffffffffULL) );
  449. return (qb < qa); // invert sense to sort in descending order
  450. }
  451. };
  452. void Peer::_sortPaths(const uint64_t now)
  453. {
  454. // assumes _lock is locked
  455. _lastPathSort = now;
  456. std::sort(&(_paths[0]),&(_paths[_numPaths]),_SortPathsByQuality(now));
  457. }
  458. Path *Peer::_getBestPath(const uint64_t now)
  459. {
  460. // assumes _lock is locked
  461. if ((now - _lastPathSort) >= ZT_PEER_PATH_SORT_INTERVAL)
  462. _sortPaths(now);
  463. if (_paths[0].active(now)) {
  464. return &(_paths[0]);
  465. } else {
  466. _sortPaths(now);
  467. if (_paths[0].active(now))
  468. return &(_paths[0]);
  469. }
  470. return (Path *)0;
  471. }
  472. Path *Peer::_getBestPath(const uint64_t now,int inetAddressFamily)
  473. {
  474. // assumes _lock is locked
  475. if ((now - _lastPathSort) >= ZT_PEER_PATH_SORT_INTERVAL)
  476. _sortPaths(now);
  477. for(int k=0;k<2;++k) { // try once, and if it fails sort and try one more time
  478. for(unsigned int i=0;i<_numPaths;++i) {
  479. if ((_paths[i].active(now))&&((int)_paths[i].address().ss_family == inetAddressFamily))
  480. return &(_paths[i]);
  481. }
  482. _sortPaths(now);
  483. }
  484. return (Path *)0;
  485. }
  486. } // namespace ZeroTier