Peer.cpp 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2011-2014 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. #include "Peer.hpp"
  28. #include "Switch.hpp"
  29. #include <algorithm>
  30. namespace ZeroTier {
  31. Peer::Peer() :
  32. _lastUsed(0),
  33. _lastUnicastFrame(0),
  34. _lastMulticastFrame(0),
  35. _lastAnnouncedTo(0),
  36. _vMajor(0),
  37. _vMinor(0),
  38. _vRevision(0),
  39. _latency(0) {}
  40. Peer::Peer(const Identity &myIdentity,const Identity &peerIdentity)
  41. throw(std::runtime_error) :
  42. _id(peerIdentity),
  43. _lastUsed(0),
  44. _lastUnicastFrame(0),
  45. _lastMulticastFrame(0),
  46. _lastAnnouncedTo(0),
  47. _vMajor(0),
  48. _vMinor(0),
  49. _vRevision(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::receive(
  56. const RuntimeEnvironment *_r,
  57. const SharedPtr<Socket> &fromSock,
  58. const InetAddress &remoteAddr,
  59. unsigned int hops,
  60. uint64_t packetId,
  61. Packet::Verb verb,
  62. uint64_t inRePacketId,
  63. Packet::Verb inReVerb,
  64. uint64_t now)
  65. {
  66. // Update system-wide last packet receive time
  67. *((const_cast<uint64_t *>(&(_r->timeOfLastPacketReceived)))) = now;
  68. // Learn paths from direct packets (hops == 0)
  69. if (!hops) {
  70. {
  71. Mutex::Lock _l(_lock);
  72. bool havePath = false;
  73. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  74. if ((p->address() == remoteAddr)&&(p->tcp() == fromSock->tcp())) {
  75. p->received(now);
  76. havePath = true;
  77. break;
  78. }
  79. }
  80. if (!havePath) {
  81. Path::Type pt = Path::PATH_TYPE_UDP;
  82. switch(fromSock->type()) {
  83. case Socket::ZT_SOCKET_TYPE_TCP_IN:
  84. pt = Path::PATH_TYPE_TCP_IN;
  85. break;
  86. case Socket::ZT_SOCKET_TYPE_TCP_OUT:
  87. pt = Path::PATH_TYPE_TCP_OUT;
  88. break;
  89. default:
  90. break;
  91. }
  92. _paths.push_back(Path(remoteAddr,pt,false));
  93. _paths.back().received(now);
  94. }
  95. }
  96. // Announce multicast LIKEs to peers to whom we have a direct link
  97. // Lock can't be locked here or it'll recurse and deadlock.
  98. if ((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000)) {
  99. _lastAnnouncedTo = now;
  100. _r->sw->announceMulticastGroups(SharedPtr<Peer>(this));
  101. }
  102. }
  103. if (verb == Packet::VERB_FRAME)
  104. _lastUnicastFrame = now;
  105. else if (verb == Packet::VERB_MULTICAST_FRAME)
  106. _lastMulticastFrame = now;
  107. }
  108. bool Peer::send(const RuntimeEnvironment *_r,const void *data,unsigned int len,uint64_t now)
  109. {
  110. Mutex::Lock _l(_lock);
  111. /* For sending ordinary packets, paths are divided into two categories:
  112. * "normal" and "TCP out." Normal includes UDP and incoming TCP. We want
  113. * to treat outbound TCP differently since if we use it it may end up
  114. * overriding UDP and UDP performs much better. We only want to initiate
  115. * TCP if it looks like UDP isn't available. */
  116. Path *bestNormalPath = (Path *)0;
  117. Path *bestTcpOutPath = (Path *)0;
  118. uint64_t bestNormalPathLastReceived = 0;
  119. uint64_t bestTcpOutPathLastReceived = 0;
  120. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  121. uint64_t lr = p->lastReceived();
  122. if (p->type() == Path::PATH_TYPE_TCP_OUT) {
  123. if (lr >= bestTcpOutPathLastReceived) {
  124. bestTcpOutPathLastReceived = lr;
  125. bestTcpOutPath = &(*p);
  126. }
  127. } else {
  128. if (lr >= bestNormalPathLastReceived) {
  129. bestNormalPathLastReceived = lr;
  130. bestNormalPath = &(*p);
  131. }
  132. }
  133. }
  134. Path *bestPath = (Path *)0;
  135. if (bestTcpOutPath) { // we have a TCP out path
  136. if (bestNormalPath) { // we have both paths, decide which to use
  137. if (_r->tcpTunnelingEnabled) { // TCP tunneling is enabled, so use normal path only if it looks alive
  138. if ((bestNormalPathLastReceived > _r->timeOfLastResynchronize)&&((now - bestNormalPathLastReceived) < ZT_PEER_PATH_ACTIVITY_TIMEOUT))
  139. bestPath = bestNormalPath;
  140. else bestPath = bestTcpOutPath;
  141. } else { // TCP tunneling is disabled, use normal path
  142. bestPath = bestNormalPath;
  143. }
  144. } else { // we only have a TCP_OUT path, so use it regardless
  145. bestPath = bestTcpOutPath;
  146. }
  147. } else { // we only have a normal path (or none at all, that case is caught below)
  148. bestPath = bestNormalPath;
  149. }
  150. if ((bestPath)&&(_r->sm->send(bestPath->address(),bestPath->tcp(),bestPath->type() == Path::PATH_TYPE_TCP_OUT,data,len))) {
  151. bestPath->sent(now);
  152. return true;
  153. }
  154. return false;
  155. }
  156. bool Peer::sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now)
  157. {
  158. bool sent = false;
  159. Mutex::Lock _l(_lock);
  160. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  161. if (p->type() == Path::PATH_TYPE_UDP) {
  162. for(unsigned int h=1;h<=ZT_FIREWALL_OPENER_HOPS;++h)
  163. sent |= _r->sm->sendFirewallOpener(p->address(),h);
  164. }
  165. }
  166. return sent;
  167. }
  168. bool Peer::sendPing(const RuntimeEnvironment *_r,uint64_t now)
  169. {
  170. bool sent = false;
  171. SharedPtr<Peer> self(this);
  172. Mutex::Lock _l(_lock);
  173. /* Ping (and thus open) outbound TCP connections if we have no other options
  174. * or if the TCP tunneling master switch is enabled and pings have been
  175. * unanswered for ZT_TCP_TUNNEL_FAILOVER_TIMEOUT ms over normal channels. */
  176. uint64_t lastNormalPingSent = 0;
  177. uint64_t lastNormalReceive = 0;
  178. bool haveNormal = false;
  179. for(std::vector<Path>::const_iterator p(_paths.begin());p!=_paths.end();++p) {
  180. if (p->type() != Path::PATH_TYPE_TCP_OUT) {
  181. lastNormalPingSent = std::max(lastNormalPingSent,p->lastPing());
  182. lastNormalReceive = std::max(lastNormalReceive,p->lastReceived());
  183. haveNormal = true;
  184. }
  185. }
  186. const bool useTcpOut = ( (!haveNormal) || ( (_r->tcpTunnelingEnabled) && (lastNormalPingSent > _r->timeOfLastResynchronize) && (lastNormalPingSent > lastNormalReceive) && ((lastNormalPingSent - lastNormalReceive) >= ZT_TCP_TUNNEL_FAILOVER_TIMEOUT) ) );
  187. TRACE("PING %s (useTcpOut==%d)",_id.address().toString().c_str(),(int)useTcpOut);
  188. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  189. if ((useTcpOut)||(p->type() != Path::PATH_TYPE_TCP_OUT)) {
  190. p->pinged(now); // attempts to ping are logged whether they look successful or not
  191. if (_r->sw->sendHELLO(self,*p)) {
  192. p->sent(now);
  193. sent = true;
  194. }
  195. }
  196. }
  197. return sent;
  198. }
  199. void Peer::clean(uint64_t now)
  200. {
  201. Mutex::Lock _l(_lock);
  202. unsigned long i = 0,o = 0,l = (unsigned long)_paths.size();
  203. while (i != l) {
  204. if (_paths[i].active(now)) // active includes fixed
  205. _paths[o++] = _paths[i];
  206. ++i;
  207. }
  208. _paths.resize(o);
  209. }
  210. void Peer::getBestActiveUdpPathAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const
  211. {
  212. uint64_t bestV4 = 0,bestV6 = 0;
  213. Mutex::Lock _l(_lock);
  214. for(std::vector<Path>::const_iterator p(_paths.begin());p!=_paths.end();++p) {
  215. if ((p->type() == Path::PATH_TYPE_UDP)&&(p->active(now))) {
  216. uint64_t lr = p->lastReceived();
  217. if (lr) {
  218. if (p->address().isV4()) {
  219. if (lr >= bestV4) {
  220. bestV4 = lr;
  221. v4 = p->address();
  222. }
  223. } else if (p->address().isV6()) {
  224. if (lr >= bestV6) {
  225. bestV6 = lr;
  226. v6 = p->address();
  227. }
  228. }
  229. }
  230. }
  231. }
  232. }
  233. } // namespace ZeroTier