Lines Matching refs:current
34 Node* previousIncludingPseudo(const Node* current, const Node* stayWithin)
37 if (current == stayWithin)
39 if ((previous = current->pseudoAwarePreviousSibling())) {
44 return current->isPseudoElement() ? toPseudoElement(current)->hostElement() : current->parentNode();
47 Node* nextIncludingPseudo(const Node* current, const Node* stayWithin)
50 if ((next = current->pseudoAwareFirstChild()))
52 if (current == stayWithin)
54 if ((next = current->pseudoAwareNextSibling()))
56 current = current->isPseudoElement() ? toPseudoElement(current)->hostElement() : current->parentNode();
57 for (; current; current = current->parentNode()) {
58 if (current == stayWithin)
60 if ((next = current->pseudoAwareNextSibling()))
66 Node* nextIncludingPseudoSkippingChildren(const Node* current, const Node* stayWithin)
69 if (current == stayWithin)
71 if ((next = current->pseudoAwareNextSibling()))
73 current = current->isPseudoElement() ? toPseudoElement(current)->hostElement() : current->parentNode();
74 for (; current; current = current->parentNode()) {
75 if (current == stayWithin)
77 if ((next = current->pseudoAwareNextSibling()))
83 Node* nextAncestorSibling(const Node* current)
85 ASSERT(!current->nextSibling());
86 for (current = current->parentNode(); current; current = current->parentNode()) {
87 if (current->nextSibling())
88 return current->nextSibling();
93 Node* nextAncestorSibling(const Node* current, const Node* stayWithin)
95 ASSERT(!current->nextSibling());
96 ASSERT(current != stayWithin);
97 for (current = current->parentNode(); current; current = current->parentNode()) {
98 if (current == stayWithin)
100 if (current->nextSibling())
101 return current->nextSibling();
106 Node* last(const ContainerNode* current)
108 Node* node = current->lastChild();
123 Node* previousSkippingChildren(const Node* current, const Node* stayWithin)
125 if (current == stayWithin)
127 if (current->previousSibling())
128 return current->previousSibling();
129 for (current = current->parentNode(); current; current = current->parentNode()) {
130 if (current == stayWithin)
132 if (current->previousSibling())
133 return current->previousSibling();
138 Node* nextPostOrder(const Node* current, const Node* stayWithin)
140 if (current == stayWithin)
142 if (!current->nextSibling())
143 return current->parentNode();
144 Node* next = current->nextSibling();
150 static Node* previousAncestorSiblingPostOrder(const Node* current, const Node* stayWithin)
152 ASSERT(!current->previousSibling());
153 for (current = current->parentNode(); current; current = current->parentNode()) {
154 if (current == stayWithin)
156 if (current->previousSibling())
157 return current->previousSibling();
162 Node* previousPostOrder(const Node* current, const Node* stayWithin)
164 if (current->lastChild())
165 return current->lastChild();
166 if (current == stayWithin)
168 if (current->previousSibling())
169 return current->previousSibling();
170 return previousAncestorSiblingPostOrder(current, stayWithin);
173 Node* previousSkippingChildrenPostOrder(const Node* current, const Node* stayWithin)
175 if (current == stayWithin)
177 if (current->previousSibling())
178 return current->previousSibling();
179 return previousAncestorSiblingPostOrder(current, stayWithin);