|
@@ -16,7 +16,6 @@
|
|
|
#include "Trace.hpp"
|
|
|
#include "Peer.hpp"
|
|
|
#include "Topology.hpp"
|
|
|
-#include "Node.hpp"
|
|
|
#include "SelfAwareness.hpp"
|
|
|
#include "InetAddress.hpp"
|
|
|
#include "Protocol.hpp"
|
|
@@ -38,7 +37,6 @@ Peer::Peer(const RuntimeEnvironment *renv) :
|
|
|
m_alivePathCount(0),
|
|
|
m_tryQueue(),
|
|
|
m_tryQueuePtr(m_tryQueue.end()),
|
|
|
- m_probe(0),
|
|
|
m_vProto(0),
|
|
|
m_vMajor(0),
|
|
|
m_vMinor(0),
|
|
@@ -144,50 +142,64 @@ void Peer::received(
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-void Peer::send(void *const tPtr,const int64_t now,const void *const data,const unsigned int len) noexcept
|
|
|
-{
|
|
|
- SharedPtr<Path> via(this->path(now));
|
|
|
- if (via) {
|
|
|
- via->send(RR,tPtr,data,len,now);
|
|
|
- } else {
|
|
|
- const SharedPtr<Peer> root(RR->topology->root());
|
|
|
- if ((root)&&(root.ptr() != this)) {
|
|
|
- via = root->path(now);
|
|
|
- if (via) {
|
|
|
- via->send(RR,tPtr,data,len,now);
|
|
|
- root->relayed(now,len);
|
|
|
- } else {
|
|
|
- return;
|
|
|
- }
|
|
|
- } else {
|
|
|
- return;
|
|
|
- }
|
|
|
- }
|
|
|
- sent(now,len);
|
|
|
-}
|
|
|
-
|
|
|
unsigned int Peer::hello(void *tPtr,int64_t localSocket,const InetAddress &atAddress,int64_t now)
|
|
|
{
|
|
|
-#if 0
|
|
|
- Packet outp(_id.address(),RR->identity.address(),Packet::VERB_HELLO);
|
|
|
-
|
|
|
- outp.append((unsigned char)ZT_PROTO_VERSION);
|
|
|
- outp.append((unsigned char)ZEROTIER_VERSION_MAJOR);
|
|
|
- outp.append((unsigned char)ZEROTIER_VERSION_MINOR);
|
|
|
- outp.append((uint16_t)ZEROTIER_VERSION_REVISION);
|
|
|
- outp.append(now);
|
|
|
- RR->identity.serialize(outp,false);
|
|
|
- atAddress.serialize(outp);
|
|
|
-
|
|
|
- RR->node->expectReplyTo(outp.packetId());
|
|
|
-
|
|
|
- if (atAddress) {
|
|
|
- outp.armor(_key,false); // false == don't encrypt full payload, but add MAC
|
|
|
- RR->node->putPacket(tPtr,localSocket,atAddress,outp.data(),outp.size());
|
|
|
- } else {
|
|
|
- RR->sw->send(tPtr,outp,false); // false == don't encrypt full payload, but add MAC
|
|
|
- }
|
|
|
-#endif
|
|
|
+ Buf outp;
|
|
|
+
|
|
|
+ const int64_t now = RR->node->now();
|
|
|
+ const uint64_t packetId = m_identityKey->nextMessage(RR->identity.address(),m_id.address());
|
|
|
+ int ii = Protocol::newPacket(outp,packetId,m_id.address(),RR->identity.address(),Protocol::VERB_HELLO);
|
|
|
+
|
|
|
+ outp.wI8(ii,ZT_PROTO_VERSION);
|
|
|
+ outp.wI8(ii,ZEROTIER_VERSION_MAJOR);
|
|
|
+ outp.wI8(ii,ZEROTIER_VERSION_MINOR);
|
|
|
+ outp.wI16(ii,ZEROTIER_VERSION_REVISION);
|
|
|
+ outp.wI64(ii,(uint64_t)now);
|
|
|
+ outp.wO(ii,RR->identity);
|
|
|
+ outp.wO(ii,atAddress);
|
|
|
+
|
|
|
+ const int ivStart = ii;
|
|
|
+ outp.wR(ii,12);
|
|
|
+
|
|
|
+ // LEGACY: the six reserved bytes after the IV exist for legacy compatibility with v1.x nodes.
|
|
|
+ // Once those are dead they'll become just reserved bytes for future use as flags etc.
|
|
|
+ outp.wI32(ii,0); // reserved bytes
|
|
|
+ void *const legacyMoonCountStart = outp.unsafeData + ii;
|
|
|
+ outp.wI16(ii,0);
|
|
|
+ const uint64_t legacySalsaIv = packetId & ZT_CONST_TO_BE_UINT64(0xfffffffffffffff8ULL);
|
|
|
+ Salsa20(m_identityKey->secret,&legacySalsaIv).crypt12(legacyMoonCountStart,legacyMoonCountStart,2);
|
|
|
+
|
|
|
+ const int cryptSectionStart = ii;
|
|
|
+ FCV<uint8_t,4096> md;
|
|
|
+ Dictionary::append(md,ZT_PROTO_HELLO_NODE_META_INSTANCE_ID,RR->instanceId);
|
|
|
+ outp.wI16(ii,(uint16_t)md.size());
|
|
|
+ outp.wB(ii,md.data(),(unsigned int)md.size());
|
|
|
+
|
|
|
+ if (unlikely((ii + ZT_HMACSHA384_LEN) > ZT_BUF_SIZE)) // sanity check: should be impossible
|
|
|
+ return 0;
|
|
|
+
|
|
|
+ AES::CTR ctr(m_helloCipher);
|
|
|
+ void *const cryptSection = outp.unsafeData + ii;
|
|
|
+ ctr.init(outp.unsafeData + ivStart,0,cryptSection);
|
|
|
+ ctr.crypt(cryptSection,ii - cryptSectionStart);
|
|
|
+ ctr.finish();
|
|
|
+
|
|
|
+ HMACSHA384(m_helloMacKey,outp.unsafeData,ii,outp.unsafeData + ii);
|
|
|
+ ii += ZT_HMACSHA384_LEN;
|
|
|
+
|
|
|
+ // LEGACY: we also need Poly1305 for v1.x peers.
|
|
|
+ uint8_t polyKey[ZT_POLY1305_KEY_SIZE],perPacketKey[ZT_SALSA20_KEY_SIZE];
|
|
|
+ Protocol::salsa2012DeriveKey(m_identityKey->secret,perPacketKey,outp,ii);
|
|
|
+ Salsa20(perPacketKey,&packetId).crypt12(Utils::ZERO256,polyKey,sizeof(polyKey));
|
|
|
+ Poly1305 p1305(polyKey);
|
|
|
+ p1305.update(outp.unsafeData + ZT_PROTO_PACKET_ENCRYPTED_SECTION_START,ii - ZT_PROTO_PACKET_ENCRYPTED_SECTION_START);
|
|
|
+ uint64_t polyMac[2];
|
|
|
+ p1305.finish(polyMac);
|
|
|
+ Utils::storeAsIsEndian<uint64_t>(outp.unsafeData + ZT_PROTO_PACKET_MAC_INDEX,polyMac[0]);
|
|
|
+
|
|
|
+ if (likely(RR->node->putPacket(tPtr,localSocket,atAddress,outp.unsafeData,ii)))
|
|
|
+ return ii;
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
@@ -197,7 +209,7 @@ void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
|
// Determine if we need to send a full HELLO because we are refreshing ephemeral
|
|
|
// keys or it's simply been too long.
|
|
|
bool needHello = false;
|
|
|
- if ( ((now - m_ephemeralPairTimestamp) >= (ZT_SYMMETRIC_KEY_TTL / 2)) || ((m_ephemeralKeys[0])&&(m_ephemeralKeys[0]->odometer() >= (ZT_SYMMETRIC_KEY_TTL_MESSAGES / 2))) ) {
|
|
|
+ if ( (m_vProto >= 11) && ( ((now - m_ephemeralPairTimestamp) >= (ZT_SYMMETRIC_KEY_TTL / 2)) || ((m_ephemeralKeys[0])&&(m_ephemeralKeys[0]->odometer() >= (ZT_SYMMETRIC_KEY_TTL_MESSAGES / 2))) ) ) {
|
|
|
m_ephemeralPair.generate();
|
|
|
needHello = true;
|
|
|
} else if ((now - m_lastSentHello) >= ZT_PEER_HELLO_INTERVAL) {
|
|
@@ -212,7 +224,7 @@ void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
|
if (RR->node->externalPathLookup(tPtr, m_id, -1, addr)) {
|
|
|
if ((addr)&&(RR->node->shouldUsePathForZeroTierTraffic(tPtr, m_id, -1, addr))) {
|
|
|
RR->t->tryingNewPath(tPtr, 0x84a10000, m_id, addr, InetAddress::NIL, 0, 0, Identity::NIL);
|
|
|
- sent(now,m_sendProbe(tPtr,-1,addr,now));
|
|
|
+ sent(now,m_sendProbe(tPtr,-1,addr,nullptr,0,now));
|
|
|
}
|
|
|
}
|
|
|
|
|
@@ -224,7 +236,7 @@ void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
|
} else {
|
|
|
if ((i->second.isInetAddr())&&(!i->second.ip().ipsEqual(addr))) {
|
|
|
RR->t->tryingNewPath(tPtr, 0x0a009444, m_id, i->second.ip(), InetAddress::NIL, 0, 0, Identity::NIL);
|
|
|
- sent(now,m_sendProbe(tPtr,-1,i->second.ip(),now));
|
|
|
+ sent(now,m_sendProbe(tPtr,-1,i->second.ip(),nullptr,0,now));
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
@@ -232,66 +244,61 @@ void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
+ // Sort paths and forget expired ones.
|
|
|
m_prioritizePaths(now);
|
|
|
|
|
|
- // Attempt queued paths to try.
|
|
|
- for(int k=0;(k<ZT_NAT_T_MAX_QUEUED_ATTEMPTS_PER_PULSE)&&(!m_tryQueue.empty());++k) {
|
|
|
- // This is a global circular pointer that iterates through the list of
|
|
|
- // endpoints to attempt.
|
|
|
- if (m_tryQueuePtr == m_tryQueue.end())
|
|
|
- m_tryQueuePtr = m_tryQueue.begin();
|
|
|
-
|
|
|
- // Delete timed out entries.
|
|
|
- if ((now - m_tryQueuePtr->ts) > ZT_PATH_ALIVE_TIMEOUT) {
|
|
|
- m_tryQueue.erase(m_tryQueuePtr++);
|
|
|
- continue;
|
|
|
- }
|
|
|
-
|
|
|
- if (m_tryQueuePtr->target.isInetAddr()) {
|
|
|
- // Delete entries that duplicate existing alive paths.
|
|
|
- bool duplicate = false;
|
|
|
- for(unsigned int i=0;i<m_alivePathCount;++i) {
|
|
|
- if (m_paths[i]->address() == m_tryQueuePtr->target.ip()) {
|
|
|
- duplicate = true;
|
|
|
+ // Attempt queued endpoints if they don't overlap with paths.
|
|
|
+ if (!m_tryQueue.empty()) {
|
|
|
+ for(int k=0;k<ZT_NAT_T_MAX_QUEUED_ATTEMPTS_PER_PULSE;++k) {
|
|
|
+ // This is a global circular pointer that iterates through the list of
|
|
|
+ // endpoints to attempt.
|
|
|
+ if (m_tryQueuePtr == m_tryQueue.end()) {
|
|
|
+ if (m_tryQueue.empty())
|
|
|
break;
|
|
|
- }
|
|
|
- }
|
|
|
- if (duplicate) {
|
|
|
- m_tryQueue.erase(m_tryQueuePtr++);
|
|
|
- continue;
|
|
|
+ m_tryQueuePtr = m_tryQueue.begin();
|
|
|
}
|
|
|
|
|
|
- if (m_tryQueuePtr->breakSymmetricBFG1024 && RR->node->natMustDie()) {
|
|
|
- // Attempt aggressive NAT traversal if both requested and enabled.
|
|
|
- uint16_t ports[1023];
|
|
|
- for (unsigned int i=0;i<1023;++i)
|
|
|
- ports[i] = (uint64_t)(i + 1);
|
|
|
- for (unsigned int i=0;i<512;++i) {
|
|
|
- const uint64_t rn = Utils::random();
|
|
|
- const unsigned int a = (unsigned int)rn % 1023;
|
|
|
- const unsigned int b = (unsigned int)(rn >> 32U) % 1023;
|
|
|
- if (a != b) {
|
|
|
- uint16_t tmp = ports[a];
|
|
|
- ports[a] = ports[b];
|
|
|
- ports[b] = tmp;
|
|
|
+ if (likely((now - m_tryQueuePtr->ts) < ZT_PATH_ALIVE_TIMEOUT)) {
|
|
|
+ if (m_tryQueuePtr->target.isInetAddr()) {
|
|
|
+ for(unsigned int i=0;i<m_alivePathCount;++i) {
|
|
|
+ if (m_paths[i]->address().ipsEqual(m_tryQueuePtr->target.ip()))
|
|
|
+ goto skip_tryQueue_item;
|
|
|
+ }
|
|
|
+
|
|
|
+ if ((m_alivePathCount == 0) && (m_tryQueuePtr->breakSymmetricBFG1024) && (RR->node->natMustDie())) {
|
|
|
+ // Attempt aggressive NAT traversal if both requested and enabled. This sends a probe
|
|
|
+ // to all ports under 1024, which assumes that the peer has bound to such a port and
|
|
|
+ // has attempted to initiate a connection through it. This can traverse a decent number
|
|
|
+ // of symmetric NATs at the cost of 32KiB per attempt and the potential to trigger IDS
|
|
|
+ // systems by looking like a port scan (because it is).
|
|
|
+ uint16_t ports[1023];
|
|
|
+ for (unsigned int i=0;i<1023;++i)
|
|
|
+ ports[i] = (uint64_t)(i + 1);
|
|
|
+ for (unsigned int i=0;i<512;++i) {
|
|
|
+ const uint64_t rn = Utils::random();
|
|
|
+ const unsigned int a = (unsigned int)rn % 1023;
|
|
|
+ const unsigned int b = (unsigned int)(rn >> 32U) % 1023;
|
|
|
+ if (a != b) {
|
|
|
+ const uint16_t tmp = ports[a];
|
|
|
+ ports[a] = ports[b];
|
|
|
+ ports[b] = tmp;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ sent(now,m_sendProbe(tPtr, -1, m_tryQueuePtr->target.ip(), ports, 1023, now));
|
|
|
+ } else {
|
|
|
+ sent(now,m_sendProbe(tPtr, -1, m_tryQueuePtr->target.ip(), nullptr, 0, now));
|
|
|
}
|
|
|
}
|
|
|
- InetAddress addr(m_tryQueuePtr->target.ip());
|
|
|
- for (unsigned int i=0;i<ZT_NAT_T_BFG1024_PORTS_PER_ATTEMPT;++i) {
|
|
|
- addr.setPort(ports[i]);
|
|
|
- sent(now,m_sendProbe(tPtr,-1,addr,now));
|
|
|
- }
|
|
|
- } else {
|
|
|
- // Otherwise send a normal probe.
|
|
|
- sent(now,m_sendProbe(tPtr, -1, m_tryQueuePtr->target.ip(), now));
|
|
|
}
|
|
|
- }
|
|
|
|
|
|
- ++m_tryQueuePtr;
|
|
|
+skip_tryQueue_item:
|
|
|
+ m_tryQueue.erase(m_tryQueuePtr++);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
// Do keepalive on all currently active paths, sending HELLO to the first
|
|
|
// if needHello is true and sending small keepalives to others.
|
|
|
+ uint64_t randomJunk = Utils::random();
|
|
|
for(unsigned int i=0;i<m_alivePathCount;++i) {
|
|
|
if (needHello) {
|
|
|
needHello = false;
|
|
@@ -300,13 +307,12 @@ void Peer::pulse(void *const tPtr,const int64_t now,const bool isRoot)
|
|
|
sent(now,bytes);
|
|
|
m_lastSentHello = now;
|
|
|
} else if ((now - m_paths[i]->lastOut()) >= ZT_PATH_KEEPALIVE_PERIOD) {
|
|
|
- m_paths[i]->send(RR, tPtr, &now, 1, now);
|
|
|
+ m_paths[i]->send(RR, tPtr, reinterpret_cast<uint8_t *>(&randomJunk) + (i & 7U), 1, now);
|
|
|
sent(now,1);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- // If we need a HELLO and were not able to send one via any other path,
|
|
|
- // send one indirectly.
|
|
|
+ // Send a HELLO indirectly if we were not able to send one via any direct path.
|
|
|
if (needHello) {
|
|
|
const SharedPtr<Peer> root(RR->topology->root());
|
|
|
if (root) {
|
|
@@ -335,21 +341,25 @@ void Peer::contact(void *tPtr,const int64_t now,const Endpoint &ep,const bool br
|
|
|
++foo;
|
|
|
}
|
|
|
|
|
|
- // Check to see if this endpoint overlaps an existing queue item. If so, just update it.
|
|
|
- for(List<p_TryQueueItem>::iterator i(m_tryQueue.begin());i!=m_tryQueue.end();++i) {
|
|
|
- if (i->target == ep) {
|
|
|
- i->ts = now;
|
|
|
- i->breakSymmetricBFG1024 = breakSymmetricBFG1024;
|
|
|
- return;
|
|
|
+ const bool wasEmpty = m_tryQueue.empty();
|
|
|
+ if (!wasEmpty) {
|
|
|
+ for(List<p_TryQueueItem>::iterator i(m_tryQueue.begin());i!=m_tryQueue.end();++i) {
|
|
|
+ if (i->target == ep) {
|
|
|
+ i->ts = now;
|
|
|
+ i->breakSymmetricBFG1024 = breakSymmetricBFG1024;
|
|
|
+ return;
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- // Add endpoint to endpoint attempt queue.
|
|
|
#ifdef __CPP11__
|
|
|
m_tryQueue.emplace_back(now, ep, breakSymmetricBFG1024);
|
|
|
#else
|
|
|
_tryQueue.push_back(_TryQueueItem(now,ep,breakSymmetricBFG1024));
|
|
|
#endif
|
|
|
+
|
|
|
+ if (wasEmpty)
|
|
|
+ m_tryQueuePtr = m_tryQueue.begin();
|
|
|
}
|
|
|
|
|
|
void Peer::resetWithinScope(void *tPtr,InetAddress::IpScope scope,int inetAddressFamily,int64_t now)
|
|
@@ -358,7 +368,7 @@ void Peer::resetWithinScope(void *tPtr,InetAddress::IpScope scope,int inetAddres
|
|
|
unsigned int pc = 0;
|
|
|
for(unsigned int i=0;i<m_alivePathCount;++i) {
|
|
|
if ((m_paths[i]) && ((m_paths[i]->address().family() == inetAddressFamily) && (m_paths[i]->address().ipScope() == scope))) {
|
|
|
- const unsigned int bytes = m_sendProbe(tPtr, m_paths[i]->localSocket(), m_paths[i]->address(), now);
|
|
|
+ const unsigned int bytes = m_sendProbe(tPtr, m_paths[i]->localSocket(), m_paths[i]->address(), nullptr, 0, now);
|
|
|
m_paths[i]->sent(now, bytes);
|
|
|
sent(now,bytes);
|
|
|
} else if (pc != i) {
|
|
@@ -517,8 +527,6 @@ int Peer::unmarshal(const uint8_t *restrict data,const int len) noexcept
|
|
|
m_bootstrap[tmp.type()] = tmp;
|
|
|
}
|
|
|
|
|
|
- m_probe = 0; // ephemeral token, reset on unmarshal
|
|
|
-
|
|
|
if ((p + 10) > len)
|
|
|
return -1;
|
|
|
m_vProto = Utils::loadBigEndian<uint16_t>(data + p); p += 2;
|
|
@@ -562,30 +570,34 @@ void Peer::m_prioritizePaths(int64_t now)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-unsigned int Peer::m_sendProbe(void *tPtr,int64_t localSocket,const InetAddress &atAddress,int64_t now)
|
|
|
+unsigned int Peer::m_sendProbe(void *tPtr,int64_t localSocket,const InetAddress &atAddress,const uint16_t *ports,const unsigned int numPorts,int64_t now)
|
|
|
{
|
|
|
// Assumes m_lock is locked
|
|
|
- if ((m_vProto < 11)||(m_probe == 0)) {
|
|
|
- const SharedPtr<SymmetricKey> k(m_key());
|
|
|
- const uint64_t packetId = k->nextMessage(RR->identity.address(),m_id.address());
|
|
|
-
|
|
|
- uint8_t p[ZT_PROTO_MIN_PACKET_LENGTH + 1];
|
|
|
- Utils::storeAsIsEndian<uint64_t>(p + ZT_PROTO_PACKET_ID_INDEX,packetId);
|
|
|
- m_id.address().copyTo(p + ZT_PROTO_PACKET_DESTINATION_INDEX);
|
|
|
- RR->identity.address().copyTo(p + ZT_PROTO_PACKET_SOURCE_INDEX);
|
|
|
- p[ZT_PROTO_PACKET_FLAGS_INDEX] = 0;
|
|
|
- p[ZT_PROTO_PACKET_VERB_INDEX] = Protocol::VERB_ECHO;
|
|
|
- p[ZT_PROTO_PACKET_VERB_INDEX + 1] = (uint8_t)now; // arbitrary byte
|
|
|
-
|
|
|
- Protocol::armor(p,ZT_PROTO_MIN_PACKET_LENGTH,k,cipher());
|
|
|
-
|
|
|
- RR->expect->sending(packetId,now);
|
|
|
- RR->node->putPacket(tPtr,-1,atAddress,p,ZT_PROTO_MIN_PACKET_LENGTH);
|
|
|
-
|
|
|
- return ZT_PROTO_MIN_PACKET_LENGTH;
|
|
|
+ const SharedPtr<SymmetricKey> k(m_key());
|
|
|
+ const uint64_t packetId = k->nextMessage(RR->identity.address(),m_id.address());
|
|
|
+
|
|
|
+ uint8_t p[ZT_PROTO_MIN_PACKET_LENGTH + 1];
|
|
|
+ Utils::storeAsIsEndian<uint64_t>(p + ZT_PROTO_PACKET_ID_INDEX,packetId);
|
|
|
+ m_id.address().copyTo(p + ZT_PROTO_PACKET_DESTINATION_INDEX);
|
|
|
+ RR->identity.address().copyTo(p + ZT_PROTO_PACKET_SOURCE_INDEX);
|
|
|
+ p[ZT_PROTO_PACKET_FLAGS_INDEX] = 0;
|
|
|
+ p[ZT_PROTO_PACKET_VERB_INDEX] = Protocol::VERB_ECHO;
|
|
|
+ p[ZT_PROTO_PACKET_VERB_INDEX + 1] = 0; // arbitrary payload
|
|
|
+
|
|
|
+ Protocol::armor(p,ZT_PROTO_MIN_PACKET_LENGTH + 1,k,cipher());
|
|
|
+
|
|
|
+ RR->expect->sending(packetId,now);
|
|
|
+
|
|
|
+ if (numPorts > 0) {
|
|
|
+ InetAddress tmp(atAddress);
|
|
|
+ for(unsigned int i=0;i<numPorts;++i) {
|
|
|
+ tmp.setPort(ports[i]);
|
|
|
+ RR->node->putPacket(tPtr,-1,tmp,p,ZT_PROTO_MIN_PACKET_LENGTH + 1);
|
|
|
+ }
|
|
|
+ return ZT_PROTO_MIN_PACKET_LENGTH * numPorts;
|
|
|
} else {
|
|
|
- RR->node->putPacket(tPtr,-1,atAddress,&m_probe,4);
|
|
|
- return 4;
|
|
|
+ RR->node->putPacket(tPtr,-1,atAddress,p,ZT_PROTO_MIN_PACKET_LENGTH + 1);
|
|
|
+ return ZT_PROTO_MIN_PACKET_LENGTH;
|
|
|
}
|
|
|
}
|
|
|
|