Peer.cpp 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
  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(;;) {
  112. std::vector<Path>::iterator p(_paths.begin());
  113. if (p == _paths.end())
  114. return false;
  115. uint64_t bestPathLastReceived = p->lastReceived();
  116. std::vector<Path>::iterator bestPath = p;
  117. while (++p != _paths.end()) {
  118. uint64_t lr = p->lastReceived();
  119. if (lr > bestPathLastReceived) {
  120. bestPathLastReceived = lr;
  121. bestPath = p;
  122. }
  123. }
  124. if (_r->sm->send(bestPath->address(),bestPath->tcp(),bestPath->type() == Path::PATH_TYPE_TCP_OUT,data,len)) {
  125. bestPath->sent(now);
  126. return true;
  127. } else {
  128. if (bestPath->fixed())
  129. return false;
  130. _paths.erase(bestPath);
  131. // ... try again and pick a different path
  132. }
  133. }
  134. return false;
  135. }
  136. bool Peer::sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now)
  137. {
  138. bool sent = false;
  139. Mutex::Lock _l(_lock);
  140. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  141. if (!p->tcp())
  142. sent |= _r->sm->sendFirewallOpener(p->address(),ZT_FIREWALL_OPENER_HOPS);
  143. }
  144. return sent;
  145. }
  146. bool Peer::sendPing(const RuntimeEnvironment *_r,uint64_t now,bool firstSinceReset)
  147. {
  148. bool sent = false;
  149. SharedPtr<Peer> self(this);
  150. Mutex::Lock _l(_lock);
  151. // NOTE: this will never ping a peer that has *only* TCP paths. Right
  152. // now there's never such a thing as TCP is only for failover.
  153. bool pingTcp;
  154. if (!firstSinceReset) {
  155. uint64_t lastUdp = 0;
  156. uint64_t lastTcp = 0;
  157. uint64_t lastPing = 0;
  158. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  159. if (p->tcp())
  160. lastTcp = std::max(p->lastReceived(),lastTcp);
  161. else lastUdp = std::max(p->lastReceived(),lastUdp);
  162. lastPing = std::max(p->lastPing(),lastPing);
  163. }
  164. uint64_t lastAny = std::max(lastUdp,lastTcp);
  165. pingTcp = ( ( (lastAny < lastPing) && ((lastPing - lastAny) >= ZT_PING_UNANSWERED_AFTER) ) || (lastTcp > lastUdp) );
  166. } else pingTcp = false;
  167. TRACE("PING %s (pingTcp==%d)",_id.address().toString().c_str(),(int)pingTcp);
  168. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  169. if ((pingTcp)||(!p->tcp())) {
  170. if (_r->sw->sendHELLO(self,*p)) {
  171. p->sent(now);
  172. p->pinged(now);
  173. sent = true;
  174. }
  175. }
  176. }
  177. return sent;
  178. }
  179. void Peer::clean(uint64_t now)
  180. {
  181. Mutex::Lock _l(_lock);
  182. unsigned long i = 0,o = 0,l = _paths.size();
  183. while (i != l) {
  184. if (_paths[i].active(now))
  185. _paths[o++] = _paths[i];
  186. ++i;
  187. }
  188. _paths.resize(o);
  189. }
  190. } // namespace ZeroTier