mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-11-05 08:35:26 +00:00
265 lines
8.3 KiB
C++
265 lines
8.3 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
*
|
|
* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is Mozilla Communicator client code, released
|
|
* March 31, 1998.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Netscape Communications Corporation.
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
|
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
/* Class to manage lookup of static names in a table. */
|
|
|
|
#include "nsCRT.h"
|
|
|
|
#include "nscore.h"
|
|
#include "nsString.h"
|
|
#include "nsReadableUtils.h"
|
|
|
|
#define PL_ARENA_CONST_ALIGN_MASK 3
|
|
#include "nsStaticNameTable.h"
|
|
|
|
struct NameTableKey
|
|
{
|
|
NameTableKey(const nsAFlatCString* aKeyStr)
|
|
: mIsUnichar(PR_FALSE)
|
|
{
|
|
mKeyStr.m1b = aKeyStr;
|
|
}
|
|
|
|
NameTableKey(const nsAFlatString* aKeyStr)
|
|
: mIsUnichar(PR_TRUE)
|
|
{
|
|
mKeyStr.m2b = aKeyStr;
|
|
}
|
|
|
|
PRBool mIsUnichar;
|
|
union {
|
|
const nsAFlatCString* m1b;
|
|
const nsAFlatString* m2b;
|
|
} mKeyStr;
|
|
};
|
|
|
|
struct NameTableEntry : public PLDHashEntryHdr
|
|
{
|
|
// no ownership here!
|
|
const nsAFlatCString* mString;
|
|
PRInt32 mIndex;
|
|
};
|
|
|
|
PR_STATIC_CALLBACK(PRBool)
|
|
matchNameKeysCaseInsensitive(PLDHashTable*, const PLDHashEntryHdr* aHdr,
|
|
const void* key)
|
|
{
|
|
const NameTableEntry* entry =
|
|
static_cast<const NameTableEntry *>(aHdr);
|
|
const NameTableKey *keyValue = static_cast<const NameTableKey*>(key);
|
|
|
|
const nsAFlatCString* entryKey = entry->mString;
|
|
|
|
if (keyValue->mIsUnichar) {
|
|
return keyValue->mKeyStr.m2b->
|
|
LowerCaseEqualsASCII(entryKey->get(), entryKey->Length());
|
|
}
|
|
|
|
return keyValue->mKeyStr.m1b->
|
|
LowerCaseEqualsASCII(entryKey->get(), entryKey->Length());
|
|
}
|
|
|
|
/*
|
|
* caseInsensitiveHashKey is just like PL_DHashStringKey except it
|
|
* uses (*s & ~0x20) instead of simply *s. This means that "aFOO" and
|
|
* "afoo" and "aFoo" will all hash to the same thing. It also means
|
|
* that some strings that aren't case-insensensitively equal will hash
|
|
* to the same value, but it's just a hash function so it doesn't
|
|
* matter.
|
|
*/
|
|
PR_STATIC_CALLBACK(PLDHashNumber)
|
|
caseInsensitiveStringHashKey(PLDHashTable *table, const void *key)
|
|
{
|
|
PLDHashNumber h = 0;
|
|
const NameTableKey* tableKey = static_cast<const NameTableKey*>(key);
|
|
if (tableKey->mIsUnichar) {
|
|
for (const PRUnichar* s = tableKey->mKeyStr.m2b->get();
|
|
*s != '\0';
|
|
s++)
|
|
h = (h >> (PL_DHASH_BITS - 4)) ^ (h << 4) ^ (*s & ~0x20);
|
|
} else {
|
|
for (const unsigned char* s =
|
|
reinterpret_cast<const unsigned char*>
|
|
(tableKey->mKeyStr.m1b->get());
|
|
*s != '\0';
|
|
s++)
|
|
h = (h >> (PL_DHASH_BITS - 4)) ^ (h << 4) ^ (*s & ~0x20);
|
|
}
|
|
return h;
|
|
}
|
|
|
|
static const struct PLDHashTableOps nametable_CaseInsensitiveHashTableOps = {
|
|
PL_DHashAllocTable,
|
|
PL_DHashFreeTable,
|
|
caseInsensitiveStringHashKey,
|
|
matchNameKeysCaseInsensitive,
|
|
PL_DHashMoveEntryStub,
|
|
PL_DHashClearEntryStub,
|
|
PL_DHashFinalizeStub,
|
|
nsnull,
|
|
};
|
|
|
|
nsStaticCaseInsensitiveNameTable::nsStaticCaseInsensitiveNameTable()
|
|
: mNameArray(nsnull), mNullStr("")
|
|
{
|
|
MOZ_COUNT_CTOR(nsStaticCaseInsensitiveNameTable);
|
|
mNameTable.ops = nsnull;
|
|
}
|
|
|
|
nsStaticCaseInsensitiveNameTable::~nsStaticCaseInsensitiveNameTable()
|
|
{
|
|
if (mNameArray) {
|
|
// manually call the destructor on placement-new'ed objects
|
|
for (PRUint32 index = 0; index < mNameTable.entryCount; index++) {
|
|
mNameArray[index].~nsDependentCString();
|
|
}
|
|
nsMemory::Free((void*)mNameArray);
|
|
}
|
|
if (mNameTable.ops)
|
|
PL_DHashTableFinish(&mNameTable);
|
|
MOZ_COUNT_DTOR(nsStaticCaseInsensitiveNameTable);
|
|
}
|
|
|
|
PRBool
|
|
nsStaticCaseInsensitiveNameTable::Init(const char* const aNames[], PRInt32 Count)
|
|
{
|
|
NS_ASSERTION(!mNameArray, "double Init");
|
|
NS_ASSERTION(!mNameTable.ops, "double Init");
|
|
NS_ASSERTION(aNames, "null name table");
|
|
NS_ASSERTION(Count, "0 count");
|
|
|
|
mNameArray = (nsDependentCString*)
|
|
nsMemory::Alloc(Count * sizeof(nsDependentCString));
|
|
if (!mNameArray)
|
|
return PR_FALSE;
|
|
|
|
if (!PL_DHashTableInit(&mNameTable,
|
|
&nametable_CaseInsensitiveHashTableOps,
|
|
nsnull, sizeof(NameTableEntry), Count)) {
|
|
mNameTable.ops = nsnull;
|
|
return PR_FALSE;
|
|
}
|
|
|
|
for (PRInt32 index = 0; index < Count; ++index) {
|
|
const char* raw = aNames[index];
|
|
#ifdef DEBUG
|
|
{
|
|
// verify invariants of contents
|
|
nsCAutoString temp1(raw);
|
|
nsDependentCString temp2(raw);
|
|
ToLowerCase(temp1);
|
|
NS_ASSERTION(temp1.Equals(temp2), "upper case char in table");
|
|
NS_ASSERTION(nsCRT::IsAscii(raw),
|
|
"non-ascii string in table -- "
|
|
"case-insensitive matching won't work right");
|
|
}
|
|
#endif
|
|
// use placement-new to initialize the string object
|
|
nsDependentCString* strPtr = &mNameArray[index];
|
|
new (strPtr) nsDependentCString(raw);
|
|
|
|
NameTableKey key(strPtr);
|
|
|
|
NameTableEntry *entry =
|
|
static_cast<NameTableEntry*>
|
|
(PL_DHashTableOperate(&mNameTable, &key,
|
|
PL_DHASH_ADD));
|
|
|
|
if (!entry) continue;
|
|
|
|
NS_ASSERTION(entry->mString == 0, "Entry already exists!");
|
|
|
|
entry->mString = strPtr; // not owned!
|
|
entry->mIndex = index;
|
|
}
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRInt32
|
|
nsStaticCaseInsensitiveNameTable::Lookup(const nsACString& aName)
|
|
{
|
|
NS_ASSERTION(mNameArray, "not inited");
|
|
NS_ASSERTION(mNameTable.ops, "not inited");
|
|
|
|
const nsAFlatCString& str = PromiseFlatCString(aName);
|
|
|
|
NameTableKey key(&str);
|
|
NameTableEntry *entry =
|
|
static_cast<NameTableEntry*>
|
|
(PL_DHashTableOperate(&mNameTable, &key,
|
|
PL_DHASH_LOOKUP));
|
|
|
|
if (PL_DHASH_ENTRY_IS_FREE(entry))
|
|
return nsStaticCaseInsensitiveNameTable::NOT_FOUND;
|
|
|
|
return entry->mIndex;
|
|
}
|
|
|
|
PRInt32
|
|
nsStaticCaseInsensitiveNameTable::Lookup(const nsAString& aName)
|
|
{
|
|
NS_ASSERTION(mNameArray, "not inited");
|
|
NS_ASSERTION(mNameTable.ops, "not inited");
|
|
|
|
const nsAFlatString& str = PromiseFlatString(aName);
|
|
|
|
NameTableKey key(&str);
|
|
NameTableEntry *entry =
|
|
static_cast<NameTableEntry*>
|
|
(PL_DHashTableOperate(&mNameTable, &key,
|
|
PL_DHASH_LOOKUP));
|
|
|
|
if (PL_DHASH_ENTRY_IS_FREE(entry))
|
|
return nsStaticCaseInsensitiveNameTable::NOT_FOUND;
|
|
|
|
return entry->mIndex;
|
|
}
|
|
|
|
const nsAFlatCString&
|
|
nsStaticCaseInsensitiveNameTable::GetStringValue(PRInt32 index)
|
|
{
|
|
NS_ASSERTION(mNameArray, "not inited");
|
|
NS_ASSERTION(mNameTable.ops, "not inited");
|
|
|
|
if ((NOT_FOUND < index) && ((PRUint32)index < mNameTable.entryCount)) {
|
|
return mNameArray[index];
|
|
}
|
|
return mNullStr;
|
|
}
|