Lines Matching refs:node
42 void TreeWalker::setCurrentNode(PassRefPtrWillBeRawPtr<Node> node, ExceptionState& exceptionState)
44 if (!node) {
48 m_current = node;
51 inline Node* TreeWalker::setCurrent(PassRefPtrWillBeRawPtr<Node> node)
53 m_current = node;
59 RefPtrWillBeRawPtr<Node> node = m_current;
60 while (node != root()) {
61 node = node->parentNode();
62 if (!node)
64 short acceptNodeResult = acceptNode(node.get(), exceptionState);
68 return setCurrent(node.release());
75 for (RefPtrWillBeRawPtr<Node> node = m_current->firstChild(); node; ) {
76 short acceptNodeResult = acceptNode(node.get(), exceptionState);
81 m_current = node.release();
84 if (node->hasChildren()) {
85 node = node->firstChild();
93 if (node->nextSibling()) {
94 node = node->nextSibling();
97 ContainerNode* parent = node->parentNode();
100 node = parent;
101 } while (node);
108 for (RefPtrWillBeRawPtr<Node> node = m_current->lastChild(); node; ) {
109 short acceptNodeResult = acceptNode(node.get(), exceptionState);
114 m_current = node.release();
117 if (node->lastChild()) {
118 node = node->lastChild();
126 if (node->previousSibling()) {
127 node = node->previousSibling();
130 ContainerNode* parent = node->parentNode();
133 node = parent;
134 } while (node);
141 RefPtrWillBeRawPtr<Node> node = m_current;
142 if (node == root())
145 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
156 node = sibling;
165 node = node->parentNode();
166 if (!node || node == root())
168 short acceptNodeResult = acceptNode(node.get(), exceptionState);
178 RefPtrWillBeRawPtr<Node> node = m_current;
179 if (node == root())
182 for (RefPtrWillBeRawPtr<Node> sibling = node->nextSibling(); sibling; ) {
193 node = sibling;
202 node = node->parentNode();
203 if (!node || node == root())
205 short acceptNodeResult = acceptNode(node.get(), exceptionState);
215 RefPtrWillBeRawPtr<Node> node = m_current;
216 while (node != root()) {
217 while (Node* previousSibling = node->previousSibling()) {
218 node = previousSibling;
219 short acceptNodeResult = acceptNode(node.get(), exceptionState);
224 while (Node* lastChild = node->lastChild()) {
225 node = lastChild;
226 acceptNodeResult = acceptNode(node.get(), exceptionState);
233 m_current = node.release();
237 if (node == root())
239 ContainerNode* parent = node->parentNode();
242 node = parent;
243 short acceptNodeResult = acceptNode(node.get(), exceptionState);
247 return setCurrent(node.release());
254 RefPtrWillBeRawPtr<Node> node = m_current;
256 while (Node* firstChild = node->firstChild()) {
257 node = firstChild;
258 short acceptNodeResult = acceptNode(node.get(), exceptionState);
262 return setCurrent(node.release());
266 while (Node* nextSibling = NodeTraversal::nextSkippingChildren(*node, root())) {
267 node = nextSibling;
268 short acceptNodeResult = acceptNode(node.get(), exceptionState);
272 return setCurrent(node.release());