Peer.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496
  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 "../version.h"
  28. #include "Constants.hpp"
  29. #include "Peer.hpp"
  30. #include "Node.hpp"
  31. #include "Switch.hpp"
  32. #include "Network.hpp"
  33. #include "AntiRecursion.hpp"
  34. #include "SelfAwareness.hpp"
  35. #include <algorithm>
  36. #define ZT_PEER_PATH_SORT_INTERVAL 5000
  37. namespace ZeroTier {
  38. // Used to send varying values for NAT keepalive
  39. static uint32_t _natKeepaliveBuf = 0;
  40. Peer::Peer(const Identity &myIdentity,const Identity &peerIdentity)
  41. throw(std::runtime_error) :
  42. _lastUsed(0),
  43. _lastReceive(0),
  44. _lastUnicastFrame(0),
  45. _lastMulticastFrame(0),
  46. _lastAnnouncedTo(0),
  47. _lastPathConfirmationSent(0),
  48. _lastDirectPathPushSent(0),
  49. _lastDirectPathPushReceived(0),
  50. _lastPathSort(0),
  51. _vProto(0),
  52. _vMajor(0),
  53. _vMinor(0),
  54. _vRevision(0),
  55. _id(peerIdentity),
  56. _numPaths(0),
  57. _latency(0),
  58. _networkComs(4),
  59. _lastPushedComs(4)
  60. {
  61. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  62. throw std::runtime_error("new peer identity key agreement failed");
  63. }
  64. void Peer::received(
  65. const RuntimeEnvironment *RR,
  66. const InetAddress &localAddr,
  67. const InetAddress &remoteAddr,
  68. unsigned int hops,
  69. uint64_t packetId,
  70. Packet::Verb verb,
  71. uint64_t inRePacketId,
  72. Packet::Verb inReVerb)
  73. {
  74. const uint64_t now = RR->node->now();
  75. bool needMulticastGroupAnnounce = false;
  76. {
  77. Mutex::Lock _l(_lock);
  78. _lastReceive = now;
  79. if (!hops) {
  80. bool pathIsConfirmed = false;
  81. /* Learn new paths from direct (hops == 0) packets */
  82. {
  83. unsigned int np = _numPaths;
  84. for(unsigned int p=0;p<np;++p) {
  85. if ((_paths[p].address() == remoteAddr)&&(_paths[p].localAddress() == localAddr)) {
  86. _paths[p].received(now);
  87. pathIsConfirmed = true;
  88. break;
  89. }
  90. }
  91. if (!pathIsConfirmed) {
  92. if ((verb == Packet::VERB_OK)&&((inReVerb == Packet::VERB_HELLO)||(inReVerb == Packet::VERB_ECHO))) {
  93. // Learn paths if they've been confirmed via a HELLO or an ECHO
  94. RemotePath *slot = (RemotePath *)0;
  95. if (np < ZT_MAX_PEER_NETWORK_PATHS) {
  96. // Add new path
  97. slot = &(_paths[np++]);
  98. } else {
  99. uint64_t slotLRmin = 0xffffffffffffffffULL;
  100. for(unsigned int p=0;p<ZT_MAX_PEER_NETWORK_PATHS;++p) {
  101. if (_paths[p].lastReceived() <= slotLRmin) {
  102. slotLRmin = _paths[p].lastReceived();
  103. slot = &(_paths[p]);
  104. }
  105. }
  106. }
  107. if (slot) {
  108. *slot = RemotePath(localAddr,remoteAddr);
  109. slot->received(now);
  110. _numPaths = np;
  111. pathIsConfirmed = true;
  112. _sortPaths(now);
  113. }
  114. } else {
  115. /* If this path is not known, send a HELLO. We don't learn
  116. * paths without confirming that a bidirectional link is in
  117. * fact present, but any packet that decodes and authenticates
  118. * correctly is considered valid. */
  119. if ((now - _lastPathConfirmationSent) >= ZT_MIN_PATH_CONFIRMATION_INTERVAL) {
  120. _lastPathConfirmationSent = now;
  121. TRACE("got %s via unknown path %s(%s), confirming...",Packet::verbString(verb),_id.address().toString().c_str(),remoteAddr.toString().c_str());
  122. attemptToContactAt(RR,localAddr,remoteAddr,now);
  123. }
  124. }
  125. }
  126. }
  127. }
  128. if ((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000)) {
  129. _lastAnnouncedTo = now;
  130. needMulticastGroupAnnounce = true;
  131. }
  132. if ((verb == Packet::VERB_FRAME)||(verb == Packet::VERB_EXT_FRAME))
  133. _lastUnicastFrame = now;
  134. else if (verb == Packet::VERB_MULTICAST_FRAME)
  135. _lastMulticastFrame = now;
  136. }
  137. if (needMulticastGroupAnnounce) {
  138. const std::vector< SharedPtr<Network> > networks(RR->node->allNetworks());
  139. for(std::vector< SharedPtr<Network> >::const_iterator n(networks.begin());n!=networks.end();++n)
  140. (*n)->tryAnnounceMulticastGroupsTo(SharedPtr<Peer>(this));
  141. }
  142. }
  143. void Peer::attemptToContactAt(const RuntimeEnvironment *RR,const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now)
  144. {
  145. // _lock not required here since _id is immutable and nothing else is accessed
  146. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  147. outp.append((unsigned char)ZT_PROTO_VERSION);
  148. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  149. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  150. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  151. outp.append(now);
  152. RR->identity.serialize(outp,false);
  153. atAddress.serialize(outp);
  154. outp.append((uint64_t)RR->topology->worldId());
  155. outp.append((uint64_t)RR->topology->worldTimestamp());
  156. outp.armor(_key,false); // HELLO is sent in the clear
  157. RR->antiRec->logOutgoingZT(outp.data(),outp.size());
  158. RR->node->putPacket(localAddr,atAddress,outp.data(),outp.size());
  159. }
  160. bool Peer::doPingAndKeepalive(const RuntimeEnvironment *RR,uint64_t now,int inetAddressFamily)
  161. {
  162. RemotePath *p = (RemotePath *)0;
  163. Mutex::Lock _l(_lock);
  164. if (inetAddressFamily != 0) {
  165. p = _getBestPath(now,inetAddressFamily);
  166. } else {
  167. p = _getBestPath(now);
  168. }
  169. if (p) {
  170. if ((now - p->lastReceived()) >= ZT_PEER_DIRECT_PING_DELAY) {
  171. TRACE("PING %s(%s) after %llums/%llums send/receive inactivity",_id.address().toString().c_str(),p->address().toString().c_str(),now - p->lastSend(),now - p->lastReceived());
  172. attemptToContactAt(RR,p->localAddress(),p->address(),now);
  173. p->sent(now);
  174. } else if (((now - p->lastSend()) >= ZT_NAT_KEEPALIVE_DELAY)&&(!p->reliable())) {
  175. TRACE("NAT keepalive %s(%s) after %llums/%llums send/receive inactivity",_id.address().toString().c_str(),p->address().toString().c_str(),now - p->lastSend(),now - p->lastReceived());
  176. _natKeepaliveBuf += (uint32_t)((now * 0x9e3779b1) >> 1); // tumble this around to send constantly varying (meaningless) payloads
  177. RR->node->putPacket(p->localAddress(),p->address(),&_natKeepaliveBuf,sizeof(_natKeepaliveBuf));
  178. p->sent(now);
  179. } else {
  180. TRACE("no PING or NAT keepalive: %llums/%llums send/receive inactivity",now - p->lastSend(),now - p->lastReceived())
  181. }
  182. return true;
  183. }
  184. return false;
  185. }
  186. void Peer::pushDirectPaths(const RuntimeEnvironment *RR,RemotePath *path,uint64_t now,bool force)
  187. {
  188. Mutex::Lock _l(_lock);
  189. if (((now - _lastDirectPathPushSent) >= ZT_DIRECT_PATH_PUSH_INTERVAL)||(force)) {
  190. _lastDirectPathPushSent = now;
  191. std::vector<Path> dps(RR->node->directPaths());
  192. if (dps.empty())
  193. return;
  194. #ifdef ZT_TRACE
  195. {
  196. std::string ps;
  197. for(std::vector<Path>::const_iterator p(dps.begin());p!=dps.end();++p) {
  198. if (ps.length() > 0)
  199. ps.push_back(',');
  200. ps.append(p->address().toString());
  201. }
  202. TRACE("pushing %u direct paths to %s: %s",(unsigned int)dps.size(),_id.address().toString().c_str(),ps.c_str());
  203. }
  204. #endif
  205. std::vector<Path>::const_iterator p(dps.begin());
  206. while (p != dps.end()) {
  207. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  208. outp.addSize(2); // leave room for count
  209. unsigned int count = 0;
  210. while ((p != dps.end())&&((outp.size() + 24) < ZT_PROTO_MAX_PACKET_LENGTH)) {
  211. uint8_t addressType = 4;
  212. switch(p->address().ss_family) {
  213. case AF_INET:
  214. break;
  215. case AF_INET6:
  216. addressType = 6;
  217. break;
  218. default: // we currently only push IP addresses
  219. ++p;
  220. continue;
  221. }
  222. uint8_t flags = 0;
  223. switch(p->trust()) {
  224. default:
  225. break;
  226. case Path::TRUST_PRIVACY:
  227. flags |= 0x04; // no encryption
  228. break;
  229. case Path::TRUST_ULTIMATE:
  230. flags |= (0x04 | 0x08); // no encryption, no authentication (redundant but go ahead and set both)
  231. break;
  232. }
  233. outp.append(flags);
  234. outp.append((uint16_t)0); // no extensions
  235. outp.append(addressType);
  236. outp.append((uint8_t)((addressType == 4) ? 6 : 18));
  237. outp.append(p->address().rawIpData(),((addressType == 4) ? 4 : 16));
  238. outp.append((uint16_t)p->address().port());
  239. ++count;
  240. ++p;
  241. }
  242. if (count) {
  243. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  244. outp.armor(_key,true);
  245. path->send(RR,outp.data(),outp.size(),now);
  246. }
  247. }
  248. }
  249. }
  250. bool Peer::resetWithinScope(const RuntimeEnvironment *RR,InetAddress::IpScope scope,uint64_t now)
  251. {
  252. Mutex::Lock _l(_lock);
  253. unsigned int np = _numPaths;
  254. unsigned int x = 0;
  255. unsigned int y = 0;
  256. while (x < np) {
  257. if (_paths[x].address().ipScope() == scope) {
  258. attemptToContactAt(RR,_paths[x].localAddress(),_paths[x].address(),now);
  259. } else {
  260. _paths[y++] = _paths[x];
  261. }
  262. ++x;
  263. }
  264. _numPaths = y;
  265. _sortPaths(now);
  266. return (y < np);
  267. }
  268. void Peer::getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const
  269. {
  270. Mutex::Lock _l(_lock);
  271. uint64_t bestV4 = 0,bestV6 = 0;
  272. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  273. if (_paths[p].active(now)) {
  274. uint64_t lr = _paths[p].lastReceived();
  275. if (lr) {
  276. if (_paths[p].address().isV4()) {
  277. if (lr >= bestV4) {
  278. bestV4 = lr;
  279. v4 = _paths[p].address();
  280. }
  281. } else if (_paths[p].address().isV6()) {
  282. if (lr >= bestV6) {
  283. bestV6 = lr;
  284. v6 = _paths[p].address();
  285. }
  286. }
  287. }
  288. }
  289. }
  290. }
  291. bool Peer::networkMembershipCertificatesAgree(uint64_t nwid,const CertificateOfMembership &com) const
  292. {
  293. Mutex::Lock _l(_lock);
  294. const _NetworkCom *ourCom = _networkComs.get(nwid);
  295. if (ourCom)
  296. return ourCom->com.agreesWith(com);
  297. return false;
  298. }
  299. bool Peer::validateAndSetNetworkMembershipCertificate(const RuntimeEnvironment *RR,uint64_t nwid,const CertificateOfMembership &com)
  300. {
  301. // Sanity checks
  302. if ((!com)||(com.issuedTo() != _id.address()))
  303. return false;
  304. // Return true if we already have this *exact* COM
  305. {
  306. Mutex::Lock _l(_lock);
  307. _NetworkCom *ourCom = _networkComs.get(nwid);
  308. if ((ourCom)&&(ourCom->com == com))
  309. return true;
  310. }
  311. // Check signature, log and return if cert is invalid
  312. if (com.signedBy() != Network::controllerFor(nwid)) {
  313. TRACE("rejected network membership certificate for %.16llx signed by %s: signer not a controller of this network",(unsigned long long)_id,com.signedBy().toString().c_str());
  314. return false; // invalid signer
  315. }
  316. if (com.signedBy() == RR->identity.address()) {
  317. // We are the controller: RR->identity.address() == controller() == cert.signedBy()
  318. // So, verify that we signed th cert ourself
  319. if (!com.verify(RR->identity)) {
  320. TRACE("rejected network membership certificate for %.16llx self signed by %s: signature check failed",(unsigned long long)_id,com.signedBy().toString().c_str());
  321. return false; // invalid signature
  322. }
  323. } else {
  324. SharedPtr<Peer> signer(RR->topology->getPeer(com.signedBy()));
  325. if (!signer) {
  326. // This would be rather odd, since this is our controller... could happen
  327. // if we get packets before we've gotten config.
  328. RR->sw->requestWhois(com.signedBy());
  329. return false; // signer unknown
  330. }
  331. if (!com.verify(signer->identity())) {
  332. TRACE("rejected network membership certificate for %.16llx signed by %s: signature check failed",(unsigned long long)_id,com.signedBy().toString().c_str());
  333. return false; // invalid signature
  334. }
  335. }
  336. // If we made it past all those checks, add or update cert in our cert info store
  337. {
  338. Mutex::Lock _l(_lock);
  339. _networkComs.set(nwid,_NetworkCom(RR->node->now(),com));
  340. }
  341. return true;
  342. }
  343. bool Peer::needsOurNetworkMembershipCertificate(uint64_t nwid,uint64_t now,bool updateLastPushedTime)
  344. {
  345. Mutex::Lock _l(_lock);
  346. uint64_t &lastPushed = _lastPushedComs[nwid];
  347. const uint64_t tmp = lastPushed;
  348. if (updateLastPushedTime)
  349. lastPushed = now;
  350. return ((now - tmp) >= (ZT_NETWORK_AUTOCONF_DELAY / 2));
  351. }
  352. void Peer::clean(const RuntimeEnvironment *RR,uint64_t now)
  353. {
  354. Mutex::Lock _l(_lock);
  355. {
  356. unsigned int np = _numPaths;
  357. unsigned int x = 0;
  358. unsigned int y = 0;
  359. while (x < np) {
  360. if (_paths[x].active(now))
  361. _paths[y++] = _paths[x];
  362. ++x;
  363. }
  364. _numPaths = y;
  365. }
  366. {
  367. uint64_t *k = (uint64_t *)0;
  368. _NetworkCom *v = (_NetworkCom *)0;
  369. Hashtable< uint64_t,_NetworkCom >::Iterator i(_networkComs);
  370. while (i.next(k,v)) {
  371. if ( (!RR->node->belongsToNetwork(*k)) && ((now - v->ts) >= ZT_PEER_NETWORK_COM_EXPIRATION) )
  372. _networkComs.erase(*k);
  373. }
  374. }
  375. {
  376. uint64_t *k = (uint64_t *)0;
  377. uint64_t *v = (uint64_t *)0;
  378. Hashtable< uint64_t,uint64_t >::Iterator i(_lastPushedComs);
  379. while (i.next(k,v)) {
  380. if ((now - *v) > (ZT_NETWORK_AUTOCONF_DELAY * 2))
  381. _lastPushedComs.erase(*k);
  382. }
  383. }
  384. }
  385. struct _SortPathsByQuality
  386. {
  387. uint64_t _now;
  388. _SortPathsByQuality(const uint64_t now) : _now(now) {}
  389. inline bool operator()(const RemotePath &a,const RemotePath &b) const
  390. {
  391. const uint64_t qa = (
  392. ((uint64_t)a.active(_now) << 63) |
  393. (((uint64_t)(a.preferenceRank() & 0xfff)) << 51) |
  394. ((uint64_t)a.lastReceived() & 0x7ffffffffffffULL) );
  395. const uint64_t qb = (
  396. ((uint64_t)b.active(_now) << 63) |
  397. (((uint64_t)(b.preferenceRank() & 0xfff)) << 51) |
  398. ((uint64_t)b.lastReceived() & 0x7ffffffffffffULL) );
  399. return (qb < qa); // invert sense to sort in descending order
  400. }
  401. };
  402. void Peer::_sortPaths(const uint64_t now)
  403. {
  404. // assumes _lock is locked
  405. _lastPathSort = now;
  406. std::sort(&(_paths[0]),&(_paths[_numPaths]),_SortPathsByQuality(now));
  407. }
  408. RemotePath *Peer::_getBestPath(const uint64_t now)
  409. {
  410. // assumes _lock is locked
  411. if ((now - _lastPathSort) >= ZT_PEER_PATH_SORT_INTERVAL)
  412. _sortPaths(now);
  413. if (_paths[0].active(now)) {
  414. return &(_paths[0]);
  415. } else {
  416. _sortPaths(now);
  417. if (_paths[0].active(now))
  418. return &(_paths[0]);
  419. }
  420. return (RemotePath *)0;
  421. }
  422. RemotePath *Peer::_getBestPath(const uint64_t now,int inetAddressFamily)
  423. {
  424. // assumes _lock is locked
  425. if ((now - _lastPathSort) >= ZT_PEER_PATH_SORT_INTERVAL)
  426. _sortPaths(now);
  427. for(int k=0;k<2;++k) { // try once, and if it fails sort and try one more time
  428. for(unsigned int i=0;i<_numPaths;++i) {
  429. if ((_paths[i].active(now))&&((int)_paths[i].address().ss_family == inetAddressFamily))
  430. return &(_paths[i]);
  431. }
  432. _sortPaths(now);
  433. }
  434. return (RemotePath *)0;
  435. }
  436. } // namespace ZeroTier