Switch to use SharedBitmapManager all the time in cc_unittests

cc/trees/layer_sorter_unittest.cc

 // Copyright 2011 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 "cc/trees/layer_sorter.h"
 
 #include "cc/base/math_util.h"
 #include "cc/layers/layer_impl.h"
 #include "cc/test/fake_impl_proxy.h"
 #include "cc/test/fake_layer_tree_host_impl.h"
+#include "cc/test/test_shared_bitmap_manager.h"
 #include "cc/trees/single_thread_proxy.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "ui/gfx/transform.h"
 
 namespace cc {
 namespace {
 
 // Note: In the following overlap tests, the "camera" is looking down the
 // negative Z axis, meaning that layers with smaller z values (more negative)
 // are further from the camera and therefore must be drawn before layers with
@@ skipping 182 matching lines @@
 
   // Input list of layers: [1, 2, 3, 4, 5].
   // Expected output: [3, 4, 1, 2, 5].
   //    - 1, 2, and 5 do not have a 3d z difference, and therefore their
   //      relative ordering should be retained.
   //    - 3 and 4 do not have a 3d z difference, and therefore their relative
   //      ordering should be retained.
   //    - 3 and 4 should be re-sorted so they are in front of 1, 2, and 5.
 
   FakeImplProxy proxy;
-  FakeLayerTreeHostImpl host_impl(&proxy);
+  TestSharedBitmapManager shared_bitmap_manager;
+  FakeLayerTreeHostImpl host_impl(&proxy, &shared_bitmap_manager);
 
   scoped_ptr<LayerImpl> layer1 = LayerImpl::Create(host_impl.active_tree(), 1);
   scoped_ptr<LayerImpl> layer2 = LayerImpl::Create(host_impl.active_tree(), 2);
   scoped_ptr<LayerImpl> layer3 = LayerImpl::Create(host_impl.active_tree(), 3);
   scoped_ptr<LayerImpl> layer4 = LayerImpl::Create(host_impl.active_tree(), 4);
   scoped_ptr<LayerImpl> layer5 = LayerImpl::Create(host_impl.active_tree(), 5);
 
   gfx::Transform BehindMatrix;
   BehindMatrix.Translate3d(0.0, 0.0, 2.0);
   gfx::Transform FrontMatrix;
@@ skipping 44 matching lines @@
   ASSERT_EQ(5u, layer_list.size());
   EXPECT_EQ(3, layer_list[0]->id());
   EXPECT_EQ(4, layer_list[1]->id());
   EXPECT_EQ(1, layer_list[2]->id());
   EXPECT_EQ(2, layer_list[3]->id());
   EXPECT_EQ(5, layer_list[4]->id());
 }
 
 TEST(LayerSorterTest, VerifyConcidentLayerPrecisionLossResultsInDocumentOrder) {
   FakeImplProxy proxy;
-  FakeLayerTreeHostImpl host_impl(&proxy);
+  TestSharedBitmapManager shared_bitmap_manager;
+  FakeLayerTreeHostImpl host_impl(&proxy, &shared_bitmap_manager);
 
   scoped_ptr<LayerImpl> layer1 = LayerImpl::Create(host_impl.active_tree(), 1);
   scoped_ptr<LayerImpl> layer2 = LayerImpl::Create(host_impl.active_tree(), 2);
 
   // Layer 1 should occur before layer 2 in paint.  However, due to numeric
   // issues in the sorter, it will put the layers in the wrong order
   // in some situations.  Here we test a patch that results in  document
   // order rather than calculated order when numeric percision is suspect
   // in calculated order.
 
@@ skipping 28 matching lines @@
   layer_sorter.Sort(layer_list.begin(), layer_list.end());
 
   ASSERT_EQ(2u, layer_list.size());
   EXPECT_EQ(1, layer_list[0]->id());
   EXPECT_EQ(2, layer_list[1]->id());
 }
 
 }  // namespace
 }  // namespace cc