Move out DidStartProvisionalLoad from WebContentsImpl into Navigator.

content/browser/frame_host/frame_tree_unittest.cc

 // Copyright 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "content/browser/frame_host/frame_tree.h"
 
 #include "base/run_loop.h"
 #include "base/strings/string_number_conversions.h"
 #include "content/browser/frame_host/navigator_impl.h"
 #include "content/browser/frame_host/render_frame_host_factory.h"
@@ skipping 92 matching lines @@
 
   std::string no_children_node("no children node");
   std::string deep_subtree("node with deep subtree");
 
   // Ensure the top-level node of the FrameTree is initialized by simulating a
   // main frame swap here.
   scoped_ptr<RenderFrameHostImpl> render_frame_host =
       RenderFrameHostFactory::Create(static_cast<RenderViewHostImpl*>(rvh()),
                                      NULL,
                                      &frame_tree,
+                                     frame_tree.root(),
                                      process()->GetNextRoutingID(),
                                      false);
   frame_tree.SwapMainFrame(render_frame_host.get());
   frame_tree.OnFirstNavigationAfterSwap(5);
 
   ASSERT_EQ("5: []", GetTreeState(&frame_tree));
 
   // Simulate attaching a series of frames to build the frame tree.
   frame_tree.AddFrame(process()->GetNextRoutingID(), 5, 14, std::string());
   frame_tree.AddFrame(process()->GetNextRoutingID(), 5, 15, std::string());
@@ skipping 21 matching lines @@
 
   // Now that's it's fully built, verify the tree structure is as expected.
   ASSERT_EQ("5: [14: [244: [], 245: []], "
                 "15: [255 'no children node': []], "
                 "16: [264: [], 265: [], 266: [], "
                      "267 'node with deep subtree': "
                          "[365: [455: [555: [655: []]]]], 268: []]]",
             GetTreeState(&frame_tree));
 
   // Test removing of nodes.
-  frame_tree.RemoveFrame(555, 655);
+  frame_tree.RemoveFrame(NULL, 555, 655);
   ASSERT_EQ("5: [14: [244: [], 245: []], "
                 "15: [255 'no children node': []], "
                 "16: [264: [], 265: [], 266: [], "
                      "267 'node with deep subtree': "
                          "[365: [455: [555: []]]], 268: []]]",
             GetTreeState(&frame_tree));
 
-  frame_tree.RemoveFrame(16, 265);
+  frame_tree.RemoveFrame(NULL, 16, 265);
   ASSERT_EQ("5: [14: [244: [], 245: []], "
                 "15: [255 'no children node': []], "
                 "16: [264: [], 266: [], "
                      "267 'node with deep subtree': "
                          "[365: [455: [555: []]]], 268: []]]",
             GetTreeState(&frame_tree));
 
-  frame_tree.RemoveFrame(5, 15);
+  frame_tree.RemoveFrame(NULL, 5, 15);
   ASSERT_EQ("5: [14: [244: [], 245: []], "
                 "16: [264: [], 266: [], "
                      "267 'node with deep subtree': "
                          "[365: [455: [555: []]]], 268: []]]",
             GetTreeState(&frame_tree));
 }
 
 }  // namespace
 }  // namespace content