Index: cc/resources/tile_manager_unittest.cc |
diff --git a/cc/resources/tile_manager_unittest.cc b/cc/resources/tile_manager_unittest.cc |
index b0d57e6082e1b0020830e0c123d240960780a911..fb2c823a115bf060b53ac9a62dfd7c4b610983c2 100644 |
--- a/cc/resources/tile_manager_unittest.cc |
+++ b/cc/resources/tile_manager_unittest.cc |
@@ -22,465 +22,6 @@ |
namespace cc { |
namespace { |
-class TileManagerTest : public testing::TestWithParam<bool>, |
- public TileManagerClient { |
- public: |
- typedef std::vector<scoped_refptr<Tile> > TileVector; |
- |
- TileManagerTest() |
- : memory_limit_policy_(ALLOW_ANYTHING), |
- max_tiles_(0), |
- ready_to_activate_(false) {} |
- |
- void Initialize(int max_tiles, |
- TileMemoryLimitPolicy memory_limit_policy, |
- TreePriority tree_priority) { |
- output_surface_ = FakeOutputSurface::Create3d(); |
- CHECK(output_surface_->BindToClient(&output_surface_client_)); |
- |
- shared_bitmap_manager_.reset(new TestSharedBitmapManager()); |
- resource_provider_ = ResourceProvider::Create(output_surface_.get(), |
- shared_bitmap_manager_.get(), |
- NULL, |
- 0, |
- false, |
- 1, |
- false); |
- resource_pool_ = ResourcePool::Create( |
- resource_provider_.get(), GL_TEXTURE_2D, RGBA_8888); |
- tile_manager_ = |
- make_scoped_ptr(new FakeTileManager(this, resource_pool_.get())); |
- |
- memory_limit_policy_ = memory_limit_policy; |
- max_tiles_ = max_tiles; |
- picture_pile_ = FakePicturePileImpl::CreateInfiniteFilledPile(); |
- |
- SetTreePriority(tree_priority); |
- } |
- |
- void SetTreePriority(TreePriority tree_priority) { |
- GlobalStateThatImpactsTilePriority state; |
- gfx::Size tile_size = settings_.default_tile_size; |
- |
- if (UsingMemoryLimit()) { |
- state.soft_memory_limit_in_bytes = |
- max_tiles_ * 4 * tile_size.width() * tile_size.height(); |
- state.num_resources_limit = 100; |
- } else { |
- state.soft_memory_limit_in_bytes = 100 * 1000 * 1000; |
- state.num_resources_limit = max_tiles_; |
- } |
- state.hard_memory_limit_in_bytes = state.soft_memory_limit_in_bytes * 2; |
- state.memory_limit_policy = memory_limit_policy_; |
- state.tree_priority = tree_priority; |
- |
- global_state_ = state; |
- resource_pool_->SetResourceUsageLimits(state.soft_memory_limit_in_bytes, |
- state.soft_memory_limit_in_bytes, |
- state.num_resources_limit); |
- tile_manager_->SetGlobalStateForTesting(state); |
- } |
- |
- virtual void TearDown() override { |
- tile_manager_.reset(NULL); |
- picture_pile_ = NULL; |
- |
- testing::Test::TearDown(); |
- } |
- |
- // TileManagerClient implementation. |
- virtual const std::vector<PictureLayerImpl*>& GetPictureLayers() |
- const override { |
- return picture_layers_; |
- } |
- virtual void NotifyReadyToActivate() override { ready_to_activate_ = true; } |
- virtual void NotifyTileStateChanged(const Tile* tile) override {} |
- virtual void BuildRasterQueue(RasterTilePriorityQueue* queue, |
- TreePriority priority) override {} |
- virtual void BuildEvictionQueue(EvictionTilePriorityQueue* queue, |
- TreePriority priority) override {} |
- |
- TileVector CreateTilesWithSize(int count, |
- TilePriority active_priority, |
- TilePriority pending_priority, |
- const gfx::Size& tile_size) { |
- TileVector tiles; |
- for (int i = 0; i < count; ++i) { |
- scoped_refptr<Tile> tile = tile_manager_->CreateTile(picture_pile_.get(), |
- tile_size, |
- gfx::Rect(), |
- 1.0, |
- 0, |
- 0, |
- 0); |
- tile->SetPriority(ACTIVE_TREE, active_priority); |
- tile->SetPriority(PENDING_TREE, pending_priority); |
- tiles.push_back(tile); |
- } |
- return tiles; |
- } |
- |
- TileVector CreateTiles(int count, |
- TilePriority active_priority, |
- TilePriority pending_priority) { |
- return CreateTilesWithSize( |
- count, active_priority, pending_priority, settings_.default_tile_size); |
- } |
- |
- void ReleaseTiles(TileVector* tiles) { |
- for (TileVector::iterator it = tiles->begin(); it != tiles->end(); it++) { |
- Tile* tile = it->get(); |
- tile->SetPriority(ACTIVE_TREE, TilePriority()); |
- tile->SetPriority(PENDING_TREE, TilePriority()); |
- } |
- } |
- |
- FakeTileManager* tile_manager() { return tile_manager_.get(); } |
- |
- int AssignedMemoryCount(const TileVector& tiles) { |
- int has_memory_count = 0; |
- for (TileVector::const_iterator it = tiles.begin(); it != tiles.end(); |
- ++it) { |
- if (tile_manager_->HasBeenAssignedMemory(it->get())) |
- ++has_memory_count; |
- } |
- return has_memory_count; |
- } |
- |
- bool ready_to_activate() const { return ready_to_activate_; } |
- |
- // The parametrization specifies whether the max tile limit should |
- // be applied to memory or resources. |
- bool UsingResourceLimit() { return !GetParam(); } |
- bool UsingMemoryLimit() { return GetParam(); } |
- |
- protected: |
- GlobalStateThatImpactsTilePriority global_state_; |
- |
- private: |
- LayerTreeSettings settings_; |
- scoped_ptr<FakeTileManager> tile_manager_; |
- scoped_refptr<FakePicturePileImpl> picture_pile_; |
- FakeOutputSurfaceClient output_surface_client_; |
- scoped_ptr<FakeOutputSurface> output_surface_; |
- scoped_ptr<SharedBitmapManager> shared_bitmap_manager_; |
- scoped_ptr<ResourceProvider> resource_provider_; |
- scoped_ptr<ResourcePool> resource_pool_; |
- TileMemoryLimitPolicy memory_limit_policy_; |
- int max_tiles_; |
- bool ready_to_activate_; |
- std::vector<PictureLayerImpl*> picture_layers_; |
-}; |
- |
-TEST_P(TileManagerTest, EnoughMemoryAllowAnything) { |
- // A few tiles of each type of priority, with enough memory for all tiles. |
- |
- Initialize(10, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_now = |
- CreateTiles(3, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_now = |
- CreateTiles(3, TilePriority(), TilePriorityForNowBin()); |
- TileVector active_pending_soon = |
- CreateTiles(3, TilePriorityForSoonBin(), TilePriorityForSoonBin()); |
- TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(3, AssignedMemoryCount(active_now)); |
- EXPECT_EQ(3, AssignedMemoryCount(pending_now)); |
- EXPECT_EQ(3, AssignedMemoryCount(active_pending_soon)); |
- EXPECT_EQ(0, AssignedMemoryCount(never_bin)); |
- |
- ReleaseTiles(&active_now); |
- ReleaseTiles(&pending_now); |
- ReleaseTiles(&active_pending_soon); |
- ReleaseTiles(&never_bin); |
-} |
- |
-TEST_P(TileManagerTest, EnoughMemoryAllowPrepaintOnly) { |
- // A few tiles of each type of priority, with enough memory for all tiles, |
- // with the exception of never bin. |
- |
- Initialize(10, ALLOW_PREPAINT_ONLY, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_now = |
- CreateTiles(3, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_now = |
- CreateTiles(3, TilePriority(), TilePriorityForNowBin()); |
- TileVector active_pending_soon = |
- CreateTiles(3, TilePriorityForSoonBin(), TilePriorityForSoonBin()); |
- TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(3, AssignedMemoryCount(active_now)); |
- EXPECT_EQ(3, AssignedMemoryCount(pending_now)); |
- EXPECT_EQ(3, AssignedMemoryCount(active_pending_soon)); |
- EXPECT_EQ(0, AssignedMemoryCount(never_bin)); |
- |
- ReleaseTiles(&active_now); |
- ReleaseTiles(&pending_now); |
- ReleaseTiles(&active_pending_soon); |
- ReleaseTiles(&never_bin); |
-} |
- |
-TEST_P(TileManagerTest, EnoughMemoryPendingLowResAllowAbsoluteMinimum) { |
- // A few low-res tiles required for activation, with enough memory for all |
- // tiles. |
- |
- Initialize(5, ALLOW_ABSOLUTE_MINIMUM, SAME_PRIORITY_FOR_BOTH_TREES); |
- TileVector pending_low_res = |
- CreateTiles(5, TilePriority(), TilePriorityLowRes()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(5, AssignedMemoryCount(pending_low_res)); |
- ReleaseTiles(&pending_low_res); |
-} |
- |
-TEST_P(TileManagerTest, EnoughMemoryAllowAbsoluteMinimum) { |
- // A few tiles of each type of priority, with enough memory for all tiles, |
- // with the exception of never and soon bins. |
- |
- Initialize(10, ALLOW_ABSOLUTE_MINIMUM, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_now = |
- CreateTiles(3, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_now = |
- CreateTiles(3, TilePriority(), TilePriorityForNowBin()); |
- TileVector active_pending_soon = |
- CreateTiles(3, TilePriorityForSoonBin(), TilePriorityForSoonBin()); |
- TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(3, AssignedMemoryCount(active_now)); |
- EXPECT_EQ(3, AssignedMemoryCount(pending_now)); |
- EXPECT_EQ(0, AssignedMemoryCount(active_pending_soon)); |
- EXPECT_EQ(0, AssignedMemoryCount(never_bin)); |
- |
- ReleaseTiles(&active_now); |
- ReleaseTiles(&pending_now); |
- ReleaseTiles(&active_pending_soon); |
- ReleaseTiles(&never_bin); |
-} |
- |
-TEST_P(TileManagerTest, EnoughMemoryAllowNothing) { |
- // A few tiles of each type of priority, with enough memory for all tiles, |
- // but allow nothing should not assign any memory. |
- |
- Initialize(10, ALLOW_NOTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_now = |
- CreateTiles(3, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_now = |
- CreateTiles(3, TilePriority(), TilePriorityForNowBin()); |
- TileVector active_pending_soon = |
- CreateTiles(3, TilePriorityForSoonBin(), TilePriorityForSoonBin()); |
- TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(0, AssignedMemoryCount(active_now)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_now)); |
- EXPECT_EQ(0, AssignedMemoryCount(active_pending_soon)); |
- EXPECT_EQ(0, AssignedMemoryCount(never_bin)); |
- |
- ReleaseTiles(&active_now); |
- ReleaseTiles(&pending_now); |
- ReleaseTiles(&active_pending_soon); |
- ReleaseTiles(&never_bin); |
-} |
- |
-TEST_P(TileManagerTest, PartialOOMMemoryToPending) { |
- // 5 tiles on active tree eventually bin, 5 tiles on pending tree that are |
- // required for activation, but only enough memory for 8 tiles. The result |
- // is all pending tree tiles get memory, and 3 of the active tree tiles |
- // get memory. None of these tiles is needed to avoid calimity (flickering or |
- // raster-on-demand) so the soft memory limit is used. |
- |
- Initialize(8, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(5, TilePriorityForEventualBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(5, TilePriority(), TilePriorityRequiredForActivation()); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(5, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(3, AssignedMemoryCount(pending_tree_tiles)); |
- |
- SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(3, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(5, AssignedMemoryCount(pending_tree_tiles)); |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-TEST_P(TileManagerTest, PartialOOMMemoryToActive) { |
- // 5 tiles on active tree eventually bin, 5 tiles on pending tree now bin, |
- // but only enough memory for 8 tiles. The result is all active tree tiles |
- // get memory, and 3 of the pending tree tiles get memory. |
- // The pending tiles are not needed to avoid calimity (flickering or |
- // raster-on-demand) and the active tiles fit, so the soft limit is used. |
- |
- Initialize(8, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(5, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(5, TilePriority(), TilePriorityForNowBin()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(5, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(3, AssignedMemoryCount(pending_tree_tiles)); |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-TEST_P(TileManagerTest, TotalOOMMemoryToPending) { |
- // 10 tiles on active tree eventually bin, 10 tiles on pending tree that are |
- // required for activation, but only enough tiles for 4 tiles. The result |
- // is 4 pending tree tiles get memory, and none of the active tree tiles |
- // get memory. |
- |
- Initialize(4, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(10, TilePriorityForEventualBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(10, TilePriority(), TilePriorityRequiredForActivation()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(4, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_tree_tiles)); |
- |
- SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- if (UsingResourceLimit()) { |
- EXPECT_EQ(0, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(4, AssignedMemoryCount(pending_tree_tiles)); |
- } else { |
- // Pending tiles are now required to avoid calimity (flickering or |
- // raster-on-demand). Hard-limit is used and double the tiles fit. |
- EXPECT_EQ(0, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(8, AssignedMemoryCount(pending_tree_tiles)); |
- } |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-TEST_P(TileManagerTest, TotalOOMActiveSoonMemoryToPending) { |
- // 10 tiles on active tree soon bin, 10 tiles on pending tree that are |
- // required for activation, but only enough tiles for 4 tiles. The result |
- // is 4 pending tree tiles get memory, and none of the active tree tiles |
- // get memory. |
- |
- Initialize(4, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(10, TilePriorityForSoonBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(10, TilePriority(), TilePriorityRequiredForActivation()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- EXPECT_EQ(4, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_tree_tiles)); |
- |
- SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- if (UsingResourceLimit()) { |
- EXPECT_EQ(0, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(4, AssignedMemoryCount(pending_tree_tiles)); |
- } else { |
- // Pending tiles are now required to avoid calimity (flickering or |
- // raster-on-demand). Hard-limit is used and double the tiles fit. |
- EXPECT_EQ(0, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(8, AssignedMemoryCount(pending_tree_tiles)); |
- } |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-TEST_P(TileManagerTest, TotalOOMMemoryToActive) { |
- // 10 tiles on active tree eventually bin, 10 tiles on pending tree now bin, |
- // but only enough memory for 4 tiles. The result is 4 active tree tiles |
- // get memory, and none of the pending tree tiles get memory. |
- |
- Initialize(4, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(10, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(10, TilePriority(), TilePriorityForNowBin()); |
- |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- |
- if (UsingResourceLimit()) { |
- EXPECT_EQ(4, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_tree_tiles)); |
- } else { |
- // Active tiles are required to avoid calimity (flickering or |
- // raster-on-demand). Hard-limit is used and double the tiles fit. |
- EXPECT_EQ(8, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_tree_tiles)); |
- } |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-TEST_P(TileManagerTest, TotalOOMMemoryToNewContent) { |
- // 10 tiles on active tree now bin, 10 tiles on pending tree now bin, |
- // but only enough memory for 8 tiles. Any tile missing would cause |
- // a calamity (flickering or raster-on-demand). Depending on mode, |
- // we should use varying amounts of the higher hard memory limit. |
- if (UsingResourceLimit()) |
- return; |
- |
- Initialize(8, ALLOW_ANYTHING, SMOOTHNESS_TAKES_PRIORITY); |
- TileVector active_tree_tiles = |
- CreateTiles(10, TilePriorityForNowBin(), TilePriority()); |
- TileVector pending_tree_tiles = |
- CreateTiles(10, TilePriority(), TilePriorityForNowBin()); |
- |
- // Active tiles are required to avoid calimity. The hard-limit is used and all |
- // active-tiles fit. No pending tiles are needed to avoid calamity so only 10 |
- // tiles total are used. |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- EXPECT_EQ(10, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(0, AssignedMemoryCount(pending_tree_tiles)); |
- |
- // Even the hard-limit won't save us now. All tiles are required to avoid |
- // a clamity but we only have 16. The tiles will be distribted randomly |
- // given they are identical, in practice depending on their screen location. |
- SetTreePriority(SAME_PRIORITY_FOR_BOTH_TREES); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- EXPECT_EQ(16, |
- AssignedMemoryCount(active_tree_tiles) + |
- AssignedMemoryCount(pending_tree_tiles)); |
- |
- // The pending tree is now more important. Active tiles will take higher |
- // priority if they are ready-to-draw in practice. Importantly though, |
- // pending tiles also utilize the hard-limit. |
- SetTreePriority(NEW_CONTENT_TAKES_PRIORITY); |
- tile_manager()->AssignMemoryToTiles(global_state_); |
- EXPECT_EQ(0, AssignedMemoryCount(active_tree_tiles)); |
- EXPECT_EQ(10, AssignedMemoryCount(pending_tree_tiles)); |
- |
- ReleaseTiles(&active_tree_tiles); |
- ReleaseTiles(&pending_tree_tiles); |
-} |
- |
-// If true, the max tile limit should be applied as bytes; if false, |
-// as num_resources_limit. |
-INSTANTIATE_TEST_CASE_P(TileManagerTests, |
- TileManagerTest, |
- ::testing::Values(true, false)); |
- |
class LowResTilingsSettings : public ImplSidePaintingSettings { |
public: |
LowResTilingsSettings() { create_low_res_tiling = true; } |
@@ -646,13 +187,13 @@ TEST_F(TileManagerTilePriorityQueueTest, RasterTilePriorityQueue) { |
// Renew all of the tile priorities. |
gfx::Rect viewport(50, 50, 100, 100); |
- pending_layer_->HighResTiling()->UpdateTilePriorities( |
+ pending_layer_->HighResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- pending_layer_->LowResTiling()->UpdateTilePriorities( |
+ pending_layer_->LowResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- active_layer_->HighResTiling()->UpdateTilePriorities( |
+ active_layer_->HighResTiling()->ComputeTilePriorityRects( |
ACTIVE_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- active_layer_->LowResTiling()->UpdateTilePriorities( |
+ active_layer_->LowResTiling()->ComputeTilePriorityRects( |
ACTIVE_TREE, viewport, 1.0f, 1.0, Occlusion()); |
// Populate all tiles directly from the tilings. |
@@ -821,13 +362,13 @@ TEST_F(TileManagerTilePriorityQueueTest, EvictionTilePriorityQueue) { |
// Renew all of the tile priorities. |
gfx::Rect viewport(50, 50, 100, 100); |
- pending_layer_->HighResTiling()->UpdateTilePriorities( |
+ pending_layer_->HighResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- pending_layer_->LowResTiling()->UpdateTilePriorities( |
+ pending_layer_->LowResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- active_layer_->HighResTiling()->UpdateTilePriorities( |
+ active_layer_->HighResTiling()->ComputeTilePriorityRects( |
ACTIVE_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- active_layer_->LowResTiling()->UpdateTilePriorities( |
+ active_layer_->LowResTiling()->ComputeTilePriorityRects( |
ACTIVE_TREE, viewport, 1.0f, 1.0, Occlusion()); |
// Populate all tiles directly from the tilings. |
@@ -855,8 +396,6 @@ TEST_F(TileManagerTilePriorityQueueTest, EvictionTilePriorityQueue) { |
tile_manager()->InitializeTilesWithResourcesForTesting( |
std::vector<Tile*>(all_tiles.begin(), all_tiles.end())); |
- pending_layer_->MarkVisibleResourcesAsRequired(); |
- |
Tile* last_tile = NULL; |
smoothness_tiles.clear(); |
tile_count = 0; |
@@ -965,41 +504,38 @@ TEST_F(TileManagerTilePriorityQueueTest, |
// Renew all of the tile priorities. |
gfx::Rect viewport(layer_bounds); |
- pending_layer_->HighResTiling()->UpdateTilePriorities( |
+ pending_layer_->HighResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- pending_layer_->LowResTiling()->UpdateTilePriorities( |
+ pending_layer_->LowResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- pending_child_layer->HighResTiling()->UpdateTilePriorities( |
+ pending_child_layer->HighResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
- pending_child_layer->LowResTiling()->UpdateTilePriorities( |
+ pending_child_layer->LowResTiling()->ComputeTilePriorityRects( |
PENDING_TREE, viewport, 1.0f, 1.0, Occlusion()); |
// Populate all tiles directly from the tilings. |
all_tiles.clear(); |
std::vector<Tile*> pending_high_res_tiles = |
pending_layer_->HighResTiling()->AllTilesForTesting(); |
- for (size_t i = 0; i < pending_high_res_tiles.size(); ++i) |
- all_tiles.insert(pending_high_res_tiles[i]); |
+ all_tiles.insert(pending_high_res_tiles.begin(), |
+ pending_high_res_tiles.end()); |
std::vector<Tile*> pending_low_res_tiles = |
pending_layer_->LowResTiling()->AllTilesForTesting(); |
- for (size_t i = 0; i < pending_low_res_tiles.size(); ++i) |
- all_tiles.insert(pending_low_res_tiles[i]); |
+ all_tiles.insert(pending_low_res_tiles.begin(), pending_low_res_tiles.end()); |
// Set all tiles on the pending_child_layer as occluded on the pending tree. |
std::vector<Tile*> pending_child_high_res_tiles = |
pending_child_layer->HighResTiling()->AllTilesForTesting(); |
- for (size_t i = 0; i < pending_child_high_res_tiles.size(); ++i) { |
- pending_child_high_res_tiles[i]->set_is_occluded(PENDING_TREE, true); |
- all_tiles.insert(pending_child_high_res_tiles[i]); |
- } |
+ pending_child_layer->HighResTiling()->SetAllTilesOccludedForTesting(); |
+ all_tiles.insert(pending_child_high_res_tiles.begin(), |
+ pending_child_high_res_tiles.end()); |
std::vector<Tile*> pending_child_low_res_tiles = |
pending_child_layer->LowResTiling()->AllTilesForTesting(); |
- for (size_t i = 0; i < pending_child_low_res_tiles.size(); ++i) { |
- pending_child_low_res_tiles[i]->set_is_occluded(PENDING_TREE, true); |
- all_tiles.insert(pending_child_low_res_tiles[i]); |
- } |
+ pending_child_layer->LowResTiling()->SetAllTilesOccludedForTesting(); |
+ all_tiles.insert(pending_child_low_res_tiles.begin(), |
+ pending_child_low_res_tiles.end()); |
tile_manager()->InitializeTilesWithResourcesForTesting( |
std::vector<Tile*>(all_tiles.begin(), all_tiles.end())); |