Switch.cpp 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2011-2014 ZeroTier Networks LLC
  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 <stdio.h>
  28. #include <stdlib.h>
  29. #include <algorithm>
  30. #include <utility>
  31. #include <stdexcept>
  32. #include "Constants.hpp"
  33. #ifdef __WINDOWS__
  34. #include <WinSock2.h>
  35. #include <Windows.h>
  36. #endif
  37. #include "Switch.hpp"
  38. #include "Node.hpp"
  39. #include "EthernetTap.hpp"
  40. #include "InetAddress.hpp"
  41. #include "Topology.hpp"
  42. #include "RuntimeEnvironment.hpp"
  43. #include "Peer.hpp"
  44. #include "NodeConfig.hpp"
  45. #include "CMWC4096.hpp"
  46. #include "AntiRecursion.hpp"
  47. #include "../version.h"
  48. namespace ZeroTier {
  49. Switch::Switch(const RuntimeEnvironment *renv) :
  50. _r(renv),
  51. _lastBeacon(0),
  52. _multicastIdCounter((unsigned int)renv->prng->next32()) // start a random spot to minimize possible collisions on startup
  53. {
  54. }
  55. Switch::~Switch()
  56. {
  57. }
  58. void Switch::onRemotePacket(const SharedPtr<Socket> &fromSock,const InetAddress &fromAddr,Buffer<ZT_SOCKET_MAX_MESSAGE_LEN> &data)
  59. {
  60. try {
  61. if (data.size() == ZT_PROTO_BEACON_LENGTH) {
  62. _handleBeacon(fromSock,fromAddr,data);
  63. } else if (data.size() > ZT_PROTO_MIN_FRAGMENT_LENGTH) {
  64. if (data[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] == ZT_PACKET_FRAGMENT_INDICATOR)
  65. _handleRemotePacketFragment(fromSock,fromAddr,data);
  66. else if (data.size() >= ZT_PROTO_MIN_PACKET_LENGTH)
  67. _handleRemotePacketHead(fromSock,fromAddr,data);
  68. }
  69. } catch (std::exception &ex) {
  70. TRACE("dropped packet from %s: unexpected exception: %s",fromAddr.toString().c_str(),ex.what());
  71. } catch ( ... ) {
  72. TRACE("dropped packet from %s: unexpected exception: (unknown)",fromAddr.toString().c_str());
  73. }
  74. }
  75. void Switch::onLocalEthernet(const SharedPtr<Network> &network,const MAC &from,const MAC &to,unsigned int etherType,const Buffer<4096> &data)
  76. {
  77. SharedPtr<NetworkConfig> nconf(network->config2());
  78. if (!nconf)
  79. return;
  80. // Sanity check -- bridge loop? OS problem?
  81. if (to == network->mac())
  82. return;
  83. // Check anti-recursion module to ensure that this is not ZeroTier talking over its own links
  84. if (!_r->antiRec->checkEthernetFrame(data.data(),data.size())) {
  85. TRACE("%s: rejected recursively addressed ZeroTier packet by tail match (type %s, length: %u)",network->tapDeviceName().c_str(),etherTypeName(etherType),data.size());
  86. return;
  87. }
  88. // Check to make sure this protocol is allowed on this network
  89. if (!nconf->permitsEtherType(etherType)) {
  90. TRACE("%s: ignored tap: %s -> %s: ethertype %s not allowed on network %.16llx",network->tapDeviceName().c_str(),from.toString().c_str(),to.toString().c_str(),etherTypeName(etherType),(unsigned long long)network->id());
  91. return;
  92. }
  93. // Check if this packet is from someone other than the tap -- i.e. bridged in
  94. bool fromBridged = false;
  95. if (from != network->mac()) {
  96. if (!network->permitsBridging(_r->identity.address())) {
  97. LOG("%s: %s -> %s %s not forwarded, bridging disabled on %.16llx or this peer not a bridge",network->tapDeviceName().c_str(),from.toString().c_str(),to.toString().c_str(),etherTypeName(etherType),network->id());
  98. return;
  99. }
  100. fromBridged = true;
  101. }
  102. // Multicast, either bridged or local source
  103. if (to.isMulticast()) {
  104. MulticastGroup mg(to,0);
  105. if (to.isBroadcast()) {
  106. if ((etherType == ZT_ETHERTYPE_ARP)&&(data.size() >= 28)&&(data[2] == 0x08)&&(data[3] == 0x00)&&(data[4] == 6)&&(data[5] == 4)&&(data[7] == 0x01)) {
  107. // Cram IPv4 IP into ADI field to make IPv4 ARP broadcast channel specific and scalable
  108. // Also: enableBroadcast() does not apply to ARP since it's required for IPv4
  109. mg = MulticastGroup::deriveMulticastGroupForAddressResolution(InetAddress(data.field(24,4),4,0));
  110. } else if (!nconf->enableBroadcast()) {
  111. // Don't transmit broadcasts if this network doesn't want them
  112. TRACE("%s: dropped broadcast since ff:ff:ff:ff:ff:ff is not enabled on network %.16llx",network->tapDeviceName().c_str(),network->id());
  113. return;
  114. }
  115. }
  116. // Learn multicast groups for bridged-in hosts
  117. if (fromBridged)
  118. network->learnBridgedMulticastGroup(mg);
  119. // Check multicast/broadcast bandwidth quotas
  120. if (!network->updateAndCheckMulticastBalance(_r->identity.address(),mg,data.size())) {
  121. TRACE("%s: didn't multicast %d bytes, quota exceeded for multicast group %s",network->tapDeviceName().c_str(),(int)data.size(),mg.toString().c_str());
  122. return;
  123. }
  124. TRACE("%s: MULTICAST %s -> %s %s %d",network->tapDeviceName().c_str(),from.toString().c_str(),mg.toString().c_str(),etherTypeName(etherType),(int)data.size());
  125. const unsigned int mcid = ++_multicastIdCounter & 0xffffff;
  126. const uint16_t bloomNonce = (uint16_t)(_r->prng->next32() & 0xffff); // doesn't need to be cryptographically strong
  127. unsigned char bloom[ZT_PROTO_VERB_MULTICAST_FRAME_LEN_PROPAGATION_BLOOM];
  128. unsigned char fifo[ZT_PROTO_VERB_MULTICAST_FRAME_LEN_PROPAGATION_FIFO + ZT_ADDRESS_LENGTH]; // extra ZT_ADDRESS_LENGTH is for first hop, not put in packet but serves as destination for packet
  129. unsigned char *const fifoEnd = fifo + sizeof(fifo);
  130. const unsigned int signedPartLen = (ZT_PROTO_VERB_MULTICAST_FRAME_IDX_FRAME - ZT_PROTO_VERB_MULTICAST_FRAME_IDX__START_OF_SIGNED_PORTION) + data.size();
  131. const SharedPtr<Peer> supernode(_r->topology->getBestSupernode());
  132. // For each bit prefix send a packet to a list of destinations within it
  133. for(unsigned int prefix=0,np=((unsigned int)2 << (nconf->multicastPrefixBits() - 1));prefix<np;++prefix) {
  134. memset(bloom,0,sizeof(bloom));
  135. unsigned char *fifoPtr = fifo;
  136. // All multicasts visit all active bridges first -- this is one of the two active/passive bridge differences
  137. for(std::set<Address>::const_iterator ab(nconf->activeBridges().begin());ab!=nconf->activeBridges().end();++ab) {
  138. if ((*ab != _r->identity.address())&&(ab->withinMulticastPropagationPrefix(prefix,nconf->multicastPrefixBits()))) {
  139. ab->copyTo(fifoPtr,ZT_ADDRESS_LENGTH);
  140. if ((fifoPtr += ZT_ADDRESS_LENGTH) == fifoEnd)
  141. break;
  142. }
  143. }
  144. // Then visit next hops according to multicaster (if there's room... almost certainly will be)
  145. if (fifoPtr != fifoEnd) {
  146. _r->mc->getNextHops(network->id(),mg,Multicaster::AddToPropagationQueue(&fifoPtr,fifoEnd,bloom,bloomNonce,_r->identity.address(),nconf->multicastPrefixBits(),prefix));
  147. // Pad remainder of FIFO with zeroes
  148. while (fifoPtr != fifoEnd)
  149. *(fifoPtr++) = (unsigned char)0;
  150. }
  151. // First element in FIFO is first hop, rest of FIFO is sent in packet *to* first hop
  152. Address firstHop(fifo,ZT_ADDRESS_LENGTH);
  153. if (!firstHop) {
  154. if (supernode)
  155. firstHop = supernode->address();
  156. else continue; // nowhere to go
  157. }
  158. Packet outp(firstHop,_r->identity.address(),Packet::VERB_MULTICAST_FRAME);
  159. outp.append((uint16_t)0);
  160. outp.append(fifo + ZT_ADDRESS_LENGTH,ZT_PROTO_VERB_MULTICAST_FRAME_LEN_PROPAGATION_FIFO); // remainder of fifo is loaded into packet
  161. outp.append(bloom,ZT_PROTO_VERB_MULTICAST_FRAME_LEN_PROPAGATION_BLOOM);
  162. outp.append((nconf->com()) ? (unsigned char)ZT_PROTO_VERB_MULTICAST_FRAME_FLAGS_HAS_MEMBERSHIP_CERTIFICATE : (unsigned char)0);
  163. outp.append(network->id());
  164. outp.append(bloomNonce);
  165. outp.append((unsigned char)nconf->multicastPrefixBits());
  166. outp.append((unsigned char)prefix);
  167. _r->identity.address().appendTo(outp);
  168. outp.append((unsigned char)((mcid >> 16) & 0xff));
  169. outp.append((unsigned char)((mcid >> 8) & 0xff));
  170. outp.append((unsigned char)(mcid & 0xff));
  171. from.appendTo(outp);
  172. mg.mac().appendTo(outp);
  173. outp.append(mg.adi());
  174. outp.append((uint16_t)etherType);
  175. outp.append((uint16_t)data.size());
  176. outp.append(data);
  177. C25519::Signature sig(_r->identity.sign(outp.field(ZT_PROTO_VERB_MULTICAST_FRAME_IDX__START_OF_SIGNED_PORTION,signedPartLen),signedPartLen));
  178. outp.append((uint16_t)sig.size());
  179. outp.append(sig.data,(unsigned int)sig.size());
  180. // FIXME: now we send the netconf cert with every single multicast,
  181. // which pretty much ensures everyone has it ahead of time but adds
  182. // some redundant payload. Maybe think abouut this in the future.
  183. if (nconf->com())
  184. nconf->com().serialize(outp);
  185. outp.compress();
  186. send(outp,true);
  187. }
  188. return;
  189. }
  190. // Destination is another ZeroTier node
  191. if (to[0] == MAC::firstOctetForNetwork(network->id())) {
  192. Address toZT(to.toAddress(network->id()));
  193. if (network->isAllowed(toZT)) {
  194. network->pushMembershipCertificate(toZT,false,Utils::now());
  195. if (fromBridged) {
  196. // Must use EXT_FRAME if source is not myself
  197. Packet outp(toZT,_r->identity.address(),Packet::VERB_EXT_FRAME);
  198. outp.append(network->id());
  199. outp.append((unsigned char)0);
  200. to.appendTo(outp);
  201. from.appendTo(outp);
  202. outp.append((uint16_t)etherType);
  203. outp.append(data);
  204. outp.compress();
  205. send(outp,true);
  206. } else {
  207. // VERB_FRAME is really just lighter weight EXT_FRAME, can use for direct-to-direct (before bridging this was the only unicast method)
  208. Packet outp(toZT,_r->identity.address(),Packet::VERB_FRAME);
  209. outp.append(network->id());
  210. outp.append((uint16_t)etherType);
  211. outp.append(data);
  212. outp.compress();
  213. send(outp,true);
  214. }
  215. } else {
  216. TRACE("%s: UNICAST: %s -> %s %s dropped, destination not a member of closed network %.16llx",network->tapDeviceName().c_str(),from.toString().c_str(),to.toString().c_str(),etherTypeName(etherType),network->id());
  217. }
  218. return;
  219. }
  220. // Destination is behind another bridge
  221. Address bridges[ZT_MAX_BRIDGE_SPAM];
  222. unsigned int numBridges = 0;
  223. bridges[0] = network->findBridgeTo(to);
  224. if ((bridges[0])&&(bridges[0] != _r->identity.address())&&(network->isAllowed(bridges[0]))&&(network->permitsBridging(bridges[0]))) {
  225. printf("got known bridge for %s at %s\n",to.toString().c_str(),bridges[0].toString().c_str());
  226. ++numBridges;
  227. } else if (!nconf->activeBridges().empty()) {
  228. printf("bridge spamming for %s\n",to.toString().c_str());
  229. // If there is no known route, spam to up to ZT_MAX_BRIDGE_SPAM active bridges
  230. std::set<Address>::const_iterator ab(nconf->activeBridges().begin());
  231. if (nconf->activeBridges().size() <= ZT_MAX_BRIDGE_SPAM) {
  232. // If there are <= ZT_MAX_BRIDGE_SPAM active bridges, just take them all
  233. while (numBridges < nconf->activeBridges().size())
  234. bridges[numBridges++] = *(ab++);
  235. } else {
  236. // Otherwise do this less efficient multipass thing to pick randomly from an ordered set until we have enough
  237. while (numBridges < ZT_MAX_BRIDGE_SPAM) {
  238. if (ab == nconf->activeBridges().end())
  239. ab = nconf->activeBridges().begin();
  240. if (((unsigned long)_r->prng->next32() % (unsigned long)nconf->activeBridges().size()) == 0)
  241. bridges[numBridges++] = *(ab++);
  242. else ++ab;
  243. }
  244. }
  245. }
  246. for(unsigned int b=0;b<numBridges;++b) {
  247. if (network->isAllowed(bridges[b])) {
  248. Packet outp(bridges[b],_r->identity.address(),Packet::VERB_EXT_FRAME);
  249. outp.append(network->id());
  250. outp.append((unsigned char)0);
  251. to.appendTo(outp);
  252. from.appendTo(outp);
  253. outp.append((uint16_t)etherType);
  254. outp.append(data);
  255. outp.compress();
  256. send(outp,true);
  257. }
  258. }
  259. }
  260. void Switch::send(const Packet &packet,bool encrypt)
  261. {
  262. if (packet.destination() == _r->identity.address()) {
  263. TRACE("BUG: caught attempt to send() to self, ignored");
  264. return;
  265. }
  266. if (!_trySend(packet,encrypt)) {
  267. Mutex::Lock _l(_txQueue_m);
  268. _txQueue.insert(std::pair< Address,TXQueueEntry >(packet.destination(),TXQueueEntry(Utils::now(),packet,encrypt)));
  269. }
  270. }
  271. void Switch::sendHELLO(const Address &dest)
  272. {
  273. Packet outp(dest,_r->identity.address(),Packet::VERB_HELLO);
  274. outp.append((unsigned char)ZT_PROTO_VERSION);
  275. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  276. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  277. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  278. outp.append(Utils::now());
  279. _r->identity.serialize(outp,false);
  280. send(outp,false);
  281. }
  282. bool Switch::sendHELLO(const SharedPtr<Peer> &dest,const Path &path)
  283. {
  284. uint64_t now = Utils::now();
  285. Packet outp(dest->address(),_r->identity.address(),Packet::VERB_HELLO);
  286. outp.append((unsigned char)ZT_PROTO_VERSION);
  287. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  288. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  289. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  290. outp.append(now);
  291. _r->identity.serialize(outp,false);
  292. outp.armor(dest->key(),false);
  293. _r->antiRec->logOutgoingZT(outp.data(),outp.size());
  294. return _r->sm->send(path.address(),path.tcp(),path.type() == Path::PATH_TYPE_TCP_OUT,outp.data(),outp.size());
  295. }
  296. bool Switch::sendHELLO(const SharedPtr<Peer> &dest,const InetAddress &destUdp)
  297. {
  298. uint64_t now = Utils::now();
  299. Packet outp(dest->address(),_r->identity.address(),Packet::VERB_HELLO);
  300. outp.append((unsigned char)ZT_PROTO_VERSION);
  301. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  302. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  303. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  304. outp.append(now);
  305. _r->identity.serialize(outp,false);
  306. outp.armor(dest->key(),false);
  307. _r->antiRec->logOutgoingZT(outp.data(),outp.size());
  308. return _r->sm->send(destUdp,false,false,outp.data(),outp.size());
  309. }
  310. bool Switch::unite(const Address &p1,const Address &p2,bool force)
  311. {
  312. if ((p1 == _r->identity.address())||(p2 == _r->identity.address()))
  313. return false;
  314. SharedPtr<Peer> p1p = _r->topology->getPeer(p1);
  315. if (!p1p)
  316. return false;
  317. SharedPtr<Peer> p2p = _r->topology->getPeer(p2);
  318. if (!p2p)
  319. return false;
  320. uint64_t now = Utils::now();
  321. std::pair<InetAddress,InetAddress> cg(Peer::findCommonGround(*p1p,*p2p,now));
  322. if (!(cg.first))
  323. return false;
  324. // Addresses are sorted in key for last unite attempt map for order
  325. // invariant lookup: (p1,p2) == (p2,p1)
  326. Array<Address,2> uniteKey;
  327. if (p1 >= p2) {
  328. uniteKey[0] = p2;
  329. uniteKey[1] = p1;
  330. } else {
  331. uniteKey[0] = p1;
  332. uniteKey[1] = p2;
  333. }
  334. {
  335. Mutex::Lock _l(_lastUniteAttempt_m);
  336. std::map< Array< Address,2 >,uint64_t >::const_iterator e(_lastUniteAttempt.find(uniteKey));
  337. if ((!force)&&(e != _lastUniteAttempt.end())&&((now - e->second) < ZT_MIN_UNITE_INTERVAL))
  338. return false;
  339. else _lastUniteAttempt[uniteKey] = now;
  340. }
  341. TRACE("unite: %s(%s) <> %s(%s)",p1.toString().c_str(),cg.second.toString().c_str(),p2.toString().c_str(),cg.first.toString().c_str());
  342. /* Tell P1 where to find P2 and vice versa, sending the packets to P1 and
  343. * P2 in randomized order in terms of which gets sent first. This is done
  344. * since in a few cases NAT-t can be sensitive to slight timing differences
  345. * in terms of when the two peers initiate. Normally this is accounted for
  346. * by the nearly-simultaneous RENDEZVOUS kickoff from the supernode, but
  347. * given that supernodes are hosted on cloud providers this can in some
  348. * cases have a few ms of latency between packet departures. By randomizing
  349. * the order we make each attempted NAT-t favor one or the other going
  350. * first, meaning if it doesn't succeed the first time it might the second
  351. * and so forth. */
  352. unsigned int alt = _r->prng->next32() & 1;
  353. unsigned int completed = alt + 2;
  354. while (alt != completed) {
  355. if ((alt & 1) == 0) {
  356. // Tell p1 where to find p2.
  357. Packet outp(p1,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  358. outp.append((unsigned char)0);
  359. p2.appendTo(outp);
  360. outp.append((uint16_t)cg.first.port());
  361. if (cg.first.isV6()) {
  362. outp.append((unsigned char)16);
  363. outp.append(cg.first.rawIpData(),16);
  364. } else {
  365. outp.append((unsigned char)4);
  366. outp.append(cg.first.rawIpData(),4);
  367. }
  368. outp.armor(p1p->key(),true);
  369. p1p->send(_r,outp.data(),outp.size(),now);
  370. } else {
  371. // Tell p2 where to find p1.
  372. Packet outp(p2,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  373. outp.append((unsigned char)0);
  374. p1.appendTo(outp);
  375. outp.append((uint16_t)cg.second.port());
  376. if (cg.second.isV6()) {
  377. outp.append((unsigned char)16);
  378. outp.append(cg.second.rawIpData(),16);
  379. } else {
  380. outp.append((unsigned char)4);
  381. outp.append(cg.second.rawIpData(),4);
  382. }
  383. outp.armor(p2p->key(),true);
  384. p2p->send(_r,outp.data(),outp.size(),now);
  385. }
  386. ++alt; // counts up and also flips LSB
  387. }
  388. return true;
  389. }
  390. void Switch::contact(const SharedPtr<Peer> &peer,const InetAddress &atAddr)
  391. {
  392. _r->sm->sendFirewallOpener(atAddr,ZT_FIREWALL_OPENER_HOPS);
  393. {
  394. Mutex::Lock _l(_contactQueue_m);
  395. _contactQueue.push_back(ContactQueueEntry(peer,Utils::now() + ZT_RENDEZVOUS_NAT_T_DELAY,atAddr));
  396. }
  397. // Kick main loop out of wait so that it can pick up this
  398. // change to our scheduled timer tasks.
  399. _r->sm->whack();
  400. }
  401. unsigned long Switch::doTimerTasks()
  402. {
  403. unsigned long nextDelay = ~((unsigned long)0); // big number, caller will cap return value
  404. uint64_t now = Utils::now();
  405. {
  406. Mutex::Lock _l(_contactQueue_m);
  407. for(std::list<ContactQueueEntry>::iterator qi(_contactQueue.begin());qi!=_contactQueue.end();) {
  408. if (now >= qi->fireAtTime) {
  409. TRACE("sending NAT-T HELLO to %s(%s)",qi->peer->address().toString().c_str(),qi->inaddr.toString().c_str());
  410. sendHELLO(qi->peer,qi->inaddr);
  411. _contactQueue.erase(qi++);
  412. } else {
  413. nextDelay = std::min(nextDelay,(unsigned long)(qi->fireAtTime - now));
  414. ++qi;
  415. }
  416. }
  417. }
  418. {
  419. Mutex::Lock _l(_outstandingWhoisRequests_m);
  420. for(std::map< Address,WhoisRequest >::iterator i(_outstandingWhoisRequests.begin());i!=_outstandingWhoisRequests.end();) {
  421. unsigned long since = (unsigned long)(now - i->second.lastSent);
  422. if (since >= ZT_WHOIS_RETRY_DELAY) {
  423. if (i->second.retries >= ZT_MAX_WHOIS_RETRIES) {
  424. TRACE("WHOIS %s timed out",i->first.toString().c_str());
  425. _outstandingWhoisRequests.erase(i++);
  426. continue;
  427. } else {
  428. i->second.lastSent = now;
  429. i->second.peersConsulted[i->second.retries] = _sendWhoisRequest(i->first,i->second.peersConsulted,i->second.retries);
  430. ++i->second.retries;
  431. TRACE("WHOIS %s (retry %u)",i->first.toString().c_str(),i->second.retries);
  432. nextDelay = std::min(nextDelay,(unsigned long)ZT_WHOIS_RETRY_DELAY);
  433. }
  434. } else nextDelay = std::min(nextDelay,ZT_WHOIS_RETRY_DELAY - since);
  435. ++i;
  436. }
  437. }
  438. {
  439. Mutex::Lock _l(_txQueue_m);
  440. for(std::multimap< Address,TXQueueEntry >::iterator i(_txQueue.begin());i!=_txQueue.end();) {
  441. if (_trySend(i->second.packet,i->second.encrypt))
  442. _txQueue.erase(i++);
  443. else if ((now - i->second.creationTime) > ZT_TRANSMIT_QUEUE_TIMEOUT) {
  444. TRACE("TX %s -> %s timed out",i->second.packet.source().toString().c_str(),i->second.packet.destination().toString().c_str());
  445. _txQueue.erase(i++);
  446. } else ++i;
  447. }
  448. }
  449. {
  450. Mutex::Lock _l(_rxQueue_m);
  451. for(std::list< SharedPtr<PacketDecoder> >::iterator i(_rxQueue.begin());i!=_rxQueue.end();) {
  452. if ((now - (*i)->receiveTime()) > ZT_RECEIVE_QUEUE_TIMEOUT) {
  453. TRACE("RX %s -> %s timed out",(*i)->source().toString().c_str(),(*i)->destination().toString().c_str());
  454. _rxQueue.erase(i++);
  455. } else ++i;
  456. }
  457. }
  458. {
  459. Mutex::Lock _l(_defragQueue_m);
  460. for(std::map< uint64_t,DefragQueueEntry >::iterator i(_defragQueue.begin());i!=_defragQueue.end();) {
  461. if ((now - i->second.creationTime) > ZT_FRAGMENTED_PACKET_RECEIVE_TIMEOUT) {
  462. TRACE("incomplete fragmented packet %.16llx timed out, fragments discarded",i->first);
  463. _defragQueue.erase(i++);
  464. } else ++i;
  465. }
  466. }
  467. return std::max(nextDelay,(unsigned long)10); // minimum delay
  468. }
  469. void Switch::announceMulticastGroups(const std::map< SharedPtr<Network>,std::set<MulticastGroup> > &allMemberships)
  470. {
  471. std::vector< SharedPtr<Peer> > directPeers;
  472. _r->topology->eachPeer(Topology::CollectPeersWithActiveDirectPath(directPeers,Utils::now()));
  473. #ifdef ZT_TRACE
  474. unsigned int totalMulticastGroups = 0;
  475. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator i(allMemberships.begin());i!=allMemberships.end();++i)
  476. totalMulticastGroups += (unsigned int)i->second.size();
  477. TRACE("announcing %u multicast groups for %u networks to %u peers",totalMulticastGroups,(unsigned int)allMemberships.size(),(unsigned int)directPeers.size());
  478. #endif
  479. uint64_t now = Utils::now();
  480. for(std::vector< SharedPtr<Peer> >::iterator p(directPeers.begin());p!=directPeers.end();++p) {
  481. Packet outp((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  482. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator nwmgs(allMemberships.begin());nwmgs!=allMemberships.end();++nwmgs) {
  483. nwmgs->first->pushMembershipCertificate((*p)->address(),false,now);
  484. if ((_r->topology->isSupernode((*p)->address()))||(nwmgs->first->isAllowed((*p)->address()))) {
  485. for(std::set<MulticastGroup>::iterator mg(nwmgs->second.begin());mg!=nwmgs->second.end();++mg) {
  486. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  487. send(outp,true);
  488. outp.reset((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  489. }
  490. // network ID, MAC, ADI
  491. outp.append((uint64_t)nwmgs->first->id());
  492. mg->mac().appendTo(outp);
  493. outp.append((uint32_t)mg->adi());
  494. }
  495. }
  496. }
  497. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  498. send(outp,true);
  499. }
  500. }
  501. void Switch::announceMulticastGroups(const SharedPtr<Peer> &peer)
  502. {
  503. Packet outp(peer->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  504. std::vector< SharedPtr<Network> > networks(_r->nc->networks());
  505. uint64_t now = Utils::now();
  506. for(std::vector< SharedPtr<Network> >::iterator n(networks.begin());n!=networks.end();++n) {
  507. if (((*n)->isAllowed(peer->address()))||(_r->topology->isSupernode(peer->address()))) {
  508. (*n)->pushMembershipCertificate(peer->address(),false,now);
  509. std::set<MulticastGroup> mgs((*n)->multicastGroups());
  510. for(std::set<MulticastGroup>::iterator mg(mgs.begin());mg!=mgs.end();++mg) {
  511. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  512. send(outp,true);
  513. outp.reset(peer->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  514. }
  515. // network ID, MAC, ADI
  516. outp.append((uint64_t)(*n)->id());
  517. mg->mac().appendTo(outp);
  518. outp.append((uint32_t)mg->adi());
  519. }
  520. }
  521. }
  522. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  523. send(outp,true);
  524. }
  525. void Switch::requestWhois(const Address &addr)
  526. {
  527. //TRACE("requesting WHOIS for %s",addr.toString().c_str());
  528. bool inserted = false;
  529. {
  530. Mutex::Lock _l(_outstandingWhoisRequests_m);
  531. std::pair< std::map< Address,WhoisRequest >::iterator,bool > entry(_outstandingWhoisRequests.insert(std::pair<Address,WhoisRequest>(addr,WhoisRequest())));
  532. if ((inserted = entry.second))
  533. entry.first->second.lastSent = Utils::now();
  534. entry.first->second.retries = 0; // reset retry count if entry already existed
  535. }
  536. if (inserted)
  537. _sendWhoisRequest(addr,(const Address *)0,0);
  538. }
  539. void Switch::cancelWhoisRequest(const Address &addr)
  540. {
  541. Mutex::Lock _l(_outstandingWhoisRequests_m);
  542. _outstandingWhoisRequests.erase(addr);
  543. }
  544. void Switch::doAnythingWaitingForPeer(const SharedPtr<Peer> &peer)
  545. {
  546. {
  547. Mutex::Lock _l(_outstandingWhoisRequests_m);
  548. _outstandingWhoisRequests.erase(peer->address());
  549. }
  550. {
  551. Mutex::Lock _l(_rxQueue_m);
  552. for(std::list< SharedPtr<PacketDecoder> >::iterator rxi(_rxQueue.begin());rxi!=_rxQueue.end();) {
  553. if ((*rxi)->tryDecode(_r))
  554. _rxQueue.erase(rxi++);
  555. else ++rxi;
  556. }
  557. }
  558. {
  559. Mutex::Lock _l(_txQueue_m);
  560. std::pair< std::multimap< Address,TXQueueEntry >::iterator,std::multimap< Address,TXQueueEntry >::iterator > waitingTxQueueItems(_txQueue.equal_range(peer->address()));
  561. for(std::multimap< Address,TXQueueEntry >::iterator txi(waitingTxQueueItems.first);txi!=waitingTxQueueItems.second;) {
  562. if (_trySend(txi->second.packet,txi->second.encrypt))
  563. _txQueue.erase(txi++);
  564. else ++txi;
  565. }
  566. }
  567. }
  568. const char *Switch::etherTypeName(const unsigned int etherType)
  569. throw()
  570. {
  571. switch(etherType) {
  572. case ZT_ETHERTYPE_IPV4: return "IPV4";
  573. case ZT_ETHERTYPE_ARP: return "ARP";
  574. case ZT_ETHERTYPE_RARP: return "RARP";
  575. case ZT_ETHERTYPE_ATALK: return "ATALK";
  576. case ZT_ETHERTYPE_AARP: return "AARP";
  577. case ZT_ETHERTYPE_IPX_A: return "IPX_A";
  578. case ZT_ETHERTYPE_IPX_B: return "IPX_B";
  579. case ZT_ETHERTYPE_IPV6: return "IPV6";
  580. }
  581. return "UNKNOWN";
  582. }
  583. void Switch::_handleRemotePacketFragment(const SharedPtr<Socket> &fromSock,const InetAddress &fromAddr,const Buffer<4096> &data)
  584. {
  585. Packet::Fragment fragment(data);
  586. Address destination(fragment.destination());
  587. if (destination != _r->identity.address()) {
  588. // Fragment is not for us, so try to relay it
  589. if (fragment.hops() < ZT_RELAY_MAX_HOPS) {
  590. fragment.incrementHops();
  591. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  592. if ((!relayTo)||(relayTo->send(_r,fragment.data(),fragment.size(),Utils::now()) == Path::PATH_TYPE_NULL)) {
  593. relayTo = _r->topology->getBestSupernode();
  594. if (relayTo)
  595. relayTo->send(_r,fragment.data(),fragment.size(),Utils::now());
  596. }
  597. } else {
  598. TRACE("dropped relay [fragment](%s) -> %s, max hops exceeded",fromAddr.toString().c_str(),destination.toString().c_str());
  599. }
  600. } else {
  601. // Fragment looks like ours
  602. uint64_t pid = fragment.packetId();
  603. unsigned int fno = fragment.fragmentNumber();
  604. unsigned int tf = fragment.totalFragments();
  605. if ((tf <= ZT_MAX_PACKET_FRAGMENTS)&&(fno < ZT_MAX_PACKET_FRAGMENTS)&&(fno > 0)&&(tf > 1)) {
  606. // Fragment appears basically sane. Its fragment number must be
  607. // 1 or more, since a Packet with fragmented bit set is fragment 0.
  608. // Total fragments must be more than 1, otherwise why are we
  609. // seeing a Packet::Fragment?
  610. Mutex::Lock _l(_defragQueue_m);
  611. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  612. if (dqe == _defragQueue.end()) {
  613. // We received a Packet::Fragment without its head, so queue it and wait
  614. DefragQueueEntry &dq = _defragQueue[pid];
  615. dq.creationTime = Utils::now();
  616. dq.frags[fno - 1] = fragment;
  617. dq.totalFragments = tf; // total fragment count is known
  618. dq.haveFragments = 1 << fno; // we have only this fragment
  619. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  620. } else if (!(dqe->second.haveFragments & (1 << fno))) {
  621. // We have other fragments and maybe the head, so add this one and check
  622. dqe->second.frags[fno - 1] = fragment;
  623. dqe->second.totalFragments = tf;
  624. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  625. if (Utils::countBits(dqe->second.haveFragments |= (1 << fno)) == tf) {
  626. // We have all fragments -- assemble and process full Packet
  627. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  628. SharedPtr<PacketDecoder> packet(dqe->second.frag0);
  629. for(unsigned int f=1;f<tf;++f)
  630. packet->append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  631. _defragQueue.erase(dqe);
  632. if (!packet->tryDecode(_r)) {
  633. Mutex::Lock _l(_rxQueue_m);
  634. _rxQueue.push_back(packet);
  635. }
  636. }
  637. } // else this is a duplicate fragment, ignore
  638. }
  639. }
  640. }
  641. void Switch::_handleRemotePacketHead(const SharedPtr<Socket> &fromSock,const InetAddress &fromAddr,const Buffer<4096> &data)
  642. {
  643. SharedPtr<PacketDecoder> packet(new PacketDecoder(data,fromSock,fromAddr));
  644. Address source(packet->source());
  645. Address destination(packet->destination());
  646. //TRACE("<< %.16llx %s -> %s (size: %u)",(unsigned long long)packet->packetId(),source.toString().c_str(),destination.toString().c_str(),packet->size());
  647. if (destination != _r->identity.address()) {
  648. // Packet is not for us, so try to relay it
  649. if (packet->hops() < ZT_RELAY_MAX_HOPS) {
  650. packet->incrementHops();
  651. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  652. Path::Type relayedVia;
  653. if ((relayTo)&&((relayedVia = relayTo->send(_r,packet->data(),packet->size(),Utils::now())) != Path::PATH_TYPE_NULL)) {
  654. /* If both paths are UDP, attempt to invoke UDP NAT-t between peers
  655. * by sending VERB_RENDEZVOUS. Do not do this for TCP due to GitHub
  656. * issue #63. */
  657. if ((fromSock->udp())&&(relayedVia == Path::PATH_TYPE_UDP))
  658. unite(source,destination,false);
  659. } else {
  660. // If we've received a packet not for us and we don't have
  661. // a direct path to its recipient, pass it to (another)
  662. // supernode. This can happen due to Internet weather -- the
  663. // most direct supernode may not be reachable, yet another
  664. // further away may be.
  665. relayTo = _r->topology->getBestSupernode(&source,1,true);
  666. if (relayTo)
  667. relayTo->send(_r,packet->data(),packet->size(),Utils::now());
  668. }
  669. } else {
  670. TRACE("dropped relay %s(%s) -> %s, max hops exceeded",packet->source().toString().c_str(),fromAddr.toString().c_str(),destination.toString().c_str());
  671. }
  672. } else if (packet->fragmented()) {
  673. // Packet is the head of a fragmented packet series
  674. uint64_t pid = packet->packetId();
  675. Mutex::Lock _l(_defragQueue_m);
  676. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  677. if (dqe == _defragQueue.end()) {
  678. // If we have no other fragments yet, create an entry and save the head
  679. DefragQueueEntry &dq = _defragQueue[pid];
  680. dq.creationTime = Utils::now();
  681. dq.frag0 = packet;
  682. dq.totalFragments = 0; // 0 == unknown, waiting for Packet::Fragment
  683. dq.haveFragments = 1; // head is first bit (left to right)
  684. //TRACE("fragment (0/?) of %.16llx from %s",pid,fromAddr.toString().c_str());
  685. } else if (!(dqe->second.haveFragments & 1)) {
  686. // If we have other fragments but no head, see if we are complete with the head
  687. if ((dqe->second.totalFragments)&&(Utils::countBits(dqe->second.haveFragments |= 1) == dqe->second.totalFragments)) {
  688. // We have all fragments -- assemble and process full Packet
  689. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  690. // packet already contains head, so append fragments
  691. for(unsigned int f=1;f<dqe->second.totalFragments;++f)
  692. packet->append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  693. _defragQueue.erase(dqe);
  694. if (!packet->tryDecode(_r)) {
  695. Mutex::Lock _l(_rxQueue_m);
  696. _rxQueue.push_back(packet);
  697. }
  698. } else {
  699. // Still waiting on more fragments, so queue the head
  700. dqe->second.frag0 = packet;
  701. }
  702. } // else this is a duplicate head, ignore
  703. } else {
  704. // Packet is unfragmented, so just process it
  705. if (!packet->tryDecode(_r)) {
  706. Mutex::Lock _l(_rxQueue_m);
  707. _rxQueue.push_back(packet);
  708. }
  709. }
  710. }
  711. void Switch::_handleBeacon(const SharedPtr<Socket> &fromSock,const InetAddress &fromAddr,const Buffer<4096> &data)
  712. {
  713. Address beaconAddr(data.field(ZT_PROTO_BEACON_IDX_ADDRESS,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH);
  714. if (beaconAddr == _r->identity.address())
  715. return;
  716. SharedPtr<Peer> peer(_r->topology->getPeer(beaconAddr));
  717. if (peer) {
  718. uint64_t now = Utils::now();
  719. if (peer->haveUdpPath(fromAddr)) {
  720. if ((now - peer->lastDirectReceive()) >= ZT_PEER_DIRECT_PING_DELAY)
  721. peer->sendPing(_r,now);
  722. } else {
  723. if ((now - _lastBeacon) < ZT_MIN_BEACON_RESPONSE_INTERVAL)
  724. return;
  725. _lastBeacon = now;
  726. sendHELLO(peer,fromAddr);
  727. }
  728. }
  729. }
  730. Address Switch::_sendWhoisRequest(const Address &addr,const Address *peersAlreadyConsulted,unsigned int numPeersAlreadyConsulted)
  731. {
  732. SharedPtr<Peer> supernode(_r->topology->getBestSupernode(peersAlreadyConsulted,numPeersAlreadyConsulted,false));
  733. if (supernode) {
  734. Packet outp(supernode->address(),_r->identity.address(),Packet::VERB_WHOIS);
  735. addr.appendTo(outp);
  736. outp.armor(supernode->key(),true);
  737. uint64_t now = Utils::now();
  738. if (supernode->send(_r,outp.data(),outp.size(),now) != Path::PATH_TYPE_NULL)
  739. return supernode->address();
  740. }
  741. return Address();
  742. }
  743. bool Switch::_trySend(const Packet &packet,bool encrypt)
  744. {
  745. SharedPtr<Peer> peer(_r->topology->getPeer(packet.destination()));
  746. if (peer) {
  747. uint64_t now = Utils::now();
  748. SharedPtr<Peer> via;
  749. if (peer->hasActiveDirectPath(now)) {
  750. via = peer;
  751. } else {
  752. via = _r->topology->getBestSupernode();
  753. if (!via)
  754. return false;
  755. }
  756. Packet tmp(packet);
  757. unsigned int chunkSize = std::min(tmp.size(),(unsigned int)ZT_UDP_DEFAULT_PAYLOAD_MTU);
  758. tmp.setFragmented(chunkSize < tmp.size());
  759. tmp.armor(peer->key(),encrypt);
  760. if (via->send(_r,tmp.data(),chunkSize,now) != Path::PATH_TYPE_NULL) {
  761. if (chunkSize < tmp.size()) {
  762. // Too big for one bite, fragment the rest
  763. unsigned int fragStart = chunkSize;
  764. unsigned int remaining = tmp.size() - chunkSize;
  765. unsigned int fragsRemaining = (remaining / (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  766. if ((fragsRemaining * (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH)) < remaining)
  767. ++fragsRemaining;
  768. unsigned int totalFragments = fragsRemaining + 1;
  769. for(unsigned int f=0;f<fragsRemaining;++f) {
  770. chunkSize = std::min(remaining,(unsigned int)(ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  771. Packet::Fragment frag(tmp,fragStart,chunkSize,f + 1,totalFragments);
  772. via->send(_r,frag.data(),frag.size(),now);
  773. fragStart += chunkSize;
  774. remaining -= chunkSize;
  775. }
  776. }
  777. /* #ifdef ZT_TRACE
  778. if (via != peer) {
  779. TRACE(">> %s to %s via %s (%d)",Packet::verbString(packet.verb()),peer->address().toString().c_str(),via->address().toString().c_str(),(int)packet.size());
  780. } else {
  781. TRACE(">> %s to %s (%d)",Packet::verbString(packet.verb()),peer->address().toString().c_str(),(int)packet.size());
  782. }
  783. #endif */
  784. return true;
  785. }
  786. return false;
  787. }
  788. requestWhois(packet.destination());
  789. return false;
  790. }
  791. } // namespace ZeroTier