Node.cpp 26 KB

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