Peer.hpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504
  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 hops ZeroTier (not IP) hops
  106. * @param verb Packet verb
  107. * @param now Current time
  108. */
  109. void onReceive(const RuntimeEnvironment *_r,Demarc::Port localPort,const InetAddress &fromAddr,unsigned int hops,Packet::Verb verb,uint64_t now);
  110. /**
  111. * Send a UDP packet to this peer
  112. *
  113. * If the active link is timed out (no receives for ping timeout ms), then
  114. * the active link number is incremented after send. This causes sends to
  115. * cycle through links if there is no clear active link. This also happens
  116. * if the send fails for some reason.
  117. *
  118. * @param _r Runtime environment
  119. * @param data Data to send
  120. * @param len Length of packet
  121. * @param relay This is a relay on behalf of another peer (verb is ignored)
  122. * @param verb Packet verb (if not relay)
  123. * @param now Current time
  124. * @return True if packet appears to have been sent, false on local failure
  125. */
  126. bool send(const RuntimeEnvironment *_r,const void *data,unsigned int len,bool relay,Packet::Verb verb,uint64_t now);
  127. /**
  128. * Send firewall opener to active link
  129. *
  130. * @param _r Runtime environment
  131. * @param now Current time
  132. * @return True if send appears successful for at least one address type
  133. */
  134. bool sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now);
  135. /**
  136. * Set an address to reach this peer
  137. *
  138. * @param addr Address to set
  139. * @param fixed If true, address is fixed (won't be changed on packet receipt)
  140. */
  141. void setPathAddress(const InetAddress &addr,bool fixed);
  142. /**
  143. * Clear the fixed flag for an address type
  144. *
  145. * @param t Type to clear, or TYPE_NULL to clear flag on all types
  146. */
  147. void clearFixedFlag(InetAddress::AddressType t);
  148. /**
  149. * @return Last successfully sent firewall opener
  150. */
  151. uint64_t lastFirewallOpener() const
  152. throw()
  153. {
  154. return std::max(_ipv4p.lastFirewallOpener,_ipv6p.lastFirewallOpener);
  155. }
  156. /**
  157. * @return Time of last direct packet receive
  158. */
  159. uint64_t lastDirectReceive() const
  160. throw()
  161. {
  162. return std::max(_ipv4p.lastReceive,_ipv6p.lastReceive);
  163. }
  164. /**
  165. * @return Time of last direct packet send
  166. */
  167. uint64_t lastDirectSend() const
  168. throw()
  169. {
  170. return std::max(_ipv4p.lastSend,_ipv6p.lastSend);
  171. }
  172. /**
  173. * @return Time of most recent unicast frame (actual data transferred)
  174. */
  175. uint64_t lastUnicastFrame() const
  176. throw()
  177. {
  178. return std::max(_ipv4p.lastUnicastFrame,_ipv6p.lastUnicastFrame);
  179. }
  180. /**
  181. * @return Lowest of measured latencies of all paths or 0 if unknown
  182. */
  183. unsigned int latency() const
  184. throw()
  185. {
  186. if (_ipv4p.latency) {
  187. if (_ipv6p.latency)
  188. return std::min(_ipv4p.latency,_ipv6p.latency);
  189. else return _ipv4p.latency;
  190. } else if (_ipv6p.latency)
  191. return _ipv6p.latency;
  192. return 0;
  193. }
  194. /**
  195. * @param addr Remote address
  196. * @param latency Latency measurment
  197. */
  198. void setLatency(const InetAddress &addr,unsigned int latency)
  199. {
  200. if (addr == _ipv4p.addr) {
  201. _ipv4p.latency = latency;
  202. _dirty = true;
  203. } else if (addr == _ipv6p.addr) {
  204. _ipv6p.latency = latency;
  205. _dirty = true;
  206. }
  207. }
  208. /**
  209. * @return True if this peer has at least one direct IP address path
  210. */
  211. inline bool hasDirectPath() const
  212. throw()
  213. {
  214. return ((_ipv4p.addr)||(_ipv6p.addr));
  215. }
  216. /**
  217. * @param now Current time
  218. * @return True if hasDirectPath() is true and at least one path is active
  219. */
  220. inline bool hasActiveDirectPath(uint64_t now) const
  221. throw()
  222. {
  223. return ((_ipv4p.isActive(now))||(_ipv6p.isActive(now)));
  224. }
  225. /**
  226. * @return IPv4 direct address or null InetAddress if none
  227. */
  228. inline InetAddress ipv4Path() const
  229. throw()
  230. {
  231. return _ipv4p.addr;
  232. }
  233. /**
  234. * @return IPv6 direct address or null InetAddress if none
  235. */
  236. inline InetAddress ipv6Path() const
  237. throw()
  238. {
  239. return _ipv4p.addr;
  240. }
  241. /**
  242. * @return IPv4 direct address or null InetAddress if none
  243. */
  244. inline InetAddress ipv4ActivePath(uint64_t now) const
  245. throw()
  246. {
  247. if (_ipv4p.isActive(now))
  248. return _ipv4p.addr;
  249. return InetAddress();
  250. }
  251. /**
  252. * @return IPv6 direct address or null InetAddress if none
  253. */
  254. inline InetAddress ipv6ActivePath(uint64_t now) const
  255. throw()
  256. {
  257. if (_ipv6p.isActive(now))
  258. return _ipv6p.addr;
  259. return InetAddress();
  260. }
  261. /**
  262. * @return 256-bit encryption key
  263. */
  264. inline const unsigned char *cryptKey() const
  265. throw()
  266. {
  267. return _keys; // crypt key is first 32-byte key
  268. }
  269. /**
  270. * @return 256-bit MAC (message authentication code) key
  271. */
  272. inline const unsigned char *macKey() const
  273. throw()
  274. {
  275. return (_keys + 32); // mac key is second 32-byte key
  276. }
  277. /**
  278. * Set the remote version of the peer (not persisted)
  279. *
  280. * @param vmaj Major version
  281. * @param vmin Minor version
  282. * @param vrev Revision
  283. */
  284. inline void setRemoteVersion(unsigned int vmaj,unsigned int vmin,unsigned int vrev)
  285. {
  286. _vMajor = vmaj;
  287. _vMinor = vmin;
  288. _vRevision = vrev;
  289. }
  290. /**
  291. * Get and reset dirty flag
  292. *
  293. * @return Previous value of dirty flag before reset
  294. */
  295. inline bool getAndResetDirty()
  296. throw()
  297. {
  298. bool d = _dirty;
  299. _dirty = false;
  300. return d;
  301. }
  302. /**
  303. * @return Current value of dirty flag
  304. */
  305. inline bool dirty() const throw() { return _dirty; }
  306. template<unsigned int C>
  307. inline void serialize(Buffer<C> &b)
  308. throw(std::out_of_range)
  309. {
  310. b.append((unsigned char)1); // version
  311. b.append(_keys,sizeof(_keys));
  312. _id.serialize(b,false);
  313. _ipv4p.serialize(b);
  314. _ipv6p.serialize(b);
  315. }
  316. template<unsigned int C>
  317. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  318. throw(std::out_of_range,std::invalid_argument)
  319. {
  320. unsigned int p = startAt;
  321. if (b[p++] != 1)
  322. throw std::invalid_argument("Peer: deserialize(): version mismatch");
  323. memcpy(_keys,b.field(p,sizeof(_keys)),sizeof(_keys)); p += sizeof(_keys);
  324. p += _id.deserialize(b,p);
  325. p += _ipv4p.deserialize(b,p);
  326. p += _ipv6p.deserialize(b,p);
  327. _dirty = false;
  328. return (p - startAt);
  329. }
  330. /**
  331. * @return True if this Peer is initialized with something
  332. */
  333. inline operator bool() const throw() { return (_id); }
  334. /**
  335. * Find a common set of addresses by which two peers can link, if any
  336. *
  337. * @param a Peer A
  338. * @param b Peer B
  339. * @param now Current time
  340. * @return Pair: B's address to send to A, A's address to send to B
  341. */
  342. static inline std::pair<InetAddress,InetAddress> findCommonGround(const Peer &a,const Peer &b,uint64_t now)
  343. throw()
  344. {
  345. if ((a._ipv6p.isActive(now))&&(b._ipv6p.isActive(now)))
  346. return std::pair<InetAddress,InetAddress>(b._ipv6p.addr,a._ipv6p.addr);
  347. else if ((a._ipv4p.isActive(now))&&(b._ipv4p.isActive(now)))
  348. return std::pair<InetAddress,InetAddress>(b._ipv4p.addr,a._ipv4p.addr);
  349. else if ((a._ipv6p.addr)&&(b._ipv6p.addr))
  350. return std::pair<InetAddress,InetAddress>(b._ipv6p.addr,a._ipv6p.addr);
  351. else if ((a._ipv4p.addr)&&(b._ipv4p.addr))
  352. return std::pair<InetAddress,InetAddress>(b._ipv4p.addr,a._ipv4p.addr);
  353. return std::pair<InetAddress,InetAddress>();
  354. }
  355. private:
  356. class WanPath
  357. {
  358. public:
  359. WanPath() :
  360. lastSend(0),
  361. lastReceive(0),
  362. lastUnicastFrame(0),
  363. lastFirewallOpener(0),
  364. localPort(Demarc::ANY_PORT),
  365. latency(0),
  366. addr(),
  367. fixed(false)
  368. {
  369. }
  370. inline bool isActive(const uint64_t now) const
  371. throw()
  372. {
  373. return ((addr)&&((now - lastReceive) < ZT_PEER_LINK_ACTIVITY_TIMEOUT));
  374. }
  375. template<unsigned int C>
  376. inline void serialize(Buffer<C> &b)
  377. throw(std::out_of_range)
  378. {
  379. b.append(lastSend);
  380. b.append(lastReceive);
  381. b.append(lastUnicastFrame);
  382. b.append(lastFirewallOpener);
  383. b.append(Demarc::portToInt(localPort));
  384. b.append((uint16_t)latency);
  385. b.append((unsigned char)addr.type());
  386. switch(addr.type()) {
  387. case InetAddress::TYPE_NULL:
  388. break;
  389. case InetAddress::TYPE_IPV4:
  390. b.append(addr.rawIpData(),4);
  391. b.append((uint16_t)addr.port());
  392. break;
  393. case InetAddress::TYPE_IPV6:
  394. b.append(addr.rawIpData(),16);
  395. b.append((uint16_t)addr.port());
  396. break;
  397. }
  398. b.append(fixed ? (unsigned char)1 : (unsigned char)0);
  399. }
  400. template<unsigned int C>
  401. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  402. throw(std::out_of_range,std::invalid_argument)
  403. {
  404. unsigned int p = startAt;
  405. lastSend = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  406. lastReceive = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  407. lastUnicastFrame = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  408. lastFirewallOpener = b.template at<uint64_t>(p); p += sizeof(uint64_t);
  409. localPort = Demarc::intToPort(b.template at<uint64_t>(p)); p += sizeof(uint64_t);
  410. latency = b.template at<uint16_t>(p); p += sizeof(uint16_t);
  411. switch ((InetAddress::AddressType)b[p++]) {
  412. case InetAddress::TYPE_NULL:
  413. addr.zero();
  414. break;
  415. case InetAddress::TYPE_IPV4:
  416. addr.set(b.field(p,4),4,b.template at<uint16_t>(p + 4));
  417. p += 4 + sizeof(uint16_t);
  418. break;
  419. case InetAddress::TYPE_IPV6:
  420. addr.set(b.field(p,16),16,b.template at<uint16_t>(p + 16));
  421. p += 16 + sizeof(uint16_t);
  422. break;
  423. }
  424. fixed = (b[p++] != 0);
  425. return (p - startAt);
  426. }
  427. uint64_t lastSend;
  428. uint64_t lastReceive;
  429. uint64_t lastUnicastFrame;
  430. uint64_t lastFirewallOpener;
  431. Demarc::Port localPort; // ANY_PORT if not defined
  432. unsigned int latency; // 0 if never determined
  433. InetAddress addr; // null InetAddress if path is undefined
  434. bool fixed; // do not learn address from received packets
  435. };
  436. unsigned char _keys[32 * 2]; // crypt key[32], mac key[32]
  437. Identity _id;
  438. WanPath _ipv4p;
  439. WanPath _ipv6p;
  440. // Fields below this line are not persisted with serialize()
  441. unsigned int _vMajor,_vMinor,_vRevision;
  442. bool _dirty;
  443. AtomicCounter __refCount;
  444. };
  445. } // namespace ZeroTier
  446. #endif