johnson 1.2.0 → 2.0.0.pre0

data/vendor/tracemonkey/xpconnect/src/xpclog.cpp

@@ -0,0 +1,128 @@
+/* -*- Mode: C++; tab-width: 8; 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):
+ *   John Bandhauer <jband@netscape.com> (original author)
+ *
+ * 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 ***** */
+
+/* Debug Logging support. */
+
+#include "xpcprivate.h"
+
+// this all only works for DEBUG...
+#ifdef DEBUG
+
+#define SPACE_COUNT     200
+#define LINE_LEN        200
+#define INDENT_FACTOR   2
+
+#define CAN_RUN (g_InitState == 1 || (g_InitState == 0 && Init()))
+
+static char*    g_Spaces;
+static int      g_InitState = 0;
+static int      g_Indent = 0;
+static PRLogModuleInfo* g_LogMod = nsnull;
+
+static PRBool Init()
+{
+    g_LogMod = PR_NewLogModule("xpclog");
+    g_Spaces = new char[SPACE_COUNT+1];
+    if(!g_LogMod || !g_Spaces || !PR_LOG_TEST(g_LogMod,1))
+    {
+        g_InitState = 1;
+        XPC_Log_Finish();
+        return PR_FALSE;
+    }
+    memset(g_Spaces, ' ', SPACE_COUNT);
+    g_Spaces[SPACE_COUNT] = 0;
+    g_InitState = 1;
+    return PR_TRUE;
+}
+
+void
+XPC_Log_Finish()
+{
+    if(g_InitState == 1)
+    {
+        delete [] g_Spaces;
+        // we'd like to properly cleanup the LogModule, but nspr owns that
+        g_LogMod = nsnull;
+    }
+    g_InitState = -1;
+}
+
+void
+XPC_Log_print(const char *fmt, ...)
+{
+    va_list ap;
+    char line[LINE_LEN];
+
+    va_start(ap, fmt);
+    PR_vsnprintf(line, sizeof(line)-1, fmt, ap);
+    va_end(ap);
+    if(g_Indent)
+        PR_LogPrint("%s%s",g_Spaces+SPACE_COUNT-(INDENT_FACTOR*g_Indent),line);
+    else
+        PR_LogPrint("%s",line);
+}
+
+PRBool
+XPC_Log_Check(int i)
+{
+    return CAN_RUN && PR_LOG_TEST(g_LogMod,1);
+}
+
+void
+XPC_Log_Indent()
+{
+    if(INDENT_FACTOR*(++g_Indent) > SPACE_COUNT)
+        g_Indent-- ;
+}
+
+void
+XPC_Log_Outdent()
+{
+    if(--g_Indent < 0)
+        g_Indent++;
+}
+
+void
+XPC_Log_Clear_Indent()
+{
+    g_Indent = 0;
+}
+
+#endif

data/vendor/tracemonkey/xpconnect/src/xpclog.h

