Lines Matching refs:node
43 void TreeWalker::setCurrentNode(PassRefPtrWillBeRawPtr<Node> node, ExceptionState& exceptionState)
45 if (!node) {
49 m_current = node;
52 inline Node* TreeWalker::setCurrent(PassRefPtrWillBeRawPtr<Node> node)
54 m_current = node;
60 RefPtrWillBeRawPtr<Node> node = m_current;
61 while (node != root()) {
62 node = node->parentNode();
63 if (!node)
65 short acceptNodeResult = acceptNode(node.get(), exceptionState);
69 return setCurrent(node.release());
76 for (RefPtrWillBeRawPtr<Node> node = m_current->firstChild(); node; ) {
77 short acceptNodeResult = acceptNode(node.get(), exceptionState);
82 m_current = node.release();
85 if (node->firstChild()) {
86 node = node->firstChild();
94 if (node->nextSibling()) {
95 node = node->nextSibling();
98 ContainerNode* parent = node->parentNode();
101 node = parent;
102 } while (node);
109 for (RefPtrWillBeRawPtr<Node> node = m_current->lastChild(); node; ) {
110 short acceptNodeResult = acceptNode(node.get(), exceptionState);
115 m_current = node.release();
118 if (node->lastChild()) {
119 node = node->lastChild();
127 if (node->previousSibling()) {
128 node = node->previousSibling();
131 ContainerNode* parent = node->parentNode();
134 node = parent;
135 } while (node);
142 RefPtrWillBeRawPtr<Node> node = m_current;
143 if (node == root())
146 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
157 node = sibling;
166 node = node->parentNode();
167 if (!node || node == root())
169 short acceptNodeResult = acceptNode(node.get(), exceptionState);
179 RefPtrWillBeRawPtr<Node> node = m_current;
180 if (node == root())
183 for (RefPtrWillBeRawPtr<Node> sibling = node->nextSibling(); sibling; ) {
194 node = sibling;
203 node = node->parentNode();
204 if (!node || node == root())
206 short acceptNodeResult = acceptNode(node.get(), exceptionState);
216 RefPtrWillBeRawPtr<Node> node = m_current;
217 while (node != root()) {
218 while (Node* previousSibling = node->previousSibling()) {
219 node = previousSibling;
220 short acceptNodeResult = acceptNode(node.get(), exceptionState);
225 while (Node* lastChild = node->lastChild()) {
226 node = lastChild;
227 acceptNodeResult = acceptNode(node.get(), exceptionState);
234 m_current = node.release();
238 if (node == root())
240 ContainerNode* parent = node->parentNode();
243 node = parent;
244 short acceptNodeResult = acceptNode(node.get(), exceptionState);
248 return setCurrent(node.release());
255 RefPtrWillBeRawPtr<Node> node = m_current;
257 while (Node* firstChild = node->firstChild()) {
258 node = firstChild;
259 short acceptNodeResult = acceptNode(node.get(), exceptionState);
263 return setCurrent(node.release());
267 while (Node* nextSibling = NodeTraversal::nextSkippingChildren(*node, root())) {
268 node = nextSibling;
269 short acceptNodeResult = acceptNode(node.get(), exceptionState);
273 return setCurrent(node.release());