Make Position::BeforeNode() to take const Node& instead of Node*

third_party/WebKit/Source/core/dom/Range.cpp

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All
  * rights reserved.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
@@ skipping 154 matching lines @@
 Range* Range::CreateAdjustedToTreeScope(const TreeScope& tree_scope,
                                         const Position& position) {
   DCHECK(position.IsNotNull());
   // Note: Since |Position::computeContanerNode()| returns |nullptr| if
   // |position| is |BeforeAnchor| or |AfterAnchor|.
   Node* const anchor_node = position.AnchorNode();
   if (anchor_node->GetTreeScope() == tree_scope)
     return Create(tree_scope.GetDocument(), position, position);
   Node* const shadow_host = tree_scope.AncestorInThisScope(anchor_node);
   return Range::Create(tree_scope.GetDocument(),
-                       Position::BeforeNode(shadow_host),
-                       Position::BeforeNode(shadow_host));
+                       Position::BeforeNode(*shadow_host),
+                       Position::BeforeNode(*shadow_host));
 }
 
 void Range::Dispose() {
   // A prompt detach from the owning Document helps avoid GC overhead.
   owner_document_->DetachRange(this);
 }
 
 bool Range::IsConnected() const {
   DCHECK_EQ(start_.IsConnected(), end_.IsConnected());
   return start_.IsConnected();
@@ skipping 1542 matching lines @@
                      .data()
               << "start offset: " << range->startOffset()
               << ", end offset: " << range->endOffset();
   } else {
     LOG(INFO) << "Cannot show tree if range is null, or if boundary points are "
                  "invalid.";
   }
 }
 
 #endif