Node.cpp 25 KB

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