OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 11 matching lines...) Expand all Loading... |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 #include "DocumentOrderedMap.h" | 32 #include "core/dom/DocumentOrderedMap.h" |
33 | 33 |
34 #include "Element.h" | |
35 #include "HTMLMapElement.h" | 34 #include "HTMLMapElement.h" |
36 #include "HTMLNames.h" | 35 #include "HTMLNames.h" |
37 #include "NodeTraversal.h" | 36 #include "core/dom/Element.h" |
38 #include "TreeScope.h" | 37 #include "core/dom/NodeTraversal.h" |
39 #include "WebCoreMemoryInstrumentation.h" | 38 #include "core/dom/TreeScope.h" |
| 39 #include "core/dom/WebCoreMemoryInstrumentation.h" |
40 #include <wtf/MemoryInstrumentationHashCountedSet.h> | 40 #include <wtf/MemoryInstrumentationHashCountedSet.h> |
41 #include <wtf/MemoryInstrumentationHashMap.h> | 41 #include <wtf/MemoryInstrumentationHashMap.h> |
42 | 42 |
43 namespace WebCore { | 43 namespace WebCore { |
44 | 44 |
45 using namespace HTMLNames; | 45 using namespace HTMLNames; |
46 | 46 |
47 inline bool keyMatchesId(AtomicStringImpl* key, Element* element) | 47 inline bool keyMatchesId(AtomicStringImpl* key, Element* element) |
48 { | 48 { |
49 return element->getIdAttribute().impl() == key; | 49 return element->getIdAttribute().impl() == key; |
(...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
161 } | 161 } |
162 | 162 |
163 void DocumentOrderedMap::reportMemoryUsage(MemoryObjectInfo* memoryObjectInfo) c
onst | 163 void DocumentOrderedMap::reportMemoryUsage(MemoryObjectInfo* memoryObjectInfo) c
onst |
164 { | 164 { |
165 MemoryClassInfo info(memoryObjectInfo, this, WebCoreMemoryTypes::DOM); | 165 MemoryClassInfo info(memoryObjectInfo, this, WebCoreMemoryTypes::DOM); |
166 info.addMember(m_map, "map"); | 166 info.addMember(m_map, "map"); |
167 info.addMember(m_duplicateCounts, "duplicateCounts"); | 167 info.addMember(m_duplicateCounts, "duplicateCounts"); |
168 } | 168 } |
169 | 169 |
170 } // namespace WebCore | 170 } // namespace WebCore |
OLD | NEW |