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, 2007, 2008 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004, 2007, 2008 Apple Inc. All rights reserved. |
6 * Copyright (C) 2014 Samsung Electronics. All rights reserved. | 6 * Copyright (C) 2014 Samsung Electronics. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 23 matching lines...) Expand all Loading... | |
34 { | 34 { |
35 } | 35 } |
36 | 36 |
37 Node* ChildNodeList::virtualOwnerNode() const | 37 Node* ChildNodeList::virtualOwnerNode() const |
38 { | 38 { |
39 return &ownerNode(); | 39 return &ownerNode(); |
40 } | 40 } |
41 | 41 |
42 ChildNodeList::~ChildNodeList() | 42 ChildNodeList::~ChildNodeList() |
43 { | 43 { |
44 #if !ENABLE(OILPAN) | |
44 m_parent->nodeLists()->removeChildNodeList(this); | 45 m_parent->nodeLists()->removeChildNodeList(this); |
46 #endif | |
45 } | 47 } |
46 | 48 |
47 Node* ChildNodeList::traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned& currentOffset) const | 49 Node* ChildNodeList::traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned& currentOffset) const |
48 { | 50 { |
49 ASSERT(currentOffset < offset); | 51 ASSERT(currentOffset < offset); |
50 Node* next = ¤tNode; | 52 Node* next = ¤tNode; |
51 while ((next = next->nextSibling())) { | 53 while ((next = next->nextSibling())) { |
52 if (++currentOffset == offset) | 54 if (++currentOffset == offset) |
53 return next; | 55 return next; |
54 } | 56 } |
55 return 0; | 57 return 0; |
56 } | 58 } |
57 | 59 |
58 Node* ChildNodeList::traverseBackwardToOffset(unsigned offset, Node& currentNode , unsigned& currentOffset) const | 60 Node* ChildNodeList::traverseBackwardToOffset(unsigned offset, Node& currentNode , unsigned& currentOffset) const |
59 { | 61 { |
60 ASSERT(currentOffset > offset); | 62 ASSERT(currentOffset > offset); |
61 Node* previous = ¤tNode; | 63 Node* previous = ¤tNode; |
62 while ((previous = previous->previousSibling())) { | 64 while ((previous = previous->previousSibling())) { |
63 if (--currentOffset == offset) | 65 if (--currentOffset == offset) |
64 return previous; | 66 return previous; |
65 } | 67 } |
66 return 0; | 68 return 0; |
67 } | 69 } |
68 | 70 |
71 void ChildNodeList::trace(Visitor* visitor) | |
72 { | |
73 visitor->trace(m_parent); | |
74 m_collectionIndexCache.traceAfterDispatch(visitor); | |
Mads Ager (chromium)
2014/05/15 10:54:24
This should just be visitor->trace(m_collectionInd
sof
2014/05/15 22:15:57
Thanks, switched to trace().
| |
75 NodeList::trace(visitor); | |
76 } | |
77 | |
69 } // namespace WebCore | 78 } // namespace WebCore |
OLD | NEW |