ZeroTierOne/node/Multicaster.hpp

237 lines
6.5 KiB
C++
Raw Normal View History

/*
2019-08-23 16:23:39 +00:00
* Copyright (c)2019 ZeroTier, Inc.
*
2019-08-23 16:23:39 +00:00
* Use of this software is governed by the Business Source License included
* in the LICENSE.TXT file in the project's root directory.
*
2019-08-23 16:23:39 +00:00
* Change Date: 2023-01-01
*
2019-08-23 16:23:39 +00:00
* On the date above, in accordance with the Business Source License, use
* of this software will be governed by version 2.0 of the Apache License.
*/
2019-08-23 16:23:39 +00:00
/****/
#ifndef ZT_MULTICASTER_HPP
#define ZT_MULTICASTER_HPP
#include <stdint.h>
#include <string.h>
#include <map>
#include <vector>
#include "Constants.hpp"
#include "Hashtable.hpp"
#include "Address.hpp"
2014-09-24 20:45:58 +00:00
#include "MAC.hpp"
#include "MulticastGroup.hpp"
#include "Utils.hpp"
#include "Mutex.hpp"
2018-01-27 01:38:44 +00:00
#include "SharedPtr.hpp"
2019-09-09 22:49:17 +00:00
#include "Packet.hpp"
2019-09-10 23:20:28 +00:00
// Size in bits -- do not change as this is about as large as we can support
// This leaves room for up to 10000 MTU data (max supported MTU) and header
// information in a maximum supported size packet. Note that data compression
// will practically reduce this size in transit for sparse or saturated fields.
#define ZT_MULTICAST_BLOOM_FILTER_SIZE_BITS 50048
namespace ZeroTier {
2014-09-25 22:08:29 +00:00
class RuntimeEnvironment;
class CertificateOfMembership;
class Packet;
2018-01-27 01:38:44 +00:00
class Network;
/**
* Multicast database and outbound multicast logic
*/
2018-01-27 01:00:37 +00:00
class Multicaster
{
2019-09-10 23:20:28 +00:00
private:
// Composite key of network ID and multicast group
struct _K
{
uint64_t nwid;
MulticastGroup mg;
ZT_ALWAYS_INLINE _K() : nwid(0),mg() {}
ZT_ALWAYS_INLINE _K(const uint64_t n,const MulticastGroup &g) : nwid(n),mg(g) {}
ZT_ALWAYS_INLINE bool operator==(const _K &k) const { return ((nwid == k.nwid)&&(mg == k.mg)); }
ZT_ALWAYS_INLINE bool operator!=(const _K &k) const { return ((nwid != k.nwid)||(mg != k.mg)); }
ZT_ALWAYS_INLINE unsigned long hashCode() const { return (mg.hashCode() ^ (unsigned long)(nwid ^ (nwid >> 32))); }
};
// Multicast group info
struct _G
{
ZT_ALWAYS_INLINE _G() : lastGather(0),members(16) {}
int64_t lastGather;
Hashtable< Address,int64_t > members;
};
// Outbound multicast
struct _OM
{
uint64_t nwid;
MAC src;
MulticastGroup mg;
unsigned int etherType;
unsigned int dataSize;
unsigned int count;
unsigned int limit;
unsigned int bloomFilterMultiplier;
uint64_t bloomFilter[ZT_MULTICAST_BLOOM_FILTER_SIZE_BITS / 64];
uint8_t data[ZT_MAX_MTU];
Mutex lock;
};
public:
Multicaster(const RuntimeEnvironment *renv);
~Multicaster();
/**
* Add or update a member in a multicast group
*
2014-09-25 22:57:43 +00:00
* @param now Current time
* @param nwid Network ID
* @param mg Multicast group
2014-09-24 20:45:58 +00:00
* @param member New member address
*/
2019-09-09 22:49:17 +00:00
ZT_ALWAYS_INLINE void add(const int64_t now,const uint64_t nwid,const MulticastGroup &mg,const Address &member)
{
Mutex::Lock l(_groups_l);
2019-09-10 23:20:28 +00:00
_groups[_K(nwid,mg)].members.set(member,now);
}
/**
* Add multiple addresses from a binary array of 5-byte address fields
*
* It's up to the caller to check bounds on the array before calling this.
*
* @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
* @param now Current time
* @param nwid Network ID
* @param mg Multicast group
* @param addresses Raw binary addresses in big-endian format, as a series of 5-byte fields
* @param count Number of addresses
* @param totalKnown Total number of known addresses as reported by peer
*/
2019-09-09 22:49:17 +00:00
ZT_ALWAYS_INLINE void addMultiple(const int64_t now,const uint64_t nwid,const MulticastGroup &mg,const void *addresses,unsigned int count,const unsigned int totalKnown)
{
Mutex::Lock l(_groups_l);
const uint8_t *a = (const uint8_t *)addresses;
2019-09-10 23:20:28 +00:00
_G &g = _groups[_K(nwid,mg)];
while (count--) {
2019-09-10 23:20:28 +00:00
g.members.set(Address(a,ZT_ADDRESS_LENGTH),now);
a += ZT_ADDRESS_LENGTH;
}
}
2015-07-07 18:49:38 +00:00
/**
* Remove a multicast group member (if present)
*
* @param nwid Network ID
* @param mg Multicast group
* @param member Member to unsubscribe
*/
2019-09-09 22:49:17 +00:00
ZT_ALWAYS_INLINE void remove(const uint64_t nwid,const MulticastGroup &mg,const Address &member)
{
Mutex::Lock l(_groups_l);
2019-09-09 22:49:17 +00:00
const _K gk(nwid,mg);
2019-09-10 23:20:28 +00:00
_G *const g = _groups.get(gk);
if (g) {
g->members.erase(member);
if (g->members.empty())
_groups.erase(gk);
}
}
2015-07-07 18:49:38 +00:00
/**
* Iterate over members of a multicast group until function returns false
*
* Iteration order is in inverse order of most recent receipt of a LIKE
* for a given membership.
*
* @param nwid Network ID
* @param mg Multicast group
* @param func f(Address)
* @return Total number of known members (regardless of when function aborted)
*/
template<typename F>
2019-09-09 22:49:17 +00:00
ZT_ALWAYS_INLINE unsigned long eachMember(const uint64_t nwid,const MulticastGroup &mg,F func) const
{
std::vector< std::pair<int64_t,Address> > sortedByTime;
2019-09-10 23:20:28 +00:00
{
Mutex::Lock l(_groups_l);
const _K gk(nwid,mg);
const _G *const g = _groups.get(gk);
if (g) {
sortedByTime.reserve(g->members.size());
{
Hashtable< Address,int64_t >::Iterator mi(const_cast<_G *>(g)->members);
Address *mik = nullptr;
int64_t *miv = nullptr;
while (mi.next(mik,miv))
sortedByTime.push_back(std::pair<int64_t,Address>(*miv,*mik));
}
}
}
2019-09-09 22:49:17 +00:00
std::sort(sortedByTime.begin(),sortedByTime.end());
2019-09-11 22:52:18 +00:00
for(std::vector< std::pair<int64_t,Address> >::const_reverse_iterator i(sortedByTime.rbegin());i!=sortedByTime.rend();++i) {
if (!func(i->second))
break;
}
return sortedByTime.size();
}
2014-09-24 20:45:58 +00:00
/**
* Send a multicast
*
* @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
2014-09-24 20:45:58 +00:00
* @param now Current time
2018-01-27 01:38:44 +00:00
* @param network Network
2014-09-24 20:45:58 +00:00
* @param mg Multicast group
2014-10-11 22:49:31 +00:00
* @param src Source Ethernet MAC address or NULL to skip in packet and compute from ZT address (non-bridged mode)
2014-09-24 20:45:58 +00:00
* @param etherType Ethernet frame type
2019-09-09 22:49:17 +00:00
* @param existingBloomMultiplier Existing bloom filter multiplier or 0 if none
* @param existingBloom Existing bloom filter or NULL if none
2014-09-24 20:45:58 +00:00
* @param data Packet data
* @param len Length of packet data
2019-09-10 23:20:28 +00:00
* @return Number of known recipients for multicast (including bridges and replicators)
2014-09-24 20:45:58 +00:00
*/
2019-09-10 23:20:28 +00:00
unsigned int send(
void *tPtr,
int64_t now,
2018-01-27 01:38:44 +00:00
const SharedPtr<Network> &network,
const MulticastGroup &mg,
const MAC &src,
unsigned int etherType,
2019-09-09 22:49:17 +00:00
const unsigned int existingBloomMultiplier,
const uint8_t existingBloom[ZT_MULTICAST_BLOOM_FILTER_SIZE_BITS / 8],
const void *const data,
unsigned int len);
/**
* Clean up database
*
2014-09-25 22:08:29 +00:00
* @param RR Runtime environment
2014-09-22 20:18:24 +00:00
* @param now Current time
*/
void clean(int64_t now);
private:
2018-01-27 01:00:37 +00:00
const RuntimeEnvironment *const RR;
2019-09-09 22:49:17 +00:00
_OM _txQueue[ZT_TX_QUEUE_SIZE];
unsigned int _txQueuePtr;
Mutex _txQueue_l;
2019-09-10 23:20:28 +00:00
Hashtable< _K,_G > _groups;
Mutex _groups_l;
};
} // namespace ZeroTier
#endif