Peer.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2012-2013 ZeroTier Networks LLC
  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. #ifndef _ZT_PEER_HPP
  28. #define _ZT_PEER_HPP
  29. #include <algorithm>
  30. #include <utility>
  31. #include <stdexcept>
  32. #include <stdint.h>
  33. #include "Address.hpp"
  34. #include "Utils.hpp"
  35. #include "Identity.hpp"
  36. #include "Constants.hpp"
  37. #include "Logger.hpp"
  38. #include "Demarc.hpp"
  39. #include "RuntimeEnvironment.hpp"
  40. #include "InetAddress.hpp"
  41. #include "EllipticCurveKey.hpp"
  42. #include "Packet.hpp"
  43. #include "SharedPtr.hpp"
  44. #include "AtomicCounter.hpp"
  45. #include "NonCopyable.hpp"
  46. #include "Mutex.hpp"
  47. /**
  48. * Max length of serialized peer record
  49. */
  50. #define ZT_PEER_MAX_SERIALIZED_LENGTH ( \
  51. 64 + \
  52. IDENTITY_MAX_BINARY_SERIALIZED_LENGTH + \
  53. (( \
  54. (sizeof(uint64_t) * 5) + \
  55. sizeof(uint16_t) + \
  56. 1 + \
  57. sizeof(uint16_t) + \
  58. 16 + \
  59. 1 \
  60. ) * 2) + \
  61. 64 \
  62. )
  63. namespace ZeroTier {
  64. /**
  65. * A peer on the network
  66. *
  67. * Threading note:
  68. *
  69. * This structure contains no locks at the moment, but also performs no
  70. * memory allocation or pointer manipulation. As a result is is technically
  71. * "safe" for threads, as in won't crash. Right now it's only changed from
  72. * the core I/O thread so this isn't an issue. If multiple I/O threads are
  73. * introduced it ought to have a lock of some kind.
  74. */
  75. class Peer : NonCopyable
  76. {
  77. friend class SharedPtr<Peer>;
  78. private:
  79. ~Peer() {}
  80. public:
  81. Peer();
  82. /**
  83. * Construct a new peer
  84. *
  85. * @param myIdentity Identity of THIS node (for key agreement)
  86. * @param peerIdentity Identity of peer
  87. * @throws std::runtime_error Key agreement with peer's identity failed
  88. */
  89. Peer(const Identity &myIdentity,const Identity &peerIdentity)
  90. throw(std::runtime_error);
  91. /**
  92. * @return This peer's ZT address (short for identity().address())
  93. */
  94. inline const Address &address() const throw() { return _id.address(); }
  95. /**
  96. * @return This peer's identity
  97. */
  98. inline const Identity &identity() const throw() { return _id; }
  99. /**
  100. * Must be called on authenticated packet receive from this peer
  101. *
  102. * @param _r Runtime environment
  103. * @param localPort Local port on which packet was received
  104. * @param fromAddr Internet address of sender
  105. * @param latency Latency or 0 if unknown
  106. * @param hops ZeroTier (not IP) hops
  107. * @param verb Packet verb
  108. * @param now Current time
  109. */
  110. void onReceive(const RuntimeEnvironment *_r,Demarc::Port localPort,const InetAddress &fromAddr,unsigned int latency,unsigned int hops,Packet::Verb verb,uint64_t now);
  111. /**
  112. * Send a UDP packet to this peer
  113. *
  114. * If the active link is timed out (no receives for ping timeout ms), then
  115. * the active link number is incremented after send. This causes sends to
  116. * cycle through links if there is no clear active link. This also happens
  117. * if the send fails for some reason.
  118. *
  119. * @param _r Runtime environment
  120. * @param data Data to send
  121. * @param len Length of packet
  122. * @param relay This is a relay on behalf of another peer (verb is ignored)
  123. * @param verb Packet verb (if not relay)
  124. * @param now Current time
  125. * @return True if packet appears to have been sent, false on local failure
  126. */
  127. bool send(const RuntimeEnvironment *_r,const void *data,unsigned int len,bool relay,Packet::Verb verb,uint64_t now);
  128. /**
  129. * Send firewall opener to active link
  130. *
  131. * @param _r Runtime environment
  132. * @param now Current time
  133. * @return True if send appears successful for at least one address type
  134. */
  135. bool sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now);
  136. /**
  137. * Set an address to reach this peer
  138. *
  139. * @param addr Address to set
  140. * @param fixed If true, address is fixed (won't be changed on packet receipt)
  141. */
  142. void setPathAddress(const InetAddress &addr,bool fixed);
  143. /**
  144. * Clear the fixed flag for an address type
  145. *
  146. * @param t Type to clear, or TYPE_NULL to clear flag on all types
  147. */
  148. void clearFixedFlag(InetAddress::AddressType t);
  149. /**
  150. * @return Last successfully sent firewall opener
  151. */
  152. uint64_t lastFirewallOpener() const
  153. throw()
  154. {
  155. return std::max(_ipv4p.lastFirewallOpener,_ipv6p.lastFirewallOpener);
  156. }
  157. /**
  158. * @return Time of last direct packet receive
  159. */
  160. uint64_t lastDirectReceive() const
  161. throw()
  162. {
  163. return std::max(_ipv4p.lastReceive,_ipv6p.lastReceive);
  164. }
  165. /**
  166. * @return Time of last direct packet send
  167. */
  168. uint64_t lastDirectSend() const
  169. throw()
  170. {
  171. return std::max(_ipv4p.lastSend,_ipv6p.lastSend);
  172. }
  173. /**
  174. * @return Time of most recent unicast frame (actual data transferred)
  175. */
  176. uint64_t lastUnicastFrame() const
  177. throw()
  178. {
  179. return std::max(_ipv4p.lastUnicastFrame,_ipv6p.lastUnicastFrame);
  180. }
  181. /**
  182. * @return Lowest of measured latencies of all paths or 0 if unknown
  183. */
  184. unsigned int latency() const
  185. throw()
  186. {
  187. if (_ipv4p.latency) {
  188. if (_ipv6p.latency)
  189. return std::min(_ipv4p.latency,_ipv6p.latency);
  190. else return _ipv4p.latency;
  191. } else if (_ipv6p.latency)
  192. return _ipv6p.latency;
  193. return 0;
  194. }
  195. /**
  196. * @return True if this peer has at least one direct IP address path
  197. */
  198. inline bool hasDirectPath() const
  199. throw()
  200. {
  201. return ((_ipv4p.addr)||(_ipv6p.addr));
  202. }
  203. /**
  204. * @param now Current time
  205. * @return True if hasDirectPath() is true and at least one path is active
  206. */
  207. inline bool hasActiveDirectPath(uint64_t now) const
  208. throw()
  209. {
  210. return ((_ipv4p.isActive(now))||(_ipv6p.isActive(now)));
  211. }
  212. /**
  213. * @return IPv4 direct address or null InetAddress if none
  214. */
  215. inline InetAddress ipv4Path() const
  216. throw()
  217. {
  218. return _ipv4p.addr;
  219. }
  220. /**
  221. * @return IPv6 direct address or null InetAddress if none
  222. */
  223. inline InetAddress ipv6Path() const
  224. throw()
  225. {
  226. return _ipv4p.addr;
  227. }
  228. /**
  229. * @return IPv4 direct address or null InetAddress if none
  230. */
  231. inline InetAddress ipv4ActivePath(uint64_t now) const
  232. throw()
  233. {
  234. if (_ipv4p.isActive(now))
  235. return _ipv4p.addr;
  236. return InetAddress();
  237. }
  238. /**
  239. * @return IPv6 direct address or null InetAddress if none
  240. */
  241. inline InetAddress ipv6ActivePath(uint64_t now) const
  242. throw()
  243. {
  244. if (_ipv6p.isActive(now))
  245. return _ipv6p.addr;
  246. return InetAddress();
  247. }
  248. /**
  249. * @return 256-bit encryption key
  250. */
  251. inline const unsigned char *cryptKey() const
  252. throw()
  253. {
  254. return _keys; // crypt key is first 32-byte key
  255. }
  256. /**
  257. * @return 256-bit MAC (message authentication code) key
  258. */
  259. inline const unsigned char *macKey() const
  260. throw()
  261. {
  262. return (_keys + 32); // mac key is second 32-byte key
  263. }
  264. /**
  265. * Get and reset dirty flag
  266. *
  267. * @return Previous value of dirty flag before reset
  268. */
  269. inline bool getAndResetDirty()
  270. throw()
  271. {
  272. bool d = _dirty;
  273. _dirty = false;
  274. return d;
  275. }
  276. /**
  277. * @return Current value of dirty flag
  278. */
  279. inline bool dirty() const throw() { return _dirty; }
  280. template<unsigned int C>
  281. inline void serialize(Buffer<C> &b)
  282. throw(std::out_of_range)
  283. {
  284. b.append((unsigned char)1); // version
  285. b.append(_keys,sizeof(_keys));
  286. _id.serialize(b,false);
  287. _ipv4p.serialize(b);
  288. _ipv6p.serialize(b);
  289. }
  290. template<unsigned int C>
  291. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  292. throw(std::out_of_range,std::invalid_argument)
  293. {
  294. unsigned int p = startAt;
  295. if (b[p++] != 1)
  296. throw std::invalid_argument("Peer: deserialize(): version mismatch");
  297. memcpy(_keys,b.field(p,sizeof(_keys)),sizeof(_keys)); p += sizeof(_keys);
  298. p += _id.deserialize(b,p);
  299. p += _ipv4p.deserialize(b,p);
  300. p += _ipv6p.deserialize(b,p);
  301. _dirty = false;
  302. return (p - startAt);
  303. }
  304. /**
  305. * @return True if this Peer is initialized with something
  306. */
  307. inline operator bool() const throw() { return (_id); }
  308. /**
  309. * Find a common set of addresses by which two peers can link, if any
  310. *
  311. * @param a Peer A
  312. * @param b Peer B
  313. * @param now Current time
  314. * @return Pair: B's address to send to A, A's address to send to B
  315. */
  316. static inline std::pair<InetAddress,InetAddress> findCommonGround(const Peer &a,const Peer &b,uint64_t now)
  317. throw()
  318. {
  319. if ((a._ipv6p.isActive(now))&&(b._ipv6p.isActive(now)))
  320. return std::pair<InetAddress,InetAddress>(b._ipv6p.addr,a._ipv6p.addr);
  321. else if ((a._ipv4p.isActive(now))&&(b._ipv4p.isActive(now)))
  322. return std::pair<InetAddress,InetAddress>(b._ipv4p.addr,a._ipv4p.addr);
  323. else if ((a._ipv6p.addr)&&(b._ipv6p.addr))
  324. return std::pair<InetAddress,InetAddress>(b._ipv6p.addr,a._ipv6p.addr);
  325. else if ((a._ipv4p.addr)&&(b._ipv4p.addr))
  326. return std::pair<InetAddress,InetAddress>(b._ipv4p.addr,a._ipv4p.addr);
  327. return std::pair<InetAddress,InetAddress>();
  328. }
  329. private:
  330. class WanPath
  331. {
  332. public:
  333. WanPath() :
  334. lastSend(0),
  335. lastReceive(0),
  336. lastUnicastFrame(0),
  337. lastFirewallOpener(0),
  338. localPort(Demarc::ANY_PORT),
  339. latency(0),
  340. addr(),
  341. fixed(false)
  342. {
  343. }
  344. inline bool isActive(const uint64_t now) const
  345. throw()
  346. {
  347. return ((addr)&&((now - lastReceive) < ZT_PEER_LINK_ACTIVITY_TIMEOUT));
  348. }
  349. template<unsigned int C>
  350. inline void serialize(Buffer<C> &b)
  351. throw(std::out_of_range)
  352. {
  353. b.append(lastSend);
  354. b.append(lastReceive);
  355. b.append(lastUnicastFrame);
  356. b.append(lastFirewallOpener);
  357. b.append(Demarc::portToInt(localPort));
  358. b.append((uint16_t)latency);
  359. b.append((unsigned char)addr.type());
  360. switch(addr.type()) {
  361. case InetAddress::TYPE_NULL:
  362. break;
  363. case InetAddress::TYPE_IPV4:
  364. b.append(addr.rawIpData(),4);
  365. b.append((uint16_t)addr.port());
  366. break;
  367. case InetAddress::TYPE_IPV6:
  368. b.append(addr.rawIpData(),16);
  369. b.append((uint16_t)addr.port());
  370. break;
  371. }
  372. b.append(fixed ? (unsigned char)1 : (unsigned char)0);
  373. }
  374. template<unsigned int C>
  375. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  376. throw(std::out_of_range,std::invalid_argument)
  377. {
  378. unsigned int p = startAt;
  379. lastSend = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  380. lastReceive = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  381. lastUnicastFrame = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  382. lastFirewallOpener = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  383. localPort = Demarc::intToPort(b.template at<uint64_t>(p)); p += sizeof(uint64_t);
  384. latency = b.template at<uint16_t>(p); p += sizeof(uint16_t);
  385. switch ((InetAddress::AddressType)b[p++]) {
  386. case InetAddress::TYPE_NULL:
  387. addr.zero();
  388. break;
  389. case InetAddress::TYPE_IPV4:
  390. addr.set(b.field(p,4),4,b.template at<uint16_t>(p + 4));
  391. p += 4 + sizeof(uint16_t);
  392. break;
  393. case InetAddress::TYPE_IPV6:
  394. addr.set(b.field(p,16),16,b.template at<uint16_t>(p + 16));
  395. p += 16 + sizeof(uint16_t);
  396. break;
  397. }
  398. fixed = (b[p++] != 0);
  399. return (p - startAt);
  400. }
  401. uint64_t lastSend;
  402. uint64_t lastReceive;
  403. uint64_t lastUnicastFrame;
  404. uint64_t lastFirewallOpener;
  405. Demarc::Port localPort; // ANY_PORT if not defined
  406. unsigned int latency; // 0 if never determined
  407. InetAddress addr; // null InetAddress if path is undefined
  408. bool fixed; // do not learn address from received packets
  409. };
  410. unsigned char _keys[32 * 2]; // crypt key[32], mac key[32]
  411. Identity _id;
  412. WanPath _ipv4p;
  413. WanPath _ipv6p;
  414. // Fields below this line are not persisted with serialize()
  415. bool _dirty;
  416. AtomicCounter __refCount;
  417. };
  418. } // namespace ZeroTier
  419. #endif