src/cc/resources/tile_manager_perftest.cc

   1 // Copyright 2013 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "base/time/time.h"
   6 #include "cc/debug/lap_timer.h"
   7 #include "cc/resources/raster_buffer.h"
   8 #include "cc/resources/tile.h"
   9 #include "cc/resources/tile_priority.h"
  10 #include "cc/test/begin_frame_args_test.h"
  11 #include "cc/test/fake_impl_proxy.h"
  12 #include "cc/test/fake_layer_tree_host_impl.h"
  13 #include "cc/test/fake_output_surface.h"
  14 #include "cc/test/fake_output_surface_client.h"
  15 #include "cc/test/fake_picture_layer_impl.h"
  16 #include "cc/test/fake_picture_pile_impl.h"
  17 #include "cc/test/fake_tile_manager.h"
  18 #include "cc/test/fake_tile_manager_client.h"
  19 #include "cc/test/impl_side_painting_settings.h"
  20 #include "cc/test/test_shared_bitmap_manager.h"
  21 #include "cc/test/test_tile_priorities.h"
  22 #include "cc/trees/layer_tree_impl.h"
  23
  24 #include "testing/gtest/include/gtest/gtest.h"
  25 #include "testing/perf/perf_test.h"
  26
  27 #include "ui/gfx/frame_time.h"
  28
  29 namespace cc {
  30
  31 namespace {
  32
  33 static const int kTimeLimitMillis = 2000;
  34 static const int kWarmupRuns = 5;
  35 static const int kTimeCheckInterval = 10;
  36
  37 class FakeRasterizerImpl : public Rasterizer, public RasterizerTaskClient {
  38  public:
  39   // Overridden from Rasterizer:
  40   virtual void SetClient(RasterizerClient* client) OVERRIDE {}
  41   virtual void Shutdown() OVERRIDE {}
  42   virtual void ScheduleTasks(RasterTaskQueue* queue) OVERRIDE {
  43     for (RasterTaskQueue::Item::Vector::const_iterator it =
  44              queue->items.begin();
  45          it != queue->items.end();
  46          ++it) {
  47       RasterTask* task = it->task;
  48
  49       task->WillSchedule();
  50       task->ScheduleOnOriginThread(this);
  51       task->DidSchedule();
  52
  53       completed_tasks_.push_back(task);
  54     }
  55   }
  56   virtual void CheckForCompletedTasks() OVERRIDE {
  57     for (RasterTask::Vector::iterator it = completed_tasks_.begin();
  58          it != completed_tasks_.end();
  59          ++it) {
  60       RasterTask* task = it->get();
  61
  62       task->WillComplete();
  63       task->CompleteOnOriginThread(this);
  64       task->DidComplete();
  65
  66       task->RunReplyOnOriginThread();
  67     }
  68     completed_tasks_.clear();
  69   }
  70
  71   // Overridden from RasterizerTaskClient:
  72   virtual scoped_ptr<RasterBuffer> AcquireBufferForRaster(
  73       const Resource* resource) OVERRIDE {
  74     return scoped_ptr<RasterBuffer>();
  75   }
  76   virtual void ReleaseBufferForRaster(
  77       scoped_ptr<RasterBuffer> buffer) OVERRIDE {}
  78
  79  private:
  80   RasterTask::Vector completed_tasks_;
  81 };
  82 base::LazyInstance<FakeRasterizerImpl> g_fake_rasterizer =
  83     LAZY_INSTANCE_INITIALIZER;
  84
  85 class TileManagerPerfTest : public testing::Test {
  86  public:
  87   TileManagerPerfTest()
  88       : memory_limit_policy_(ALLOW_ANYTHING),
  89         max_tiles_(10000),
  90         id_(7),
  91         proxy_(base::MessageLoopProxy::current()),
  92         host_impl_(ImplSidePaintingSettings(10000),
  93                    &proxy_,
  94                    &shared_bitmap_manager_),
  95         timer_(kWarmupRuns,
  96                base::TimeDelta::FromMilliseconds(kTimeLimitMillis),
  97                kTimeCheckInterval) {}
  98
  99   void SetTreePriority(TreePriority tree_priority) {
 100     GlobalStateThatImpactsTilePriority state;
 101     gfx::Size tile_size(256, 256);
 102
 103     state.soft_memory_limit_in_bytes = 100 * 1000 * 1000;
 104     state.num_resources_limit = max_tiles_;
 105     state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes * 2;
 106     state.memory_limit_policy = memory_limit_policy_;
 107     state.tree_priority = tree_priority;
 108
 109     global_state_ = state;
 110     host_impl_.resource_pool()->SetResourceUsageLimits(
 111         state.soft_memory_limit_in_bytes, 0, state.num_resources_limit);
 112     host_impl_.tile_manager()->SetGlobalStateForTesting(state);
 113   }
 114
 115   virtual void SetUp() OVERRIDE {
 116     picture_pile_ = FakePicturePileImpl::CreateInfiniteFilledPile();
 117     InitializeRenderer();
 118     SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES);
 119   }
 120
 121   virtual void InitializeRenderer() {
 122     host_impl_.InitializeRenderer(
 123         FakeOutputSurface::Create3d().PassAs<OutputSurface>());
 124     tile_manager()->SetRasterizerForTesting(g_fake_rasterizer.Pointer());
 125   }
 126
 127   void SetupDefaultTrees(const gfx::Size& layer_bounds) {
 128     gfx::Size tile_size(100, 100);
 129
 130     scoped_refptr<FakePicturePileImpl> pending_pile =
 131         FakePicturePileImpl::CreateFilledPile(tile_size, layer_bounds);
 132     scoped_refptr<FakePicturePileImpl> active_pile =
 133         FakePicturePileImpl::CreateFilledPile(tile_size, layer_bounds);
 134
 135     SetupTrees(pending_pile, active_pile);
 136   }
 137
 138   void ActivateTree() {
 139     host_impl_.ActivateSyncTree();
 140     CHECK(!host_impl_.pending_tree());
 141     pending_root_layer_ = NULL;
 142     active_root_layer_ = static_cast<FakePictureLayerImpl*>(
 143         host_impl_.active_tree()->LayerById(id_));
 144   }
 145
 146   void SetupDefaultTreesWithFixedTileSize(const gfx::Size& layer_bounds,
 147                                           const gfx::Size& tile_size) {
 148     SetupDefaultTrees(layer_bounds);
 149     pending_root_layer_->set_fixed_tile_size(tile_size);
 150     active_root_layer_->set_fixed_tile_size(tile_size);
 151   }
 152
 153   void SetupTrees(scoped_refptr<PicturePileImpl> pending_pile,
 154                   scoped_refptr<PicturePileImpl> active_pile) {
 155     SetupPendingTree(active_pile);
 156     ActivateTree();
 157     SetupPendingTree(pending_pile);
 158   }
 159
 160   void SetupPendingTree(scoped_refptr<PicturePileImpl> pile) {
 161     host_impl_.CreatePendingTree();
 162     LayerTreeImpl* pending_tree = host_impl_.pending_tree();
 163     // Clear recycled tree.
 164     pending_tree->DetachLayerTree();
 165
 166     scoped_ptr<FakePictureLayerImpl> pending_layer =
 167         FakePictureLayerImpl::CreateWithPile(pending_tree, id_, pile);
 168     pending_layer->SetDrawsContent(true);
 169     pending_tree->SetRootLayer(pending_layer.PassAs<LayerImpl>());
 170
 171     pending_root_layer_ = static_cast<FakePictureLayerImpl*>(
 172         host_impl_.pending_tree()->LayerById(id_));
 173     pending_root_layer_->DoPostCommitInitializationIfNeeded();
 174   }
 175
 176   void CreateHighLowResAndSetAllTilesVisible() {
 177     // Active layer must get updated first so pending layer can share from it.
 178     active_root_layer_->CreateDefaultTilingsAndTiles();
 179     active_root_layer_->SetAllTilesVisible();
 180     pending_root_layer_->CreateDefaultTilingsAndTiles();
 181     pending_root_layer_->SetAllTilesVisible();
 182   }
 183
 184   void RunRasterQueueConstructTest(const std::string& test_name,
 185                                    int layer_count) {
 186     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
 187                                  SMOOTHNESS_TAKES_PRIORITY,
 188                                  NEW_CONTENT_TAKES_PRIORITY};
 189     int priority_count = 0;
 190
 191     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10);
 192     for (unsigned i = 0; i < layers.size(); ++i)
 193       layers[i]->UpdateTiles(Occlusion());
 194
 195     timer_.Reset();
 196     do {
 197       RasterTilePriorityQueue queue;
 198       host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
 199       priority_count = (priority_count + 1) % arraysize(priorities);
 200       timer_.NextLap();
 201     } while (!timer_.HasTimeLimitExpired());
 202
 203     perf_test::PrintResult("tile_manager_raster_tile_queue_construct",
 204                            "",
 205                            test_name,
 206                            timer_.LapsPerSecond(),
 207                            "runs/s",
 208                            true);
 209   }
 210
 211   void RunRasterQueueConstructAndIterateTest(const std::string& test_name,
 212                                              int layer_count,
 213                                              unsigned tile_count) {
 214     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
 215                                  SMOOTHNESS_TAKES_PRIORITY,
 216                                  NEW_CONTENT_TAKES_PRIORITY};
 217
 218     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 100);
 219     for (unsigned i = 0; i < layers.size(); ++i)
 220       layers[i]->UpdateTiles(Occlusion());
 221
 222     int priority_count = 0;
 223     timer_.Reset();
 224     do {
 225       int count = tile_count;
 226       RasterTilePriorityQueue queue;
 227       host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
 228       while (count--) {
 229         ASSERT_FALSE(queue.IsEmpty());
 230         ASSERT_TRUE(queue.Top() != NULL);
 231         queue.Pop();
 232       }
 233       priority_count = (priority_count + 1) % arraysize(priorities);
 234       timer_.NextLap();
 235     } while (!timer_.HasTimeLimitExpired());
 236
 237     perf_test::PrintResult(
 238         "tile_manager_raster_tile_queue_construct_and_iterate",
 239         "",
 240         test_name,
 241         timer_.LapsPerSecond(),
 242         "runs/s",
 243         true);
 244   }
 245
 246   void RunEvictionQueueConstructTest(const std::string& test_name,
 247                                      int layer_count) {
 248     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
 249                                  SMOOTHNESS_TAKES_PRIORITY,
 250                                  NEW_CONTENT_TAKES_PRIORITY};
 251     int priority_count = 0;
 252
 253     std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10);
 254     for (unsigned i = 0; i < layers.size(); ++i) {
 255       FakePictureLayerImpl* layer =
 256           static_cast<FakePictureLayerImpl*>(layers[i]);
 257       layer->UpdateTiles(Occlusion());
 258       for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) {
 259         tile_manager()->InitializeTilesWithResourcesForTesting(
 260             layer->GetTilings()->tiling_at(j)->AllTilesForTesting());
 261       }
 262     }
 263
 264     timer_.Reset();
 265     do {
 266       EvictionTilePriorityQueue queue;
 267       host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]);
 268       priority_count = (priority_count + 1) % arraysize(priorities);
 269       timer_.NextLap();
 270     } while (!timer_.HasTimeLimitExpired());
 271
 272     perf_test::PrintResult("tile_manager_eviction_tile_queue_construct",
 273                            "",
 274                            test_name,
 275                            timer_.LapsPerSecond(),
 276                            "runs/s",
 277                            true);
 278   }
 279
 280   void RunEvictionQueueConstructAndIterateTest(const std::string& test_name,
 281                                                int layer_count,
 282                                                unsigned tile_count) {
 283     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
 284                                  SMOOTHNESS_TAKES_PRIORITY,
 285                                  NEW_CONTENT_TAKES_PRIORITY};
 286     int priority_count = 0;
 287
 288     std::vector<LayerImpl*> layers = CreateLayers(layer_count, tile_count);
 289     for (unsigned i = 0; i < layers.size(); ++i) {
 290       FakePictureLayerImpl* layer =
 291           static_cast<FakePictureLayerImpl*>(layers[i]);
 292       layer->UpdateTiles(Occlusion());
 293       for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) {
 294         tile_manager()->InitializeTilesWithResourcesForTesting(
 295             layer->GetTilings()->tiling_at(j)->AllTilesForTesting());
 296       }
 297     }
 298
 299     timer_.Reset();
 300     do {
 301       int count = tile_count;
 302       EvictionTilePriorityQueue queue;
 303       host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]);
 304       while (count--) {
 305         ASSERT_FALSE(queue.IsEmpty());
 306         ASSERT_TRUE(queue.Top() != NULL);
 307         queue.Pop();
 308       }
 309       priority_count = (priority_count + 1) % arraysize(priorities);
 310       timer_.NextLap();
 311     } while (!timer_.HasTimeLimitExpired());
 312
 313     perf_test::PrintResult(
 314         "tile_manager_eviction_tile_queue_construct_and_iterate",
 315         "",
 316         test_name,
 317         timer_.LapsPerSecond(),
 318         "runs/s",
 319         true);
 320   }
 321
 322   std::vector<LayerImpl*> CreateLayers(int layer_count,
 323                                        int tiles_per_layer_count) {
 324     // Compute the width/height required for high res to get
 325     // tiles_per_layer_count tiles.
 326     float width = std::sqrt(static_cast<float>(tiles_per_layer_count));
 327     float height = tiles_per_layer_count / width;
 328
 329     // Adjust the width and height to account for the fact that tiles
 330     // are bigger than 1x1. Also, account for the fact that that we
 331     // will be creating one high res and one low res tiling. That is,
 332     // width and height should be smaller by sqrt(1 + low_res_scale).
 333     // This gives us _approximately_ correct counts.
 334     width *= settings_.default_tile_size.width() /
 335              std::sqrt(1 + settings_.low_res_contents_scale_factor);
 336     height *= settings_.default_tile_size.height() /
 337               std::sqrt(1 + settings_.low_res_contents_scale_factor);
 338
 339     // Ensure that we start with blank trees and no tiles.
 340     host_impl_.ResetTreesForTesting();
 341     tile_manager()->FreeResourcesAndCleanUpReleasedTilesForTesting();
 342
 343     gfx::Size layer_bounds(width, height);
 344     gfx::Size viewport(width / 5, height / 5);
 345     host_impl_.SetViewportSize(viewport);
 346     SetupDefaultTreesWithFixedTileSize(layer_bounds,
 347                                        settings_.default_tile_size);
 348
 349     active_root_layer_->CreateDefaultTilingsAndTiles();
 350     pending_root_layer_->CreateDefaultTilingsAndTiles();
 351
 352     std::vector<LayerImpl*> layers;
 353
 354     // Pending layer counts as one layer.
 355     layers.push_back(pending_root_layer_);
 356     int next_id = id_ + 1;
 357
 358     // Create the rest of the layers as children of the root layer.
 359     while (static_cast<int>(layers.size()) < layer_count) {
 360       scoped_ptr<FakePictureLayerImpl> layer =
 361           FakePictureLayerImpl::CreateWithPile(
 362               host_impl_.pending_tree(), next_id, picture_pile_);
 363       layer->SetBounds(layer_bounds);
 364       layers.push_back(layer.get());
 365       pending_root_layer_->AddChild(layer.PassAs<LayerImpl>());
 366
 367       FakePictureLayerImpl* fake_layer =
 368           static_cast<FakePictureLayerImpl*>(layers.back());
 369
 370       fake_layer->SetDrawsContent(true);
 371       fake_layer->DoPostCommitInitializationIfNeeded();
 372       fake_layer->CreateDefaultTilingsAndTiles();
 373       ++next_id;
 374     }
 375
 376     return layers;
 377   }
 378
 379   GlobalStateThatImpactsTilePriority GlobalStateForTest() {
 380     GlobalStateThatImpactsTilePriority state;
 381     gfx::Size tile_size = settings_.default_tile_size;
 382     state.soft_memory_limit_in_bytes =
 383         10000u * 4u *
 384         static_cast<size_t>(tile_size.width() * tile_size.height());
 385     state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes;
 386     state.num_resources_limit = 10000;
 387     state.memory_limit_policy = ALLOW_ANYTHING;
 388     state.tree_priority = SMOOTHNESS_TAKES_PRIORITY;
 389     return state;
 390   }
 391
 392   void RunManageTilesTest(const std::string& test_name,
 393                           int layer_count,
 394                           int approximate_tile_count_per_layer) {
 395     std::vector<LayerImpl*> layers =
 396         CreateLayers(layer_count, approximate_tile_count_per_layer);
 397     timer_.Reset();
 398     do {
 399       BeginFrameArgs args = CreateBeginFrameArgsForTesting();
 400       host_impl_.UpdateCurrentBeginFrameArgs(args);
 401       for (unsigned i = 0; i < layers.size(); ++i)
 402         layers[i]->UpdateTiles(Occlusion());
 403
 404       GlobalStateThatImpactsTilePriority global_state(GlobalStateForTest());
 405       tile_manager()->ManageTiles(global_state);
 406       tile_manager()->UpdateVisibleTiles();
 407       timer_.NextLap();
 408       host_impl_.ResetCurrentBeginFrameArgsForNextFrame();
 409     } while (!timer_.HasTimeLimitExpired());
 410
 411     perf_test::PrintResult(
 412         "manage_tiles", "", test_name, timer_.LapsPerSecond(), "runs/s", true);
 413   }
 414
 415   TileManager* tile_manager() { return host_impl_.tile_manager(); }
 416
 417  protected:
 418   GlobalStateThatImpactsTilePriority global_state_;
 419
 420   TestSharedBitmapManager shared_bitmap_manager_;
 421   TileMemoryLimitPolicy memory_limit_policy_;
 422   int max_tiles_;
 423   int id_;
 424   FakeImplProxy proxy_;
 425   FakeLayerTreeHostImpl host_impl_;
 426   FakePictureLayerImpl* pending_root_layer_;
 427   FakePictureLayerImpl* active_root_layer_;
 428   LapTimer timer_;
 429   scoped_refptr<FakePicturePileImpl> picture_pile_;
 430   LayerTreeSettings settings_;
 431 };
 432
 433 TEST_F(TileManagerPerfTest, ManageTiles) {
 434   RunManageTilesTest("2_100", 2, 100);
 435   RunManageTilesTest("2_500", 2, 500);
 436   RunManageTilesTest("2_1000", 2, 1000);
 437   RunManageTilesTest("10_100", 10, 100);
 438   RunManageTilesTest("10_500", 10, 500);
 439   RunManageTilesTest("10_1000", 10, 1000);
 440   RunManageTilesTest("50_100", 100, 100);
 441   RunManageTilesTest("50_500", 100, 500);
 442   RunManageTilesTest("50_1000", 100, 1000);
 443 }
 444
 445 TEST_F(TileManagerPerfTest, RasterTileQueueConstruct) {
 446   RunRasterQueueConstructTest("2", 2);
 447   RunRasterQueueConstructTest("10", 10);
 448   RunRasterQueueConstructTest("50", 50);
 449 }
 450
 451 TEST_F(TileManagerPerfTest, RasterTileQueueConstructAndIterate) {
 452   RunRasterQueueConstructAndIterateTest("2_16", 2, 16);
 453   RunRasterQueueConstructAndIterateTest("2_32", 2, 32);
 454   RunRasterQueueConstructAndIterateTest("2_64", 2, 64);
 455   RunRasterQueueConstructAndIterateTest("2_128", 2, 128);
 456   RunRasterQueueConstructAndIterateTest("10_16", 10, 16);
 457   RunRasterQueueConstructAndIterateTest("10_32", 10, 32);
 458   RunRasterQueueConstructAndIterateTest("10_64", 10, 64);
 459   RunRasterQueueConstructAndIterateTest("10_128", 10, 128);
 460   RunRasterQueueConstructAndIterateTest("50_16", 50, 16);
 461   RunRasterQueueConstructAndIterateTest("50_32", 50, 32);
 462   RunRasterQueueConstructAndIterateTest("50_64", 50, 64);
 463   RunRasterQueueConstructAndIterateTest("50_128", 50, 128);
 464 }
 465
 466 TEST_F(TileManagerPerfTest, EvictionTileQueueConstruct) {
 467   RunEvictionQueueConstructTest("2", 2);
 468   RunEvictionQueueConstructTest("10", 10);
 469   RunEvictionQueueConstructTest("50", 50);
 470 }
 471
 472 TEST_F(TileManagerPerfTest, EvictionTileQueueConstructAndIterate) {
 473   RunEvictionQueueConstructAndIterateTest("2_16", 2, 16);
 474   RunEvictionQueueConstructAndIterateTest("2_32", 2, 32);
 475   RunEvictionQueueConstructAndIterateTest("2_64", 2, 64);
 476   RunEvictionQueueConstructAndIterateTest("2_128", 2, 128);
 477   RunEvictionQueueConstructAndIterateTest("10_16", 10, 16);
 478   RunEvictionQueueConstructAndIterateTest("10_32", 10, 32);
 479   RunEvictionQueueConstructAndIterateTest("10_64", 10, 64);
 480   RunEvictionQueueConstructAndIterateTest("10_128", 10, 128);
 481   RunEvictionQueueConstructAndIterateTest("50_16", 50, 16);
 482   RunEvictionQueueConstructAndIterateTest("50_32", 50, 32);
 483   RunEvictionQueueConstructAndIterateTest("50_64", 50, 64);
 484   RunEvictionQueueConstructAndIterateTest("50_128", 50, 128);
 485 }
 486
 487 }  // namespace
 488
 489 }  // namespace cc