root.cpp 45 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329
  1. /*
  2. * Copyright (c)2013-2020 ZeroTier, Inc.
  3. *
  4. * Use of this software is governed by the Business Source License included
  5. * in the LICENSE.TXT file in the project's root directory.
  6. *
  7. * Change Date: 2024-01-01
  8. *
  9. * On the date above, in accordance with the Business Source License, use
  10. * of this software will be governed by version 2.0 of the Apache License.
  11. */
  12. /****/
  13. /*
  14. * This is a high-throughput minimal root server. It implements only
  15. * those functions of a ZT node that a root must perform and does so
  16. * using highly efficient multithreaded I/O code. It's only been
  17. * thoroughly tested on Linux but should also run on BSDs.
  18. *
  19. * Root configuration file format (JSON):
  20. *
  21. * {
  22. * "name": Name of this root for documentation/UI purposes (string)
  23. * "port": UDP port (int)
  24. * "httpPort": Local HTTP port for basic stats (int)
  25. * "relayMaxHops": Max hops (up to 7)
  26. * "planetFile": Location of planet file for pre-2.x peers (string)
  27. * "statsRoot": If present, path to periodically save stats files (string)
  28. * "s_siblings": [
  29. * {
  30. * "name": Sibling name for UI/documentation purposes (string)
  31. * "id": Full public identity of subling (string)
  32. * "ip": IP address of sibling (string)
  33. * "port": port of subling (for ZeroTier UDP) (int)
  34. * }, ...
  35. * ]
  36. * }
  37. *
  38. * The only required field is port. If statsRoot is present then files
  39. * are periodically written there containing the root's current state.
  40. * It should be a memory filesystem like /dev/shm on Linux as these
  41. * files are large and rewritten frequently and do not need to be
  42. * persisted.
  43. *
  44. * s_siblings are other root servers that should receive packets to peers
  45. * that we can't find. This can occur due to e.g. network topology
  46. * hiccups, IP blockages, etc. s_siblings are used in the order in which
  47. * they appear with the first alive sibling being used.
  48. */
  49. #include <Constants.hpp>
  50. #include <stdio.h>
  51. #include <stdlib.h>
  52. #include <unistd.h>
  53. #include <string.h>
  54. #include <fcntl.h>
  55. #include <signal.h>
  56. #include <errno.h>
  57. #include <sys/stat.h>
  58. #include <sys/types.h>
  59. #include <sys/socket.h>
  60. #include <sys/select.h>
  61. #include <sys/time.h>
  62. #include <sys/un.h>
  63. #include <sys/ioctl.h>
  64. #include <arpa/inet.h>
  65. #include <netinet/in.h>
  66. #include <netinet/ip.h>
  67. #include <netinet/ip6.h>
  68. #include <netinet/tcp.h>
  69. #include <netinet/udp.h>
  70. #include <json.hpp>
  71. #include <httplib.h>
  72. #include <Packet.hpp>
  73. #include <Utils.hpp>
  74. #include <Address.hpp>
  75. #include <Identity.hpp>
  76. #include <InetAddress.hpp>
  77. #include <Mutex.hpp>
  78. #include <SharedPtr.hpp>
  79. #include <MulticastGroup.hpp>
  80. #include <CertificateOfMembership.hpp>
  81. #include <OSUtils.hpp>
  82. #include <Meter.hpp>
  83. #include <string>
  84. #include <thread>
  85. #include <map>
  86. #include <set>
  87. #include <vector>
  88. #include <iostream>
  89. #include <iomanip>
  90. #include <unordered_map>
  91. #include <unordered_set>
  92. #include <vector>
  93. #include <atomic>
  94. #include <mutex>
  95. #include <list>
  96. #include <sstream>
  97. #include "geoip-html.h"
  98. using namespace ZeroTier;
  99. using json = nlohmann::json;
  100. #ifdef MSG_DONTWAIT
  101. #define SENDTO_FLAGS MSG_DONTWAIT
  102. #define RECVFROM_FLAGS 0
  103. #else
  104. #define SENDTO_FLAGS 0
  105. #define RECVFROM_FLAGS 0
  106. #endif
  107. //////////////////////////////////////////////////////////////////////////////
  108. //////////////////////////////////////////////////////////////////////////////
  109. /**
  110. * RootPeer is a normal peer known to this root
  111. *
  112. * This struct must remain memcpy-able. Identity, InetAddress, and
  113. * AtomicCounter all satisfy this. Take care when adding fields that
  114. * this remains true.
  115. */
  116. struct RootPeer
  117. {
  118. ZT_ALWAYS_INLINE RootPeer() : lastSend(0),lastReceive(0),lastEcho(0),lastHello(0),vProto(-1),vMajor(-1),vMinor(-1),vRev(-1) {}
  119. ZT_ALWAYS_INLINE ~RootPeer() { Utils::burn(key,sizeof(key)); }
  120. Identity id; // Identity
  121. uint8_t key[32]; // Shared secret key
  122. InetAddress ip4,ip6; // IPv4 and IPv6 addresses
  123. int64_t lastSend; // Time of last send (any packet)
  124. int64_t lastReceive; // Time of last receive (any packet)
  125. int64_t lastEcho; // Time of last received ECHO
  126. int64_t lastHello; // Time of last received HELLO
  127. int vProto; // Protocol version or -1 if unknown
  128. int vMajor,vMinor,vRev; // Peer version or -1,-1,-1 if unknown
  129. AtomicCounter __refCount;
  130. };
  131. // Hashers for std::unordered_map
  132. struct IdentityHasher { ZT_ALWAYS_INLINE std::size_t operator()(const Identity &id) const { return (std::size_t)id.hashCode(); } };
  133. struct AddressHasher { ZT_ALWAYS_INLINE std::size_t operator()(const Address &a) const { return (std::size_t)a.toInt(); } };
  134. struct InetAddressHasher { ZT_ALWAYS_INLINE std::size_t operator()(const InetAddress &ip) const { return (std::size_t)ip.hashCode(); } };
  135. struct MulticastGroupHasher { ZT_ALWAYS_INLINE std::size_t operator()(const MulticastGroup &mg) const { return (std::size_t)mg.hashCode(); } };
  136. // An ordered tuple key representing an introduction of one peer to another
  137. struct RendezvousKey
  138. {
  139. RendezvousKey(const Address &aa,const Address &bb)
  140. {
  141. if (aa > bb) {
  142. a = aa;
  143. b = bb;
  144. } else {
  145. a = bb;
  146. b = aa;
  147. }
  148. }
  149. Address a,b;
  150. ZT_ALWAYS_INLINE bool operator==(const RendezvousKey &k) const { return ((a == k.a)&&(b == k.b)); }
  151. ZT_ALWAYS_INLINE bool operator!=(const RendezvousKey &k) const { return ((a != k.a)||(b != k.b)); }
  152. struct Hasher { ZT_ALWAYS_INLINE std::size_t operator()(const RendezvousKey &k) const { return (std::size_t)(k.a.toInt() ^ k.b.toInt()); } };
  153. };
  154. struct RendezvousStats
  155. {
  156. RendezvousStats() : count(0),ts(0) {}
  157. int64_t count;
  158. int64_t ts;
  159. };
  160. // These fields are not locked as they're only initialized on startup or are atomic
  161. static int64_t s_startTime; // Time service was started
  162. static std::vector<int> s_ports; // Ports to bind for UDP traffic
  163. static int s_relayMaxHops = 0; // Max relay hops
  164. static Identity s_self; // My identity (including secret)
  165. static std::atomic_bool s_run; // Remains true until shutdown is ordered
  166. static json s_config; // JSON config file contents
  167. static std::string s_statsRoot; // Root to write stats, peers, etc.
  168. static std::atomic_bool s_geoInit; // True if geoIP data is initialized
  169. static std::string s_googleMapsAPIKey; // Google maps API key for GeoIP /map feature
  170. // These are only modified during GeoIP database load (if enabled) and become static after s_geoInit is set to true.
  171. static std::map< std::pair< uint32_t,uint32_t >,std::pair< float,float > > s_geoIp4;
  172. static std::map< std::pair< std::array< uint64_t,2 >,std::array< uint64_t,2 > >,std::pair< float,float > > s_geoIp6;
  173. // Rate meters for statistical purposes (locks are internal to Meter)
  174. static Meter s_inputRate;
  175. static Meter s_outputRate;
  176. static Meter s_forwardRate;
  177. static Meter s_discardedForwardRate;
  178. // These fields are locked using mutexes below as they're modified during runtime
  179. static std::string s_planet;
  180. static std::list< SharedPtr<RootPeer> > s_peers;
  181. static std::unordered_map< uint64_t,std::unordered_map< MulticastGroup,std::unordered_map< Address,int64_t,AddressHasher >,MulticastGroupHasher > > s_multicastSubscriptions;
  182. static std::unordered_map< Identity,SharedPtr<RootPeer>,IdentityHasher > s_peersByIdentity;
  183. static std::unordered_map< Address,std::set< SharedPtr<RootPeer> >,AddressHasher > s_peersByVirtAddr;
  184. static std::unordered_map< RendezvousKey,RendezvousStats,RendezvousKey::Hasher > s_rendezvousTracking;
  185. static std::mutex s_planet_l;
  186. static std::mutex s_peers_l;
  187. static std::mutex s_multicastSubscriptions_l;
  188. static std::mutex s_peersByIdentity_l;
  189. static std::mutex s_peersByVirtAddr_l;
  190. static std::mutex s_rendezvousTracking_l;
  191. //////////////////////////////////////////////////////////////////////////////
  192. //////////////////////////////////////////////////////////////////////////////
  193. // Construct GeoIP key for IPv4 IPs
  194. static ZT_ALWAYS_INLINE uint32_t ip4ToH32(const InetAddress &ip)
  195. {
  196. return Utils::ntoh((uint32_t)(((const struct sockaddr_in *)&ip)->sin_addr.s_addr));
  197. }
  198. // Construct GeoIP key for IPv6 IPs
  199. static ZT_ALWAYS_INLINE std::array< uint64_t,2 > ip6ToH128(const InetAddress &ip)
  200. {
  201. std::array<uint64_t,2> i128;
  202. memcpy(i128.data(),ip.rawIpData(),16);
  203. i128[0] = Utils::ntoh(i128[0]);
  204. i128[1] = Utils::ntoh(i128[1]);
  205. return i128;
  206. }
  207. static void handlePacket(const int v4s,const int v6s,const InetAddress *const ip,Packet &pkt)
  208. {
  209. char ipstr[128];
  210. const bool fragment = pkt[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] == ZT_PACKET_FRAGMENT_INDICATOR;
  211. const Address source(pkt.source());
  212. const Address dest(pkt.destination());
  213. const int64_t now = OSUtils::now();
  214. s_inputRate.log(now,pkt.size());
  215. if ((!fragment)&&(!pkt.fragmented())&&(dest == s_self.address())) {
  216. SharedPtr<RootPeer> peer;
  217. // If this is an un-encrypted HELLO, either learn a new peer or verify
  218. // that this is a peer we already know.
  219. if ((pkt.cipher() == ZT_PROTO_CIPHER_SUITE__POLY1305_NONE)&&(pkt.verb() == Packet::VERB_HELLO)) {
  220. Identity id;
  221. if (id.deserialize(pkt,ZT_PROTO_VERB_HELLO_IDX_IDENTITY)) {
  222. {
  223. std::lock_guard<std::mutex> pbi_l(s_peersByIdentity_l);
  224. auto pById = s_peersByIdentity.find(id);
  225. if (pById != s_peersByIdentity.end())
  226. peer = pById->second;
  227. }
  228. if (peer) {
  229. if (!pkt.dearmor(peer->key)) {
  230. printf("%s HELLO rejected: packet authentication failed" ZT_EOL_S,ip->toString(ipstr));
  231. return;
  232. }
  233. } else {
  234. peer.set(new RootPeer);
  235. if (!s_self.agree(id,peer->key)) {
  236. printf("%s HELLO rejected: key agreement failed" ZT_EOL_S,ip->toString(ipstr));
  237. return;
  238. }
  239. if (!pkt.dearmor(peer->key)) {
  240. printf("%s HELLO rejected: packet authentication failed" ZT_EOL_S,ip->toString(ipstr));
  241. return;
  242. }
  243. if (!pkt.uncompress()) {
  244. printf("%s HELLO rejected: decompression failed" ZT_EOL_S,ip->toString(ipstr));
  245. return;
  246. }
  247. peer->id = id;
  248. peer->lastReceive = now;
  249. bool added = false;
  250. {
  251. std::lock_guard<std::mutex> pbi_l(s_peersByIdentity_l);
  252. auto existing = s_peersByIdentity.find(id); // make sure another thread didn't do this while we were
  253. if (existing == s_peersByIdentity.end()) {
  254. s_peersByIdentity.emplace(id,peer);
  255. added = true;
  256. } else {
  257. peer = existing->second;
  258. }
  259. }
  260. if (added) {
  261. {
  262. std::lock_guard<std::mutex> pl(s_peers_l);
  263. s_peers.emplace_back(peer);
  264. }
  265. {
  266. std::lock_guard<std::mutex> pbv_l(s_peersByVirtAddr_l);
  267. s_peersByVirtAddr[id.address()].emplace(peer);
  268. }
  269. }
  270. }
  271. }
  272. }
  273. // If it wasn't a HELLO, check to see if any known identities for the sender's
  274. // short ZT address successfully decrypt the packet.
  275. if (!peer) {
  276. std::lock_guard<std::mutex> pbv_l(s_peersByVirtAddr_l);
  277. auto peers = s_peersByVirtAddr.find(source);
  278. if (peers != s_peersByVirtAddr.end()) {
  279. for(auto p=peers->second.begin();p!=peers->second.end();++p) {
  280. if (pkt.dearmor((*p)->key)) {
  281. if (!pkt.uncompress()) {
  282. printf("%s packet rejected: decompression failed" ZT_EOL_S,ip->toString(ipstr));
  283. return;
  284. }
  285. peer = (*p);
  286. break;
  287. }
  288. }
  289. }
  290. }
  291. // If we found the peer, update IP and/or time and handle certain key packet types that the
  292. // root must concern itself with.
  293. if (peer) {
  294. if (ip->isV4())
  295. peer->ip4 = ip;
  296. else if (ip->isV6())
  297. peer->ip6 = ip;
  298. const int64_t now = OSUtils::now();
  299. peer->lastReceive = now;
  300. switch(pkt.verb()) {
  301. case Packet::VERB_HELLO:
  302. try {
  303. if ((now - peer->lastHello) > 500) {
  304. peer->lastHello = now;
  305. peer->vProto = (int)pkt[ZT_PROTO_VERB_HELLO_IDX_PROTOCOL_VERSION];
  306. peer->vMajor = (int)pkt[ZT_PROTO_VERB_HELLO_IDX_MAJOR_VERSION];
  307. peer->vMinor = (int)pkt[ZT_PROTO_VERB_HELLO_IDX_MINOR_VERSION];
  308. peer->vRev = (int)pkt.template at<uint16_t>(ZT_PROTO_VERB_HELLO_IDX_REVISION);
  309. const uint64_t origId = pkt.packetId();
  310. const uint64_t ts = pkt.template at<uint64_t>(ZT_PROTO_VERB_HELLO_IDX_TIMESTAMP);
  311. pkt.reset(source,s_self.address(),Packet::VERB_OK);
  312. pkt.append((uint8_t)Packet::VERB_HELLO);
  313. pkt.append(origId);
  314. pkt.append(ts);
  315. pkt.append((uint8_t)ZT_PROTO_VERSION);
  316. pkt.append((uint8_t)0);
  317. pkt.append((uint8_t)0);
  318. pkt.append((uint16_t)0);
  319. ip->serialize(pkt);
  320. if (peer->vProto < 11) { // send planet file for pre-2.x peers
  321. std::lock_guard<std::mutex> pl(s_planet_l);
  322. if (s_planet.length() > 0) {
  323. pkt.append((uint16_t)s_planet.size());
  324. pkt.append((const uint8_t *)s_planet.data(),s_planet.size());
  325. }
  326. }
  327. pkt.armor(peer->key,true);
  328. sendto(ip->isV4() ? v4s : v6s,pkt.data(),pkt.size(),SENDTO_FLAGS,(const struct sockaddr *)ip,(socklen_t)((ip->ss_family == AF_INET) ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6)));
  329. s_outputRate.log(now,pkt.size());
  330. peer->lastSend = now;
  331. }
  332. } catch ( ... ) {
  333. printf("* unexpected exception handling HELLO from %s" ZT_EOL_S,ip->toString(ipstr));
  334. }
  335. break;
  336. case Packet::VERB_ECHO:
  337. try {
  338. if ((now - peer->lastEcho) > 500) {
  339. peer->lastEcho = now;
  340. Packet outp(source,s_self.address(),Packet::VERB_OK);
  341. outp.append((uint8_t)Packet::VERB_ECHO);
  342. outp.append(pkt.packetId());
  343. outp.append(((const uint8_t *)pkt.data()) + ZT_PACKET_IDX_PAYLOAD,pkt.size() - ZT_PACKET_IDX_PAYLOAD);
  344. outp.compress();
  345. outp.armor(peer->key,true);
  346. sendto(ip->isV4() ? v4s : v6s,outp.data(),outp.size(),SENDTO_FLAGS,(const struct sockaddr *)ip,(socklen_t)((ip->ss_family == AF_INET) ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6)));
  347. s_outputRate.log(now,outp.size());
  348. peer->lastSend = now;
  349. }
  350. } catch ( ... ) {
  351. printf("* unexpected exception handling ECHO from %s" ZT_EOL_S,ip->toString(ipstr));
  352. }
  353. case Packet::VERB_WHOIS:
  354. try {
  355. std::vector< SharedPtr<RootPeer> > results;
  356. {
  357. std::lock_guard<std::mutex> l(s_peersByVirtAddr_l);
  358. for(unsigned int ptr=ZT_PACKET_IDX_PAYLOAD;(ptr+ZT_ADDRESS_LENGTH)<=pkt.size();ptr+=ZT_ADDRESS_LENGTH) {
  359. auto peers = s_peersByVirtAddr.find(Address(pkt.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH));
  360. if (peers != s_peersByVirtAddr.end()) {
  361. for(auto p=peers->second.begin();p!=peers->second.end();++p)
  362. results.push_back(*p);
  363. }
  364. }
  365. }
  366. if (!results.empty()) {
  367. const uint64_t origId = pkt.packetId();
  368. pkt.reset(source,s_self.address(),Packet::VERB_OK);
  369. pkt.append((uint8_t)Packet::VERB_WHOIS);
  370. pkt.append(origId);
  371. for(auto p=results.begin();p!=results.end();++p)
  372. (*p)->id.serialize(pkt,false);
  373. pkt.armor(peer->key,true);
  374. sendto(ip->isV4() ? v4s : v6s,pkt.data(),pkt.size(),SENDTO_FLAGS,(const struct sockaddr *)ip,(socklen_t)((ip->ss_family == AF_INET) ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6)));
  375. s_outputRate.log(now,pkt.size());
  376. peer->lastSend = now;
  377. }
  378. } catch ( ... ) {
  379. printf("* unexpected exception handling ECHO from %s" ZT_EOL_S,ip->toString(ipstr));
  380. }
  381. case Packet::VERB_MULTICAST_LIKE:
  382. try {
  383. std::lock_guard<std::mutex> l(s_multicastSubscriptions_l);
  384. for(unsigned int ptr=ZT_PACKET_IDX_PAYLOAD;(ptr+18)<=pkt.size();ptr+=18) {
  385. const uint64_t nwid = pkt.template at<uint64_t>(ptr);
  386. const MulticastGroup mg(MAC(pkt.field(ptr + 8,6),6),pkt.template at<uint32_t>(ptr + 14));
  387. s_multicastSubscriptions[nwid][mg][source] = now;
  388. }
  389. } catch ( ... ) {
  390. printf("* unexpected exception handling MULTICAST_LIKE from %s" ZT_EOL_S,ip->toString(ipstr));
  391. }
  392. break;
  393. case Packet::VERB_MULTICAST_GATHER:
  394. try {
  395. const uint64_t nwid = pkt.template at<uint64_t>(ZT_PROTO_VERB_MULTICAST_GATHER_IDX_NETWORK_ID);
  396. //const unsigned int flags = pkt[ZT_PROTO_VERB_MULTICAST_GATHER_IDX_FLAGS];
  397. const MulticastGroup mg(MAC(pkt.field(ZT_PROTO_VERB_MULTICAST_GATHER_IDX_MAC,6),6),pkt.template at<uint32_t>(ZT_PROTO_VERB_MULTICAST_GATHER_IDX_ADI));
  398. unsigned int gatherLimit = pkt.template at<uint32_t>(ZT_PROTO_VERB_MULTICAST_GATHER_IDX_GATHER_LIMIT);
  399. if (gatherLimit > 255)
  400. gatherLimit = 255;
  401. const uint64_t origId = pkt.packetId();
  402. pkt.reset(source,s_self.address(),Packet::VERB_OK);
  403. pkt.append((uint8_t)Packet::VERB_MULTICAST_GATHER);
  404. pkt.append(origId);
  405. pkt.append(nwid);
  406. mg.mac().appendTo(pkt);
  407. pkt.append((uint32_t)mg.adi());
  408. {
  409. std::lock_guard<std::mutex> l(s_multicastSubscriptions_l);
  410. auto forNet = s_multicastSubscriptions.find(nwid);
  411. if (forNet != s_multicastSubscriptions.end()) {
  412. auto forGroup = forNet->second.find(mg);
  413. if (forGroup != forNet->second.end()) {
  414. pkt.append((uint32_t)forGroup->second.size());
  415. const unsigned int countAt = pkt.size();
  416. pkt.addSize(2);
  417. unsigned int l = 0;
  418. for(auto g=forGroup->second.begin();((l<gatherLimit)&&(g!=forGroup->second.end()));++g) {
  419. if (g->first != source) {
  420. ++l;
  421. g->first.appendTo(pkt);
  422. }
  423. }
  424. if (l > 0) {
  425. pkt.setAt<uint16_t>(countAt,(uint16_t)l);
  426. pkt.armor(peer->key,true);
  427. sendto(ip->isV4() ? v4s : v6s,pkt.data(),pkt.size(),SENDTO_FLAGS,(const struct sockaddr *)ip,(socklen_t)(ip->isV4() ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6)));
  428. s_outputRate.log(now,pkt.size());
  429. peer->lastSend = now;
  430. }
  431. }
  432. }
  433. }
  434. } catch ( ... ) {
  435. printf("* unexpected exception handling MULTICAST_GATHER from %s" ZT_EOL_S,ip->toString(ipstr));
  436. }
  437. break;
  438. default:
  439. break;
  440. }
  441. return;
  442. }
  443. }
  444. // If we made it here, we are forwarding this packet to someone else and also possibly
  445. // sending a RENDEZVOUS message.
  446. int hops = 0;
  447. bool introduce = false;
  448. if (fragment) {
  449. if ((hops = (int)reinterpret_cast<Packet::Fragment *>(&pkt)->incrementHops()) > s_relayMaxHops) {
  450. s_discardedForwardRate.log(now,pkt.size());
  451. return;
  452. }
  453. } else {
  454. if ((hops = (int)pkt.incrementHops()) > s_relayMaxHops) {
  455. s_discardedForwardRate.log(now,pkt.size());
  456. return;
  457. }
  458. if (hops == 1) {
  459. RendezvousKey rk(source,dest);
  460. std::lock_guard<std::mutex> l(s_rendezvousTracking_l);
  461. RendezvousStats &lr = s_rendezvousTracking[rk];
  462. if ((now - lr.ts) >= 30000) {
  463. ++lr.count;
  464. lr.ts = now;
  465. introduce = true;
  466. }
  467. }
  468. }
  469. std::vector< std::pair< InetAddress *,SharedPtr<RootPeer> > > toAddrs;
  470. {
  471. std::lock_guard<std::mutex> pbv_l(s_peersByVirtAddr_l);
  472. auto peers = s_peersByVirtAddr.find(dest);
  473. if (peers != s_peersByVirtAddr.end()) {
  474. for(auto p=peers->second.begin();p!=peers->second.end();++p) {
  475. if ((*p)->ip4) {
  476. toAddrs.emplace_back(std::pair< InetAddress *,SharedPtr<RootPeer> >(&((*p)->ip4),*p));
  477. } else if ((*p)->ip6) {
  478. toAddrs.emplace_back(std::pair< InetAddress *,SharedPtr<RootPeer> >(&((*p)->ip6),*p));
  479. }
  480. }
  481. }
  482. }
  483. if (toAddrs.empty()) {
  484. s_discardedForwardRate.log(now,pkt.size());
  485. return;
  486. }
  487. if (introduce) {
  488. std::lock_guard<std::mutex> l(s_peersByVirtAddr_l);
  489. auto sources = s_peersByVirtAddr.find(source);
  490. if (sources != s_peersByVirtAddr.end()) {
  491. for(auto a=sources->second.begin();a!=sources->second.end();++a) {
  492. for(auto b=toAddrs.begin();b!=toAddrs.end();++b) {
  493. if (((*a)->ip6)&&(b->second->ip6)) {
  494. // Introduce source to destination (V6)
  495. Packet outp(source,s_self.address(),Packet::VERB_RENDEZVOUS);
  496. outp.append((uint8_t)0);
  497. dest.appendTo(outp);
  498. outp.append((uint16_t)b->second->ip6.port());
  499. outp.append((uint8_t)16);
  500. outp.append((const uint8_t *)(b->second->ip6.rawIpData()),16);
  501. outp.armor((*a)->key,true);
  502. sendto(v6s,outp.data(),outp.size(),SENDTO_FLAGS,(const struct sockaddr *)&((*a)->ip6),(socklen_t)sizeof(struct sockaddr_in6));
  503. s_outputRate.log(now,outp.size());
  504. (*a)->lastSend = now;
  505. // Introduce destination to source (V6)
  506. outp.reset(dest,s_self.address(),Packet::VERB_RENDEZVOUS);
  507. outp.append((uint8_t)0);
  508. source.appendTo(outp);
  509. outp.append((uint16_t)(*a)->ip6.port());
  510. outp.append((uint8_t)16);
  511. outp.append((const uint8_t *)((*a)->ip6.rawIpData()),16);
  512. outp.armor(b->second->key,true);
  513. sendto(v6s,outp.data(),outp.size(),SENDTO_FLAGS,(const struct sockaddr *)&(b->second->ip6),(socklen_t)sizeof(struct sockaddr_in6));
  514. s_outputRate.log(now,outp.size());
  515. b->second->lastSend = now;
  516. }
  517. if (((*a)->ip4)&&(b->second->ip4)) {
  518. // Introduce source to destination (V4)
  519. Packet outp(source,s_self.address(),Packet::VERB_RENDEZVOUS);
  520. outp.append((uint8_t)0);
  521. dest.appendTo(outp);
  522. outp.append((uint16_t)b->second->ip4.port());
  523. outp.append((uint8_t)4);
  524. outp.append((const uint8_t *)b->second->ip4.rawIpData(),4);
  525. outp.armor((*a)->key,true);
  526. sendto(v4s,outp.data(),outp.size(),SENDTO_FLAGS,(const struct sockaddr *)&((*a)->ip4),(socklen_t)sizeof(struct sockaddr_in));
  527. s_outputRate.log(now,outp.size());
  528. (*a)->lastSend = now;
  529. // Introduce destination to source (V4)
  530. outp.reset(dest,s_self.address(),Packet::VERB_RENDEZVOUS);
  531. outp.append((uint8_t)0);
  532. source.appendTo(outp);
  533. outp.append((uint16_t)(*a)->ip4.port());
  534. outp.append((uint8_t)4);
  535. outp.append((const uint8_t *)((*a)->ip4.rawIpData()),4);
  536. outp.armor(b->second->key,true);
  537. sendto(v4s,outp.data(),outp.size(),SENDTO_FLAGS,(const struct sockaddr *)&(b->second->ip4),(socklen_t)sizeof(struct sockaddr_in));
  538. s_outputRate.log(now,outp.size());
  539. b->second->lastSend = now;
  540. }
  541. }
  542. }
  543. }
  544. }
  545. for(auto i=toAddrs.begin();i!=toAddrs.end();++i) {
  546. if (sendto(i->first->isV4() ? v4s : v6s,pkt.data(),pkt.size(),SENDTO_FLAGS,(const struct sockaddr *)i->first,(socklen_t)(i->first->isV4() ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6))) > 0) {
  547. s_outputRate.log(now,pkt.size());
  548. s_forwardRate.log(now,pkt.size());
  549. i->second->lastSend = now;
  550. }
  551. }
  552. }
  553. //////////////////////////////////////////////////////////////////////////////
  554. //////////////////////////////////////////////////////////////////////////////
  555. static int bindSocket(struct sockaddr *const bindAddr)
  556. {
  557. const int s = socket(bindAddr->sa_family,SOCK_DGRAM,0);
  558. if (s < 0) {
  559. close(s);
  560. return -1;
  561. }
  562. int f = 16777216;
  563. while (f > 131072) {
  564. if (setsockopt(s,SOL_SOCKET,SO_RCVBUF,(const char *)&f,sizeof(f)) == 0)
  565. break;
  566. f -= 131072;
  567. }
  568. f = 16777216;
  569. while (f > 131072) {
  570. if (setsockopt(s,SOL_SOCKET,SO_SNDBUF,(const char *)&f,sizeof(f)) == 0)
  571. break;
  572. f -= 131072;
  573. }
  574. if (bindAddr->sa_family == AF_INET6) {
  575. f = 1; setsockopt(s,IPPROTO_IPV6,IPV6_V6ONLY,(void *)&f,sizeof(f));
  576. #ifdef IPV6_MTU_DISCOVER
  577. f = 0; setsockopt(s,IPPROTO_IPV6,IPV6_MTU_DISCOVER,&f,sizeof(f));
  578. #endif
  579. #ifdef IPV6_DONTFRAG
  580. f = 0; setsockopt(s,IPPROTO_IPV6,IPV6_DONTFRAG,&f,sizeof(f));
  581. #endif
  582. }
  583. #ifdef IP_DONTFRAG
  584. f = 0; setsockopt(s,IPPROTO_IP,IP_DONTFRAG,&f,sizeof(f));
  585. #endif
  586. #ifdef IP_MTU_DISCOVER
  587. f = IP_PMTUDISC_DONT; setsockopt(s,IPPROTO_IP,IP_MTU_DISCOVER,&f,sizeof(f));
  588. #endif
  589. /*
  590. #ifdef SO_NO_CHECK
  591. if (bindAddr->sa_family == AF_INET) {
  592. f = 1; setsockopt(s,SOL_SOCKET,SO_NO_CHECK,(void *)&f,sizeof(f));
  593. }
  594. #endif
  595. */
  596. #ifdef SO_REUSEPORT
  597. f = 1; setsockopt(s,SOL_SOCKET,SO_REUSEPORT,(void *)&f,sizeof(f));
  598. #endif
  599. #ifndef __LINUX__ // linux wants just SO_REUSEPORT
  600. f = 1; setsockopt(s,SOL_SOCKET,SO_REUSEADDR,(void *)&f,sizeof(f));
  601. #endif
  602. #ifdef __LINUX__
  603. struct timeval tv;
  604. tv.tv_sec = 1;
  605. tv.tv_usec = 0;
  606. setsockopt(s,SOL_SOCKET,SO_RCVTIMEO,(const void *)&tv,sizeof(tv));
  607. #endif
  608. if (bind(s,bindAddr,(bindAddr->sa_family == AF_INET) ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6))) {
  609. close(s);
  610. //printf("%s\n",strerror(errno));
  611. return -1;
  612. }
  613. return s;
  614. }
  615. static void shutdownSigHandler(int sig)
  616. {
  617. s_run = false;
  618. }
  619. int main(int argc,char **argv)
  620. {
  621. std::vector<std::thread> threads;
  622. std::vector<int> sockets;
  623. int v4Sock = -1,v6Sock = -1;
  624. signal(SIGTERM,shutdownSigHandler);
  625. signal(SIGINT,shutdownSigHandler);
  626. signal(SIGQUIT,shutdownSigHandler);
  627. signal(SIGPIPE,SIG_IGN);
  628. signal(SIGUSR1,SIG_IGN);
  629. signal(SIGUSR2,SIG_IGN);
  630. signal(SIGCHLD,SIG_IGN);
  631. s_startTime = OSUtils::now();
  632. s_geoInit = false;
  633. if (argc < 3) {
  634. printf("Usage: zerotier-root <identity.secret> <config path>" ZT_EOL_S);
  635. return 1;
  636. }
  637. {
  638. std::string myIdStr;
  639. if (!OSUtils::readFile(argv[1],myIdStr)) {
  640. printf("FATAL: cannot read identity.secret at %s" ZT_EOL_S,argv[1]);
  641. return 1;
  642. }
  643. if (!s_self.fromString(myIdStr.c_str())) {
  644. printf("FATAL: cannot read identity.secret at %s (invalid identity)" ZT_EOL_S,argv[1]);
  645. return 1;
  646. }
  647. if (!s_self.hasPrivate()) {
  648. printf("FATAL: cannot read identity.secret at %s (missing secret key)" ZT_EOL_S,argv[1]);
  649. return 1;
  650. }
  651. }
  652. {
  653. std::string configStr;
  654. if (!OSUtils::readFile(argv[2],configStr)) {
  655. printf("FATAL: cannot read config file at %s" ZT_EOL_S,argv[2]);
  656. return 1;
  657. }
  658. try {
  659. s_config = json::parse(configStr);
  660. } catch (std::exception &exc) {
  661. printf("FATAL: config file at %s invalid: %s" ZT_EOL_S,argv[2],exc.what());
  662. return 1;
  663. } catch ( ... ) {
  664. printf("FATAL: config file at %s invalid: unknown exception" ZT_EOL_S,argv[2]);
  665. return 1;
  666. }
  667. if (!s_config.is_object()) {
  668. printf("FATAL: config file at %s invalid: does not contain a JSON object" ZT_EOL_S,argv[2]);
  669. return 1;
  670. }
  671. }
  672. try {
  673. auto jport = s_config["port"];
  674. if (jport.is_array()) {
  675. for(long i=0;i<(long)jport.size();++i) {
  676. int port = jport[i];
  677. if ((port <= 0)||(port > 65535)) {
  678. printf("FATAL: invalid port in config file %d" ZT_EOL_S,port);
  679. return 1;
  680. }
  681. s_ports.push_back(port);
  682. }
  683. } else {
  684. int port = jport;
  685. if ((port <= 0)||(port > 65535)) {
  686. printf("FATAL: invalid port in config file %d" ZT_EOL_S,port);
  687. return 1;
  688. }
  689. s_ports.push_back(port);
  690. }
  691. } catch ( ... ) {}
  692. if (s_ports.empty())
  693. s_ports.push_back(ZT_DEFAULT_PORT);
  694. std::sort(s_ports.begin(),s_ports.end());
  695. int httpPort = ZT_DEFAULT_PORT;
  696. try {
  697. httpPort = s_config["httpPort"];
  698. if ((httpPort <= 0)||(httpPort > 65535)) {
  699. printf("FATAL: invalid HTTP port in config file %d" ZT_EOL_S,httpPort);
  700. return 1;
  701. }
  702. } catch ( ... ) {
  703. httpPort = ZT_DEFAULT_PORT;
  704. }
  705. std::string planetFilePath;
  706. try {
  707. planetFilePath = s_config["planetFile"];
  708. } catch ( ... ) {
  709. planetFilePath = "";
  710. }
  711. try {
  712. s_statsRoot = s_config["statsRoot"];
  713. while ((s_statsRoot.length() > 0)&&(s_statsRoot[s_statsRoot.length()-1] == ZT_PATH_SEPARATOR))
  714. s_statsRoot = s_statsRoot.substr(0,s_statsRoot.length()-1);
  715. if (s_statsRoot.length() > 0)
  716. OSUtils::mkdir(s_statsRoot);
  717. } catch ( ... ) {
  718. s_statsRoot = "";
  719. }
  720. s_relayMaxHops = ZT_RELAY_MAX_HOPS;
  721. try {
  722. s_relayMaxHops = s_config["relayMaxHops"];
  723. if (s_relayMaxHops > ZT_PROTO_MAX_HOPS)
  724. s_relayMaxHops = ZT_PROTO_MAX_HOPS;
  725. else if (s_relayMaxHops < 0)
  726. s_relayMaxHops = 0;
  727. } catch ( ... ) {
  728. s_relayMaxHops = ZT_RELAY_MAX_HOPS;
  729. }
  730. try {
  731. s_googleMapsAPIKey = s_config["googleMapsAPIKey"];
  732. std::string geoIpPath = s_config["geoIp"];
  733. if (geoIpPath.length() > 0) {
  734. FILE *gf = fopen(geoIpPath.c_str(),"rb");
  735. if (gf) {
  736. threads.emplace_back(std::thread([gf]() {
  737. try {
  738. char line[1024];
  739. line[1023] = 0;
  740. while (fgets(line,sizeof(line)-1,gf)) {
  741. InetAddress start,end;
  742. float lat = 0.0F,lon = 0.0F;
  743. int field = 0;
  744. for(char *saveptr=nullptr,*f=Utils::stok(line,",\r\n",&saveptr);(f);f=Utils::stok(nullptr,",\r\n",&saveptr)) {
  745. switch(field++) {
  746. case 0:
  747. start.fromString(f);
  748. break;
  749. case 1:
  750. end.fromString(f);
  751. break;
  752. case 2:
  753. lat = strtof(f,nullptr);
  754. break;
  755. case 3:
  756. lon = strtof(f,nullptr);
  757. break;
  758. }
  759. }
  760. if ((start)&&(end)&&(start.ss_family == end.ss_family)&&(lat >= -90.0F)&&(lat <= 90.0F)&&(lon >= -180.0F)&&(lon <= 180.0F)) {
  761. if (start.ss_family == AF_INET) {
  762. s_geoIp4[std::pair< uint32_t,uint32_t >(ip4ToH32(start),ip4ToH32(end))] = std::pair< float,float >(lat,lon);
  763. } else if (start.ss_family == AF_INET6) {
  764. s_geoIp6[std::pair< std::array< uint64_t,2 >,std::array< uint64_t,2 > >(ip6ToH128(start),ip6ToH128(end))] = std::pair< float,float >(lat,lon);
  765. }
  766. }
  767. }
  768. s_geoInit = true;
  769. } catch ( ... ) {}
  770. fclose(gf);
  771. }));
  772. }
  773. }
  774. } catch ( ... ) {}
  775. unsigned int ncores = std::thread::hardware_concurrency();
  776. if (ncores == 0) ncores = 1;
  777. s_run = true;
  778. for(auto port=s_ports.begin();port!=s_ports.end();++port) {
  779. for(unsigned int tn=0;tn<ncores;++tn) {
  780. struct sockaddr_in6 in6;
  781. memset(&in6,0,sizeof(in6));
  782. in6.sin6_family = AF_INET6;
  783. in6.sin6_port = htons((uint16_t)*port);
  784. const int s6 = bindSocket((struct sockaddr *)&in6);
  785. if (s6 < 0) {
  786. std::cout << "ERROR: unable to bind to port " << *port << ZT_EOL_S;
  787. exit(1);
  788. }
  789. struct sockaddr_in in4;
  790. memset(&in4,0,sizeof(in4));
  791. in4.sin_family = AF_INET;
  792. in4.sin_port = htons((uint16_t)*port);
  793. const int s4 = bindSocket((struct sockaddr *)&in4);
  794. if (s4 < 0) {
  795. std::cout << "ERROR: unable to bind to port " << *port << ZT_EOL_S;
  796. exit(1);
  797. }
  798. sockets.push_back(s6);
  799. sockets.push_back(s4);
  800. if (v4Sock < 0) v4Sock = s4;
  801. if (v6Sock < 0) v6Sock = s6;
  802. threads.push_back(std::thread([s6,s4]() {
  803. struct sockaddr_in6 in6;
  804. Packet pkt;
  805. memset(&in6,0,sizeof(in6));
  806. for(;;) {
  807. socklen_t sl = sizeof(in6);
  808. const int pl = (int)recvfrom(s6,pkt.unsafeData(),pkt.capacity(),RECVFROM_FLAGS,(struct sockaddr *)&in6,&sl);
  809. if (pl > 0) {
  810. if (pl >= ZT_PROTO_MIN_FRAGMENT_LENGTH) {
  811. try {
  812. pkt.setSize((unsigned int)pl);
  813. handlePacket(s4,s6,reinterpret_cast<const InetAddress *>(&in6),pkt);
  814. } catch (std::exception &exc) {
  815. char ipstr[128];
  816. printf("WARNING: unexpected exception handling packet from %s: %s" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in6)->toString(ipstr),exc.what());
  817. } catch (int exc) {
  818. char ipstr[128];
  819. printf("WARNING: unexpected exception handling packet from %s: ZT exception code %d" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in6)->toString(ipstr),exc);
  820. } catch ( ... ) {
  821. char ipstr[128];
  822. printf("WARNING: unexpected exception handling packet from %s: unknown exception" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in6)->toString(ipstr));
  823. }
  824. }
  825. } else if (!s_run) {
  826. break;
  827. }
  828. }
  829. }));
  830. threads.push_back(std::thread([s6,s4]() {
  831. struct sockaddr_in in4;
  832. Packet pkt;
  833. memset(&in4,0,sizeof(in4));
  834. for(;;) {
  835. socklen_t sl = sizeof(in4);
  836. const int pl = (int)recvfrom(s4,pkt.unsafeData(),pkt.capacity(),RECVFROM_FLAGS,(struct sockaddr *)&in4,&sl);
  837. if (pl > 0) {
  838. if (pl >= ZT_PROTO_MIN_FRAGMENT_LENGTH) {
  839. try {
  840. pkt.setSize((unsigned int)pl);
  841. handlePacket(s4,s6,reinterpret_cast<const InetAddress *>(&in4),pkt);
  842. } catch (std::exception &exc) {
  843. char ipstr[128];
  844. printf("WARNING: unexpected exception handling packet from %s: %s" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in4)->toString(ipstr),exc.what());
  845. } catch (int exc) {
  846. char ipstr[128];
  847. printf("WARNING: unexpected exception handling packet from %s: ZT exception code %d" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in4)->toString(ipstr),exc);
  848. } catch ( ... ) {
  849. char ipstr[128];
  850. printf("WARNING: unexpected exception handling packet from %s: unknown exception" ZT_EOL_S,reinterpret_cast<const InetAddress *>(&in4)->toString(ipstr));
  851. }
  852. }
  853. } else if (!s_run) {
  854. break;
  855. }
  856. }
  857. }));
  858. }
  859. }
  860. // A minimal read-only local API for monitoring and status queries
  861. httplib::Server apiServ;
  862. threads.push_back(std::thread([&apiServ,httpPort]() {
  863. // Human readable status page
  864. apiServ.Get("/",[](const httplib::Request &req,httplib::Response &res) {
  865. std::ostringstream o;
  866. o << "ZeroTier Root Server " << ZEROTIER_ONE_VERSION_MAJOR << '.' << ZEROTIER_ONE_VERSION_MINOR << '.' << ZEROTIER_ONE_VERSION_REVISION << ZT_EOL_S;
  867. o << "(c)2019 ZeroTier, Inc." ZT_EOL_S "Licensed under the ZeroTier BSL 1.1" ZT_EOL_S ZT_EOL_S;
  868. s_peersByIdentity_l.lock();
  869. o << "Peers Online: " << s_peersByIdentity.size() << ZT_EOL_S;
  870. s_peersByIdentity_l.unlock();
  871. res.set_content(o.str(),"text/plain");
  872. });
  873. apiServ.Get("/metrics",[](const httplib::Request &req, httplib::Response &res) {
  874. std::ostringstream o;
  875. int64_t now = OSUtils::now();
  876. char buf[11];
  877. const char *root_id = s_self.address().toString(buf);
  878. o << "# HELP root_peers_online Number of active peers online" << ZT_EOL_S;
  879. o << "# TYPE root_peers_online gauge" << ZT_EOL_S;
  880. s_peersByIdentity_l.lock();
  881. o << "root_peers_online{root_id=\"" << root_id << "\"} " << s_peersByIdentity.size() << ZT_EOL_S;
  882. s_peersByIdentity_l.unlock();
  883. o << "# HELP root_input_rate Input rate MiB/s" << ZT_EOL_S;
  884. o << "# TYPE root_input_rate gauge" << ZT_EOL_S;
  885. o << "root_input_rate{root_id=\"" << root_id << "\"} " << std::setprecision(5) << (s_inputRate.perSecond(now)/1048576.0) << ZT_EOL_S;
  886. o << "# HELP root_output_rate Output rate MiB/s" << ZT_EOL_S;
  887. o << "# TYPE root_output_rate gauge" << ZT_EOL_S;
  888. o << "root_output_rate{root_id=\"" << root_id << "\"} " << std::setprecision(5) << (s_outputRate.perSecond(now)/1048576.0) << ZT_EOL_S;
  889. o << "# HELP root_forwarded_rate Forwarded packet rate MiB/s" << ZT_EOL_S;
  890. o << "# TYPE root_forwarded_rate gauge" << ZT_EOL_S;
  891. o << "root_forwarded_rate{root_id=\"" << root_id << "\"} " << std::setprecision(5) << (s_forwardRate.perSecond(now)/1048576.0) << ZT_EOL_S;
  892. o << "# HELP root_discarded_rate Discarded forwards MiB/s" << ZT_EOL_S;
  893. o << "# TYPE root_discarded_rate gauge" << ZT_EOL_S;
  894. o << "root_discarded_rate{root_id=\"" << root_id << "\"} " << std::setprecision(5) << (s_discardedForwardRate.perSecond(now)/1048576.0) << ZT_EOL_S;
  895. res.set_content(o.str(), "text/plain");
  896. });
  897. // Peer list for compatibility with software that monitors regular nodes
  898. apiServ.Get("/peer",[](const httplib::Request &req,httplib::Response &res) {
  899. char tmp[256];
  900. std::ostringstream o;
  901. o << '[';
  902. try {
  903. bool first = true;
  904. std::lock_guard<std::mutex> l(s_peers_l);
  905. for(auto p=s_peers.begin();p!=s_peers.end();++p) {
  906. if (first)
  907. first = false;
  908. else o << ',';
  909. o <<
  910. "{\"address\":\"" << (*p)->id.address().toString(tmp) << "\""
  911. ",\"latency\":-1"
  912. ",\"paths\":[";
  913. if ((*p)->ip4) {
  914. o <<
  915. "{\"active\":true"
  916. ",\"address\":\"" << (*p)->ip4.toIpString(tmp) << "\\/" << (*p)->ip4.port() << "\""
  917. ",\"expired\":false"
  918. ",\"lastReceive\":" << (*p)->lastReceive <<
  919. ",\"lastSend\":" << (*p)->lastSend <<
  920. ",\"preferred\":true"
  921. ",\"trustedPathId\":0}";
  922. }
  923. if ((*p)->ip6) {
  924. if ((*p)->ip4)
  925. o << ',';
  926. o <<
  927. "{\"active\":true"
  928. ",\"address\":\"" << (*p)->ip6.toIpString(tmp) << "\\/" << (*p)->ip6.port() << "\""
  929. ",\"expired\":false"
  930. ",\"lastReceive\":" << (*p)->lastReceive <<
  931. ",\"lastSend\":" << (*p)->lastSend <<
  932. ",\"preferred\":" << (((*p)->ip4) ? "false" : "true") <<
  933. ",\"trustedPathId\":0}";
  934. }
  935. o << "]"
  936. ",\"role\":\"LEAF\""
  937. ",\"version\":\"" << (*p)->vMajor << '.' << (*p)->vMinor << '.' << (*p)->vRev << "\""
  938. ",\"versionMajor\":" << (*p)->vMajor <<
  939. ",\"versionMinor\":" << (*p)->vMinor <<
  940. ",\"versionRev\":" << (*p)->vRev << "}";
  941. }
  942. } catch ( ... ) {}
  943. o << ']';
  944. res.set_content(o.str(),"application/json");
  945. });
  946. // GeoIP map if enabled
  947. apiServ.Get("/map",[](const httplib::Request &req,httplib::Response &res) {
  948. char tmp[4096];
  949. if (!s_geoInit) {
  950. res.set_content("Not enabled or GeoIP CSV file not finished reading.","text/plain");
  951. return;
  952. }
  953. std::ostringstream o;
  954. o << ZT_GEOIP_HTML_HEAD;
  955. try {
  956. bool firstCoord = true;
  957. std::pair< uint32_t,uint32_t > k4(0,0xffffffff);
  958. std::pair< std::array< uint64_t,2 >,std::array< uint64_t,2 > > k6;
  959. k6.second[0] = 0xffffffffffffffffULL; k6.second[1] = 0xffffffffffffffffULL;
  960. std::unordered_map< InetAddress,std::set<Address>,InetAddressHasher > ips;
  961. {
  962. std::lock_guard<std::mutex> l(s_peers_l);
  963. for(auto p=s_peers.begin();p!=s_peers.end();++p) {
  964. if ((*p)->ip4)
  965. ips[(*p)->ip4].insert((*p)->id.address());
  966. if ((*p)->ip6)
  967. ips[(*p)->ip6].insert((*p)->id.address());
  968. }
  969. }
  970. for(auto p=ips.begin();p!=ips.end();++p) {
  971. if (p->first.isV4()) {
  972. k4.first = ip4ToH32(p->first);
  973. auto geo = std::map< std::pair< uint32_t,uint32_t >,std::pair< float,float > >::reverse_iterator(s_geoIp4.upper_bound(k4));
  974. uint32_t bestRangeSize = 0xffffffff;
  975. std::pair< float,float > bestRangeLatLon;
  976. while (geo != s_geoIp4.rend()) {
  977. if ((geo->first.first <= k4.first)&&(geo->first.second >= k4.first)) {
  978. uint32_t range = geo->first.second - geo->first.first;
  979. if (range <= bestRangeSize) {
  980. bestRangeSize = range;
  981. bestRangeLatLon = geo->second;
  982. }
  983. } else if ((geo->first.first < k4.first)&&(geo->first.second < k4.first)) {
  984. break;
  985. }
  986. ++geo;
  987. }
  988. if (bestRangeSize != 0xffffffff) {
  989. if (!firstCoord)
  990. o << ',';
  991. firstCoord = false;
  992. o << "{lat:" << bestRangeLatLon.first << ",lng:" << bestRangeLatLon.second << ",_l:\"";
  993. bool firstAddr = true;
  994. for(auto a=p->second.begin();a!=p->second.end();++a) {
  995. if (!firstAddr)
  996. o << ',';
  997. o << a->toString(tmp);
  998. firstAddr = false;
  999. }
  1000. o << "\"}";
  1001. }
  1002. } else if (p->first.isV6()) {
  1003. k6.first = ip6ToH128(p->first);
  1004. auto geo = std::map< std::pair< std::array< uint64_t,2 >,std::array< uint64_t,2 > >,std::pair< float,float > >::reverse_iterator(s_geoIp6.upper_bound(k6));
  1005. while (geo != s_geoIp6.rend()) {
  1006. if ((geo->first.first <= k6.first)&&(geo->first.second >= k6.first)) {
  1007. if (!firstCoord)
  1008. o << ',';
  1009. firstCoord = false;
  1010. o << "{lat:" << geo->second.first << ",lng:" << geo->second.second << ",_l:\"";
  1011. bool firstAddr = true;
  1012. for(auto a=p->second.begin();a!=p->second.end();++a) {
  1013. if (!firstAddr)
  1014. o << ',';
  1015. o << a->toString(tmp);
  1016. firstAddr = false;
  1017. }
  1018. o << "\"}";
  1019. break;
  1020. } else if ((geo->first.first < k6.first)&&(geo->first.second < k6.first)) {
  1021. break;
  1022. }
  1023. ++geo;
  1024. }
  1025. }
  1026. }
  1027. } catch ( ... ) {
  1028. res.set_content("Internal error: unexpected exception resolving GeoIP locations","text/plain");
  1029. return;
  1030. }
  1031. OSUtils::ztsnprintf(tmp,sizeof(tmp),ZT_GEOIP_HTML_TAIL,s_googleMapsAPIKey.c_str());
  1032. o << tmp;
  1033. res.set_content(o.str(),"text/html");
  1034. });
  1035. apiServ.listen("127.0.0.1",httpPort,0);
  1036. }));
  1037. // In the main thread periodically clean stuff up
  1038. int64_t lastCleaned = 0;
  1039. int64_t lastWroteStats = 0;
  1040. while (s_run) {
  1041. sleep(1);
  1042. const int64_t now = OSUtils::now();
  1043. if ((now - lastCleaned) > 300000) {
  1044. lastCleaned = now;
  1045. // Old multicast subscription cleanup
  1046. {
  1047. std::lock_guard<std::mutex> l(s_multicastSubscriptions_l);
  1048. for(auto a=s_multicastSubscriptions.begin();a!=s_multicastSubscriptions.end();) {
  1049. for(auto b=a->second.begin();b!=a->second.end();) {
  1050. for(auto c=b->second.begin();c!=b->second.end();) {
  1051. if ((now - c->second) > ZT_PEER_ACTIVITY_TIMEOUT)
  1052. b->second.erase(c++);
  1053. else ++c;
  1054. }
  1055. if (b->second.empty())
  1056. a->second.erase(b++);
  1057. else ++b;
  1058. }
  1059. if (a->second.empty())
  1060. s_multicastSubscriptions.erase(a++);
  1061. else ++a;
  1062. }
  1063. }
  1064. // Remove expired peers
  1065. try {
  1066. std::vector< SharedPtr<RootPeer> > toRemove;
  1067. toRemove.reserve(1024);
  1068. {
  1069. std::lock_guard<std::mutex> pbi_l(s_peers_l);
  1070. for(auto p=s_peers.begin();p!=s_peers.end();) {
  1071. if ((now - (*p)->lastReceive) > ZT_PEER_ACTIVITY_TIMEOUT) {
  1072. toRemove.emplace_back(*p);
  1073. s_peers.erase(p++);
  1074. } else ++p;
  1075. }
  1076. }
  1077. for(auto p=toRemove.begin();p!=toRemove.end();++p) {
  1078. {
  1079. std::lock_guard<std::mutex> pbi_l(s_peersByIdentity_l);
  1080. s_peersByIdentity.erase((*p)->id);
  1081. }
  1082. {
  1083. std::lock_guard<std::mutex> pbv_l(s_peersByVirtAddr_l);
  1084. auto pbv = s_peersByVirtAddr.find((*p)->id.address());
  1085. if (pbv != s_peersByVirtAddr.end()) {
  1086. pbv->second.erase(*p);
  1087. if (pbv->second.empty())
  1088. s_peersByVirtAddr.erase(pbv);
  1089. }
  1090. }
  1091. }
  1092. } catch ( ... ) {}
  1093. // Remove old rendezvous entries
  1094. {
  1095. std::lock_guard<std::mutex> l(s_rendezvousTracking_l);
  1096. for(auto lr=s_rendezvousTracking.begin();lr!=s_rendezvousTracking.end();) {
  1097. if ((now - lr->second.ts) > ZT_PEER_ACTIVITY_TIMEOUT)
  1098. s_rendezvousTracking.erase(lr++);
  1099. else ++lr;
  1100. }
  1101. }
  1102. }
  1103. // Write stats if configured to do so, and periodically refresh planet file (if any)
  1104. if (((now - lastWroteStats) > 15000)&&(s_statsRoot.length() > 0)) {
  1105. lastWroteStats = now;
  1106. try {
  1107. if (planetFilePath.length() > 0) {
  1108. std::string planetData;
  1109. if ((OSUtils::readFile(planetFilePath.c_str(),planetData))&&(planetData.length() > 0)) {
  1110. std::lock_guard<std::mutex> pl(s_planet_l);
  1111. s_planet = planetData;
  1112. }
  1113. }
  1114. } catch ( ... ) {
  1115. std::lock_guard<std::mutex> pl(s_planet_l);
  1116. s_planet.clear();
  1117. }
  1118. std::string peersFilePath(s_statsRoot);
  1119. peersFilePath.append("/.peers.tmp");
  1120. FILE *pf = fopen(peersFilePath.c_str(),"wb");
  1121. if (pf) {
  1122. std::vector< SharedPtr<RootPeer> > sp;
  1123. {
  1124. std::lock_guard<std::mutex> pbi_l(s_peers_l);
  1125. sp.reserve(s_peers.size());
  1126. for(auto p=s_peers.begin();p!=s_peers.end();++p) {
  1127. sp.emplace_back(*p);
  1128. }
  1129. }
  1130. std::sort(sp.begin(),sp.end(),[](const SharedPtr<RootPeer> &a,const SharedPtr<RootPeer> &b) { return (a->id < b->id); });
  1131. fprintf(pf,"Address %21s %45s %10s %6s %10s" ZT_EOL_S,"IPv4","IPv6","Age(sec)","Vers","Fwd(KiB/s)");
  1132. {
  1133. char ip4[128],ip6[128],ver[128];
  1134. for(auto p=sp.begin();p!=sp.end();++p) {
  1135. if ((*p)->ip4) {
  1136. (*p)->ip4.toString(ip4);
  1137. } else {
  1138. ip4[0] = '-';
  1139. ip4[1] = 0;
  1140. }
  1141. if ((*p)->ip6) {
  1142. (*p)->ip6.toString(ip6);
  1143. } else {
  1144. ip6[0] = '-';
  1145. ip6[1] = 0;
  1146. }
  1147. OSUtils::ztsnprintf(ver,sizeof(ver),"%d.%d.%d",(*p)->vMajor,(*p)->vMinor,(*p)->vRev);
  1148. fprintf(pf,"%.10llx %21s %45s %10.4f %6s" ZT_EOL_S,
  1149. (unsigned long long)(*p)->id.address().toInt(),
  1150. ip4,
  1151. ip6,
  1152. fabs((double)(now - (*p)->lastReceive) / 1000.0),
  1153. ver);
  1154. }
  1155. }
  1156. fclose(pf);
  1157. std::string peersFilePath2(s_statsRoot);
  1158. peersFilePath2.append("/peers");
  1159. OSUtils::rm(peersFilePath2);
  1160. OSUtils::rename(peersFilePath.c_str(),peersFilePath2.c_str());
  1161. }
  1162. std::string statsFilePath(s_statsRoot);
  1163. statsFilePath.append("/.stats.tmp");
  1164. FILE *sf = fopen(statsFilePath.c_str(),"wb");
  1165. if (sf) {
  1166. fprintf(sf,"Uptime (seconds) : %ld" ZT_EOL_S,(long)((now - s_startTime) / 1000));
  1167. s_peersByIdentity_l.lock();
  1168. auto peersByIdentitySize = s_peersByIdentity.size();
  1169. s_peersByIdentity_l.unlock();
  1170. fprintf(sf,"Peers : %llu" ZT_EOL_S,(unsigned long long)peersByIdentitySize);
  1171. s_peersByVirtAddr_l.lock();
  1172. fprintf(sf,"Virtual Address Collisions : %llu" ZT_EOL_S,(unsigned long long)(peersByIdentitySize - s_peersByVirtAddr.size()));
  1173. s_peersByVirtAddr_l.unlock();
  1174. s_rendezvousTracking_l.lock();
  1175. uint64_t unsuccessfulp2p = 0;
  1176. for(auto lr=s_rendezvousTracking.begin();lr!=s_rendezvousTracking.end();++lr) {
  1177. if (lr->second.count > 6) // 6 == two attempts per edge, one for each direction
  1178. ++unsuccessfulp2p;
  1179. }
  1180. fprintf(sf,"Recent P2P Graph Edges : %llu" ZT_EOL_S,(unsigned long long)s_rendezvousTracking.size());
  1181. if (s_rendezvousTracking.empty()) {
  1182. fprintf(sf,"Recent P2P Success Rate : 100.0000%%" ZT_EOL_S);
  1183. } else {
  1184. fprintf(sf,"Recent P2P Success Rate : %.4f%%" ZT_EOL_S,(1.0 - ((double)unsuccessfulp2p / (double)s_rendezvousTracking.size())) * 100.0);
  1185. }
  1186. s_rendezvousTracking_l.unlock();
  1187. fprintf(sf,"Input (MiB/s) : %.4f" ZT_EOL_S,s_inputRate.perSecond(now) / 1048576.0);
  1188. fprintf(sf,"Output (MiB/s) : %.4f" ZT_EOL_S,s_outputRate.perSecond(now) / 1048576.0);
  1189. fprintf(sf,"Forwarded (MiB/s) : %.4f" ZT_EOL_S,s_forwardRate.perSecond(now) / 1048576.0);
  1190. fprintf(sf,"Discarded Forward (MiB/s) : %.4f" ZT_EOL_S,s_discardedForwardRate.perSecond(now) / 1048576.0);
  1191. fclose(sf);
  1192. std::string statsFilePath2(s_statsRoot);
  1193. statsFilePath2.append("/stats");
  1194. OSUtils::rm(statsFilePath2);
  1195. OSUtils::rename(statsFilePath.c_str(),statsFilePath2.c_str());
  1196. }
  1197. }
  1198. }
  1199. // If we received a kill signal, close everything and wait
  1200. // for threads to die before exiting.
  1201. s_run = false; // sanity check
  1202. apiServ.stop();
  1203. for(auto s=sockets.begin();s!=sockets.end();++s) {
  1204. shutdown(*s,SHUT_RDWR);
  1205. close(*s);
  1206. }
  1207. for(auto t=threads.begin();t!=threads.end();++t)
  1208. t->join();
  1209. return 0;
  1210. }