Peer.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  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 <algorithm>
  35. namespace ZeroTier {
  36. Peer::Peer(const Identity &myIdentity,const Identity &peerIdentity)
  37. throw(std::runtime_error) :
  38. _lastUsed(0),
  39. _lastReceive(0),
  40. _lastUnicastFrame(0),
  41. _lastMulticastFrame(0),
  42. _lastAnnouncedTo(0),
  43. _lastPathConfirmationSent(0),
  44. _lastDirectPathPush(0),
  45. _vMajor(0),
  46. _vMinor(0),
  47. _vRevision(0),
  48. _id(peerIdentity),
  49. _numPaths(0),
  50. _latency(0)
  51. {
  52. if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
  53. throw std::runtime_error("new peer identity key agreement failed");
  54. }
  55. void Peer::received(
  56. const RuntimeEnvironment *RR,
  57. const InetAddress &remoteAddr,
  58. unsigned int hops,
  59. uint64_t packetId,
  60. Packet::Verb verb,
  61. uint64_t inRePacketId,
  62. Packet::Verb inReVerb)
  63. {
  64. const uint64_t now = RR->node->now();
  65. _lastReceive = now;
  66. if (!hops) {
  67. bool pathIsConfirmed = false;
  68. /* Learn new paths from direct (hops == 0) packets */
  69. {
  70. unsigned int np = _numPaths;
  71. for(unsigned int p=0;p<np;++p) {
  72. if (_paths[p].address() == remoteAddr) {
  73. _paths[p].received(now);
  74. pathIsConfirmed = true;
  75. break;
  76. }
  77. }
  78. if (!pathIsConfirmed) {
  79. if ((verb == Packet::VERB_OK)&&(inReVerb == Packet::VERB_HELLO)) {
  80. // Learn paths if they've been confirmed via a HELLO
  81. RemotePath *slot = (RemotePath *)0;
  82. if (np < ZT1_MAX_PEER_NETWORK_PATHS) {
  83. // Add new path
  84. slot = &(_paths[np++]);
  85. } else {
  86. // Replace oldest non-fixed path
  87. uint64_t slotLRmin = 0xffffffffffffffffULL;
  88. for(unsigned int p=0;p<ZT1_MAX_PEER_NETWORK_PATHS;++p) {
  89. if ((!_paths[p].fixed())&&(_paths[p].lastReceived() <= slotLRmin)) {
  90. slotLRmin = _paths[p].lastReceived();
  91. slot = &(_paths[p]);
  92. }
  93. }
  94. }
  95. if (slot) {
  96. *slot = RemotePath(remoteAddr,false);
  97. slot->received(now);
  98. _numPaths = np;
  99. pathIsConfirmed = true;
  100. }
  101. } else {
  102. /* If this path is not known, send a HELLO. We don't learn
  103. * paths without confirming that a bidirectional link is in
  104. * fact present, but any packet that decodes and authenticates
  105. * correctly is considered valid. */
  106. if ((now - _lastPathConfirmationSent) >= ZT_MIN_PATH_CONFIRMATION_INTERVAL) {
  107. _lastPathConfirmationSent = now;
  108. TRACE("got %s via unknown path %s(%s), confirming...",Packet::verbString(verb),_id.address().toString().c_str(),remoteAddr.toString().c_str());
  109. attemptToContactAt(RR,remoteAddr,now);
  110. }
  111. }
  112. }
  113. }
  114. /* Announce multicast groups of interest to direct peers if they are
  115. * considered authorized members of a given network. Also announce to
  116. * root servers and network controllers. */
  117. if ((pathIsConfirmed)&&((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000))) {
  118. _lastAnnouncedTo = now;
  119. const bool isRoot = RR->topology->isRoot(_id);
  120. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_MULTICAST_LIKE);
  121. const std::vector< SharedPtr<Network> > networks(RR->node->allNetworks());
  122. for(std::vector< SharedPtr<Network> >::const_iterator n(networks.begin());n!=networks.end();++n) {
  123. if ( (isRoot) || ((*n)->isAllowed(_id.address())) ) {
  124. const std::vector<MulticastGroup> mgs((*n)->allMulticastGroups());
  125. for(std::vector<MulticastGroup>::const_iterator mg(mgs.begin());mg!=mgs.end();++mg) {
  126. if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
  127. outp.armor(_key,true);
  128. RR->node->putPacket(remoteAddr,outp.data(),outp.size());
  129. outp.reset(_id.address(),RR->identity.address(),Packet::VERB_MULTICAST_LIKE);
  130. }
  131. // network ID, MAC, ADI
  132. outp.append((uint64_t)(*n)->id());
  133. mg->mac().appendTo(outp);
  134. outp.append((uint32_t)mg->adi());
  135. }
  136. }
  137. }
  138. if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH) {
  139. outp.armor(_key,true);
  140. RR->node->putPacket(remoteAddr,outp.data(),outp.size());
  141. }
  142. }
  143. }
  144. if ((verb == Packet::VERB_FRAME)||(verb == Packet::VERB_EXT_FRAME))
  145. _lastUnicastFrame = now;
  146. else if (verb == Packet::VERB_MULTICAST_FRAME)
  147. _lastMulticastFrame = now;
  148. }
  149. void Peer::attemptToContactAt(const RuntimeEnvironment *RR,const InetAddress &atAddress,uint64_t now)
  150. {
  151. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
  152. outp.append((unsigned char)ZT_PROTO_VERSION);
  153. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MAJOR);
  154. outp.append((unsigned char)ZEROTIER_ONE_VERSION_MINOR);
  155. outp.append((uint16_t)ZEROTIER_ONE_VERSION_REVISION);
  156. outp.append(now);
  157. RR->identity.serialize(outp,false);
  158. switch(atAddress.ss_family) {
  159. case AF_INET:
  160. outp.append((unsigned char)ZT_PROTO_DEST_ADDRESS_TYPE_IPV4);
  161. outp.append(atAddress.rawIpData(),4);
  162. outp.append((uint16_t)atAddress.port());
  163. break;
  164. case AF_INET6:
  165. outp.append((unsigned char)ZT_PROTO_DEST_ADDRESS_TYPE_IPV6);
  166. outp.append(atAddress.rawIpData(),16);
  167. outp.append((uint16_t)atAddress.port());
  168. break;
  169. default:
  170. outp.append((unsigned char)ZT_PROTO_DEST_ADDRESS_TYPE_NONE);
  171. break;
  172. }
  173. outp.armor(_key,false); // HELLO is sent in the clear
  174. RR->node->putPacket(atAddress,outp.data(),outp.size());
  175. }
  176. void Peer::doPingAndKeepalive(const RuntimeEnvironment *RR,uint64_t now)
  177. {
  178. RemotePath *const bestPath = getBestPath(now);
  179. if ((bestPath)&&(bestPath->active(now))) {
  180. if ((now - bestPath->lastReceived()) >= ZT_PEER_DIRECT_PING_DELAY) {
  181. TRACE("PING %s(%s)",_id.address().toString().c_str(),bestPath->address().toString().c_str());
  182. attemptToContactAt(RR,bestPath->address(),now);
  183. bestPath->sent(now);
  184. } else if ((now - bestPath->lastSend()) >= ZT_NAT_KEEPALIVE_DELAY) {
  185. TRACE("NAT keepalive %s(%s)",_id.address().toString().c_str(),bestPath->address().toString().c_str());
  186. RR->node->putPacket(bestPath->address(),"",0);
  187. bestPath->sent(now);
  188. }
  189. }
  190. }
  191. void Peer::pushDirectPaths(const RuntimeEnvironment *RR,const std::vector<Path> &dps,uint64_t now,bool force)
  192. {
  193. if (((now - _lastDirectPathPush) >= ZT_DIRECT_PATH_PUSH_INTERVAL)||(force)) {
  194. _lastDirectPathPush = now;
  195. std::vector<Path>::const_iterator p(dps.begin());
  196. while (p != dps.end()) {
  197. Packet outp(_id.address(),RR->identity.address(),Packet::VERB_PUSH_DIRECT_PATHS);
  198. outp.addSize(2); // leave room for count
  199. unsigned int count = 0;
  200. while ((p != dps.end())&&((outp.size() + 24) < ZT_PROTO_MAX_PACKET_LENGTH)) {
  201. uint8_t addressType = 4;
  202. switch(p->address().ss_family) {
  203. case AF_INET:
  204. break;
  205. case AF_INET6:
  206. addressType = 6;
  207. break;
  208. default:
  209. ++p;
  210. continue;
  211. }
  212. uint8_t flags = 0;
  213. if (p->metric() < 0)
  214. flags |= (0x01 | 0x02); // forget and blacklist
  215. else {
  216. if (p->reliable())
  217. flags |= 0x04; // no NAT keepalives and such
  218. switch(p->trust()) {
  219. default:
  220. break;
  221. case Path::TRUST_PRIVACY:
  222. flags |= 0x08; // no encryption
  223. break;
  224. case Path::TRUST_ULTIMATE:
  225. flags |= (0x08 | 0x10); // no encryption, no authentication (redundant but go ahead and set both)
  226. break;
  227. }
  228. }
  229. outp.append(flags);
  230. outp.append((uint8_t)((p->metric() >= 0) ? ((p->metric() <= 255) ? p->metric() : 255) : 0));
  231. outp.append((uint16_t)0);
  232. outp.append(addressType);
  233. outp.append(p->address().rawIpData(),((addressType == 4) ? 4 : 16));
  234. outp.append((uint16_t)p->address().port());
  235. ++count;
  236. ++p;
  237. }
  238. if (count) {
  239. outp.setAt(ZT_PACKET_IDX_PAYLOAD,(uint16_t)count);
  240. RR->sw->send(outp,true,0);
  241. }
  242. }
  243. }
  244. }
  245. void Peer::addPath(const RemotePath &newp)
  246. {
  247. unsigned int np = _numPaths;
  248. for(unsigned int p=0;p<np;++p) {
  249. if (_paths[p].address() == newp.address()) {
  250. _paths[p].setFixed(newp.fixed());
  251. return;
  252. }
  253. }
  254. RemotePath *slot = (RemotePath *)0;
  255. if (np < ZT1_MAX_PEER_NETWORK_PATHS) {
  256. // Add new path
  257. slot = &(_paths[np++]);
  258. } else {
  259. // Replace oldest non-fixed path
  260. uint64_t slotLRmin = 0xffffffffffffffffULL;
  261. for(unsigned int p=0;p<ZT1_MAX_PEER_NETWORK_PATHS;++p) {
  262. if ((!_paths[p].fixed())&&(_paths[p].lastReceived() <= slotLRmin)) {
  263. slotLRmin = _paths[p].lastReceived();
  264. slot = &(_paths[p]);
  265. }
  266. }
  267. }
  268. if (slot) {
  269. *slot = newp;
  270. _numPaths = np;
  271. }
  272. }
  273. void Peer::clearPaths(bool fixedToo)
  274. {
  275. if (fixedToo) {
  276. _numPaths = 0;
  277. } else {
  278. unsigned int np = _numPaths;
  279. unsigned int x = 0;
  280. unsigned int y = 0;
  281. while (x < np) {
  282. if (_paths[x].fixed())
  283. _paths[y++] = _paths[x];
  284. ++x;
  285. }
  286. _numPaths = y;
  287. }
  288. }
  289. bool Peer::resetWithinScope(const RuntimeEnvironment *RR,InetAddress::IpScope scope,uint64_t now)
  290. {
  291. unsigned int np = _numPaths;
  292. unsigned int x = 0;
  293. unsigned int y = 0;
  294. while (x < np) {
  295. if (_paths[x].address().ipScope() == scope) {
  296. if (_paths[x].fixed()) {
  297. attemptToContactAt(RR,_paths[x].address(),now);
  298. _paths[y++] = _paths[x]; // keep fixed paths
  299. }
  300. } else {
  301. _paths[y++] = _paths[x]; // keep paths not in this scope
  302. }
  303. ++x;
  304. }
  305. _numPaths = y;
  306. return (y < np);
  307. }
  308. void Peer::getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const
  309. {
  310. uint64_t bestV4 = 0,bestV6 = 0;
  311. for(unsigned int p=0,np=_numPaths;p<np;++p) {
  312. if (_paths[p].active(now)) {
  313. uint64_t lr = _paths[p].lastReceived();
  314. if (lr) {
  315. if (_paths[p].address().isV4()) {
  316. if (lr >= bestV4) {
  317. bestV4 = lr;
  318. v4 = _paths[p].address();
  319. }
  320. } else if (_paths[p].address().isV6()) {
  321. if (lr >= bestV6) {
  322. bestV6 = lr;
  323. v6 = _paths[p].address();
  324. }
  325. }
  326. }
  327. }
  328. }
  329. }
  330. } // namespace ZeroTier