Peer.cpp 15 KB

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