| OLD | NEW |
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 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 | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "base/time/time.h" | 5 #include "base/time/time.h" |
| 6 #include "cc/debug/lap_timer.h" | 6 #include "cc/debug/lap_timer.h" |
| 7 #include "cc/resources/raster_buffer.h" | 7 #include "cc/resources/raster_buffer.h" |
| 8 #include "cc/resources/tile.h" | 8 #include "cc/resources/tile.h" |
| 9 #include "cc/resources/tile_priority.h" | 9 #include "cc/resources/tile_priority.h" |
| 10 #include "cc/test/begin_frame_args_test.h" | 10 #include "cc/test/begin_frame_args_test.h" |
| (...skipping 93 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 104 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes * 2; | 104 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes * 2; |
| 105 state.memory_limit_policy = memory_limit_policy_; | 105 state.memory_limit_policy = memory_limit_policy_; |
| 106 state.tree_priority = tree_priority; | 106 state.tree_priority = tree_priority; |
| 107 | 107 |
| 108 global_state_ = state; | 108 global_state_ = state; |
| 109 host_impl_.resource_pool()->SetResourceUsageLimits( | 109 host_impl_.resource_pool()->SetResourceUsageLimits( |
| 110 state.soft_memory_limit_in_bytes, 0, state.num_resources_limit); | 110 state.soft_memory_limit_in_bytes, 0, state.num_resources_limit); |
| 111 host_impl_.tile_manager()->SetGlobalStateForTesting(state); | 111 host_impl_.tile_manager()->SetGlobalStateForTesting(state); |
| 112 } | 112 } |
| 113 | 113 |
| 114 virtual void SetUp() override { | 114 void SetUp() override { |
| 115 InitializeRenderer(); | 115 InitializeRenderer(); |
| 116 SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); | 116 SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); |
| 117 } | 117 } |
| 118 | 118 |
| 119 virtual void InitializeRenderer() { | 119 virtual void InitializeRenderer() { |
| 120 host_impl_.InitializeRenderer(FakeOutputSurface::Create3d().Pass()); | 120 host_impl_.InitializeRenderer(FakeOutputSurface::Create3d().Pass()); |
| 121 tile_manager()->SetRasterizerForTesting(g_fake_rasterizer.Pointer()); | 121 tile_manager()->SetRasterizerForTesting(g_fake_rasterizer.Pointer()); |
| 122 } | 122 } |
| 123 | 123 |
| 124 void SetupDefaultTrees(const gfx::Size& layer_bounds) { | 124 void SetupDefaultTrees(const gfx::Size& layer_bounds) { |
| (...skipping 363 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 488 RunEvictionQueueConstructAndIterateTest("10_128", 10, 128); | 488 RunEvictionQueueConstructAndIterateTest("10_128", 10, 128); |
| 489 RunEvictionQueueConstructAndIterateTest("50_16", 50, 16); | 489 RunEvictionQueueConstructAndIterateTest("50_16", 50, 16); |
| 490 RunEvictionQueueConstructAndIterateTest("50_32", 50, 32); | 490 RunEvictionQueueConstructAndIterateTest("50_32", 50, 32); |
| 491 RunEvictionQueueConstructAndIterateTest("50_64", 50, 64); | 491 RunEvictionQueueConstructAndIterateTest("50_64", 50, 64); |
| 492 RunEvictionQueueConstructAndIterateTest("50_128", 50, 128); | 492 RunEvictionQueueConstructAndIterateTest("50_128", 50, 128); |
| 493 } | 493 } |
| 494 | 494 |
| 495 } // namespace | 495 } // namespace |
| 496 | 496 |
| 497 } // namespace cc | 497 } // namespace cc |
| OLD | NEW |