| 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/resources/tile.h" | 6 #include "cc/resources/tile.h" |
| 7 #include "cc/resources/tile_priority.h" | 7 #include "cc/resources/tile_priority.h" |
| 8 #include "cc/test/fake_output_surface.h" | 8 #include "cc/test/fake_output_surface.h" |
| 9 #include "cc/test/fake_output_surface_client.h" | 9 #include "cc/test/fake_output_surface_client.h" |
| 10 #include "cc/test/fake_picture_pile_impl.h" | 10 #include "cc/test/fake_picture_pile_impl.h" |
| (...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 132 0, | 132 0, |
| 133 true)); | 133 true)); |
| 134 tile->SetPriority(ACTIVE_TREE, GetTilePriorityFromBin(bin)); | 134 tile->SetPriority(ACTIVE_TREE, GetTilePriorityFromBin(bin)); |
| 135 tile->SetPriority(PENDING_TREE, GetTilePriorityFromBin(bin)); | 135 tile->SetPriority(PENDING_TREE, GetTilePriorityFromBin(bin)); |
| 136 tiles->push_back(std::make_pair(tile, bin)); | 136 tiles->push_back(std::make_pair(tile, bin)); |
| 137 } | 137 } |
| 138 } | 138 } |
| 139 | 139 |
| 140 void CreateTiles(int count, TileBinVector* tiles) { | 140 void CreateTiles(int count, TileBinVector* tiles) { |
| 141 // Roughly an equal amount of all bins. | 141 // Roughly an equal amount of all bins. |
| 142 int count_per_bin = count / NUM_BINS; | 142 int count_per_bin = count / ManagedTileBin_ARRAYSIZE; |
| 143 CreateBinTiles(count_per_bin, NOW_BIN, tiles); | 143 CreateBinTiles(count_per_bin, NOW_BIN, tiles); |
| 144 CreateBinTiles(count_per_bin, SOON_BIN, tiles); | 144 CreateBinTiles(count_per_bin, SOON_BIN, tiles); |
| 145 CreateBinTiles(count_per_bin, EVENTUALLY_BIN, tiles); | 145 CreateBinTiles(count_per_bin, EVENTUALLY_BIN, tiles); |
| 146 CreateBinTiles(count - 3 * count_per_bin, NEVER_BIN, tiles); | 146 CreateBinTiles(count - 3 * count_per_bin, NEVER_BIN, tiles); |
| 147 } | 147 } |
| 148 | 148 |
| 149 void RunManageTilesTest(const std::string test_name, | 149 void RunManageTilesTest(const std::string test_name, |
| 150 unsigned tile_count, | 150 unsigned tile_count, |
| 151 unsigned priority_change_percent) { | 151 unsigned priority_change_percent) { |
| 152 DCHECK_GE(100u, tile_count); | 152 DCHECK_GE(100u, tile_count); |
| (...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 196 RunManageTilesTest("manage_tiles_1000_10", 1000, 10); | 196 RunManageTilesTest("manage_tiles_1000_10", 1000, 10); |
| 197 RunManageTilesTest("manage_tiles_10000_10", 10000, 10); | 197 RunManageTilesTest("manage_tiles_10000_10", 10000, 10); |
| 198 RunManageTilesTest("manage_tiles_100_100", 100, 100); | 198 RunManageTilesTest("manage_tiles_100_100", 100, 100); |
| 199 RunManageTilesTest("manage_tiles_1000_100", 1000, 100); | 199 RunManageTilesTest("manage_tiles_1000_100", 1000, 100); |
| 200 RunManageTilesTest("manage_tiles_10000_100", 10000, 100); | 200 RunManageTilesTest("manage_tiles_10000_100", 10000, 100); |
| 201 } | 201 } |
| 202 | 202 |
| 203 } // namespace | 203 } // namespace |
| 204 | 204 |
| 205 } // namespace cc | 205 } // namespace cc |
| OLD | NEW |