1
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2
/* ***** BEGIN LICENSE BLOCK *****
3
* Version: NPL 1.1/GPL 2.0/LGPL 2.1
5
* The contents of this file are subject to the Netscape Public License
6
* Version 1.1 (the "License"); you may not use this file except in
7
* compliance with the License. You may obtain a copy of the License at
8
* http://www.mozilla.org/NPL/
10
* Software distributed under the License is distributed on an "AS IS" basis,
11
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12
* for the specific language governing rights and limitations under the
15
* The Original Code is mozilla.org code.
17
* The Initial Developer of the Original Code is
18
* Netscape Communications Corporation.
19
* Portions created by the Initial Developer are Copyright (C) 1998
20
* the Initial Developer. All Rights Reserved.
24
* Adam Lock <adamlock@eircom.net>
26
* Alternatively, the contents of this file may be used under the terms of
27
* either the GNU General Public License Version 2 or later (the "GPL"), or
28
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29
* in which case the provisions of the GPL or the LGPL are applicable instead
30
* of those above. If you wish to allow use of your version of this file only
31
* under the terms of either the GPL or the LGPL, and not to allow others to
32
* use your version of this file under the terms of the NPL, indicate your
33
* decision by deleting the provisions above and replace them with the notice
34
* and other provisions required by the GPL or the LGPL. If you do not delete
35
* the provisions above, a recipient may use your version of this file under
36
* the terms of any one of the NPL, the GPL or the LGPL.
38
* ***** END LICENSE BLOCK ***** */
41
#include "IEHtmlNode.h"
45
static PLHashTable *g_NodeLookupTable;
47
static PLHashNumber PR_CALLBACK HashFunction(const void *key)
49
return (PRUint32) key;
52
PRIntn PR_CALLBACK HashComparator(const void *v1, const void *v2)
62
CIEHtmlNode::CIEHtmlNode() :
67
CIEHtmlNode::~CIEHtmlNode()
73
HRESULT CIEHtmlNode::SetParent(CIEHtmlNode *pParent)
80
HRESULT CIEHtmlNode::FindFromDOMNode(nsIDOMNode *pIDOMNode, CIEHtmlNode **pHtmlNode)
82
if (pIDOMNode == nsnull)
87
if (g_NodeLookupTable == NULL)
92
nsCOMPtr<nsISupports> nodeAsSupports = do_QueryInterface(pIDOMNode);
93
*pHtmlNode = (CIEHtmlNode *) PL_HashTableLookup(g_NodeLookupTable, nodeAsSupports);
98
HRESULT CIEHtmlNode::SetDOMNode(nsIDOMNode *pIDOMNode)
102
if (g_NodeLookupTable == NULL)
104
g_NodeLookupTable = PL_NewHashTable(123, HashFunction, HashComparator, HashComparator, NULL, NULL);
107
mDOMNode = pIDOMNode;
108
nsCOMPtr<nsISupports> nodeAsSupports= do_QueryInterface(mDOMNode);
109
PL_HashTableAdd(g_NodeLookupTable, nodeAsSupports, this);
113
// Remove the entry from the hashtable
114
nsCOMPtr<nsISupports> nodeAsSupports = do_QueryInterface(mDOMNode);
115
PL_HashTableRemove(g_NodeLookupTable, nodeAsSupports);
118
if (g_NodeLookupTable->nentries == 0)
120
PL_HashTableDestroy(g_NodeLookupTable);
121
g_NodeLookupTable = NULL;