Lines Matching refs:CounterNode
23 #include "CounterNode.h"
31 CounterNode::CounterNode(RenderObject* o, bool hasResetType, int value)
44 CounterNode* CounterNode::nextInPreOrderAfterChildren(const CounterNode* stayWithin) const
49 const CounterNode* current = this;
50 CounterNode* next;
59 CounterNode* CounterNode::nextInPreOrder(const CounterNode* stayWithin) const
61 if (CounterNode* next = m_firstChild)
67 CounterNode* CounterNode::lastDescendant() const
69 CounterNode* last = m_lastChild;
73 while (CounterNode* lastChild = last->m_lastChild)
79 CounterNode* CounterNode::previousInPreOrder() const
81 CounterNode* previous = m_previousSibling;
85 while (CounterNode* lastChild = previous->m_lastChild)
91 int CounterNode::computeCountInParent() const
100 void CounterNode::resetRenderer(const AtomicString& identifier) const
108 void CounterNode::resetRenderers(const AtomicString& identifier) const
110 const CounterNode* node = this;
117 void CounterNode::recount(const AtomicString& identifier)
119 for (CounterNode* node = this; node; node = node->m_nextSibling) {
129 void CounterNode::insertAfter(CounterNode* newChild, CounterNode* refChild, const AtomicString& identifier)
142 CounterNode* next;
174 CounterNode* last = newChild->m_lastChild;
175 CounterNode* first = newChild->m_firstChild;
205 void CounterNode::removeChild(CounterNode* oldChild, const AtomicString& identifier)
211 CounterNode* next = oldChild->m_nextSibling;
212 CounterNode* previous = oldChild->m_previousSibling;
238 static void showTreeAndMark(const CounterNode* node)
240 const CounterNode* root = node;
244 for (const CounterNode* current = root; current; current = current->nextInPreOrder()) {
246 for (const CounterNode* parent = current; parent && parent != root; parent = parent->parent())
261 void showTree(const WebCore::CounterNode* counter)
