2013-07-04 20:56:19 +00:00
|
|
|
/*
|
2015-02-17 21:11:34 +00:00
|
|
|
* ZeroTier One - Network Virtualization Everywhere
|
2016-01-12 22:04:55 +00:00
|
|
|
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
|
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/>.
|
|
|
|
*/
|
|
|
|
|
2013-12-07 00:49:20 +00:00
|
|
|
#ifndef ZT_PEER_HPP
|
|
|
|
#define ZT_PEER_HPP
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-08-13 01:25:36 +00:00
|
|
|
#include <stdint.h>
|
|
|
|
|
2015-04-24 20:35:17 +00:00
|
|
|
#include "Constants.hpp"
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
#include <algorithm>
|
|
|
|
#include <utility>
|
2014-10-21 17:42:04 +00:00
|
|
|
#include <vector>
|
2013-07-04 20:56:19 +00:00
|
|
|
#include <stdexcept>
|
2013-08-13 01:25:36 +00:00
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
#include "../include/ZeroTierOne.h"
|
|
|
|
|
2015-04-01 01:33:39 +00:00
|
|
|
#include "RuntimeEnvironment.hpp"
|
2015-10-27 22:00:16 +00:00
|
|
|
#include "Path.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Address.hpp"
|
|
|
|
#include "Utils.hpp"
|
|
|
|
#include "Identity.hpp"
|
|
|
|
#include "InetAddress.hpp"
|
|
|
|
#include "Packet.hpp"
|
|
|
|
#include "SharedPtr.hpp"
|
|
|
|
#include "AtomicCounter.hpp"
|
2015-10-01 18:11:52 +00:00
|
|
|
#include "Hashtable.hpp"
|
|
|
|
#include "Mutex.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "NonCopyable.hpp"
|
2014-10-21 17:42:04 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
namespace ZeroTier {
|
|
|
|
|
|
|
|
/**
|
2015-07-06 21:08:13 +00:00
|
|
|
* Peer on P2P Network (virtual layer 1)
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
|
|
|
class Peer : NonCopyable
|
|
|
|
{
|
|
|
|
friend class SharedPtr<Peer>;
|
|
|
|
|
2014-10-21 17:42:04 +00:00
|
|
|
private:
|
|
|
|
Peer() {} // disabled to prevent bugs -- should not be constructed uninitialized
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2014-10-21 17:42:04 +00:00
|
|
|
public:
|
2014-04-18 07:14:12 +00:00
|
|
|
~Peer() { Utils::burn(_key,sizeof(_key)); }
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
|
|
|
* Construct a new peer
|
|
|
|
*
|
2016-01-06 00:41:54 +00:00
|
|
|
* @param renv Runtime environment
|
2013-07-04 20:56:19 +00:00
|
|
|
* @param myIdentity Identity of THIS node (for key agreement)
|
|
|
|
* @param peerIdentity Identity of peer
|
|
|
|
* @throws std::runtime_error Key agreement with peer's identity failed
|
|
|
|
*/
|
2016-01-06 00:41:54 +00:00
|
|
|
Peer(const RuntimeEnvironment *renv,const Identity &myIdentity,const Identity &peerIdentity);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @return This peer's ZT address (short for identity().address())
|
|
|
|
*/
|
|
|
|
inline const Address &address() const throw() { return _id.address(); }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return This peer's identity
|
|
|
|
*/
|
|
|
|
inline const Identity &identity() const throw() { return _id; }
|
|
|
|
|
|
|
|
/**
|
2014-04-10 17:00:20 +00:00
|
|
|
* Log receipt of an authenticated packet
|
|
|
|
*
|
|
|
|
* This is called by the decode pipe when a packet is proven to be authentic
|
|
|
|
* and appears to be valid.
|
2015-07-13 17:03:04 +00:00
|
|
|
*
|
2016-09-02 18:51:33 +00:00
|
|
|
* @param path Path over which packet was received
|
2013-07-04 20:56:19 +00:00
|
|
|
* @param hops ZeroTier (not IP) hops
|
2013-12-24 18:39:29 +00:00
|
|
|
* @param packetId Packet ID
|
2013-07-04 20:56:19 +00:00
|
|
|
* @param verb Packet verb
|
2015-04-03 00:54:56 +00:00
|
|
|
* @param inRePacketId Packet ID in reply to (default: none)
|
|
|
|
* @param inReVerb Verb in reply to (for OK/ERROR, default: VERB_NOP)
|
2016-08-24 23:16:39 +00:00
|
|
|
* @param trustEstablished If true, some form of non-trivial trust (like allowed in network) has been established
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2014-10-21 17:42:04 +00:00
|
|
|
void received(
|
2016-09-02 18:51:33 +00:00
|
|
|
const SharedPtr<Path> &path,
|
2016-09-07 22:15:52 +00:00
|
|
|
const unsigned int hops,
|
|
|
|
const uint64_t packetId,
|
|
|
|
const Packet::Verb verb,
|
|
|
|
const uint64_t inRePacketId,
|
|
|
|
const Packet::Verb inReVerb,
|
2016-09-07 22:24:53 +00:00
|
|
|
const bool trustEstablished);
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2016-04-19 16:22:51 +00:00
|
|
|
/**
|
|
|
|
* @param now Current time
|
|
|
|
* @param addr Remote address
|
|
|
|
* @return True if we have an active path to this destination
|
|
|
|
*/
|
2016-09-02 18:51:33 +00:00
|
|
|
bool hasActivePathTo(uint64_t now,const InetAddress &addr) const;
|
2016-04-19 16:22:51 +00:00
|
|
|
|
|
|
|
/**
|
2016-09-03 22:39:05 +00:00
|
|
|
* Set which known path for an address family is optimal
|
|
|
|
*
|
2016-04-19 16:22:51 +00:00
|
|
|
* @param addr Address to make exclusive
|
|
|
|
*/
|
2016-09-06 19:45:28 +00:00
|
|
|
inline void setClusterOptimal(const InetAddress &addr)
|
|
|
|
{
|
|
|
|
if (addr.ss_family == AF_INET) {
|
|
|
|
_remoteClusterOptimal4 = (uint32_t)reinterpret_cast<const struct sockaddr_in *>(&addr)->sin_addr.s_addr;
|
|
|
|
} else if (addr.ss_family == AF_INET6) {
|
|
|
|
memcpy(_remoteClusterOptimal6,reinterpret_cast<const struct sockaddr_in6 *>(&addr)->sin6_addr.s6_addr,16);
|
|
|
|
}
|
|
|
|
}
|
2016-04-19 16:22:51 +00:00
|
|
|
|
2015-04-03 23:52:53 +00:00
|
|
|
/**
|
2016-09-02 20:33:56 +00:00
|
|
|
* Send via best direct path
|
2015-04-03 23:52:53 +00:00
|
|
|
*
|
|
|
|
* @param data Packet data
|
|
|
|
* @param len Packet length
|
|
|
|
* @param now Current time
|
2016-09-02 18:51:33 +00:00
|
|
|
* @param forceEvenIfDead If true, send even if the path is not 'alive'
|
|
|
|
* @return True if we actually sent something
|
2015-04-03 23:52:53 +00:00
|
|
|
*/
|
2016-09-02 20:33:56 +00:00
|
|
|
bool sendDirect(const void *data,unsigned int len,uint64_t now,bool forceEvenIfDead);
|
2016-09-02 18:51:33 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the best current direct path
|
|
|
|
*
|
|
|
|
* @param now Current time
|
2017-02-01 21:52:53 +00:00
|
|
|
* @param includeExpired If true, include even expired paths
|
2016-09-02 18:51:33 +00:00
|
|
|
* @return Best current path or NULL if none
|
|
|
|
*/
|
2016-09-07 18:13:17 +00:00
|
|
|
SharedPtr<Path> getBestPath(uint64_t now,bool includeExpired);
|
2015-04-03 23:52:53 +00:00
|
|
|
|
2015-04-07 19:22:33 +00:00
|
|
|
/**
|
|
|
|
* Send a HELLO to this peer at a specified physical address
|
|
|
|
*
|
2016-09-02 18:51:33 +00:00
|
|
|
* No statistics or sent times are updated here.
|
2015-04-07 19:22:33 +00:00
|
|
|
*
|
2015-09-24 23:21:36 +00:00
|
|
|
* @param localAddr Local address
|
2015-04-07 19:22:33 +00:00
|
|
|
* @param atAddress Destination address
|
|
|
|
* @param now Current time
|
|
|
|
*/
|
2016-09-02 18:51:33 +00:00
|
|
|
void sendHELLO(const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now);
|
2015-04-07 19:22:33 +00:00
|
|
|
|
2016-09-07 19:01:03 +00:00
|
|
|
/**
|
|
|
|
* Send ECHO (or HELLO for older peers) to this peer at the given address
|
|
|
|
*
|
|
|
|
* No statistics or sent times are updated here.
|
|
|
|
*
|
|
|
|
* @param localAddr Local address
|
|
|
|
* @param atAddress Destination address
|
|
|
|
* @param now Current time
|
2017-02-06 00:19:03 +00:00
|
|
|
* @param sendFullHello If true, always send a full HELLO instead of just an ECHO
|
2016-09-07 19:01:03 +00:00
|
|
|
*/
|
2017-02-06 00:19:03 +00:00
|
|
|
void attemptToContactAt(const InetAddress &localAddr,const InetAddress &atAddress,uint64_t now,bool sendFullHello);
|
2016-09-07 19:01:03 +00:00
|
|
|
|
2016-11-22 22:23:13 +00:00
|
|
|
/**
|
|
|
|
* Try a memorized or statically defined path if any are known
|
|
|
|
*
|
|
|
|
* Under the hood this is done periodically based on ZT_TRY_MEMORIZED_PATH_INTERVAL.
|
|
|
|
*/
|
|
|
|
void tryMemorizedPath(uint64_t now);
|
|
|
|
|
2015-04-07 19:32:05 +00:00
|
|
|
/**
|
2015-04-08 02:31:11 +00:00
|
|
|
* Send pings or keepalives depending on configured timeouts
|
2015-04-07 19:32:05 +00:00
|
|
|
*
|
|
|
|
* @param now Current time
|
2016-09-03 22:39:05 +00:00
|
|
|
* @param inetAddressFamily Keep this address family alive, or -1 for any
|
2016-09-05 22:47:22 +00:00
|
|
|
* @return True if we have at least one direct path of the given family (or any if family is -1)
|
2015-04-07 19:32:05 +00:00
|
|
|
*/
|
2016-01-06 00:41:54 +00:00
|
|
|
bool doPingAndKeepalive(uint64_t now,int inetAddressFamily);
|
2015-04-07 19:32:05 +00:00
|
|
|
|
2016-09-02 18:51:33 +00:00
|
|
|
/**
|
|
|
|
* @param now Current time
|
2016-09-07 18:13:17 +00:00
|
|
|
* @return True if this peer has at least one active and alive direct path
|
2016-09-02 18:51:33 +00:00
|
|
|
*/
|
|
|
|
bool hasActiveDirectPath(uint64_t now) const;
|
|
|
|
|
|
|
|
/**
|
2016-09-07 18:13:17 +00:00
|
|
|
* Reset paths within a given IP scope and address family
|
2016-09-02 18:51:33 +00:00
|
|
|
*
|
2016-09-21 04:21:34 +00:00
|
|
|
* Resetting a path involves sending an ECHO to it and then deactivating
|
|
|
|
* it until or unless it responds.
|
2016-09-07 18:13:17 +00:00
|
|
|
*
|
|
|
|
* @param scope IP scope
|
|
|
|
* @param inetAddressFamily Family e.g. AF_INET
|
2016-09-02 18:51:33 +00:00
|
|
|
* @param now Current time
|
|
|
|
*/
|
2016-09-21 04:21:34 +00:00
|
|
|
void resetWithinScope(InetAddress::IpScope scope,int inetAddressFamily,uint64_t now);
|
2016-09-02 18:51:33 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Get most recently active path addresses for IPv4 and/or IPv6
|
|
|
|
*
|
|
|
|
* Note that v4 and v6 are not modified if they are not found, so
|
|
|
|
* initialize these to a NULL address to be able to check.
|
|
|
|
*
|
|
|
|
* @param now Current time
|
|
|
|
* @param v4 Result parameter to receive active IPv4 address, if any
|
|
|
|
* @param v6 Result parameter to receive active IPv6 address, if any
|
|
|
|
*/
|
2017-02-04 07:54:02 +00:00
|
|
|
void getRendezvousAddresses(uint64_t now,InetAddress &v4,InetAddress &v6) const;
|
2016-09-02 18:51:33 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @param now Current time
|
2016-09-07 18:13:17 +00:00
|
|
|
* @return All known direct paths to this peer and whether they are expired (true == expired)
|
2016-09-02 18:51:33 +00:00
|
|
|
*/
|
2016-09-07 18:13:17 +00:00
|
|
|
inline std::vector< std::pair< SharedPtr<Path>,bool > > paths(const uint64_t now) const
|
2014-03-21 03:07:35 +00:00
|
|
|
{
|
2016-09-07 18:13:17 +00:00
|
|
|
std::vector< std::pair< SharedPtr<Path>,bool > > pp;
|
2016-09-02 18:51:33 +00:00
|
|
|
Mutex::Lock _l(_paths_m);
|
2014-10-21 17:42:04 +00:00
|
|
|
for(unsigned int p=0,np=_numPaths;p<np;++p)
|
2016-09-07 18:13:17 +00:00
|
|
|
pp.push_back(std::pair< SharedPtr<Path>,bool >(_paths[p].path,(now - _paths[p].lastReceive) > ZT_PEER_PATH_EXPIRATION));
|
2014-10-21 17:42:04 +00:00
|
|
|
return pp;
|
2014-03-21 03:07:35 +00:00
|
|
|
}
|
2013-10-02 20:12:10 +00:00
|
|
|
|
2014-06-30 18:31:04 +00:00
|
|
|
/**
|
|
|
|
* @return Time of last receive of anything, whether direct or relayed
|
|
|
|
*/
|
2016-09-21 04:21:34 +00:00
|
|
|
inline uint64_t lastReceive() const { return _lastReceive; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return True if we've heard from this peer in less than ZT_PEER_ACTIVITY_TIMEOUT
|
|
|
|
*/
|
|
|
|
inline bool isAlive(const uint64_t now) const { return ((now - _lastReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
|
2014-06-30 18:31:04 +00:00
|
|
|
|
|
|
|
/**
|
2015-12-22 00:15:39 +00:00
|
|
|
* @return True if this peer has sent us real network traffic recently
|
2014-06-30 18:31:04 +00:00
|
|
|
*/
|
2016-11-10 00:04:08 +00:00
|
|
|
inline uint64_t isActive(uint64_t now) const { return ((now - _lastNontrivialReceive) < ZT_PEER_ACTIVITY_TIMEOUT); }
|
2014-06-30 18:31:04 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
2015-11-03 00:03:28 +00:00
|
|
|
* @return Latency in milliseconds or 0 if unknown
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2015-11-03 00:03:28 +00:00
|
|
|
inline unsigned int latency() const { return _latency; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This computes a quality score for relays and root servers
|
|
|
|
*
|
|
|
|
* If we haven't heard anything from these in ZT_PEER_ACTIVITY_TIMEOUT, they
|
|
|
|
* receive the worst possible quality (max unsigned int). Otherwise the
|
|
|
|
* quality is a product of latency and the number of potential missed
|
|
|
|
* pings. This causes roots and relays to switch over a bit faster if they
|
|
|
|
* fail.
|
|
|
|
*
|
|
|
|
* @return Relay quality score computed from latency and other factors, lower is better
|
|
|
|
*/
|
|
|
|
inline unsigned int relayQuality(const uint64_t now) const
|
2013-12-31 19:03:45 +00:00
|
|
|
{
|
2015-11-03 00:03:28 +00:00
|
|
|
const uint64_t tsr = now - _lastReceive;
|
|
|
|
if (tsr >= ZT_PEER_ACTIVITY_TIMEOUT)
|
|
|
|
return (~(unsigned int)0);
|
2014-02-03 18:46:37 +00:00
|
|
|
unsigned int l = _latency;
|
2015-11-03 00:03:28 +00:00
|
|
|
if (!l)
|
|
|
|
l = 0xffff;
|
2016-09-02 18:51:33 +00:00
|
|
|
return (l * (((unsigned int)tsr / (ZT_PEER_PING_PERIOD + 1000)) + 1));
|
2014-02-03 18:46:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Update latency with a new direct measurment
|
|
|
|
*
|
|
|
|
* @param l Direct latency measurment in ms
|
|
|
|
*/
|
|
|
|
inline void addDirectLatencyMeasurment(unsigned int l)
|
|
|
|
{
|
|
|
|
unsigned int ol = _latency;
|
|
|
|
if ((ol > 0)&&(ol < 10000))
|
2014-04-09 23:00:25 +00:00
|
|
|
_latency = (ol + std::min(l,(unsigned int)65535)) / 2;
|
|
|
|
else _latency = std::min(l,(unsigned int)65535);
|
2013-12-31 19:03:45 +00:00
|
|
|
}
|
2013-07-11 22:15:51 +00:00
|
|
|
|
2015-11-09 22:25:28 +00:00
|
|
|
#ifdef ZT_ENABLE_CLUSTER
|
|
|
|
/**
|
|
|
|
* @param now Current time
|
|
|
|
* @return True if this peer has at least one active direct path that is not cluster-suboptimal
|
|
|
|
*/
|
2016-09-06 22:06:07 +00:00
|
|
|
inline bool hasLocalClusterOptimalPath(uint64_t now) const
|
2015-11-09 22:25:28 +00:00
|
|
|
{
|
|
|
|
for(unsigned int p=0,np=_numPaths;p<np;++p) {
|
2016-09-06 22:06:07 +00:00
|
|
|
if ( (_paths[p].path->alive(now)) && (!_paths[p].localClusterSuboptimal) )
|
2015-11-09 22:25:28 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
/**
|
2013-12-24 18:39:29 +00:00
|
|
|
* @return 256-bit secret symmetric encryption key
|
2013-07-04 20:56:19 +00:00
|
|
|
*/
|
2016-09-13 21:27:18 +00:00
|
|
|
inline const unsigned char *key() const { return _key; }
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-07-12 02:06:25 +00:00
|
|
|
/**
|
2014-02-03 18:46:37 +00:00
|
|
|
* Set the currently known remote version of this peer's client
|
2013-07-12 02:06:25 +00:00
|
|
|
*
|
2014-09-30 23:28:25 +00:00
|
|
|
* @param vproto Protocol version
|
2013-07-12 02:06:25 +00:00
|
|
|
* @param vmaj Major version
|
|
|
|
* @param vmin Minor version
|
|
|
|
* @param vrev Revision
|
|
|
|
*/
|
2014-09-30 23:28:25 +00:00
|
|
|
inline void setRemoteVersion(unsigned int vproto,unsigned int vmaj,unsigned int vmin,unsigned int vrev)
|
2013-07-12 02:06:25 +00:00
|
|
|
{
|
2014-09-30 23:28:25 +00:00
|
|
|
_vProto = (uint16_t)vproto;
|
|
|
|
_vMajor = (uint16_t)vmaj;
|
|
|
|
_vMinor = (uint16_t)vmin;
|
|
|
|
_vRevision = (uint16_t)vrev;
|
2013-07-12 02:06:25 +00:00
|
|
|
}
|
|
|
|
|
2016-09-13 21:27:18 +00:00
|
|
|
inline unsigned int remoteVersionProtocol() const { return _vProto; }
|
|
|
|
inline unsigned int remoteVersionMajor() const { return _vMajor; }
|
|
|
|
inline unsigned int remoteVersionMinor() const { return _vMinor; }
|
|
|
|
inline unsigned int remoteVersionRevision() const { return _vRevision; }
|
2015-12-22 00:15:39 +00:00
|
|
|
|
2016-09-13 21:27:18 +00:00
|
|
|
inline bool remoteVersionKnown() const { return ((_vMajor > 0)||(_vMinor > 0)||(_vRevision > 0)); }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return True if peer has received a trust established packet (e.g. common network membership) in the past ZT_TRUST_EXPIRATION ms
|
|
|
|
*/
|
|
|
|
inline bool trustEstablished(const uint64_t now) const { return ((now - _lastTrustEstablishedPacketReceived) < ZT_TRUST_EXPIRATION); }
|
2014-09-30 23:28:25 +00:00
|
|
|
|
2015-10-28 01:18:26 +00:00
|
|
|
/**
|
2016-09-13 17:13:23 +00:00
|
|
|
* Rate limit gate for VERB_PUSH_DIRECT_PATHS
|
2015-10-28 01:18:26 +00:00
|
|
|
*/
|
2016-09-09 18:36:10 +00:00
|
|
|
inline bool rateGatePushDirectPaths(const uint64_t now)
|
2015-10-28 01:18:26 +00:00
|
|
|
{
|
|
|
|
if ((now - _lastDirectPathPushReceive) <= ZT_PUSH_DIRECT_PATHS_CUTOFF_TIME)
|
|
|
|
++_directPathPushCutoffCount;
|
|
|
|
else _directPathPushCutoffCount = 0;
|
|
|
|
_lastDirectPathPushReceive = now;
|
2015-10-28 17:38:37 +00:00
|
|
|
return (_directPathPushCutoffCount < ZT_PUSH_DIRECT_PATHS_CUTOFF_LIMIT);
|
2015-10-28 01:18:26 +00:00
|
|
|
}
|
|
|
|
|
2016-09-13 17:13:23 +00:00
|
|
|
/**
|
|
|
|
* Rate limit gate for VERB_NETWORK_CREDENTIALS
|
|
|
|
*/
|
|
|
|
inline bool rateGateCredentialsReceived(const uint64_t now)
|
|
|
|
{
|
|
|
|
if ((now - _lastCredentialsReceived) <= ZT_PEER_CREDENTIALS_CUTOFF_TIME)
|
|
|
|
++_credentialsCutoffCount;
|
|
|
|
else _credentialsCutoffCount = 0;
|
|
|
|
_lastCredentialsReceived = now;
|
|
|
|
return (_directPathPushCutoffCount < ZT_PEER_CREDEITIALS_CUTOFF_LIMIT);
|
|
|
|
}
|
|
|
|
|
2016-09-09 18:36:10 +00:00
|
|
|
/**
|
|
|
|
* Rate limit gate for sending of ERROR_NEED_MEMBERSHIP_CERTIFICATE
|
|
|
|
*/
|
|
|
|
inline bool rateGateRequestCredentials(const uint64_t now)
|
|
|
|
{
|
|
|
|
if ((now - _lastCredentialRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
|
|
|
|
_lastCredentialRequestSent = now;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Rate limit gate for inbound WHOIS requests
|
|
|
|
*/
|
|
|
|
inline bool rateGateInboundWhoisRequest(const uint64_t now)
|
|
|
|
{
|
|
|
|
if ((now - _lastWhoisRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
|
|
|
|
_lastWhoisRequestReceived = now;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Rate limit gate for inbound ECHO requests
|
|
|
|
*/
|
|
|
|
inline bool rateGateEchoRequest(const uint64_t now)
|
|
|
|
{
|
|
|
|
if ((now - _lastEchoRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
|
|
|
|
_lastEchoRequestReceived = now;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2016-09-12 22:19:21 +00:00
|
|
|
/**
|
2016-09-27 20:49:43 +00:00
|
|
|
* Rate gate incoming requests for network COM
|
2016-09-12 22:19:21 +00:00
|
|
|
*/
|
2016-09-27 20:49:43 +00:00
|
|
|
inline bool rateGateIncomingComRequest(const uint64_t now)
|
2016-09-12 22:19:21 +00:00
|
|
|
{
|
|
|
|
if ((now - _lastComRequestReceived) >= ZT_PEER_GENERAL_RATE_LIMIT) {
|
|
|
|
_lastComRequestReceived = now;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2016-09-27 20:49:43 +00:00
|
|
|
/**
|
|
|
|
* Rate gate outgoing requests for network COM
|
|
|
|
*/
|
|
|
|
inline bool rateGateOutgoingComRequest(const uint64_t now)
|
|
|
|
{
|
|
|
|
if ((now - _lastComRequestSent) >= ZT_PEER_GENERAL_RATE_LIMIT) {
|
|
|
|
_lastComRequestSent = now;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-12-24 18:39:29 +00:00
|
|
|
private:
|
2016-09-07 18:13:17 +00:00
|
|
|
inline uint64_t _pathScore(const unsigned int p,const uint64_t now) const
|
2016-09-02 21:20:55 +00:00
|
|
|
{
|
2016-09-07 18:13:17 +00:00
|
|
|
uint64_t s = ZT_PEER_PING_PERIOD + _paths[p].lastReceive + (uint64_t)(_paths[p].path->preferenceRank() * (ZT_PEER_PING_PERIOD / ZT_PATH_MAX_PREFERENCE_RANK));
|
|
|
|
|
2016-09-06 19:45:28 +00:00
|
|
|
if (_paths[p].path->address().ss_family == AF_INET) {
|
2016-09-07 18:13:17 +00:00
|
|
|
s += (uint64_t)(ZT_PEER_PING_PERIOD * (unsigned long)(reinterpret_cast<const struct sockaddr_in *>(&(_paths[p].path->address()))->sin_addr.s_addr == _remoteClusterOptimal4));
|
2016-09-06 19:45:28 +00:00
|
|
|
} else if (_paths[p].path->address().ss_family == AF_INET6) {
|
|
|
|
uint64_t clusterWeight = ZT_PEER_PING_PERIOD;
|
|
|
|
const uint8_t *a = reinterpret_cast<const uint8_t *>(reinterpret_cast<const struct sockaddr_in6 *>(&(_paths[p].path->address()))->sin6_addr.s6_addr);
|
|
|
|
for(long i=0;i<16;++i) {
|
|
|
|
if (a[i] != _remoteClusterOptimal6[i]) {
|
|
|
|
clusterWeight = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2016-09-07 18:13:17 +00:00
|
|
|
s += clusterWeight;
|
2016-09-06 19:45:28 +00:00
|
|
|
}
|
2016-09-07 18:13:17 +00:00
|
|
|
|
|
|
|
s += (ZT_PEER_PING_PERIOD / 2) * (uint64_t)_paths[p].path->alive(now);
|
|
|
|
|
2016-09-06 19:45:28 +00:00
|
|
|
#ifdef ZT_ENABLE_CLUSTER
|
|
|
|
s -= ZT_PEER_PING_PERIOD * (uint64_t)_paths[p].localClusterSuboptimal;
|
|
|
|
#endif
|
2016-09-07 18:13:17 +00:00
|
|
|
|
2016-09-06 19:45:28 +00:00
|
|
|
return s;
|
2016-09-02 21:20:55 +00:00
|
|
|
}
|
|
|
|
|
2016-09-07 22:15:52 +00:00
|
|
|
uint8_t _key[ZT_PEER_SECRET_KEY_LENGTH];
|
2017-02-04 21:17:00 +00:00
|
|
|
|
|
|
|
const RuntimeEnvironment *RR;
|
|
|
|
|
2015-04-01 01:33:39 +00:00
|
|
|
uint64_t _lastReceive; // direct or indirect
|
2016-11-10 00:04:08 +00:00
|
|
|
uint64_t _lastNontrivialReceive; // frames, things like netconf, etc.
|
2016-11-22 22:23:13 +00:00
|
|
|
uint64_t _lastTriedMemorizedPath;
|
2015-10-16 17:28:09 +00:00
|
|
|
uint64_t _lastDirectPathPushSent;
|
2015-10-28 01:18:26 +00:00
|
|
|
uint64_t _lastDirectPathPushReceive;
|
2016-09-09 18:36:10 +00:00
|
|
|
uint64_t _lastCredentialRequestSent;
|
|
|
|
uint64_t _lastWhoisRequestReceived;
|
|
|
|
uint64_t _lastEchoRequestReceived;
|
2016-09-12 22:19:21 +00:00
|
|
|
uint64_t _lastComRequestReceived;
|
2016-09-27 20:49:43 +00:00
|
|
|
uint64_t _lastComRequestSent;
|
2016-09-13 17:13:23 +00:00
|
|
|
uint64_t _lastCredentialsReceived;
|
2016-09-13 21:27:18 +00:00
|
|
|
uint64_t _lastTrustEstablishedPacketReceived;
|
2017-02-04 21:17:00 +00:00
|
|
|
|
|
|
|
uint8_t _remoteClusterOptimal6[16];
|
2016-09-06 19:45:28 +00:00
|
|
|
uint32_t _remoteClusterOptimal4;
|
2017-02-04 21:17:00 +00:00
|
|
|
|
2015-04-01 01:33:39 +00:00
|
|
|
uint16_t _vProto;
|
|
|
|
uint16_t _vMajor;
|
|
|
|
uint16_t _vMinor;
|
|
|
|
uint16_t _vRevision;
|
2017-02-04 21:17:00 +00:00
|
|
|
|
2015-04-03 00:54:56 +00:00
|
|
|
Identity _id;
|
2017-02-04 21:17:00 +00:00
|
|
|
|
2016-09-02 18:51:33 +00:00
|
|
|
struct {
|
|
|
|
uint64_t lastReceive;
|
2016-09-03 22:39:05 +00:00
|
|
|
SharedPtr<Path> path;
|
2016-09-06 19:45:28 +00:00
|
|
|
#ifdef ZT_ENABLE_CLUSTER
|
|
|
|
bool localClusterSuboptimal;
|
|
|
|
#endif
|
2016-09-02 18:51:33 +00:00
|
|
|
} _paths[ZT_MAX_PEER_NETWORK_PATHS];
|
|
|
|
Mutex _paths_m;
|
2017-02-04 21:17:00 +00:00
|
|
|
|
2015-04-01 01:33:39 +00:00
|
|
|
unsigned int _numPaths;
|
|
|
|
unsigned int _latency;
|
2015-10-28 01:18:26 +00:00
|
|
|
unsigned int _directPathPushCutoffCount;
|
2016-09-13 17:13:23 +00:00
|
|
|
unsigned int _credentialsCutoffCount;
|
2015-04-03 20:14:37 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
AtomicCounter __refCount;
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|
|
|
|
|
2013-07-13 18:28:26 +00:00
|
|
|
// Add a swap() for shared ptr's to peers to speed up peer sorts
|
|
|
|
namespace std {
|
|
|
|
template<>
|
|
|
|
inline void swap(ZeroTier::SharedPtr<ZeroTier::Peer> &a,ZeroTier::SharedPtr<ZeroTier::Peer> &b)
|
|
|
|
{
|
|
|
|
a.swap(b);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
#endif
|