2015-07-06 21:08:13 +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/
|
2015-07-06 21:08:13 +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/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef ZT_PATH_HPP
|
|
|
|
#define ZT_PATH_HPP
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include <stdexcept>
|
|
|
|
#include <algorithm>
|
|
|
|
|
2015-07-06 21:08:13 +00:00
|
|
|
#include "Constants.hpp"
|
|
|
|
#include "InetAddress.hpp"
|
|
|
|
|
2015-11-09 22:25:28 +00:00
|
|
|
/**
|
|
|
|
* Flag indicating that this path is suboptimal
|
|
|
|
*
|
|
|
|
* This is used in cluster mode to indicate that the peer has been directed
|
|
|
|
* to a better path. This path can continue to be used but shouldn't be kept
|
|
|
|
* or advertised to other cluster members. Not used if clustering is not
|
|
|
|
* built and enabled.
|
|
|
|
*/
|
|
|
|
#define ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL 0x0001
|
|
|
|
|
2015-12-22 00:15:39 +00:00
|
|
|
/**
|
|
|
|
* Maximum return value of preferenceRank()
|
|
|
|
*/
|
|
|
|
#define ZT_PATH_MAX_PREFERENCE_RANK ((ZT_INETADDRESS_MAX_SCOPE << 1) | 1)
|
|
|
|
|
2015-07-06 21:08:13 +00:00
|
|
|
namespace ZeroTier {
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
class RuntimeEnvironment;
|
|
|
|
|
2015-07-13 17:03:04 +00:00
|
|
|
/**
|
|
|
|
* Base class for paths
|
|
|
|
*
|
|
|
|
* The base Path class is an immutable value.
|
|
|
|
*/
|
2015-07-06 21:08:13 +00:00
|
|
|
class Path
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
Path() :
|
2015-10-27 22:00:16 +00:00
|
|
|
_lastSend(0),
|
2016-01-06 18:00:03 +00:00
|
|
|
_lastPing(0),
|
|
|
|
_lastKeepalive(0),
|
2015-10-27 22:00:16 +00:00
|
|
|
_lastReceived(0),
|
2015-07-06 21:08:13 +00:00
|
|
|
_addr(),
|
2015-10-27 22:00:16 +00:00
|
|
|
_localAddress(),
|
2015-11-09 22:25:28 +00:00
|
|
|
_flags(0),
|
2015-10-29 16:44:25 +00:00
|
|
|
_ipScope(InetAddress::IP_SCOPE_NONE)
|
2015-07-06 21:08:13 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2015-10-29 16:42:15 +00:00
|
|
|
Path(const InetAddress &localAddress,const InetAddress &addr) :
|
2015-10-27 22:00:16 +00:00
|
|
|
_lastSend(0),
|
2016-01-06 18:00:03 +00:00
|
|
|
_lastPing(0),
|
|
|
|
_lastKeepalive(0),
|
2015-10-27 22:00:16 +00:00
|
|
|
_lastReceived(0),
|
2015-07-06 21:08:13 +00:00
|
|
|
_addr(addr),
|
2015-10-27 22:00:16 +00:00
|
|
|
_localAddress(localAddress),
|
2015-11-09 22:25:28 +00:00
|
|
|
_flags(0),
|
2015-10-29 16:44:25 +00:00
|
|
|
_ipScope(addr.ipScope())
|
2015-10-27 22:00:16 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2015-10-28 00:36:47 +00:00
|
|
|
inline Path &operator=(const Path &p)
|
|
|
|
{
|
|
|
|
if (this != &p)
|
|
|
|
memcpy(this,&p,sizeof(Path));
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
/**
|
|
|
|
* Called when a packet is sent to this remote path
|
|
|
|
*
|
|
|
|
* This is called automatically by Path::send().
|
|
|
|
*
|
|
|
|
* @param t Time of send
|
|
|
|
*/
|
2016-01-06 18:00:03 +00:00
|
|
|
inline void sent(uint64_t t) { _lastSend = t; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Called when we've sent a ping or echo
|
|
|
|
*
|
|
|
|
* @param t Time of send
|
|
|
|
*/
|
|
|
|
inline void pinged(uint64_t t) { _lastPing = t; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Called when we send a NAT keepalive
|
|
|
|
*
|
|
|
|
* @param t Time of send
|
|
|
|
*/
|
|
|
|
inline void sentKeepalive(uint64_t t) { _lastKeepalive = t; }
|
2015-07-06 21:08:13 +00:00
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
/**
|
|
|
|
* Called when a packet is received from this remote path
|
|
|
|
*
|
|
|
|
* @param t Time of receive
|
|
|
|
*/
|
2016-01-06 00:41:54 +00:00
|
|
|
inline void received(uint64_t t)
|
|
|
|
{
|
|
|
|
_lastReceived = t;
|
|
|
|
_probation = 0;
|
|
|
|
}
|
2015-10-27 22:00:16 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @param now Current time
|
|
|
|
* @return True if this path appears active
|
|
|
|
*/
|
|
|
|
inline bool active(uint64_t now) const
|
|
|
|
throw()
|
|
|
|
{
|
2016-01-06 00:41:54 +00:00
|
|
|
return (((now - _lastReceived) < ZT_PEER_ACTIVITY_TIMEOUT)&&(_probation < ZT_PEER_DEAD_PATH_DETECTION_MAX_PROBATION));
|
2015-10-27 22:00:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Send a packet via this path
|
|
|
|
*
|
|
|
|
* @param RR Runtime environment
|
|
|
|
* @param data Packet data
|
|
|
|
* @param len Packet length
|
|
|
|
* @param now Current time
|
|
|
|
* @return True if transport reported success
|
|
|
|
*/
|
|
|
|
bool send(const RuntimeEnvironment *RR,const void *data,unsigned int len,uint64_t now);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return Address of local side of this path or NULL if unspecified
|
|
|
|
*/
|
|
|
|
inline const InetAddress &localAddress() const throw() { return _localAddress; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return Time of last send to this path
|
|
|
|
*/
|
|
|
|
inline uint64_t lastSend() const throw() { return _lastSend; }
|
|
|
|
|
2016-01-06 18:00:03 +00:00
|
|
|
/**
|
|
|
|
* @return Time we last pinged or dead path checked this link
|
|
|
|
*/
|
|
|
|
inline uint64_t lastPing() const throw() { return _lastPing; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return Time of last keepalive
|
|
|
|
*/
|
|
|
|
inline uint64_t lastKeepalive() const throw() { return _lastKeepalive; }
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
/**
|
|
|
|
* @return Time of last receive from this path
|
|
|
|
*/
|
|
|
|
inline uint64_t lastReceived() const throw() { return _lastReceived; }
|
|
|
|
|
2015-07-06 21:08:13 +00:00
|
|
|
/**
|
|
|
|
* @return Physical address
|
|
|
|
*/
|
|
|
|
inline const InetAddress &address() const throw() { return _addr; }
|
|
|
|
|
|
|
|
/**
|
2015-07-13 17:03:04 +00:00
|
|
|
* @return IP scope -- faster shortcut for address().ipScope()
|
|
|
|
*/
|
|
|
|
inline InetAddress::IpScope ipScope() const throw() { return _ipScope; }
|
|
|
|
|
|
|
|
/**
|
2015-12-22 00:15:39 +00:00
|
|
|
* @return Preference rank, higher == better (will be less than 255)
|
2015-07-06 21:08:13 +00:00
|
|
|
*/
|
2015-12-22 00:15:39 +00:00
|
|
|
inline unsigned int preferenceRank() const throw()
|
2015-09-23 23:16:36 +00:00
|
|
|
{
|
|
|
|
// First, since the scope enum values in InetAddress.hpp are in order of
|
|
|
|
// use preference rank, we take that. Then we multiple by two, yielding
|
|
|
|
// a sequence like 0, 2, 4, 6, etc. Then if it's IPv6 we add one. This
|
|
|
|
// makes IPv6 addresses of a given scope outrank IPv4 addresses of the
|
|
|
|
// same scope -- e.g. 1 outranks 0. This makes us prefer IPv6, but not
|
|
|
|
// if the address scope/class is of a fundamentally lower rank.
|
2015-12-22 00:15:39 +00:00
|
|
|
return ( ((unsigned int)_ipScope << 1) | (unsigned int)(_addr.ss_family == AF_INET6) );
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return This path's overall score (higher == better)
|
|
|
|
*/
|
|
|
|
inline uint64_t score() const throw()
|
|
|
|
{
|
|
|
|
/* We compute the score based on the "freshness" of the path (when we last
|
|
|
|
* received something) scaled/corrected by the preference rank within the
|
|
|
|
* ping keepalive window. That way higher ranking paths are preferred but
|
|
|
|
* not to the point of overriding timeouts and choosing potentially dead
|
|
|
|
* paths. */
|
|
|
|
return (_lastReceived + (preferenceRank() * (ZT_PEER_DIRECT_PING_DELAY / ZT_PATH_MAX_PREFERENCE_RANK)));
|
2015-09-23 23:16:36 +00:00
|
|
|
}
|
2015-07-06 21:08:13 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @return True if path is considered reliable (no NAT keepalives etc. are needed)
|
|
|
|
*/
|
2015-07-13 17:03:04 +00:00
|
|
|
inline bool reliable() const throw()
|
|
|
|
{
|
2015-10-19 22:11:43 +00:00
|
|
|
if (_addr.ss_family == AF_INET)
|
|
|
|
return ((_ipScope != InetAddress::IP_SCOPE_GLOBAL)&&(_ipScope != InetAddress::IP_SCOPE_PSEUDOPRIVATE));
|
|
|
|
return true;
|
2015-07-13 17:03:04 +00:00
|
|
|
}
|
2015-07-06 21:08:13 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @return True if address is non-NULL
|
|
|
|
*/
|
|
|
|
inline operator bool() const throw() { return (_addr); }
|
|
|
|
|
2015-07-07 15:54:48 +00:00
|
|
|
/**
|
|
|
|
* Check whether this address is valid for a ZeroTier path
|
|
|
|
*
|
|
|
|
* This checks the address type and scope against address types and scopes
|
|
|
|
* that we currently support for ZeroTier communication.
|
|
|
|
*
|
|
|
|
* @param a Address to check
|
|
|
|
* @return True if address is good for ZeroTier path use
|
|
|
|
*/
|
|
|
|
static inline bool isAddressValidForPath(const InetAddress &a)
|
|
|
|
throw()
|
|
|
|
{
|
|
|
|
if ((a.ss_family == AF_INET)||(a.ss_family == AF_INET6)) {
|
|
|
|
switch(a.ipScope()) {
|
|
|
|
/* Note: we don't do link-local at the moment. Unfortunately these
|
|
|
|
* cause several issues. The first is that they usually require a
|
|
|
|
* device qualifier, which we don't handle yet and can't portably
|
|
|
|
* push in PUSH_DIRECT_PATHS. The second is that some OSes assign
|
|
|
|
* these very ephemerally or otherwise strangely. So we'll use
|
|
|
|
* private, pseudo-private, shared (e.g. carrier grade NAT), or
|
|
|
|
* global IP addresses. */
|
|
|
|
case InetAddress::IP_SCOPE_PRIVATE:
|
|
|
|
case InetAddress::IP_SCOPE_PSEUDOPRIVATE:
|
|
|
|
case InetAddress::IP_SCOPE_SHARED:
|
|
|
|
case InetAddress::IP_SCOPE_GLOBAL:
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-11-09 22:25:28 +00:00
|
|
|
#ifdef ZT_ENABLE_CLUSTER
|
|
|
|
/**
|
|
|
|
* @param f New value of ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL
|
|
|
|
*/
|
|
|
|
inline void setClusterSuboptimal(bool f) { _flags = ((f) ? (_flags | ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL) : (_flags & (~ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL))); }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @return True if ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL is set
|
|
|
|
*/
|
|
|
|
inline bool isClusterSuboptimal() const { return ((_flags & ZT_PATH_FLAG_CLUSTER_SUBOPTIMAL) != 0); }
|
|
|
|
#endif
|
|
|
|
|
2016-01-06 00:41:54 +00:00
|
|
|
/**
|
|
|
|
* @return Current path probation count (for dead path detect)
|
|
|
|
*/
|
|
|
|
inline unsigned int probation() const { return _probation; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Increase this path's probation violation count (for dead path detect)
|
|
|
|
*/
|
|
|
|
inline void increaseProbation() { ++_probation; }
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
template<unsigned int C>
|
|
|
|
inline void serialize(Buffer<C> &b) const
|
|
|
|
{
|
2016-01-06 18:00:03 +00:00
|
|
|
b.append((uint8_t)2); // version
|
2015-10-27 22:00:16 +00:00
|
|
|
b.append((uint64_t)_lastSend);
|
2016-01-06 18:00:03 +00:00
|
|
|
b.append((uint64_t)_lastPing);
|
|
|
|
b.append((uint64_t)_lastKeepalive);
|
2015-10-27 22:00:16 +00:00
|
|
|
b.append((uint64_t)_lastReceived);
|
|
|
|
_addr.serialize(b);
|
|
|
|
_localAddress.serialize(b);
|
2015-11-09 22:25:28 +00:00
|
|
|
b.append((uint16_t)_flags);
|
2016-01-06 00:41:54 +00:00
|
|
|
b.append((uint16_t)_probation);
|
2015-10-27 22:00:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<unsigned int C>
|
|
|
|
inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
|
|
|
|
{
|
|
|
|
unsigned int p = startAt;
|
2016-01-06 18:00:03 +00:00
|
|
|
if (b[p++] != 2)
|
2015-10-27 22:00:16 +00:00
|
|
|
throw std::invalid_argument("invalid serialized Path");
|
|
|
|
_lastSend = b.template at<uint64_t>(p); p += 8;
|
2016-01-06 18:00:03 +00:00
|
|
|
_lastPing = b.template at<uint64_t>(p); p += 8;
|
|
|
|
_lastKeepalive = b.template at<uint64_t>(p); p += 8;
|
2015-10-27 22:00:16 +00:00
|
|
|
_lastReceived = b.template at<uint64_t>(p); p += 8;
|
|
|
|
p += _addr.deserialize(b,p);
|
|
|
|
p += _localAddress.deserialize(b,p);
|
2015-11-09 22:25:28 +00:00
|
|
|
_flags = b.template at<uint16_t>(p); p += 2;
|
2016-01-06 00:41:54 +00:00
|
|
|
_probation = b.template at<uint16_t>(p); p += 2;
|
2015-10-27 22:00:16 +00:00
|
|
|
_ipScope = _addr.ipScope();
|
|
|
|
return (p - startAt);
|
|
|
|
}
|
|
|
|
|
2015-12-22 00:15:39 +00:00
|
|
|
inline bool operator==(const Path &p) const { return ((p._addr == _addr)&&(p._localAddress == _localAddress)); }
|
|
|
|
inline bool operator!=(const Path &p) const { return ((p._addr != _addr)||(p._localAddress != _localAddress)); }
|
|
|
|
|
2015-10-27 22:00:16 +00:00
|
|
|
private:
|
|
|
|
uint64_t _lastSend;
|
2016-01-06 18:00:03 +00:00
|
|
|
uint64_t _lastPing;
|
|
|
|
uint64_t _lastKeepalive;
|
2015-10-27 22:00:16 +00:00
|
|
|
uint64_t _lastReceived;
|
2015-07-06 21:08:13 +00:00
|
|
|
InetAddress _addr;
|
2015-10-27 22:00:16 +00:00
|
|
|
InetAddress _localAddress;
|
2015-11-09 22:25:28 +00:00
|
|
|
unsigned int _flags;
|
2016-01-06 00:41:54 +00:00
|
|
|
unsigned int _probation;
|
2015-07-13 17:03:04 +00:00
|
|
|
InetAddress::IpScope _ipScope; // memoize this since it's a computed value checked often
|
2015-07-06 21:08:13 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|
|
|
|
|
|
|
|
#endif
|