2
0

Switch.cpp 43 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034
  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 "Switch.hpp"
  33. #include "Node.hpp"
  34. #include "EthernetTap.hpp"
  35. #include "InetAddress.hpp"
  36. #include "Topology.hpp"
  37. #include "RuntimeEnvironment.hpp"
  38. #include "Defaults.hpp"
  39. #include "Peer.hpp"
  40. #include "NodeConfig.hpp"
  41. #include "Demarc.hpp"
  42. #include "../version.h"
  43. namespace ZeroTier {
  44. Switch::Switch(const RuntimeEnvironment *renv) :
  45. _r(renv)
  46. {
  47. memset(_multicastHistory,0,sizeof(_multicastHistory));
  48. }
  49. Switch::~Switch()
  50. {
  51. }
  52. void Switch::onRemotePacket(Demarc::Port localPort,const InetAddress &fromAddr,const Buffer<4096> &data)
  53. {
  54. Packet packet;
  55. try {
  56. if (data.size() > ZT_PROTO_MIN_FRAGMENT_LENGTH) {
  57. // Message is long enough to be a Packet or Packet::Fragment
  58. if (data[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] == ZT_PACKET_FRAGMENT_INDICATOR) {
  59. // Looks like a Packet::Fragment
  60. Packet::Fragment fragment(data);
  61. Address destination(fragment.destination());
  62. if (destination != _r->identity.address()) {
  63. // Fragment is not for us, so try to relay it
  64. if (fragment.hops() < ZT_RELAY_MAX_HOPS) {
  65. fragment.incrementHops();
  66. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  67. if ((!relayTo)||(!relayTo->send(_r,fragment.data(),fragment.size(),true,Packet::VERB_NOP,Utils::now()))) {
  68. relayTo = _r->topology->getBestSupernode();
  69. if (relayTo)
  70. relayTo->send(_r,fragment.data(),fragment.size(),true,Packet::VERB_NOP,Utils::now());
  71. }
  72. } else {
  73. TRACE("dropped relay [fragment](%s) -> %s, max hops exceeded",fromAddr.toString().c_str(),destination.toString().c_str());
  74. }
  75. } else {
  76. // Fragment looks like ours
  77. uint64_t pid = fragment.packetId();
  78. unsigned int fno = fragment.fragmentNumber();
  79. unsigned int tf = fragment.totalFragments();
  80. if ((tf <= ZT_MAX_PACKET_FRAGMENTS)&&(fno < ZT_MAX_PACKET_FRAGMENTS)&&(fno > 0)&&(tf > 1)) {
  81. // Fragment appears basically sane. Its fragment number must be
  82. // 1 or more, since a Packet with fragmented bit set is fragment 0.
  83. // Total fragments must be more than 1, otherwise why are we
  84. // seeing a Packet::Fragment?
  85. Mutex::Lock _l(_defragQueue_m);
  86. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  87. if (dqe == _defragQueue.end()) {
  88. // We received a Packet::Fragment without its head, so queue it and wait
  89. DefragQueueEntry &dq = _defragQueue[pid];
  90. dq.creationTime = Utils::now();
  91. dq.frags[fno - 1] = fragment;
  92. dq.totalFragments = tf; // total fragment count is known
  93. dq.haveFragments = 1 << fno; // we have only this fragment
  94. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  95. } else if (!(dqe->second.haveFragments & (1 << fno))) {
  96. // We have other fragments and maybe the head, so add this one and check
  97. dqe->second.frags[fno - 1] = fragment;
  98. dqe->second.totalFragments = tf;
  99. //TRACE("fragment (%u/%u) of %.16llx from %s",fno + 1,tf,pid,fromAddr.toString().c_str());
  100. if (Utils::countBits(dqe->second.haveFragments |= (1 << fno)) == tf) {
  101. // We have all fragments -- assemble and process full Packet
  102. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  103. packet = dqe->second.frag0;
  104. for(unsigned int f=1;f<tf;++f)
  105. packet.append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  106. _defragQueue.erase(dqe);
  107. goto Switch_onRemotePacket_complete_packet_handler;
  108. }
  109. } // else this is a duplicate fragment, ignore
  110. }
  111. }
  112. } else if (data.size() > ZT_PROTO_MIN_PACKET_LENGTH) {
  113. // Looks like a Packet -- either unfragmented or a fragmented packet head
  114. packet = data;
  115. Address destination(packet.destination());
  116. if (destination != _r->identity.address()) {
  117. // Packet is not for us, so try to relay it
  118. if (packet.hops() < ZT_RELAY_MAX_HOPS) {
  119. packet.incrementHops();
  120. SharedPtr<Peer> relayTo = _r->topology->getPeer(destination);
  121. if ((relayTo)&&(relayTo->send(_r,packet.data(),packet.size(),true,Packet::VERB_NOP,Utils::now()))) {
  122. // TODO: don't unite immediately, wait until the peers have exchanged a packet or two
  123. unite(packet.source(),destination,false); // periodically try to get them to talk directly
  124. } else {
  125. relayTo = _r->topology->getBestSupernode();
  126. if (relayTo)
  127. relayTo->send(_r,packet.data(),packet.size(),true,Packet::VERB_NOP,Utils::now());
  128. }
  129. } else {
  130. TRACE("dropped relay %s(%s) -> %s, max hops exceeded",packet.source().toString().c_str(),fromAddr.toString().c_str(),destination.toString().c_str());
  131. }
  132. } else if (packet.fragmented()) {
  133. // Packet is the head of a fragmented packet series
  134. uint64_t pid = packet.packetId();
  135. Mutex::Lock _l(_defragQueue_m);
  136. std::map< uint64_t,DefragQueueEntry >::iterator dqe(_defragQueue.find(pid));
  137. if (dqe == _defragQueue.end()) {
  138. // If we have no other fragments yet, create an entry and save the head
  139. DefragQueueEntry &dq = _defragQueue[pid];
  140. dq.creationTime = Utils::now();
  141. dq.frag0 = packet;
  142. dq.totalFragments = 0; // 0 == unknown, waiting for Packet::Fragment
  143. dq.haveFragments = 1; // head is first bit (left to right)
  144. //TRACE("fragment (0/?) of %.16llx from %s",pid,fromAddr.toString().c_str());
  145. } else if (!(dqe->second.haveFragments & 1)) {
  146. // If we have other fragments but no head, see if we are complete with the head
  147. if ((dqe->second.totalFragments)&&(Utils::countBits(dqe->second.haveFragments |= 1) == dqe->second.totalFragments)) {
  148. // We have all fragments -- assemble and process full Packet
  149. //TRACE("packet %.16llx is complete, assembling and processing...",pid);
  150. // packet already contains head, so append fragments
  151. for(unsigned int f=1;f<dqe->second.totalFragments;++f)
  152. packet.append(dqe->second.frags[f - 1].payload(),dqe->second.frags[f - 1].payloadLength());
  153. _defragQueue.erase(dqe);
  154. goto Switch_onRemotePacket_complete_packet_handler;
  155. } else {
  156. // Still waiting on more fragments, so queue the head
  157. dqe->second.frag0 = packet;
  158. }
  159. } // else this is a duplicate head, ignore
  160. } else {
  161. // Packet is unfragmented, so just process it
  162. goto Switch_onRemotePacket_complete_packet_handler;
  163. }
  164. }
  165. }
  166. // If we made it here and didn't jump over, we either queued a fragment
  167. // or dropped an invalid or duplicate one. (The goto looks easier to
  168. // understand than having a million returns up there.)
  169. return;
  170. Switch_onRemotePacket_complete_packet_handler:
  171. // Packets that get here are ours and are fully assembled. Don't worry -- if
  172. // they are corrupt HMAC authentication will reject them later.
  173. {
  174. //TRACE("%s : %s -> %s",fromAddr.toString().c_str(),packet.source().toString().c_str(),packet.destination().toString().c_str());
  175. PacketServiceAttemptResult r = _tryHandleRemotePacket(localPort,fromAddr,packet);
  176. if (r != PACKET_SERVICE_ATTEMPT_OK) {
  177. Address source(packet.source());
  178. {
  179. Mutex::Lock _l(_rxQueue_m);
  180. std::multimap< Address,RXQueueEntry >::iterator qe(_rxQueue.insert(std::pair< Address,RXQueueEntry >(source,RXQueueEntry())));
  181. qe->second.creationTime = Utils::now();
  182. qe->second.packet = packet;
  183. qe->second.localPort = localPort;
  184. qe->second.fromAddr = fromAddr;
  185. }
  186. if (r == PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN)
  187. _requestWhois(source);
  188. }
  189. }
  190. } catch (std::exception &ex) {
  191. TRACE("dropped packet from %s: %s",fromAddr.toString().c_str(),ex.what());
  192. } catch ( ... ) {
  193. TRACE("dropped packet from %s: unexpected exception",fromAddr.toString().c_str());
  194. }
  195. }
  196. void Switch::onLocalEthernet(const SharedPtr<Network> &network,const MAC &from,const MAC &to,unsigned int etherType,const Buffer<4096> &data)
  197. {
  198. if (from != network->tap().mac()) {
  199. LOG("ignored tap: %s -> %s %s (bridging is not supported)",from.toString().c_str(),to.toString().c_str(),Utils::etherTypeName(etherType));
  200. return;
  201. }
  202. if (to == network->tap().mac()) {
  203. // Right thing to do? Will this ever happen?
  204. TRACE("weird OS behavior: ethernet frame received from self, reflecting");
  205. network->tap().put(from,to,etherType,data.data(),data.size());
  206. return;
  207. }
  208. if ((etherType != ZT_ETHERTYPE_ARP)&&(etherType != ZT_ETHERTYPE_IPV4)&&(etherType != ZT_ETHERTYPE_IPV6)) {
  209. LOG("ignored tap: %s -> %s %s (not a supported etherType)",from.toString().c_str(),to.toString().c_str(),Utils::etherTypeName(etherType));
  210. return;
  211. }
  212. if (to.isMulticast()) {
  213. MulticastGroup mg(to,0);
  214. if (to.isBroadcast()) {
  215. // Cram IPv4 IP into ADI field to make IPv4 ARP broadcast channel specific and scalable
  216. if ((etherType == ZT_ETHERTYPE_ARP)&&(data.size() == 28)&&(data[2] == 0x08)&&(data[3] == 0x00)&&(data[4] == 6)&&(data[5] == 4)&&(data[7] == 0x01))
  217. mg = MulticastGroup::deriveMulticastGroupForAddressResolution(InetAddress(data.field(24,4),4,0));
  218. }
  219. // Remember this message's CRC, but don't drop if we've already seen it
  220. // since it's our own.
  221. _checkAndUpdateMulticastHistory(from,mg.mac(),data.data(),data.size(),network->id(),Utils::now());
  222. // Start multicast propagation with empty bloom filter
  223. unsigned char bloom[ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE];
  224. memset(bloom,0,sizeof(bloom));
  225. _propagateMulticast(network,bloom,mg,0,0,from,etherType,data.data(),data.size());
  226. } else if (to.isZeroTier()) {
  227. // Simple unicast frame from us to another node
  228. Address toZT(to.data + 1);
  229. if (network->isAllowed(toZT)) {
  230. Packet outp(toZT,_r->identity.address(),Packet::VERB_FRAME);
  231. outp.append(network->id());
  232. outp.append((uint16_t)etherType);
  233. outp.append(data);
  234. outp.compress();
  235. send(outp,true);
  236. } else {
  237. TRACE("UNICAST: %s -> %s %s (dropped, destination not a member of closed network %llu)",from.toString().c_str(),to.toString().c_str(),Utils::etherTypeName(etherType),network->id());
  238. }
  239. } else {
  240. TRACE("UNICAST: %s -> %s %s (dropped, destination MAC not ZeroTier)",from.toString().c_str(),to.toString().c_str(),Utils::etherTypeName(etherType));
  241. }
  242. }
  243. void Switch::send(const Packet &packet,bool encrypt)
  244. {
  245. //TRACE("%.16llx %s -> %s (size: %u) (enc: %s)",packet.packetId(),Packet::verbString(packet.verb()),packet.destination().toString().c_str(),packet.size(),(encrypt ? "yes" : "no"));
  246. PacketServiceAttemptResult r = _trySend(packet,encrypt);
  247. if (r != PACKET_SERVICE_ATTEMPT_OK) {
  248. {
  249. Mutex::Lock _l(_txQueue_m);
  250. std::multimap< Address,TXQueueEntry >::iterator qe(_txQueue.insert(std::pair< Address,TXQueueEntry >(packet.destination(),TXQueueEntry())));
  251. qe->second.creationTime = Utils::now();
  252. qe->second.packet = packet;
  253. qe->second.encrypt = encrypt;
  254. }
  255. if (r == PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN)
  256. _requestWhois(packet.destination());
  257. }
  258. }
  259. void Switch::sendHELLO(const Address &dest)
  260. {
  261. Packet outp(dest,_r->identity.address(),Packet::VERB_HELLO);
  262. outp.append((unsigned char)ZT_PROTO_VERSION);
  263. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  264. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  265. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  266. outp.append(Utils::now());
  267. _r->identity.serialize(outp,false);
  268. send(outp,false);
  269. }
  270. bool Switch::sendHELLO(const SharedPtr<Peer> &dest,Demarc::Port localPort,const InetAddress &addr)
  271. {
  272. Packet outp(dest->address(),_r->identity.address(),Packet::VERB_HELLO);
  273. outp.append((unsigned char)ZT_PROTO_VERSION);
  274. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  275. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  276. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  277. outp.append(Utils::now());
  278. _r->identity.serialize(outp,false);
  279. outp.hmacSet(dest->macKey());
  280. return _r->demarc->send(localPort,addr,outp.data(),outp.size(),-1);
  281. }
  282. bool Switch::unite(const Address &p1,const Address &p2,bool force)
  283. {
  284. SharedPtr<Peer> p1p = _r->topology->getPeer(p1);
  285. if (!p1p)
  286. return false;
  287. SharedPtr<Peer> p2p = _r->topology->getPeer(p2);
  288. if (!p2p)
  289. return false;
  290. uint64_t now = Utils::now();
  291. std::pair<InetAddress,InetAddress> cg(Peer::findCommonGround(*p1p,*p2p,now));
  292. if (!(cg.first))
  293. return false;
  294. // Addresses are sorted in key for last unite attempt map for order
  295. // invariant lookup: (p1,p2) == (p2,p1)
  296. Array<Address,2> uniteKey;
  297. if (p1 >= p2) {
  298. uniteKey[0] = p2;
  299. uniteKey[1] = p1;
  300. } else {
  301. uniteKey[0] = p1;
  302. uniteKey[1] = p2;
  303. }
  304. {
  305. Mutex::Lock _l(_lastUniteAttempt_m);
  306. std::map< Array< Address,2 >,uint64_t >::const_iterator e(_lastUniteAttempt.find(uniteKey));
  307. if ((!force)&&(e != _lastUniteAttempt.end())&&((now - e->second) < ZT_MIN_UNITE_INTERVAL))
  308. return false;
  309. else _lastUniteAttempt[uniteKey] = now;
  310. }
  311. TRACE("unite: %s(%s) <> %s(%s)",p1.toString().c_str(),cg.second.toString().c_str(),p2.toString().c_str(),cg.first.toString().c_str());
  312. { // tell p1 where to find p2
  313. Packet outp(p1,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  314. outp.append(p2.data(),ZT_ADDRESS_LENGTH);
  315. outp.append((uint16_t)cg.first.port());
  316. if (cg.first.isV6()) {
  317. outp.append((unsigned char)16);
  318. outp.append(cg.first.rawIpData(),16);
  319. } else {
  320. outp.append((unsigned char)4);
  321. outp.append(cg.first.rawIpData(),4);
  322. }
  323. outp.encrypt(p1p->cryptKey());
  324. outp.hmacSet(p1p->macKey());
  325. p1p->send(_r,outp.data(),outp.size(),false,Packet::VERB_RENDEZVOUS,now);
  326. }
  327. { // tell p2 where to find p1
  328. Packet outp(p2,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  329. outp.append(p1.data(),ZT_ADDRESS_LENGTH);
  330. outp.append((uint16_t)cg.second.port());
  331. if (cg.second.isV6()) {
  332. outp.append((unsigned char)16);
  333. outp.append(cg.second.rawIpData(),16);
  334. } else {
  335. outp.append((unsigned char)4);
  336. outp.append(cg.second.rawIpData(),4);
  337. }
  338. outp.encrypt(p2p->cryptKey());
  339. outp.hmacSet(p2p->macKey());
  340. p2p->send(_r,outp.data(),outp.size(),false,Packet::VERB_RENDEZVOUS,now);
  341. }
  342. return true;
  343. }
  344. unsigned long Switch::doTimerTasks()
  345. {
  346. unsigned long nextDelay = ~((unsigned long)0); // big number, caller will cap return value
  347. uint64_t now = Utils::now();
  348. {
  349. Mutex::Lock _l(_rendezvousQueue_m);
  350. for(std::map< Address,RendezvousQueueEntry >::iterator i(_rendezvousQueue.begin());i!=_rendezvousQueue.end();) {
  351. if (now >= i->second.fireAtTime) {
  352. SharedPtr<Peer> withPeer = _r->topology->getPeer(i->first);
  353. if (withPeer) {
  354. TRACE("sending NAT-T HELLO to %s(%s)",i->first.toString().c_str(),i->second.inaddr.toString().c_str());
  355. sendHELLO(withPeer,i->second.localPort,i->second.inaddr);
  356. }
  357. _rendezvousQueue.erase(i++);
  358. } else {
  359. nextDelay = std::min(nextDelay,(unsigned long)(i->second.fireAtTime - now));
  360. ++i;
  361. }
  362. }
  363. }
  364. {
  365. Mutex::Lock _l(_outstandingWhoisRequests_m);
  366. for(std::map< Address,WhoisRequest >::iterator i(_outstandingWhoisRequests.begin());i!=_outstandingWhoisRequests.end();) {
  367. unsigned long since = (unsigned long)(now - i->second.lastSent);
  368. if (since >= ZT_WHOIS_RETRY_DELAY) {
  369. if (i->second.retries >= ZT_MAX_WHOIS_RETRIES) {
  370. TRACE("WHOIS %s timed out",i->first.toString().c_str());
  371. _outstandingWhoisRequests.erase(i++);
  372. continue;
  373. } else {
  374. i->second.lastSent = now;
  375. i->second.peersConsulted[i->second.retries] = _sendWhoisRequest(i->first,i->second.peersConsulted,i->second.retries);
  376. ++i->second.retries;
  377. TRACE("WHOIS %s (retry %u)",i->first.toString().c_str(),i->second.retries);
  378. nextDelay = std::min(nextDelay,(unsigned long)ZT_WHOIS_RETRY_DELAY);
  379. }
  380. } else nextDelay = std::min(nextDelay,ZT_WHOIS_RETRY_DELAY - since);
  381. ++i;
  382. }
  383. }
  384. {
  385. Mutex::Lock _l(_txQueue_m);
  386. for(std::multimap< Address,TXQueueEntry >::iterator i(_txQueue.begin());i!=_txQueue.end();) {
  387. if (_trySend(i->second.packet,i->second.encrypt) == PACKET_SERVICE_ATTEMPT_OK)
  388. _txQueue.erase(i++);
  389. else if ((now - i->second.creationTime) > ZT_TRANSMIT_QUEUE_TIMEOUT) {
  390. TRACE("TX %s -> %s timed out",i->second.packet.source().toString().c_str(),i->second.packet.destination().toString().c_str());
  391. _txQueue.erase(i++);
  392. } else ++i;
  393. }
  394. }
  395. {
  396. Mutex::Lock _l(_rxQueue_m);
  397. for(std::multimap< Address,RXQueueEntry >::iterator i(_rxQueue.begin());i!=_rxQueue.end();) {
  398. if ((now - i->second.creationTime) > ZT_RECEIVE_QUEUE_TIMEOUT) {
  399. TRACE("RX from %s timed out waiting for WHOIS",i->second.packet.source().toString().c_str());
  400. _rxQueue.erase(i++);
  401. } else ++i;
  402. }
  403. }
  404. {
  405. Mutex::Lock _l(_defragQueue_m);
  406. for(std::map< uint64_t,DefragQueueEntry >::iterator i(_defragQueue.begin());i!=_defragQueue.end();) {
  407. if ((now - i->second.creationTime) > ZT_FRAGMENTED_PACKET_RECEIVE_TIMEOUT) {
  408. TRACE("incomplete fragmented packet %.16llx timed out, fragments discarded",i->first);
  409. _defragQueue.erase(i++);
  410. } else ++i;
  411. }
  412. }
  413. return std::max(nextDelay,(unsigned long)50); // minimum delay
  414. }
  415. void Switch::announceMulticastGroups(const std::map< SharedPtr<Network>,std::set<MulticastGroup> > &allMemberships)
  416. {
  417. std::vector< SharedPtr<Peer> > directPeers;
  418. _r->topology->eachPeer(Topology::CollectPeersWithActiveDirectPath(directPeers));
  419. #ifdef ZT_TRACE
  420. unsigned int totalMulticastGroups = 0;
  421. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator i(allMemberships.begin());i!=allMemberships.end();++i)
  422. totalMulticastGroups += (unsigned int)i->second.size();
  423. TRACE("announcing %u multicast groups for %u networks to %u peers",totalMulticastGroups,(unsigned int)allMemberships.size(),(unsigned int)directPeers.size());
  424. #endif
  425. for(std::vector< SharedPtr<Peer> >::iterator p(directPeers.begin());p!=directPeers.end();++p) {
  426. Packet outp((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  427. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator nwmgs(allMemberships.begin());nwmgs!=allMemberships.end();++nwmgs) {
  428. if ((nwmgs->first->open())||(_r->topology->isSupernode((*p)->address()))||(nwmgs->first->isMember((*p)->address()))) {
  429. for(std::set<MulticastGroup>::iterator mg(nwmgs->second.begin());mg!=nwmgs->second.end();++mg) {
  430. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  431. send(outp,true);
  432. outp.reset((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  433. }
  434. outp.append((uint64_t)nwmgs->first->id());
  435. outp.append(mg->mac().data,6);
  436. outp.append((uint32_t)mg->adi());
  437. }
  438. }
  439. }
  440. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  441. send(outp,true);
  442. }
  443. }
  444. void Switch::_CBaddPeerFromHello(void *arg,const SharedPtr<Peer> &p,Topology::PeerVerifyResult result)
  445. {
  446. _CBaddPeerFromHello_Data *req = (_CBaddPeerFromHello_Data *)arg;
  447. const RuntimeEnvironment *_r = req->parent->_r;
  448. switch(result) {
  449. case Topology::PEER_VERIFY_ACCEPTED_NEW:
  450. case Topology::PEER_VERIFY_ACCEPTED_ALREADY_HAVE:
  451. case Topology::PEER_VERIFY_ACCEPTED_DISPLACED_INVALID_ADDRESS: {
  452. Packet outp(req->source,_r->identity.address(),Packet::VERB_OK);
  453. outp.append((unsigned char)Packet::VERB_HELLO);
  454. outp.append(req->helloPacketId);
  455. outp.append(req->helloTimestamp);
  456. outp.encrypt(p->cryptKey());
  457. outp.hmacSet(p->macKey());
  458. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  459. } break;
  460. case Topology::PEER_VERIFY_REJECTED_INVALID_IDENTITY: {
  461. Packet outp(req->source,_r->identity.address(),Packet::VERB_ERROR);
  462. outp.append((unsigned char)Packet::VERB_HELLO);
  463. outp.append(req->helloPacketId);
  464. outp.append((unsigned char)Packet::ERROR_IDENTITY_INVALID);
  465. outp.encrypt(p->cryptKey());
  466. outp.hmacSet(p->macKey());
  467. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  468. } break;
  469. case Topology::PEER_VERIFY_REJECTED_DUPLICATE:
  470. case Topology::PEER_VERIFY_REJECTED_DUPLICATE_TRIAGED: {
  471. Packet outp(req->source,_r->identity.address(),Packet::VERB_ERROR);
  472. outp.append((unsigned char)Packet::VERB_HELLO);
  473. outp.append(req->helloPacketId);
  474. outp.append((unsigned char)Packet::ERROR_IDENTITY_COLLISION);
  475. outp.encrypt(p->cryptKey());
  476. outp.hmacSet(p->macKey());
  477. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  478. } break;
  479. }
  480. delete req;
  481. }
  482. void Switch::_CBaddPeerFromWhois(void *arg,const SharedPtr<Peer> &p,Topology::PeerVerifyResult result)
  483. {
  484. Switch *d = (Switch *)arg;
  485. switch(result) {
  486. case Topology::PEER_VERIFY_ACCEPTED_NEW:
  487. case Topology::PEER_VERIFY_ACCEPTED_ALREADY_HAVE:
  488. case Topology::PEER_VERIFY_ACCEPTED_DISPLACED_INVALID_ADDRESS:
  489. d->_outstandingWhoisRequests_m.lock();
  490. d->_outstandingWhoisRequests.erase(p->identity().address());
  491. d->_outstandingWhoisRequests_m.unlock();
  492. d->_retryPendingFor(p->identity().address());
  493. break;
  494. default:
  495. break;
  496. }
  497. }
  498. void Switch::_propagateMulticast(const SharedPtr<Network> &network,unsigned char *bloom,const MulticastGroup &mg,unsigned int mcHops,unsigned int mcLoadFactor,const MAC &from,unsigned int etherType,const void *data,unsigned int len)
  499. {
  500. SharedPtr<Peer> propPeers[ZT_MULTICAST_PROPAGATION_BREADTH];
  501. unsigned int np = _r->topology->pickMulticastPropagationPeers(network->id(),Address(),bloom,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE * 8,ZT_MULTICAST_PROPAGATION_BREADTH,mg,propPeers);
  502. for(unsigned int i=0;i<np;++i)
  503. Utils::bloomAdd(bloom,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE,propPeers[i]->address().sum());
  504. for(unsigned int i=0;i<np;++i) {
  505. Packet outp(propPeers[i]->address(),_r->identity.address(),Packet::VERB_MULTICAST_FRAME);
  506. outp.append(network->id());
  507. outp.append(mg.mac().data,6);
  508. outp.append((uint32_t)mg.adi());
  509. outp.append(bloom,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE);
  510. outp.append((uint8_t)mcHops);
  511. outp.append((uint16_t)mcLoadFactor);
  512. outp.append(from.data,6);
  513. outp.append((uint16_t)etherType);
  514. outp.append(data,len);
  515. outp.compress();
  516. send(outp,true);
  517. }
  518. }
  519. Switch::PacketServiceAttemptResult Switch::_tryHandleRemotePacket(Demarc::Port localPort,const InetAddress &fromAddr,Packet &packet)
  520. {
  521. // NOTE: We assume any packet that's made it here is for us. If it's not it
  522. // will fail HMAC validation and be discarded anyway, amounting to a second
  523. // layer of sanity checking.
  524. Address source(packet.source());
  525. if ((!packet.encrypted())&&(packet.verb() == Packet::VERB_HELLO)) {
  526. // Unencrypted HELLOs are handled here since they are used to
  527. // populate our identity cache in the first place. Thus we might get
  528. // a HELLO for someone for whom we don't have a Peer record.
  529. TRACE("HELLO from %s(%s)",source.toString().c_str(),fromAddr.toString().c_str());
  530. _doHELLO(localPort,fromAddr,packet);
  531. return PACKET_SERVICE_ATTEMPT_OK;
  532. }
  533. SharedPtr<Peer> peer = _r->topology->getPeer(source);
  534. if (peer) {
  535. uint64_t now = Utils::now();
  536. unsigned int latency = 0;
  537. if (!packet.hmacVerify(peer->macKey())) {
  538. TRACE("dropped packet from %s(%s), HMAC authentication failed (size: %u)",source.toString().c_str(),fromAddr.toString().c_str(),packet.size());
  539. return PACKET_SERVICE_ATTEMPT_OK;
  540. }
  541. if (packet.encrypted()) {
  542. packet.decrypt(peer->cryptKey());
  543. } else if (packet.verb() != Packet::VERB_NOP) {
  544. TRACE("ODD: %s from %s wasn't encrypted",Packet::verbString(packet.verb()),source.toString().c_str());
  545. }
  546. if (!packet.uncompress()) {
  547. TRACE("dropped packet from %s(%s), compressed data invalid",source.toString().c_str(),fromAddr.toString().c_str());
  548. return PACKET_SERVICE_ATTEMPT_OK;
  549. }
  550. switch(packet.verb()) {
  551. case Packet::VERB_NOP: // these are sent for NAT-t
  552. TRACE("NOP from %s(%s) (probably NAT-t)",source.toString().c_str(),fromAddr.toString().c_str());
  553. break;
  554. case Packet::VERB_HELLO: // usually they're handled up top, but technically an encrypted HELLO is legal
  555. _doHELLO(localPort,fromAddr,packet);
  556. break;
  557. case Packet::VERB_ERROR:
  558. try {
  559. #ifdef ZT_TRACE
  560. Packet::Verb inReVerb = (Packet::Verb)packet[ZT_PROTO_VERB_ERROR_IDX_IN_RE_VERB];
  561. Packet::ErrorCode errorCode = (Packet::ErrorCode)packet[ZT_PROTO_VERB_ERROR_IDX_ERROR_CODE];
  562. TRACE("ERROR %s from %s in-re %s",Packet::errorString(errorCode),source.toString().c_str(),Packet::verbString(inReVerb));
  563. #endif
  564. // TODO: handle key errors, such as duplicate identity
  565. } catch (std::exception &ex) {
  566. TRACE("dropped ERROR from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  567. } catch ( ... ) {
  568. TRACE("dropped ERROR from %s: unexpected exception: (unknown)",source.toString().c_str());
  569. }
  570. break;
  571. case Packet::VERB_OK:
  572. try {
  573. Packet::Verb inReVerb = (Packet::Verb)packet[ZT_PROTO_VERB_OK_IDX_IN_RE_VERB];
  574. switch(inReVerb) {
  575. case Packet::VERB_HELLO:
  576. latency = std::min((unsigned int)(now - packet.at<uint64_t>(ZT_PROTO_VERB_HELLO__OK__IDX_TIMESTAMP)),(unsigned int)0xffff);
  577. TRACE("OK(HELLO), latency to %s: %u",source.toString().c_str(),latency);
  578. break;
  579. case Packet::VERB_WHOIS:
  580. // Right now we only query supernodes for WHOIS and only accept
  581. // OK back from them. If we query other nodes, we'll have to
  582. // do something to prevent WHOIS cache poisoning such as
  583. // using the packet ID field in the OK packet to match with the
  584. // original query. Technically we should be doing this anyway.
  585. if (_r->topology->isSupernode(source))
  586. _r->topology->addPeer(SharedPtr<Peer>(new Peer(_r->identity,Identity(packet,ZT_PROTO_VERB_WHOIS__OK__IDX_IDENTITY))),&Switch::_CBaddPeerFromWhois,this);
  587. break;
  588. default:
  589. break;
  590. }
  591. } catch (std::exception &ex) {
  592. TRACE("dropped OK from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  593. } catch ( ... ) {
  594. TRACE("dropped OK from %s: unexpected exception: (unknown)",source.toString().c_str());
  595. }
  596. break;
  597. case Packet::VERB_WHOIS: {
  598. if (packet.payloadLength() == ZT_ADDRESS_LENGTH) {
  599. SharedPtr<Peer> p(_r->topology->getPeer(Address(packet.payload())));
  600. if (p) {
  601. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  602. outp.append((unsigned char)Packet::VERB_WHOIS);
  603. outp.append(packet.packetId());
  604. p->identity().serialize(outp,false);
  605. outp.encrypt(peer->cryptKey());
  606. outp.hmacSet(peer->macKey());
  607. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  608. TRACE("sent WHOIS response to %s for %s",source.toString().c_str(),Address(packet.payload()).toString().c_str());
  609. } else {
  610. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  611. outp.append((unsigned char)Packet::VERB_WHOIS);
  612. outp.append(packet.packetId());
  613. outp.append((unsigned char)Packet::ERROR_NOT_FOUND);
  614. outp.append(packet.payload(),ZT_ADDRESS_LENGTH);
  615. outp.encrypt(peer->cryptKey());
  616. outp.hmacSet(peer->macKey());
  617. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  618. TRACE("sent WHOIS ERROR to %s for %s (not found)",source.toString().c_str(),Address(packet.payload()).toString().c_str());
  619. }
  620. } else {
  621. TRACE("dropped WHOIS from %s: missing or invalid address",source.toString().c_str());
  622. }
  623. } break;
  624. case Packet::VERB_RENDEZVOUS:
  625. try {
  626. Address with(packet.field(ZT_PROTO_VERB_RENDEZVOUS_IDX_ZTADDRESS,ZT_ADDRESS_LENGTH));
  627. RendezvousQueueEntry qe;
  628. if (_r->topology->getPeer(with)) {
  629. unsigned int port = packet.at<uint16_t>(ZT_PROTO_VERB_RENDEZVOUS_IDX_PORT);
  630. unsigned int addrlen = packet[ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRLEN];
  631. if ((port > 0)&&((addrlen == 4)||(addrlen == 16))) {
  632. qe.inaddr.set(packet.field(ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRESS,addrlen),addrlen,port);
  633. qe.fireAtTime = now + ZT_RENDEZVOUS_NAT_T_DELAY; // then send real packet in a few ms
  634. qe.localPort = _r->demarc->pick(qe.inaddr);
  635. TRACE("RENDEZVOUS from %s says %s might be at %s, starting NAT-t",source.toString().c_str(),with.toString().c_str(),qe.inaddr.toString().c_str());
  636. _r->demarc->send(qe.localPort,qe.inaddr,"\0",1,ZT_FIREWALL_OPENER_HOPS); // start with firewall opener
  637. {
  638. Mutex::Lock _l(_rendezvousQueue_m);
  639. _rendezvousQueue[with] = qe;
  640. }
  641. } else {
  642. TRACE("dropped corrupt RENDEZVOUS from %s (bad address or port)",source.toString().c_str());
  643. }
  644. } else {
  645. TRACE("ignored RENDEZVOUS from %s for unknown peer %s",source.toString().c_str(),with.toString().c_str());
  646. }
  647. } catch (std::exception &ex) {
  648. TRACE("dropped RENDEZVOUS from %s: %s",source.toString().c_str(),ex.what());
  649. } catch ( ... ) {
  650. TRACE("dropped RENDEZVOUS from %s: unexpected exception",source.toString().c_str());
  651. }
  652. break;
  653. case Packet::VERB_FRAME:
  654. try {
  655. SharedPtr<Network> network(_r->nc->network(packet.at<uint64_t>(ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID)));
  656. if (network) {
  657. if (network->isAllowed(source)) {
  658. unsigned int etherType = packet.at<uint16_t>(ZT_PROTO_VERB_FRAME_IDX_ETHERTYPE);
  659. if ((etherType != ZT_ETHERTYPE_ARP)&&(etherType != ZT_ETHERTYPE_IPV4)&&(etherType != ZT_ETHERTYPE_IPV6)) {
  660. TRACE("dropped FRAME from %s: unsupported ethertype",source.toString().c_str());
  661. } else if (packet.size() > ZT_PROTO_VERB_FRAME_IDX_PAYLOAD) {
  662. network->tap().put(source.toMAC(),network->tap().mac(),etherType,packet.data() + ZT_PROTO_VERB_FRAME_IDX_PAYLOAD,packet.size() - ZT_PROTO_VERB_FRAME_IDX_PAYLOAD);
  663. }
  664. } else {
  665. TRACE("dropped FRAME from %s: not a member of closed network %llu",source.toString().c_str(),network->id());
  666. }
  667. } else {
  668. TRACE("dropped FRAME from %s: network %llu unknown",source.toString().c_str(),packet.at<uint64_t>(ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID));
  669. }
  670. } catch (std::exception &ex) {
  671. TRACE("dropped FRAME from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  672. } catch ( ... ) {
  673. TRACE("dropped FRAME from %s: unexpected exception: (unknown)",source.toString().c_str());
  674. }
  675. break;
  676. case Packet::VERB_MULTICAST_FRAME:
  677. try {
  678. SharedPtr<Network> network(_r->nc->network(packet.at<uint64_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_NETWORK_ID)));
  679. if (network) {
  680. if (network->isAllowed(source)) {
  681. if (packet.size() > ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD) {
  682. MulticastGroup mg(MAC(packet.field(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_MULTICAST_MAC,6)),packet.at<uint32_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_ADI));
  683. unsigned char bloom[ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE];
  684. memcpy(bloom,packet.field(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_BLOOM,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE),ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE);
  685. unsigned int hops = packet[ZT_PROTO_VERB_MULTICAST_FRAME_IDX_HOPS];
  686. unsigned int loadFactor = packet.at<uint16_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_LOAD_FACTOR);
  687. MAC fromMac(packet.field(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_FROM_MAC,6));
  688. unsigned int etherType = packet.at<uint16_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_ETHERTYPE);
  689. if ((fromMac.isZeroTier())&&(network->isAllowed(Address(fromMac)))) {
  690. if (_checkAndUpdateMulticastHistory(fromMac,mg.mac(),packet.data() + ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD,packet.size() - ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD,network->id(),now)) {
  691. TRACE("dropped MULTICAST_FRAME from %s: duplicate multicast",source.toString().c_str());
  692. } else {
  693. //TRACE("MULTICAST_FRAME: %s -> %s (adi: %.8lx), %u bytes, net: %llu",fromMac.toString().c_str(),mg.mac().toString().c_str(),(unsigned long)mg.adi(),packet.size() - ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD,network->id());
  694. network->tap().put(fromMac,mg.mac(),etherType,packet.data() + ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD,packet.size() - ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD);
  695. // TODO: implement load factor based propagation rate limitation
  696. // How it will work: each node will adjust loadFactor based on
  697. // its current load of multicast traffic. Then it will probabilistically
  698. // fail to propagate, with the probability being based on load factor.
  699. // This will need some in-the-field testing and tuning to get right.
  700. _propagateMulticast(network,bloom,mg,hops+1,loadFactor,fromMac,etherType,packet.data() + ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD,packet.size() - ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD);
  701. }
  702. } else {
  703. TRACE("dropped MULTICAST_FRAME from %s: ultimate sender %s not a member of closed network %llu",source.toString().c_str(),fromMac.toString().c_str(),network->id());
  704. }
  705. }
  706. } else {
  707. TRACE("dropped MULTICAST_FRAME from %s: not a member of closed network %llu",source.toString().c_str(),network->id());
  708. }
  709. } else {
  710. TRACE("dropped MULTICAST_FRAME from %s: network %llu unknown",source.toString().c_str(),packet.at<uint64_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_NETWORK_ID));
  711. }
  712. } catch (std::exception &ex) {
  713. TRACE("dropped MULTICAST_FRAME from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  714. } catch ( ... ) {
  715. TRACE("dropped MULTICAST_FRAME from %s: unexpected exception: (unknown)",source.toString().c_str());
  716. }
  717. break;
  718. case Packet::VERB_MULTICAST_LIKE:
  719. try {
  720. unsigned int ptr = ZT_PACKET_IDX_PAYLOAD;
  721. unsigned int numAccepted = 0;
  722. while ((ptr + 18) <= packet.size()) {
  723. uint64_t nwid = packet.at<uint64_t>(ptr); ptr += 8;
  724. SharedPtr<Network> network(_r->nc->network(nwid));
  725. if (network) {
  726. if (network->isAllowed(source)) {
  727. MAC mac(packet.field(ptr,6)); ptr += 6;
  728. uint32_t adi = packet.at<uint32_t>(ptr); ptr += 4;
  729. TRACE("peer %s likes multicast group %s:%.8lx on network %llu",source.toString().c_str(),mac.toString().c_str(),(unsigned long)adi,nwid);
  730. _r->topology->likesMulticastGroup(nwid,MulticastGroup(mac,adi),source,now);
  731. ++numAccepted;
  732. } else {
  733. TRACE("ignored MULTICAST_LIKE from %s: not a member of closed network %llu",source.toString().c_str(),nwid);
  734. }
  735. } else {
  736. TRACE("ignored MULTICAST_LIKE from %s: network %llu unknown",source.toString().c_str(),nwid);
  737. }
  738. }
  739. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  740. outp.append((unsigned char)Packet::VERB_MULTICAST_LIKE);
  741. outp.append(packet.packetId());
  742. outp.append((uint16_t)numAccepted);
  743. outp.encrypt(peer->cryptKey());
  744. outp.hmacSet(peer->macKey());
  745. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  746. } catch (std::exception &ex) {
  747. TRACE("dropped MULTICAST_LIKE from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  748. } catch ( ... ) {
  749. TRACE("dropped MULTICAST_LIKE from %s: unexpected exception: (unknown)",source.toString().c_str());
  750. }
  751. break;
  752. default:
  753. TRACE("ignored unrecognized verb %.2x from %s",(unsigned int)packet.verb(),source.toString().c_str());
  754. break;
  755. }
  756. // Update peer timestamps and learn new links
  757. peer->onReceive(_r,localPort,fromAddr,latency,packet.hops(),packet.verb(),now);
  758. } else return PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN;
  759. return PACKET_SERVICE_ATTEMPT_OK;
  760. }
  761. void Switch::_doHELLO(Demarc::Port localPort,const InetAddress &fromAddr,Packet &packet)
  762. {
  763. Address source(packet.source());
  764. try {
  765. unsigned int protoVersion = packet[ZT_PROTO_VERB_HELLO_IDX_PROTOCOL_VERSION];
  766. unsigned int vMajor = packet[ZT_PROTO_VERB_HELLO_IDX_MAJOR_VERSION];
  767. unsigned int vMinor = packet[ZT_PROTO_VERB_HELLO_IDX_MINOR_VERSION];
  768. unsigned int vRevision = packet.at<uint16_t>(ZT_PROTO_VERB_HELLO_IDX_REVISION);
  769. uint64_t timestamp = packet.at<uint64_t>(ZT_PROTO_VERB_HELLO_IDX_TIMESTAMP);
  770. Identity id(packet,ZT_PROTO_VERB_HELLO_IDX_IDENTITY);
  771. SharedPtr<Peer> candidate(new Peer(_r->identity,id));
  772. candidate->setPathAddress(fromAddr,false);
  773. // Initial sniff test
  774. if (protoVersion != ZT_PROTO_VERSION) {
  775. TRACE("rejected HELLO from %s(%s): invalid protocol version",source.toString().c_str(),fromAddr.toString().c_str());
  776. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  777. outp.append((unsigned char)Packet::VERB_HELLO);
  778. outp.append(packet.packetId());
  779. outp.append((unsigned char)Packet::ERROR_BAD_PROTOCOL_VERSION);
  780. outp.encrypt(candidate->cryptKey());
  781. outp.hmacSet(candidate->macKey());
  782. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  783. return;
  784. }
  785. if (id.address().isReserved()) {
  786. TRACE("rejected HELLO from %s(%s): identity has reserved address",source.toString().c_str(),fromAddr.toString().c_str());
  787. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  788. outp.append((unsigned char)Packet::VERB_HELLO);
  789. outp.append(packet.packetId());
  790. outp.append((unsigned char)Packet::ERROR_IDENTITY_INVALID);
  791. outp.encrypt(candidate->cryptKey());
  792. outp.hmacSet(candidate->macKey());
  793. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  794. return;
  795. }
  796. if (id.address() != source) {
  797. TRACE("rejected HELLO from %s(%s): identity is not for sender of packet (HELLO is a self-announcement)",source.toString().c_str(),fromAddr.toString().c_str());
  798. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  799. outp.append((unsigned char)Packet::VERB_HELLO);
  800. outp.append(packet.packetId());
  801. outp.append((unsigned char)Packet::ERROR_INVALID_REQUEST);
  802. outp.encrypt(candidate->cryptKey());
  803. outp.hmacSet(candidate->macKey());
  804. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  805. return;
  806. }
  807. // Is this a HELLO for a peer we already know? If so just update its
  808. // packet receive stats and send an OK.
  809. SharedPtr<Peer> existingPeer(_r->topology->getPeer(id.address()));
  810. if ((existingPeer)&&(existingPeer->identity() == id)) {
  811. existingPeer->onReceive(_r,localPort,fromAddr,0,packet.hops(),Packet::VERB_HELLO,Utils::now());
  812. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  813. outp.append((unsigned char)Packet::VERB_HELLO);
  814. outp.append(packet.packetId());
  815. outp.append(timestamp);
  816. outp.encrypt(existingPeer->cryptKey());
  817. outp.hmacSet(existingPeer->macKey());
  818. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  819. return;
  820. }
  821. // Otherwise we call addPeer() and set up a callback to handle the verdict
  822. _CBaddPeerFromHello_Data *arg = new _CBaddPeerFromHello_Data;
  823. arg->parent = this;
  824. arg->source = source;
  825. arg->fromAddr = fromAddr;
  826. arg->localPort = localPort;
  827. arg->vMajor = vMajor;
  828. arg->vMinor = vMinor;
  829. arg->vRevision = vRevision;
  830. arg->helloPacketId = packet.packetId();
  831. arg->helloTimestamp = timestamp;
  832. _r->topology->addPeer(candidate,&Switch::_CBaddPeerFromHello,arg);
  833. } catch (std::exception &ex) {
  834. TRACE("dropped HELLO from %s(%s): %s",source.toString().c_str(),fromAddr.toString().c_str(),ex.what());
  835. } catch ( ... ) {
  836. TRACE("dropped HELLO from %s(%s): unexpected exception",source.toString().c_str(),fromAddr.toString().c_str());
  837. }
  838. }
  839. void Switch::_requestWhois(const Address &addr)
  840. {
  841. TRACE("requesting WHOIS for %s",addr.toString().c_str());
  842. _sendWhoisRequest(addr,(const Address *)0,0);
  843. Mutex::Lock _l(_outstandingWhoisRequests_m);
  844. std::pair< std::map< Address,WhoisRequest >::iterator,bool > entry(_outstandingWhoisRequests.insert(std::pair<Address,WhoisRequest>(addr,WhoisRequest())));
  845. entry.first->second.lastSent = Utils::now();
  846. entry.first->second.retries = 0; // reset retry count if entry already existed
  847. }
  848. Address Switch::_sendWhoisRequest(const Address &addr,const Address *peersAlreadyConsulted,unsigned int numPeersAlreadyConsulted)
  849. {
  850. SharedPtr<Peer> supernode(_r->topology->getBestSupernode(peersAlreadyConsulted,numPeersAlreadyConsulted));
  851. if (supernode) {
  852. Packet outp(supernode->address(),_r->identity.address(),Packet::VERB_WHOIS);
  853. outp.append(addr.data(),ZT_ADDRESS_LENGTH);
  854. outp.encrypt(supernode->cryptKey());
  855. outp.hmacSet(supernode->macKey());
  856. supernode->send(_r,outp.data(),outp.size(),false,Packet::VERB_WHOIS,Utils::now());
  857. return supernode->address();
  858. }
  859. return Address();
  860. }
  861. Switch::PacketServiceAttemptResult Switch::_trySend(const Packet &packet,bool encrypt)
  862. {
  863. SharedPtr<Peer> peer(_r->topology->getPeer(packet.destination()));
  864. if (peer) {
  865. uint64_t now = Utils::now();
  866. bool isRelay;
  867. SharedPtr<Peer> via;
  868. if ((_r->topology->isSupernode(peer->address()))||(peer->hasActiveDirectPath(now))) {
  869. isRelay = false;
  870. via = peer;
  871. } else {
  872. isRelay = true;
  873. via = _r->topology->getBestSupernode();
  874. if (!via)
  875. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  876. }
  877. Packet tmp(packet);
  878. unsigned int chunkSize = std::min(tmp.size(),(unsigned int)ZT_UDP_DEFAULT_PAYLOAD_MTU);
  879. tmp.setFragmented(chunkSize < tmp.size());
  880. if (encrypt)
  881. tmp.encrypt(peer->cryptKey());
  882. tmp.hmacSet(peer->macKey());
  883. Packet::Verb verb = packet.verb();
  884. if (via->send(_r,tmp.data(),chunkSize,isRelay,verb,now)) {
  885. if (chunkSize < tmp.size()) {
  886. // Too big for one bite, fragment the rest
  887. unsigned int fragStart = chunkSize;
  888. unsigned int remaining = tmp.size() - chunkSize;
  889. unsigned int fragsRemaining = (remaining / (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  890. if ((fragsRemaining * (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH)) < remaining)
  891. ++fragsRemaining;
  892. unsigned int totalFragments = fragsRemaining + 1;
  893. for(unsigned int f=0;f<fragsRemaining;++f) {
  894. chunkSize = std::min(remaining,(unsigned int)(ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  895. Packet::Fragment frag(tmp,fragStart,chunkSize,f + 1,totalFragments);
  896. if (!via->send(_r,frag.data(),frag.size(),isRelay,verb,now)) {
  897. TRACE("WARNING: packet send to %s failed on later fragment #%u (check IP layer buffer sizes?)",via->address().toString().c_str(),f + 1);
  898. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  899. }
  900. fragStart += chunkSize;
  901. remaining -= chunkSize;
  902. }
  903. }
  904. return PACKET_SERVICE_ATTEMPT_OK;
  905. }
  906. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  907. }
  908. return PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN;
  909. }
  910. void Switch::_retryPendingFor(const Address &addr)
  911. {
  912. {
  913. Mutex::Lock _l(_txQueue_m);
  914. std::pair< std::multimap< Address,TXQueueEntry >::iterator,std::multimap< Address,TXQueueEntry >::iterator > eqrange = _txQueue.equal_range(addr);
  915. for(std::multimap< Address,TXQueueEntry >::iterator i(eqrange.first);i!=eqrange.second;) {
  916. if (_trySend(i->second.packet,i->second.encrypt) == PACKET_SERVICE_ATTEMPT_OK)
  917. _txQueue.erase(i++);
  918. else ++i;
  919. }
  920. }
  921. {
  922. Mutex::Lock _l(_rxQueue_m);
  923. std::pair< std::multimap< Address,RXQueueEntry >::iterator,std::multimap< Address,RXQueueEntry >::iterator > eqrange = _rxQueue.equal_range(addr);
  924. for(std::multimap< Address,RXQueueEntry >::iterator i(eqrange.first);i!=eqrange.second;) {
  925. if (_tryHandleRemotePacket(i->second.localPort,i->second.fromAddr,i->second.packet) == PACKET_SERVICE_ATTEMPT_OK)
  926. _rxQueue.erase(i++);
  927. else ++i;
  928. }
  929. }
  930. }
  931. } // namespace ZeroTier