| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 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. | |
| 29 */ | |
| 30 | |
| 31 #include "config.h" | |
| 32 #include "bindings/v8/RetainedDOMInfo.h" | |
| 33 | |
| 34 #include "core/dom/ContainerNode.h" | |
| 35 #include "core/dom/NodeTraversal.h" | |
| 36 | |
| 37 namespace WebCore { | |
| 38 | |
| 39 RetainedDOMInfo::RetainedDOMInfo(Node* root) | |
| 40 : m_root(root) | |
| 41 { | |
| 42 ASSERT(m_root); | |
| 43 } | |
| 44 | |
| 45 RetainedDOMInfo::~RetainedDOMInfo() | |
| 46 { | |
| 47 } | |
| 48 | |
| 49 void RetainedDOMInfo::Dispose() | |
| 50 { | |
| 51 delete this; | |
| 52 } | |
| 53 | |
| 54 bool RetainedDOMInfo::IsEquivalent(v8::RetainedObjectInfo* other) | |
| 55 { | |
| 56 ASSERT(other); | |
| 57 if (other == this) | |
| 58 return true; | |
| 59 if (strcmp(GetLabel(), other->GetLabel())) | |
| 60 return false; | |
| 61 return static_cast<WebCore::RetainedObjectInfo*>(other)->GetEquivalenceClass
() == this->GetEquivalenceClass(); | |
| 62 } | |
| 63 | |
| 64 intptr_t RetainedDOMInfo::GetHash() | |
| 65 { | |
| 66 return PtrHash<void*>::hash(m_root); | |
| 67 } | |
| 68 | |
| 69 const char* RetainedDOMInfo::GetGroupLabel() | |
| 70 { | |
| 71 return m_root->inDocument() ? "(Document DOM trees)" : "(Detached DOM trees)
"; | |
| 72 } | |
| 73 | |
| 74 const char* RetainedDOMInfo::GetLabel() | |
| 75 { | |
| 76 return m_root->inDocument() ? "Document DOM tree" : "Detached DOM tree"; | |
| 77 } | |
| 78 | |
| 79 intptr_t RetainedDOMInfo::GetElementCount() | |
| 80 { | |
| 81 intptr_t count = 1; | |
| 82 Node* current = m_root; | |
| 83 while (current) { | |
| 84 current = NodeTraversal::next(*current, m_root); | |
| 85 ++count; | |
| 86 } | |
| 87 return count; | |
| 88 } | |
| 89 | |
| 90 intptr_t RetainedDOMInfo::GetEquivalenceClass() | |
| 91 { | |
| 92 return reinterpret_cast<intptr_t>(m_root); | |
| 93 } | |
| 94 | |
| 95 } // namespace WebCore | |
| OLD | NEW |