Have NodeTraversal::previous*() take a reference

Source/core/dom/NodeIterator.cpp

Index: Source/core/dom/NodeIterator.cpp
diff --git a/Source/core/dom/NodeIterator.cpp b/Source/core/dom/NodeIterator.cpp
index 348df6955d3243569c24f20f4e1b3ec9a90bd59d..66cf2b683eb0bd69bcdab0b51af8023b0e896dd0 100644
--- a/Source/core/dom/NodeIterator.cpp
+++ b/Source/core/dom/NodeIterator.cpp
@@ -70,7 +70,7 @@ bool NodeIterator::NodePointer::moveToPrevious(Node* root)
         isPointerBeforeNode = true;
         return true;
     }
-    node = NodeTraversal::previous(node.get(), root);
+    node = NodeTraversal::previous(*node, root);
     return node;
 }
 
@@ -183,13 +183,13 @@ void NodeIterator::updateForNodeRemoval(Node& removedNode, NodePointer& referenc
             if (node)
                 referenceNode.node = node;
         } else {
-            node = NodeTraversal::previous(&removedNode, root());
+            node = NodeTraversal::previous(removedNode, root());
             if (node) {
                 // Move out from under the node being removed if the reference node is
                 // a descendant of the node being removed.
                 if (willRemoveReferenceNodeAncestor) {
                     while (node && node->isDescendantOf(&removedNode))
-                        node = NodeTraversal::previous(node, root());
+                        node = NodeTraversal::previous(*node, root());
                 }
                 if (node) {
                     // Removing last node.
@@ -201,13 +201,13 @@ void NodeIterator::updateForNodeRemoval(Node& removedNode, NodePointer& referenc
             }
         }
     } else {
-        Node* node = NodeTraversal::previous(&removedNode, root());
+        Node* node = NodeTraversal::previous(removedNode, root());
         if (node) {
             // Move out from under the node being removed if the reference node is
             // a descendant of the node being removed.
             if (willRemoveReferenceNodeAncestor) {
                 while (node && node->isDescendantOf(&removedNode))
-                    node = NodeTraversal::previous(node, root());
+                    node = NodeTraversal::previous(*node, root());
             }
             if (node)
                 referenceNode.node = node;
@@ -218,7 +218,7 @@ void NodeIterator::updateForNodeRemoval(Node& removedNode, NodePointer& referenc
             // a descendant of the node being removed.
             if (willRemoveReferenceNodeAncestor) {
                 while (node && node->isDescendantOf(&removedNode))
-                    node = NodeTraversal::previous(node, root());
+                    node = NodeTraversal::previous(*node, root());
             }
             if (node)
                 referenceNode.node = node;