Revert of cc: Add occlusion checker as a fixed view of occlusion tracker.

cc/resources/tile_manager_perftest.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 "base/time/time.h"
 #include "cc/debug/lap_timer.h"
 #include "cc/resources/tile.h"
 #include "cc/resources/tile_priority.h"
 #include "cc/test/begin_frame_args_test.h"
 #include "cc/test/fake_impl_proxy.h"
@@ skipping 169 matching lines @@
 
   void RunRasterQueueConstructTest(const std::string& test_name,
                                    int layer_count) {
     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
                                  SMOOTHNESS_TAKES_PRIORITY,
                                  NEW_CONTENT_TAKES_PRIORITY};
     int priority_count = 0;
 
     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10);
     for (unsigned i = 0; i < layers.size(); ++i)
-      layers[i]->UpdateTiles(Occlusion());
+      layers[i]->UpdateTiles(NULL);
 
     timer_.Reset();
     do {
       RasterTilePriorityQueue queue;
       host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
       priority_count = (priority_count + 1) % arraysize(priorities);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult("tile_manager_raster_tile_queue_construct",
                            "",
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
   }
 
   void RunRasterQueueConstructAndIterateTest(const std::string& test_name,
                                              int layer_count,
                                              unsigned tile_count) {
     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
                                  SMOOTHNESS_TAKES_PRIORITY,
                                  NEW_CONTENT_TAKES_PRIORITY};
 
     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 100);
     for (unsigned i = 0; i < layers.size(); ++i)
-      layers[i]->UpdateTiles(Occlusion());
+      layers[i]->UpdateTiles(NULL);
 
     int priority_count = 0;
     timer_.Reset();
     do {
       int count = tile_count;
       RasterTilePriorityQueue queue;
       host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
       while (count--) {
         ASSERT_FALSE(queue.IsEmpty());
         ASSERT_TRUE(queue.Top() != NULL);
@@ skipping 16 matching lines @@
                                      int layer_count) {
     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
                                  SMOOTHNESS_TAKES_PRIORITY,
                                  NEW_CONTENT_TAKES_PRIORITY};
     int priority_count = 0;
 
     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10);
     for (unsigned i = 0; i < layers.size(); ++i) {
       FakePictureLayerImpl* layer =
           static_cast<FakePictureLayerImpl*>(layers[i]);
-      layer->UpdateTiles(Occlusion());
+      layer->UpdateTiles(NULL);
       for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) {
         tile_manager()->InitializeTilesWithResourcesForTesting(
             layer->GetTilings()->tiling_at(j)->AllTilesForTesting());
       }
     }
 
     timer_.Reset();
     do {
       EvictionTilePriorityQueue queue;
       host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]);
@@ skipping 14 matching lines @@
                                                unsigned tile_count) {
     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
                                  SMOOTHNESS_TAKES_PRIORITY,
                                  NEW_CONTENT_TAKES_PRIORITY};
     int priority_count = 0;
 
     std::vector<LayerImpl*> layers = CreateLayers(layer_count, tile_count);
     for (unsigned i = 0; i < layers.size(); ++i) {
       FakePictureLayerImpl* layer =
           static_cast<FakePictureLayerImpl*>(layers[i]);
-      layer->UpdateTiles(Occlusion());
+      layer->UpdateTiles(NULL);
       for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) {
         tile_manager()->InitializeTilesWithResourcesForTesting(
             layer->GetTilings()->tiling_at(j)->AllTilesForTesting());
       }
     }
 
     timer_.Reset();
     do {
       int count = tile_count;
       EvictionTilePriorityQueue queue;
@@ skipping 89 matching lines @@
   void RunManageTilesTest(const std::string& test_name,
                           int layer_count,
                           int approximate_tile_count_per_layer) {
     std::vector<LayerImpl*> layers =
         CreateLayers(layer_count, approximate_tile_count_per_layer);
     timer_.Reset();
     do {
       BeginFrameArgs args = CreateBeginFrameArgsForTesting();
       host_impl_.UpdateCurrentBeginFrameArgs(args);
       for (unsigned i = 0; i < layers.size(); ++i)
-        layers[i]->UpdateTiles(Occlusion());
+        layers[i]->UpdateTiles(NULL);
 
       GlobalStateThatImpactsTilePriority global_state(GlobalStateForTest());
       tile_manager()->ManageTiles(global_state);
       tile_manager()->UpdateVisibleTiles();
       timer_.NextLap();
       host_impl_.ResetCurrentBeginFrameArgsForNextFrame();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult(
         "manage_tiles", "", test_name, timer_.LapsPerSecond(), "runs/s", true);
@@ skipping 67 matching lines @@
   RunEvictionQueueConstructAndIterateTest("10_128", 10, 128);
   RunEvictionQueueConstructAndIterateTest("50_16", 50, 16);
   RunEvictionQueueConstructAndIterateTest("50_32", 50, 32);
   RunEvictionQueueConstructAndIterateTest("50_64", 50, 64);
   RunEvictionQueueConstructAndIterateTest("50_128", 50, 128);
 }
 
 }  // namespace
 
 }  // namespace cc