Peer.cpp 15 KB

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