Peer.cpp 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229
  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. bool useTcpOut = _isTcpFailoverTime(_r,now);
  112. std::vector<Path>::iterator p(_paths.begin());
  113. if (!useTcpOut) {
  114. // If we don't want to initiate TCP, seek past TCP paths if they are at the front
  115. // to find the first UDP path as our default.
  116. while ((p != _paths.end())&&(p->type() == Path::PATH_TYPE_TCP_OUT))
  117. ++p;
  118. }
  119. if (p == _paths.end())
  120. return false;
  121. // Treat first path as default and look for a better one based on time of
  122. // last packet received.
  123. std::vector<Path>::iterator bestPath = p;
  124. uint64_t bestPathLastReceived = p->lastReceived();
  125. while (++p != _paths.end()) {
  126. uint64_t lr = p->lastReceived();
  127. if ( (lr > bestPathLastReceived) && ((useTcpOut)||(p->type() != Path::PATH_TYPE_TCP_OUT)) ) {
  128. bestPathLastReceived = lr;
  129. bestPath = p;
  130. }
  131. }
  132. if (_r->sm->send(bestPath->address(),bestPath->tcp(),bestPath->type() == Path::PATH_TYPE_TCP_OUT,data,len)) {
  133. bestPath->sent(now);
  134. return true;
  135. }
  136. return false;
  137. }
  138. bool Peer::sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now)
  139. {
  140. bool sent = false;
  141. Mutex::Lock _l(_lock);
  142. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  143. if (!p->tcp())
  144. sent |= _r->sm->sendFirewallOpener(p->address(),ZT_FIREWALL_OPENER_HOPS);
  145. }
  146. return sent;
  147. }
  148. bool Peer::sendPing(const RuntimeEnvironment *_r,uint64_t now)
  149. {
  150. bool sent = false;
  151. SharedPtr<Peer> self(this);
  152. Mutex::Lock _l(_lock);
  153. bool useTcpOut = _isTcpFailoverTime(_r,now);
  154. TRACE("PING %s (useTcpOut==%d)",_id.address().toString().c_str(),(int)useTcpOut);
  155. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  156. if ((useTcpOut)||(p->type() != Path::PATH_TYPE_TCP_OUT)) {
  157. p->pinged(now); // we log pings sent even if the send "fails", since what we want to track is when we last tried to ping
  158. if (_r->sw->sendHELLO(self,*p)) {
  159. p->sent(now);
  160. sent = true;
  161. }
  162. }
  163. }
  164. return sent;
  165. }
  166. void Peer::clean(uint64_t now)
  167. {
  168. Mutex::Lock _l(_lock);
  169. unsigned long i = 0,o = 0,l = (unsigned long)_paths.size();
  170. while (i != l) {
  171. if (_paths[i].active(now))
  172. _paths[o++] = _paths[i];
  173. ++i;
  174. }
  175. _paths.resize(o);
  176. }
  177. bool Peer::_isTcpFailoverTime(const RuntimeEnvironment *_r,uint64_t now) const
  178. throw()
  179. {
  180. // assumes _lock is locked
  181. uint64_t lastResync = _r->timeOfLastResynchronize;
  182. if ((now - lastResync) >= ZT_TCP_TUNNEL_FAILOVER_TIMEOUT) {
  183. if ((now - _r->timeOfLastPacketReceived) >= ZT_TCP_TUNNEL_FAILOVER_TIMEOUT)
  184. return true;
  185. uint64_t lastUdpPingSent = 0;
  186. uint64_t lastUdpReceive = 0;
  187. bool haveUdp = false;
  188. for(std::vector<Path>::const_iterator p(_paths.begin());p!=_paths.end();++p) {
  189. if (p->type() == Path::PATH_TYPE_UDP) {
  190. lastUdpPingSent = std::max(lastUdpPingSent,p->lastPing());
  191. lastUdpReceive = std::max(lastUdpReceive,p->lastReceived());
  192. haveUdp = true;
  193. }
  194. }
  195. return ( (!haveUdp) || ( (lastUdpPingSent > lastResync) && ((now - lastUdpReceive) >= ZT_TCP_TUNNEL_FAILOVER_TIMEOUT) ) );
  196. }
  197. return false;
  198. }
  199. } // namespace ZeroTier