/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* vim: set ts=8 sts=2 et sw=2 tw=80: */ /* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ #ifndef nsInterfaceHashtable_h__ #define nsInterfaceHashtable_h__ #include "nsBaseHashtable.h" #include "nsHashKeys.h" #include "nsCOMPtr.h" /** * templated hashtable class maps keys to interface pointers. * See nsBaseHashtable for complete declaration. * @param KeyClass a wrapper-class for the hashtable key, see nsHashKeys.h * for a complete specification. * @param Interface the interface-type being wrapped * @see nsDataHashtable, nsClassHashtable */ template class nsInterfaceHashtable : public nsBaseHashtable, Interface*> { public: typedef typename KeyClass::KeyType KeyType; typedef Interface* UserDataType; typedef nsBaseHashtable, Interface*> base_type; nsInterfaceHashtable() {} explicit nsInterfaceHashtable(uint32_t aInitLength) : nsBaseHashtable, Interface*>(aInitLength) { } /** * @copydoc nsBaseHashtable::Get * @param aData This is an XPCOM getter, so aData is already_addrefed. * If the key doesn't exist, aData will be set to nullptr. */ bool Get(KeyType aKey, UserDataType* aData) const; /** * @copydoc nsBaseHashtable::Get */ already_AddRefed Get(KeyType aKey) const; /** * Gets a weak reference to the hashtable entry. * @param aFound If not nullptr, will be set to true if the entry is found, * to false otherwise. * @return The entry, or nullptr if not found. Do not release this pointer! */ Interface* GetWeak(KeyType aKey, bool* aFound = nullptr) const; /** * Remove the entry associated with aKey (if any), optionally _moving_ its * current value into *aData, thereby avoiding calls to AddRef and Release. * Return true if found. * @param aKey the key to remove from the hashtable * @param aData where to move the value (if non-null). If an entry is not * found it will be set to nullptr. * @return true if an entry for aKey was found (and removed) */ inline bool Remove(KeyType aKey, Interface** aData = nullptr); }; template inline void ImplCycleCollectionUnlink(nsInterfaceHashtable& aField) { aField.Clear(); } template inline void ImplCycleCollectionTraverse(nsCycleCollectionTraversalCallback& aCallback, const nsInterfaceHashtable& aField, const char* aName, uint32_t aFlags = 0) { for (auto iter = aField.ConstIter(); !iter.Done(); iter.Next()) { CycleCollectionNoteChild(aCallback, iter.UserData(), aName, aFlags); } } // // nsInterfaceHashtable definitions // template bool nsInterfaceHashtable::Get(KeyType aKey, UserDataType* aInterface) const { typename base_type::EntryType* ent = this->GetEntry(aKey); if (ent) { if (aInterface) { *aInterface = ent->mData; NS_IF_ADDREF(*aInterface); } return true; } // if the key doesn't exist, set *aInterface to null // so that it is a valid XPCOM getter if (aInterface) { *aInterface = nullptr; } return false; } template already_AddRefed nsInterfaceHashtable::Get(KeyType aKey) const { typename base_type::EntryType* ent = this->GetEntry(aKey); if (!ent) { return nullptr; } nsCOMPtr copy = ent->mData; return copy.forget(); } template Interface* nsInterfaceHashtable::GetWeak(KeyType aKey, bool* aFound) const { typename base_type::EntryType* ent = this->GetEntry(aKey); if (ent) { if (aFound) { *aFound = true; } return ent->mData; } // Key does not exist, return nullptr and set aFound to false if (aFound) { *aFound = false; } return nullptr; } template bool nsInterfaceHashtable::Remove(KeyType aKey, Interface** aData) { typename base_type::EntryType* ent = this->GetEntry(aKey); if (ent) { if (aData) { ent->mData.forget(aData); } this->RemoveEntry(ent); return true; } if (aData) { *aData = nullptr; } return false; } #endif // nsInterfaceHashtable_h__