Node.cpp 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2015 ZeroTier, Inc.
  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 <stdarg.h>
  30. #include <string.h>
  31. #include <stdint.h>
  32. #include "../version.h"
  33. #include "Constants.hpp"
  34. #include "Node.hpp"
  35. #include "RuntimeEnvironment.hpp"
  36. #include "NetworkController.hpp"
  37. #include "Switch.hpp"
  38. #include "Multicaster.hpp"
  39. #include "AntiRecursion.hpp"
  40. #include "Topology.hpp"
  41. #include "Buffer.hpp"
  42. #include "Packet.hpp"
  43. #include "Address.hpp"
  44. #include "Identity.hpp"
  45. #include "SelfAwareness.hpp"
  46. const struct sockaddr_storage ZT_SOCKADDR_NULL = {0};
  47. namespace ZeroTier {
  48. /****************************************************************************/
  49. /* Public Node interface (C++, exposed via CAPI bindings) */
  50. /****************************************************************************/
  51. Node::Node(
  52. uint64_t now,
  53. void *uptr,
  54. ZT_DataStoreGetFunction dataStoreGetFunction,
  55. ZT_DataStorePutFunction dataStorePutFunction,
  56. ZT_WirePacketSendFunction wirePacketSendFunction,
  57. ZT_VirtualNetworkFrameFunction virtualNetworkFrameFunction,
  58. ZT_VirtualNetworkConfigFunction virtualNetworkConfigFunction,
  59. ZT_EventCallback eventCallback) :
  60. _RR(this),
  61. RR(&_RR),
  62. _uPtr(uptr),
  63. _dataStoreGetFunction(dataStoreGetFunction),
  64. _dataStorePutFunction(dataStorePutFunction),
  65. _wirePacketSendFunction(wirePacketSendFunction),
  66. _virtualNetworkFrameFunction(virtualNetworkFrameFunction),
  67. _virtualNetworkConfigFunction(virtualNetworkConfigFunction),
  68. _eventCallback(eventCallback),
  69. _networks(),
  70. _networks_m(),
  71. _prngStreamPtr(0),
  72. _now(now),
  73. _lastPingCheck(0),
  74. _lastHousekeepingRun(0)
  75. {
  76. _online = false;
  77. // Use Salsa20 alone as a high-quality non-crypto PRNG
  78. {
  79. char foo[32];
  80. Utils::getSecureRandom(foo,32);
  81. _prng.init(foo,256,foo);
  82. memset(_prngStream,0,sizeof(_prngStream));
  83. _prng.encrypt12(_prngStream,_prngStream,sizeof(_prngStream));
  84. }
  85. std::string idtmp(dataStoreGet("identity.secret"));
  86. if ((!idtmp.length())||(!RR->identity.fromString(idtmp))||(!RR->identity.hasPrivate())) {
  87. TRACE("identity.secret not found, generating...");
  88. RR->identity.generate();
  89. idtmp = RR->identity.toString(true);
  90. if (!dataStorePut("identity.secret",idtmp,true))
  91. throw std::runtime_error("unable to write identity.secret");
  92. }
  93. RR->publicIdentityStr = RR->identity.toString(false);
  94. RR->secretIdentityStr = RR->identity.toString(true);
  95. idtmp = dataStoreGet("identity.public");
  96. if (idtmp != RR->publicIdentityStr) {
  97. if (!dataStorePut("identity.public",RR->publicIdentityStr,false))
  98. throw std::runtime_error("unable to write identity.public");
  99. }
  100. try {
  101. RR->sw = new Switch(RR);
  102. RR->mc = new Multicaster(RR);
  103. RR->antiRec = new AntiRecursion();
  104. RR->topology = new Topology(RR);
  105. RR->sa = new SelfAwareness(RR);
  106. } catch ( ... ) {
  107. delete RR->sa;
  108. delete RR->topology;
  109. delete RR->antiRec;
  110. delete RR->mc;
  111. delete RR->sw;
  112. throw;
  113. }
  114. postEvent(ZT_EVENT_UP);
  115. }
  116. Node::~Node()
  117. {
  118. Mutex::Lock _l(_networks_m);
  119. _networks.clear(); // ensure that networks are destroyed before shutdown
  120. delete RR->sa;
  121. delete RR->topology;
  122. delete RR->antiRec;
  123. delete RR->mc;
  124. delete RR->sw;
  125. }
  126. ZT_ResultCode Node::processWirePacket(
  127. uint64_t now,
  128. const struct sockaddr_storage *localAddress,
  129. const struct sockaddr_storage *remoteAddress,
  130. const void *packetData,
  131. unsigned int packetLength,
  132. volatile uint64_t *nextBackgroundTaskDeadline)
  133. {
  134. _now = now;
  135. RR->sw->onRemotePacket(*(reinterpret_cast<const InetAddress *>(localAddress)),*(reinterpret_cast<const InetAddress *>(remoteAddress)),packetData,packetLength);
  136. return ZT_RESULT_OK;
  137. }
  138. ZT_ResultCode Node::processVirtualNetworkFrame(
  139. uint64_t now,
  140. uint64_t nwid,
  141. uint64_t sourceMac,
  142. uint64_t destMac,
  143. unsigned int etherType,
  144. unsigned int vlanId,
  145. const void *frameData,
  146. unsigned int frameLength,
  147. volatile uint64_t *nextBackgroundTaskDeadline)
  148. {
  149. _now = now;
  150. SharedPtr<Network> nw(this->network(nwid));
  151. if (nw) {
  152. RR->sw->onLocalEthernet(nw,MAC(sourceMac),MAC(destMac),etherType,vlanId,frameData,frameLength);
  153. return ZT_RESULT_OK;
  154. } else return ZT_RESULT_ERROR_NETWORK_NOT_FOUND;
  155. }
  156. class _PingPeersThatNeedPing
  157. {
  158. public:
  159. _PingPeersThatNeedPing(const RuntimeEnvironment *renv,uint64_t now,const std::vector< std::pair<Address,InetAddress> > &relays) :
  160. lastReceiveFromUpstream(0),
  161. RR(renv),
  162. _now(now),
  163. _relays(relays),
  164. _world(RR->topology->world())
  165. {
  166. }
  167. uint64_t lastReceiveFromUpstream; // tracks last time we got a packet from an 'upstream' peer like a root or a relay
  168. inline void operator()(Topology &t,const SharedPtr<Peer> &p)
  169. {
  170. bool upstream = false;
  171. InetAddress stableEndpoint;
  172. for(std::vector<World::Root>::const_iterator r(_world.roots().begin());r!=_world.roots().end();++r) {
  173. if (r->identity.address() == p->address()) {
  174. if (r->stableEndpoints.size() > 0)
  175. stableEndpoint = r->stableEndpoints[(unsigned long)RR->node->prng() % r->stableEndpoints.size()];
  176. upstream = true;
  177. break;
  178. }
  179. }
  180. if (!upstream) {
  181. for(std::vector< std::pair<Address,InetAddress> >::const_iterator r(_relays.begin());r!=_relays.end();++r) {
  182. if (r->first == p->address()) {
  183. stableEndpoint = r->second;
  184. upstream = true;
  185. break;
  186. }
  187. }
  188. }
  189. if ((!p->doPingAndKeepalive(RR,_now))&&(stableEndpoint))
  190. p->attemptToContactAt(RR,InetAddress(),stableEndpoint,_now);
  191. if (upstream)
  192. lastReceiveFromUpstream = std::max(p->lastReceive(),lastReceiveFromUpstream);
  193. }
  194. private:
  195. const RuntimeEnvironment *RR;
  196. uint64_t _now;
  197. const std::vector< std::pair<Address,InetAddress> > &_relays;
  198. World _world;
  199. };
  200. ZT_ResultCode Node::processBackgroundTasks(uint64_t now,volatile uint64_t *nextBackgroundTaskDeadline)
  201. {
  202. _now = now;
  203. Mutex::Lock bl(_backgroundTasksLock);
  204. unsigned long timeUntilNextPingCheck = ZT_PING_CHECK_INVERVAL;
  205. const uint64_t timeSinceLastPingCheck = now - _lastPingCheck;
  206. if (timeSinceLastPingCheck >= ZT_PING_CHECK_INVERVAL) {
  207. try {
  208. _lastPingCheck = now;
  209. // Get relays and networks that need config without leaving the mutex locked
  210. std::vector< std::pair<Address,InetAddress> > networkRelays;
  211. std::vector< SharedPtr<Network> > needConfig;
  212. {
  213. Mutex::Lock _l(_networks_m);
  214. for(std::vector< std::pair< uint64_t,SharedPtr<Network> > >::const_iterator n(_networks.begin());n!=_networks.end();++n) {
  215. SharedPtr<NetworkConfig> nc(n->second->config2());
  216. if (((now - n->second->lastConfigUpdate()) >= ZT_NETWORK_AUTOCONF_DELAY)||(!nc))
  217. needConfig.push_back(n->second);
  218. if (nc)
  219. networkRelays.insert(networkRelays.end(),nc->relays().begin(),nc->relays().end());
  220. }
  221. }
  222. // Request updated configuration for networks that need it
  223. for(std::vector< SharedPtr<Network> >::const_iterator n(needConfig.begin());n!=needConfig.end();++n)
  224. (*n)->requestConfiguration();
  225. // Attempt to contact network preferred relays that we don't have direct links to
  226. std::sort(networkRelays.begin(),networkRelays.end());
  227. networkRelays.erase(std::unique(networkRelays.begin(),networkRelays.end()),networkRelays.end());
  228. for(std::vector< std::pair<Address,InetAddress> >::const_iterator nr(networkRelays.begin());nr!=networkRelays.end();++nr) {
  229. if (nr->second) {
  230. SharedPtr<Peer> rp(RR->topology->getPeer(nr->first));
  231. if ((rp)&&(!rp->hasActiveDirectPath(now)))
  232. rp->attemptToContactAt(RR,InetAddress(),nr->second,now);
  233. }
  234. }
  235. // Ping living or root server/relay peers
  236. _PingPeersThatNeedPing pfunc(RR,now,networkRelays);
  237. RR->topology->eachPeer<_PingPeersThatNeedPing &>(pfunc);
  238. // Update online status, post status change as event
  239. bool oldOnline = _online;
  240. _online = ((now - pfunc.lastReceiveFromUpstream) < ZT_PEER_ACTIVITY_TIMEOUT);
  241. if (oldOnline != _online)
  242. postEvent(_online ? ZT_EVENT_ONLINE : ZT_EVENT_OFFLINE);
  243. } catch ( ... ) {
  244. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  245. }
  246. } else {
  247. timeUntilNextPingCheck -= (unsigned long)timeSinceLastPingCheck;
  248. }
  249. if ((now - _lastHousekeepingRun) >= ZT_HOUSEKEEPING_PERIOD) {
  250. try {
  251. _lastHousekeepingRun = now;
  252. RR->topology->clean(now);
  253. RR->sa->clean(now);
  254. RR->mc->clean(now);
  255. } catch ( ... ) {
  256. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  257. }
  258. }
  259. try {
  260. *nextBackgroundTaskDeadline = now + (uint64_t)std::max(std::min(timeUntilNextPingCheck,RR->sw->doTimerTasks(now)),(unsigned long)ZT_CORE_TIMER_TASK_GRANULARITY);
  261. } catch ( ... ) {
  262. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  263. }
  264. return ZT_RESULT_OK;
  265. }
  266. ZT_ResultCode Node::join(uint64_t nwid)
  267. {
  268. Mutex::Lock _l(_networks_m);
  269. SharedPtr<Network> nw = _network(nwid);
  270. if(!nw)
  271. _networks.push_back(std::pair< uint64_t,SharedPtr<Network> >(nwid,SharedPtr<Network>(new Network(RR,nwid))));
  272. std::sort(_networks.begin(),_networks.end()); // will sort by nwid since it's the first in a pair<>
  273. return ZT_RESULT_OK;
  274. }
  275. ZT_ResultCode Node::leave(uint64_t nwid)
  276. {
  277. std::vector< std::pair< uint64_t,SharedPtr<Network> > > newn;
  278. Mutex::Lock _l(_networks_m);
  279. for(std::vector< std::pair< uint64_t,SharedPtr<Network> > >::const_iterator n(_networks.begin());n!=_networks.end();++n) {
  280. if (n->first != nwid)
  281. newn.push_back(*n);
  282. else n->second->destroy();
  283. }
  284. _networks.swap(newn);
  285. return ZT_RESULT_OK;
  286. }
  287. ZT_ResultCode Node::multicastSubscribe(uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi)
  288. {
  289. SharedPtr<Network> nw(this->network(nwid));
  290. if (nw) {
  291. nw->multicastSubscribe(MulticastGroup(MAC(multicastGroup),(uint32_t)(multicastAdi & 0xffffffff)));
  292. return ZT_RESULT_OK;
  293. } else return ZT_RESULT_ERROR_NETWORK_NOT_FOUND;
  294. }
  295. ZT_ResultCode Node::multicastUnsubscribe(uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi)
  296. {
  297. SharedPtr<Network> nw(this->network(nwid));
  298. if (nw) {
  299. nw->multicastUnsubscribe(MulticastGroup(MAC(multicastGroup),(uint32_t)(multicastAdi & 0xffffffff)));
  300. return ZT_RESULT_OK;
  301. } else return ZT_RESULT_ERROR_NETWORK_NOT_FOUND;
  302. }
  303. uint64_t Node::address() const
  304. {
  305. return RR->identity.address().toInt();
  306. }
  307. void Node::status(ZT_NodeStatus *status) const
  308. {
  309. status->address = RR->identity.address().toInt();
  310. status->worldId = RR->topology->worldId();
  311. status->worldTimestamp = RR->topology->worldTimestamp();
  312. status->publicIdentity = RR->publicIdentityStr.c_str();
  313. status->secretIdentity = RR->secretIdentityStr.c_str();
  314. status->online = _online ? 1 : 0;
  315. }
  316. ZT_PeerList *Node::peers() const
  317. {
  318. std::vector< std::pair< Address,SharedPtr<Peer> > > peers(RR->topology->allPeers());
  319. std::sort(peers.begin(),peers.end());
  320. char *buf = (char *)::malloc(sizeof(ZT_PeerList) + (sizeof(ZT_Peer) * peers.size()));
  321. if (!buf)
  322. return (ZT_PeerList *)0;
  323. ZT_PeerList *pl = (ZT_PeerList *)buf;
  324. pl->peers = (ZT_Peer *)(buf + sizeof(ZT_PeerList));
  325. pl->peerCount = 0;
  326. for(std::vector< std::pair< Address,SharedPtr<Peer> > >::iterator pi(peers.begin());pi!=peers.end();++pi) {
  327. ZT_Peer *p = &(pl->peers[pl->peerCount++]);
  328. p->address = pi->second->address().toInt();
  329. p->lastUnicastFrame = pi->second->lastUnicastFrame();
  330. p->lastMulticastFrame = pi->second->lastMulticastFrame();
  331. if (pi->second->remoteVersionKnown()) {
  332. p->versionMajor = pi->second->remoteVersionMajor();
  333. p->versionMinor = pi->second->remoteVersionMinor();
  334. p->versionRev = pi->second->remoteVersionRevision();
  335. } else {
  336. p->versionMajor = -1;
  337. p->versionMinor = -1;
  338. p->versionRev = -1;
  339. }
  340. p->latency = pi->second->latency();
  341. p->role = RR->topology->isRoot(pi->second->identity()) ? ZT_PEER_ROLE_ROOT : ZT_PEER_ROLE_LEAF;
  342. std::vector<RemotePath> paths(pi->second->paths());
  343. RemotePath *bestPath = pi->second->getBestPath(_now);
  344. p->pathCount = 0;
  345. for(std::vector<RemotePath>::iterator path(paths.begin());path!=paths.end();++path) {
  346. memcpy(&(p->paths[p->pathCount].address),&(path->address()),sizeof(struct sockaddr_storage));
  347. p->paths[p->pathCount].lastSend = path->lastSend();
  348. p->paths[p->pathCount].lastReceive = path->lastReceived();
  349. p->paths[p->pathCount].active = path->active(_now) ? 1 : 0;
  350. p->paths[p->pathCount].preferred = ((bestPath)&&(*path == *bestPath)) ? 1 : 0;
  351. ++p->pathCount;
  352. }
  353. }
  354. return pl;
  355. }
  356. ZT_VirtualNetworkConfig *Node::networkConfig(uint64_t nwid) const
  357. {
  358. Mutex::Lock _l(_networks_m);
  359. SharedPtr<Network> nw = _network(nwid);
  360. if(nw) {
  361. ZT_VirtualNetworkConfig *nc = (ZT_VirtualNetworkConfig *)::malloc(sizeof(ZT_VirtualNetworkConfig));
  362. nw->externalConfig(nc);
  363. return nc;
  364. }
  365. return (ZT_VirtualNetworkConfig *)0;
  366. }
  367. ZT_VirtualNetworkList *Node::networks() const
  368. {
  369. Mutex::Lock _l(_networks_m);
  370. char *buf = (char *)::malloc(sizeof(ZT_VirtualNetworkList) + (sizeof(ZT_VirtualNetworkConfig) * _networks.size()));
  371. if (!buf)
  372. return (ZT_VirtualNetworkList *)0;
  373. ZT_VirtualNetworkList *nl = (ZT_VirtualNetworkList *)buf;
  374. nl->networks = (ZT_VirtualNetworkConfig *)(buf + sizeof(ZT_VirtualNetworkList));
  375. nl->networkCount = 0;
  376. for(std::vector< std::pair< uint64_t,SharedPtr<Network> > >::const_iterator n(_networks.begin());n!=_networks.end();++n)
  377. n->second->externalConfig(&(nl->networks[nl->networkCount++]));
  378. return nl;
  379. }
  380. void Node::freeQueryResult(void *qr)
  381. {
  382. if (qr)
  383. ::free(qr);
  384. }
  385. int Node::addLocalInterfaceAddress(const struct sockaddr_storage *addr,int metric,ZT_LocalInterfaceAddressTrust trust)
  386. {
  387. if (Path::isAddressValidForPath(*(reinterpret_cast<const InetAddress *>(addr)))) {
  388. Mutex::Lock _l(_directPaths_m);
  389. _directPaths.push_back(Path(*(reinterpret_cast<const InetAddress *>(addr)),metric,(Path::Trust)trust));
  390. std::sort(_directPaths.begin(),_directPaths.end());
  391. _directPaths.erase(std::unique(_directPaths.begin(),_directPaths.end()),_directPaths.end());
  392. return 1;
  393. }
  394. return 0;
  395. }
  396. void Node::clearLocalInterfaceAddresses()
  397. {
  398. Mutex::Lock _l(_directPaths_m);
  399. _directPaths.clear();
  400. }
  401. void Node::setNetconfMaster(void *networkControllerInstance)
  402. {
  403. RR->localNetworkController = reinterpret_cast<NetworkController *>(networkControllerInstance);
  404. }
  405. ZT_ResultCode Node::circuitTestBegin(ZT_CircuitTest *test,void (*reportCallback)(ZT_Node *,ZT_CircuitTest *,const ZT_CircuitTestReport *))
  406. {
  407. if (test->hopCount > 0) {
  408. try {
  409. Packet outp(Address(),RR->identity.address(),Packet::VERB_CIRCUIT_TEST);
  410. RR->identity.address().appendTo(outp);
  411. outp.append((uint16_t)((test->reportAtEveryHop != 0) ? 0x03 : 0x02));
  412. outp.append((uint64_t)test->timestamp);
  413. outp.append((uint64_t)test->testId);
  414. outp.append((uint16_t)0); // originator credential length, updated later
  415. if (test->credentialNetworkId) {
  416. outp.append((uint8_t)0x01);
  417. outp.append((uint64_t)test->credentialNetworkId);
  418. outp.setAt<uint16_t>(ZT_PACKET_IDX_PAYLOAD + 23,(uint16_t)9);
  419. }
  420. outp.append((uint16_t)0);
  421. C25519::Signature sig(RR->identity.sign(reinterpret_cast<const char *>(outp.data()) + ZT_PACKET_IDX_PAYLOAD,outp.size() - ZT_PACKET_IDX_PAYLOAD));
  422. outp.append((uint16_t)sig.size());
  423. outp.append(sig.data,sig.size());
  424. outp.append((uint16_t)0); // originator doesn't need an extra credential, since it's the originator
  425. for(unsigned int h=1;h<test->hopCount;++h) {
  426. outp.append((uint8_t)0);
  427. outp.append((uint8_t)(test->hops[h].breadth & 0xff));
  428. for(unsigned int a=0;a<test->hops[h].breadth;++a)
  429. Address(test->hops[h].addresses[a]).appendTo(outp);
  430. }
  431. for(unsigned int a=0;a<test->hops[0].breadth;++a) {
  432. outp.newInitializationVector();
  433. outp.setDestination(Address(test->hops[0].addresses[a]));
  434. RR->sw->send(outp,true,0);
  435. }
  436. } catch ( ... ) {
  437. return ZT_RESULT_FATAL_ERROR_INTERNAL; // probably indicates FIFO too big for packet
  438. }
  439. }
  440. {
  441. test->_internalPtr = reinterpret_cast<void *>(reportCallback);
  442. Mutex::Lock _l(_circuitTests_m);
  443. if (std::find(_circuitTests.begin(),_circuitTests.end(),test) == _circuitTests.end())
  444. _circuitTests.push_back(test);
  445. }
  446. return ZT_RESULT_OK;
  447. }
  448. void Node::circuitTestEnd(ZT_CircuitTest *test)
  449. {
  450. Mutex::Lock _l(_circuitTests_m);
  451. for(;;) {
  452. std::vector< ZT_CircuitTest * >::iterator ct(std::find(_circuitTests.begin(),_circuitTests.end(),test));
  453. if (ct == _circuitTests.end())
  454. break;
  455. else _circuitTests.erase(ct);
  456. }
  457. }
  458. /****************************************************************************/
  459. /* Node methods used only within node/ */
  460. /****************************************************************************/
  461. std::string Node::dataStoreGet(const char *name)
  462. {
  463. char buf[16384];
  464. std::string r;
  465. unsigned long olen = 0;
  466. do {
  467. long n = _dataStoreGetFunction(reinterpret_cast<ZT_Node *>(this),_uPtr,name,buf,sizeof(buf),(unsigned long)r.length(),&olen);
  468. if (n <= 0)
  469. return std::string();
  470. r.append(buf,n);
  471. } while (r.length() < olen);
  472. return r;
  473. }
  474. #ifdef ZT_TRACE
  475. void Node::postTrace(const char *module,unsigned int line,const char *fmt,...)
  476. {
  477. static Mutex traceLock;
  478. va_list ap;
  479. char tmp1[1024],tmp2[1024],tmp3[256];
  480. Mutex::Lock _l(traceLock);
  481. time_t now = (time_t)(_now / 1000ULL);
  482. #ifdef __WINDOWS__
  483. ctime_s(tmp3,sizeof(tmp3),&now);
  484. char *nowstr = tmp3;
  485. #else
  486. char *nowstr = ctime_r(&now,tmp3);
  487. #endif
  488. unsigned long nowstrlen = (unsigned long)strlen(nowstr);
  489. if (nowstr[nowstrlen-1] == '\n')
  490. nowstr[--nowstrlen] = (char)0;
  491. if (nowstr[nowstrlen-1] == '\r')
  492. nowstr[--nowstrlen] = (char)0;
  493. va_start(ap,fmt);
  494. vsnprintf(tmp2,sizeof(tmp2),fmt,ap);
  495. va_end(ap);
  496. tmp2[sizeof(tmp2)-1] = (char)0;
  497. Utils::snprintf(tmp1,sizeof(tmp1),"[%s] %s:%u %s",nowstr,module,line,tmp2);
  498. postEvent(ZT_EVENT_TRACE,tmp1);
  499. }
  500. #endif // ZT_TRACE
  501. uint64_t Node::prng()
  502. {
  503. unsigned int p = (++_prngStreamPtr % (sizeof(_prngStream) / sizeof(uint64_t)));
  504. if (!p)
  505. _prng.encrypt12(_prngStream,_prngStream,sizeof(_prngStream));
  506. return _prngStream[p];
  507. }
  508. void Node::postCircuitTestReport(const ZT_CircuitTestReport *report)
  509. {
  510. std::vector< ZT_CircuitTest * > toNotify;
  511. {
  512. Mutex::Lock _l(_circuitTests_m);
  513. for(std::vector< ZT_CircuitTest * >::iterator i(_circuitTests.begin());i!=_circuitTests.end();++i) {
  514. if ((*i)->testId == report->testId)
  515. toNotify.push_back(*i);
  516. }
  517. }
  518. for(std::vector< ZT_CircuitTest * >::iterator i(toNotify.begin());i!=toNotify.end();++i)
  519. (reinterpret_cast<void (*)(ZT_Node *,ZT_CircuitTest *,const ZT_CircuitTestReport *)>((*i)->_internalPtr))(reinterpret_cast<ZT_Node *>(this),*i,report);
  520. }
  521. } // namespace ZeroTier
  522. /****************************************************************************/
  523. /* CAPI bindings */
  524. /****************************************************************************/
  525. extern "C" {
  526. enum ZT_ResultCode ZT_Node_new(
  527. ZT_Node **node,
  528. void *uptr,
  529. uint64_t now,
  530. ZT_DataStoreGetFunction dataStoreGetFunction,
  531. ZT_DataStorePutFunction dataStorePutFunction,
  532. ZT_WirePacketSendFunction wirePacketSendFunction,
  533. ZT_VirtualNetworkFrameFunction virtualNetworkFrameFunction,
  534. ZT_VirtualNetworkConfigFunction virtualNetworkConfigFunction,
  535. ZT_EventCallback eventCallback)
  536. {
  537. *node = (ZT_Node *)0;
  538. try {
  539. *node = reinterpret_cast<ZT_Node *>(new ZeroTier::Node(now,uptr,dataStoreGetFunction,dataStorePutFunction,wirePacketSendFunction,virtualNetworkFrameFunction,virtualNetworkConfigFunction,eventCallback));
  540. return ZT_RESULT_OK;
  541. } catch (std::bad_alloc &exc) {
  542. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  543. } catch (std::runtime_error &exc) {
  544. return ZT_RESULT_FATAL_ERROR_DATA_STORE_FAILED;
  545. } catch ( ... ) {
  546. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  547. }
  548. }
  549. void ZT_Node_delete(ZT_Node *node)
  550. {
  551. try {
  552. delete (reinterpret_cast<ZeroTier::Node *>(node));
  553. } catch ( ... ) {}
  554. }
  555. enum ZT_ResultCode ZT_Node_processWirePacket(
  556. ZT_Node *node,
  557. uint64_t now,
  558. const struct sockaddr_storage *localAddress,
  559. const struct sockaddr_storage *remoteAddress,
  560. const void *packetData,
  561. unsigned int packetLength,
  562. volatile uint64_t *nextBackgroundTaskDeadline)
  563. {
  564. try {
  565. return reinterpret_cast<ZeroTier::Node *>(node)->processWirePacket(now,localAddress,remoteAddress,packetData,packetLength,nextBackgroundTaskDeadline);
  566. } catch (std::bad_alloc &exc) {
  567. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  568. } catch ( ... ) {
  569. return ZT_RESULT_OK; // "OK" since invalid packets are simply dropped, but the system is still up
  570. }
  571. }
  572. enum ZT_ResultCode ZT_Node_processVirtualNetworkFrame(
  573. ZT_Node *node,
  574. uint64_t now,
  575. uint64_t nwid,
  576. uint64_t sourceMac,
  577. uint64_t destMac,
  578. unsigned int etherType,
  579. unsigned int vlanId,
  580. const void *frameData,
  581. unsigned int frameLength,
  582. volatile uint64_t *nextBackgroundTaskDeadline)
  583. {
  584. try {
  585. return reinterpret_cast<ZeroTier::Node *>(node)->processVirtualNetworkFrame(now,nwid,sourceMac,destMac,etherType,vlanId,frameData,frameLength,nextBackgroundTaskDeadline);
  586. } catch (std::bad_alloc &exc) {
  587. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  588. } catch ( ... ) {
  589. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  590. }
  591. }
  592. enum ZT_ResultCode ZT_Node_processBackgroundTasks(ZT_Node *node,uint64_t now,volatile uint64_t *nextBackgroundTaskDeadline)
  593. {
  594. try {
  595. return reinterpret_cast<ZeroTier::Node *>(node)->processBackgroundTasks(now,nextBackgroundTaskDeadline);
  596. } catch (std::bad_alloc &exc) {
  597. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  598. } catch ( ... ) {
  599. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  600. }
  601. }
  602. enum ZT_ResultCode ZT_Node_join(ZT_Node *node,uint64_t nwid)
  603. {
  604. try {
  605. return reinterpret_cast<ZeroTier::Node *>(node)->join(nwid);
  606. } catch (std::bad_alloc &exc) {
  607. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  608. } catch ( ... ) {
  609. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  610. }
  611. }
  612. enum ZT_ResultCode ZT_Node_leave(ZT_Node *node,uint64_t nwid)
  613. {
  614. try {
  615. return reinterpret_cast<ZeroTier::Node *>(node)->leave(nwid);
  616. } catch (std::bad_alloc &exc) {
  617. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  618. } catch ( ... ) {
  619. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  620. }
  621. }
  622. enum ZT_ResultCode ZT_Node_multicastSubscribe(ZT_Node *node,uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi)
  623. {
  624. try {
  625. return reinterpret_cast<ZeroTier::Node *>(node)->multicastSubscribe(nwid,multicastGroup,multicastAdi);
  626. } catch (std::bad_alloc &exc) {
  627. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  628. } catch ( ... ) {
  629. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  630. }
  631. }
  632. enum ZT_ResultCode ZT_Node_multicastUnsubscribe(ZT_Node *node,uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi)
  633. {
  634. try {
  635. return reinterpret_cast<ZeroTier::Node *>(node)->multicastUnsubscribe(nwid,multicastGroup,multicastAdi);
  636. } catch (std::bad_alloc &exc) {
  637. return ZT_RESULT_FATAL_ERROR_OUT_OF_MEMORY;
  638. } catch ( ... ) {
  639. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  640. }
  641. }
  642. uint64_t ZT_Node_address(ZT_Node *node)
  643. {
  644. return reinterpret_cast<ZeroTier::Node *>(node)->address();
  645. }
  646. void ZT_Node_status(ZT_Node *node,ZT_NodeStatus *status)
  647. {
  648. try {
  649. reinterpret_cast<ZeroTier::Node *>(node)->status(status);
  650. } catch ( ... ) {}
  651. }
  652. ZT_PeerList *ZT_Node_peers(ZT_Node *node)
  653. {
  654. try {
  655. return reinterpret_cast<ZeroTier::Node *>(node)->peers();
  656. } catch ( ... ) {
  657. return (ZT_PeerList *)0;
  658. }
  659. }
  660. ZT_VirtualNetworkConfig *ZT_Node_networkConfig(ZT_Node *node,uint64_t nwid)
  661. {
  662. try {
  663. return reinterpret_cast<ZeroTier::Node *>(node)->networkConfig(nwid);
  664. } catch ( ... ) {
  665. return (ZT_VirtualNetworkConfig *)0;
  666. }
  667. }
  668. ZT_VirtualNetworkList *ZT_Node_networks(ZT_Node *node)
  669. {
  670. try {
  671. return reinterpret_cast<ZeroTier::Node *>(node)->networks();
  672. } catch ( ... ) {
  673. return (ZT_VirtualNetworkList *)0;
  674. }
  675. }
  676. void ZT_Node_freeQueryResult(ZT_Node *node,void *qr)
  677. {
  678. try {
  679. reinterpret_cast<ZeroTier::Node *>(node)->freeQueryResult(qr);
  680. } catch ( ... ) {}
  681. }
  682. void ZT_Node_setNetconfMaster(ZT_Node *node,void *networkControllerInstance)
  683. {
  684. try {
  685. reinterpret_cast<ZeroTier::Node *>(node)->setNetconfMaster(networkControllerInstance);
  686. } catch ( ... ) {}
  687. }
  688. enum ZT_ResultCode ZT_Node_circuitTestBegin(ZT_Node *node,ZT_CircuitTest *test,void (*reportCallback)(ZT_Node *,ZT_CircuitTest *,const ZT_CircuitTestReport *))
  689. {
  690. try {
  691. return reinterpret_cast<ZeroTier::Node *>(node)->circuitTestBegin(test,reportCallback);
  692. } catch ( ... ) {
  693. return ZT_RESULT_FATAL_ERROR_INTERNAL;
  694. }
  695. }
  696. void ZT_Node_circuitTestEnd(ZT_Node *node,ZT_CircuitTest *test)
  697. {
  698. try {
  699. reinterpret_cast<ZeroTier::Node *>(node)->circuitTestEnd(test);
  700. } catch ( ... ) {}
  701. }
  702. int ZT_Node_addLocalInterfaceAddress(ZT_Node *node,const struct sockaddr_storage *addr,int metric, enum ZT_LocalInterfaceAddressTrust trust)
  703. {
  704. try {
  705. return reinterpret_cast<ZeroTier::Node *>(node)->addLocalInterfaceAddress(addr,metric,trust);
  706. } catch ( ... ) {
  707. return 0;
  708. }
  709. }
  710. void ZT_Node_clearLocalInterfaceAddresses(ZT_Node *node)
  711. {
  712. try {
  713. reinterpret_cast<ZeroTier::Node *>(node)->clearLocalInterfaceAddresses();
  714. } catch ( ... ) {}
  715. }
  716. void ZT_version(int *major,int *minor,int *revision,unsigned long *featureFlags)
  717. {
  718. if (major) *major = ZEROTIER_ONE_VERSION_MAJOR;
  719. if (minor) *minor = ZEROTIER_ONE_VERSION_MINOR;
  720. if (revision) *revision = ZEROTIER_ONE_VERSION_REVISION;
  721. if (featureFlags) {
  722. *featureFlags = (
  723. ZT_FEATURE_FLAG_THREAD_SAFE
  724. );
  725. }
  726. }
  727. } // extern "C"