@@ -0,0 +1,101 @@
+/* -*- Mode: C; tab-width: 8; 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):
+ *   John Bandhauer <jband@netscape.com> (original author)
+ *
+ * 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 ***** */
+
+/* Debug Logging support. */
+
+#ifndef xpclog_h___
+#define xpclog_h___
+
+#include "nsIXPConnect.h"
+#include "prtypes.h"
+#include "prlog.h"
+
+/*
+ * This uses prlog.h See prlog.h for environment settings for output.
+ * The module name used here is 'xpclog'. These environment settings
+ * should work...
+ *
+ * SET NSPR_LOG_MODULES=xpclog:5
+ * SET NSPR_LOG_FILE=logfile.txt
+ *
+ * usage:
+ *   XPC_LOG_ERROR(("my comment number %d", 5))   // note the double parens
+ *
+ */
+
+#ifdef DEBUG
+#define XPC_LOG_INTERNAL(number,_args)  \
+    do{if(XPC_Log_Check(number)){XPC_Log_print _args;}}while(0)
+
+#define XPC_LOG_ALWAYS(_args)   XPC_LOG_INTERNAL(1,_args)
+#define XPC_LOG_ERROR(_args)    XPC_LOG_INTERNAL(2,_args)
+#define XPC_LOG_WARNING(_args)  XPC_LOG_INTERNAL(3,_args)
+#define XPC_LOG_DEBUG(_args)    XPC_LOG_INTERNAL(4,_args)
+#define XPC_LOG_FLUSH()         PR_LogFlush()
+#define XPC_LOG_INDENT()        XPC_Log_Indent()
+#define XPC_LOG_OUTDENT()       XPC_Log_Outdent()
+#define XPC_LOG_CLEAR_INDENT()  XPC_Log_Clear_Indent()
+#define XPC_LOG_FINISH()        XPC_Log_Finish()
+
+JS_BEGIN_EXTERN_C
+
+void   XPC_Log_print(const char *fmt, ...);
+PRBool XPC_Log_Check(int i);
+void   XPC_Log_Indent();
+void   XPC_Log_Outdent();
+void   XPC_Log_Clear_Indent();
+void   XPC_Log_Finish();
+
+JS_END_EXTERN_C
+
+#else
+
+#define XPC_LOG_ALWAYS(_args)  ((void)0)
+#define XPC_LOG_ERROR(_args)   ((void)0)
+#define XPC_LOG_WARNING(_args) ((void)0)
+#define XPC_LOG_DEBUG(_args)   ((void)0)
+#define XPC_LOG_FLUSH()        ((void)0)
+#define XPC_LOG_INDENT()       ((void)0)
+#define XPC_LOG_OUTDENT()      ((void)0)
+#define XPC_LOG_CLEAR_INDENT() ((void)0)
+#define XPC_LOG_FINISH()       ((void)0)
+#endif
+
+#endif /* xpclog_h___ */

data/vendor/tracemonkey/xpconnect/src/xpcmaps.cpp

