2 * Copyright (C) 2011 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
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
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.
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.
32 #include "bindings/core/v8/RetainedDOMInfo.h"
34 #include "core/dom/ContainerNode.h"
35 #include "core/dom/NodeTraversal.h"
39 RetainedDOMInfo::RetainedDOMInfo(Node* root)
45 RetainedDOMInfo::~RetainedDOMInfo()
49 void RetainedDOMInfo::Dispose()
54 bool RetainedDOMInfo::IsEquivalent(v8::RetainedObjectInfo* other)
59 if (strcmp(GetLabel(), other->GetLabel()))
61 return static_cast<blink::RetainedObjectInfo*>(other)->GetEquivalenceClass() == this->GetEquivalenceClass();
64 intptr_t RetainedDOMInfo::GetHash()
66 return PtrHash<void*>::hash(m_root);
69 const char* RetainedDOMInfo::GetGroupLabel()
71 return m_root->inDocument() ? "(Document DOM trees)" : "(Detached DOM trees)";
74 const char* RetainedDOMInfo::GetLabel()
76 return m_root->inDocument() ? "Document DOM tree" : "Detached DOM tree";
79 intptr_t RetainedDOMInfo::GetElementCount()
82 for (Node& current : NodeTraversal::descendantsOf(*m_root)) {
83 ALLOW_UNUSED_LOCAL(current);
89 intptr_t RetainedDOMInfo::GetEquivalenceClass()
91 return reinterpret_cast<intptr_t>(m_root);
94 ActiveDOMObjectsInfo::ActiveDOMObjectsInfo(int numberOfObjectsWithPendingActivity)
95 : m_numberOfObjectsWithPendingActivity(numberOfObjectsWithPendingActivity)
99 ActiveDOMObjectsInfo::~ActiveDOMObjectsInfo()
103 void ActiveDOMObjectsInfo::Dispose()
108 bool ActiveDOMObjectsInfo::IsEquivalent(v8::RetainedObjectInfo* other)
110 return this == other;
113 intptr_t ActiveDOMObjectsInfo::GetHash()
115 return PtrHash<void*>::hash(this);
118 const char* ActiveDOMObjectsInfo::GetGroupLabel()
120 return "(Pending activities group)";
123 const char* ActiveDOMObjectsInfo::GetLabel()
125 return "Pending activities";
128 intptr_t ActiveDOMObjectsInfo::GetElementCount()
130 return m_numberOfObjectsWithPendingActivity;
133 intptr_t ActiveDOMObjectsInfo::GetEquivalenceClass()
135 return reinterpret_cast<intptr_t>(this);