2013-07-04 20:56:19 +00:00
|
|
|
/*
|
2015-02-17 21:11:34 +00:00
|
|
|
* ZeroTier One - Network Virtualization Everywhere
|
|
|
|
* Copyright (C) 2011-2015 ZeroTier, Inc.
|
2013-07-04 20:56:19 +00:00
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
* --
|
|
|
|
*
|
|
|
|
* ZeroTier may be used and distributed under the terms of the GPLv3, which
|
|
|
|
* are available at: http://www.gnu.org/licenses/gpl-3.0.html
|
|
|
|
*
|
|
|
|
* If you would like to embed ZeroTier into a commercial application or
|
|
|
|
* redistribute it in a modified binary form, please contact ZeroTier Networks
|
|
|
|
* LLC. Start here: http://www.zerotier.com/
|
|
|
|
*/
|
|
|
|
|
2014-08-05 21:05:50 +00:00
|
|
|
#include "Constants.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Peer.hpp"
|
2015-04-03 00:54:56 +00:00
|
|
|
#include "Node.hpp"
|
2013-10-01 20:01:36 +00:00
|
|
|
#include "Switch.hpp"
|
2014-09-30 15:38:03 +00:00
|
|
|
#include "Network.hpp"
|
2014-04-10 21:22:25 +00:00
|
|
|
#include "AntiRecursion.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-12-24 18:39:29 +00:00
|
|
|
#include <algorithm>
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
namespace ZeroTier {
|
|
|
|
|
|
|
|
Peer::Peer(const Identity &myIdentity,const Identity &peerIdentity)
|
|
|
|
throw(std::runtime_error) :
|
2013-10-21 14:29:44 +00:00
|
|
|
_lastUsed(0),
|
2014-06-30 18:31:04 +00:00
|
|
|
_lastReceive(0),
|
2013-07-13 18:28:26 +00:00
|
|
|
_lastUnicastFrame(0),
|
|
|
|
_lastMulticastFrame(0),
|
2014-10-13 21:12:51 +00:00
|
|
|
_lastAnnouncedTo(0),
|
2015-04-03 00:54:56 +00:00
|
|
|
_lastSpammed(0),
|
2013-07-12 02:06:25 +00:00
|
|
|
_vMajor(0),
|
|
|
|
_vMinor(0),
|
2014-02-03 18:46:37 +00:00
|
|
|
_vRevision(0),
|
2015-04-03 00:54:56 +00:00
|
|
|
_id(peerIdentity),
|
2014-10-21 17:42:04 +00:00
|
|
|
_numPaths(0),
|
2015-04-03 00:54:56 +00:00
|
|
|
_latency(0)
|
2013-07-04 20:56:19 +00:00
|
|
|
{
|
2013-10-05 14:19:12 +00:00
|
|
|
if (!myIdentity.agree(peerIdentity,_key,ZT_PEER_SECRET_KEY_LENGTH))
|
2013-07-04 20:56:19 +00:00
|
|
|
throw std::runtime_error("new peer identity key agreement failed");
|
|
|
|
}
|
|
|
|
|
2014-10-21 17:42:04 +00:00
|
|
|
void Peer::received(
|
2014-09-24 20:53:03 +00:00
|
|
|
const RuntimeEnvironment *RR,
|
2013-12-24 18:39:29 +00:00
|
|
|
const InetAddress &remoteAddr,
|
2015-04-03 00:54:56 +00:00
|
|
|
int linkDesperation
|
2013-12-24 18:39:29 +00:00
|
|
|
unsigned int hops,
|
|
|
|
uint64_t packetId,
|
|
|
|
Packet::Verb verb,
|
|
|
|
uint64_t inRePacketId,
|
2015-04-03 00:54:56 +00:00
|
|
|
Packet::Verb inReVerb)
|
2013-07-04 20:56:19 +00:00
|
|
|
{
|
2015-04-03 00:54:56 +00:00
|
|
|
const uint64_t now = RR->node->now();
|
2014-06-30 18:31:04 +00:00
|
|
|
_lastReceive = now;
|
|
|
|
|
2014-04-01 05:23:55 +00:00
|
|
|
if (!hops) {
|
2015-04-03 00:54:56 +00:00
|
|
|
/* Learn new paths from direct (hops == 0) packets */
|
2014-03-21 21:31:10 +00:00
|
|
|
{
|
2015-04-03 00:54:56 +00:00
|
|
|
unsigned int np = _numPaths;
|
|
|
|
|
2014-03-21 21:31:10 +00:00
|
|
|
bool havePath = false;
|
2015-04-03 00:54:56 +00:00
|
|
|
for(unsigned int p=0;p<np;++p) {
|
|
|
|
if (_paths[p].address() == remoteAddr) {
|
|
|
|
_paths[p].received(now,linkDesperation);
|
2014-03-21 21:31:10 +00:00
|
|
|
havePath = true;
|
|
|
|
break;
|
|
|
|
}
|
2014-03-21 03:07:35 +00:00
|
|
|
}
|
|
|
|
|
2014-04-01 05:23:55 +00:00
|
|
|
if (!havePath) {
|
2015-04-03 00:54:56 +00:00
|
|
|
Path *slot = (Path *)0;
|
2014-10-21 17:42:04 +00:00
|
|
|
if (np < ZT_PEER_MAX_PATHS) {
|
2015-04-03 00:54:56 +00:00
|
|
|
// Add new path
|
|
|
|
slot = &(_paths[np++]);
|
|
|
|
} else {
|
|
|
|
// Replace oldest non-fixed path
|
|
|
|
uint64_t slotLRmin = 0xffffffffffffffffULL;
|
|
|
|
for(unsigned int p=0;p<ZT_PEER_MAX_PATHS;++p) {
|
|
|
|
if ((!_paths[p].fixed())&&(_paths[p].lastReceived() <= slotLRmin)) {
|
|
|
|
slotLRmin = _paths[p].lastReceived();
|
|
|
|
slot = &(_paths[p]);
|
|
|
|
}
|
2014-10-21 17:42:04 +00:00
|
|
|
}
|
2015-04-03 00:54:56 +00:00
|
|
|
}
|
|
|
|
if (slot) {
|
|
|
|
slot->init(remoteAddr,false);
|
|
|
|
slot->received(now,linkDesperation);
|
|
|
|
_numPaths = np;
|
2014-04-01 05:23:55 +00:00
|
|
|
}
|
2014-03-21 21:31:10 +00:00
|
|
|
}
|
2014-03-21 03:07:35 +00:00
|
|
|
}
|
2013-12-31 09:22:32 +00:00
|
|
|
|
2014-10-04 01:27:42 +00:00
|
|
|
/* Announce multicast groups of interest to direct peers if they are
|
|
|
|
* considered authorized members of a given network. Also announce to
|
|
|
|
* supernodes and network controllers. The other place this is done
|
|
|
|
* is in rescanMulticastGroups() in Network, but that only sends something
|
|
|
|
* if a network's multicast groups change. */
|
2014-10-13 21:12:51 +00:00
|
|
|
if ((now - _lastAnnouncedTo) >= ((ZT_MULTICAST_LIKE_EXPIRE / 2) - 1000)) {
|
|
|
|
_lastAnnouncedTo = now;
|
2014-09-30 15:38:03 +00:00
|
|
|
|
2014-10-21 17:42:04 +00:00
|
|
|
bool isSupernode = RR->topology->isSupernode(_id.address());
|
|
|
|
|
2014-09-30 15:38:03 +00:00
|
|
|
Packet outp(_id.address(),RR->identity.address(),Packet::VERB_MULTICAST_LIKE);
|
|
|
|
std::vector< SharedPtr<Network> > networks(RR->nc->networks());
|
|
|
|
for(std::vector< SharedPtr<Network> >::iterator n(networks.begin());n!=networks.end();++n) {
|
2014-10-21 17:42:04 +00:00
|
|
|
if ( ((*n)->isAllowed(_id.address())) || (isSupernode) ) {
|
2014-09-30 15:38:03 +00:00
|
|
|
std::set<MulticastGroup> mgs((*n)->multicastGroups());
|
|
|
|
for(std::set<MulticastGroup>::iterator mg(mgs.begin());mg!=mgs.end();++mg) {
|
|
|
|
if ((outp.size() + 18) > ZT_UDP_DEFAULT_PAYLOAD_MTU) {
|
|
|
|
outp.armor(_key,true);
|
2015-04-03 00:54:56 +00:00
|
|
|
RR->node->putPacket(remoteAddr,outp.data(),outp.size(),linkDesperation,false);
|
2014-09-30 15:38:03 +00:00
|
|
|
outp.reset(_id.address(),RR->identity.address(),Packet::VERB_MULTICAST_LIKE);
|
|
|
|
}
|
|
|
|
|
|
|
|
// network ID, MAC, ADI
|
|
|
|
outp.append((uint64_t)(*n)->id());
|
|
|
|
mg->mac().appendTo(outp);
|
|
|
|
outp.append((uint32_t)mg->adi());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (outp.size() > ZT_PROTO_MIN_PACKET_LENGTH) {
|
|
|
|
outp.armor(_key,true);
|
2015-04-03 00:54:56 +00:00
|
|
|
RR->node->putPacket(remoteAddr,outp.data(),outp.size(),linkDesperation,false);
|
2014-09-30 15:38:03 +00:00
|
|
|
}
|
2014-01-30 22:23:52 +00:00
|
|
|
}
|
2013-07-13 18:28:26 +00:00
|
|
|
}
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2014-06-11 04:41:34 +00:00
|
|
|
if ((verb == Packet::VERB_FRAME)||(verb == Packet::VERB_EXT_FRAME))
|
2013-07-13 18:28:26 +00:00
|
|
|
_lastUnicastFrame = now;
|
2015-04-03 00:54:56 +00:00
|
|
|
else if (verb == Packet::VERB_MULTICAST_FRAME)
|
2013-07-13 18:28:26 +00:00
|
|
|
_lastMulticastFrame = now;
|
2013-07-04 20:56:19 +00:00
|
|
|
}
|
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
bool Peer::send(const RuntimeEnvironment *RR,const void *data,unsigned int len,uint64_t now)
|
2013-07-04 20:56:19 +00:00
|
|
|
{
|
2014-11-20 21:20:16 +00:00
|
|
|
Path *bestPath = (Path *)0;
|
2015-04-03 00:54:56 +00:00
|
|
|
uint64_t lrMax = 0;
|
2014-10-21 17:42:04 +00:00
|
|
|
for(unsigned int p=0,np=_numPaths;p<np;++p) {
|
2015-04-03 00:54:56 +00:00
|
|
|
if ((_paths[p].active(now)&&(_paths[p].lastReceived() >= lrMax)) {
|
|
|
|
lrMax = _paths[p].lastReceived();
|
|
|
|
bestPath = &(_paths[p]);
|
2014-04-10 00:08:35 +00:00
|
|
|
}
|
|
|
|
}
|
2014-03-26 22:35:15 +00:00
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
if (bestPath) {
|
|
|
|
bool spam = ((now - _lastSpammed) >= ZT_DESPERATION_SPAM_INTERVAL);
|
|
|
|
if (RR->node->putPacket(bestPath->address(),data,len,bestPath->desperation(),spam)) {
|
|
|
|
bestPath->sent(now);
|
|
|
|
RR->antiRec->logOutgoingZT(data,len);
|
|
|
|
if (spam)
|
|
|
|
_lastSpammed = now;
|
|
|
|
return true;
|
2013-10-02 20:12:10 +00:00
|
|
|
}
|
|
|
|
}
|
2014-02-03 18:46:37 +00:00
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
return false;
|
2014-10-21 17:42:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Peer::addPath(const Path &newp)
|
|
|
|
{
|
|
|
|
unsigned int np = _numPaths;
|
2015-04-03 00:54:56 +00:00
|
|
|
|
2014-10-21 17:42:04 +00:00
|
|
|
for(unsigned int p=0;p<np;++p) {
|
2015-04-03 00:54:56 +00:00
|
|
|
if (_paths[p].address() == newp.address()) {
|
2014-10-21 17:42:04 +00:00
|
|
|
_paths[p].setFixed(newp.fixed());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2015-04-03 00:54:56 +00:00
|
|
|
|
|
|
|
Path *slot = (Path *)0;
|
2014-10-21 17:42:04 +00:00
|
|
|
if (np < ZT_PEER_MAX_PATHS) {
|
2015-04-03 00:54:56 +00:00
|
|
|
// Add new path
|
|
|
|
slot = &(_paths[np++]);
|
|
|
|
} else {
|
|
|
|
// Replace oldest non-fixed path
|
|
|
|
uint64_t slotLRmin = 0xffffffffffffffffULL;
|
|
|
|
for(unsigned int p=0;p<ZT_PEER_MAX_PATHS;++p) {
|
|
|
|
if ((!_paths[p].fixed())&&(_paths[p].lastReceived() <= slotLRmin)) {
|
|
|
|
slotLRmin = _paths[p].lastReceived();
|
|
|
|
slot = &(_paths[p]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (slot) {
|
|
|
|
*slot = newp;
|
|
|
|
_numPaths = np;
|
2014-10-21 17:42:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Peer::clearPaths(bool fixedToo)
|
|
|
|
{
|
|
|
|
if (fixedToo) {
|
|
|
|
_numPaths = 0;
|
|
|
|
} else {
|
|
|
|
unsigned int np = _numPaths;
|
|
|
|
unsigned int x = 0;
|
|
|
|
unsigned int y = 0;
|
|
|
|
while (x < np) {
|
|
|
|
if (_paths[x].fixed())
|
|
|
|
_paths[y++] = _paths[x];
|
|
|
|
++x;
|
|
|
|
}
|
|
|
|
_numPaths = y;
|
2014-04-04 00:12:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
void Peer::getBestActiveAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const
|
2014-04-09 23:00:25 +00:00
|
|
|
{
|
|
|
|
uint64_t bestV4 = 0,bestV6 = 0;
|
2014-10-21 17:42:04 +00:00
|
|
|
for(unsigned int p=0,np=_numPaths;p<np;++p) {
|
2015-04-03 00:54:56 +00:00
|
|
|
if (_paths[p].active(now)) {
|
2014-10-21 17:42:04 +00:00
|
|
|
uint64_t lr = _paths[p].lastReceived();
|
2014-04-09 23:00:25 +00:00
|
|
|
if (lr) {
|
2014-10-21 17:42:04 +00:00
|
|
|
if (_paths[p].address().isV4()) {
|
2014-04-09 23:00:25 +00:00
|
|
|
if (lr >= bestV4) {
|
|
|
|
bestV4 = lr;
|
2014-10-21 17:42:04 +00:00
|
|
|
v4 = _paths[p].address();
|
2014-04-09 23:00:25 +00:00
|
|
|
}
|
2014-10-21 17:42:04 +00:00
|
|
|
} else if (_paths[p].address().isV6()) {
|
2014-04-09 23:00:25 +00:00
|
|
|
if (lr >= bestV6) {
|
|
|
|
bestV6 = lr;
|
2014-10-21 17:42:04 +00:00
|
|
|
v6 = _paths[p].address();
|
2014-04-09 23:00:25 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
} // namespace ZeroTier
|