OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2006, 2007, 2008, 2010 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004, 2006, 2007, 2008, 2010 Apple Inc. All rights reserved. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
11 * | 11 * |
12 * This library is distributed in the hope that it will be useful, | 12 * This library is distributed in the hope that it will be useful, |
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
15 * Library General Public License for more details. | 15 * Library General Public License for more details. |
16 * | 16 * |
17 * You should have received a copy of the GNU Library General Public License | 17 * You should have received a copy of the GNU Library General Public License |
18 * along with this library; see the file COPYING.LIB. If not, write to | 18 * along with this library; see the file COPYING.LIB. If not, write to |
19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
20 * Boston, MA 02110-1301, USA. | 20 * Boston, MA 02110-1301, USA. |
21 */ | 21 */ |
22 | 22 |
23 #include "config.h" | 23 #include "config.h" |
24 #include "LiveNodeList.h" | 24 #include "LiveNodeList.h" |
25 | 25 |
26 #include "Document.h" | 26 #include "Document.h" |
27 #include "Element.h" | 27 #include "Element.h" |
28 #include "HTMLCollection.h" | 28 #include "HTMLCollection.h" |
29 #include "WebCoreMemoryInstrumentation.h" | |
30 | 29 |
31 namespace WebCore { | 30 namespace WebCore { |
32 | 31 |
33 Node* LiveNodeListBase::rootNode() const | 32 Node* LiveNodeListBase::rootNode() const |
34 { | 33 { |
35 if (isRootedAtDocument() && m_ownerNode->inDocument()) | 34 if (isRootedAtDocument() && m_ownerNode->inDocument()) |
36 return m_ownerNode->document(); | 35 return m_ownerNode->document(); |
37 return m_ownerNode.get(); | 36 return m_ownerNode.get(); |
38 } | 37 } |
39 | 38 |
(...skipping 22 matching lines...) Expand all Loading... |
62 } | 61 } |
63 | 62 |
64 void LiveNodeListBase::invalidateIdNameCacheMaps() const | 63 void LiveNodeListBase::invalidateIdNameCacheMaps() const |
65 { | 64 { |
66 ASSERT(hasIdNameCache()); | 65 ASSERT(hasIdNameCache()); |
67 const HTMLCollection* cacheBase = static_cast<const HTMLCollection*>(this); | 66 const HTMLCollection* cacheBase = static_cast<const HTMLCollection*>(this); |
68 cacheBase->m_idCache.clear(); | 67 cacheBase->m_idCache.clear(); |
69 cacheBase->m_nameCache.clear(); | 68 cacheBase->m_nameCache.clear(); |
70 } | 69 } |
71 | 70 |
72 void LiveNodeListBase::reportMemoryUsage(MemoryObjectInfo* memoryObjectInfo) con
st | |
73 { | |
74 MemoryClassInfo info(memoryObjectInfo, this, WebCoreMemoryTypes::DOM); | |
75 NodeList::reportMemoryUsage(memoryObjectInfo); | |
76 info.addMember(m_ownerNode, "ownerNode"); | |
77 info.addWeakPointer(m_cachedItem); | |
78 } | |
79 | |
80 Node* LiveNodeList::namedItem(const AtomicString& elementId) const | 71 Node* LiveNodeList::namedItem(const AtomicString& elementId) const |
81 { | 72 { |
82 Node* rootNode = this->rootNode(); | 73 Node* rootNode = this->rootNode(); |
83 | 74 |
84 if (rootNode->inDocument()) { | 75 if (rootNode->inDocument()) { |
85 Element* element = rootNode->treeScope()->getElementById(elementId); | 76 Element* element = rootNode->treeScope()->getElementById(elementId); |
86 if (element && nodeMatches(element) && element->isDescendantOf(rootNode)
) | 77 if (element && nodeMatches(element) && element->isDescendantOf(rootNode)
) |
87 return element; | 78 return element; |
88 if (!element) | 79 if (!element) |
89 return 0; | 80 return 0; |
90 // In the case of multiple nodes with the same name, just fall through. | 81 // In the case of multiple nodes with the same name, just fall through. |
91 } | 82 } |
92 | 83 |
93 unsigned length = this->length(); | 84 unsigned length = this->length(); |
94 for (unsigned i = 0; i < length; i++) { | 85 for (unsigned i = 0; i < length; i++) { |
95 Node* node = item(i); | 86 Node* node = item(i); |
96 // FIXME: This should probably be using getIdAttribute instead of idForS
tyleResolution. | 87 // FIXME: This should probably be using getIdAttribute instead of idForS
tyleResolution. |
97 if (node->hasID() && toElement(node)->idForStyleResolution() == elementI
d) | 88 if (node->hasID() && toElement(node)->idForStyleResolution() == elementI
d) |
98 return node; | 89 return node; |
99 } | 90 } |
100 | 91 |
101 return 0; | 92 return 0; |
102 } | 93 } |
103 | 94 |
104 } // namespace WebCore | 95 } // namespace WebCore |
OLD | NEW |