ot::Child::mIp6Addresses field

ot::Child::Ip6AddrEntry::GetMlrState() const

index = aChild.mIp6Addresses.IndexOf(*this);

child.cpp:88

ot::Child::Ip6AddrEntry::GetMlrState() const

OT_ASSERT(aChild.mIp6Addresses.IsInArrayBuffer(this));

child.cpp:107

ot::Child::Ip6AddrEntry::SetMlrState()

index = aChild.mIp6Addresses.IndexOf(*this);

child.cpp:109

ot::Child::Ip6AddrEntry::SetMlrState()

mIp6Addresses.Clear();

child.cpp:131

ot::Child::ClearIp6Addresses()

VerifyOrExit(aIterator - 1 < mIp6Addresses.GetLength(), error = kErrorNotFound);

child.cpp:178

ot::Child::GetNextIp6Address() const

VerifyOrExit(!mIp6Addresses.ContainsMatching(aAddress), error = kErrorAlready);

child.cpp:200

ot::Child::AddIp6Address()

error = mIp6Addresses.PushBack(static_cast<const Ip6AddrEntry &>(aAddress));

child.cpp:201

ot::Child::AddIp6Address()

entry = mIp6Addresses.FindMatching(aAddress);

child.cpp:223

uint16_t entryIndex = mIp6Addresses.IndexOf(*entry);

child.cpp:232

uint16_t lastIndex = mIp6Addresses.GetLength() - 1;

child.cpp:233

mIp6Addresses.Remove(*entry);

child.cpp:243

hasAddress = mIp6Addresses.ContainsMatching(aAddress);

child.cpp:262

ot::Child::HasIp6Address() const

entry = mIp6Addresses.FindMatching(aAddress);

child.cpp:295

ot::Child::HasMlrRegisteredAddress() const

const Ip6AddressArray &GetIp6Addresses(void) const { return mIp6Addresses; }

child.hpp:184

ot::Child::GetIp6Addresses() const

Ip6AddressArray &GetIp6Addresses(void) { return mIp6Addresses; }

child.hpp:193

ot::Child::GetIp6Addresses()

Call Tree

ot::Child::mIp6Addresses is called by 8 functions:

ot::Child::Ip6AddrEntry::GetMlrState() const

ot::Child::Ip6AddrEntry::SetMlrState()

ot::Child::ClearIp6Addresses()

ot::Child::GetNextIp6Address() const

ot::Child::AddIp6Address()