Code cleanup #1 in core/dom/

Source/core/dom/TreeWalker.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * Copyright (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)
  * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 59 matching lines @@
     return 0;
 }
 
 Node* TreeWalker::firstChild(ExceptionState& exceptionState)
 {
     for (RefPtrWillBeRawPtr<Node> node = m_current->firstChild(); node; ) {
         unsigned acceptNodeResult = acceptNode(node.get(), exceptionState);
         if (exceptionState.hadException())
             return 0;
         switch (acceptNodeResult) {
-            case NodeFilter::FILTER_ACCEPT:
-                m_current = node.release();
-                return m_current.get();
-            case NodeFilter::FILTER_SKIP:
-                if (node->hasChildren()) {
-                    node = node->firstChild();
-                    continue;
-                }
-                break;
-            case NodeFilter::FILTER_REJECT:
-                break;
+        case NodeFilter::FILTER_ACCEPT:
+            m_current = node.release();
+            return m_current.get();
+        case NodeFilter::FILTER_SKIP:
+            if (node->hasChildren()) {
+                node = node->firstChild();
+                continue;
+            }
+            break;
+        case NodeFilter::FILTER_REJECT:
+            break;
         }
         do {
             if (node->nextSibling()) {
                 node = node->nextSibling();
                 break;
             }
             ContainerNode* parent = node->parentNode();
             if (!parent || parent == root() || parent == m_current)
                 return 0;
             node = parent;
         } while (node);
     }
     return 0;
 }
 
 Node* TreeWalker::lastChild(ExceptionState& exceptionState)
 {
     for (RefPtrWillBeRawPtr<Node> node = m_current->lastChild(); node; ) {
         unsigned acceptNodeResult = acceptNode(node.get(), exceptionState);
         if (exceptionState.hadException())
             return 0;
         switch (acceptNodeResult) {
-            case NodeFilter::FILTER_ACCEPT:
-                m_current = node.release();
-                return m_current.get();
-            case NodeFilter::FILTER_SKIP:
-                if (node->lastChild()) {
-                    node = node->lastChild();
-                    continue;
-                }
-                break;
-            case NodeFilter::FILTER_REJECT:
-                break;
+        case NodeFilter::FILTER_ACCEPT:
+            m_current = node.release();
+            return m_current.get();
+        case NodeFilter::FILTER_SKIP:
+            if (node->lastChild()) {
+                node = node->lastChild();
+                continue;
+            }
+            break;
+        case NodeFilter::FILTER_REJECT:
+            break;
         }
         do {
             if (node->previousSibling()) {
                 node = node->previousSibling();
                 break;
             }
             ContainerNode* parent = node->parentNode();
             if (!parent || parent == root() || parent == m_current)
                 return 0;
             node = parent;
         } while (node);
     }
     return 0;
 }
 
 Node* TreeWalker::previousSibling(ExceptionState& exceptionState)
 {
     RefPtrWillBeRawPtr<Node> node = m_current;
     if (node == root())
         return 0;
     while (1) {
         for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
             unsigned acceptNodeResult = acceptNode(sibling.get(), exceptionState);
             if (exceptionState.hadException())
                 return 0;
             switch (acceptNodeResult) {
-                case NodeFilter::FILTER_ACCEPT:
-                    m_current = sibling.release();
-                    return m_current.get();
-                case NodeFilter::FILTER_SKIP:
-                    if (sibling->lastChild()) {
-                        sibling = sibling->lastChild();
-                        node = sibling;
-                        continue;
-                    }
-                    break;
-                case NodeFilter::FILTER_REJECT:
-                    break;
+            case NodeFilter::FILTER_ACCEPT:
+                m_current = sibling.release();
+                return m_current.get();
+            case NodeFilter::FILTER_SKIP:
+                if (sibling->lastChild()) {
+                    sibling = sibling->lastChild();
+                    node = sibling;
+                    continue;
+                }
+                break;
+            case NodeFilter::FILTER_REJECT:
+                break;
             }
             sibling = sibling->previousSibling();
         }
         node = node->parentNode();
         if (!node || node == root())
             return 0;
         unsigned acceptNodeResult = acceptNode(node.get(), exceptionState);
         if (exceptionState.hadException())
             return 0;
         if (acceptNodeResult == NodeFilter::FILTER_ACCEPT)
             return 0;
     }
 }
 
 Node* TreeWalker::nextSibling(ExceptionState& exceptionState)
 {
     RefPtrWillBeRawPtr<Node> node = m_current;
     if (node == root())
         return 0;
     while (1) {
         for (RefPtrWillBeRawPtr<Node> sibling = node->nextSibling(); sibling; ) {
             unsigned acceptNodeResult = acceptNode(sibling.get(), exceptionState);
             if (exceptionState.hadException())
                 return 0;
             switch (acceptNodeResult) {
-                case NodeFilter::FILTER_ACCEPT:
-                    m_current = sibling.release();
-                    return m_current.get();
-                case NodeFilter::FILTER_SKIP:
-                    if (sibling->hasChildren()) {
-                        sibling = sibling->firstChild();
-                        node = sibling;
-                        continue;
-                    }
-                    break;
-                case NodeFilter::FILTER_REJECT:
-                    break;
+            case NodeFilter::FILTER_ACCEPT:
+                m_current = sibling.release();
+                return m_current.get();
+            case NodeFilter::FILTER_SKIP:
+                if (sibling->hasChildren()) {
+                    sibling = sibling->firstChild();
+                    node = sibling;
+                    continue;
+                }
+                break;
+            case NodeFilter::FILTER_REJECT:
+                break;
             }
             sibling = sibling->nextSibling();
         }
         node = node->parentNode();
         if (!node || node == root())
             return 0;
         unsigned acceptNodeResult = acceptNode(node.get(), exceptionState);
         if (exceptionState.hadException())
             return 0;
         if (acceptNodeResult == NodeFilter::FILTER_ACCEPT)
@@ skipping 67 matching lines @@
     return 0;
 }
 
 DEFINE_TRACE(TreeWalker)
 {
     visitor->trace(m_current);
     NodeIteratorBase::trace(visitor);
 }
 
 } // namespace blink