2
0

Switch.cpp 43 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022
  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. // Handle special cases: IPv4 ARP
  215. if ((etherType == ZT_ETHERTYPE_ARP)&&(data.size() == 28)&&(data[2] == 0x08)&&(data[3] == 0x00)&&(data[4] == 6)&&(data[5] == 4)&&(data[7] == 0x01))
  216. mg = MulticastGroup::deriveMulticastGroupForAddressResolution(InetAddress(data.field(24,4),4,0));
  217. // Remember this message's CRC, but don't drop if we've already seen it
  218. // since it's our own.
  219. _checkAndUpdateMulticastHistory(from,mg.mac(),data.data(),data.size(),network->id(),Utils::now());
  220. // Start multicast propagation with empty bloom filter
  221. unsigned char bloom[ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE];
  222. memset(bloom,0,sizeof(bloom));
  223. _propagateMulticast(network,bloom,mg,0,0,from,etherType,data.data(),data.size());
  224. } else if (to.isZeroTier()) {
  225. // Simple unicast frame from us to another node
  226. Address toZT(to.data + 1);
  227. if (network->isAllowed(toZT)) {
  228. Packet outp(toZT,_r->identity.address(),Packet::VERB_FRAME);
  229. outp.append(network->id());
  230. outp.append((uint16_t)etherType);
  231. outp.append(data);
  232. outp.compress();
  233. send(outp,true);
  234. } else {
  235. 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());
  236. }
  237. } else {
  238. TRACE("UNICAST: %s -> %s %s (dropped, destination MAC not ZeroTier)",from.toString().c_str(),to.toString().c_str(),Utils::etherTypeName(etherType));
  239. }
  240. }
  241. void Switch::send(const Packet &packet,bool encrypt)
  242. {
  243. //TRACE("%.16llx %s -> %s (size: %u) (enc: %s)",packet.packetId(),Packet::verbString(packet.verb()),packet.destination().toString().c_str(),packet.size(),(encrypt ? "yes" : "no"));
  244. PacketServiceAttemptResult r = _trySend(packet,encrypt);
  245. if (r != PACKET_SERVICE_ATTEMPT_OK) {
  246. {
  247. Mutex::Lock _l(_txQueue_m);
  248. std::multimap< Address,TXQueueEntry >::iterator qe(_txQueue.insert(std::pair< Address,TXQueueEntry >(packet.destination(),TXQueueEntry())));
  249. qe->second.creationTime = Utils::now();
  250. qe->second.packet = packet;
  251. qe->second.encrypt = encrypt;
  252. }
  253. if (r == PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN)
  254. _requestWhois(packet.destination());
  255. }
  256. }
  257. void Switch::sendHELLO(const Address &dest)
  258. {
  259. Packet outp(dest,_r->identity.address(),Packet::VERB_HELLO);
  260. outp.append((unsigned char)ZT_PROTO_VERSION);
  261. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  262. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  263. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  264. outp.append(Utils::now());
  265. _r->identity.serialize(outp,false);
  266. send(outp,false);
  267. }
  268. bool Switch::unite(const Address &p1,const Address &p2,bool force)
  269. {
  270. SharedPtr<Peer> p1p = _r->topology->getPeer(p1);
  271. if (!p1p)
  272. return false;
  273. SharedPtr<Peer> p2p = _r->topology->getPeer(p2);
  274. if (!p2p)
  275. return false;
  276. uint64_t now = Utils::now();
  277. std::pair<InetAddress,InetAddress> cg(Peer::findCommonGround(*p1p,*p2p,now));
  278. if (!(cg.first))
  279. return false;
  280. // Addresses are sorted in key for last unite attempt map for order
  281. // invariant lookup: (p1,p2) == (p2,p1)
  282. Array<Address,2> uniteKey;
  283. if (p1 >= p2) {
  284. uniteKey[0] = p2;
  285. uniteKey[1] = p1;
  286. } else {
  287. uniteKey[0] = p1;
  288. uniteKey[1] = p2;
  289. }
  290. {
  291. Mutex::Lock _l(_lastUniteAttempt_m);
  292. std::map< Array< Address,2 >,uint64_t >::const_iterator e(_lastUniteAttempt.find(uniteKey));
  293. if ((!force)&&(e != _lastUniteAttempt.end())&&((now - e->second) < ZT_MIN_UNITE_INTERVAL))
  294. return false;
  295. else _lastUniteAttempt[uniteKey] = now;
  296. }
  297. TRACE("unite: %s(%s) <> %s(%s)",p1.toString().c_str(),cg.second.toString().c_str(),p2.toString().c_str(),cg.first.toString().c_str());
  298. { // tell p1 where to find p2
  299. Packet outp(p1,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  300. outp.append(p2.data(),ZT_ADDRESS_LENGTH);
  301. outp.append((uint16_t)cg.first.port());
  302. if (cg.first.isV6()) {
  303. outp.append((unsigned char)16);
  304. outp.append(cg.first.rawIpData(),16);
  305. } else {
  306. outp.append((unsigned char)4);
  307. outp.append(cg.first.rawIpData(),4);
  308. }
  309. outp.encrypt(p1p->cryptKey());
  310. outp.hmacSet(p1p->macKey());
  311. p1p->send(_r,outp.data(),outp.size(),false,Packet::VERB_RENDEZVOUS,now);
  312. }
  313. { // tell p2 where to find p1
  314. Packet outp(p2,_r->identity.address(),Packet::VERB_RENDEZVOUS);
  315. outp.append(p1.data(),ZT_ADDRESS_LENGTH);
  316. outp.append((uint16_t)cg.second.port());
  317. if (cg.second.isV6()) {
  318. outp.append((unsigned char)16);
  319. outp.append(cg.second.rawIpData(),16);
  320. } else {
  321. outp.append((unsigned char)4);
  322. outp.append(cg.second.rawIpData(),4);
  323. }
  324. outp.encrypt(p2p->cryptKey());
  325. outp.hmacSet(p2p->macKey());
  326. p2p->send(_r,outp.data(),outp.size(),false,Packet::VERB_RENDEZVOUS,now);
  327. }
  328. return true;
  329. }
  330. unsigned long Switch::doTimerTasks()
  331. {
  332. unsigned long nextDelay = ~((unsigned long)0); // big number, caller will cap return value
  333. uint64_t now = Utils::now();
  334. {
  335. Mutex::Lock _l(_rendezvousQueue_m);
  336. for(std::map< Address,RendezvousQueueEntry >::iterator i(_rendezvousQueue.begin());i!=_rendezvousQueue.end();) {
  337. if (now >= i->second.fireAtTime) {
  338. SharedPtr<Peer> withPeer = _r->topology->getPeer(i->first);
  339. if (withPeer) {
  340. TRACE("sending NAT-T NOP to %s(%s)",i->first.toString().c_str(),i->second.inaddr.toString().c_str());
  341. Packet outp(i->first,_r->identity.address(),Packet::VERB_NOP);
  342. outp.append("ZT",2); // arbitrary payload
  343. outp.hmacSet(withPeer->macKey());
  344. _r->demarc->send(i->second.localPort,i->second.inaddr,outp.data(),outp.size(),-1);
  345. }
  346. _rendezvousQueue.erase(i++);
  347. } else {
  348. nextDelay = std::min(nextDelay,(unsigned long)(i->second.fireAtTime - now));
  349. ++i;
  350. }
  351. }
  352. }
  353. {
  354. Mutex::Lock _l(_outstandingWhoisRequests_m);
  355. for(std::map< Address,WhoisRequest >::iterator i(_outstandingWhoisRequests.begin());i!=_outstandingWhoisRequests.end();) {
  356. unsigned long since = (unsigned long)(now - i->second.lastSent);
  357. if (since >= ZT_WHOIS_RETRY_DELAY) {
  358. if (i->second.retries >= ZT_MAX_WHOIS_RETRIES) {
  359. TRACE("WHOIS %s timed out",i->first.toString().c_str());
  360. _outstandingWhoisRequests.erase(i++);
  361. continue;
  362. } else {
  363. i->second.lastSent = now;
  364. i->second.peersConsulted[i->second.retries] = _sendWhoisRequest(i->first,i->second.peersConsulted,i->second.retries);
  365. ++i->second.retries;
  366. TRACE("WHOIS %s (retry %u)",i->first.toString().c_str(),i->second.retries);
  367. nextDelay = std::min(nextDelay,(unsigned long)ZT_WHOIS_RETRY_DELAY);
  368. }
  369. } else nextDelay = std::min(nextDelay,ZT_WHOIS_RETRY_DELAY - since);
  370. ++i;
  371. }
  372. }
  373. {
  374. Mutex::Lock _l(_txQueue_m);
  375. for(std::multimap< Address,TXQueueEntry >::iterator i(_txQueue.begin());i!=_txQueue.end();) {
  376. if (_trySend(i->second.packet,i->second.encrypt) == PACKET_SERVICE_ATTEMPT_OK)
  377. _txQueue.erase(i++);
  378. else if ((now - i->second.creationTime) > ZT_TRANSMIT_QUEUE_TIMEOUT) {
  379. TRACE("TX %s -> %s timed out",i->second.packet.source().toString().c_str(),i->second.packet.destination().toString().c_str());
  380. _txQueue.erase(i++);
  381. } else ++i;
  382. }
  383. }
  384. {
  385. Mutex::Lock _l(_rxQueue_m);
  386. for(std::multimap< Address,RXQueueEntry >::iterator i(_rxQueue.begin());i!=_rxQueue.end();) {
  387. if ((now - i->second.creationTime) > ZT_RECEIVE_QUEUE_TIMEOUT) {
  388. TRACE("RX from %s timed out waiting for WHOIS",i->second.packet.source().toString().c_str());
  389. _rxQueue.erase(i++);
  390. } else ++i;
  391. }
  392. }
  393. {
  394. Mutex::Lock _l(_defragQueue_m);
  395. for(std::map< uint64_t,DefragQueueEntry >::iterator i(_defragQueue.begin());i!=_defragQueue.end();) {
  396. if ((now - i->second.creationTime) > ZT_FRAGMENTED_PACKET_RECEIVE_TIMEOUT) {
  397. TRACE("incomplete fragmented packet %.16llx timed out, fragments discarded",i->first);
  398. _defragQueue.erase(i++);
  399. } else ++i;
  400. }
  401. }
  402. return std::max(nextDelay,(unsigned long)50); // minimum delay
  403. }
  404. void Switch::announceMulticastGroups(const std::map< SharedPtr<Network>,std::set<MulticastGroup> > &allMemberships)
  405. {
  406. std::vector< SharedPtr<Peer> > directPeers;
  407. _r->topology->eachPeer(Topology::CollectPeersWithActiveDirectPath(directPeers));
  408. #ifdef ZT_TRACE
  409. unsigned int totalMulticastGroups = 0;
  410. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator i(allMemberships.begin());i!=allMemberships.end();++i)
  411. totalMulticastGroups += (unsigned int)i->second.size();
  412. TRACE("announcing %u multicast groups for %u networks to %u peers",totalMulticastGroups,(unsigned int)allMemberships.size(),(unsigned int)directPeers.size());
  413. #endif
  414. for(std::vector< SharedPtr<Peer> >::iterator p(directPeers.begin());p!=directPeers.end();++p) {
  415. Packet outp((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  416. for(std::map< SharedPtr<Network>,std::set<MulticastGroup> >::const_iterator nwmgs(allMemberships.begin());nwmgs!=allMemberships.end();++nwmgs) {
  417. if ((nwmgs->first->open())||(_r->topology->isSupernode((*p)->address()))||(nwmgs->first->isMember((*p)->address()))) {
  418. for(std::set<MulticastGroup>::iterator mg(nwmgs->second.begin());mg!=nwmgs->second.end();++mg) {
  419. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  420. send(outp,true);
  421. outp.reset((*p)->address(),_r->identity.address(),Packet::VERB_MULTICAST_LIKE);
  422. }
  423. outp.append((uint64_t)nwmgs->first->id());
  424. outp.append(mg->mac().data,6);
  425. outp.append((uint32_t)mg->adi());
  426. }
  427. }
  428. }
  429. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH)
  430. send(outp,true);
  431. }
  432. }
  433. void Switch::_CBaddPeerFromHello(void *arg,const SharedPtr<Peer> &p,Topology::PeerVerifyResult result)
  434. {
  435. _CBaddPeerFromHello_Data *req = (_CBaddPeerFromHello_Data *)arg;
  436. const RuntimeEnvironment *_r = req->parent->_r;
  437. switch(result) {
  438. case Topology::PEER_VERIFY_ACCEPTED_NEW:
  439. case Topology::PEER_VERIFY_ACCEPTED_ALREADY_HAVE:
  440. case Topology::PEER_VERIFY_ACCEPTED_DISPLACED_INVALID_ADDRESS: {
  441. Packet outp(req->source,_r->identity.address(),Packet::VERB_OK);
  442. outp.append((unsigned char)Packet::VERB_HELLO);
  443. outp.append(req->helloPacketId);
  444. outp.append(req->helloTimestamp);
  445. outp.encrypt(p->cryptKey());
  446. outp.hmacSet(p->macKey());
  447. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  448. } break;
  449. case Topology::PEER_VERIFY_REJECTED_INVALID_IDENTITY: {
  450. Packet outp(req->source,_r->identity.address(),Packet::VERB_ERROR);
  451. outp.append((unsigned char)Packet::VERB_HELLO);
  452. outp.append(req->helloPacketId);
  453. outp.append((unsigned char)Packet::ERROR_IDENTITY_INVALID);
  454. outp.encrypt(p->cryptKey());
  455. outp.hmacSet(p->macKey());
  456. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  457. } break;
  458. case Topology::PEER_VERIFY_REJECTED_DUPLICATE:
  459. case Topology::PEER_VERIFY_REJECTED_DUPLICATE_TRIAGED: {
  460. Packet outp(req->source,_r->identity.address(),Packet::VERB_ERROR);
  461. outp.append((unsigned char)Packet::VERB_HELLO);
  462. outp.append(req->helloPacketId);
  463. outp.append((unsigned char)Packet::ERROR_IDENTITY_COLLISION);
  464. outp.encrypt(p->cryptKey());
  465. outp.hmacSet(p->macKey());
  466. req->parent->_r->demarc->send(req->localPort,req->fromAddr,outp.data(),outp.size(),-1);
  467. } break;
  468. }
  469. delete req;
  470. }
  471. void Switch::_CBaddPeerFromWhois(void *arg,const SharedPtr<Peer> &p,Topology::PeerVerifyResult result)
  472. {
  473. Switch *d = (Switch *)arg;
  474. switch(result) {
  475. case Topology::PEER_VERIFY_ACCEPTED_NEW:
  476. case Topology::PEER_VERIFY_ACCEPTED_ALREADY_HAVE:
  477. case Topology::PEER_VERIFY_ACCEPTED_DISPLACED_INVALID_ADDRESS:
  478. d->_outstandingWhoisRequests_m.lock();
  479. d->_outstandingWhoisRequests.erase(p->identity().address());
  480. d->_outstandingWhoisRequests_m.unlock();
  481. d->_retryPendingFor(p->identity().address());
  482. break;
  483. default:
  484. break;
  485. }
  486. }
  487. 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)
  488. {
  489. SharedPtr<Peer> propPeers[ZT_MULTICAST_PROPAGATION_BREADTH];
  490. 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);
  491. for(unsigned int i=0;i<np;++i)
  492. Utils::bloomAdd(bloom,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE,propPeers[i]->address().sum());
  493. for(unsigned int i=0;i<np;++i) {
  494. Packet outp(propPeers[i]->address(),_r->identity.address(),Packet::VERB_MULTICAST_FRAME);
  495. outp.append(network->id());
  496. outp.append(mg.mac().data,6);
  497. outp.append((uint32_t)mg.adi());
  498. outp.append(bloom,ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE);
  499. outp.append((uint8_t)mcHops);
  500. outp.append((uint16_t)mcLoadFactor);
  501. outp.append(from.data,6);
  502. outp.append((uint16_t)etherType);
  503. outp.append(data,len);
  504. outp.compress();
  505. send(outp,true);
  506. }
  507. }
  508. Switch::PacketServiceAttemptResult Switch::_tryHandleRemotePacket(Demarc::Port localPort,const InetAddress &fromAddr,Packet &packet)
  509. {
  510. // NOTE: We assume any packet that's made it here is for us. If it's not it
  511. // will fail HMAC validation and be discarded anyway, amounting to a second
  512. // layer of sanity checking.
  513. Address source(packet.source());
  514. if ((!packet.encrypted())&&(packet.verb() == Packet::VERB_HELLO)) {
  515. // Unencrypted HELLOs are handled here since they are used to
  516. // populate our identity cache in the first place. Thus we might get
  517. // a HELLO for someone for whom we don't have a Peer record.
  518. TRACE("HELLO from %s(%s)",source.toString().c_str(),fromAddr.toString().c_str());
  519. _doHELLO(localPort,fromAddr,packet);
  520. return PACKET_SERVICE_ATTEMPT_OK;
  521. }
  522. SharedPtr<Peer> peer = _r->topology->getPeer(source);
  523. if (peer) {
  524. uint64_t now = Utils::now();
  525. unsigned int latency = 0;
  526. if (!packet.hmacVerify(peer->macKey())) {
  527. TRACE("dropped packet from %s(%s), HMAC authentication failed (size: %u)",source.toString().c_str(),fromAddr.toString().c_str(),packet.size());
  528. return PACKET_SERVICE_ATTEMPT_OK;
  529. }
  530. if (packet.encrypted()) {
  531. packet.decrypt(peer->cryptKey());
  532. } else if (packet.verb() != Packet::VERB_NOP) {
  533. TRACE("ODD: %s from %s wasn't encrypted",Packet::verbString(packet.verb()),source.toString().c_str());
  534. }
  535. if (!packet.uncompress()) {
  536. TRACE("dropped packet from %s(%s), compressed data invalid",source.toString().c_str(),fromAddr.toString().c_str());
  537. return PACKET_SERVICE_ATTEMPT_OK;
  538. }
  539. switch(packet.verb()) {
  540. case Packet::VERB_NOP: // these are sent for NAT-t
  541. TRACE("NOP from %s(%s) (probably NAT-t)",source.toString().c_str(),fromAddr.toString().c_str());
  542. break;
  543. case Packet::VERB_HELLO: // usually they're handled up top, but technically an encrypted HELLO is legal
  544. _doHELLO(localPort,fromAddr,packet);
  545. break;
  546. case Packet::VERB_ERROR:
  547. try {
  548. #ifdef ZT_TRACE
  549. Packet::Verb inReVerb = (Packet::Verb)packet[ZT_PROTO_VERB_ERROR_IDX_IN_RE_VERB];
  550. Packet::ErrorCode errorCode = (Packet::ErrorCode)packet[ZT_PROTO_VERB_ERROR_IDX_ERROR_CODE];
  551. TRACE("ERROR %s from %s in-re %s",Packet::errorString(errorCode),source.toString().c_str(),Packet::verbString(inReVerb));
  552. #endif
  553. // TODO: handle key errors, such as duplicate identity
  554. } catch (std::exception &ex) {
  555. TRACE("dropped ERROR from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  556. } catch ( ... ) {
  557. TRACE("dropped ERROR from %s: unexpected exception: (unknown)",source.toString().c_str());
  558. }
  559. break;
  560. case Packet::VERB_OK:
  561. try {
  562. Packet::Verb inReVerb = (Packet::Verb)packet[ZT_PROTO_VERB_OK_IDX_IN_RE_VERB];
  563. switch(inReVerb) {
  564. case Packet::VERB_HELLO:
  565. latency = std::min((unsigned int)(now - packet.at<uint64_t>(ZT_PROTO_VERB_HELLO__OK__IDX_TIMESTAMP)),(unsigned int)0xffff);
  566. TRACE("OK(HELLO), latency to %s: %u",source.toString().c_str(),latency);
  567. break;
  568. case Packet::VERB_WHOIS:
  569. // Right now we only query supernodes for WHOIS and only accept
  570. // OK back from them. If we query other nodes, we'll have to
  571. // do something to prevent WHOIS cache poisoning such as
  572. // using the packet ID field in the OK packet to match with the
  573. // original query. Technically we should be doing this anyway.
  574. if (_r->topology->isSupernode(source))
  575. _r->topology->addPeer(SharedPtr<Peer>(new Peer(_r->identity,Identity(packet,ZT_PROTO_VERB_WHOIS__OK__IDX_IDENTITY))),&Switch::_CBaddPeerFromWhois,this);
  576. break;
  577. default:
  578. break;
  579. }
  580. } catch (std::exception &ex) {
  581. TRACE("dropped OK from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  582. } catch ( ... ) {
  583. TRACE("dropped OK from %s: unexpected exception: (unknown)",source.toString().c_str());
  584. }
  585. break;
  586. case Packet::VERB_WHOIS: {
  587. if (packet.payloadLength() == ZT_ADDRESS_LENGTH) {
  588. SharedPtr<Peer> p(_r->topology->getPeer(Address(packet.payload())));
  589. if (p) {
  590. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  591. outp.append((unsigned char)Packet::VERB_WHOIS);
  592. outp.append(packet.packetId());
  593. p->identity().serialize(outp,false);
  594. outp.encrypt(peer->cryptKey());
  595. outp.hmacSet(peer->macKey());
  596. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  597. TRACE("sent WHOIS response to %s for %s",source.toString().c_str(),Address(packet.payload()).toString().c_str());
  598. } else {
  599. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  600. outp.append((unsigned char)Packet::VERB_WHOIS);
  601. outp.append(packet.packetId());
  602. outp.append((unsigned char)Packet::ERROR_NOT_FOUND);
  603. outp.append(packet.payload(),ZT_ADDRESS_LENGTH);
  604. outp.encrypt(peer->cryptKey());
  605. outp.hmacSet(peer->macKey());
  606. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  607. TRACE("sent WHOIS ERROR to %s for %s (not found)",source.toString().c_str(),Address(packet.payload()).toString().c_str());
  608. }
  609. } else {
  610. TRACE("dropped WHOIS from %s: missing or invalid address",source.toString().c_str());
  611. }
  612. } break;
  613. case Packet::VERB_RENDEZVOUS:
  614. try {
  615. Address with(packet.field(ZT_PROTO_VERB_RENDEZVOUS_IDX_ZTADDRESS,ZT_ADDRESS_LENGTH));
  616. RendezvousQueueEntry qe;
  617. if (_r->topology->getPeer(with)) {
  618. unsigned int port = packet.at<uint16_t>(ZT_PROTO_VERB_RENDEZVOUS_IDX_PORT);
  619. unsigned int addrlen = packet[ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRLEN];
  620. if ((port > 0)&&((addrlen == 4)||(addrlen == 16))) {
  621. qe.inaddr.set(packet.field(ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRESS,addrlen),addrlen,port);
  622. qe.fireAtTime = now + ZT_RENDEZVOUS_NAT_T_DELAY; // then send real packet in a few ms
  623. qe.localPort = _r->demarc->pick(qe.inaddr);
  624. 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());
  625. _r->demarc->send(qe.localPort,qe.inaddr,"\0",1,ZT_FIREWALL_OPENER_HOPS); // start with firewall opener
  626. {
  627. Mutex::Lock _l(_rendezvousQueue_m);
  628. _rendezvousQueue[with] = qe;
  629. }
  630. } else {
  631. TRACE("dropped corrupt RENDEZVOUS from %s (bad address or port)",source.toString().c_str());
  632. }
  633. } else {
  634. TRACE("ignored RENDEZVOUS from %s for unknown peer %s",source.toString().c_str(),with.toString().c_str());
  635. }
  636. } catch (std::exception &ex) {
  637. TRACE("dropped RENDEZVOUS from %s: %s",source.toString().c_str(),ex.what());
  638. } catch ( ... ) {
  639. TRACE("dropped RENDEZVOUS from %s: unexpected exception",source.toString().c_str());
  640. }
  641. break;
  642. case Packet::VERB_FRAME:
  643. try {
  644. SharedPtr<Network> network(_r->nc->network(packet.at<uint64_t>(ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID)));
  645. if (network) {
  646. if (network->isAllowed(source)) {
  647. unsigned int etherType = packet.at<uint16_t>(ZT_PROTO_VERB_FRAME_IDX_ETHERTYPE);
  648. if ((etherType != ZT_ETHERTYPE_ARP)&&(etherType != ZT_ETHERTYPE_IPV4)&&(etherType != ZT_ETHERTYPE_IPV6)) {
  649. TRACE("dropped FRAME from %s: unsupported ethertype",source.toString().c_str());
  650. } else if (packet.size() > ZT_PROTO_VERB_FRAME_IDX_PAYLOAD) {
  651. 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);
  652. }
  653. } else {
  654. TRACE("dropped FRAME from %s: not a member of closed network %llu",source.toString().c_str(),network->id());
  655. }
  656. } else {
  657. TRACE("dropped FRAME from %s: network %llu unknown",source.toString().c_str(),packet.at<uint64_t>(ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID));
  658. }
  659. } catch (std::exception &ex) {
  660. TRACE("dropped FRAME from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  661. } catch ( ... ) {
  662. TRACE("dropped FRAME from %s: unexpected exception: (unknown)",source.toString().c_str());
  663. }
  664. break;
  665. case Packet::VERB_MULTICAST_FRAME:
  666. try {
  667. SharedPtr<Network> network(_r->nc->network(packet.at<uint64_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_NETWORK_ID)));
  668. if (network) {
  669. if (network->isAllowed(source)) {
  670. if (packet.size() > ZT_PROTO_VERB_MULTICAST_FRAME_IDX_PAYLOAD) {
  671. 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));
  672. unsigned char bloom[ZT_PROTO_VERB_MULTICAST_FRAME_BLOOM_FILTER_SIZE];
  673. 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);
  674. unsigned int hops = packet[ZT_PROTO_VERB_MULTICAST_FRAME_IDX_HOPS];
  675. unsigned int loadFactor = packet.at<uint16_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_LOAD_FACTOR);
  676. MAC fromMac(packet.field(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_FROM_MAC,6));
  677. unsigned int etherType = packet.at<uint16_t>(ZT_PROTO_VERB_MULTICAST_FRAME_IDX_ETHERTYPE);
  678. if ((fromMac.isZeroTier())&&(network->isAllowed(Address(fromMac)))) {
  679. 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)) {
  680. TRACE("dropped MULTICAST_FRAME from %s: duplicate multicast",source.toString().c_str());
  681. } else {
  682. //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());
  683. 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);
  684. // TODO: implement load factor based propagation rate limitation
  685. // How it will work: each node will adjust loadFactor based on
  686. // its current load of multicast traffic. Then it will probabilistically
  687. // fail to propagate, with the probability being based on load factor.
  688. // This will need some in-the-field testing and tuning to get right.
  689. _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);
  690. }
  691. } else {
  692. 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());
  693. }
  694. }
  695. } else {
  696. TRACE("dropped MULTICAST_FRAME from %s: not a member of closed network %llu",source.toString().c_str(),network->id());
  697. }
  698. } else {
  699. 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));
  700. }
  701. } catch (std::exception &ex) {
  702. TRACE("dropped MULTICAST_FRAME from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  703. } catch ( ... ) {
  704. TRACE("dropped MULTICAST_FRAME from %s: unexpected exception: (unknown)",source.toString().c_str());
  705. }
  706. break;
  707. case Packet::VERB_MULTICAST_LIKE:
  708. try {
  709. unsigned int ptr = ZT_PACKET_IDX_PAYLOAD;
  710. unsigned int numAccepted = 0;
  711. while ((ptr + 18) <= packet.size()) {
  712. uint64_t nwid = packet.at<uint64_t>(ptr); ptr += 8;
  713. SharedPtr<Network> network(_r->nc->network(nwid));
  714. if (network) {
  715. if (network->isAllowed(source)) {
  716. MAC mac(packet.field(ptr,6)); ptr += 6;
  717. uint32_t adi = packet.at<uint32_t>(ptr); ptr += 4;
  718. TRACE("peer %s likes multicast group %s:%.8lx on network %llu",source.toString().c_str(),mac.toString().c_str(),(unsigned long)adi,nwid);
  719. _r->topology->likesMulticastGroup(nwid,MulticastGroup(mac,adi),source,now);
  720. ++numAccepted;
  721. } else {
  722. TRACE("ignored MULTICAST_LIKE from %s: not a member of closed network %llu",source.toString().c_str(),nwid);
  723. }
  724. } else {
  725. TRACE("ignored MULTICAST_LIKE from %s: network %llu unknown",source.toString().c_str(),nwid);
  726. }
  727. }
  728. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  729. outp.append((unsigned char)Packet::VERB_MULTICAST_LIKE);
  730. outp.append(packet.packetId());
  731. outp.append((uint16_t)numAccepted);
  732. outp.encrypt(peer->cryptKey());
  733. outp.hmacSet(peer->macKey());
  734. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  735. } catch (std::exception &ex) {
  736. TRACE("dropped MULTICAST_LIKE from %s: unexpected exception: %s",source.toString().c_str(),ex.what());
  737. } catch ( ... ) {
  738. TRACE("dropped MULTICAST_LIKE from %s: unexpected exception: (unknown)",source.toString().c_str());
  739. }
  740. break;
  741. default:
  742. TRACE("ignored unrecognized verb %.2x from %s",(unsigned int)packet.verb(),source.toString().c_str());
  743. break;
  744. }
  745. // Update peer timestamps and learn new links
  746. peer->onReceive(_r,localPort,fromAddr,latency,packet.hops(),packet.verb(),now);
  747. } else return PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN;
  748. return PACKET_SERVICE_ATTEMPT_OK;
  749. }
  750. void Switch::_doHELLO(Demarc::Port localPort,const InetAddress &fromAddr,Packet &packet)
  751. {
  752. Address source(packet.source());
  753. try {
  754. unsigned int protoVersion = packet[ZT_PROTO_VERB_HELLO_IDX_PROTOCOL_VERSION];
  755. unsigned int vMajor = packet[ZT_PROTO_VERB_HELLO_IDX_MAJOR_VERSION];
  756. unsigned int vMinor = packet[ZT_PROTO_VERB_HELLO_IDX_MINOR_VERSION];
  757. unsigned int vRevision = packet.at<uint16_t>(ZT_PROTO_VERB_HELLO_IDX_REVISION);
  758. uint64_t timestamp = packet.at<uint64_t>(ZT_PROTO_VERB_HELLO_IDX_TIMESTAMP);
  759. Identity id(packet,ZT_PROTO_VERB_HELLO_IDX_IDENTITY);
  760. SharedPtr<Peer> candidate(new Peer(_r->identity,id));
  761. candidate->setPathAddress(fromAddr,false);
  762. // Initial sniff test
  763. if (protoVersion != ZT_PROTO_VERSION) {
  764. TRACE("rejected HELLO from %s(%s): invalid protocol version",source.toString().c_str(),fromAddr.toString().c_str());
  765. Packet outp(source,_r->identity.address(),Packet::VERB_ERROR);
  766. outp.append((unsigned char)Packet::VERB_HELLO);
  767. outp.append(packet.packetId());
  768. outp.append((unsigned char)Packet::ERROR_BAD_PROTOCOL_VERSION);
  769. outp.encrypt(candidate->cryptKey());
  770. outp.hmacSet(candidate->macKey());
  771. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  772. return;
  773. }
  774. if (id.address().isReserved()) {
  775. TRACE("rejected HELLO from %s(%s): identity has reserved address",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_IDENTITY_INVALID);
  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() != source) {
  786. 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());
  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_INVALID_REQUEST);
  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. // Is this a HELLO for a peer we already know? If so just update its
  797. // packet receive stats and send an OK.
  798. SharedPtr<Peer> existingPeer(_r->topology->getPeer(id.address()));
  799. if ((existingPeer)&&(existingPeer->identity() == id)) {
  800. existingPeer->onReceive(_r,localPort,fromAddr,0,packet.hops(),Packet::VERB_HELLO,Utils::now());
  801. Packet outp(source,_r->identity.address(),Packet::VERB_OK);
  802. outp.append((unsigned char)Packet::VERB_HELLO);
  803. outp.append(packet.packetId());
  804. outp.append(timestamp);
  805. outp.encrypt(existingPeer->cryptKey());
  806. outp.hmacSet(existingPeer->macKey());
  807. _r->demarc->send(localPort,fromAddr,outp.data(),outp.size(),-1);
  808. return;
  809. }
  810. // Otherwise we call addPeer() and set up a callback to handle the verdict
  811. _CBaddPeerFromHello_Data *arg = new _CBaddPeerFromHello_Data;
  812. arg->parent = this;
  813. arg->source = source;
  814. arg->fromAddr = fromAddr;
  815. arg->localPort = localPort;
  816. arg->vMajor = vMajor;
  817. arg->vMinor = vMinor;
  818. arg->vRevision = vRevision;
  819. arg->helloPacketId = packet.packetId();
  820. arg->helloTimestamp = timestamp;
  821. _r->topology->addPeer(candidate,&Switch::_CBaddPeerFromHello,arg);
  822. } catch (std::exception &ex) {
  823. TRACE("dropped HELLO from %s(%s): %s",source.toString().c_str(),fromAddr.toString().c_str(),ex.what());
  824. } catch ( ... ) {
  825. TRACE("dropped HELLO from %s(%s): unexpected exception",source.toString().c_str(),fromAddr.toString().c_str());
  826. }
  827. }
  828. void Switch::_requestWhois(const Address &addr)
  829. {
  830. TRACE("requesting WHOIS for %s",addr.toString().c_str());
  831. _sendWhoisRequest(addr,(const Address *)0,0);
  832. Mutex::Lock _l(_outstandingWhoisRequests_m);
  833. std::pair< std::map< Address,WhoisRequest >::iterator,bool > entry(_outstandingWhoisRequests.insert(std::pair<Address,WhoisRequest>(addr,WhoisRequest())));
  834. entry.first->second.lastSent = Utils::now();
  835. entry.first->second.retries = 0; // reset retry count if entry already existed
  836. }
  837. Address Switch::_sendWhoisRequest(const Address &addr,const Address *peersAlreadyConsulted,unsigned int numPeersAlreadyConsulted)
  838. {
  839. SharedPtr<Peer> supernode(_r->topology->getBestSupernode(peersAlreadyConsulted,numPeersAlreadyConsulted));
  840. if (supernode) {
  841. Packet outp(supernode->address(),_r->identity.address(),Packet::VERB_WHOIS);
  842. outp.append(addr.data(),ZT_ADDRESS_LENGTH);
  843. outp.encrypt(supernode->cryptKey());
  844. outp.hmacSet(supernode->macKey());
  845. supernode->send(_r,outp.data(),outp.size(),false,Packet::VERB_WHOIS,Utils::now());
  846. return supernode->address();
  847. }
  848. return Address();
  849. }
  850. Switch::PacketServiceAttemptResult Switch::_trySend(const Packet &packet,bool encrypt)
  851. {
  852. SharedPtr<Peer> peer(_r->topology->getPeer(packet.destination()));
  853. if (peer) {
  854. uint64_t now = Utils::now();
  855. bool isRelay;
  856. SharedPtr<Peer> via;
  857. if ((_r->topology->isSupernode(peer->address()))||(peer->hasActiveDirectPath(now))) {
  858. isRelay = false;
  859. via = peer;
  860. } else {
  861. isRelay = true;
  862. via = _r->topology->getBestSupernode();
  863. if (!via)
  864. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  865. }
  866. Packet tmp(packet);
  867. unsigned int chunkSize = std::min(tmp.size(),(unsigned int)ZT_UDP_DEFAULT_PAYLOAD_MTU);
  868. tmp.setFragmented(chunkSize < tmp.size());
  869. if (encrypt)
  870. tmp.encrypt(peer->cryptKey());
  871. tmp.hmacSet(peer->macKey());
  872. Packet::Verb verb = packet.verb();
  873. if (via->send(_r,tmp.data(),chunkSize,isRelay,verb,now)) {
  874. if (chunkSize < tmp.size()) {
  875. // Too big for one bite, fragment the rest
  876. unsigned int fragStart = chunkSize;
  877. unsigned int remaining = tmp.size() - chunkSize;
  878. unsigned int fragsRemaining = (remaining / (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  879. if ((fragsRemaining * (ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH)) < remaining)
  880. ++fragsRemaining;
  881. unsigned int totalFragments = fragsRemaining + 1;
  882. for(unsigned int f=0;f<fragsRemaining;++f) {
  883. chunkSize = std::min(remaining,(unsigned int)(ZT_UDP_DEFAULT_PAYLOAD_MTU - ZT_PROTO_MIN_FRAGMENT_LENGTH));
  884. Packet::Fragment frag(tmp,fragStart,chunkSize,f + 1,totalFragments);
  885. if (!via->send(_r,frag.data(),frag.size(),isRelay,verb,now)) {
  886. TRACE("WARNING: packet send to %s failed on later fragment #%u (check IP layer buffer sizes?)",via->address().toString().c_str(),f + 1);
  887. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  888. }
  889. fragStart += chunkSize;
  890. remaining -= chunkSize;
  891. }
  892. }
  893. return PACKET_SERVICE_ATTEMPT_OK;
  894. }
  895. return PACKET_SERVICE_ATTEMPT_SEND_FAILED;
  896. }
  897. return PACKET_SERVICE_ATTEMPT_PEER_UNKNOWN;
  898. }
  899. void Switch::_retryPendingFor(const Address &addr)
  900. {
  901. {
  902. Mutex::Lock _l(_txQueue_m);
  903. std::pair< std::multimap< Address,TXQueueEntry >::iterator,std::multimap< Address,TXQueueEntry >::iterator > eqrange = _txQueue.equal_range(addr);
  904. for(std::multimap< Address,TXQueueEntry >::iterator i(eqrange.first);i!=eqrange.second;) {
  905. if (_trySend(i->second.packet,i->second.encrypt) == PACKET_SERVICE_ATTEMPT_OK)
  906. _txQueue.erase(i++);
  907. else ++i;
  908. }
  909. }
  910. {
  911. Mutex::Lock _l(_rxQueue_m);
  912. std::pair< std::multimap< Address,RXQueueEntry >::iterator,std::multimap< Address,RXQueueEntry >::iterator > eqrange = _rxQueue.equal_range(addr);
  913. for(std::multimap< Address,RXQueueEntry >::iterator i(eqrange.first);i!=eqrange.second;) {
  914. if (_tryHandleRemotePacket(i->second.localPort,i->second.fromAddr,i->second.packet) == PACKET_SERVICE_ATTEMPT_OK)
  915. _rxQueue.erase(i++);
  916. else ++i;
  917. }
  918. }
  919. }
  920. } // namespace ZeroTier