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. if (physicalAddress) {
  196. SharedPtr<Peer> myPeerRecord(RR->topology->getPeerNoCache(zeroTierAddress));
  197. if (myPeerRecord)
  198. myPeerRecord->removePathByAddress(physicalAddress);
  199. }
  200. {
  201. Mutex::Lock _l2(_peerAffinities_m);
  202. _PA &pa = _peerAffinities[zeroTierAddress];
  203. pa.ts = RR->node->now();
  204. pa.mid = fromMemberId;
  205. }
  206. TRACE("[%u] has %s @ %s",(unsigned int)fromMemberId,id.address().toString().c_str(),physicalAddress.toString().c_str());
  207. } break;
  208. case STATE_MESSAGE_MULTICAST_LIKE: {
  209. const uint64_t nwid = dmsg.at<uint64_t>(ptr); ptr += 8;
  210. const Address address(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  211. const MAC mac(dmsg.field(ptr,6),6); ptr += 6;
  212. const uint32_t adi = dmsg.at<uint32_t>(ptr); ptr += 4;
  213. RR->mc->add(RR->node->now(),nwid,MulticastGroup(mac,adi),address);
  214. TRACE("[%u] %s likes %s/%.8x on %.16llx",(unsigned int)fromMemberId,address.toString().c_str(),mac.toString().c_str(),(unsigned int)adi,nwid);
  215. } break;
  216. case STATE_MESSAGE_COM: {
  217. /* not currently used so not decoded yet
  218. CertificateOfMembership com;
  219. ptr += com.deserialize(dmsg,ptr);
  220. if (com) {
  221. TRACE("[%u] COM for %s on %.16llu rev %llu",(unsigned int)fromMemberId,com.issuedTo().toString().c_str(),com.networkId(),com.revision());
  222. }
  223. */
  224. } break;
  225. case STATE_MESSAGE_PROXY_UNITE: {
  226. const Address localPeerAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  227. const Address remotePeerAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  228. const unsigned int numRemotePeerPaths = dmsg[ptr++];
  229. InetAddress remotePeerPaths[256]; // size is 8-bit, so 256 is max
  230. for(unsigned int i=0;i<numRemotePeerPaths;++i)
  231. ptr += remotePeerPaths[i].deserialize(dmsg,ptr);
  232. TRACE("[%u] requested that we unite local %s with remote %s",(unsigned int)fromMemberId,localPeerAddress.toString().c_str(),remotePeerAddress.toString().c_str());
  233. const uint64_t now = RR->node->now();
  234. SharedPtr<Peer> localPeer(RR->topology->getPeerNoCache(localPeerAddress));
  235. if ((localPeer)&&(numRemotePeerPaths > 0)) {
  236. InetAddress bestLocalV4,bestLocalV6;
  237. localPeer->getBestActiveAddresses(now,bestLocalV4,bestLocalV6);
  238. InetAddress bestRemoteV4,bestRemoteV6;
  239. for(unsigned int i=0;i<numRemotePeerPaths;++i) {
  240. if ((bestRemoteV4)&&(bestRemoteV6))
  241. break;
  242. switch(remotePeerPaths[i].ss_family) {
  243. case AF_INET:
  244. if (!bestRemoteV4)
  245. bestRemoteV4 = remotePeerPaths[i];
  246. break;
  247. case AF_INET6:
  248. if (!bestRemoteV6)
  249. bestRemoteV6 = remotePeerPaths[i];
  250. break;
  251. }
  252. }
  253. Packet rendezvousForLocal(localPeerAddress,RR->identity.address(),Packet::VERB_RENDEZVOUS);
  254. rendezvousForLocal.append((uint8_t)0);
  255. remotePeerAddress.appendTo(rendezvousForLocal);
  256. Buffer<2048> rendezvousForRemote;
  257. remotePeerAddress.appendTo(rendezvousForRemote);
  258. rendezvousForRemote.append((uint8_t)Packet::VERB_RENDEZVOUS);
  259. const unsigned int rendezvousForOtherEndPayloadSizePtr = rendezvousForRemote.size();
  260. rendezvousForRemote.addSize(2); // space for actual packet payload length
  261. rendezvousForRemote.append((uint8_t)0); // flags == 0
  262. localPeerAddress.appendTo(rendezvousForRemote);
  263. bool haveMatch = false;
  264. if ((bestLocalV6)&&(bestRemoteV6)) {
  265. haveMatch = true;
  266. rendezvousForLocal.append((uint16_t)bestRemoteV6.port());
  267. rendezvousForLocal.append((uint8_t)16);
  268. rendezvousForLocal.append(bestRemoteV6.rawIpData(),16);
  269. rendezvousForRemote.append((uint16_t)bestLocalV6.port());
  270. rendezvousForRemote.append((uint8_t)16);
  271. rendezvousForRemote.append(bestLocalV6.rawIpData(),16);
  272. rendezvousForRemote.setAt<uint16_t>(rendezvousForOtherEndPayloadSizePtr,(uint16_t)(9 + 16));
  273. } else if ((bestLocalV4)&&(bestRemoteV4)) {
  274. haveMatch = true;
  275. rendezvousForLocal.append((uint16_t)bestRemoteV4.port());
  276. rendezvousForLocal.append((uint8_t)4);
  277. rendezvousForLocal.append(bestRemoteV4.rawIpData(),4);
  278. rendezvousForRemote.append((uint16_t)bestLocalV4.port());
  279. rendezvousForRemote.append((uint8_t)4);
  280. rendezvousForRemote.append(bestLocalV4.rawIpData(),4);
  281. rendezvousForRemote.setAt<uint16_t>(rendezvousForOtherEndPayloadSizePtr,(uint16_t)(9 + 4));
  282. }
  283. if (haveMatch) {
  284. _send(fromMemberId,STATE_MESSAGE_PROXY_SEND,rendezvousForRemote.data(),rendezvousForRemote.size());
  285. _flush(fromMemberId); // we want this to go ASAP, since with port restricted cone NATs success can be timing-sensitive
  286. RR->sw->send(rendezvousForLocal,true,0);
  287. }
  288. }
  289. } break;
  290. case STATE_MESSAGE_PROXY_SEND: {
  291. const Address rcpt(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
  292. const Packet::Verb verb = (Packet::Verb)dmsg[ptr++];
  293. const unsigned int len = dmsg.at<uint16_t>(ptr); ptr += 2;
  294. Packet outp(rcpt,RR->identity.address(),verb);
  295. outp.append(dmsg.field(ptr,len),len); ptr += len;
  296. RR->sw->send(outp,true,0);
  297. TRACE("[%u] proxy send %s to %s length %u",(unsigned int)fromMemberId,Packet::verbString(verb),rcpt.toString().c_str(),len);
  298. } break;
  299. }
  300. } catch ( ... ) {
  301. TRACE("invalid message of size %u type %d (inner decode), discarding",mlen,mtype);
  302. // drop invalids
  303. }
  304. ptr = nextPtr;
  305. }
  306. } catch ( ... ) {
  307. TRACE("invalid message (outer loop), discarding");
  308. // drop invalids
  309. }
  310. }
  311. }
  312. bool Cluster::sendViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite)
  313. {
  314. if (len > 16384) // sanity check
  315. return false;
  316. const uint64_t now = RR->node->now();
  317. unsigned int canHasPeer = 0;
  318. { // Anyone got this peer?
  319. Mutex::Lock _l2(_peerAffinities_m);
  320. _PA *pa = _peerAffinities.get(toPeerAddress);
  321. if ((pa)&&(pa->mid != _id)&&((now - pa->ts) < ZT_PEER_ACTIVITY_TIMEOUT))
  322. canHasPeer = pa->mid;
  323. else return false;
  324. }
  325. Buffer<1024> buf;
  326. if (unite) {
  327. InetAddress v4,v6;
  328. if (fromPeerAddress) {
  329. SharedPtr<Peer> fromPeer(RR->topology->getPeerNoCache(fromPeerAddress));
  330. if (fromPeer)
  331. fromPeer->getBestActiveAddresses(now,v4,v6);
  332. }
  333. uint8_t addrCount = 0;
  334. if (v4)
  335. ++addrCount;
  336. if (v6)
  337. ++addrCount;
  338. if (addrCount) {
  339. toPeerAddress.appendTo(buf);
  340. fromPeerAddress.appendTo(buf);
  341. buf.append(addrCount);
  342. if (v4)
  343. v4.serialize(buf);
  344. if (v6)
  345. v6.serialize(buf);
  346. }
  347. }
  348. {
  349. Mutex::Lock _l2(_members[canHasPeer].lock);
  350. if (buf.size() > 0)
  351. _send(canHasPeer,STATE_MESSAGE_PROXY_UNITE,buf.data(),buf.size());
  352. if (_members[canHasPeer].zeroTierPhysicalEndpoints.size() > 0)
  353. RR->node->putPacket(InetAddress(),_members[canHasPeer].zeroTierPhysicalEndpoints.front(),data,len);
  354. }
  355. 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);
  356. return true;
  357. }
  358. void Cluster::replicateHavePeer(const Identity &peerId,const InetAddress &physicalAddress)
  359. {
  360. const uint64_t now = RR->node->now();
  361. {
  362. Mutex::Lock _l2(_peerAffinities_m);
  363. _PA &pa = _peerAffinities[peerId.address()];
  364. if (pa.mid != _id) {
  365. pa.ts = now;
  366. pa.mid = _id;
  367. // fall through to send code below
  368. } else if ((now - pa.ts) < ZT_CLUSTER_HAVE_PEER_ANNOUNCE_PERIOD) {
  369. return;
  370. } else {
  371. pa.ts = now;
  372. // fall through to send code below
  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. /* not used yet, so don't do this yet
  405. Buffer<4096> buf;
  406. com.serialize(buf);
  407. TRACE("replicating %s COM for %.16llx to all members",com.issuedTo().toString().c_str(),com.networkId());
  408. {
  409. Mutex::Lock _l(_memberIds_m);
  410. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  411. Mutex::Lock _l2(_members[*mid].lock);
  412. _send(*mid,STATE_MESSAGE_COM,buf.data(),buf.size());
  413. }
  414. }
  415. */
  416. }
  417. struct _ClusterAnnouncePeers
  418. {
  419. _ClusterAnnouncePeers(const uint64_t now_,Cluster *parent_) : now(now_),parent(parent_) {}
  420. const uint64_t now;
  421. Cluster *const parent;
  422. inline void operator()(const Topology &t,const SharedPtr<Peer> &peer) const
  423. {
  424. Path *p = peer->getBestPath(now);
  425. if (p)
  426. parent->replicateHavePeer(peer->identity(),p->address());
  427. }
  428. };
  429. void Cluster::doPeriodicTasks()
  430. {
  431. const uint64_t now = RR->node->now();
  432. // Erase old peer affinity entries just to control table size
  433. if ((now - _lastCleanedPeerAffinities) >= (ZT_PEER_ACTIVITY_TIMEOUT * 5)) {
  434. _lastCleanedPeerAffinities = now;
  435. Address *k = (Address *)0;
  436. _PA *v = (_PA *)0;
  437. Mutex::Lock _l(_peerAffinities_m);
  438. Hashtable< Address,_PA >::Iterator i(_peerAffinities);
  439. while (i.next(k,v)) {
  440. if ((now - v->ts) >= (ZT_PEER_ACTIVITY_TIMEOUT * 5))
  441. _peerAffinities.erase(*k);
  442. }
  443. }
  444. // Announce peers that we have active direct paths to -- note that we forget paths
  445. // that other cluster members claim they have, which prevents us from fighting
  446. // with other cluster members (route flapping) over specific paths.
  447. if ((now - _lastCheckedPeersForAnnounce) >= (ZT_CLUSTER_HAVE_PEER_ANNOUNCE_PERIOD / 4)) {
  448. _lastCheckedPeersForAnnounce = now;
  449. _ClusterAnnouncePeers func(now,this);
  450. RR->topology->eachPeer<_ClusterAnnouncePeers &>(func);
  451. }
  452. // Flush outgoing packet send queue every doPeriodicTasks()
  453. if ((now - _lastFlushed) >= ZT_CLUSTER_FLUSH_PERIOD) {
  454. _lastFlushed = now;
  455. Mutex::Lock _l(_memberIds_m);
  456. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  457. Mutex::Lock _l2(_members[*mid].lock);
  458. if ((now - _members[*mid].lastAnnouncedAliveTo) >= ((ZT_CLUSTER_TIMEOUT / 2) - 1000)) {
  459. Buffer<2048> alive;
  460. alive.append((uint16_t)ZEROTIER_ONE_VERSION_MAJOR);
  461. alive.append((uint16_t)ZEROTIER_ONE_VERSION_MINOR);
  462. alive.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  463. alive.append((uint8_t)ZT_PROTO_VERSION);
  464. if (_addressToLocationFunction) {
  465. alive.append((int32_t)_x);
  466. alive.append((int32_t)_y);
  467. alive.append((int32_t)_z);
  468. } else {
  469. alive.append((int32_t)0);
  470. alive.append((int32_t)0);
  471. alive.append((int32_t)0);
  472. }
  473. alive.append((uint64_t)now);
  474. alive.append((uint64_t)0); // TODO: compute and send load average
  475. alive.append((uint64_t)0); // unused/reserved flags
  476. alive.append((uint8_t)_zeroTierPhysicalEndpoints.size());
  477. for(std::vector<InetAddress>::const_iterator pe(_zeroTierPhysicalEndpoints.begin());pe!=_zeroTierPhysicalEndpoints.end();++pe)
  478. pe->serialize(alive);
  479. _send(*mid,STATE_MESSAGE_ALIVE,alive.data(),alive.size());
  480. _members[*mid].lastAnnouncedAliveTo = now;
  481. }
  482. _flush(*mid); // does nothing if nothing to flush
  483. }
  484. }
  485. }
  486. void Cluster::addMember(uint16_t memberId)
  487. {
  488. if ((memberId >= ZT_CLUSTER_MAX_MEMBERS)||(memberId == _id))
  489. return;
  490. Mutex::Lock _l2(_members[memberId].lock);
  491. {
  492. Mutex::Lock _l(_memberIds_m);
  493. if (std::find(_memberIds.begin(),_memberIds.end(),memberId) != _memberIds.end())
  494. return;
  495. _memberIds.push_back(memberId);
  496. std::sort(_memberIds.begin(),_memberIds.end());
  497. }
  498. _members[memberId].clear();
  499. // Generate this member's message key from the master and its ID
  500. uint16_t stmp[ZT_SHA512_DIGEST_LEN / sizeof(uint16_t)];
  501. memcpy(stmp,_masterSecret,sizeof(stmp));
  502. stmp[0] ^= Utils::hton(memberId);
  503. SHA512::hash(stmp,stmp,sizeof(stmp));
  504. SHA512::hash(stmp,stmp,sizeof(stmp));
  505. memcpy(_members[memberId].key,stmp,sizeof(_members[memberId].key));
  506. Utils::burn(stmp,sizeof(stmp));
  507. // Prepare q
  508. _members[memberId].q.clear();
  509. char iv[16];
  510. Utils::getSecureRandom(iv,16);
  511. _members[memberId].q.append(iv,16);
  512. _members[memberId].q.addSize(8); // room for MAC
  513. _members[memberId].q.append((uint16_t)_id);
  514. _members[memberId].q.append((uint16_t)memberId);
  515. }
  516. void Cluster::removeMember(uint16_t memberId)
  517. {
  518. Mutex::Lock _l(_memberIds_m);
  519. std::vector<uint16_t> newMemberIds;
  520. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  521. if (*mid != memberId)
  522. newMemberIds.push_back(*mid);
  523. }
  524. _memberIds = newMemberIds;
  525. }
  526. bool Cluster::findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddress,const InetAddress &peerPhysicalAddress,bool offload)
  527. {
  528. if (_addressToLocationFunction) {
  529. // Pick based on location if it can be determined
  530. int px = 0,py = 0,pz = 0;
  531. if (_addressToLocationFunction(_addressToLocationFunctionArg,reinterpret_cast<const struct sockaddr_storage *>(&peerPhysicalAddress),&px,&py,&pz) == 0) {
  532. TRACE("no geolocation data for %s (geo-lookup is lazy/async so it may work next time)",peerPhysicalAddress.toIpString().c_str());
  533. return false;
  534. }
  535. // Find member closest to this peer
  536. const uint64_t now = RR->node->now();
  537. std::vector<InetAddress> best;
  538. const double currentDistance = _dist3d(_x,_y,_z,px,py,pz);
  539. double bestDistance = (offload ? 2147483648.0 : currentDistance);
  540. unsigned int bestMember = _id;
  541. {
  542. Mutex::Lock _l(_memberIds_m);
  543. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  544. _Member &m = _members[*mid];
  545. Mutex::Lock _ml(m.lock);
  546. // Consider member if it's alive and has sent us a location and one or more physical endpoints to send peers to
  547. if ( ((now - m.lastReceivedAliveAnnouncement) < ZT_CLUSTER_TIMEOUT) && ((m.x != 0)||(m.y != 0)||(m.z != 0)) && (m.zeroTierPhysicalEndpoints.size() > 0) ) {
  548. const double mdist = _dist3d(m.x,m.y,m.z,px,py,pz);
  549. if (mdist < bestDistance) {
  550. bestDistance = mdist;
  551. bestMember = *mid;
  552. best = m.zeroTierPhysicalEndpoints;
  553. }
  554. }
  555. }
  556. }
  557. // Redirect to a closer member if it has a ZeroTier endpoint address in the same ss_family
  558. for(std::vector<InetAddress>::const_iterator a(best.begin());a!=best.end();++a) {
  559. if (a->ss_family == peerPhysicalAddress.ss_family) {
  560. 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());
  561. redirectTo = *a;
  562. return true;
  563. }
  564. }
  565. TRACE("%s at [%d,%d,%d] is %f from us, no better endpoints found",peerAddress.toString().c_str(),px,py,pz,currentDistance);
  566. return false;
  567. } else {
  568. // TODO: pick based on load if no location info?
  569. return false;
  570. }
  571. }
  572. void Cluster::status(ZT_ClusterStatus &status) const
  573. {
  574. const uint64_t now = RR->node->now();
  575. memset(&status,0,sizeof(ZT_ClusterStatus));
  576. ZT_ClusterMemberStatus *ms[ZT_CLUSTER_MAX_MEMBERS];
  577. memset(ms,0,sizeof(ms));
  578. status.myId = _id;
  579. ms[_id] = &(status.members[status.clusterSize++]);
  580. ms[_id]->id = _id;
  581. ms[_id]->alive = 1;
  582. ms[_id]->x = _x;
  583. ms[_id]->y = _y;
  584. ms[_id]->z = _z;
  585. ms[_id]->peers = RR->topology->countActive();
  586. for(std::vector<InetAddress>::const_iterator ep(_zeroTierPhysicalEndpoints.begin());ep!=_zeroTierPhysicalEndpoints.end();++ep) {
  587. if (ms[_id]->numZeroTierPhysicalEndpoints >= ZT_CLUSTER_MAX_ZT_PHYSICAL_ADDRESSES) // sanity check
  588. break;
  589. memcpy(&(ms[_id]->zeroTierPhysicalEndpoints[ms[_id]->numZeroTierPhysicalEndpoints++]),&(*ep),sizeof(struct sockaddr_storage));
  590. }
  591. {
  592. Mutex::Lock _l1(_memberIds_m);
  593. for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
  594. if (status.clusterSize >= ZT_CLUSTER_MAX_MEMBERS) // sanity check
  595. break;
  596. ZT_ClusterMemberStatus *s = ms[*mid] = &(status.members[status.clusterSize++]);
  597. _Member &m = _members[*mid];
  598. Mutex::Lock ml(m.lock);
  599. s->id = *mid;
  600. s->msSinceLastHeartbeat = (unsigned int)std::min((uint64_t)(~((unsigned int)0)),(now - m.lastReceivedAliveAnnouncement));
  601. s->alive = (s->msSinceLastHeartbeat < ZT_CLUSTER_TIMEOUT) ? 1 : 0;
  602. s->x = m.x;
  603. s->y = m.y;
  604. s->z = m.z;
  605. s->load = m.load;
  606. for(std::vector<InetAddress>::const_iterator ep(m.zeroTierPhysicalEndpoints.begin());ep!=m.zeroTierPhysicalEndpoints.end();++ep) {
  607. if (s->numZeroTierPhysicalEndpoints >= ZT_CLUSTER_MAX_ZT_PHYSICAL_ADDRESSES) // sanity check
  608. break;
  609. memcpy(&(s->zeroTierPhysicalEndpoints[s->numZeroTierPhysicalEndpoints++]),&(*ep),sizeof(struct sockaddr_storage));
  610. }
  611. }
  612. }
  613. {
  614. Mutex::Lock _l2(_peerAffinities_m);
  615. Address *k = (Address *)0;
  616. _PA *v = (_PA *)0;
  617. Hashtable< Address,_PA >::Iterator i(const_cast<Cluster *>(this)->_peerAffinities);
  618. while (i.next(k,v)) {
  619. if ( (ms[v->mid]) && (v->mid != _id) && ((now - v->ts) < ZT_PEER_ACTIVITY_TIMEOUT) )
  620. ++ms[v->mid]->peers;
  621. }
  622. }
  623. }
  624. void Cluster::_send(uint16_t memberId,StateMessageType type,const void *msg,unsigned int len)
  625. {
  626. if ((len + 3) > (ZT_CLUSTER_MAX_MESSAGE_LENGTH - (24 + 2 + 2))) // sanity check
  627. return;
  628. _Member &m = _members[memberId];
  629. // assumes m.lock is locked!
  630. if ((m.q.size() + len + 3) > ZT_CLUSTER_MAX_MESSAGE_LENGTH)
  631. _flush(memberId);
  632. m.q.append((uint16_t)(len + 1));
  633. m.q.append((uint8_t)type);
  634. m.q.append(msg,len);
  635. }
  636. void Cluster::_flush(uint16_t memberId)
  637. {
  638. _Member &m = _members[memberId];
  639. // assumes m.lock is locked!
  640. if (m.q.size() > (24 + 2 + 2)) { // 16-byte IV + 8-byte MAC + 2 byte from-member-ID + 2 byte to-member-ID
  641. // Create key from member's key and IV
  642. char keytmp[32];
  643. memcpy(keytmp,m.key,32);
  644. for(int i=0;i<8;++i)
  645. keytmp[i] ^= m.q[i];
  646. Salsa20 s20(keytmp,256,m.q.field(8,8));
  647. Utils::burn(keytmp,sizeof(keytmp));
  648. // One-time-use Poly1305 key from first 32 bytes of Salsa20 keystream (as per DJB/NaCl "standard")
  649. char polykey[ZT_POLY1305_KEY_LEN];
  650. memset(polykey,0,sizeof(polykey));
  651. s20.encrypt12(polykey,polykey,sizeof(polykey));
  652. // Encrypt m.q in place
  653. 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);
  654. // Add MAC for authentication (encrypt-then-MAC)
  655. char mac[ZT_POLY1305_MAC_LEN];
  656. Poly1305::compute(mac,reinterpret_cast<const char *>(m.q.data()) + 24,m.q.size() - 24,polykey);
  657. memcpy(m.q.field(16,8),mac,8);
  658. // Send!
  659. _sendFunction(_sendFunctionArg,memberId,m.q.data(),m.q.size());
  660. // Prepare for more
  661. m.q.clear();
  662. char iv[16];
  663. Utils::getSecureRandom(iv,16);
  664. m.q.append(iv,16);
  665. m.q.addSize(8); // room for MAC
  666. m.q.append((uint16_t)_id); // from member ID
  667. m.q.append((uint16_t)memberId); // to member ID
  668. }
  669. }
  670. } // namespace ZeroTier
  671. #endif // ZT_ENABLE_CLUSTER