Node.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
  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. #ifndef ZT_NODE_HPP
  19. #define ZT_NODE_HPP
  20. #include <stdio.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <map>
  24. #include <vector>
  25. #include "Constants.hpp"
  26. #include "../include/ZeroTierOne.h"
  27. #include "RuntimeEnvironment.hpp"
  28. #include "InetAddress.hpp"
  29. #include "Mutex.hpp"
  30. #include "MAC.hpp"
  31. #include "Network.hpp"
  32. #include "Path.hpp"
  33. #include "Salsa20.hpp"
  34. #include "NetworkController.hpp"
  35. #undef TRACE
  36. #ifdef ZT_TRACE
  37. #define TRACE(f,...) RR->node->postTrace(__FILE__,__LINE__,f,##__VA_ARGS__)
  38. #else
  39. #define TRACE(f,...) {}
  40. #endif
  41. // Bit mask for "expecting reply" hash
  42. #define ZT_EXPECTING_REPLIES_BUCKET_MASK1 255
  43. #define ZT_EXPECTING_REPLIES_BUCKET_MASK2 31
  44. // Size of PRNG stream buffer
  45. #define ZT_NODE_PRNG_BUF_SIZE 64
  46. namespace ZeroTier {
  47. class World;
  48. /**
  49. * Implementation of Node object as defined in CAPI
  50. *
  51. * The pointer returned by ZT_Node_new() is an instance of this class.
  52. */
  53. class Node : public NetworkController::Sender
  54. {
  55. public:
  56. Node(void *uptr,void *tptr,const struct ZT_Node_Callbacks *callbacks,uint64_t now);
  57. virtual ~Node();
  58. // Get rid of alignment warnings on 32-bit Windows and possibly improve performance
  59. #ifdef __WINDOWS__
  60. void * operator new(size_t i) { return _mm_malloc(i,16); }
  61. void operator delete(void* p) { _mm_free(p); }
  62. #endif
  63. // Public API Functions ----------------------------------------------------
  64. ZT_ResultCode processWirePacket(
  65. void *tptr,
  66. uint64_t now,
  67. const struct sockaddr_storage *localAddress,
  68. const struct sockaddr_storage *remoteAddress,
  69. const void *packetData,
  70. unsigned int packetLength,
  71. volatile uint64_t *nextBackgroundTaskDeadline);
  72. ZT_ResultCode processVirtualNetworkFrame(
  73. void *tptr,
  74. uint64_t now,
  75. uint64_t nwid,
  76. uint64_t sourceMac,
  77. uint64_t destMac,
  78. unsigned int etherType,
  79. unsigned int vlanId,
  80. const void *frameData,
  81. unsigned int frameLength,
  82. volatile uint64_t *nextBackgroundTaskDeadline);
  83. ZT_ResultCode processBackgroundTasks(void *tptr,uint64_t now,volatile uint64_t *nextBackgroundTaskDeadline);
  84. ZT_ResultCode join(uint64_t nwid,void *uptr,void *tptr);
  85. ZT_ResultCode leave(uint64_t nwid,void **uptr,void *tptr);
  86. ZT_ResultCode multicastSubscribe(void *tptr,uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi);
  87. ZT_ResultCode multicastUnsubscribe(uint64_t nwid,uint64_t multicastGroup,unsigned long multicastAdi);
  88. ZT_ResultCode orbit(void *tptr,uint64_t moonWorldId,uint64_t moonSeed);
  89. ZT_ResultCode deorbit(void *tptr,uint64_t moonWorldId);
  90. uint64_t address() const;
  91. void status(ZT_NodeStatus *status) const;
  92. ZT_PeerList *peers() const;
  93. ZT_VirtualNetworkConfig *networkConfig(uint64_t nwid) const;
  94. ZT_VirtualNetworkList *networks() const;
  95. void freeQueryResult(void *qr);
  96. int addLocalInterfaceAddress(const struct sockaddr_storage *addr);
  97. void clearLocalInterfaceAddresses();
  98. int sendUserMessage(void *tptr,uint64_t dest,uint64_t typeId,const void *data,unsigned int len);
  99. void setNetconfMaster(void *networkControllerInstance);
  100. ZT_ResultCode circuitTestBegin(void *tptr,ZT_CircuitTest *test,void (*reportCallback)(ZT_Node *,ZT_CircuitTest *,const ZT_CircuitTestReport *));
  101. void circuitTestEnd(ZT_CircuitTest *test);
  102. ZT_ResultCode clusterInit(
  103. unsigned int myId,
  104. const struct sockaddr_storage *zeroTierPhysicalEndpoints,
  105. unsigned int numZeroTierPhysicalEndpoints,
  106. int x,
  107. int y,
  108. int z,
  109. void (*sendFunction)(void *,unsigned int,const void *,unsigned int),
  110. void *sendFunctionArg,
  111. int (*addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *),
  112. void *addressToLocationFunctionArg);
  113. ZT_ResultCode clusterAddMember(unsigned int memberId);
  114. void clusterRemoveMember(unsigned int memberId);
  115. void clusterHandleIncomingMessage(const void *msg,unsigned int len);
  116. void clusterStatus(ZT_ClusterStatus *cs);
  117. // Internal functions ------------------------------------------------------
  118. inline uint64_t now() const throw() { return _now; }
  119. inline bool putPacket(void *tPtr,const InetAddress &localAddress,const InetAddress &addr,const void *data,unsigned int len,unsigned int ttl = 0)
  120. {
  121. return (_cb.wirePacketSendFunction(
  122. reinterpret_cast<ZT_Node *>(this),
  123. _uPtr,
  124. tPtr,
  125. reinterpret_cast<const struct sockaddr_storage *>(&localAddress),
  126. reinterpret_cast<const struct sockaddr_storage *>(&addr),
  127. data,
  128. len,
  129. ttl) == 0);
  130. }
  131. inline void putFrame(void *tPtr,uint64_t nwid,void **nuptr,const MAC &source,const MAC &dest,unsigned int etherType,unsigned int vlanId,const void *data,unsigned int len)
  132. {
  133. _cb.virtualNetworkFrameFunction(
  134. reinterpret_cast<ZT_Node *>(this),
  135. _uPtr,
  136. tPtr,
  137. nwid,
  138. nuptr,
  139. source.toInt(),
  140. dest.toInt(),
  141. etherType,
  142. vlanId,
  143. data,
  144. len);
  145. }
  146. inline SharedPtr<Network> network(uint64_t nwid) const
  147. {
  148. Mutex::Lock _l(_networks_m);
  149. return _network(nwid);
  150. }
  151. inline bool belongsToNetwork(uint64_t nwid) const
  152. {
  153. Mutex::Lock _l(_networks_m);
  154. for(std::vector< std::pair< uint64_t, SharedPtr<Network> > >::const_iterator i=_networks.begin();i!=_networks.end();++i) {
  155. if (i->first == nwid)
  156. return true;
  157. }
  158. return false;
  159. }
  160. inline std::vector< SharedPtr<Network> > allNetworks() const
  161. {
  162. std::vector< SharedPtr<Network> > nw;
  163. Mutex::Lock _l(_networks_m);
  164. nw.reserve(_networks.size());
  165. for(std::vector< std::pair< uint64_t, SharedPtr<Network> > >::const_iterator i=_networks.begin();i!=_networks.end();++i)
  166. nw.push_back(i->second);
  167. return nw;
  168. }
  169. inline std::vector<InetAddress> directPaths() const
  170. {
  171. Mutex::Lock _l(_directPaths_m);
  172. return _directPaths;
  173. }
  174. inline bool dataStorePut(void *tPtr,const char *name,const void *data,unsigned int len,bool secure) { return (_cb.dataStorePutFunction(reinterpret_cast<ZT_Node *>(this),_uPtr,tPtr,name,data,len,(int)secure) == 0); }
  175. inline bool dataStorePut(void *tPtr,const char *name,const std::string &data,bool secure) { return dataStorePut(tPtr,name,(const void *)data.data(),(unsigned int)data.length(),secure); }
  176. inline void dataStoreDelete(void *tPtr,const char *name) { _cb.dataStorePutFunction(reinterpret_cast<ZT_Node *>(this),_uPtr,tPtr,name,(const void *)0,0,0); }
  177. std::string dataStoreGet(void *tPtr,const char *name);
  178. inline void postEvent(void *tPtr,ZT_Event ev,const void *md = (const void *)0) { _cb.eventCallback(reinterpret_cast<ZT_Node *>(this),_uPtr,tPtr,ev,md); }
  179. inline int configureVirtualNetworkPort(void *tPtr,uint64_t nwid,void **nuptr,ZT_VirtualNetworkConfigOperation op,const ZT_VirtualNetworkConfig *nc) { return _cb.virtualNetworkConfigFunction(reinterpret_cast<ZT_Node *>(this),_uPtr,tPtr,nwid,nuptr,op,nc); }
  180. inline bool online() const throw() { return _online; }
  181. #ifdef ZT_TRACE
  182. void postTrace(const char *module,unsigned int line,const char *fmt,...);
  183. #endif
  184. bool shouldUsePathForZeroTierTraffic(void *tPtr,const Address &ztaddr,const InetAddress &localAddress,const InetAddress &remoteAddress);
  185. inline bool externalPathLookup(void *tPtr,const Address &ztaddr,int family,InetAddress &addr) { return ( (_cb.pathLookupFunction) ? (_cb.pathLookupFunction(reinterpret_cast<ZT_Node *>(this),_uPtr,tPtr,ztaddr.toInt(),family,reinterpret_cast<struct sockaddr_storage *>(&addr)) != 0) : false ); }
  186. uint64_t prng();
  187. void postCircuitTestReport(const ZT_CircuitTestReport *report);
  188. void setTrustedPaths(const struct sockaddr_storage *networks,const uint64_t *ids,unsigned int count);
  189. World planet() const;
  190. std::vector<World> moons() const;
  191. /**
  192. * Register that we are expecting a reply to a packet ID
  193. *
  194. * This only uses the most significant bits of the packet ID, both to save space
  195. * and to avoid using the higher bits that can be modified during armor() to
  196. * mask against the packet send counter used for QoS detection.
  197. *
  198. * @param packetId Packet ID to expect reply to
  199. */
  200. inline void expectReplyTo(const uint64_t packetId)
  201. {
  202. const unsigned long pid2 = (unsigned long)(packetId >> 32);
  203. const unsigned long bucket = (unsigned long)(pid2 & ZT_EXPECTING_REPLIES_BUCKET_MASK1);
  204. _expectingRepliesTo[bucket][_expectingRepliesToBucketPtr[bucket]++ & ZT_EXPECTING_REPLIES_BUCKET_MASK2] = (uint32_t)pid2;
  205. }
  206. /**
  207. * Check whether a given packet ID is something we are expecting a reply to
  208. *
  209. * This only uses the most significant bits of the packet ID, both to save space
  210. * and to avoid using the higher bits that can be modified during armor() to
  211. * mask against the packet send counter used for QoS detection.
  212. *
  213. * @param packetId Packet ID to check
  214. * @return True if we're expecting a reply
  215. */
  216. inline bool expectingReplyTo(const uint64_t packetId) const
  217. {
  218. const uint32_t pid2 = (uint32_t)(packetId >> 32);
  219. const unsigned long bucket = (unsigned long)(pid2 & ZT_EXPECTING_REPLIES_BUCKET_MASK1);
  220. for(unsigned long i=0;i<=ZT_EXPECTING_REPLIES_BUCKET_MASK2;++i) {
  221. if (_expectingRepliesTo[bucket][i] == pid2)
  222. return true;
  223. }
  224. return false;
  225. }
  226. /**
  227. * Check whether we should do potentially expensive identity verification (rate limit)
  228. *
  229. * @param now Current time
  230. * @param from Source address of packet
  231. * @return True if within rate limits
  232. */
  233. inline bool rateGateIdentityVerification(const uint64_t now,const InetAddress &from)
  234. {
  235. unsigned long iph = from.rateGateHash();
  236. if ((now - _lastIdentityVerification[iph]) >= ZT_IDENTITY_VALIDATION_SOURCE_RATE_LIMIT) {
  237. _lastIdentityVerification[iph] = now;
  238. return true;
  239. }
  240. return false;
  241. }
  242. virtual void ncSendConfig(uint64_t nwid,uint64_t requestPacketId,const Address &destination,const NetworkConfig &nc,bool sendLegacyFormatConfig);
  243. virtual void ncSendRevocation(const Address &destination,const Revocation &rev);
  244. virtual void ncSendError(uint64_t nwid,uint64_t requestPacketId,const Address &destination,NetworkController::ErrorCode errorCode);
  245. private:
  246. inline SharedPtr<Network> _network(uint64_t nwid) const
  247. {
  248. // assumes _networks_m is locked
  249. for(std::vector< std::pair< uint64_t, SharedPtr<Network> > >::const_iterator i=_networks.begin();i!=_networks.end();++i) {
  250. if (i->first == nwid)
  251. return i->second;
  252. }
  253. return SharedPtr<Network>();
  254. }
  255. RuntimeEnvironment _RR;
  256. RuntimeEnvironment *RR;
  257. void *_uPtr; // _uptr (lower case) is reserved in Visual Studio :P
  258. ZT_Node_Callbacks _cb;
  259. // For tracking packet IDs to filter out OK/ERROR replies to packets we did not send
  260. uint8_t _expectingRepliesToBucketPtr[ZT_EXPECTING_REPLIES_BUCKET_MASK1 + 1];
  261. uint32_t _expectingRepliesTo[ZT_EXPECTING_REPLIES_BUCKET_MASK1 + 1][ZT_EXPECTING_REPLIES_BUCKET_MASK2 + 1];
  262. // Time of last identity verification indexed by InetAddress.rateGateHash() -- used in IncomingPacket::_doHELLO() via rateGateIdentityVerification()
  263. uint64_t _lastIdentityVerification[16384];
  264. std::vector< std::pair< uint64_t, SharedPtr<Network> > > _networks;
  265. Mutex _networks_m;
  266. std::vector< ZT_CircuitTest * > _circuitTests;
  267. Mutex _circuitTests_m;
  268. std::vector<InetAddress> _directPaths;
  269. Mutex _directPaths_m;
  270. Mutex _backgroundTasksLock;
  271. unsigned int _prngStreamPtr;
  272. Salsa20 _prng;
  273. uint64_t _prngStream[ZT_NODE_PRNG_BUF_SIZE]; // repeatedly encrypted with _prng to yield a high-quality non-crypto PRNG stream
  274. uint64_t _now;
  275. uint64_t _lastPingCheck;
  276. uint64_t _lastHousekeepingRun;
  277. bool _online;
  278. };
  279. } // namespace ZeroTier
  280. #endif