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" |
11 #include "cc/test/fake_impl_proxy.h" | 11 #include "cc/test/fake_impl_proxy.h" |
12 #include "cc/test/fake_layer_tree_host_impl.h" | 12 #include "cc/test/fake_layer_tree_host_impl.h" |
13 #include "cc/test/fake_output_surface.h" | 13 #include "cc/test/fake_output_surface.h" |
14 #include "cc/test/fake_output_surface_client.h" | 14 #include "cc/test/fake_output_surface_client.h" |
15 #include "cc/test/fake_picture_layer_impl.h" | 15 #include "cc/test/fake_picture_layer_impl.h" |
16 #include "cc/test/fake_picture_pile_impl.h" | 16 #include "cc/test/fake_picture_pile_impl.h" |
17 #include "cc/test/fake_tile_manager.h" | 17 #include "cc/test/fake_tile_manager.h" |
18 #include "cc/test/fake_tile_manager_client.h" | 18 #include "cc/test/fake_tile_manager_client.h" |
19 #include "cc/test/impl_side_painting_settings.h" | 19 #include "cc/test/impl_side_painting_settings.h" |
20 #include "cc/test/test_shared_bitmap_manager.h" | 20 #include "cc/test/test_shared_bitmap_manager.h" |
21 #include "cc/test/test_tile_priorities.h" | 21 #include "cc/test/test_tile_priorities.h" |
22 #include "cc/trees/layer_tree_impl.h" | 22 #include "cc/trees/layer_tree_impl.h" |
23 | 23 |
24 #include "testing/gtest/include/gtest/gtest.h" | 24 #include "testing/gtest/include/gtest/gtest.h" |
25 #include "testing/perf/perf_test.h" | 25 #include "testing/perf/perf_test.h" |
26 | 26 |
27 #include "ui/gfx/frame_time.h" | 27 #include "ui/gfx/frame_time.h" |
28 | 28 |
29 namespace cc { | 29 namespace cc { |
30 | |
31 namespace { | 30 namespace { |
32 | 31 |
33 static const int kTimeLimitMillis = 2000; | 32 static const int kTimeLimitMillis = 2000; |
34 static const int kWarmupRuns = 5; | 33 static const int kWarmupRuns = 5; |
35 static const int kTimeCheckInterval = 10; | 34 static const int kTimeCheckInterval = 10; |
36 | 35 |
37 class FakeTileTaskRunnerImpl : public TileTaskRunner, public TileTaskClient { | 36 class FakeTileTaskRunnerImpl : public TileTaskRunner, public TileTaskClient { |
38 public: | 37 public: |
39 // Overridden from TileTaskRunner: | 38 // Overridden from TileTaskRunner: |
40 void SetClient(TileTaskRunnerClient* client) override {} | 39 void SetClient(TileTaskRunnerClient* client) override {} |
(...skipping 118 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
159 | 158 |
160 scoped_ptr<FakePictureLayerImpl> pending_layer = | 159 scoped_ptr<FakePictureLayerImpl> pending_layer = |
161 FakePictureLayerImpl::CreateWithRasterSource(pending_tree, id_, pile); | 160 FakePictureLayerImpl::CreateWithRasterSource(pending_tree, id_, pile); |
162 pending_layer->SetDrawsContent(true); | 161 pending_layer->SetDrawsContent(true); |
163 pending_tree->SetRootLayer(pending_layer.Pass()); | 162 pending_tree->SetRootLayer(pending_layer.Pass()); |
164 | 163 |
165 pending_root_layer_ = static_cast<FakePictureLayerImpl*>( | 164 pending_root_layer_ = static_cast<FakePictureLayerImpl*>( |
166 host_impl_.pending_tree()->LayerById(id_)); | 165 host_impl_.pending_tree()->LayerById(id_)); |
167 } | 166 } |
168 | 167 |
169 void CreateHighLowResAndSetAllTilesVisible() { | |
170 // Active layer must get updated first so pending layer can share from it. | |
171 active_root_layer_->CreateDefaultTilingsAndTiles(); | |
172 active_root_layer_->SetAllTilesVisible(); | |
173 pending_root_layer_->CreateDefaultTilingsAndTiles(); | |
174 pending_root_layer_->SetAllTilesVisible(); | |
175 } | |
176 | |
177 void RunRasterQueueConstructTest(const std::string& test_name, | 168 void RunRasterQueueConstructTest(const std::string& test_name, |
178 int layer_count) { | 169 int layer_count) { |
179 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, | 170 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, |
180 SMOOTHNESS_TAKES_PRIORITY, | 171 SMOOTHNESS_TAKES_PRIORITY, |
181 NEW_CONTENT_TAKES_PRIORITY}; | 172 NEW_CONTENT_TAKES_PRIORITY}; |
182 int priority_count = 0; | 173 int priority_count = 0; |
183 | 174 |
184 std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10); | 175 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 10); |
185 bool resourceless_software_draw = false; | 176 bool resourceless_software_draw = false; |
186 for (unsigned i = 0; i < layers.size(); ++i) { | 177 for (const auto& layer : layers) |
187 layers[i]->UpdateTiles(Occlusion(), resourceless_software_draw); | 178 layer->UpdateTiles(Occlusion(), resourceless_software_draw); |
188 } | |
189 | 179 |
190 timer_.Reset(); | 180 timer_.Reset(); |
191 do { | 181 do { |
192 RasterTilePriorityQueue queue; | 182 RasterTilePriorityQueue queue; |
193 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); | 183 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); |
194 priority_count = (priority_count + 1) % arraysize(priorities); | 184 priority_count = (priority_count + 1) % arraysize(priorities); |
195 timer_.NextLap(); | 185 timer_.NextLap(); |
196 } while (!timer_.HasTimeLimitExpired()); | 186 } while (!timer_.HasTimeLimitExpired()); |
197 | 187 |
198 perf_test::PrintResult("tile_manager_raster_tile_queue_construct", | 188 perf_test::PrintResult("tile_manager_raster_tile_queue_construct", |
199 "", | 189 "", |
200 test_name, | 190 test_name, |
201 timer_.LapsPerSecond(), | 191 timer_.LapsPerSecond(), |
202 "runs/s", | 192 "runs/s", |
203 true); | 193 true); |
204 } | 194 } |
205 | 195 |
206 void RunRasterQueueConstructAndIterateTest(const std::string& test_name, | 196 void RunRasterQueueConstructAndIterateTest(const std::string& test_name, |
207 int layer_count, | 197 int layer_count, |
208 unsigned tile_count) { | 198 int tile_count) { |
209 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, | 199 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, |
210 SMOOTHNESS_TAKES_PRIORITY, | 200 SMOOTHNESS_TAKES_PRIORITY, |
211 NEW_CONTENT_TAKES_PRIORITY}; | 201 NEW_CONTENT_TAKES_PRIORITY}; |
212 | 202 |
213 std::vector<LayerImpl*> layers = CreateLayers(layer_count, 100); | 203 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 100); |
214 bool resourceless_software_draw = false; | 204 bool resourceless_software_draw = false; |
215 for (unsigned i = 0; i < layers.size(); ++i) { | 205 for (const auto& layer : layers) |
216 layers[i]->UpdateTiles(Occlusion(), resourceless_software_draw); | 206 layer->UpdateTiles(Occlusion(), resourceless_software_draw); |
217 } | |
218 | 207 |
219 int priority_count = 0; | 208 int priority_count = 0; |
220 timer_.Reset(); | 209 timer_.Reset(); |
221 do { | 210 do { |
222 int count = tile_count; | 211 int count = tile_count; |
223 RasterTilePriorityQueue queue; | 212 RasterTilePriorityQueue queue; |
224 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); | 213 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); |
225 while (count--) { | 214 while (count--) { |
226 ASSERT_FALSE(queue.IsEmpty()); | 215 ASSERT_FALSE(queue.IsEmpty()); |
227 ASSERT_TRUE(queue.Top() != NULL); | 216 ASSERT_TRUE(queue.Top() != NULL); |
(...skipping 12 matching lines...) Expand all Loading... |
240 true); | 229 true); |
241 } | 230 } |
242 | 231 |
243 void RunEvictionQueueConstructTest(const std::string& test_name, | 232 void RunEvictionQueueConstructTest(const std::string& test_name, |
244 int layer_count) { | 233 int layer_count) { |
245 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, | 234 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, |
246 SMOOTHNESS_TAKES_PRIORITY, | 235 SMOOTHNESS_TAKES_PRIORITY, |
247 NEW_CONTENT_TAKES_PRIORITY}; | 236 NEW_CONTENT_TAKES_PRIORITY}; |
248 int priority_count = 0; | 237 int priority_count = 0; |
249 | 238 |
250 std::vector<LayerImpl*> layers = CreateLayers(layer_count, 10); | 239 std::vector<FakePictureLayerImpl*> layers = CreateLayers(layer_count, 10); |
251 bool resourceless_software_draw = false; | 240 bool resourceless_software_draw = false; |
252 for (unsigned i = 0; i < layers.size(); ++i) { | 241 for (const auto& layer : layers) { |
253 FakePictureLayerImpl* layer = | |
254 static_cast<FakePictureLayerImpl*>(layers[i]); | |
255 layer->UpdateTiles(Occlusion(), resourceless_software_draw); | 242 layer->UpdateTiles(Occlusion(), resourceless_software_draw); |
256 for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) { | 243 for (size_t i = 0; i < layer->num_tilings(); ++i) { |
257 tile_manager()->InitializeTilesWithResourcesForTesting( | 244 tile_manager()->InitializeTilesWithResourcesForTesting( |
258 layer->GetTilings()->tiling_at(j)->AllTilesForTesting()); | 245 layer->tilings()->tiling_at(i)->AllTilesForTesting()); |
259 } | 246 } |
260 } | 247 } |
261 | 248 |
262 timer_.Reset(); | 249 timer_.Reset(); |
263 do { | 250 do { |
264 EvictionTilePriorityQueue queue; | 251 EvictionTilePriorityQueue queue; |
265 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]); | 252 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]); |
266 priority_count = (priority_count + 1) % arraysize(priorities); | 253 priority_count = (priority_count + 1) % arraysize(priorities); |
267 timer_.NextLap(); | 254 timer_.NextLap(); |
268 } while (!timer_.HasTimeLimitExpired()); | 255 } while (!timer_.HasTimeLimitExpired()); |
269 | 256 |
270 perf_test::PrintResult("tile_manager_eviction_tile_queue_construct", | 257 perf_test::PrintResult("tile_manager_eviction_tile_queue_construct", |
271 "", | 258 "", |
272 test_name, | 259 test_name, |
273 timer_.LapsPerSecond(), | 260 timer_.LapsPerSecond(), |
274 "runs/s", | 261 "runs/s", |
275 true); | 262 true); |
276 } | 263 } |
277 | 264 |
278 void RunEvictionQueueConstructAndIterateTest(const std::string& test_name, | 265 void RunEvictionQueueConstructAndIterateTest(const std::string& test_name, |
279 int layer_count, | 266 int layer_count, |
280 unsigned tile_count) { | 267 int tile_count) { |
281 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, | 268 TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES, |
282 SMOOTHNESS_TAKES_PRIORITY, | 269 SMOOTHNESS_TAKES_PRIORITY, |
283 NEW_CONTENT_TAKES_PRIORITY}; | 270 NEW_CONTENT_TAKES_PRIORITY}; |
284 int priority_count = 0; | 271 int priority_count = 0; |
285 | 272 |
286 std::vector<LayerImpl*> layers = CreateLayers(layer_count, tile_count); | 273 std::vector<FakePictureLayerImpl*> layers = |
| 274 CreateLayers(layer_count, tile_count); |
287 bool resourceless_software_draw = false; | 275 bool resourceless_software_draw = false; |
288 for (unsigned i = 0; i < layers.size(); ++i) { | 276 for (const auto& layer : layers) { |
289 FakePictureLayerImpl* layer = | |
290 static_cast<FakePictureLayerImpl*>(layers[i]); | |
291 layer->UpdateTiles(Occlusion(), resourceless_software_draw); | 277 layer->UpdateTiles(Occlusion(), resourceless_software_draw); |
292 for (size_t j = 0; j < layer->GetTilings()->num_tilings(); ++j) { | 278 for (size_t i = 0; i < layer->num_tilings(); ++i) { |
293 tile_manager()->InitializeTilesWithResourcesForTesting( | 279 tile_manager()->InitializeTilesWithResourcesForTesting( |
294 layer->GetTilings()->tiling_at(j)->AllTilesForTesting()); | 280 layer->tilings()->tiling_at(i)->AllTilesForTesting()); |
295 } | 281 } |
296 } | 282 } |
297 | 283 |
298 timer_.Reset(); | 284 timer_.Reset(); |
299 do { | 285 do { |
300 int count = tile_count; | 286 int count = tile_count; |
301 EvictionTilePriorityQueue queue; | 287 EvictionTilePriorityQueue queue; |
302 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]); | 288 host_impl_.BuildEvictionQueue(&queue, priorities[priority_count]); |
303 while (count--) { | 289 while (count--) { |
304 ASSERT_FALSE(queue.IsEmpty()); | 290 ASSERT_FALSE(queue.IsEmpty()); |
305 ASSERT_TRUE(queue.Top() != NULL); | 291 ASSERT_TRUE(queue.Top() != NULL); |
306 queue.Pop(); | 292 queue.Pop(); |
307 } | 293 } |
308 priority_count = (priority_count + 1) % arraysize(priorities); | 294 priority_count = (priority_count + 1) % arraysize(priorities); |
309 timer_.NextLap(); | 295 timer_.NextLap(); |
310 } while (!timer_.HasTimeLimitExpired()); | 296 } while (!timer_.HasTimeLimitExpired()); |
311 | 297 |
312 perf_test::PrintResult( | 298 perf_test::PrintResult( |
313 "tile_manager_eviction_tile_queue_construct_and_iterate", | 299 "tile_manager_eviction_tile_queue_construct_and_iterate", |
314 "", | 300 "", |
315 test_name, | 301 test_name, |
316 timer_.LapsPerSecond(), | 302 timer_.LapsPerSecond(), |
317 "runs/s", | 303 "runs/s", |
318 true); | 304 true); |
319 } | 305 } |
320 | 306 |
321 std::vector<LayerImpl*> CreateLayers(int layer_count, | 307 std::vector<FakePictureLayerImpl*> CreateLayers(int layer_count, |
322 int tiles_per_layer_count) { | 308 int tiles_per_layer_count) { |
323 // Compute the width/height required for high res to get | 309 // Compute the width/height required for high res to get |
324 // tiles_per_layer_count tiles. | 310 // tiles_per_layer_count tiles. |
325 float width = std::sqrt(static_cast<float>(tiles_per_layer_count)); | 311 float width = std::sqrt(static_cast<float>(tiles_per_layer_count)); |
326 float height = tiles_per_layer_count / width; | 312 float height = tiles_per_layer_count / width; |
327 | 313 |
328 // Adjust the width and height to account for the fact that tiles | 314 // Adjust the width and height to account for the fact that tiles |
329 // are bigger than 1x1. Also, account for the fact that that we | 315 // are bigger than 1x1. Also, account for the fact that that we |
330 // will be creating one high res and one low res tiling. That is, | 316 // will be creating one high res and one low res tiling. That is, |
331 // width and height should be smaller by sqrt(1 + low_res_scale). | 317 // width and height should be smaller by sqrt(1 + low_res_scale). |
332 // This gives us _approximately_ correct counts. | 318 // This gives us _approximately_ correct counts. |
333 width *= settings_.default_tile_size.width() / | 319 width *= settings_.default_tile_size.width() / |
334 std::sqrt(1 + settings_.low_res_contents_scale_factor); | 320 std::sqrt(1 + settings_.low_res_contents_scale_factor); |
335 height *= settings_.default_tile_size.height() / | 321 height *= settings_.default_tile_size.height() / |
336 std::sqrt(1 + settings_.low_res_contents_scale_factor); | 322 std::sqrt(1 + settings_.low_res_contents_scale_factor); |
337 | 323 |
338 // Ensure that we start with blank trees and no tiles. | 324 // Ensure that we start with blank trees and no tiles. |
339 host_impl_.ResetTreesForTesting(); | 325 host_impl_.ResetTreesForTesting(); |
340 tile_manager()->FreeResourcesAndCleanUpReleasedTilesForTesting(); | 326 tile_manager()->FreeResourcesAndCleanUpReleasedTilesForTesting(); |
341 | 327 |
342 gfx::Size layer_bounds(width, height); | 328 gfx::Size layer_bounds(width, height); |
343 gfx::Size viewport(width / 5, height / 5); | 329 gfx::Size viewport(width / 5, height / 5); |
344 host_impl_.SetViewportSize(viewport); | 330 host_impl_.SetViewportSize(viewport); |
345 SetupDefaultTreesWithFixedTileSize(layer_bounds, | 331 SetupDefaultTreesWithFixedTileSize(layer_bounds, |
346 settings_.default_tile_size); | 332 settings_.default_tile_size); |
347 | 333 |
348 active_root_layer_->CreateDefaultTilingsAndTiles(); | 334 std::vector<FakePictureLayerImpl*> layers; |
349 pending_root_layer_->CreateDefaultTilingsAndTiles(); | |
350 | |
351 std::vector<LayerImpl*> layers; | |
352 | 335 |
353 // Pending layer counts as one layer. | 336 // Pending layer counts as one layer. |
354 layers.push_back(pending_root_layer_); | 337 layers.push_back(pending_root_layer_); |
355 int next_id = id_ + 1; | 338 int next_id = id_ + 1; |
356 | 339 |
357 // Create the rest of the layers as children of the root layer. | 340 // Create the rest of the layers as children of the root layer. |
358 scoped_refptr<FakePicturePileImpl> pile = | 341 scoped_refptr<FakePicturePileImpl> pile = |
359 FakePicturePileImpl::CreateFilledPile(kDefaultTileSize, layer_bounds); | 342 FakePicturePileImpl::CreateFilledPile(kDefaultTileSize, layer_bounds); |
360 while (static_cast<int>(layers.size()) < layer_count) { | 343 while (static_cast<int>(layers.size()) < layer_count) { |
361 scoped_ptr<FakePictureLayerImpl> layer = | 344 scoped_ptr<FakePictureLayerImpl> layer = |
362 FakePictureLayerImpl::CreateWithRasterSource( | 345 FakePictureLayerImpl::CreateWithRasterSource( |
363 host_impl_.pending_tree(), next_id, pile); | 346 host_impl_.pending_tree(), next_id, pile); |
364 layer->SetBounds(layer_bounds); | 347 layer->SetBounds(layer_bounds); |
| 348 layer->SetDrawsContent(true); |
365 layers.push_back(layer.get()); | 349 layers.push_back(layer.get()); |
366 pending_root_layer_->AddChild(layer.Pass()); | 350 pending_root_layer_->AddChild(layer.Pass()); |
367 | |
368 FakePictureLayerImpl* fake_layer = | |
369 static_cast<FakePictureLayerImpl*>(layers.back()); | |
370 | |
371 fake_layer->SetDrawsContent(true); | |
372 fake_layer->CreateDefaultTilingsAndTiles(); | |
373 ++next_id; | 351 ++next_id; |
374 } | 352 } |
375 | 353 |
| 354 host_impl_.pending_tree()->UpdateDrawProperties(); |
| 355 for (FakePictureLayerImpl* layer : layers) |
| 356 layer->CreateAllTiles(); |
| 357 |
376 return layers; | 358 return layers; |
377 } | 359 } |
378 | 360 |
379 GlobalStateThatImpactsTilePriority GlobalStateForTest() { | 361 GlobalStateThatImpactsTilePriority GlobalStateForTest() { |
380 GlobalStateThatImpactsTilePriority state; | 362 GlobalStateThatImpactsTilePriority state; |
381 gfx::Size tile_size = settings_.default_tile_size; | 363 gfx::Size tile_size = settings_.default_tile_size; |
382 state.soft_memory_limit_in_bytes = | 364 state.soft_memory_limit_in_bytes = |
383 10000u * 4u * | 365 10000u * 4u * |
384 static_cast<size_t>(tile_size.width() * tile_size.height()); | 366 static_cast<size_t>(tile_size.width() * tile_size.height()); |
385 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes; | 367 state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes; |
386 state.num_resources_limit = 10000; | 368 state.num_resources_limit = 10000; |
387 state.memory_limit_policy = ALLOW_ANYTHING; | 369 state.memory_limit_policy = ALLOW_ANYTHING; |
388 state.tree_priority = SMOOTHNESS_TAKES_PRIORITY; | 370 state.tree_priority = SMOOTHNESS_TAKES_PRIORITY; |
389 return state; | 371 return state; |
390 } | 372 } |
391 | 373 |
392 void RunPrepareTilesTest(const std::string& test_name, | 374 void RunPrepareTilesTest(const std::string& test_name, |
393 int layer_count, | 375 int layer_count, |
394 int approximate_tile_count_per_layer) { | 376 int approximate_tile_count_per_layer) { |
395 std::vector<LayerImpl*> layers = | 377 std::vector<FakePictureLayerImpl*> layers = |
396 CreateLayers(layer_count, approximate_tile_count_per_layer); | 378 CreateLayers(layer_count, approximate_tile_count_per_layer); |
397 timer_.Reset(); | 379 timer_.Reset(); |
398 bool resourceless_software_draw = false; | 380 bool resourceless_software_draw = false; |
399 do { | 381 do { |
400 BeginFrameArgs args = | 382 BeginFrameArgs args = |
401 CreateBeginFrameArgsForTesting(BEGINFRAME_FROM_HERE); | 383 CreateBeginFrameArgsForTesting(BEGINFRAME_FROM_HERE); |
402 host_impl_.UpdateCurrentBeginFrameArgs(args); | 384 host_impl_.UpdateCurrentBeginFrameArgs(args); |
403 for (unsigned i = 0; i < layers.size(); ++i) { | 385 for (const auto& layer : layers) |
404 layers[i]->UpdateTiles(Occlusion(), resourceless_software_draw); | 386 layer->UpdateTiles(Occlusion(), resourceless_software_draw); |
405 } | |
406 | 387 |
407 GlobalStateThatImpactsTilePriority global_state(GlobalStateForTest()); | 388 GlobalStateThatImpactsTilePriority global_state(GlobalStateForTest()); |
408 tile_manager()->PrepareTiles(global_state); | 389 tile_manager()->PrepareTiles(global_state); |
409 tile_manager()->UpdateVisibleTiles(); | 390 tile_manager()->UpdateVisibleTiles(); |
410 timer_.NextLap(); | 391 timer_.NextLap(); |
411 host_impl_.ResetCurrentBeginFrameArgsForNextFrame(); | 392 host_impl_.ResetCurrentBeginFrameArgsForNextFrame(); |
412 } while (!timer_.HasTimeLimitExpired()); | 393 } while (!timer_.HasTimeLimitExpired()); |
413 | 394 |
414 perf_test::PrintResult("prepare_tiles", "", test_name, | 395 perf_test::PrintResult("prepare_tiles", "", test_name, |
415 timer_.LapsPerSecond(), "runs/s", true); | 396 timer_.LapsPerSecond(), "runs/s", true); |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
484 RunEvictionQueueConstructAndIterateTest("10_32", 10, 32); | 465 RunEvictionQueueConstructAndIterateTest("10_32", 10, 32); |
485 RunEvictionQueueConstructAndIterateTest("10_64", 10, 64); | 466 RunEvictionQueueConstructAndIterateTest("10_64", 10, 64); |
486 RunEvictionQueueConstructAndIterateTest("10_128", 10, 128); | 467 RunEvictionQueueConstructAndIterateTest("10_128", 10, 128); |
487 RunEvictionQueueConstructAndIterateTest("50_16", 50, 16); | 468 RunEvictionQueueConstructAndIterateTest("50_16", 50, 16); |
488 RunEvictionQueueConstructAndIterateTest("50_32", 50, 32); | 469 RunEvictionQueueConstructAndIterateTest("50_32", 50, 32); |
489 RunEvictionQueueConstructAndIterateTest("50_64", 50, 64); | 470 RunEvictionQueueConstructAndIterateTest("50_64", 50, 64); |
490 RunEvictionQueueConstructAndIterateTest("50_128", 50, 128); | 471 RunEvictionQueueConstructAndIterateTest("50_128", 50, 128); |
491 } | 472 } |
492 | 473 |
493 } // namespace | 474 } // namespace |
494 | |
495 } // namespace cc | 475 } // namespace cc |
OLD | NEW |