ot::BackboneRouter::NdProxyTable class

Implements NdProxy Table maintenance on Primary Backbone Router.

Syntax

Show:

Summary

Declaration

from ndproxy_table.hpp:59

class NdProxyTable : public InstanceLocator, private NonCopyable { public: static constexpr uint8_t kDuaDadRepeats = 3; class NdProxy : private Clearable<NdProxy> { friend class NdProxyTable; friend class Clearable<NdProxy >; public: typedef otBackboneRouterNdProxyCallback Callback; enum Event { kAdded = OT_BACKBONE_ROUTER_NDPROXY_ADDED, kRemoved = OT_BACKBONE_ROUTER_NDPROXY_REMOVED, kRenewed = OT_BACKBONE_ROUTER_NDPROXY_RENEWED, kCleared = OT_BACKBONE_ROUTER_NDPROXY_CLEARED, }; const Ip6::InterfaceIdentifier &GetMeshLocalIid(void) const { return mMeshLocalIid; } uint32_t GetTimeSinceLastTransaction(void) const { return TimeMilli::MsecToSec(TimerMilli::GetNow() - mLastRegistrationTime); } uint16_t GetRloc16(void) const { return mRloc16; } bool GetDadFlag(void) const { return mDadFlag; } private: static constexpr uint32_t kMaxTimeSinceLastTransaction = 10 * 86400; NdProxy(void) { Clear(); } void Init(const Ip6::InterfaceIdentifier &aAddressIid, const Ip6::InterfaceIdentifier &aMeshLocalIid, uint16_t aRloc16, uint32_t aTimeSinceLastTransaction); void Update(uint16_t aRloc16, uint32_t aTimeSinceLastTransaction); void IncreaseDadAttempts(void) { mDadAttempts++; } bool IsDadAttemptsComplete(void) const { return mDadAttempts == kDuaDadRepeats; } Ip6::InterfaceIdentifier mAddressIid; Ip6::InterfaceIdentifier mMeshLocalIid; TimeMilli mLastRegistrationTime; uint16_t mRloc16; uint8_t mDadAttempts : 2; bool mDadFlag : 1; bool mValid : 1; static_assert(kDuaDadRepeats < 4, "kDuaDadRepeats does not fit in mDadAttempts field as 2-bit value"); }; explicit NdProxyTable(Instance &aInstance) : InstanceLocator(aInstance) , mIsAnyDadInProcess(false) { } Error Register(const Ip6::InterfaceIdentifier &aAddressIid, const Ip6::InterfaceIdentifier &aMeshLocalIid, uint16_t aRloc16, const uint32_t *aTimeSinceLastTransaction); bool IsRegistered(const Ip6::InterfaceIdentifier &aAddressIid) { return FindByAddressIid(aAddressIid) != nullptr; } void HandleDomainPrefixUpdate(DomainPrefixEvent aEvent); void HandleTimer(void); NdProxy *ResolveDua(const Ip6::Address &aDua); static void NotifyDadComplete(NdProxy &aNdProxy, bool aDuplicated); static void Erase(NdProxy &aNdProxy); void SetCallback(NdProxy::Callback aCallback, void *aContext) { mCallback.Set(aCallback, aContext); } Error GetInfo(const Ip6::Address &aDua, otBackboneRouterNdProxyInfo &aNdProxyInfo); private: static constexpr uint16_t kMaxNdProxyNum = OPENTHREAD_CONFIG_NDPROXY_TABLE_ENTRY_NUM; enum Filter : uint8_t { kFilterInvalid, kFilterValid, kFilterDadInProcess, }; class Iterator : public InstanceLocator, public ItemPtrIterator<NdProxy, Iterator> { friend class ItemPtrIterator<NdProxy, Iterator >; friend class NdProxyTable; friend class IteratorBuilder; private: enum IteratorType : uint8_t { kEndIterator, }; Iterator(Instance &aInstance, Filter aFilter); Iterator(Instance &aInstance, IteratorType); void Advance(void); Filter mFilter; }; class IteratorBuilder : public InstanceLocator { friend class NdProxyTable; private: IteratorBuilder(Instance &aInstance, Filter aFilter) : InstanceLocator(aInstance) , mFilter(aFilter) { } Iterator begin(void) { return Iterator(GetInstance(), mFilter); } Iterator end(void) { return Iterator(GetInstance(), Iterator::kEndIterator); } Filter mFilter; }; IteratorBuilder Iterate(Filter aFilter) { return IteratorBuilder(GetInstance(), aFilter); } void Clear(void); static bool MatchesFilter(const NdProxy &aProxy, Filter aFilter); NdProxy *FindByAddressIid(const Ip6::InterfaceIdentifier &aAddressIid); NdProxy *FindByMeshLocalIid(const Ip6::InterfaceIdentifier &aMeshLocalIid); NdProxy *FindInvalid(void); Ip6::Address GetDua(NdProxy &aNdProxy); void NotifyDuaRegistrationOnBackboneLink(NdProxy &aNdProxy, bool aIsRenew); void TriggerCallback(NdProxy::Event aEvent, const Ip6::InterfaceIdentifier &aAddressIid) const; NdProxy mProxies[kMaxNdProxyNum]; Callback<NdProxy::Callback> mCallback; bool mIsAnyDadInProcess : 1; };