Invalidate scans when the host volume is unmounted.
[chromium-blink-merge.git] / cc / resources / tile_manager_perftest.cc
blob911e5c9b34f4362cfecb048faf8a23bee008c2a7
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.
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"
24 #include "testing/gtest/include/gtest/gtest.h"
25 #include "testing/perf/perf_test.h"
27 #include "ui/gfx/frame_time.h"
29 namespace cc {
30 namespace {
32 static const int kTimeLimitMillis = 2000;
33 static const int kWarmupRuns = 5;
34 static const int kTimeCheckInterval = 10;
36 class FakeTileTaskRunnerImpl : public TileTaskRunner, public TileTaskClient {
37 public:
38 // Overridden from TileTaskRunner:
39 void SetClient(TileTaskRunnerClient* client) override {}
40 void Shutdown() override {}
41 void ScheduleTasks(TileTaskQueue* queue) override {
42 for (TileTaskQueue::Item::Vector::const_iterator it = queue->items.begin();
43 it != queue->items.end(); ++it) {
44 RasterTask* task = it->task;
46 task->WillSchedule();
47 task->ScheduleOnOriginThread(this);
48 task->DidSchedule();
50 completed_tasks_.push_back(task);
53 void CheckForCompletedTasks() override {
54 for (RasterTask::Vector::iterator it = completed_tasks_.begin();
55 it != completed_tasks_.end();
56 ++it) {
57 RasterTask* task = it->get();
59 task->WillComplete();
60 task->CompleteOnOriginThread(this);
61 task->DidComplete();
63 task->RunReplyOnOriginThread();
65 completed_tasks_.clear();
68 // Overridden from TileTaskClient:
69 scoped_ptr<RasterBuffer> AcquireBufferForRaster(
70 const Resource* resource) override {
71 return nullptr;
73 void ReleaseBufferForRaster(scoped_ptr<RasterBuffer> buffer) override {}
75 private:
76 RasterTask::Vector completed_tasks_;
78 base::LazyInstance<FakeTileTaskRunnerImpl> g_fake_tile_task_runner =
79 LAZY_INSTANCE_INITIALIZER;
81 class TileManagerPerfTest : public testing::Test {
82 public:
83 TileManagerPerfTest()
84 : memory_limit_policy_(ALLOW_ANYTHING),
85 max_tiles_(10000),
86 id_(7),
87 proxy_(base::MessageLoopProxy::current()),
88 host_impl_(ImplSidePaintingSettings(10000),
89 &proxy_,
90 &shared_bitmap_manager_),
91 timer_(kWarmupRuns,
92 base::TimeDelta::FromMilliseconds(kTimeLimitMillis),
93 kTimeCheckInterval) {}
95 void SetTreePriority(TreePriority tree_priority) {
96 GlobalStateThatImpactsTilePriority state;
97 gfx::Size tile_size(256, 256);
99 state.soft_memory_limit_in_bytes = 100 * 1000 * 1000;
100 state.num_resources_limit = max_tiles_;
101 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes * 2;
102 state.memory_limit_policy = memory_limit_policy_;
103 state.tree_priority = tree_priority;
105 global_state_ = state;
106 host_impl_.resource_pool()->SetResourceUsageLimits(
107 state.soft_memory_limit_in_bytes, 0, state.num_resources_limit);
108 host_impl_.tile_manager()->SetGlobalStateForTesting(state);
111 void SetUp() override {
112 InitializeRenderer();
113 SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES);
116 virtual void InitializeRenderer() {
117 host_impl_.InitializeRenderer(FakeOutputSurface::Create3d().Pass());
118 tile_manager()->SetTileTaskRunnerForTesting(
119 g_fake_tile_task_runner.Pointer());
122 void SetupDefaultTrees(const gfx::Size& layer_bounds) {
123 scoped_refptr<FakePicturePileImpl> pending_pile =
124 FakePicturePileImpl::CreateFilledPile(kDefaultTileSize, layer_bounds);
125 scoped_refptr<FakePicturePileImpl> active_pile =
126 FakePicturePileImpl::CreateFilledPile(kDefaultTileSize, layer_bounds);
128 SetupTrees(pending_pile, active_pile);
131 void ActivateTree() {
132 host_impl_.ActivateSyncTree();
133 CHECK(!host_impl_.pending_tree());
134 pending_root_layer_ = NULL;
135 active_root_layer_ = static_cast<FakePictureLayerImpl*>(
136 host_impl_.active_tree()->LayerById(id_));
139 void SetupDefaultTreesWithFixedTileSize(const gfx::Size& layer_bounds,
140 const gfx::Size& tile_size) {
141 SetupDefaultTrees(layer_bounds);
142 pending_root_layer_->set_fixed_tile_size(tile_size);
143 active_root_layer_->set_fixed_tile_size(tile_size);
146 void SetupTrees(scoped_refptr<PicturePileImpl> pending_pile,
147 scoped_refptr<PicturePileImpl> active_pile) {
148 SetupPendingTree(active_pile);
149 ActivateTree();
150 SetupPendingTree(pending_pile);
153 void SetupPendingTree(scoped_refptr<PicturePileImpl> pile) {
154 host_impl_.CreatePendingTree();
155 LayerTreeImpl* pending_tree = host_impl_.pending_tree();
156 // Clear recycled tree.
157 pending_tree->DetachLayerTree();
159 scoped_ptr<FakePictureLayerImpl> pending_layer =
160 FakePictureLayerImpl::CreateWithRasterSource(pending_tree, id_, pile);
161 pending_layer->SetDrawsContent(true);
162 pending_layer->SetHasRenderSurface(true);
163 pending_tree->SetRootLayer(pending_layer.Pass());
165 pending_root_layer_ = static_cast<FakePictureLayerImpl*>(
166 host_impl_.pending_tree()->LayerById(id_));
169 void RunRasterQueueConstructTest(const std::string& test_name,
170 int layer_count) {
171 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
172 SMOOTHNESS_TAKES_PRIORITY,
173 NEW_CONTENT_TAKES_PRIORITY};
174 int priority_count = 0;
176 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 10);
177 bool resourceless_software_draw = false;
178 for (const auto& layer : layers)
179 layer->UpdateTiles(Occlusion(), resourceless_software_draw);
181 timer_.Reset();
182 do {
183 RasterTilePriorityQueue queue;
184 host_impl_.BuildRasterQueue(&queue, priorities[priority_count],
185 RasterTilePriorityQueue::Type::ALL);
186 priority_count = (priority_count + 1) % arraysize(priorities);
187 timer_.NextLap();
188 } while (!timer_.HasTimeLimitExpired());
190 perf_test::PrintResult("tile_manager_raster_tile_queue_construct",
192 test_name,
193 timer_.LapsPerSecond(),
194 "runs/s",
195 true);
198 void RunRasterQueueConstructAndIterateTest(const std::string& test_name,
199 int layer_count,
200 int tile_count) {
201 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
202 SMOOTHNESS_TAKES_PRIORITY,
203 NEW_CONTENT_TAKES_PRIORITY};
205 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 100);
206 bool resourceless_software_draw = false;
207 for (const auto& layer : layers)
208 layer->UpdateTiles(Occlusion(), resourceless_software_draw);
210 int priority_count = 0;
211 timer_.Reset();
212 do {
213 int count = tile_count;
214 RasterTilePriorityQueue queue;
215 host_impl_.BuildRasterQueue(&queue, priorities[priority_count],
216 RasterTilePriorityQueue::Type::ALL);
217 while (count--) {
218 ASSERT_FALSE(queue.IsEmpty());
219 ASSERT_TRUE(queue.Top() != NULL);
220 queue.Pop();
222 priority_count = (priority_count + 1) % arraysize(priorities);
223 timer_.NextLap();
224 } while (!timer_.HasTimeLimitExpired());
226 perf_test::PrintResult(
227 "tile_manager_raster_tile_queue_construct_and_iterate",
229 test_name,
230 timer_.LapsPerSecond(),
231 "runs/s",
232 true);
235 void RunEvictionQueueConstructTest(const std::string& test_name,
236 int layer_count) {
237 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
238 SMOOTHNESS_TAKES_PRIORITY,
239 NEW_CONTENT_TAKES_PRIORITY};
240 int priority_count = 0;
242 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 10);
243 bool resourceless_software_draw = false;
244 for (const auto& layer : layers) {
245 layer->UpdateTiles(Occlusion(), resourceless_software_draw);
246 for (size_t i = 0; i < layer->num_tilings(); ++i) {
247 tile_manager()->InitializeTilesWithResourcesForTesting(
248 layer->tilings()->tiling_at(i)->AllTilesForTesting());
252 timer_.Reset();
253 do {
254 EvictionTilePriorityQueue queue;
255 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]);
256 priority_count = (priority_count + 1) % arraysize(priorities);
257 timer_.NextLap();
258 } while (!timer_.HasTimeLimitExpired());
260 perf_test::PrintResult("tile_manager_eviction_tile_queue_construct",
262 test_name,
263 timer_.LapsPerSecond(),
264 "runs/s",
265 true);
268 void RunEvictionQueueConstructAndIterateTest(const std::string& test_name,
269 int layer_count,
270 int tile_count) {
271 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
272 SMOOTHNESS_TAKES_PRIORITY,
273 NEW_CONTENT_TAKES_PRIORITY};
274 int priority_count = 0;
276 std::vector<FakePictureLayerImpl*> layers =
277 CreateLayers(layer_count, tile_count);
278 bool resourceless_software_draw = false;
279 for (const auto& layer : layers) {
280 layer->UpdateTiles(Occlusion(), resourceless_software_draw);
281 for (size_t i = 0; i < layer->num_tilings(); ++i) {
282 tile_manager()->InitializeTilesWithResourcesForTesting(
283 layer->tilings()->tiling_at(i)->AllTilesForTesting());
287 timer_.Reset();
288 do {
289 int count = tile_count;
290 EvictionTilePriorityQueue queue;
291 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]);
292 while (count--) {
293 ASSERT_FALSE(queue.IsEmpty());
294 ASSERT_TRUE(queue.Top() != NULL);
295 queue.Pop();
297 priority_count = (priority_count + 1) % arraysize(priorities);
298 timer_.NextLap();
299 } while (!timer_.HasTimeLimitExpired());
301 perf_test::PrintResult(
302 "tile_manager_eviction_tile_queue_construct_and_iterate",
304 test_name,
305 timer_.LapsPerSecond(),
306 "runs/s",
307 true);
310 std::vector<FakePictureLayerImpl*> CreateLayers(int layer_count,
311 int tiles_per_layer_count) {
312 // Compute the width/height required for high res to get
313 // tiles_per_layer_count tiles.
314 float width = std::sqrt(static_cast<float>(tiles_per_layer_count));
315 float height = tiles_per_layer_count / width;
317 // Adjust the width and height to account for the fact that tiles
318 // are bigger than 1x1. Also, account for the fact that that we
319 // will be creating one high res and one low res tiling. That is,
320 // width and height should be smaller by sqrt(1 + low_res_scale).
321 // This gives us _approximately_ correct counts.
322 width *= settings_.default_tile_size.width() /
323 std::sqrt(1 + settings_.low_res_contents_scale_factor);
324 height *= settings_.default_tile_size.height() /
325 std::sqrt(1 + settings_.low_res_contents_scale_factor);
327 // Ensure that we start with blank trees and no tiles.
328 host_impl_.ResetTreesForTesting();
329 tile_manager()->FreeResourcesAndCleanUpReleasedTilesForTesting();
331 gfx::Size layer_bounds(width, height);
332 gfx::Size viewport(width / 5, height / 5);
333 host_impl_.SetViewportSize(viewport);
334 SetupDefaultTreesWithFixedTileSize(layer_bounds,
335 settings_.default_tile_size);
337 std::vector<FakePictureLayerImpl*> layers;
339 // Pending layer counts as one layer.
340 layers.push_back(pending_root_layer_);
341 int next_id = id_ + 1;
343 // Create the rest of the layers as children of the root layer.
344 scoped_refptr<FakePicturePileImpl> pile =
345 FakePicturePileImpl::CreateFilledPile(kDefaultTileSize, layer_bounds);
346 while (static_cast<int>(layers.size()) < layer_count) {
347 scoped_ptr<FakePictureLayerImpl> layer =
348 FakePictureLayerImpl::CreateWithRasterSource(
349 host_impl_.pending_tree(), next_id, pile);
350 layer->SetBounds(layer_bounds);
351 layer->SetDrawsContent(true);
352 layers.push_back(layer.get());
353 pending_root_layer_->AddChild(layer.Pass());
354 ++next_id;
357 host_impl_.pending_tree()->UpdateDrawProperties();
358 for (FakePictureLayerImpl* layer : layers)
359 layer->CreateAllTiles();
361 return layers;
364 GlobalStateThatImpactsTilePriority GlobalStateForTest() {
365 GlobalStateThatImpactsTilePriority state;
366 gfx::Size tile_size = settings_.default_tile_size;
367 state.soft_memory_limit_in_bytes =
368 10000u * 4u *
369 static_cast<size_t>(tile_size.width() * tile_size.height());
370 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes;
371 state.num_resources_limit = 10000;
372 state.memory_limit_policy = ALLOW_ANYTHING;
373 state.tree_priority = SMOOTHNESS_TAKES_PRIORITY;
374 return state;
377 void RunPrepareTilesTest(const std::string& test_name,
378 int layer_count,
379 int approximate_tile_count_per_layer) {
380 std::vector<FakePictureLayerImpl*> layers =
381 CreateLayers(layer_count, approximate_tile_count_per_layer);
382 timer_.Reset();
383 bool resourceless_software_draw = false;
384 do {
385 BeginFrameArgs args =
386 CreateBeginFrameArgsForTesting(BEGINFRAME_FROM_HERE);
387 host_impl_.UpdateCurrentBeginFrameArgs(args);
388 for (const auto& layer : layers)
389 layer->UpdateTiles(Occlusion(), resourceless_software_draw);
391 GlobalStateThatImpactsTilePriority global_state(GlobalStateForTest());
392 tile_manager()->PrepareTiles(global_state);
393 tile_manager()->UpdateVisibleTiles(global_state);
394 timer_.NextLap();
395 host_impl_.ResetCurrentBeginFrameArgsForNextFrame();
396 } while (!timer_.HasTimeLimitExpired());
398 perf_test::PrintResult("prepare_tiles", "", test_name,
399 timer_.LapsPerSecond(), "runs/s", true);
402 TileManager* tile_manager() { return host_impl_.tile_manager(); }
404 protected:
405 GlobalStateThatImpactsTilePriority global_state_;
407 TestSharedBitmapManager shared_bitmap_manager_;
408 TileMemoryLimitPolicy memory_limit_policy_;
409 int max_tiles_;
410 int id_;
411 FakeImplProxy proxy_;
412 FakeLayerTreeHostImpl host_impl_;
413 FakePictureLayerImpl* pending_root_layer_;
414 FakePictureLayerImpl* active_root_layer_;
415 LapTimer timer_;
416 LayerTreeSettings settings_;
418 static const gfx::Size kDefaultTileSize;
421 const gfx::Size TileManagerPerfTest::kDefaultTileSize(100, 100);
423 TEST_F(TileManagerPerfTest, PrepareTiles) {
424 RunPrepareTilesTest("2_100", 2, 100);
425 RunPrepareTilesTest("2_500", 2, 500);
426 RunPrepareTilesTest("2_1000", 2, 1000);
427 RunPrepareTilesTest("10_100", 10, 100);
428 RunPrepareTilesTest("10_500", 10, 500);
429 RunPrepareTilesTest("10_1000", 10, 1000);
430 RunPrepareTilesTest("50_100", 100, 100);
431 RunPrepareTilesTest("50_500", 100, 500);
432 RunPrepareTilesTest("50_1000", 100, 1000);
435 TEST_F(TileManagerPerfTest, RasterTileQueueConstruct) {
436 RunRasterQueueConstructTest("2", 2);
437 RunRasterQueueConstructTest("10", 10);
438 RunRasterQueueConstructTest("50", 50);
441 TEST_F(TileManagerPerfTest, RasterTileQueueConstructAndIterate) {
442 RunRasterQueueConstructAndIterateTest("2_16", 2, 16);
443 RunRasterQueueConstructAndIterateTest("2_32", 2, 32);
444 RunRasterQueueConstructAndIterateTest("2_64", 2, 64);
445 RunRasterQueueConstructAndIterateTest("2_128", 2, 128);
446 RunRasterQueueConstructAndIterateTest("10_16", 10, 16);
447 RunRasterQueueConstructAndIterateTest("10_32", 10, 32);
448 RunRasterQueueConstructAndIterateTest("10_64", 10, 64);
449 RunRasterQueueConstructAndIterateTest("10_128", 10, 128);
450 RunRasterQueueConstructAndIterateTest("50_16", 50, 16);
451 RunRasterQueueConstructAndIterateTest("50_32", 50, 32);
452 RunRasterQueueConstructAndIterateTest("50_64", 50, 64);
453 RunRasterQueueConstructAndIterateTest("50_128", 50, 128);
456 TEST_F(TileManagerPerfTest, EvictionTileQueueConstruct) {
457 RunEvictionQueueConstructTest("2", 2);
458 RunEvictionQueueConstructTest("10", 10);
459 RunEvictionQueueConstructTest("50", 50);
462 TEST_F(TileManagerPerfTest, EvictionTileQueueConstructAndIterate) {
463 RunEvictionQueueConstructAndIterateTest("2_16", 2, 16);
464 RunEvictionQueueConstructAndIterateTest("2_32", 2, 32);
465 RunEvictionQueueConstructAndIterateTest("2_64", 2, 64);
466 RunEvictionQueueConstructAndIterateTest("2_128", 2, 128);
467 RunEvictionQueueConstructAndIterateTest("10_16", 10, 16);
468 RunEvictionQueueConstructAndIterateTest("10_32", 10, 32);
469 RunEvictionQueueConstructAndIterateTest("10_64", 10, 64);
470 RunEvictionQueueConstructAndIterateTest("10_128", 10, 128);
471 RunEvictionQueueConstructAndIterateTest("50_16", 50, 16);
472 RunEvictionQueueConstructAndIterateTest("50_32", 50, 32);
473 RunEvictionQueueConstructAndIterateTest("50_64", 50, 64);
474 RunEvictionQueueConstructAndIterateTest("50_128", 50, 128);
477 } // namespace
478 } // namespace cc