Cluster.cpp 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753
  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. #ifdef ZT_ENABLE_CLUSTER
  28. #include <stdint.h>
  29. #include <stdio.h>
  30. #include <stdlib.h>
  31. #include <string.h>
  32. #include <math.h>
  33. #include <algorithm>
  34. #include <utility>
  35. #include "../version.h"
  36. #include "Cluster.hpp"
  37. #include "RuntimeEnvironment.hpp"
  38. #include "MulticastGroup.hpp"
  39. #include "CertificateOfMembership.hpp"
  40. #include "Salsa20.hpp"
  41. #include "Poly1305.hpp"
  42. #include "Identity.hpp"
  43. #include "Topology.hpp"
  44. #include "Packet.hpp"
  45. #include "Switch.hpp"
  46. #include "Node.hpp"
  47. namespace ZeroTier {
  48. static inline double _dist3d(int x1,int y1,int z1,int x2,int y2,int z2)
  49. throw()
  50. {
  51. double dx = ((double)x2 - (double)x1);
  52. double dy = ((double)y2 - (double)y1);
  53. double dz = ((double)z2 - (double)z1);
  54. return sqrt((dx * dx) + (dy * dy) + (dz * dz));
  55. }
  56. Cluster::Cluster(
  57. const RuntimeEnvironment *renv,
  58. uint16_t id,
  59. const std::vector<InetAddress> &zeroTierPhysicalEndpoints,
  60. int32_t x,
  61. int32_t y,
  62. int32_t z,
  63. void (*sendFunction)(void *,unsigned int,const void *,unsigned int),
  64. void *sendFunctionArg,
  65. int (*addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *),
  66. void *addressToLocationFunctionArg) :
  67. RR(renv),
  68. _sendFunction(sendFunction),
  69. _sendFunctionArg(sendFunctionArg),
  70. _addressToLocationFunction(addressToLocationFunction),
  71. _addressToLocationFunctionArg(addressToLocationFunctionArg),
  72. _x(x),
  73. _y(y),
  74. _z(z),
  75. _id(id),
  76. _zeroTierPhysicalEndpoints(zeroTierPhysicalEndpoints),
  77. _members(new _Member[ZT_CLUSTER_MAX_MEMBERS]),
  78. _peerAffinities(65536),
  79. _lastCleanedPeerAffinities(0),
  80. _lastCheckedPeersForAnnounce(0),
  81. _lastFlushed(0)
  82. {
  83. uint16_t stmp[ZT_SHA512_DIGEST_LEN / sizeof(uint16_t)];
  84. // Generate master secret by hashing the secret from our Identity key pair
  85. RR->identity.sha512PrivateKey(_masterSecret);
  86. // Generate our inbound message key, which is the master secret XORed with our ID and hashed twice
  87. memcpy(stmp,_masterSecret,sizeof(stmp));
  88. stmp[0] ^= Utils::hton(id);
  89. SHA512::hash(stmp,stmp,sizeof(stmp));
  90. SHA512::hash(stmp,stmp,sizeof(stmp));
  91. memcpy(_key,stmp,sizeof(_key));
  92. Utils::burn(stmp,sizeof(stmp));
  93. }
  94. Cluster::~Cluster()
  95. {
  96. Utils::burn(_masterSecret,sizeof(_masterSecret));
  97. Utils::burn(_key,sizeof(_key));
  98. delete [] _members;
  99. }
  100. void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
  101. {
  102. Buffer<ZT_CLUSTER_MAX_MESSAGE_LENGTH> dmsg;
  103. {
  104. // FORMAT: <[16] iv><[8] MAC><... data>
  105. if ((len < 24)||(len > ZT_CLUSTER_MAX_MESSAGE_LENGTH))
  106. return;
  107. // 16-byte IV: first 8 bytes XORed with key, last 8 bytes used as Salsa20 64-bit IV
  108. char keytmp[32];
  109. memcpy(keytmp,_key,32);
  110. for(int i=0;i<8;++i)
  111. keytmp[i] ^= reinterpret_cast<const char *>(msg)[i];
  112. Salsa20 s20(keytmp,256,reinterpret_cast<const char *>(msg) + 8);
  113. Utils::burn(keytmp,sizeof(keytmp));
  114. // One-time-use Poly1305 key from first 32 bytes of Salsa20 keystream (as per DJB/NaCl "standard")
  115. char polykey[ZT_POLY1305_KEY_LEN];
  116. memset(polykey,0,sizeof(polykey));
  117. s20.encrypt12(polykey,polykey,sizeof(polykey));
  118. // Compute 16-byte MAC
  119. char mac[ZT_POLY1305_MAC_LEN];
  120. Poly1305::compute(mac,reinterpret_cast<const char *>(msg) + 24,len - 24,polykey);
  121. // Check first 8 bytes of MAC against 64-bit MAC in stream
  122. if (!Utils::secureEq(mac,reinterpret_cast<const char *>(msg) + 16,8))
  123. return;
  124. // Decrypt!
  125. dmsg.setSize(len - 24);
  126. s20.decrypt12(reinterpret_cast<const char *>(msg) + 24,const_cast<void *>(dmsg.data()),dmsg.size());
  127. }
  128. if (dmsg.size() < 4)
  129. return;
  130. const uint16_t fromMemberId = dmsg.at<uint16_t>(0);
  131. unsigned int ptr = 2;
  132. if (fromMemberId == _id) // sanity check: we don't talk to ourselves
  133. return;
  134. const uint16_t toMemberId = dmsg.at<uint16_t>(ptr);
  135. ptr += 2;
  136. if (toMemberId != _id) // sanity check: message not for us?
  137. return;
  138. { // make sure sender is actually considered a member
  139. Mutex::Lock _l3(_memberIds_m);
  140. if (std::find(_memberIds.begin(),_memberIds.end(),fromMemberId) == _memberIds.end())
  141. return;
  142. }
  143. {
  144. _Member &m = _members[fromMemberId];
  145. Mutex::Lock mlck(m.lock);
  146. try {
  147. while (ptr < dmsg.size()) {
  148. const unsigned int mlen = dmsg.at<uint16_t>(ptr); ptr += 2;
  149. const unsigned int nextPtr = ptr + mlen;
  150. if (nextPtr > dmsg.size())
  151. break;
  152. int mtype = -1;
  153. try {
  154. switch((StateMessageType)(mtype = (int)dmsg[ptr++])) {
  155. default:
  156. break;
  157. case STATE_MESSAGE_ALIVE: {
  158. ptr += 7; // skip version stuff, not used yet
  159. m.x = dmsg.at<int32_t>(ptr); ptr += 4;
  160. m.y = dmsg.at<int32_t>(ptr); ptr += 4;
  161. m.z = dmsg.at<int32_t>(ptr); ptr += 4;
  162. ptr += 8; // skip local clock, not used
  163. m.load = dmsg.at<uint64_t>(ptr); ptr += 8;
  164. ptr += 8; // skip flags, unused
  165. #ifdef ZT_TRACE
  166. std::string addrs;
  167. #endif
  168. unsigned int physicalAddressCount = dmsg[ptr++];
  169. m.zeroTierPhysicalEndpoints.clear();
  170. for(unsigned int i=0;i<physicalAddressCount;++i) {
  171. m.zeroTierPhysicalEndpoints.push_back(InetAddress());
  172. ptr += m.zeroTierPhysicalEndpoints.back().deserialize(dmsg,ptr);
  173. if (!(m.zeroTierPhysicalEndpoints.back())) {
  174. m.zeroTierPhysicalEndpoints.pop_back();
  175. }
  176. #ifdef ZT_TRACE
  177. else {
  178. if (addrs.length() > 0)
  179. addrs.push_back(',');
  180. addrs.append(m.zeroTierPhysicalEndpoints.back().toString());
  181. }
  182. #endif
  183. }
  184. #ifdef ZT_TRACE
  185. if ((RR->node->now() - m.lastReceivedAliveAnnouncement) >= ZT_CLUSTER_TIMEOUT) {
  186. TRACE("[%u] I'm alive! peers close to %d,%d,%d can be redirected to: %s",(unsigned int)fromMemberId,m.x,m.y,m.z,addrs.c_str());
  187. }
  188. #endif
  189. m.lastReceivedAliveAnnouncement = RR->node->now();
  190. } break;
  191. case STATE_MESSAGE_HAVE_PEER: {
  192. const Address zeroTierAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  193. InetAddress physicalAddress;
  194. ptr += physicalAddress.deserialize(dmsg,ptr);
  195. // Forget any paths that we have to this peer at its address
  196. if (physicalAddress) {
  197. SharedPtr<Peer> myPeerRecord(RR->topology->getPeerNoCache(zeroTierAddress));
  198. if (myPeerRecord)
  199. myPeerRecord->removePathByAddress(physicalAddress);
  200. }
  201. // Set peer affinity to its new home
  202. {
  203. Mutex::Lock _l2(_peerAffinities_m);
  204. _PA &pa = _peerAffinities[zeroTierAddress];
  205. pa.ts = RR->node->now();
  206. pa.mid = fromMemberId;
  207. }
  208. TRACE("[%u] has %s @ %s",(unsigned int)fromMemberId,id.address().toString().c_str(),physicalAddress.toString().c_str());
  209. } break;
  210. case STATE_MESSAGE_MULTICAST_LIKE: {
  211. const uint64_t nwid = dmsg.at<uint64_t>(ptr); ptr += 8;
  212. const Address address(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  213. const MAC mac(dmsg.field(ptr,6),6); ptr += 6;
  214. const uint32_t adi = dmsg.at<uint32_t>(ptr); ptr += 4;
  215. RR->mc->add(RR->node->now(),nwid,MulticastGroup(mac,adi),address);
  216. TRACE("[%u] %s likes %s/%.8x on %.16llx",(unsigned int)fromMemberId,address.toString().c_str(),mac.toString().c_str(),(unsigned int)adi,nwid);
  217. } break;
  218. case STATE_MESSAGE_COM: {
  219. /* not currently used so not decoded yet
  220. CertificateOfMembership com;
  221. ptr += com.deserialize(dmsg,ptr);
  222. if (com) {
  223. TRACE("[%u] COM for %s on %.16llu rev %llu",(unsigned int)fromMemberId,com.issuedTo().toString().c_str(),com.networkId(),com.revision());
  224. }
  225. */
  226. } break;
  227. case STATE_MESSAGE_PROXY_UNITE: {
  228. const Address localPeerAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  229. const Address remotePeerAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  230. const unsigned int numRemotePeerPaths = dmsg[ptr++];
  231. InetAddress remotePeerPaths[256]; // size is 8-bit, so 256 is max
  232. for(unsigned int i=0;i<numRemotePeerPaths;++i)
  233. ptr += remotePeerPaths[i].deserialize(dmsg,ptr);
  234. TRACE("[%u] requested that we unite local %s with remote %s",(unsigned int)fromMemberId,localPeerAddress.toString().c_str(),remotePeerAddress.toString().c_str());
  235. const uint64_t now = RR->node->now();
  236. SharedPtr<Peer> localPeer(RR->topology->getPeerNoCache(localPeerAddress));
  237. if ((localPeer)&&(numRemotePeerPaths > 0)) {
  238. InetAddress bestLocalV4,bestLocalV6;
  239. localPeer->getBestActiveAddresses(now,bestLocalV4,bestLocalV6);
  240. InetAddress bestRemoteV4,bestRemoteV6;
  241. for(unsigned int i=0;i<numRemotePeerPaths;++i) {
  242. if ((bestRemoteV4)&&(bestRemoteV6))
  243. break;
  244. switch(remotePeerPaths[i].ss_family) {
  245. case AF_INET:
  246. if (!bestRemoteV4)
  247. bestRemoteV4 = remotePeerPaths[i];
  248. break;
  249. case AF_INET6:
  250. if (!bestRemoteV6)
  251. bestRemoteV6 = remotePeerPaths[i];
  252. break;
  253. }
  254. }
  255. Packet rendezvousForLocal(localPeerAddress,RR->identity.address(),Packet::VERB_RENDEZVOUS);
  256. rendezvousForLocal.append((uint8_t)0);
  257. remotePeerAddress.appendTo(rendezvousForLocal);
  258. Buffer<2048> rendezvousForRemote;
  259. remotePeerAddress.appendTo(rendezvousForRemote);
  260. rendezvousForRemote.append((uint8_t)Packet::VERB_RENDEZVOUS);
  261. const unsigned int rendezvousForOtherEndPayloadSizePtr = rendezvousForRemote.size();
  262. rendezvousForRemote.addSize(2); // space for actual packet payload length
  263. rendezvousForRemote.append((uint8_t)0); // flags == 0
  264. localPeerAddress.appendTo(rendezvousForRemote);
  265. bool haveMatch = false;
  266. if ((bestLocalV6)&&(bestRemoteV6)) {
  267. haveMatch = true;
  268. rendezvousForLocal.append((uint16_t)bestRemoteV6.port());
  269. rendezvousForLocal.append((uint8_t)16);
  270. rendezvousForLocal.append(bestRemoteV6.rawIpData(),16);
  271. rendezvousForRemote.append((uint16_t)bestLocalV6.port());
  272. rendezvousForRemote.append((uint8_t)16);
  273. rendezvousForRemote.append(bestLocalV6.rawIpData(),16);
  274. rendezvousForRemote.setAt<uint16_t>(rendezvousForOtherEndPayloadSizePtr,(uint16_t)(9 + 16));
  275. } else if ((bestLocalV4)&&(bestRemoteV4)) {
  276. haveMatch = true;
  277. rendezvousForLocal.append((uint16_t)bestRemoteV4.port());
  278. rendezvousForLocal.append((uint8_t)4);
  279. rendezvousForLocal.append(bestRemoteV4.rawIpData(),4);
  280. rendezvousForRemote.append((uint16_t)bestLocalV4.port());
  281. rendezvousForRemote.append((uint8_t)4);
  282. rendezvousForRemote.append(bestLocalV4.rawIpData(),4);
  283. rendezvousForRemote.setAt<uint16_t>(rendezvousForOtherEndPayloadSizePtr,(uint16_t)(9 + 4));
  284. }
  285. if (haveMatch) {
  286. _send(fromMemberId,STATE_MESSAGE_PROXY_SEND,rendezvousForRemote.data(),rendezvousForRemote.size());
  287. _flush(fromMemberId); // we want this to go ASAP, since with port restricted cone NATs success can be timing-sensitive
  288. RR->sw->send(rendezvousForLocal,true,0);
  289. }
  290. }
  291. } break;
  292. case STATE_MESSAGE_PROXY_SEND: {
  293. const Address rcpt(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  294. const Packet::Verb verb = (Packet::Verb)dmsg[ptr++];
  295. const unsigned int len = dmsg.at<uint16_t>(ptr); ptr += 2;
  296. Packet outp(rcpt,RR->identity.address(),verb);
  297. outp.append(dmsg.field(ptr,len),len); ptr += len;
  298. RR->sw->send(outp,true,0);
  299. TRACE("[%u] proxy send %s to %s length %u",(unsigned int)fromMemberId,Packet::verbString(verb),rcpt.toString().c_str(),len);
  300. } break;
  301. }
  302. } catch ( ... ) {
  303. TRACE("invalid message of size %u type %d (inner decode), discarding",mlen,mtype);
  304. // drop invalids
  305. }
  306. ptr = nextPtr;
  307. }
  308. } catch ( ... ) {
  309. TRACE("invalid message (outer loop), discarding");
  310. // drop invalids
  311. }
  312. }
  313. }
  314. bool Cluster::sendViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite)
  315. {
  316. if (len > 16384) // sanity check
  317. return false;
  318. const uint64_t now = RR->node->now();
  319. unsigned int canHasPeer = 0;
  320. { // Anyone got this peer?
  321. Mutex::Lock _l2(_peerAffinities_m);
  322. _PA *pa = _peerAffinities.get(toPeerAddress);
  323. if ((pa)&&(pa->mid != _id)&&((now - pa->ts) < ZT_PEER_ACTIVITY_TIMEOUT))
  324. canHasPeer = pa->mid;
  325. else return false;
  326. }
  327. Buffer<1024> buf;
  328. if (unite) {
  329. InetAddress v4,v6;
  330. if (fromPeerAddress) {
  331. SharedPtr<Peer> fromPeer(RR->topology->getPeerNoCache(fromPeerAddress));
  332. if (fromPeer)
  333. fromPeer->getBestActiveAddresses(now,v4,v6);
  334. }
  335. uint8_t addrCount = 0;
  336. if (v4)
  337. ++addrCount;
  338. if (v6)
  339. ++addrCount;
  340. if (addrCount) {
  341. toPeerAddress.appendTo(buf);
  342. fromPeerAddress.appendTo(buf);
  343. buf.append(addrCount);
  344. if (v4)
  345. v4.serialize(buf);
  346. if (v6)
  347. v6.serialize(buf);
  348. }
  349. }
  350. {
  351. Mutex::Lock _l2(_members[canHasPeer].lock);
  352. if (buf.size() > 0)
  353. _send(canHasPeer,STATE_MESSAGE_PROXY_UNITE,buf.data(),buf.size());
  354. if (_members[canHasPeer].zeroTierPhysicalEndpoints.size() > 0)
  355. RR->node->putPacket(InetAddress(),_members[canHasPeer].zeroTierPhysicalEndpoints.front(),data,len);
  356. }
  357. TRACE("sendViaCluster(): relaying %u bytes from %s to %s by way of %u",len,fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str(),(unsigned int)canHasPeer);
  358. return true;
  359. }
  360. void Cluster::replicateHavePeer(const Identity &peerId,const InetAddress &physicalAddress)
  361. {
  362. const uint64_t now = RR->node->now();
  363. {
  364. Mutex::Lock _l2(_peerAffinities_m);
  365. _PA &pa = _peerAffinities[peerId.address()];
  366. if (pa.mid != _id) {
  367. pa.ts = now;
  368. pa.mid = _id;
  369. } else if ((now - pa.ts) < ZT_CLUSTER_HAVE_PEER_ANNOUNCE_PERIOD) {
  370. return;
  371. } else {
  372. pa.ts = now;
  373. }
  374. }
  375. Buffer<1024> buf;
  376. peerId.address().appendTo(buf);
  377. physicalAddress.serialize(buf);
  378. {
  379. Mutex::Lock _l(_memberIds_m);
  380. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  381. Mutex::Lock _l2(_members[*mid].lock);
  382. _send(*mid,STATE_MESSAGE_HAVE_PEER,buf.data(),buf.size());
  383. }
  384. }
  385. }
  386. void Cluster::replicateMulticastLike(uint64_t nwid,const Address &peerAddress,const MulticastGroup &group)
  387. {
  388. Buffer<1024> buf;
  389. buf.append((uint64_t)nwid);
  390. peerAddress.appendTo(buf);
  391. group.mac().appendTo(buf);
  392. buf.append((uint32_t)group.adi());
  393. TRACE("replicating %s MULTICAST_LIKE %.16llx/%s/%u to all members",peerAddress.toString().c_str(),nwid,group.mac().toString().c_str(),(unsigned int)group.adi());
  394. {
  395. Mutex::Lock _l(_memberIds_m);
  396. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  397. Mutex::Lock _l2(_members[*mid].lock);
  398. _send(*mid,STATE_MESSAGE_MULTICAST_LIKE,buf.data(),buf.size());
  399. }
  400. }
  401. }
  402. void Cluster::replicateCertificateOfNetworkMembership(const CertificateOfMembership &com)
  403. {
  404. Buffer<4096> buf;
  405. com.serialize(buf);
  406. TRACE("replicating %s COM for %.16llx to all members",com.issuedTo().toString().c_str(),com.networkId());
  407. {
  408. Mutex::Lock _l(_memberIds_m);
  409. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  410. Mutex::Lock _l2(_members[*mid].lock);
  411. _send(*mid,STATE_MESSAGE_COM,buf.data(),buf.size());
  412. }
  413. }
  414. }
  415. struct _ClusterAnnouncePeers
  416. {
  417. _ClusterAnnouncePeers(const uint64_t now_,Cluster *parent_) : now(now_),parent(parent_) {}
  418. const uint64_t now;
  419. Cluster *const parent;
  420. inline void operator()(const Topology &t,const SharedPtr<Peer> &peer) const
  421. {
  422. Path *p = peer->getBestPath(now);
  423. if (p)
  424. parent->replicateHavePeer(peer->identity(),p->address());
  425. }
  426. };
  427. void Cluster::doPeriodicTasks()
  428. {
  429. const uint64_t now = RR->node->now();
  430. // Erase old peer affinity entries just to control table size
  431. if ((now - _lastCleanedPeerAffinities) >= (ZT_PEER_ACTIVITY_TIMEOUT * 5)) {
  432. _lastCleanedPeerAffinities = now;
  433. Address *k = (Address *)0;
  434. _PA *v = (_PA *)0;
  435. Mutex::Lock _l(_peerAffinities_m);
  436. Hashtable< Address,_PA >::Iterator i(_peerAffinities);
  437. while (i.next(k,v)) {
  438. if ((now - v->ts) >= (ZT_PEER_ACTIVITY_TIMEOUT * 5))
  439. _peerAffinities.erase(*k);
  440. }
  441. }
  442. // Announce peers that we have active direct paths to -- note that we forget paths
  443. // that other cluster members claim they have, which prevents us from fighting
  444. // with other cluster members (route flapping) over specific paths.
  445. if ((now - _lastCheckedPeersForAnnounce) >= (ZT_CLUSTER_HAVE_PEER_ANNOUNCE_PERIOD / 4)) {
  446. _lastCheckedPeersForAnnounce = now;
  447. _ClusterAnnouncePeers func(now,this);
  448. RR->topology->eachPeer<_ClusterAnnouncePeers &>(func);
  449. }
  450. // Flush outgoing packet send queue every doPeriodicTasks()
  451. if ((now - _lastFlushed) >= ZT_CLUSTER_FLUSH_PERIOD) {
  452. _lastFlushed = now;
  453. Mutex::Lock _l(_memberIds_m);
  454. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  455. Mutex::Lock _l2(_members[*mid].lock);
  456. if ((now - _members[*mid].lastAnnouncedAliveTo) >= ((ZT_CLUSTER_TIMEOUT / 2) - 1000)) {
  457. Buffer<2048> alive;
  458. alive.append((uint16_t)ZEROTIER_ONE_VERSION_MAJOR);
  459. alive.append((uint16_t)ZEROTIER_ONE_VERSION_MINOR);
  460. alive.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  461. alive.append((uint8_t)ZT_PROTO_VERSION);
  462. if (_addressToLocationFunction) {
  463. alive.append((int32_t)_x);
  464. alive.append((int32_t)_y);
  465. alive.append((int32_t)_z);
  466. } else {
  467. alive.append((int32_t)0);
  468. alive.append((int32_t)0);
  469. alive.append((int32_t)0);
  470. }
  471. alive.append((uint64_t)now);
  472. alive.append((uint64_t)0); // TODO: compute and send load average
  473. alive.append((uint64_t)0); // unused/reserved flags
  474. alive.append((uint8_t)_zeroTierPhysicalEndpoints.size());
  475. for(std::vector<InetAddress>::const_iterator pe(_zeroTierPhysicalEndpoints.begin());pe!=_zeroTierPhysicalEndpoints.end();++pe)
  476. pe->serialize(alive);
  477. _send(*mid,STATE_MESSAGE_ALIVE,alive.data(),alive.size());
  478. _members[*mid].lastAnnouncedAliveTo = now;
  479. }
  480. _flush(*mid); // does nothing if nothing to flush
  481. }
  482. }
  483. }
  484. void Cluster::addMember(uint16_t memberId)
  485. {
  486. if ((memberId >= ZT_CLUSTER_MAX_MEMBERS)||(memberId == _id))
  487. return;
  488. Mutex::Lock _l2(_members[memberId].lock);
  489. {
  490. Mutex::Lock _l(_memberIds_m);
  491. if (std::find(_memberIds.begin(),_memberIds.end(),memberId) != _memberIds.end())
  492. return;
  493. _memberIds.push_back(memberId);
  494. std::sort(_memberIds.begin(),_memberIds.end());
  495. }
  496. _members[memberId].clear();
  497. // Generate this member's message key from the master and its ID
  498. uint16_t stmp[ZT_SHA512_DIGEST_LEN / sizeof(uint16_t)];
  499. memcpy(stmp,_masterSecret,sizeof(stmp));
  500. stmp[0] ^= Utils::hton(memberId);
  501. SHA512::hash(stmp,stmp,sizeof(stmp));
  502. SHA512::hash(stmp,stmp,sizeof(stmp));
  503. memcpy(_members[memberId].key,stmp,sizeof(_members[memberId].key));
  504. Utils::burn(stmp,sizeof(stmp));
  505. // Prepare q
  506. _members[memberId].q.clear();
  507. char iv[16];
  508. Utils::getSecureRandom(iv,16);
  509. _members[memberId].q.append(iv,16);
  510. _members[memberId].q.addSize(8); // room for MAC
  511. _members[memberId].q.append((uint16_t)_id);
  512. _members[memberId].q.append((uint16_t)memberId);
  513. }
  514. void Cluster::removeMember(uint16_t memberId)
  515. {
  516. Mutex::Lock _l(_memberIds_m);
  517. std::vector<uint16_t> newMemberIds;
  518. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  519. if (*mid != memberId)
  520. newMemberIds.push_back(*mid);
  521. }
  522. _memberIds = newMemberIds;
  523. }
  524. bool Cluster::findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddress,const InetAddress &peerPhysicalAddress,bool offload)
  525. {
  526. if (_addressToLocationFunction) {
  527. // Pick based on location if it can be determined
  528. int px = 0,py = 0,pz = 0;
  529. if (_addressToLocationFunction(_addressToLocationFunctionArg,reinterpret_cast<const struct sockaddr_storage *>(&peerPhysicalAddress),&px,&py,&pz) == 0) {
  530. TRACE("no geolocation data for %s (geo-lookup is lazy/async so it may work next time)",peerPhysicalAddress.toIpString().c_str());
  531. return false;
  532. }
  533. // Find member closest to this peer
  534. const uint64_t now = RR->node->now();
  535. std::vector<InetAddress> best;
  536. const double currentDistance = _dist3d(_x,_y,_z,px,py,pz);
  537. double bestDistance = (offload ? 2147483648.0 : currentDistance);
  538. unsigned int bestMember = _id;
  539. {
  540. Mutex::Lock _l(_memberIds_m);
  541. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  542. _Member &m = _members[*mid];
  543. Mutex::Lock _ml(m.lock);
  544. // Consider member if it's alive and has sent us a location and one or more physical endpoints to send peers to
  545. if ( ((now - m.lastReceivedAliveAnnouncement) < ZT_CLUSTER_TIMEOUT) && ((m.x != 0)||(m.y != 0)||(m.z != 0)) && (m.zeroTierPhysicalEndpoints.size() > 0) ) {
  546. const double mdist = _dist3d(m.x,m.y,m.z,px,py,pz);
  547. if (mdist < bestDistance) {
  548. bestDistance = mdist;
  549. bestMember = *mid;
  550. best = m.zeroTierPhysicalEndpoints;
  551. }
  552. }
  553. }
  554. }
  555. // Redirect to a closer member if it has a ZeroTier endpoint address in the same ss_family
  556. for(std::vector<InetAddress>::const_iterator a(best.begin());a!=best.end();++a) {
  557. if (a->ss_family == peerPhysicalAddress.ss_family) {
  558. TRACE("%s at [%d,%d,%d] is %f from us but %f from %u, can redirect to %s",peerAddress.toString().c_str(),px,py,pz,currentDistance,bestDistance,bestMember,a->toString().c_str());
  559. redirectTo = *a;
  560. return true;
  561. }
  562. }
  563. TRACE("%s at [%d,%d,%d] is %f from us, no better endpoints found",peerAddress.toString().c_str(),px,py,pz,currentDistance);
  564. return false;
  565. } else {
  566. // TODO: pick based on load if no location info?
  567. return false;
  568. }
  569. }
  570. void Cluster::status(ZT_ClusterStatus &status) const
  571. {
  572. const uint64_t now = RR->node->now();
  573. memset(&status,0,sizeof(ZT_ClusterStatus));
  574. ZT_ClusterMemberStatus *ms[ZT_CLUSTER_MAX_MEMBERS];
  575. memset(ms,0,sizeof(ms));
  576. status.myId = _id;
  577. ms[_id] = &(status.members[status.clusterSize++]);
  578. ms[_id]->id = _id;
  579. ms[_id]->alive = 1;
  580. ms[_id]->x = _x;
  581. ms[_id]->y = _y;
  582. ms[_id]->z = _z;
  583. ms[_id]->peers = RR->topology->countActive();
  584. for(std::vector<InetAddress>::const_iterator ep(_zeroTierPhysicalEndpoints.begin());ep!=_zeroTierPhysicalEndpoints.end();++ep) {
  585. if (ms[_id]->numZeroTierPhysicalEndpoints >= ZT_CLUSTER_MAX_ZT_PHYSICAL_ADDRESSES) // sanity check
  586. break;
  587. memcpy(&(ms[_id]->zeroTierPhysicalEndpoints[ms[_id]->numZeroTierPhysicalEndpoints++]),&(*ep),sizeof(struct sockaddr_storage));
  588. }
  589. {
  590. Mutex::Lock _l1(_memberIds_m);
  591. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  592. if (status.clusterSize >= ZT_CLUSTER_MAX_MEMBERS) // sanity check
  593. break;
  594. ZT_ClusterMemberStatus *s = ms[*mid] = &(status.members[status.clusterSize++]);
  595. _Member &m = _members[*mid];
  596. Mutex::Lock ml(m.lock);
  597. s->id = *mid;
  598. s->msSinceLastHeartbeat = (unsigned int)std::min((uint64_t)(~((unsigned int)0)),(now - m.lastReceivedAliveAnnouncement));
  599. s->alive = (s->msSinceLastHeartbeat < ZT_CLUSTER_TIMEOUT) ? 1 : 0;
  600. s->x = m.x;
  601. s->y = m.y;
  602. s->z = m.z;
  603. s->load = m.load;
  604. for(std::vector<InetAddress>::const_iterator ep(m.zeroTierPhysicalEndpoints.begin());ep!=m.zeroTierPhysicalEndpoints.end();++ep) {
  605. if (s->numZeroTierPhysicalEndpoints >= ZT_CLUSTER_MAX_ZT_PHYSICAL_ADDRESSES) // sanity check
  606. break;
  607. memcpy(&(s->zeroTierPhysicalEndpoints[s->numZeroTierPhysicalEndpoints++]),&(*ep),sizeof(struct sockaddr_storage));
  608. }
  609. }
  610. }
  611. {
  612. Mutex::Lock _l2(_peerAffinities_m);
  613. Address *k = (Address *)0;
  614. _PA *v = (_PA *)0;
  615. Hashtable< Address,_PA >::Iterator i(const_cast<Cluster *>(this)->_peerAffinities);
  616. while (i.next(k,v)) {
  617. if ( (ms[v->mid]) && (v->mid != _id) && ((now - v->ts) < ZT_PEER_ACTIVITY_TIMEOUT) )
  618. ++ms[v->mid]->peers;
  619. }
  620. }
  621. }
  622. void Cluster::_send(uint16_t memberId,StateMessageType type,const void *msg,unsigned int len)
  623. {
  624. if ((len + 3) > (ZT_CLUSTER_MAX_MESSAGE_LENGTH - (24 + 2 + 2))) // sanity check
  625. return;
  626. _Member &m = _members[memberId];
  627. // assumes m.lock is locked!
  628. if ((m.q.size() + len + 3) > ZT_CLUSTER_MAX_MESSAGE_LENGTH)
  629. _flush(memberId);
  630. m.q.append((uint16_t)(len + 1));
  631. m.q.append((uint8_t)type);
  632. m.q.append(msg,len);
  633. }
  634. void Cluster::_flush(uint16_t memberId)
  635. {
  636. _Member &m = _members[memberId];
  637. // assumes m.lock is locked!
  638. if (m.q.size() > (24 + 2 + 2)) { // 16-byte IV + 8-byte MAC + 2 byte from-member-ID + 2 byte to-member-ID
  639. // Create key from member's key and IV
  640. char keytmp[32];
  641. memcpy(keytmp,m.key,32);
  642. for(int i=0;i<8;++i)
  643. keytmp[i] ^= m.q[i];
  644. Salsa20 s20(keytmp,256,m.q.field(8,8));
  645. Utils::burn(keytmp,sizeof(keytmp));
  646. // One-time-use Poly1305 key from first 32 bytes of Salsa20 keystream (as per DJB/NaCl "standard")
  647. char polykey[ZT_POLY1305_KEY_LEN];
  648. memset(polykey,0,sizeof(polykey));
  649. s20.encrypt12(polykey,polykey,sizeof(polykey));
  650. // Encrypt m.q in place
  651. s20.encrypt12(reinterpret_cast<const char *>(m.q.data()) + 24,const_cast<char *>(reinterpret_cast<const char *>(m.q.data())) + 24,m.q.size() - 24);
  652. // Add MAC for authentication (encrypt-then-MAC)
  653. char mac[ZT_POLY1305_MAC_LEN];
  654. Poly1305::compute(mac,reinterpret_cast<const char *>(m.q.data()) + 24,m.q.size() - 24,polykey);
  655. memcpy(m.q.field(16,8),mac,8);
  656. // Send!
  657. _sendFunction(_sendFunctionArg,memberId,m.q.data(),m.q.size());
  658. // Prepare for more
  659. m.q.clear();
  660. char iv[16];
  661. Utils::getSecureRandom(iv,16);
  662. m.q.append(iv,16);
  663. m.q.addSize(8); // room for MAC
  664. m.q.append((uint16_t)_id); // from member ID
  665. m.q.append((uint16_t)memberId); // to member ID
  666. }
  667. }
  668. } // namespace ZeroTier
  669. #endif // ZT_ENABLE_CLUSTER