Switch.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2012-2013 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 "Demarc.hpp"
  46. #include "Filter.hpp"
  47. #include "../version.h"
  48. namespace ZeroTier {
  49. Switch::Switch(const RuntimeEnvironment *renv) :
  50. _r(renv)
  51. {
  52. }
  53. Switch::~Switch()
  54. {
  55. }
  56. void Switch::onRemotePacket(Demarc::Port localPort,const InetAddress &fromAddr,const Buffer<4096> &data)
  57. {
  58. try {
  59. if (data.size() > ZT_PROTO_MIN_FRAGMENT_LENGTH) {
  60. if (data[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] == ZT_PACKET_FRAGMENT_INDICATOR)
  61. _handleRemotePacketFragment(localPort,fromAddr,data);
  62. else if (data.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  63. _handleRemotePacketHead(localPort,fromAddr,data);
  64. }
  65. } catch (std::exception &ex) {
  66. TRACE("dropped packet from %s: unexpected exception: %s",fromAddr.toString().c_str(),ex.what());
  67. } catch ( ... ) {
  68. TRACE("dropped packet from %s: unexpected exception: (unknown)",fromAddr.toString().c_str());
  69. }
  70. }
  71. void Switch::onLocalEthernet(const SharedPtr<Network> &network,const MAC &from,const MAC &to,unsigned int etherType,const Buffer<4096> &data)
  72. {
  73. if (from != network->tap().mac()) {
  74. LOG("ignored tap: %s -> %s %s (bridging is not (yet?) supported)",from.toString().c_str(),to.toString().c_str(),Filter::etherTypeName(etherType));
  75. return;
  76. }
  77. if (to == network->tap().mac()) {
  78. LOG("%s: frame received from self, ignoring (bridge loop?)",network->tap().deviceName().c_str());
  79. return;
  80. }
  81. if ((etherType != ZT_ETHERTYPE_ARP)&&(etherType != ZT_ETHERTYPE_IPV4)&&(etherType != ZT_ETHERTYPE_IPV6)) {
  82. LOG("ignored tap: %s -> %s %s (not a supported etherType)",from.toString().c_str(),to.toString().c_str(),Filter::etherTypeName(etherType));
  83. return;
  84. }
  85. if (to.isMulticast()) {
  86. MulticastGroup mg(to,0);
  87. if (to.isBroadcast()) {
  88. // Handle broadcast special cases
  89. // Cram IPv4 IP into ADI field to make IPv4 ARP broadcast channel specific and scalable
  90. if ((etherType == ZT_ETHERTYPE_ARP)&&(data.size() == 28)&&(data[2] == 0x08)&&(data[3] == 0x00)&&(data[4] == 6)&&(data[5] == 4)&&(data[7] == 0x01))
  91. mg = MulticastGroup::deriveMulticastGroupForAddressResolution(InetAddress(data.field(24,4),4,0));
  92. }
  93. Multicaster::MulticastBloomFilter bloom;
  94. SharedPtr<Peer> propPeers[ZT_MULTICAST_PROPAGATION_BREADTH];
  95. unsigned int np = _r->multicaster->pickSocialPropagationPeers(
  96. *(_r->prng),
  97. *(_r->topology),
  98. network->id(),
  99. mg,
  100. _r->identity.address(),
  101. Address(),
  102. bloom,
  103. ZT_MULTICAST_PROPAGATION_BREADTH,
  104. propPeers,
  105. Utils::now());
  106. if (!np)
  107. return;
  108. std::string signature(Multicaster::signMulticastPacket(_r->identity,network->id(),from,mg,etherType,data.data(),data.size()));
  109. if (!signature.length()) {
  110. TRACE("failure signing multicast message!");
  111. return;
  112. }
  113. Packet outpTmpl(propPeers[0]->address(),_r->identity.address(),Packet::VERB_MULTICAST_FRAME);
  114. outpTmpl.append((uint8_t)0);
  115. outpTmpl.append((uint64_t)network->id());
  116. _r->identity.address().appendTo(outpTmpl);
  117. outpTmpl.append(from.data,6);
  118. outpTmpl.append(mg.mac().data,6);
  119. outpTmpl.append((uint32_t)mg.adi());
  120. outpTmpl.append(bloom.data(),ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE_BYTES);
  121. outpTmpl.append((uint8_t)0); // 0 hops
  122. outpTmpl.append((uint16_t)etherType);
  123. outpTmpl.append((uint16_t)data.size());
  124. outpTmpl.append((uint16_t)signature.length());
  125. outpTmpl.append(data.data(),data.size());
  126. outpTmpl.append(signature.data(),signature.length());
  127. outpTmpl.compress();
  128. send(outpTmpl,true);
  129. for(unsigned int i=1;i<np;++i) {
  130. outpTmpl.newInitializationVector();
  131. outpTmpl.setDestination(propPeers[i]->address());
  132. send(outpTmpl,true);
  133. }
  134. } else if (to.isZeroTier()) {
  135. // Simple unicast frame from us to another node
  136. Address toZT(to.data + 1,ZT_ADDRESS_LENGTH);
  137. if (network->isAllowed(toZT)) {
  138. Packet outp(toZT,_r->identity.address(),Packet::VERB_FRAME);
  139. outp.append(network->id());
  140. outp.append((uint16_t)etherType);
  141. outp.append(data);
  142. outp.compress();
  143. send(outp,true);
  144. } else {
  145. TRACE("UNICAST: %s -> %s %s (dropped, destination not a member of closed network %llu)",from.toString().c_str(),to.toString().c_str(),Filter::etherTypeName(etherType),network->id());
  146. }
  147. } else {
  148. TRACE("UNICAST: %s -> %s %s (dropped, destination MAC not ZeroTier)",from.toString().c_str(),to.toString().c_str(),Filter::etherTypeName(etherType));
  149. }
  150. }
  151. void Switch::send(const Packet &packet,bool encrypt)
  152. {
  153. if (packet.destination() == _r->identity.address()) {
  154. TRACE("BUG: caught attempt to send() to self, ignored");
  155. return;
  156. }
  157. //TRACE(">> %.16llx %s -> %s (size: %u) (enc: %s)",(unsigned long long)packet.packetId(),packet.source().toString().c_str(),packet.destination().toString().c_str(),packet.size(),(encrypt ? "yes" : "no"));
  158. if (!_trySend(packet,encrypt)) {
  159. Mutex::Lock _l(_txQueue_m);
  160. _txQueue.insert(std::pair< Address,TXQueueEntry >(packet.destination(),TXQueueEntry(Utils::now(),packet,encrypt)));
  161. }
  162. }
  163. void Switch::sendHELLO(const Address &dest)
  164. {
  165. Packet outp(dest,_r->identity.address(),Packet::VERB_HELLO);
  166. outp.append((unsigned char)ZT_PROTO_VERSION);
  167. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  168. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  169. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  170. outp.append(Utils::now());
  171. _r->identity.serialize(outp,false);
  172. send(outp,false);
  173. }
  174. bool Switch::sendHELLO(const SharedPtr<Peer> &dest,Demarc::Port localPort,const InetAddress &remoteAddr)
  175. {
  176. uint64_t now = Utils::now();
  177. Packet outp(dest->address(),_r->identity.address(),Packet::VERB_HELLO);
  178. outp.append((unsigned char)ZT_PROTO_VERSION);
  179. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  180. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  181. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  182. outp.append(now);
  183. _r->identity.serialize(outp,false);
  184. outp.hmacSet(dest->macKey());
  185. if (_r->demarc->send(localPort,remoteAddr,outp.data(),outp.size(),-1)) {
  186. dest->onSent(_r,false,Packet::VERB_HELLO,now);
  187. return true;
  188. }
  189. return false;
  190. }
  191. bool Switch::unite(const Address &p1,const Address &p2,bool force)
  192. {
  193. if ((p1 == _r->identity.address())||(p2 == _r->identity.address()))
  194. return false;
  195. SharedPtr<Peer> p1p = _r->topology->getPeer(p1);
  196. if (!p1p)
  197. return false;
  198. SharedPtr<Peer> p2p = _r->topology->getPeer(p2);
  199. if (!p2p)
  200. return false;
  201. uint64_t now = Utils::now();
  202. std::pair<InetAddress,InetAddress> cg(Peer::findCommonGround(*p1p,*p2p,now));
  203. if (!(cg.first))
  204. return false;
  205. // Addresses are sorted in key for last unite attempt map for order
  206. // invariant lookup: (p1,p2) == (p2,p1)
  207. Array<Address,2> uniteKey;
  208. if (p1 >= p2) {
  209. uniteKey[0] = p2;
  210. uniteKey[1] = p1;
  211. } else {
  212. uniteKey[0] = p1;
  213. uniteKey[1] = p2;
  214. }
  215. {
  216. Mutex::Lock _l(_lastUniteAttempt_m);
  217. std::map< Array< Address,2 >,uint64_t >::const_iterator e(_lastUniteAttempt.find(uniteKey));
  218. if ((!force)&&(e != _lastUniteAttempt.end())&&((now - e->second) < ZT_MIN_UNITE_INTERVAL))
  219. return false;
  220. else _lastUniteAttempt[uniteKey] = now;
  221. }
  222. TRACE("unite: %s(%s) <> %s(%s)",p1.toString().c_str(),cg.second.toString().c_str(),p2.toString().c_str(),cg.first.toString().c_str());
  223. { // tell p1 where to find p2
  224. Packet outp(p1,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  225. p2.appendTo(outp);
  226. outp.append((uint16_t)cg.first.port());
  227. if (cg.first.isV6()) {
  228. outp.append((unsigned char)16);
  229. outp.append(cg.first.rawIpData(),16);
  230. } else {
  231. outp.append((unsigned char)4);
  232. outp.append(cg.first.rawIpData(),4);
  233. }
  234. outp.encrypt(p1p->cryptKey());
  235. outp.hmacSet(p1p->macKey());
  236. if (p1p->send(_r,outp.data(),outp.size(),now))
  237. p1p->onSent(_r,false,Packet::VERB_RENDEZVOUS,now);
  238. }
  239. { // tell p2 where to find p1
  240. Packet outp(p2,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  241. p1.appendTo(outp);
  242. outp.append((uint16_t)cg.second.port());
  243. if (cg.second.isV6()) {
  244. outp.append((unsigned char)16);
  245. outp.append(cg.second.rawIpData(),16);
  246. } else {
  247. outp.append((unsigned char)4);
  248. outp.append(cg.second.rawIpData(),4);
  249. }
  250. outp.encrypt(p2p->cryptKey());
  251. outp.hmacSet(p2p->macKey());
  252. if (p2p->send(_r,outp.data(),outp.size(),now))
  253. p2p->onSent(_r,false,Packet::VERB_RENDEZVOUS,now);
  254. }
  255. return true;
  256. }
  257. void Switch::contact(const SharedPtr<Peer> &peer,const InetAddress &atAddr)
  258. {
  259. Demarc::Port fromPort = _r->demarc->pick(atAddr);
  260. _r->demarc->send(fromPort,atAddr,"\0",1,ZT_FIREWALL_OPENER_HOPS);
  261. {
  262. Mutex::Lock _l(_contactQueue_m);
  263. _contactQueue.push_back(ContactQueueEntry(peer,Utils::now() + ZT_RENDEZVOUS_NAT_T_DELAY,fromPort,atAddr));
  264. }
  265. // Kick main loop out of wait so that it can pick up this
  266. // change to our scheduled timer tasks.
  267. _r->mainLoopWaitCondition.signal();
  268. }
  269. unsigned long Switch::doTimerTasks()
  270. {
  271. unsigned long nextDelay = ~((unsigned long)0); // big number, caller will cap return value
  272. uint64_t now = Utils::now();
  273. {
  274. Mutex::Lock _l(_contactQueue_m);
  275. for(std::list<ContactQueueEntry>::iterator qi(_contactQueue.begin());qi!=_contactQueue.end();) {
  276. if (now >= qi->fireAtTime) {
  277. TRACE("sending NAT-T HELLO to %s(%s)",qi->peer->address().toString().c_str(),qi->inaddr.toString().c_str());
  278. sendHELLO(qi->peer,qi->localPort,qi->inaddr);
  279. _contactQueue.erase(qi++);
  280. } else {
  281. nextDelay = std::min(nextDelay,(unsigned long)(qi->fireAtTime - now));
  282. ++qi;
  283. }
  284. }
  285. }
  286. {
  287. Mutex::Lock _l(_outstandingWhoisRequests_m);
  288. for(std::map< Address,WhoisRequest >::iterator i(_outstandingWhoisRequests.begin());i!=_outstandingWhoisRequests.end();) {
  289. unsigned long since = (unsigned long)(now - i->second.lastSent);
  290. if (since >= ZT_WHOIS_RETRY_DELAY) {
  291. if (i->second.retries >= ZT_MAX_WHOIS_RETRIES) {
  292. TRACE("WHOIS %s timed out",i->first.toString().c_str());
  293. _outstandingWhoisRequests.erase(i++);
  294. continue;
  295. } else {
  296. i->second.lastSent = now;
  297. i->second.peersConsulted[i->second.retries] = _sendWhoisRequest(i->first,i->second.peersConsulted,i->second.retries);
  298. ++i->second.retries;
  299. TRACE("WHOIS %s (retry %u)",i->first.toString().c_str(),i->second.retries);
  300. nextDelay = std::min(nextDelay,(unsigned long)ZT_WHOIS_RETRY_DELAY);
  301. }
  302. } else nextDelay = std::min(nextDelay,ZT_WHOIS_RETRY_DELAY - since);
  303. ++i;
  304. }
  305. }
  306. {
  307. Mutex::Lock _l(_txQueue_m);
  308. for(std::multimap< Address,TXQueueEntry >::iterator i(_txQueue.begin());i!=_txQueue.end();) {
  309. if (_trySend(i->second.packet,i->second.encrypt))
  310. _txQueue.erase(i++);
  311. else if ((now - i->second.creationTime) > ZT_TRANSMIT_QUEUE_TIMEOUT) {
  312. TRACE("TX %s -> %s timed out",i->second.packet.source().toString().c_str(),i->second.packet.destination().toString().c_str());
  313. _txQueue.erase(i++);
  314. } else ++i;
  315. }
  316. }
  317. {
  318. Mutex::Lock _l(_rxQueue_m);
  319. for(std::list< SharedPtr<PacketDecoder> >::iterator i(_rxQueue.begin());i!=_rxQueue.end();) {
  320. if ((now - (*i)->receiveTime()) > ZT_RECEIVE_QUEUE_TIMEOUT) {
  321. TRACE("RX %s -> %s timed out",(*i)->source().toString().c_str(),(*i)->destination().toString().c_str());
  322. _rxQueue.erase(i++);
  323. } else ++i;
  324. }
  325. }
  326. {
  327. Mutex::Lock _l(_defragQueue_m);
  328. for(std::map< uint64_t,DefragQueueEntry >::iterator i(_defragQueue.begin());i!=_defragQueue.end();) {
  329. if ((now - i->second.creationTime) > ZT_FRAGMENTED_PACKET_RECEIVE_TIMEOUT) {
  330. TRACE("incomplete fragmented packet %.16llx timed out, fragments discarded",i->first);
  331. _defragQueue.erase(i++);
  332. } else ++i;
  333. }
  334. }
  335. return std::max(nextDelay,(unsigned long)10); // minimum delay
  336. }
  337. void Switch::announceMulticastGroups(const std::map< SharedPtr<Network>,std::set<MulticastGroup> > &allMemberships)
  338. {
  339. std::vector< SharedPtr<Peer> > directPeers;
  340. _r->topology->eachPeer(Topology::CollectPeersWithActiveDirectPath(directPeers));
  341. #ifdef ZT_TRACE
  342. unsigned int totalMulticastGroups = 0;
  343. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator i(allMemberships.begin());i!=allMemberships.end();++i)
  344. totalMulticastGroups += (unsigned int)i->second.size();
  345. TRACE("announcing %u multicast groups for %u networks to %u peers",totalMulticastGroups,(unsigned int)allMemberships.size(),(unsigned int)directPeers.size());
  346. #endif
  347. for(std::vector< SharedPtr<Peer> >::iterator p(directPeers.begin());p!=directPeers.end();++p) {
  348. Packet outp((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  349. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator nwmgs(allMemberships.begin());nwmgs!=allMemberships.end();++nwmgs) {
  350. if ((_r->topology->isSupernode((*p)->address()))||(nwmgs->first->isAllowed((*p)->address()))) {
  351. for(std::set<MulticastGroup>::iterator mg(nwmgs->second.begin());mg!=nwmgs->second.end();++mg) {
  352. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  353. send(outp,true);
  354. outp.reset((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  355. }
  356. outp.append((uint64_t)nwmgs->first->id());
  357. outp.append(mg->mac().data,6);
  358. outp.append((uint32_t)mg->adi());
  359. }
  360. }
  361. }
  362. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  363. send(outp,true);
  364. }
  365. }
  366. void Switch::requestWhois(const Address &addr)
  367. {
  368. TRACE("requesting WHOIS for %s",addr.toString().c_str());
  369. {
  370. Mutex::Lock _l(_outstandingWhoisRequests_m);
  371. std::pair< std::map< Address,WhoisRequest >::iterator,bool > entry(_outstandingWhoisRequests.insert(std::pair<Address,WhoisRequest>(addr,WhoisRequest())));
  372. entry.first->second.lastSent = Utils::now();
  373. entry.first->second.retries = 0; // reset retry count if entry already existed
  374. }
  375. _sendWhoisRequest(addr,(const Address *)0,0);
  376. }
  377. void Switch::doAnythingWaitingForPeer(const SharedPtr<Peer> &peer)
  378. {
  379. {
  380. Mutex::Lock _l(_outstandingWhoisRequests_m);
  381. _outstandingWhoisRequests.erase(peer->address());
  382. }
  383. {
  384. Mutex::Lock _l(_rxQueue_m);
  385. for(std::list< SharedPtr<PacketDecoder> >::iterator rxi(_rxQueue.begin());rxi!=_rxQueue.end();) {
  386. if ((*rxi)->tryDecode(_r))
  387. _rxQueue.erase(rxi++);
  388. else ++rxi;
  389. }
  390. }
  391. {
  392. Mutex::Lock _l(_txQueue_m);
  393. std::pair< std::multimap< Address,TXQueueEntry >::iterator,std::multimap< Address,TXQueueEntry >::iterator > waitingTxQueueItems(_txQueue.equal_range(peer->address()));
  394. for(std::multimap< Address,TXQueueEntry >::iterator txi(waitingTxQueueItems.first);txi!=waitingTxQueueItems.second;) {
  395. if (_trySend(txi->second.packet,txi->second.encrypt))
  396. _txQueue.erase(txi++);
  397. else ++txi;
  398. }
  399. }
  400. }
  401. void Switch::_handleRemotePacketFragment(Demarc::Port localPort,const InetAddress &fromAddr,const Buffer<4096> &data)
  402. {
  403. Packet::Fragment fragment(data);
  404. Address destination(fragment.destination());
  405. if (destination != _r->identity.address()) {
  406. // Fragment is not for us, so try to relay it
  407. if (fragment.hops() < ZT_RELAY_MAX_HOPS) {
  408. fragment.incrementHops();
  409. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  410. if ((!relayTo)||(!relayTo->send(_r,fragment.data(),fragment.size(),Utils::now()))) {
  411. relayTo = _r->topology->getBestSupernode();
  412. if (relayTo)
  413. relayTo->send(_r,fragment.data(),fragment.size(),Utils::now());
  414. }
  415. } else {
  416. TRACE("dropped relay [fragment](%s) -> %s, max hops exceeded",fromAddr.toString().c_str(),destination.toString().c_str());
  417. }
  418. } else {
  419. // Fragment looks like ours
  420. uint64_t pid = fragment.packetId();
  421. unsigned int fno = fragment.fragmentNumber();
  422. unsigned int tf = fragment.totalFragments();
  423. if ((tf <= ZT_MAX_PACKET_FRAGMENTS)&&(fno < ZT_MAX_PACKET_FRAGMENTS)&&(fno > 0)&&(tf > 1)) {
  424. // Fragment appears basically sane. Its fragment number must be
  425. // 1 or more, since a Packet with fragmented bit set is fragment 0.
  426. // Total fragments must be more than 1, otherwise why are we
  427. // seeing a Packet::Fragment?
  428. Mutex::Lock _l(_defragQueue_m);
  429. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  430. if (dqe == _defragQueue.end()) {
  431. // We received a Packet::Fragment without its head, so queue it and wait
  432. DefragQueueEntry &dq = _defragQueue[pid];
  433. dq.creationTime = Utils::now();
  434. dq.frags[fno - 1] = fragment;
  435. dq.totalFragments = tf; // total fragment count is known
  436. dq.haveFragments = 1 << fno; // we have only this fragment
  437. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  438. } else if (!(dqe->second.haveFragments & (1 << fno))) {
  439. // We have other fragments and maybe the head, so add this one and check
  440. dqe->second.frags[fno - 1] = fragment;
  441. dqe->second.totalFragments = tf;
  442. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  443. if (Utils::countBits(dqe->second.haveFragments |= (1 << fno)) == tf) {
  444. // We have all fragments -- assemble and process full Packet
  445. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  446. SharedPtr<PacketDecoder> packet(dqe->second.frag0);
  447. for(unsigned int f=1;f<tf;++f)
  448. packet->append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  449. _defragQueue.erase(dqe);
  450. if (!packet->tryDecode(_r)) {
  451. Mutex::Lock _l(_rxQueue_m);
  452. _rxQueue.push_back(packet);
  453. }
  454. }
  455. } // else this is a duplicate fragment, ignore
  456. }
  457. }
  458. }
  459. void Switch::_handleRemotePacketHead(Demarc::Port localPort,const InetAddress &fromAddr,const Buffer<4096> &data)
  460. {
  461. SharedPtr<PacketDecoder> packet(new PacketDecoder(data,localPort,fromAddr));
  462. Address source(packet->source());
  463. Address destination(packet->destination());
  464. //TRACE("<< %.16llx %s -> %s (size: %u)",(unsigned long long)packet->packetId(),source.toString().c_str(),destination.toString().c_str(),packet->size());
  465. if (destination != _r->identity.address()) {
  466. // Packet is not for us, so try to relay it
  467. if (packet->hops() < ZT_RELAY_MAX_HOPS) {
  468. packet->incrementHops();
  469. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  470. if ((relayTo)&&(relayTo->send(_r,packet->data(),packet->size(),Utils::now()))) {
  471. // If we've relayed, this periodically tries to get them to
  472. // talk directly to save our bandwidth.
  473. unite(source,destination,false);
  474. } else {
  475. // If we've received a packet not for us and we don't have
  476. // a direct path to its recipient, pass it to (another)
  477. // supernode. This can happen due to Internet weather -- the
  478. // most direct supernode may not be reachable, yet another
  479. // further away may be.
  480. relayTo = _r->topology->getBestSupernode(&source,1,true);
  481. if (relayTo)
  482. relayTo->send(_r,packet->data(),packet->size(),Utils::now());
  483. }
  484. } else {
  485. TRACE("dropped relay %s(%s) -> %s, max hops exceeded",packet->source().toString().c_str(),fromAddr.toString().c_str(),destination.toString().c_str());
  486. }
  487. } else if (packet->fragmented()) {
  488. // Packet is the head of a fragmented packet series
  489. uint64_t pid = packet->packetId();
  490. Mutex::Lock _l(_defragQueue_m);
  491. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  492. if (dqe == _defragQueue.end()) {
  493. // If we have no other fragments yet, create an entry and save the head
  494. DefragQueueEntry &dq = _defragQueue[pid];
  495. dq.creationTime = Utils::now();
  496. dq.frag0 = packet;
  497. dq.totalFragments = 0; // 0 == unknown, waiting for Packet::Fragment
  498. dq.haveFragments = 1; // head is first bit (left to right)
  499. //TRACE("fragment (0/?) of %.16llx from %s",pid,fromAddr.toString().c_str());
  500. } else if (!(dqe->second.haveFragments & 1)) {
  501. // If we have other fragments but no head, see if we are complete with the head
  502. if ((dqe->second.totalFragments)&&(Utils::countBits(dqe->second.haveFragments |= 1) == dqe->second.totalFragments)) {
  503. // We have all fragments -- assemble and process full Packet
  504. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  505. // packet already contains head, so append fragments
  506. for(unsigned int f=1;f<dqe->second.totalFragments;++f)
  507. packet->append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  508. _defragQueue.erase(dqe);
  509. if (!packet->tryDecode(_r)) {
  510. Mutex::Lock _l(_rxQueue_m);
  511. _rxQueue.push_back(packet);
  512. }
  513. } else {
  514. // Still waiting on more fragments, so queue the head
  515. dqe->second.frag0 = packet;
  516. }
  517. } // else this is a duplicate head, ignore
  518. } else {
  519. // Packet is unfragmented, so just process it
  520. if (!packet->tryDecode(_r)) {
  521. Mutex::Lock _l(_rxQueue_m);
  522. _rxQueue.push_back(packet);
  523. }
  524. }
  525. }
  526. Address Switch::_sendWhoisRequest(const Address &addr,const Address *peersAlreadyConsulted,unsigned int numPeersAlreadyConsulted)
  527. {
  528. SharedPtr<Peer> supernode(_r->topology->getBestSupernode(peersAlreadyConsulted,numPeersAlreadyConsulted,false));
  529. if (supernode) {
  530. Packet outp(supernode->address(),_r->identity.address(),Packet::VERB_WHOIS);
  531. addr.appendTo(outp);
  532. outp.encrypt(supernode->cryptKey());
  533. outp.hmacSet(supernode->macKey());
  534. uint64_t now = Utils::now();
  535. if (supernode->send(_r,outp.data(),outp.size(),now)) {
  536. supernode->onSent(_r,false,Packet::VERB_WHOIS,now);
  537. return supernode->address();
  538. }
  539. }
  540. return Address();
  541. }
  542. bool Switch::_trySend(const Packet &packet,bool encrypt)
  543. {
  544. SharedPtr<Peer> peer(_r->topology->getPeer(packet.destination()));
  545. if (peer) {
  546. uint64_t now = Utils::now();
  547. bool isRelay;
  548. SharedPtr<Peer> via;
  549. if ((_r->topology->isSupernode(peer->address()))||(peer->hasActiveDirectPath(now))) {
  550. isRelay = false;
  551. via = peer;
  552. } else {
  553. isRelay = true;
  554. via = _r->topology->getBestSupernode();
  555. if (!via)
  556. return false;
  557. }
  558. Packet tmp(packet);
  559. unsigned int chunkSize = std::min(tmp.size(),(unsigned int)ZT_UDP_DEFAULT_PAYLOAD_MTU);
  560. tmp.setFragmented(chunkSize < tmp.size());
  561. if (encrypt)
  562. tmp.encrypt(peer->cryptKey());
  563. tmp.hmacSet(peer->macKey());
  564. if (via->send(_r,tmp.data(),chunkSize,now)) {
  565. if (chunkSize < tmp.size()) {
  566. // Too big for one bite, fragment the rest
  567. unsigned int fragStart = chunkSize;
  568. unsigned int remaining = tmp.size() - chunkSize;
  569. unsigned int fragsRemaining = (remaining / (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  570. if ((fragsRemaining * (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH)) < remaining)
  571. ++fragsRemaining;
  572. unsigned int totalFragments = fragsRemaining + 1;
  573. for(unsigned int f=0;f<fragsRemaining;++f) {
  574. chunkSize = std::min(remaining,(unsigned int)(ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  575. Packet::Fragment frag(tmp,fragStart,chunkSize,f + 1,totalFragments);
  576. if (!via->send(_r,frag.data(),frag.size(),now)) {
  577. TRACE("WARNING: packet send to %s failed on later fragment #%u (check IP layer buffer sizes?)",via->address().toString().c_str(),f + 1);
  578. }
  579. fragStart += chunkSize;
  580. remaining -= chunkSize;
  581. }
  582. }
  583. via->onSent(_r,isRelay,packet.verb(),now);
  584. return true;
  585. }
  586. return false;
  587. }
  588. requestWhois(packet.destination());
  589. return false;
  590. }
  591. } // namespace ZeroTier