OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
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 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 const char* RetainedDOMInfo::GetLabel() | 74 const char* RetainedDOMInfo::GetLabel() |
75 { | 75 { |
76 return m_root->inDocument() ? "Document DOM tree" : "Detached DOM tree"; | 76 return m_root->inDocument() ? "Document DOM tree" : "Detached DOM tree"; |
77 } | 77 } |
78 | 78 |
79 intptr_t RetainedDOMInfo::GetElementCount() | 79 intptr_t RetainedDOMInfo::GetElementCount() |
80 { | 80 { |
81 intptr_t count = 1; | 81 intptr_t count = 1; |
82 Node* current = m_root; | 82 Node* current = m_root; |
83 while (current) { | 83 while (current) { |
84 current = NodeTraversal::next(current, m_root); | 84 current = NodeTraversal::next(*current, m_root); |
85 ++count; | 85 ++count; |
86 } | 86 } |
87 return count; | 87 return count; |
88 } | 88 } |
89 | 89 |
90 intptr_t RetainedDOMInfo::GetEquivalenceClass() | 90 intptr_t RetainedDOMInfo::GetEquivalenceClass() |
91 { | 91 { |
92 return reinterpret_cast<intptr_t>(m_root); | 92 return reinterpret_cast<intptr_t>(m_root); |
93 } | 93 } |
94 | 94 |
95 } // namespace WebCore | 95 } // namespace WebCore |
OLD | NEW |