| // Copyright 2012 The Chromium Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| #include "cc/resources/picture_layer_tiling.h" |
| |
| #include <algorithm> |
| #include <cmath> |
| #include <limits> |
| #include <set> |
| |
| #include "base/debug/trace_event.h" |
| #include "cc/base/math_util.h" |
| #include "cc/resources/tile.h" |
| #include "cc/resources/tile_priority.h" |
| #include "ui/gfx/point_conversions.h" |
| #include "ui/gfx/rect_conversions.h" |
| #include "ui/gfx/safe_integer_conversions.h" |
| #include "ui/gfx/size_conversions.h" |
| |
| namespace cc { |
| namespace { |
| |
| const float kSoonBorderDistanceInScreenPixels = 312.f; |
| |
| class TileEvictionOrder { |
| public: |
| explicit TileEvictionOrder(TreePriority tree_priority) |
| : tree_priority_(tree_priority) {} |
| ~TileEvictionOrder() {} |
| |
| bool operator()(const Tile* a, const Tile* b) { |
| const TilePriority& a_priority = |
| a->priority_for_tree_priority(tree_priority_); |
| const TilePriority& b_priority = |
| b->priority_for_tree_priority(tree_priority_); |
| |
| if (a_priority.priority_bin == b_priority.priority_bin && |
| a->required_for_activation() != b->required_for_activation()) { |
| return b->required_for_activation(); |
| } |
| return b_priority.IsHigherPriorityThan(a_priority); |
| } |
| |
| private: |
| TreePriority tree_priority_; |
| }; |
| } // namespace |
| |
| scoped_ptr<PictureLayerTiling> PictureLayerTiling::Create( |
| float contents_scale, |
| const gfx::Size& layer_bounds, |
| PictureLayerTilingClient* client) { |
| return make_scoped_ptr(new PictureLayerTiling(contents_scale, |
| layer_bounds, |
| client)); |
| } |
| |
| PictureLayerTiling::PictureLayerTiling(float contents_scale, |
| const gfx::Size& layer_bounds, |
| PictureLayerTilingClient* client) |
| : contents_scale_(contents_scale), |
| layer_bounds_(layer_bounds), |
| resolution_(NON_IDEAL_RESOLUTION), |
| client_(client), |
| tiling_data_(gfx::Size(), gfx::Rect(), true), |
| last_impl_frame_time_in_seconds_(0.0), |
| eviction_tiles_cache_valid_(false), |
| eviction_cache_tree_priority_(SAME_PRIORITY_FOR_BOTH_TREES) { |
| gfx::Size content_bounds = |
| gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds, contents_scale)); |
| gfx::Size tile_size = client_->CalculateTileSize(content_bounds); |
| |
| DCHECK(!gfx::ToFlooredSize( |
| gfx::ScaleSize(layer_bounds, contents_scale)).IsEmpty()) << |
| "Tiling created with scale too small as contents become empty." << |
| " Layer bounds: " << layer_bounds.ToString() << |
| " Contents scale: " << contents_scale; |
| |
| tiling_data_.SetTilingRect(gfx::Rect(content_bounds)); |
| tiling_data_.SetMaxTextureSize(tile_size); |
| } |
| |
| PictureLayerTiling::~PictureLayerTiling() { |
| } |
| |
| void PictureLayerTiling::SetClient(PictureLayerTilingClient* client) { |
| client_ = client; |
| } |
| |
| gfx::Rect PictureLayerTiling::TilingRect() const { |
| return tiling_data_.tiling_rect(); |
| } |
| |
| Tile* PictureLayerTiling::CreateTile(int i, |
| int j, |
| const PictureLayerTiling* twin_tiling) { |
| TileMapKey key(i, j); |
| DCHECK(tiles_.find(key) == tiles_.end()); |
| |
| gfx::Rect paint_rect = tiling_data_.TileBoundsWithBorder(i, j); |
| gfx::Rect tile_rect = paint_rect; |
| tile_rect.set_size(tiling_data_.max_texture_size()); |
| |
| // Check our twin for a valid tile. |
| if (twin_tiling && |
| tiling_data_.max_texture_size() == |
| twin_tiling->tiling_data_.max_texture_size()) { |
| if (Tile* candidate_tile = twin_tiling->TileAt(i, j)) { |
| gfx::Rect rect = |
| gfx::ScaleToEnclosingRect(paint_rect, 1.0f / contents_scale_); |
| if (!client_->GetInvalidation()->Intersects(rect)) { |
| tiles_[key] = candidate_tile; |
| return candidate_tile; |
| } |
| } |
| } |
| |
| // Create a new tile because our twin didn't have a valid one. |
| scoped_refptr<Tile> tile = client_->CreateTile(this, tile_rect); |
| if (tile.get()) |
| tiles_[key] = tile; |
| return tile.get(); |
| } |
| |
| void PictureLayerTiling::CreateMissingTilesInLiveTilesRect() { |
| const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); |
| bool include_borders = true; |
| for (TilingData::Iterator iter( |
| &tiling_data_, live_tiles_rect_, include_borders); |
| iter; |
| ++iter) { |
| TileMapKey key = iter.index(); |
| TileMap::iterator find = tiles_.find(key); |
| if (find != tiles_.end()) |
| continue; |
| CreateTile(key.first, key.second, twin_tiling); |
| } |
| } |
| |
| void PictureLayerTiling::SetLayerBounds(const gfx::Size& layer_bounds) { |
| if (layer_bounds_ == layer_bounds) |
| return; |
| |
| DCHECK(!layer_bounds.IsEmpty()); |
| |
| gfx::Size old_layer_bounds = layer_bounds_; |
| layer_bounds_ = layer_bounds; |
| gfx::Size content_bounds = |
| gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds_, contents_scale_)); |
| |
| gfx::Size tile_size = client_->CalculateTileSize(content_bounds); |
| if (tile_size != tiling_data_.max_texture_size()) { |
| tiling_data_.SetTilingRect(gfx::Rect(content_bounds)); |
| tiling_data_.SetMaxTextureSize(tile_size); |
| Reset(); |
| return; |
| } |
| |
| // Any tiles outside our new bounds are invalid and should be dropped. |
| gfx::Rect bounded_live_tiles_rect(live_tiles_rect_); |
| bounded_live_tiles_rect.Intersect(gfx::Rect(content_bounds)); |
| SetLiveTilesRect(bounded_live_tiles_rect); |
| tiling_data_.SetTilingRect(gfx::Rect(content_bounds)); |
| |
| // Create tiles for newly exposed areas. |
| Region layer_region((gfx::Rect(layer_bounds_))); |
| layer_region.Subtract(gfx::Rect(old_layer_bounds)); |
| Invalidate(layer_region); |
| } |
| |
| void PictureLayerTiling::RemoveTilesInRegion(const Region& layer_region) { |
| DoInvalidate(layer_region, false /* recreate_tiles */); |
| } |
| |
| void PictureLayerTiling::Invalidate(const Region& layer_region) { |
| DoInvalidate(layer_region, true /* recreate_tiles */); |
| } |
| |
| void PictureLayerTiling::DoInvalidate(const Region& layer_region, |
| bool recreate_tiles) { |
| std::vector<TileMapKey> new_tile_keys; |
| gfx::Rect expanded_live_tiles_rect( |
| tiling_data_.ExpandRectToTileBoundsWithBorders(live_tiles_rect_)); |
| for (Region::Iterator iter(layer_region); iter.has_rect(); iter.next()) { |
| gfx::Rect layer_rect = iter.rect(); |
| gfx::Rect content_rect = |
| gfx::ScaleToEnclosingRect(layer_rect, contents_scale_); |
| // Avoid needless work by not bothering to invalidate where there aren't |
| // tiles. |
| content_rect.Intersect(expanded_live_tiles_rect); |
| if (content_rect.IsEmpty()) |
| continue; |
| bool include_borders = true; |
| for (TilingData::Iterator iter( |
| &tiling_data_, content_rect, include_borders); |
| iter; |
| ++iter) { |
| TileMapKey key(iter.index()); |
| TileMap::iterator find = tiles_.find(key); |
| if (find == tiles_.end()) |
| continue; |
| tiles_.erase(find); |
| if (recreate_tiles) |
| new_tile_keys.push_back(key); |
| } |
| } |
| |
| if (recreate_tiles) { |
| const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); |
| for (size_t i = 0; i < new_tile_keys.size(); ++i) |
| CreateTile(new_tile_keys[i].first, new_tile_keys[i].second, twin_tiling); |
| } |
| } |
| |
| PictureLayerTiling::CoverageIterator::CoverageIterator() |
| : tiling_(NULL), |
| current_tile_(NULL), |
| tile_i_(0), |
| tile_j_(0), |
| left_(0), |
| top_(0), |
| right_(-1), |
| bottom_(-1) { |
| } |
| |
| PictureLayerTiling::CoverageIterator::CoverageIterator( |
| const PictureLayerTiling* tiling, |
| float dest_scale, |
| const gfx::Rect& dest_rect) |
| : tiling_(tiling), |
| dest_rect_(dest_rect), |
| dest_to_content_scale_(0), |
| current_tile_(NULL), |
| tile_i_(0), |
| tile_j_(0), |
| left_(0), |
| top_(0), |
| right_(-1), |
| bottom_(-1) { |
| DCHECK(tiling_); |
| if (dest_rect_.IsEmpty()) |
| return; |
| |
| dest_to_content_scale_ = tiling_->contents_scale_ / dest_scale; |
| |
| gfx::Rect content_rect = |
| gfx::ScaleToEnclosingRect(dest_rect_, |
| dest_to_content_scale_, |
| dest_to_content_scale_); |
| // IndexFromSrcCoord clamps to valid tile ranges, so it's necessary to |
| // check for non-intersection first. |
| content_rect.Intersect(tiling_->TilingRect()); |
| if (content_rect.IsEmpty()) |
| return; |
| |
| left_ = tiling_->tiling_data_.TileXIndexFromSrcCoord(content_rect.x()); |
| top_ = tiling_->tiling_data_.TileYIndexFromSrcCoord(content_rect.y()); |
| right_ = tiling_->tiling_data_.TileXIndexFromSrcCoord( |
| content_rect.right() - 1); |
| bottom_ = tiling_->tiling_data_.TileYIndexFromSrcCoord( |
| content_rect.bottom() - 1); |
| |
| tile_i_ = left_ - 1; |
| tile_j_ = top_; |
| ++(*this); |
| } |
| |
| PictureLayerTiling::CoverageIterator::~CoverageIterator() { |
| } |
| |
| PictureLayerTiling::CoverageIterator& |
| PictureLayerTiling::CoverageIterator::operator++() { |
| if (tile_j_ > bottom_) |
| return *this; |
| |
| bool first_time = tile_i_ < left_; |
| bool new_row = false; |
| tile_i_++; |
| if (tile_i_ > right_) { |
| tile_i_ = left_; |
| tile_j_++; |
| new_row = true; |
| if (tile_j_ > bottom_) { |
| current_tile_ = NULL; |
| return *this; |
| } |
| } |
| |
| current_tile_ = tiling_->TileAt(tile_i_, tile_j_); |
| |
| // Calculate the current geometry rect. Due to floating point rounding |
| // and ToEnclosingRect, tiles might overlap in destination space on the |
| // edges. |
| gfx::Rect last_geometry_rect = current_geometry_rect_; |
| |
| gfx::Rect content_rect = tiling_->tiling_data_.TileBounds(tile_i_, tile_j_); |
| |
| current_geometry_rect_ = |
| gfx::ScaleToEnclosingRect(content_rect, |
| 1 / dest_to_content_scale_, |
| 1 / dest_to_content_scale_); |
| |
| current_geometry_rect_.Intersect(dest_rect_); |
| |
| if (first_time) |
| return *this; |
| |
| // Iteration happens left->right, top->bottom. Running off the bottom-right |
| // edge is handled by the intersection above with dest_rect_. Here we make |
| // sure that the new current geometry rect doesn't overlap with the last. |
| int min_left; |
| int min_top; |
| if (new_row) { |
| min_left = dest_rect_.x(); |
| min_top = last_geometry_rect.bottom(); |
| } else { |
| min_left = last_geometry_rect.right(); |
| min_top = last_geometry_rect.y(); |
| } |
| |
| int inset_left = std::max(0, min_left - current_geometry_rect_.x()); |
| int inset_top = std::max(0, min_top - current_geometry_rect_.y()); |
| current_geometry_rect_.Inset(inset_left, inset_top, 0, 0); |
| |
| if (!new_row) { |
| DCHECK_EQ(last_geometry_rect.right(), current_geometry_rect_.x()); |
| DCHECK_EQ(last_geometry_rect.bottom(), current_geometry_rect_.bottom()); |
| DCHECK_EQ(last_geometry_rect.y(), current_geometry_rect_.y()); |
| } |
| |
| return *this; |
| } |
| |
| gfx::Rect PictureLayerTiling::CoverageIterator::geometry_rect() const { |
| return current_geometry_rect_; |
| } |
| |
| gfx::Rect |
| PictureLayerTiling::CoverageIterator::full_tile_geometry_rect() const { |
| gfx::Rect rect = tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_); |
| rect.set_size(tiling_->tiling_data_.max_texture_size()); |
| return rect; |
| } |
| |
| gfx::RectF PictureLayerTiling::CoverageIterator::texture_rect() const { |
| gfx::PointF tex_origin = |
| tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_).origin(); |
| |
| // Convert from dest space => content space => texture space. |
| gfx::RectF texture_rect(current_geometry_rect_); |
| texture_rect.Scale(dest_to_content_scale_, |
| dest_to_content_scale_); |
| texture_rect.Intersect(tiling_->TilingRect()); |
| if (texture_rect.IsEmpty()) |
| return texture_rect; |
| texture_rect.Offset(-tex_origin.OffsetFromOrigin()); |
| |
| return texture_rect; |
| } |
| |
| gfx::Size PictureLayerTiling::CoverageIterator::texture_size() const { |
| return tiling_->tiling_data_.max_texture_size(); |
| } |
| |
| void PictureLayerTiling::Reset() { |
| live_tiles_rect_ = gfx::Rect(); |
| tiles_.clear(); |
| } |
| |
| gfx::Rect PictureLayerTiling::ComputeSkewport( |
| double current_frame_time_in_seconds, |
| const gfx::Rect& visible_rect_in_content_space) const { |
| gfx::Rect skewport = visible_rect_in_content_space; |
| if (last_impl_frame_time_in_seconds_ == 0.0) |
| return skewport; |
| |
| double time_delta = |
| current_frame_time_in_seconds - last_impl_frame_time_in_seconds_; |
| if (time_delta == 0.0) |
| return skewport; |
| |
| float skewport_target_time_in_seconds = |
| client_->GetSkewportTargetTimeInSeconds(); |
| double extrapolation_multiplier = |
| skewport_target_time_in_seconds / time_delta; |
| |
| int old_x = last_visible_rect_in_content_space_.x(); |
| int old_y = last_visible_rect_in_content_space_.y(); |
| int old_right = last_visible_rect_in_content_space_.right(); |
| int old_bottom = last_visible_rect_in_content_space_.bottom(); |
| |
| int new_x = visible_rect_in_content_space.x(); |
| int new_y = visible_rect_in_content_space.y(); |
| int new_right = visible_rect_in_content_space.right(); |
| int new_bottom = visible_rect_in_content_space.bottom(); |
| |
| int skewport_limit = client_->GetSkewportExtrapolationLimitInContentPixels(); |
| |
| // Compute the maximum skewport based on |skewport_limit|. |
| gfx::Rect max_skewport = skewport; |
| max_skewport.Inset( |
| -skewport_limit, -skewport_limit, -skewport_limit, -skewport_limit); |
| |
| // Inset the skewport by the needed adjustment. |
| skewport.Inset(extrapolation_multiplier * (new_x - old_x), |
| extrapolation_multiplier * (new_y - old_y), |
| extrapolation_multiplier * (old_right - new_right), |
| extrapolation_multiplier * (old_bottom - new_bottom)); |
| |
| // Clip the skewport to |max_skewport|. |
| skewport.Intersect(max_skewport); |
| |
| // Finally, ensure that visible rect is contained in the skewport. |
| skewport.Union(visible_rect_in_content_space); |
| return skewport; |
| } |
| |
| void PictureLayerTiling::UpdateTilePriorities( |
| WhichTree tree, |
| const gfx::Rect& visible_layer_rect, |
| float layer_contents_scale, |
| double current_frame_time_in_seconds) { |
| if (!NeedsUpdateForFrameAtTime(current_frame_time_in_seconds)) { |
| // This should never be zero for the purposes of has_ever_been_updated(). |
| DCHECK_NE(current_frame_time_in_seconds, 0.0); |
| return; |
| } |
| |
| gfx::Rect visible_rect_in_content_space = |
| gfx::ScaleToEnclosingRect(visible_layer_rect, contents_scale_); |
| |
| if (TilingRect().IsEmpty()) { |
| last_impl_frame_time_in_seconds_ = current_frame_time_in_seconds; |
| last_visible_rect_in_content_space_ = visible_rect_in_content_space; |
| return; |
| } |
| |
| size_t max_tiles_for_interest_area = client_->GetMaxTilesForInterestArea(); |
| |
| gfx::Size tile_size = tiling_data_.max_texture_size(); |
| int64 eventually_rect_area = |
| max_tiles_for_interest_area * tile_size.width() * tile_size.height(); |
| |
| gfx::Rect skewport = ComputeSkewport(current_frame_time_in_seconds, |
| visible_rect_in_content_space); |
| DCHECK(skewport.Contains(visible_rect_in_content_space)); |
| |
| gfx::Rect eventually_rect = |
| ExpandRectEquallyToAreaBoundedBy(visible_rect_in_content_space, |
| eventually_rect_area, |
| TilingRect(), |
| &expansion_cache_); |
| |
| DCHECK(eventually_rect.IsEmpty() || TilingRect().Contains(eventually_rect)); |
| |
| SetLiveTilesRect(eventually_rect); |
| |
| last_impl_frame_time_in_seconds_ = current_frame_time_in_seconds; |
| last_visible_rect_in_content_space_ = visible_rect_in_content_space; |
| |
| current_visible_rect_in_content_space_ = visible_rect_in_content_space; |
| current_skewport_ = skewport; |
| current_eventually_rect_ = eventually_rect; |
| eviction_tiles_cache_valid_ = false; |
| |
| TilePriority now_priority(resolution_, TilePriority::NOW, 0); |
| float content_to_screen_scale = layer_contents_scale / contents_scale_; |
| |
| // Assign now priority to all visible tiles. |
| bool include_borders = true; |
| for (TilingData::Iterator iter( |
| &tiling_data_, visible_rect_in_content_space, include_borders); |
| iter; |
| ++iter) { |
| TileMap::iterator find = tiles_.find(iter.index()); |
| if (find == tiles_.end()) |
| continue; |
| Tile* tile = find->second.get(); |
| |
| tile->SetPriority(tree, now_priority); |
| } |
| |
| // Assign soon priority to skewport tiles. |
| for (TilingData::DifferenceIterator iter( |
| &tiling_data_, skewport, visible_rect_in_content_space); |
| iter; |
| ++iter) { |
| TileMap::iterator find = tiles_.find(iter.index()); |
| if (find == tiles_.end()) |
| continue; |
| Tile* tile = find->second.get(); |
| |
| gfx::Rect tile_bounds = |
| tiling_data_.TileBounds(iter.index_x(), iter.index_y()); |
| |
| float distance_to_visible = |
| visible_rect_in_content_space.ManhattanInternalDistance(tile_bounds) * |
| content_to_screen_scale; |
| |
| TilePriority priority(resolution_, TilePriority::SOON, distance_to_visible); |
| tile->SetPriority(tree, priority); |
| } |
| |
| // Assign eventually priority to interest rect tiles. |
| for (TilingData::DifferenceIterator iter( |
| &tiling_data_, eventually_rect, skewport); |
| iter; |
| ++iter) { |
| TileMap::iterator find = tiles_.find(iter.index()); |
| if (find == tiles_.end()) |
| continue; |
| Tile* tile = find->second.get(); |
| |
| gfx::Rect tile_bounds = |
| tiling_data_.TileBounds(iter.index_x(), iter.index_y()); |
| |
| float distance_to_visible = |
| visible_rect_in_content_space.ManhattanInternalDistance(tile_bounds) * |
| content_to_screen_scale; |
| TilePriority priority( |
| resolution_, TilePriority::EVENTUALLY, distance_to_visible); |
| tile->SetPriority(tree, priority); |
| } |
| |
| // Upgrade the priority on border tiles to be SOON. |
| current_soon_border_rect_ = visible_rect_in_content_space; |
| float border = kSoonBorderDistanceInScreenPixels / content_to_screen_scale; |
| current_soon_border_rect_.Inset(-border, -border, -border, -border); |
| for (TilingData::DifferenceIterator iter( |
| &tiling_data_, current_soon_border_rect_, skewport); |
| iter; |
| ++iter) { |
| TileMap::iterator find = tiles_.find(iter.index()); |
| if (find == tiles_.end()) |
| continue; |
| Tile* tile = find->second.get(); |
| |
| TilePriority priority(resolution_, |
| TilePriority::SOON, |
| tile->priority(tree).distance_to_visible); |
| tile->SetPriority(tree, priority); |
| } |
| } |
| |
| void PictureLayerTiling::RemoveTileAt(int i, int j) { |
| TileMapKey key(i, j); |
| TileMap::iterator found = tiles_.find(key); |
| if (found == tiles_.end()) |
| return; |
| tiles_.erase(found); |
| } |
| |
| void PictureLayerTiling::SetLiveTilesRect( |
| const gfx::Rect& new_live_tiles_rect) { |
| DCHECK(new_live_tiles_rect.IsEmpty() || |
| TilingRect().Contains(new_live_tiles_rect)); |
| if (live_tiles_rect_ == new_live_tiles_rect) |
| return; |
| |
| // Iterate to delete all tiles outside of our new live_tiles rect. |
| PictureLayerTiling* recycled_twin = client_->GetRecycledTwinTiling(this); |
| for (TilingData::DifferenceIterator iter(&tiling_data_, |
| live_tiles_rect_, |
| new_live_tiles_rect); |
| iter; |
| ++iter) { |
| TileMapKey key(iter.index()); |
| TileMap::iterator found = tiles_.find(key); |
| // If the tile was outside of the recorded region, it won't exist even |
| // though it was in the live rect. |
| if (found != tiles_.end()) { |
| tiles_.erase(found); |
| if (recycled_twin) |
| recycled_twin->RemoveTileAt(iter.index_x(), iter.index_y()); |
| } |
| } |
| |
| const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); |
| |
| // Iterate to allocate new tiles for all regions with newly exposed area. |
| for (TilingData::DifferenceIterator iter(&tiling_data_, |
| new_live_tiles_rect, |
| live_tiles_rect_); |
| iter; |
| ++iter) { |
| TileMapKey key(iter.index()); |
| CreateTile(key.first, key.second, twin_tiling); |
| } |
| |
| live_tiles_rect_ = new_live_tiles_rect; |
| } |
| |
| void PictureLayerTiling::DidBecomeRecycled() { |
| // DidBecomeActive below will set the active priority for tiles that are |
| // still in the tree. Calling this first on an active tiling that is becoming |
| // recycled takes care of tiles that are no longer in the active tree (eg. |
| // due to a pending invalidation). |
| for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { |
| it->second->SetPriority(ACTIVE_TREE, TilePriority()); |
| } |
| } |
| |
| void PictureLayerTiling::DidBecomeActive() { |
| for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { |
| it->second->SetPriority(ACTIVE_TREE, it->second->priority(PENDING_TREE)); |
| it->second->SetPriority(PENDING_TREE, TilePriority()); |
| |
| // Tile holds a ref onto a picture pile. If the tile never gets invalidated |
| // and recreated, then that picture pile ref could exist indefinitely. To |
| // prevent this, ask the client to update the pile to its own ref. This |
| // will cause PicturePileImpls and their clones to get deleted once the |
| // corresponding PictureLayerImpl and any in flight raster jobs go out of |
| // scope. |
| client_->UpdatePile(it->second.get()); |
| } |
| } |
| |
| void PictureLayerTiling::UpdateTilesToCurrentPile() { |
| for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { |
| client_->UpdatePile(it->second.get()); |
| } |
| } |
| |
| void PictureLayerTiling::GetAllTilesForTracing( |
| std::set<const Tile*>* tiles) const { |
| for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) |
| tiles->insert(it->second.get()); |
| } |
| |
| scoped_ptr<base::Value> PictureLayerTiling::AsValue() const { |
| scoped_ptr<base::DictionaryValue> state(new base::DictionaryValue()); |
| state->SetInteger("num_tiles", tiles_.size()); |
| state->SetDouble("content_scale", contents_scale_); |
| state->Set("tiling_rect", MathUtil::AsValue(TilingRect()).release()); |
| return state.PassAs<base::Value>(); |
| } |
| |
| size_t PictureLayerTiling::GPUMemoryUsageInBytes() const { |
| size_t amount = 0; |
| for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { |
| const Tile* tile = it->second.get(); |
| amount += tile->GPUMemoryUsageInBytes(); |
| } |
| return amount; |
| } |
| |
| PictureLayerTiling::RectExpansionCache::RectExpansionCache() |
| : previous_target(0) { |
| } |
| |
| namespace { |
| |
| // This struct represents an event at which the expending rect intersects |
| // one of its boundaries. 4 intersection events will occur during expansion. |
| struct EdgeEvent { |
| enum { BOTTOM, TOP, LEFT, RIGHT } edge; |
| int* num_edges; |
| int distance; |
| }; |
| |
| // Compute the delta to expand from edges to cover target_area. |
| int ComputeExpansionDelta(int num_x_edges, int num_y_edges, |
| int width, int height, |
| int64 target_area) { |
| // Compute coefficients for the quadratic equation: |
| // a*x^2 + b*x + c = 0 |
| int a = num_y_edges * num_x_edges; |
| int b = num_y_edges * width + num_x_edges * height; |
| int64 c = static_cast<int64>(width) * height - target_area; |
| |
| // Compute the delta for our edges using the quadratic equation. |
| return a == 0 ? -c / b : |
| (-b + static_cast<int>( |
| std::sqrt(static_cast<int64>(b) * b - 4.0 * a * c))) / (2 * a); |
| } |
| |
| } // namespace |
| |
| gfx::Rect PictureLayerTiling::ExpandRectEquallyToAreaBoundedBy( |
| const gfx::Rect& starting_rect, |
| int64 target_area, |
| const gfx::Rect& bounding_rect, |
| RectExpansionCache* cache) { |
| if (starting_rect.IsEmpty()) |
| return starting_rect; |
| |
| if (cache && |
| cache->previous_start == starting_rect && |
| cache->previous_bounds == bounding_rect && |
| cache->previous_target == target_area) |
| return cache->previous_result; |
| |
| if (cache) { |
| cache->previous_start = starting_rect; |
| cache->previous_bounds = bounding_rect; |
| cache->previous_target = target_area; |
| } |
| |
| DCHECK(!bounding_rect.IsEmpty()); |
| DCHECK_GT(target_area, 0); |
| |
| // Expand the starting rect to cover target_area, if it is smaller than it. |
| int delta = ComputeExpansionDelta( |
| 2, 2, starting_rect.width(), starting_rect.height(), target_area); |
| gfx::Rect expanded_starting_rect = starting_rect; |
| if (delta > 0) |
| expanded_starting_rect.Inset(-delta, -delta); |
| |
| gfx::Rect rect = IntersectRects(expanded_starting_rect, bounding_rect); |
| if (rect.IsEmpty()) { |
| // The starting_rect and bounding_rect are far away. |
| if (cache) |
| cache->previous_result = rect; |
| return rect; |
| } |
| if (delta >= 0 && rect == expanded_starting_rect) { |
| // The starting rect already covers the entire bounding_rect and isn't too |
| // large for the target_area. |
| if (cache) |
| cache->previous_result = rect; |
| return rect; |
| } |
| |
| // Continue to expand/shrink rect to let it cover target_area. |
| |
| // These values will be updated by the loop and uses as the output. |
| int origin_x = rect.x(); |
| int origin_y = rect.y(); |
| int width = rect.width(); |
| int height = rect.height(); |
| |
| // In the beginning we will consider 2 edges in each dimension. |
| int num_y_edges = 2; |
| int num_x_edges = 2; |
| |
| // Create an event list. |
| EdgeEvent events[] = { |
| { EdgeEvent::BOTTOM, &num_y_edges, rect.y() - bounding_rect.y() }, |
| { EdgeEvent::TOP, &num_y_edges, bounding_rect.bottom() - rect.bottom() }, |
| { EdgeEvent::LEFT, &num_x_edges, rect.x() - bounding_rect.x() }, |
| { EdgeEvent::RIGHT, &num_x_edges, bounding_rect.right() - rect.right() } |
| }; |
| |
| // Sort the events by distance (closest first). |
| if (events[0].distance > events[1].distance) std::swap(events[0], events[1]); |
| if (events[2].distance > events[3].distance) std::swap(events[2], events[3]); |
| if (events[0].distance > events[2].distance) std::swap(events[0], events[2]); |
| if (events[1].distance > events[3].distance) std::swap(events[1], events[3]); |
| if (events[1].distance > events[2].distance) std::swap(events[1], events[2]); |
| |
| for (int event_index = 0; event_index < 4; event_index++) { |
| const EdgeEvent& event = events[event_index]; |
| |
| int delta = ComputeExpansionDelta( |
| num_x_edges, num_y_edges, width, height, target_area); |
| |
| // Clamp delta to our event distance. |
| if (delta > event.distance) |
| delta = event.distance; |
| |
| // Adjust the edge count for this kind of edge. |
| --*event.num_edges; |
| |
| // Apply the delta to the edges and edge events. |
| for (int i = event_index; i < 4; i++) { |
| switch (events[i].edge) { |
| case EdgeEvent::BOTTOM: |
| origin_y -= delta; |
| height += delta; |
| break; |
| case EdgeEvent::TOP: |
| height += delta; |
| break; |
| case EdgeEvent::LEFT: |
| origin_x -= delta; |
| width += delta; |
| break; |
| case EdgeEvent::RIGHT: |
| width += delta; |
| break; |
| } |
| events[i].distance -= delta; |
| } |
| |
| // If our delta is less then our event distance, we're done. |
| if (delta < event.distance) |
| break; |
| } |
| |
| gfx::Rect result(origin_x, origin_y, width, height); |
| if (cache) |
| cache->previous_result = result; |
| return result; |
| } |
| |
| void PictureLayerTiling::UpdateEvictionCacheIfNeeded( |
| TreePriority tree_priority) { |
| if (eviction_tiles_cache_valid_ && |
| eviction_cache_tree_priority_ == tree_priority) |
| return; |
| |
| eviction_tiles_cache_.clear(); |
| eviction_tiles_cache_.reserve(tiles_.size()); |
| for (TileMap::iterator it = tiles_.begin(); it != tiles_.end(); ++it) { |
| // TODO(vmpstr): This should update the priority if UpdateTilePriorities |
| // changes not to do this. |
| eviction_tiles_cache_.push_back(it->second); |
| } |
| |
| std::sort(eviction_tiles_cache_.begin(), |
| eviction_tiles_cache_.end(), |
| TileEvictionOrder(tree_priority)); |
| eviction_tiles_cache_valid_ = true; |
| eviction_cache_tree_priority_ = tree_priority; |
| } |
| |
| PictureLayerTiling::TilingRasterTileIterator::TilingRasterTileIterator() |
| : tiling_(NULL), current_tile_(NULL) {} |
| |
| PictureLayerTiling::TilingRasterTileIterator::TilingRasterTileIterator( |
| PictureLayerTiling* tiling, |
| WhichTree tree) |
| : tiling_(tiling), |
| type_(TilePriority::NOW), |
| visible_rect_in_content_space_( |
| tiling_->current_visible_rect_in_content_space_), |
| skewport_in_content_space_(tiling_->current_skewport_), |
| eventually_rect_in_content_space_(tiling_->current_eventually_rect_), |
| soon_border_rect_in_content_space_(tiling_->current_soon_border_rect_), |
| tree_(tree), |
| current_tile_(NULL), |
| visible_iterator_(&tiling->tiling_data_, |
| visible_rect_in_content_space_, |
| true /* include_borders */), |
| spiral_iterator_(&tiling->tiling_data_, |
| skewport_in_content_space_, |
| visible_rect_in_content_space_, |
| visible_rect_in_content_space_), |
| skewport_processed_(false) { |
| if (!visible_iterator_) { |
| AdvancePhase(); |
| return; |
| } |
| |
| current_tile_ = |
| tiling_->TileAt(visible_iterator_.index_x(), visible_iterator_.index_y()); |
| if (!current_tile_ || !TileNeedsRaster(current_tile_)) |
| ++(*this); |
| } |
| |
| PictureLayerTiling::TilingRasterTileIterator::~TilingRasterTileIterator() {} |
| |
| void PictureLayerTiling::TilingRasterTileIterator::AdvancePhase() { |
| DCHECK_LT(type_, TilePriority::EVENTUALLY); |
| |
| do { |
| type_ = static_cast<TilePriority::PriorityBin>(type_ + 1); |
| if (type_ == TilePriority::EVENTUALLY) { |
| spiral_iterator_ = TilingData::SpiralDifferenceIterator( |
| &tiling_->tiling_data_, |
| eventually_rect_in_content_space_, |
| skewport_in_content_space_, |
| visible_rect_in_content_space_); |
| } |
| |
| while (spiral_iterator_) { |
| current_tile_ = tiling_->TileAt(spiral_iterator_.index_x(), |
| spiral_iterator_.index_y()); |
| if (current_tile_ && TileNeedsRaster(current_tile_)) |
| break; |
| ++spiral_iterator_; |
| } |
| |
| if (!spiral_iterator_ && type_ == TilePriority::EVENTUALLY) { |
| current_tile_ = NULL; |
| break; |
| } |
| } while (!spiral_iterator_); |
| } |
| |
| PictureLayerTiling::TilingRasterTileIterator& |
| PictureLayerTiling::TilingRasterTileIterator:: |
| operator++() { |
| current_tile_ = NULL; |
| while (!current_tile_ || !TileNeedsRaster(current_tile_)) { |
| std::pair<int, int> next_index; |
| switch (type_) { |
| case TilePriority::NOW: |
| ++visible_iterator_; |
| if (!visible_iterator_) { |
| AdvancePhase(); |
| return *this; |
| } |
| next_index = visible_iterator_.index(); |
| break; |
| case TilePriority::SOON: |
| ++spiral_iterator_; |
| if (!spiral_iterator_) { |
| if (skewport_processed_) { |
| AdvancePhase(); |
| return *this; |
| } |
| skewport_processed_ = true; |
| spiral_iterator_ = TilingData::SpiralDifferenceIterator( |
| &tiling_->tiling_data_, |
| soon_border_rect_in_content_space_, |
| skewport_in_content_space_, |
| visible_rect_in_content_space_); |
| if (!spiral_iterator_) { |
| AdvancePhase(); |
| return *this; |
| } |
| } |
| next_index = spiral_iterator_.index(); |
| break; |
| case TilePriority::EVENTUALLY: |
| ++spiral_iterator_; |
| if (!spiral_iterator_) { |
| current_tile_ = NULL; |
| return *this; |
| } |
| next_index = spiral_iterator_.index(); |
| break; |
| } |
| current_tile_ = tiling_->TileAt(next_index.first, next_index.second); |
| } |
| return *this; |
| } |
| |
| PictureLayerTiling::TilingEvictionTileIterator::TilingEvictionTileIterator() |
| : is_valid_(false), tiling_(NULL) {} |
| |
| PictureLayerTiling::TilingEvictionTileIterator::TilingEvictionTileIterator( |
| PictureLayerTiling* tiling, |
| TreePriority tree_priority) |
| : is_valid_(false), tiling_(tiling), tree_priority_(tree_priority) {} |
| |
| PictureLayerTiling::TilingEvictionTileIterator::~TilingEvictionTileIterator() {} |
| |
| PictureLayerTiling::TilingEvictionTileIterator::operator bool() { |
| if (!IsValid()) |
| Initialize(); |
| |
| return IsValid() && tile_iterator_ != tiling_->eviction_tiles_cache_.end(); |
| } |
| |
| Tile* PictureLayerTiling::TilingEvictionTileIterator::operator*() { |
| if (!IsValid()) |
| Initialize(); |
| |
| DCHECK(*this); |
| return *tile_iterator_; |
| } |
| |
| PictureLayerTiling::TilingEvictionTileIterator& |
| PictureLayerTiling::TilingEvictionTileIterator:: |
| operator++() { |
| DCHECK(*this); |
| do { |
| ++tile_iterator_; |
| } while (tile_iterator_ != tiling_->eviction_tiles_cache_.end() && |
| (!(*tile_iterator_)->HasResources())); |
| |
| return *this; |
| } |
| |
| void PictureLayerTiling::TilingEvictionTileIterator::Initialize() { |
| if (!tiling_) |
| return; |
| |
| tiling_->UpdateEvictionCacheIfNeeded(tree_priority_); |
| tile_iterator_ = tiling_->eviction_tiles_cache_.begin(); |
| is_valid_ = true; |
| if (tile_iterator_ != tiling_->eviction_tiles_cache_.end() && |
| !(*tile_iterator_)->HasResources()) { |
| ++(*this); |
| } |
| } |
| |
| } // namespace cc |