зеркало из https://github.com/mozilla/gecko-dev.git
659 строки
15 KiB
C++
659 строки
15 KiB
C++
/* -*- 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/. */
|
|
|
|
#include "nsTHashtable.h"
|
|
#include "nsBaseHashtable.h"
|
|
#include "nsDataHashtable.h"
|
|
#include "nsInterfaceHashtable.h"
|
|
#include "nsClassHashtable.h"
|
|
|
|
#include "nsCOMPtr.h"
|
|
#include "nsISupports.h"
|
|
#include "nsCOMArray.h"
|
|
#include "mozilla/Attributes.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
namespace TestHashtables {
|
|
|
|
class TestUniChar // for nsClassHashtable
|
|
{
|
|
public:
|
|
explicit TestUniChar(uint32_t aWord)
|
|
{
|
|
printf(" TestUniChar::TestUniChar() %u\n", aWord);
|
|
mWord = aWord;
|
|
}
|
|
|
|
~TestUniChar()
|
|
{
|
|
printf(" TestUniChar::~TestUniChar() %u\n", mWord);
|
|
}
|
|
|
|
uint32_t GetChar() const { return mWord; }
|
|
|
|
private:
|
|
uint32_t mWord;
|
|
};
|
|
|
|
struct EntityNode {
|
|
const char* mStr; // never owns buffer
|
|
uint32_t mUnicode;
|
|
};
|
|
|
|
EntityNode gEntities[] = {
|
|
{"nbsp",160},
|
|
{"iexcl",161},
|
|
{"cent",162},
|
|
{"pound",163},
|
|
{"curren",164},
|
|
{"yen",165},
|
|
{"brvbar",166},
|
|
{"sect",167},
|
|
{"uml",168},
|
|
{"copy",169},
|
|
{"ordf",170},
|
|
{"laquo",171},
|
|
{"not",172},
|
|
{"shy",173},
|
|
{"reg",174},
|
|
{"macr",175}
|
|
};
|
|
|
|
#define ENTITY_COUNT (unsigned(sizeof(gEntities)/sizeof(EntityNode)))
|
|
|
|
class EntityToUnicodeEntry : public PLDHashEntryHdr
|
|
{
|
|
public:
|
|
typedef const char* KeyType;
|
|
typedef const char* KeyTypePointer;
|
|
|
|
explicit EntityToUnicodeEntry(const char* aKey) { mNode = nullptr; }
|
|
EntityToUnicodeEntry(const EntityToUnicodeEntry& aEntry) { mNode = aEntry.mNode; }
|
|
~EntityToUnicodeEntry() { }
|
|
|
|
bool KeyEquals(const char* aEntity) const { return !strcmp(mNode->mStr, aEntity); }
|
|
static const char* KeyToPointer(const char* aEntity) { return aEntity; }
|
|
static PLDHashNumber HashKey(const char* aEntity) { return mozilla::HashString(aEntity); }
|
|
enum { ALLOW_MEMMOVE = true };
|
|
|
|
const EntityNode* mNode;
|
|
};
|
|
|
|
static uint32_t
|
|
nsTIterPrint(nsTHashtable<EntityToUnicodeEntry>& hash)
|
|
{
|
|
uint32_t n = 0;
|
|
for (auto iter = hash.Iter(); !iter.Done(); iter.Next()) {
|
|
EntityToUnicodeEntry* entry = iter.Get();
|
|
printf(" enumerated \"%s\" = %u\n",
|
|
entry->mNode->mStr, entry->mNode->mUnicode);
|
|
n++;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
static uint32_t
|
|
nsTIterPrintRemove(nsTHashtable<EntityToUnicodeEntry>& hash)
|
|
{
|
|
uint32_t n = 0;
|
|
for (auto iter = hash.Iter(); !iter.Done(); iter.Next()) {
|
|
EntityToUnicodeEntry* entry = iter.Get();
|
|
printf(" enumerated \"%s\" = %u\n",
|
|
entry->mNode->mStr, entry->mNode->mUnicode);
|
|
iter.Remove();
|
|
n++;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
void
|
|
testTHashtable(nsTHashtable<EntityToUnicodeEntry>& hash, uint32_t numEntries) {
|
|
printf("Filling hash with %d entries.\n", numEntries);
|
|
|
|
uint32_t i;
|
|
for (i = 0; i < numEntries; ++i) {
|
|
printf(" Putting entry \"%s\"...", gEntities[i].mStr);
|
|
EntityToUnicodeEntry* entry =
|
|
hash.PutEntry(gEntities[i].mStr);
|
|
|
|
if (!entry) {
|
|
printf("FAILED\n");
|
|
exit (2);
|
|
}
|
|
printf("OK...");
|
|
|
|
if (entry->mNode) {
|
|
printf("entry already exists!\n");
|
|
exit (3);
|
|
}
|
|
printf("\n");
|
|
|
|
entry->mNode = &gEntities[i];
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
|
|
for (i = 0; i < numEntries; ++i) {
|
|
printf(" Getting entry \"%s\"...", gEntities[i].mStr);
|
|
EntityToUnicodeEntry* entry =
|
|
hash.GetEntry(gEntities[i].mStr);
|
|
|
|
if (!entry) {
|
|
printf("FAILED\n");
|
|
exit (4);
|
|
}
|
|
|
|
printf("Found %u\n", entry->mNode->mUnicode);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
|
|
EntityToUnicodeEntry* entry =
|
|
hash.GetEntry("xxxy");
|
|
|
|
if (entry) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (5);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
uint32_t count = nsTIterPrint(hash);
|
|
if (count != numEntries) {
|
|
printf(" Bad count!\n");
|
|
exit (6);
|
|
}
|
|
}
|
|
|
|
//
|
|
// all this nsIFoo stuff was copied wholesale from TestCOMPtr.cpp
|
|
//
|
|
|
|
#define NS_IFOO_IID \
|
|
{ 0x6f7652e0, 0xee43, 0x11d1, \
|
|
{ 0x9c, 0xc3, 0x00, 0x60, 0x08, 0x8c, 0xa6, 0xb3 } }
|
|
|
|
class IFoo final : public nsISupports
|
|
{
|
|
public:
|
|
NS_DECLARE_STATIC_IID_ACCESSOR(NS_IFOO_IID)
|
|
|
|
IFoo();
|
|
|
|
NS_IMETHOD_(MozExternalRefCountType) AddRef();
|
|
NS_IMETHOD_(MozExternalRefCountType) Release();
|
|
NS_IMETHOD QueryInterface( const nsIID&, void** );
|
|
|
|
NS_IMETHOD SetString(const nsACString& /*in*/ aString);
|
|
NS_IMETHOD GetString(nsACString& /*out*/ aString);
|
|
|
|
static void print_totals();
|
|
|
|
private:
|
|
~IFoo();
|
|
|
|
unsigned int refcount_;
|
|
|
|
static unsigned int total_constructions_;
|
|
static unsigned int total_destructions_;
|
|
nsCString mString;
|
|
};
|
|
|
|
NS_DEFINE_STATIC_IID_ACCESSOR(IFoo, NS_IFOO_IID)
|
|
|
|
unsigned int IFoo::total_constructions_;
|
|
unsigned int IFoo::total_destructions_;
|
|
|
|
void
|
|
IFoo::print_totals()
|
|
{
|
|
printf("total constructions/destructions --> %d/%d\n",
|
|
total_constructions_, total_destructions_);
|
|
}
|
|
|
|
IFoo::IFoo()
|
|
: refcount_(0)
|
|
{
|
|
++total_constructions_;
|
|
printf(" new IFoo@%p [#%d]\n",
|
|
static_cast<void*>(this), total_constructions_);
|
|
}
|
|
|
|
IFoo::~IFoo()
|
|
{
|
|
++total_destructions_;
|
|
printf("IFoo@%p::~IFoo() [#%d]\n",
|
|
static_cast<void*>(this), total_destructions_);
|
|
}
|
|
|
|
MozExternalRefCountType
|
|
IFoo::AddRef()
|
|
{
|
|
++refcount_;
|
|
printf("IFoo@%p::AddRef(), refcount --> %d\n",
|
|
static_cast<void*>(this), refcount_);
|
|
return refcount_;
|
|
}
|
|
|
|
MozExternalRefCountType
|
|
IFoo::Release()
|
|
{
|
|
int newcount = --refcount_;
|
|
if ( newcount == 0 )
|
|
printf(">>");
|
|
|
|
printf("IFoo@%p::Release(), refcount --> %d\n",
|
|
static_cast<void*>(this), refcount_);
|
|
|
|
if ( newcount == 0 )
|
|
{
|
|
printf(" delete IFoo@%p\n", static_cast<void*>(this));
|
|
printf("<<IFoo@%p::Release()\n", static_cast<void*>(this));
|
|
delete this;
|
|
}
|
|
|
|
return newcount;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::QueryInterface( const nsIID& aIID, void** aResult )
|
|
{
|
|
printf("IFoo@%p::QueryInterface()\n", static_cast<void*>(this));
|
|
nsISupports* rawPtr = 0;
|
|
nsresult status = NS_OK;
|
|
|
|
if ( aIID.Equals(NS_GET_IID(IFoo)) )
|
|
rawPtr = this;
|
|
else
|
|
{
|
|
nsID iid_of_ISupports = NS_ISUPPORTS_IID;
|
|
if ( aIID.Equals(iid_of_ISupports) )
|
|
rawPtr = static_cast<nsISupports*>(this);
|
|
else
|
|
status = NS_ERROR_NO_INTERFACE;
|
|
}
|
|
|
|
NS_IF_ADDREF(rawPtr);
|
|
*aResult = rawPtr;
|
|
|
|
return status;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::SetString(const nsACString& aString)
|
|
{
|
|
mString = aString;
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::GetString(nsACString& aString)
|
|
{
|
|
aString = mString;
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
CreateIFoo( IFoo** result )
|
|
// a typical factory function (that calls AddRef)
|
|
{
|
|
printf(" >>CreateIFoo() --> ");
|
|
IFoo* foop = new IFoo();
|
|
printf("IFoo@%p\n", static_cast<void*>(foop));
|
|
|
|
foop->AddRef();
|
|
*result = foop;
|
|
|
|
printf("<<CreateIFoo()\n");
|
|
return NS_OK;
|
|
}
|
|
|
|
} // namespace TestHashtables
|
|
|
|
using namespace TestHashtables;
|
|
|
|
int
|
|
main(void) {
|
|
// check an nsTHashtable
|
|
printf("Initializing nsTHashtable...");
|
|
nsTHashtable<EntityToUnicodeEntry> EntityToUnicode(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Partially filling nsTHashtable:\n");
|
|
testTHashtable(EntityToUnicode, 5);
|
|
|
|
printf("Enumerate-removing...\n");
|
|
uint32_t count = nsTIterPrintRemove(EntityToUnicode);
|
|
if (count != 5) {
|
|
printf("wrong count\n");
|
|
exit (7);
|
|
}
|
|
printf("OK\n");
|
|
|
|
printf("Check enumeration...");
|
|
count = nsTIterPrint(EntityToUnicode);
|
|
if (count != 0) {
|
|
printf("entries remain in table!\n");
|
|
exit (8);
|
|
}
|
|
printf("OK\n");
|
|
|
|
printf("Filling nsTHashtable:\n");
|
|
testTHashtable(EntityToUnicode, ENTITY_COUNT);
|
|
|
|
printf("Clearing...");
|
|
EntityToUnicode.Clear();
|
|
printf("OK\n");
|
|
|
|
printf("Check enumeration...");
|
|
count = nsTIterPrint(EntityToUnicode);
|
|
if (count != 0) {
|
|
printf("entries remain in table!\n");
|
|
exit (9);
|
|
}
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a data-hashtable
|
|
//
|
|
|
|
printf("Initializing nsDataHashtable...");
|
|
nsDataHashtable<nsUint32HashKey,const char*> UniToEntity(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
uint32_t i;
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
UniToEntity.Put(gEntities[i].mUnicode, gEntities[i].mStr);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
const char* str;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %u...", gEntities[i].mUnicode);
|
|
if (!UniToEntity.Get(gEntities[i].mUnicode, &str)) {
|
|
printf("FAILED\n");
|
|
exit (12);
|
|
}
|
|
|
|
printf("Found %s\n", str);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (UniToEntity.Get(99446, &str)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (13);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = UniToEntity.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), iter.UserData());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (14);
|
|
}
|
|
|
|
printf("Clearing...");
|
|
UniToEntity.Clear();
|
|
printf("OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = UniToEntity.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), iter.Data());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (15);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a class-hashtable
|
|
//
|
|
|
|
printf("Initializing nsClassHashtable...");
|
|
nsClassHashtable<nsCStringHashKey,TestUniChar> EntToUniClass(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
TestUniChar* temp = new TestUniChar(gEntities[i].mUnicode);
|
|
|
|
EntToUniClass.Put(nsDependentCString(gEntities[i].mStr), temp);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
TestUniChar* myChar;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
if (!EntToUniClass.Get(nsDependentCString(gEntities[i].mStr), &myChar)) {
|
|
printf("FAILED\n");
|
|
exit (18);
|
|
}
|
|
|
|
printf("Found %c\n", myChar->GetChar());
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (EntToUniClass.Get(NS_LITERAL_CSTRING("xxxx"), &myChar)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (19);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = EntToUniClass.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated \"%s\" = %c\n",
|
|
PromiseFlatCString(iter.Key()).get(), iter.UserData()->GetChar());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (20);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
EntToUniClass.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = EntToUniClass.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated \"%s\" = %c\n",
|
|
PromiseFlatCString(iter.Key()).get(), iter.Data()->GetChar());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (21);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a data-hashtable with an interface key
|
|
//
|
|
|
|
printf("Initializing nsDataHashtable with interface key...");
|
|
nsDataHashtable<nsISupportsHashKey,uint32_t> EntToUniClass2(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
nsCOMArray<IFoo> fooArray;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
nsCOMPtr<IFoo> foo;
|
|
CreateIFoo(getter_AddRefs(foo));
|
|
foo->SetString(nsDependentCString(gEntities[i].mStr));
|
|
|
|
fooArray.InsertObjectAt(foo, i);
|
|
|
|
EntToUniClass2.Put(foo, gEntities[i].mUnicode);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
uint32_t myChar2;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
|
|
if (!EntToUniClass2.Get(fooArray[i], &myChar2)) {
|
|
printf("FAILED\n");
|
|
exit (24);
|
|
}
|
|
|
|
printf("Found %c\n", myChar2);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (EntToUniClass2.Get((nsISupports*) 0x55443316, &myChar2)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (25);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = EntToUniClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
nsCOMPtr<IFoo> foo = do_QueryInterface(iter.Key());
|
|
foo->GetString(s);
|
|
printf(" enumerated \"%s\" = %u\n", s.get(), iter.UserData());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (26);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
EntToUniClass2.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = EntToUniClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
nsCOMPtr<IFoo> foo = do_QueryInterface(iter.Key());
|
|
foo->GetString(s);
|
|
printf(" enumerated \"%s\" = %u\n", s.get(), iter.Data());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (27);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check an interface-hashtable with an uint32_t key
|
|
//
|
|
|
|
printf("Initializing nsInterfaceHashtable...");
|
|
nsInterfaceHashtable<nsUint32HashKey,IFoo> UniToEntClass2(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
nsCOMPtr<IFoo> foo;
|
|
CreateIFoo(getter_AddRefs(foo));
|
|
foo->SetString(nsDependentCString(gEntities[i].mStr));
|
|
|
|
UniToEntClass2.Put(gEntities[i].mUnicode, foo);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
|
|
nsCOMPtr<IFoo> myEnt;
|
|
if (!UniToEntClass2.Get(gEntities[i].mUnicode, getter_AddRefs(myEnt))) {
|
|
printf("FAILED\n");
|
|
exit (30);
|
|
}
|
|
|
|
nsAutoCString myEntStr;
|
|
myEnt->GetString(myEntStr);
|
|
printf("Found %s\n", myEntStr.get());
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
nsCOMPtr<IFoo> myEnt;
|
|
if (UniToEntClass2.Get(9462, getter_AddRefs(myEnt))) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (31);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = UniToEntClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
iter.UserData()->GetString(s);
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), s.get());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (32);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
UniToEntClass2.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = UniToEntClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
iter.Data()->GetString(s);
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), s.get());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (33);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
return 0;
|
|
}
|