@@ -0,0 +1,761 @@
+/* -*- Mode: C++; tab-width: 8; 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):
+ *   John Bandhauer <jband@netscape.com> (original author)
+ *
+ * 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 ***** */
+
+/* Private maps (hashtables). */
+
+#include "xpcprivate.h"
+#include "jsbit.h"
+
+/***************************************************************************/
+// static shared...
+
+// Note this is returning the bit pattern of the first part of the nsID, not
+// the pointer to the nsID.
+
+static JSDHashNumber
+HashIIDPtrKey(JSDHashTable *table, const void *key)
+{
+    return *((JSHashNumber*)key);
+}
+
+static JSBool
+MatchIIDPtrKey(JSDHashTable *table,
+            const JSDHashEntryHdr *entry,
+            const void *key)
+{
+    return ((const nsID*)key)->
+                Equals(*((const nsID*)((JSDHashEntryStub*)entry)->key));
+}
+
+static JSDHashNumber
+HashNativeKey(JSDHashTable *table, const void *key)
+{
+    XPCNativeSetKey* Key = (XPCNativeSetKey*) key;
+
+    JSDHashNumber h = 0;
+
+    XPCNativeSet*       Set;
+    XPCNativeInterface* Addition;
+    PRUint16            Position;
+
+    if(Key->IsAKey())
+    {
+        Set      = Key->GetBaseSet();
+        Addition = Key->GetAddition();
+        Position = Key->GetPosition();
+    }
+    else
+    {
+        Set      = (XPCNativeSet*) Key;
+        Addition = nsnull;
+        Position = 0;
+    }
+
+    if(!Set)
+    {
+        NS_ASSERTION(Addition, "bad key");
+        // This would be an XOR like below. 
+        // But "0 ^ x == x". So it does not matter.
+        h = (JSHashNumber) NS_PTR_TO_INT32(Addition) >> 2;
+    }
+    else
+    {
+        XPCNativeInterface** Current = Set->GetInterfaceArray();
+        PRUint16 count = Set->GetInterfaceCount();
+        if(Addition)
+        {
+            count++;
+            for(PRUint16 i = 0; i < count; i++)
+            {
+                if(i == Position)
+                    h ^= (JSHashNumber) NS_PTR_TO_INT32(Addition) >> 2;
+                else
+                    h ^= (JSHashNumber) NS_PTR_TO_INT32(*(Current++)) >> 2;
+            }
+        }
+        else
+        {
+            for(PRUint16 i = 0; i < count; i++)
+                h ^= (JSHashNumber) NS_PTR_TO_INT32(*(Current++)) >> 2;
+        }
+    }
+
+    return h;
+}
+
+/***************************************************************************/
+// implement JSObject2WrappedJSMap...
+
+// static
+JSObject2WrappedJSMap*
+JSObject2WrappedJSMap::newMap(int size)
+{
+    JSObject2WrappedJSMap* map = new JSObject2WrappedJSMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+JSObject2WrappedJSMap::JSObject2WrappedJSMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(Entry), size);
+}
+
+JSObject2WrappedJSMap::~JSObject2WrappedJSMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement Native2WrappedNativeMap...
+
+// static
+Native2WrappedNativeMap*
+Native2WrappedNativeMap::newMap(int size)
+{
+    Native2WrappedNativeMap* map = new Native2WrappedNativeMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+Native2WrappedNativeMap::Native2WrappedNativeMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(Entry), size);
+}
+
+Native2WrappedNativeMap::~Native2WrappedNativeMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement IID2WrappedJSClassMap...
+
+struct JSDHashTableOps IID2WrappedJSClassMap::Entry::sOps =
+{
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    HashIIDPtrKey,
+    MatchIIDPtrKey,
+    JS_DHashMoveEntryStub,
+    JS_DHashClearEntryStub,
+    JS_DHashFinalizeStub
+};
+
+// static
+IID2WrappedJSClassMap*
+IID2WrappedJSClassMap::newMap(int size)
+{
+    IID2WrappedJSClassMap* map = new IID2WrappedJSClassMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+IID2WrappedJSClassMap::IID2WrappedJSClassMap(int size)
+{
+    mTable = JS_NewDHashTable(&Entry::sOps, nsnull, sizeof(Entry), size);
+}
+
+IID2WrappedJSClassMap::~IID2WrappedJSClassMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+
+/***************************************************************************/
+// implement IID2NativeInterfaceMap...
+
+struct JSDHashTableOps IID2NativeInterfaceMap::Entry::sOps =
+{
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    HashIIDPtrKey,
+    MatchIIDPtrKey,
+    JS_DHashMoveEntryStub,
+    JS_DHashClearEntryStub,
+    JS_DHashFinalizeStub
+};
+
+// static
+IID2NativeInterfaceMap*
+IID2NativeInterfaceMap::newMap(int size)
+{
+    IID2NativeInterfaceMap* map = new IID2NativeInterfaceMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+IID2NativeInterfaceMap::IID2NativeInterfaceMap(int size)
+{
+    mTable = JS_NewDHashTable(&Entry::sOps, nsnull, sizeof(Entry), size);
+}
+
+IID2NativeInterfaceMap::~IID2NativeInterfaceMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement ClassInfo2NativeSetMap...
+
+// static
+ClassInfo2NativeSetMap*
+ClassInfo2NativeSetMap::newMap(int size)
+{
+    ClassInfo2NativeSetMap* map = new ClassInfo2NativeSetMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+ClassInfo2NativeSetMap::ClassInfo2NativeSetMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(Entry), size);
+}
+
+ClassInfo2NativeSetMap::~ClassInfo2NativeSetMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement ClassInfo2WrappedNativeProtoMap...
+
+// static
+ClassInfo2WrappedNativeProtoMap*
+ClassInfo2WrappedNativeProtoMap::newMap(int size)
+{
+    ClassInfo2WrappedNativeProtoMap* map = new ClassInfo2WrappedNativeProtoMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+ClassInfo2WrappedNativeProtoMap::ClassInfo2WrappedNativeProtoMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(Entry), size);
+}
+
+ClassInfo2WrappedNativeProtoMap::~ClassInfo2WrappedNativeProtoMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement NativeSetMap...
+
+JSBool
+NativeSetMap::Entry::Match(JSDHashTable *table,
+                           const JSDHashEntryHdr *entry,
+                           const void *key)
+{
+    XPCNativeSetKey* Key = (XPCNativeSetKey*) key;
+
+    // See the comment in the XPCNativeSetKey declaration in xpcprivate.h.
+    if(!Key->IsAKey())
+    {
+        XPCNativeSet* Set1 = (XPCNativeSet*) key;
+        XPCNativeSet* Set2 = ((Entry*)entry)->key_value;
+
+        if(Set1 == Set2)
+            return JS_TRUE;
+
+        PRUint16 count = Set1->GetInterfaceCount();
+        if(count != Set2->GetInterfaceCount())
+            return JS_FALSE;
+
+        XPCNativeInterface** Current1 = Set1->GetInterfaceArray();
+        XPCNativeInterface** Current2 = Set2->GetInterfaceArray();
+        for(PRUint16 i = 0; i < count; i++)
+        {
+            if(*(Current1++) != *(Current2++))
+                return JS_FALSE;
+        }
+
+        return JS_TRUE;
+    }
+
+    XPCNativeSet*       SetInTable = ((Entry*)entry)->key_value;
+    XPCNativeSet*       Set        = Key->GetBaseSet();
+    XPCNativeInterface* Addition   = Key->GetAddition();
+
+    if(!Set)
+    {
+        // This is a special case to deal with the invariant that says:
+        // "All sets have exactly one nsISupports interface and it comes first."
+        // See XPCNativeSet::NewInstance for details.
+        //
+        // Though we might have a key that represents only one interface, we
+        // know that if that one interface were contructed into a set then
+        // it would end up really being a set with two interfaces (except for
+        // the case where the one interface happened to be nsISupports).
+
+        return ((SetInTable->GetInterfaceCount() == 1 &&
+                 SetInTable->GetInterfaceAt(0) == Addition) ||
+                (SetInTable->GetInterfaceCount() == 2 &&
+                 SetInTable->GetInterfaceAt(1) == Addition));
+    }
+
+    if(!Addition && Set == SetInTable)
+        return JS_TRUE;
+
+    PRUint16 count = Set->GetInterfaceCount() + (Addition ? 1 : 0);
+    if(count != SetInTable->GetInterfaceCount())
+        return JS_FALSE;
+
+    PRUint16 Position = Key->GetPosition();
+    XPCNativeInterface** CurrentInTable = SetInTable->GetInterfaceArray();
+    XPCNativeInterface** Current = Set->GetInterfaceArray();
+    for(PRUint16 i = 0; i < count; i++)
+    {
+        if(Addition && i == Position)
+        {
+            if(Addition != *(CurrentInTable++))
+                return JS_FALSE;
+        }
+        else
+        {
+            if(*(Current++) != *(CurrentInTable++))
+                return JS_FALSE;
+        }
+    }
+
+    return JS_TRUE;
+}
+
+struct JSDHashTableOps NativeSetMap::Entry::sOps =
+{
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    HashNativeKey,
+    Match,
+    JS_DHashMoveEntryStub,
+    JS_DHashClearEntryStub,
+    JS_DHashFinalizeStub
+};
+
+// static
+NativeSetMap*
+NativeSetMap::newMap(int size)
+{
+    NativeSetMap* map = new NativeSetMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+NativeSetMap::NativeSetMap(int size)
+{
+    mTable = JS_NewDHashTable(&Entry::sOps, nsnull, sizeof(Entry), size);
+}
+
+NativeSetMap::~NativeSetMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement IID2ThisTranslatorMap...
+
+JSBool
+IID2ThisTranslatorMap::Entry::Match(JSDHashTable *table,
+                                    const JSDHashEntryHdr *entry,
+                                    const void *key)
+{
+    return ((const nsID*)key)->Equals(((Entry*)entry)->key);
+}
+
+void
+IID2ThisTranslatorMap::Entry::Clear(JSDHashTable *table, JSDHashEntryHdr *entry)
+{
+    NS_IF_RELEASE(((Entry*)entry)->value);
+    memset(entry, 0, table->entrySize);
+}
+
+struct JSDHashTableOps IID2ThisTranslatorMap::Entry::sOps =
+{
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    HashIIDPtrKey,
+    Match,
+    JS_DHashMoveEntryStub,
+    Clear,
+    JS_DHashFinalizeStub
+};
+
+// static
+IID2ThisTranslatorMap*
+IID2ThisTranslatorMap::newMap(int size)
+{
+    IID2ThisTranslatorMap* map = new IID2ThisTranslatorMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+IID2ThisTranslatorMap::IID2ThisTranslatorMap(int size)
+{
+    mTable = JS_NewDHashTable(&Entry::sOps, nsnull, sizeof(Entry), size);
+}
+
+IID2ThisTranslatorMap::~IID2ThisTranslatorMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+
+JSDHashNumber
+XPCNativeScriptableSharedMap::Entry::Hash(JSDHashTable *table, const void *key)
+{
+    JSDHashNumber h;
+    const unsigned char *s;
+
+    XPCNativeScriptableShared* obj =
+        (XPCNativeScriptableShared*) key;
+
+    // hash together the flags and the classname string
+
+    h = (JSDHashNumber) obj->GetFlags();
+    for (s = (const unsigned char*) obj->GetJSClass()->name; *s != '\0'; s++)
+        h = JS_ROTATE_LEFT32(h, 4) ^ *s;
+    return h;
+}
+
+JSBool
+XPCNativeScriptableSharedMap::Entry::Match(JSDHashTable *table,
+                                         const JSDHashEntryHdr *entry,
+                                         const void *key)
+{
+    XPCNativeScriptableShared* obj1 =
+        ((XPCNativeScriptableSharedMap::Entry*) entry)->key;
+
+    XPCNativeScriptableShared* obj2 =
+        (XPCNativeScriptableShared*) key;
+
+    // match the flags and the classname string
+
+    if(obj1->GetFlags() != obj2->GetFlags())
+        return JS_FALSE;
+
+    const char* name1 = obj1->GetJSClass()->name;
+    const char* name2 = obj2->GetJSClass()->name;
+
+    if(!name1 || !name2)
+        return name1 == name2;
+
+    return 0 == strcmp(name1, name2);
+}
+
+struct JSDHashTableOps XPCNativeScriptableSharedMap::Entry::sOps =
+{
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    Hash,
+    Match,
+    JS_DHashMoveEntryStub,
+    JS_DHashClearEntryStub,
+    JS_DHashFinalizeStub
+};
+
+// static
+XPCNativeScriptableSharedMap*
+XPCNativeScriptableSharedMap::newMap(int size)
+{
+    XPCNativeScriptableSharedMap* map =
+        new XPCNativeScriptableSharedMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+XPCNativeScriptableSharedMap::XPCNativeScriptableSharedMap(int size)
+{
+    mTable = JS_NewDHashTable(&Entry::sOps, nsnull, sizeof(Entry), size);
+}
+
+XPCNativeScriptableSharedMap::~XPCNativeScriptableSharedMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+JSBool
+XPCNativeScriptableSharedMap::GetNewOrUsed(JSUint32 flags,
+                                           char* name,
+                                           JSBool isGlobal,
+                                           XPCNativeScriptableInfo* si)
+{
+    NS_PRECONDITION(name,"bad param");
+    NS_PRECONDITION(si,"bad param");
+
+    XPCNativeScriptableShared key(flags, name);
+
+    Entry* entry = (Entry*)
+        JS_DHashTableOperate(mTable, &key, JS_DHASH_ADD);
+    if(!entry)
+        return JS_FALSE;
+
+    XPCNativeScriptableShared* shared = entry->key;
+
+    if(!shared)
+    {
+        entry->key = shared =
+            new XPCNativeScriptableShared(flags, key.TransferNameOwnership());
+        if(!shared)
+            return JS_FALSE;
+        shared->PopulateJSClass(isGlobal);
+    }
+    si->SetScriptableShared(shared);
+    return JS_TRUE;
+}
+
+/***************************************************************************/
+// implement XPCWrappedNativeProtoMap...
+
+// static
+XPCWrappedNativeProtoMap*
+XPCWrappedNativeProtoMap::newMap(int size)
+{
+    XPCWrappedNativeProtoMap* map = new XPCWrappedNativeProtoMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+XPCWrappedNativeProtoMap::XPCWrappedNativeProtoMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(JSDHashEntryStub), size);
+}
+
+XPCWrappedNativeProtoMap::~XPCWrappedNativeProtoMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement XPCNativeWrapperMap...
+
+// static
+XPCNativeWrapperMap*
+XPCNativeWrapperMap::newMap(int size)
+{
+    XPCNativeWrapperMap* map = new XPCNativeWrapperMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+XPCNativeWrapperMap::XPCNativeWrapperMap(int size)
+{
+    mTable = JS_NewDHashTable(JS_DHashGetStubOps(), nsnull,
+                              sizeof(JSDHashEntryStub), size);
+}
+
+XPCNativeWrapperMap::~XPCNativeWrapperMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+/***************************************************************************/
+// implement WrappedNative2WrapperMap...
+
+struct JSDHashTableOps
+WrappedNative2WrapperMap::sOps = {
+    JS_DHashAllocTable,
+    JS_DHashFreeTable,
+    JS_DHashVoidPtrKeyStub,
+    JS_DHashMatchEntryStub,
+    MoveLink,
+    ClearLink,
+    JS_DHashFinalizeStub,
+    nsnull
+};
+
+// static
+void
+WrappedNative2WrapperMap::ClearLink(JSDHashTable* table,
+                                    JSDHashEntryHdr* entry)
+{
+    Entry* e = static_cast<Entry*>(entry);
+    e->key = nsnull;
+    PR_REMOVE_LINK(&e->value);
+    memset(e, 0, sizeof(*e));
+}
+
+// static
+void
+WrappedNative2WrapperMap::MoveLink(JSDHashTable* table,
+                                   const JSDHashEntryHdr* from,
+                                   JSDHashEntryHdr* to)
+{
+    const Entry* oldEntry = static_cast<const Entry*>(from);
+    Entry* newEntry = static_cast<Entry*>(to);
+
+    newEntry->key = oldEntry->key;
+
+    // Now update the list.
+    if(PR_CLIST_IS_EMPTY(&oldEntry->value))
+    {
+        PR_INIT_CLIST(&newEntry->value);
+        newEntry->value.obj = oldEntry->value.obj;
+    }
+    else
+    {
+        newEntry->value = oldEntry->value;
+        newEntry->value.next->prev = &newEntry->value;
+        newEntry->value.prev->next = &newEntry->value;
+    }
+}
+
+// static
+WrappedNative2WrapperMap*
+WrappedNative2WrapperMap::newMap(int size)
+{
+    WrappedNative2WrapperMap* map = new WrappedNative2WrapperMap(size);
+    if(map && map->mTable)
+        return map;
+    delete map;
+    return nsnull;
+}
+
+WrappedNative2WrapperMap::WrappedNative2WrapperMap(int size)
+{
+    mTable = JS_NewDHashTable(&sOps, nsnull, sizeof(Entry), size);
+}
+
+WrappedNative2WrapperMap::~WrappedNative2WrapperMap()
+{
+    if(mTable)
+        JS_DHashTableDestroy(mTable);
+}
+
+JSObject*
+WrappedNative2WrapperMap::Add(WrappedNative2WrapperMap* head,
+                              JSObject* wrappedObject,
+                              JSObject* wrapper)
+{
+    NS_PRECONDITION(wrappedObject,"bad param");
+    Entry* entry = (Entry*)
+        JS_DHashTableOperate(mTable, wrappedObject, JS_DHASH_ADD);
+    if(!entry)
+        return nsnull;
+    NS_ASSERTION(!entry->key || this == head, "dangling pointer?");
+    entry->key = wrappedObject;
+    Link* l = &entry->value;
+
+    NS_ASSERTION(!l->obj, "Uh, how'd this happen?");
+
+    if(!l->next)
+    {
+        // Initialize the circular list. This case only happens when
+        // this == head.
+        PR_INIT_CLIST(l);
+    }
+
+    l->obj = wrapper;
+
+    if(this != head)
+    {
+        Link* headLink = head->FindLink(wrappedObject);
+        if(!headLink)
+        {
+            Entry* dummy = (Entry*)
+                JS_DHashTableOperate(head->mTable, wrappedObject, JS_DHASH_ADD);
+            dummy->key = wrappedObject;
+            headLink = &dummy->value;
+            PR_INIT_CLIST(headLink);
+            headLink->obj = nsnull;
+        }
+
+        PR_INSERT_BEFORE(l, headLink);
+    }
+
+    return wrapper;
+}
+
+PRBool
+WrappedNative2WrapperMap::AddLink(JSObject* wrappedObject, Link* oldLink)
+{
+    Entry* entry = (Entry*)
+        JS_DHashTableOperate(mTable, wrappedObject, JS_DHASH_ADD);
+    if(!entry)
+        return PR_FALSE;
+    NS_ASSERTION(!entry->key, "Eh? What's happening?");
+    entry->key = wrappedObject;
+    Link* newLink = &entry->value;
+
+    PR_INSERT_LINK(newLink, oldLink);
+    PR_REMOVE_AND_INIT_LINK(oldLink);
+    newLink->obj = oldLink->obj;
+
+    return PR_TRUE;
+}
+
+/***************************************************************************/