Peer.cpp 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190
  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. *((const_cast<uint64_t *>(&(_r->timeOfLastPacketReceived)))) = now;
  67. if (!hops) { // direct packet
  68. {
  69. Mutex::Lock _l(_lock);
  70. // Update receive time on known paths
  71. bool havePath = false;
  72. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  73. if ((p->address() == remoteAddr)&&(p->tcp() == (fromSock->type() == Socket::ZT_SOCKET_TYPE_TCP))) {
  74. p->received(now);
  75. havePath = true;
  76. break;
  77. }
  78. }
  79. // Learn new UDP paths (learning TCP would require an explicit mechanism)
  80. if ((!havePath)&&(fromSock->type() != Socket::ZT_SOCKET_TYPE_TCP)) {
  81. _paths.push_back(Path(remoteAddr,false,false));
  82. _paths.back().received(now);
  83. }
  84. }
  85. // Announce multicast LIKEs to peers to whom we have a direct link
  86. // Lock can't be locked here or it'll recurse and deadlock.
  87. if ((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000)) {
  88. _lastAnnouncedTo = now;
  89. _r->sw->announceMulticastGroups(SharedPtr<Peer>(this));
  90. }
  91. }
  92. if (verb == Packet::VERB_FRAME)
  93. _lastUnicastFrame = now;
  94. else if (verb == Packet::VERB_MULTICAST_FRAME)
  95. _lastMulticastFrame = now;
  96. }
  97. bool Peer::send(const RuntimeEnvironment *_r,const void *data,unsigned int len,uint64_t now)
  98. {
  99. Mutex::Lock _l(_lock);
  100. std::vector<Path>::iterator p(_paths.begin());
  101. if (p == _paths.end()) {
  102. //TRACE("send to %s failed: no paths available",_id.address().toString().c_str());
  103. return false;
  104. }
  105. uint64_t bestPathLastReceived = p->lastReceived();
  106. std::vector<Path>::iterator bestPath = p;
  107. while (++p != _paths.end()) {
  108. uint64_t lr = p->lastReceived();
  109. if (lr > bestPathLastReceived) {
  110. bestPathLastReceived = lr;
  111. bestPath = p;
  112. }
  113. }
  114. //TRACE("send to %s: using path: %s",_id.address().toString().c_str(),bestPath->toString().c_str());
  115. if (_r->sm->send(bestPath->address(),bestPath->tcp(),data,len)) {
  116. bestPath->sent(now);
  117. return true;
  118. }
  119. return false;
  120. }
  121. bool Peer::sendFirewallOpener(const RuntimeEnvironment *_r,uint64_t now)
  122. {
  123. bool sent = false;
  124. Mutex::Lock _l(_lock);
  125. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  126. if (!p->tcp())
  127. sent |= _r->sm->sendFirewallOpener(p->address(),ZT_FIREWALL_OPENER_HOPS);
  128. }
  129. return sent;
  130. }
  131. bool Peer::sendPing(const RuntimeEnvironment *_r,uint64_t now,bool firstSinceReset)
  132. {
  133. bool sent = false;
  134. SharedPtr<Peer> self(this);
  135. Mutex::Lock _l(_lock);
  136. // NOTE: this will never ping a peer that has *only* TCP paths. Right
  137. // now there's never such a thing as TCP is only for failover.
  138. bool pingTcp;
  139. if (!firstSinceReset) {
  140. // Do not use TCP if one of our UDP endpoints has answered recently.
  141. uint64_t lastPing = 0;
  142. uint64_t lastDirectReceive = 0;
  143. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  144. lastPing = std::max(lastPing,p->lastPing());
  145. lastDirectReceive = std::max(lastDirectReceive,p->lastReceived());
  146. }
  147. pingTcp = ( (lastDirectReceive < lastPing) && ((lastPing - lastDirectReceive) >= ZT_PING_UNANSWERED_AFTER) );
  148. } else pingTcp = false;
  149. TRACE("PING %s (pingTcp==%d)",_id.address().toString().c_str(),(int)pingTcp);
  150. for(std::vector<Path>::iterator p(_paths.begin());p!=_paths.end();++p) {
  151. if ((pingTcp)||(!p->tcp())) {
  152. if (_r->sw->sendHELLO(self,p->address(),p->tcp())) {
  153. p->sent(now);
  154. p->pinged(now);
  155. sent = true;
  156. }
  157. }
  158. }
  159. return sent;
  160. }
  161. } // namespace ZeroTier