Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(80)

Side by Side Diff: cc/resources/picture_layer_tiling.cc

Issue 62283012: cc: Added tile bundles (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: more review Created 7 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2012 The Chromium Authors. All rights reserved. 1 // Copyright 2012 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 "cc/resources/picture_layer_tiling.h" 5 #include "cc/resources/picture_layer_tiling.h"
6 6
7 #include <algorithm> 7 #include <algorithm>
8 #include <cmath> 8 #include <cmath>
9 #include <limits> 9 #include <limits>
10 10
11 #include "base/debug/trace_event.h" 11 #include "base/debug/trace_event.h"
12 #include "cc/base/math_util.h" 12 #include "cc/base/math_util.h"
13 #include "ui/gfx/point_conversions.h" 13 #include "ui/gfx/point_conversions.h"
14 #include "ui/gfx/rect_conversions.h" 14 #include "ui/gfx/rect_conversions.h"
15 #include "ui/gfx/safe_integer_conversions.h" 15 #include "ui/gfx/safe_integer_conversions.h"
16 #include "ui/gfx/size_conversions.h" 16 #include "ui/gfx/size_conversions.h"
17 17
18 namespace cc { 18 namespace cc {
19 19
20 namespace {
21
22 const int kTileBundleWidth = 2;
23 const int kTileBundleHeight = 2;
24
25 std::pair<int, int> ComputeTileBundleIndex(int i, int j) {
26 return std::make_pair(i / kTileBundleWidth, j / kTileBundleHeight);
27 }
28
29 }
30
20 scoped_ptr<PictureLayerTiling> PictureLayerTiling::Create( 31 scoped_ptr<PictureLayerTiling> PictureLayerTiling::Create(
21 float contents_scale, 32 float contents_scale,
22 gfx::Size layer_bounds, 33 gfx::Size layer_bounds,
23 PictureLayerTilingClient* client) { 34 PictureLayerTilingClient* client) {
24 return make_scoped_ptr(new PictureLayerTiling(contents_scale, 35 return make_scoped_ptr(new PictureLayerTiling(contents_scale,
25 layer_bounds, 36 layer_bounds,
26 client)); 37 client));
27 } 38 }
28 39
29 PictureLayerTiling::PictureLayerTiling(float contents_scale, 40 PictureLayerTiling::PictureLayerTiling(float contents_scale,
30 gfx::Size layer_bounds, 41 gfx::Size layer_bounds,
31 PictureLayerTilingClient* client) 42 PictureLayerTilingClient* client)
32 : contents_scale_(contents_scale), 43 : contents_scale_(contents_scale),
33 layer_bounds_(layer_bounds), 44 layer_bounds_(layer_bounds),
34 resolution_(NON_IDEAL_RESOLUTION), 45 resolution_(NON_IDEAL_RESOLUTION),
35 client_(client), 46 client_(client),
36 tiling_data_(gfx::Size(), gfx::Size(), true), 47 tiling_data_(gfx::Size(), gfx::Size(), true),
48 bundle_tiling_data_(gfx::Size(), gfx::Size(), true),
37 last_impl_frame_time_in_seconds_(0.0) { 49 last_impl_frame_time_in_seconds_(0.0) {
38 gfx::Size content_bounds = 50 gfx::Size content_bounds =
39 gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds, contents_scale)); 51 gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds, contents_scale));
40 gfx::Size tile_size = client_->CalculateTileSize(content_bounds); 52 gfx::Size tile_size = client_->CalculateTileSize(content_bounds);
41 53
42 DCHECK(!gfx::ToFlooredSize( 54 DCHECK(!gfx::ToFlooredSize(
43 gfx::ScaleSize(layer_bounds, contents_scale)).IsEmpty()) << 55 gfx::ScaleSize(layer_bounds, contents_scale)).IsEmpty()) <<
44 "Tiling created with scale too small as contents become empty." << 56 "Tiling created with scale too small as contents become empty." <<
45 " Layer bounds: " << layer_bounds.ToString() << 57 " Layer bounds: " << layer_bounds.ToString() <<
46 " Contents scale: " << contents_scale; 58 " Contents scale: " << contents_scale;
47 59
48 tiling_data_.SetTotalSize(content_bounds); 60 tiling_data_.SetTotalSize(content_bounds);
49 tiling_data_.SetMaxTextureSize(tile_size); 61 tiling_data_.SetMaxTextureSize(tile_size);
62 bundle_tiling_data_.SetTotalSize(content_bounds);
63 bundle_tiling_data_.SetMaxTextureSize(
64 gfx::Size(tile_size.width() * kTileBundleWidth,
65 tile_size.height() * kTileBundleHeight));
50 } 66 }
51 67
52 PictureLayerTiling::~PictureLayerTiling() { 68 PictureLayerTiling::~PictureLayerTiling() {
53 } 69 }
54 70
55 void PictureLayerTiling::SetClient(PictureLayerTilingClient* client) { 71 void PictureLayerTiling::SetClient(PictureLayerTilingClient* client) {
56 client_ = client; 72 client_ = client;
57 } 73 }
58 74
59 gfx::Rect PictureLayerTiling::ContentRect() const { 75 gfx::Rect PictureLayerTiling::ContentRect() const {
60 return gfx::Rect(tiling_data_.total_size()); 76 return gfx::Rect(tiling_data_.total_size());
61 } 77 }
62 78
63 gfx::SizeF PictureLayerTiling::ContentSizeF() const { 79 gfx::SizeF PictureLayerTiling::ContentSizeF() const {
64 return gfx::ScaleSize(layer_bounds_, contents_scale_); 80 return gfx::ScaleSize(layer_bounds_, contents_scale_);
65 } 81 }
66 82
67 Tile* PictureLayerTiling::TileAt(int i, int j) const { 83 TileBundle* PictureLayerTiling::CreateBundleForTileAt(
68 TileMap::const_iterator iter = tiles_.find(TileMapKey(i, j)); 84 int i,
69 if (iter == tiles_.end()) 85 int j,
70 return NULL; 86 const PictureLayerTiling* twin_tiling) {
71 return iter->second.get(); 87 TileBundleMapKey key = ComputeTileBundleIndex(i, j);
88 DCHECK(tile_bundles_.find(key) == tile_bundles_.end());
89
90 scoped_refptr<TileBundle> candidate_bundle = NULL;
91
92 // Always try to get the twin bundle first. TileBundles are always shared
93 // between trees.
94 if (twin_tiling &&
95 tiling_data_.max_texture_size() ==
96 twin_tiling->tiling_data_.max_texture_size()) {
97 candidate_bundle = twin_tiling->TileBundleAt(key.first, key.second);
98 }
99
100 // If we couldn't get a tile bundle, create a new one.
101 if (!candidate_bundle) {
102 candidate_bundle = client_->CreateTileBundle(key.first * kTileBundleWidth,
103 key.second * kTileBundleHeight,
104 kTileBundleWidth,
105 kTileBundleHeight);
106 }
107 candidate_bundle->SwapTilesIfRequired();
108 tile_bundles_[key] = candidate_bundle;
109 return candidate_bundle.get();
72 } 110 }
73 111
74 void PictureLayerTiling::CreateTile(int i, 112 TileBundle* PictureLayerTiling::TileBundleContainingTileAt(int i, int j) const {
113 TileBundleMapKey key = ComputeTileBundleIndex(i, j);
114 return TileBundleAt(key.first, key.second);
115 }
116
117 TileBundle* PictureLayerTiling::TileBundleAt(int i, int j) const {
118 TileBundleMapKey key(i, j);
119 TileBundleMap::const_iterator it = tile_bundles_.find(key);
120 if (it == tile_bundles_.end())
121 return NULL;
122 it->second->SwapTilesIfRequired();
123 return it->second.get();
124 }
125
126 Tile* PictureLayerTiling::TileAt(WhichTree tree, int i, int j) const {
127 TileBundle* bundle = TileBundleContainingTileAt(i, j);
128 if (!bundle)
129 return NULL;
130 return bundle->TileAt(tree, i, j);
131 }
132
133 void PictureLayerTiling::CreateTile(WhichTree tree,
134 int i,
75 int j, 135 int j,
76 const PictureLayerTiling* twin_tiling) { 136 const PictureLayerTiling* twin_tiling) {
77 TileMapKey key(i, j); 137 TileBundle* bundle = TileBundleContainingTileAt(i, j);
78 DCHECK(tiles_.find(key) == tiles_.end()); 138 if (!bundle)
139 bundle = CreateBundleForTileAt(i, j, twin_tiling);
79 140
80 gfx::Rect paint_rect = tiling_data_.TileBoundsWithBorder(i, j); 141 gfx::Rect paint_rect = tiling_data_.TileBoundsWithBorder(i, j);
81 gfx::Rect tile_rect = paint_rect; 142 gfx::Rect tile_rect = paint_rect;
82 tile_rect.set_size(tiling_data_.max_texture_size()); 143 tile_rect.set_size(tiling_data_.max_texture_size());
83 144
84 // Check our twin for a valid tile. 145 // Check our twin for a valid tile.
85 if (twin_tiling && 146 WhichTree twin_tree = (tree == ACTIVE_TREE) ? PENDING_TREE : ACTIVE_TREE;
86 tiling_data_.max_texture_size() == 147 if (Tile* candidate_tile = bundle->TileAt(twin_tree, i, j)) {
87 twin_tiling->tiling_data_.max_texture_size()) { 148 gfx::Rect rect =
88 if (Tile* candidate_tile = twin_tiling->TileAt(i, j)) { 149 gfx::ScaleToEnclosingRect(paint_rect, 1.0f / contents_scale_);
89 gfx::Rect rect = 150 if (!client_->GetInvalidation()->Intersects(rect)) {
90 gfx::ScaleToEnclosingRect(paint_rect, 1.0f / contents_scale_); 151 bundle->AddTileAt(tree, i, j, candidate_tile);
91 if (!client_->GetInvalidation()->Intersects(rect)) { 152 return;
92 tiles_[key] = candidate_tile;
93 return;
94 }
95 } 153 }
96 } 154 }
97 155
98 // Create a new tile because our twin didn't have a valid one. 156 // Create a new tile because our twin didn't have a valid one.
99 scoped_refptr<Tile> tile = client_->CreateTile(this, tile_rect); 157 scoped_refptr<Tile> tile = client_->CreateTile(this, tile_rect);
100 if (tile.get()) 158 if (tile.get())
101 tiles_[key] = tile; 159 bundle->AddTileAt(tree, i, j, tile);
160 }
161
162 bool PictureLayerTiling::RemoveTile(WhichTree tree, int i, int j) {
163 TileBundleMapKey key = ComputeTileBundleIndex(i, j);
164 TileBundleMap::iterator it = tile_bundles_.find(key);
165 if (it == tile_bundles_.end())
166 return false;
167
168 it->second->SwapTilesIfRequired();
169 return it->second->RemoveTileAt(tree, i, j);
170 }
171
172 void PictureLayerTiling::RemoveBundleIfEmptyContainingTileAt(int i, int j) {
173 TileBundleMapKey key = ComputeTileBundleIndex(i, j);
174 TileBundleMap::iterator it = tile_bundles_.find(key);
175 if (it == tile_bundles_.end())
176 return;
177
178 if (it->second->IsEmpty())
179 tile_bundles_.erase(it);
102 } 180 }
103 181
104 Region PictureLayerTiling::OpaqueRegionInContentRect( 182 Region PictureLayerTiling::OpaqueRegionInContentRect(
105 gfx::Rect content_rect) const { 183 gfx::Rect content_rect) const {
106 Region opaque_region; 184 Region opaque_region;
107 // TODO(enne): implement me 185 // TODO(enne): implement me
108 return opaque_region; 186 return opaque_region;
109 } 187 }
110 188
111 void PictureLayerTiling::SetCanUseLCDText(bool can_use_lcd_text) { 189 void PictureLayerTiling::SetCanUseLCDText(bool can_use_lcd_text) {
112 for (TileMap::iterator it = tiles_.begin(); it != tiles_.end(); ++it) 190 // TODO(vmpstr): This can be done per bundle with results used
113 it->second->set_can_use_lcd_text(can_use_lcd_text); 191 // in tile manager.
192 WhichTree tree = client_->IsActive() ? ACTIVE_TREE : PENDING_TREE;
193 for (TileBundleMap::iterator it = tile_bundles_.begin();
194 it != tile_bundles_.end();
195 ++it) {
196 for (TileBundle::Iterator tile_it(it->second, tree);
197 tile_it;
198 ++tile_it)
199 tile_it->set_can_use_lcd_text(can_use_lcd_text);
200 }
114 } 201 }
115 202
116 void PictureLayerTiling::CreateMissingTilesInLiveTilesRect() { 203 void PictureLayerTiling::CreateMissingTilesInLiveTilesRect() {
204 DCHECK(client_->IsPending());
205
117 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); 206 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this);
118 for (TilingData::Iterator iter(&tiling_data_, live_tiles_rect_); iter; 207 for (TilingData::Iterator iter(&tiling_data_, live_tiles_rect_); iter;
119 ++iter) { 208 ++iter) {
120 TileMapKey key = iter.index(); 209 int tile_x = iter.index_x();
121 TileMap::iterator find = tiles_.find(key); 210 int tile_y = iter.index_y();
122 if (find != tiles_.end()) 211 Tile* tile = TileAt(PENDING_TREE, tile_x, tile_y);
212 if (tile)
123 continue; 213 continue;
124 CreateTile(key.first, key.second, twin_tiling); 214 CreateTile(PENDING_TREE, tile_x, tile_y, twin_tiling);
125 } 215 }
126 } 216 }
127 217
128 void PictureLayerTiling::SetLayerBounds(gfx::Size layer_bounds) { 218 void PictureLayerTiling::SetLayerBounds(gfx::Size layer_bounds) {
129 if (layer_bounds_ == layer_bounds) 219 if (layer_bounds_ == layer_bounds)
130 return; 220 return;
131 221
222 DCHECK(client_->IsPending());
132 DCHECK(!layer_bounds.IsEmpty()); 223 DCHECK(!layer_bounds.IsEmpty());
133 224
134 gfx::Size old_layer_bounds = layer_bounds_; 225 gfx::Size old_layer_bounds = layer_bounds_;
135 layer_bounds_ = layer_bounds; 226 layer_bounds_ = layer_bounds;
136 gfx::Size old_content_bounds = tiling_data_.total_size(); 227 gfx::Size old_content_bounds = tiling_data_.total_size();
137 gfx::Size content_bounds = 228 gfx::Size content_bounds =
138 gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds_, contents_scale_)); 229 gfx::ToCeiledSize(gfx::ScaleSize(layer_bounds_, contents_scale_));
139 230
140 gfx::Size tile_size = client_->CalculateTileSize(content_bounds); 231 gfx::Size tile_size = client_->CalculateTileSize(content_bounds);
141 if (tile_size != tiling_data_.max_texture_size()) { 232 if (tile_size != tiling_data_.max_texture_size()) {
142 tiling_data_.SetTotalSize(content_bounds); 233 tiling_data_.SetTotalSize(content_bounds);
143 tiling_data_.SetMaxTextureSize(tile_size); 234 tiling_data_.SetMaxTextureSize(tile_size);
235 bundle_tiling_data_.SetTotalSize(content_bounds);
236 bundle_tiling_data_.SetMaxTextureSize(
237 gfx::Size(tile_size.width() * kTileBundleWidth,
238 tile_size.height() * kTileBundleHeight));
144 Reset(); 239 Reset();
145 return; 240 return;
146 } 241 }
147 242
148 // Any tiles outside our new bounds are invalid and should be dropped. 243 // Any tiles outside our new bounds are invalid and should be dropped.
149 gfx::Rect bounded_live_tiles_rect(live_tiles_rect_); 244 gfx::Rect bounded_live_tiles_rect(live_tiles_rect_);
150 bounded_live_tiles_rect.Intersect(gfx::Rect(content_bounds)); 245 bounded_live_tiles_rect.Intersect(gfx::Rect(content_bounds));
151 SetLiveTilesRect(bounded_live_tiles_rect); 246 SetLiveTilesRect(PENDING_TREE, bounded_live_tiles_rect);
152 tiling_data_.SetTotalSize(content_bounds); 247 tiling_data_.SetTotalSize(content_bounds);
248 bundle_tiling_data_.SetTotalSize(content_bounds);
153 249
154 // Create tiles for newly exposed areas. 250 // Create tiles for newly exposed areas.
155 Region layer_region((gfx::Rect(layer_bounds_))); 251 Region layer_region((gfx::Rect(layer_bounds_)));
156 layer_region.Subtract(gfx::Rect(old_layer_bounds)); 252 layer_region.Subtract(gfx::Rect(old_layer_bounds));
157 Invalidate(layer_region); 253 Invalidate(layer_region);
158 } 254 }
159 255
160 void PictureLayerTiling::Invalidate(const Region& layer_region) { 256 void PictureLayerTiling::Invalidate(const Region& layer_region) {
161 std::vector<TileMapKey> new_tile_keys; 257 DCHECK(client_->IsPending());
258
259 std::vector<std::pair<int, int> > new_tile_keys;
162 for (Region::Iterator iter(layer_region); iter.has_rect(); iter.next()) { 260 for (Region::Iterator iter(layer_region); iter.has_rect(); iter.next()) {
163 gfx::Rect layer_rect = iter.rect(); 261 gfx::Rect layer_rect = iter.rect();
164 gfx::Rect content_rect = 262 gfx::Rect content_rect =
165 gfx::ScaleToEnclosingRect(layer_rect, contents_scale_); 263 gfx::ScaleToEnclosingRect(layer_rect, contents_scale_);
166 content_rect.Intersect(live_tiles_rect_); 264 content_rect.Intersect(live_tiles_rect_);
167 if (content_rect.IsEmpty()) 265 if (content_rect.IsEmpty())
168 continue; 266 continue;
169 for (TilingData::Iterator iter(&tiling_data_, content_rect); iter; ++iter) { 267 for (TilingData::Iterator iter(&tiling_data_, content_rect); iter; ++iter) {
170 TileMapKey key(iter.index()); 268 int tile_x = iter.index_x();
171 TileMap::iterator find = tiles_.find(key); 269 int tile_y = iter.index_y();
172 if (find == tiles_.end()) 270
173 continue; 271 // If there is no bundle for the given tile, we can skip.
174 tiles_.erase(find); 272 bool deleted = RemoveTile(PENDING_TREE, tile_x, tile_y);
175 new_tile_keys.push_back(key); 273 if (deleted)
274 new_tile_keys.push_back(std::make_pair(tile_x, tile_y));
176 } 275 }
177 } 276 }
178 277
179 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); 278 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this);
180 for (size_t i = 0; i < new_tile_keys.size(); ++i) 279 for (size_t i = 0; i < new_tile_keys.size(); ++i) {
181 CreateTile(new_tile_keys[i].first, new_tile_keys[i].second, twin_tiling); 280 CreateTile(PENDING_TREE,
281 new_tile_keys[i].first,
282 new_tile_keys[i].second,
283 twin_tiling);
284 }
182 } 285 }
183 286
184 PictureLayerTiling::CoverageIterator::CoverageIterator() 287 PictureLayerTiling::CoverageIterator::CoverageIterator()
185 : tiling_(NULL), 288 : tiling_(NULL),
186 current_tile_(NULL), 289 current_tile_(NULL),
187 tile_i_(0), 290 tile_i_(0),
188 tile_j_(0), 291 tile_j_(0),
189 left_(0), 292 left_(0),
190 top_(0), 293 top_(0),
191 right_(-1), 294 right_(-1),
192 bottom_(-1) { 295 bottom_(-1) {
193 } 296 }
194 297
195 PictureLayerTiling::CoverageIterator::CoverageIterator( 298 PictureLayerTiling::CoverageIterator::CoverageIterator(
196 const PictureLayerTiling* tiling, 299 const PictureLayerTiling* tiling,
197 float dest_scale, 300 float dest_scale,
198 gfx::Rect dest_rect) 301 gfx::Rect dest_rect)
199 : tiling_(tiling), 302 : tiling_(tiling),
200 dest_rect_(dest_rect), 303 dest_rect_(dest_rect),
201 dest_to_content_scale_(0), 304 dest_to_content_scale_(0),
202 current_tile_(NULL), 305 current_tile_(NULL),
203 tile_i_(0), 306 tile_i_(0),
204 tile_j_(0), 307 tile_j_(0),
205 left_(0), 308 left_(0),
206 top_(0), 309 top_(0),
207 right_(-1), 310 right_(-1),
208 bottom_(-1) { 311 bottom_(-1),
312 tree_(tiling->client_->IsActive() ? ACTIVE_TREE : PENDING_TREE) {
209 DCHECK(tiling_); 313 DCHECK(tiling_);
210 if (dest_rect_.IsEmpty()) 314 if (dest_rect_.IsEmpty())
211 return; 315 return;
212 316
213 dest_to_content_scale_ = tiling_->contents_scale_ / dest_scale; 317 dest_to_content_scale_ = tiling_->contents_scale_ / dest_scale;
214 // This is the maximum size that the dest rect can be, given the content size. 318 // This is the maximum size that the dest rect can be, given the content size.
215 gfx::Size dest_content_size = gfx::ToCeiledSize(gfx::ScaleSize( 319 gfx::Size dest_content_size = gfx::ToCeiledSize(gfx::ScaleSize(
216 tiling_->ContentRect().size(), 320 tiling_->ContentRect().size(),
217 1 / dest_to_content_scale_, 321 1 / dest_to_content_scale_,
218 1 / dest_to_content_scale_)); 322 1 / dest_to_content_scale_));
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after
253 if (tile_i_ > right_) { 357 if (tile_i_ > right_) {
254 tile_i_ = left_; 358 tile_i_ = left_;
255 tile_j_++; 359 tile_j_++;
256 new_row = true; 360 new_row = true;
257 if (tile_j_ > bottom_) { 361 if (tile_j_ > bottom_) {
258 current_tile_ = NULL; 362 current_tile_ = NULL;
259 return *this; 363 return *this;
260 } 364 }
261 } 365 }
262 366
263 current_tile_ = tiling_->TileAt(tile_i_, tile_j_); 367 current_tile_ = tiling_->TileAt(tree_, tile_i_, tile_j_);
264 368
265 // Calculate the current geometry rect. Due to floating point rounding 369 // Calculate the current geometry rect. Due to floating point rounding
266 // and ToEnclosingRect, tiles might overlap in destination space on the 370 // and ToEnclosingRect, tiles might overlap in destination space on the
267 // edges. 371 // edges.
268 gfx::Rect last_geometry_rect = current_geometry_rect_; 372 gfx::Rect last_geometry_rect = current_geometry_rect_;
269 373
270 gfx::Rect content_rect = tiling_->tiling_data_.TileBounds(tile_i_, tile_j_); 374 gfx::Rect content_rect = tiling_->tiling_data_.TileBounds(tile_i_, tile_j_);
271 375
272 current_geometry_rect_ = 376 current_geometry_rect_ =
273 gfx::ScaleToEnclosingRect(content_rect, 377 gfx::ScaleToEnclosingRect(content_rect,
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after
309 return current_geometry_rect_; 413 return current_geometry_rect_;
310 } 414 }
311 415
312 gfx::Rect 416 gfx::Rect
313 PictureLayerTiling::CoverageIterator::full_tile_geometry_rect() const { 417 PictureLayerTiling::CoverageIterator::full_tile_geometry_rect() const {
314 gfx::Rect rect = tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_); 418 gfx::Rect rect = tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_);
315 rect.set_size(tiling_->tiling_data_.max_texture_size()); 419 rect.set_size(tiling_->tiling_data_.max_texture_size());
316 return rect; 420 return rect;
317 } 421 }
318 422
423 TilePriority PictureLayerTiling::CoverageIterator::priority() {
424 TileBundle* bundle = tiling_->TileBundleContainingTileAt(tile_i_, tile_j_);
425 if (bundle)
426 return bundle->GetPriority(tree_);
427 return TilePriority();
428 }
429
430 void PictureLayerTiling::CoverageIterator::SetPriorityForTesting(
431 const TilePriority& priority) {
432 TileBundle* bundle = tiling_->TileBundleContainingTileAt(tile_i_, tile_j_);
433 bundle->SetPriority(tree_, priority);
434 }
435
319 gfx::RectF PictureLayerTiling::CoverageIterator::texture_rect() const { 436 gfx::RectF PictureLayerTiling::CoverageIterator::texture_rect() const {
320 gfx::PointF tex_origin = 437 gfx::PointF tex_origin =
321 tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_).origin(); 438 tiling_->tiling_data_.TileBoundsWithBorder(tile_i_, tile_j_).origin();
322 439
323 // Convert from dest space => content space => texture space. 440 // Convert from dest space => content space => texture space.
324 gfx::RectF texture_rect(current_geometry_rect_); 441 gfx::RectF texture_rect(current_geometry_rect_);
325 texture_rect.Scale(dest_to_content_scale_, 442 texture_rect.Scale(dest_to_content_scale_,
326 dest_to_content_scale_); 443 dest_to_content_scale_);
327 texture_rect.Offset(-tex_origin.OffsetFromOrigin()); 444 texture_rect.Offset(-tex_origin.OffsetFromOrigin());
328 texture_rect.Intersect(tiling_->ContentRect()); 445 texture_rect.Intersect(tiling_->ContentRect());
329 446
330 return texture_rect; 447 return texture_rect;
331 } 448 }
332 449
333 gfx::Size PictureLayerTiling::CoverageIterator::texture_size() const { 450 gfx::Size PictureLayerTiling::CoverageIterator::texture_size() const {
334 return tiling_->tiling_data_.max_texture_size(); 451 return tiling_->tiling_data_.max_texture_size();
335 } 452 }
336 453
337 void PictureLayerTiling::Reset() { 454 void PictureLayerTiling::Reset() {
338 live_tiles_rect_ = gfx::Rect(); 455 live_tiles_rect_ = gfx::Rect();
339 tiles_.clear(); 456 tile_bundles_.clear();
340 } 457 }
341 458
342 void PictureLayerTiling::UpdateTilePriorities( 459 void PictureLayerTiling::UpdateTilePriorities(
343 WhichTree tree, 460 WhichTree tree,
344 gfx::Size device_viewport, 461 gfx::Size device_viewport,
345 gfx::Rect viewport_in_layer_space, 462 gfx::Rect viewport_in_layer_space,
346 gfx::Rect visible_layer_rect, 463 gfx::Rect visible_layer_rect,
347 gfx::Size last_layer_bounds, 464 gfx::Size last_layer_bounds,
348 gfx::Size current_layer_bounds, 465 gfx::Size current_layer_bounds,
349 float last_layer_contents_scale, 466 float last_layer_contents_scale,
(...skipping 25 matching lines...) Expand all
375 ? viewport_in_content_space 492 ? viewport_in_content_space
376 : visible_content_rect; 493 : visible_content_rect;
377 gfx::Rect interest_rect = ExpandRectEquallyToAreaBoundedBy( 494 gfx::Rect interest_rect = ExpandRectEquallyToAreaBoundedBy(
378 starting_rect, 495 starting_rect,
379 interest_rect_area, 496 interest_rect_area,
380 ContentRect(), 497 ContentRect(),
381 &expansion_cache_); 498 &expansion_cache_);
382 DCHECK(interest_rect.IsEmpty() || 499 DCHECK(interest_rect.IsEmpty() ||
383 ContentRect().Contains(interest_rect)); 500 ContentRect().Contains(interest_rect));
384 501
385 SetLiveTilesRect(interest_rect); 502 SetLiveTilesRect(tree, interest_rect);
386 503
387 double time_delta = 0; 504 double time_delta = 0;
388 if (last_impl_frame_time_in_seconds_ != 0.0 && 505 if (last_impl_frame_time_in_seconds_ != 0.0 &&
389 last_layer_bounds == current_layer_bounds) { 506 last_layer_bounds == current_layer_bounds) {
390 time_delta = 507 time_delta =
391 current_frame_time_in_seconds - last_impl_frame_time_in_seconds_; 508 current_frame_time_in_seconds - last_impl_frame_time_in_seconds_;
392 } 509 }
393 510
394 gfx::Rect view_rect(device_viewport); 511 gfx::Rect view_rect(device_viewport);
395 float current_scale = current_layer_contents_scale / contents_scale_; 512 float current_scale = current_layer_contents_scale / contents_scale_;
396 float last_scale = last_layer_contents_scale / contents_scale_; 513 float last_scale = last_layer_contents_scale / contents_scale_;
397 514
398 // Fast path tile priority calculation when both transforms are translations. 515 // Fast path tile priority calculation when both transforms are translations.
399 if (last_screen_transform.IsApproximatelyIdentityOrTranslation( 516 if (last_screen_transform.IsApproximatelyIdentityOrTranslation(
400 std::numeric_limits<float>::epsilon()) && 517 std::numeric_limits<float>::epsilon()) &&
401 current_screen_transform.IsApproximatelyIdentityOrTranslation( 518 current_screen_transform.IsApproximatelyIdentityOrTranslation(
402 std::numeric_limits<float>::epsilon())) { 519 std::numeric_limits<float>::epsilon())) {
403 gfx::Vector2dF current_offset( 520 gfx::Vector2dF current_offset(
404 current_screen_transform.matrix().get(0, 3), 521 current_screen_transform.matrix().get(0, 3),
405 current_screen_transform.matrix().get(1, 3)); 522 current_screen_transform.matrix().get(1, 3));
406 gfx::Vector2dF last_offset( 523 gfx::Vector2dF last_offset(
407 last_screen_transform.matrix().get(0, 3), 524 last_screen_transform.matrix().get(0, 3),
408 last_screen_transform.matrix().get(1, 3)); 525 last_screen_transform.matrix().get(1, 3));
409 526
410 for (TilingData::Iterator iter(&tiling_data_, interest_rect); 527 for (TilingData::Iterator iter(&bundle_tiling_data_, interest_rect);
411 iter; ++iter) { 528 iter; ++iter) {
412 TileMap::iterator find = tiles_.find(iter.index()); 529 int bundle_x = iter.index_x();
413 if (find == tiles_.end()) 530 int bundle_y = iter.index_y();
531 TileBundle* bundle = TileBundleAt(bundle_x, bundle_y);
532 if (!bundle)
414 continue; 533 continue;
415 Tile* tile = find->second.get();
416 534
417 gfx::Rect tile_bounds = 535 gfx::Rect bundle_bounds =
418 tiling_data_.TileBounds(iter.index_x(), iter.index_y()); 536 bundle_tiling_data_.TileBounds(bundle_x, bundle_y);
419 gfx::RectF current_screen_rect = gfx::ScaleRect( 537 gfx::RectF current_screen_rect =
420 tile_bounds, 538 gfx::ScaleRect(bundle_bounds, current_scale, current_scale) +
421 current_scale, 539 current_offset;
422 current_scale) + current_offset; 540 gfx::RectF last_screen_rect =
423 gfx::RectF last_screen_rect = gfx::ScaleRect( 541 gfx::ScaleRect(bundle_bounds, last_scale, last_scale) +
424 tile_bounds, 542 last_offset;
425 last_scale,
426 last_scale) + last_offset;
427 543
428 float distance_to_visible_in_pixels = 544 float distance_to_visible_in_pixels =
429 TilePriority::manhattanDistance(current_screen_rect, view_rect); 545 TilePriority::manhattanDistance(current_screen_rect, view_rect);
430 546
431 float time_to_visible_in_seconds = 547 float time_to_visible_in_seconds =
432 TilePriority::TimeForBoundsToIntersect( 548 TilePriority::TimeForBoundsToIntersect(
433 last_screen_rect, current_screen_rect, time_delta, view_rect); 549 last_screen_rect, current_screen_rect, time_delta, view_rect);
434 TilePriority priority( 550 TilePriority priority(
435 resolution_, 551 resolution_,
436 time_to_visible_in_seconds, 552 time_to_visible_in_seconds,
437 distance_to_visible_in_pixels); 553 distance_to_visible_in_pixels);
438 tile->SetPriority(tree, priority); 554
555 bundle->SetPriority(tree, priority);
439 } 556 }
440 } else if (!last_screen_transform.HasPerspective() && 557 } else if (!last_screen_transform.HasPerspective() &&
441 !current_screen_transform.HasPerspective()) { 558 !current_screen_transform.HasPerspective()) {
442 // Secondary fast path that can be applied for any affine transforms. 559 // Secondary fast path that can be applied for any affine transforms.
443 560
444 // Initialize the necessary geometry in screen space, so that we can 561 // Initialize the necessary geometry in screen space, so that we can
445 // iterate over tiles in screen space without needing a costly transform 562 // iterate over tiles in screen space without needing a costly transform
446 // mapping for each tile. 563 // mapping for each tile.
447 564
448 // Apply screen space transform to the local origin point (0, 0); only the 565 // Apply screen space transform to the local origin point (0, 0); only the
449 // translation component is needed and can be initialized directly. 566 // translation component is needed and can be initialized directly.
450 gfx::Point current_screen_space_origin( 567 gfx::Point current_screen_space_origin(
451 current_screen_transform.matrix().get(0, 3), 568 current_screen_transform.matrix().get(0, 3),
452 current_screen_transform.matrix().get(1, 3)); 569 current_screen_transform.matrix().get(1, 3));
453 570
454 gfx::Point last_screen_space_origin( 571 gfx::Point last_screen_space_origin(
455 last_screen_transform.matrix().get(0, 3), 572 last_screen_transform.matrix().get(0, 3),
456 last_screen_transform.matrix().get(1, 3)); 573 last_screen_transform.matrix().get(1, 3));
457 574
458 float current_tile_width = tiling_data_.TileSizeX(0) * current_scale; 575 float current_bundle_width =
459 float last_tile_width = tiling_data_.TileSizeX(0) * last_scale; 576 bundle_tiling_data_.TileSizeX(0) * current_scale;
460 float current_tile_height = tiling_data_.TileSizeY(0) * current_scale; 577 float last_bundle_width =
461 float last_tile_height = tiling_data_.TileSizeY(0) * last_scale; 578 bundle_tiling_data_.TileSizeX(0) * last_scale;
579 float current_bundle_height =
580 bundle_tiling_data_.TileSizeY(0) * current_scale;
581 float last_bundle_height =
582 bundle_tiling_data_.TileSizeY(0) * last_scale;
462 583
463 // Apply screen space transform to local basis vectors (tile_width, 0) and 584 // Apply screen space transform to local basis vectors (tile_width, 0) and
464 // (0, tile_height); the math simplifies and can be initialized directly. 585 // (0, tile_height); the math simplifies and can be initialized directly.
465 gfx::Vector2dF current_horizontal( 586 gfx::Vector2dF current_horizontal(
466 current_screen_transform.matrix().get(0, 0) * current_tile_width, 587 current_screen_transform.matrix().get(0, 0) * current_bundle_width,
467 current_screen_transform.matrix().get(1, 0) * current_tile_width); 588 current_screen_transform.matrix().get(1, 0) * current_bundle_width);
468 gfx::Vector2dF current_vertical( 589 gfx::Vector2dF current_vertical(
469 current_screen_transform.matrix().get(0, 1) * current_tile_height, 590 current_screen_transform.matrix().get(0, 1) * current_bundle_height,
470 current_screen_transform.matrix().get(1, 1) * current_tile_height); 591 current_screen_transform.matrix().get(1, 1) * current_bundle_height);
471 592
472 gfx::Vector2dF last_horizontal( 593 gfx::Vector2dF last_horizontal(
473 last_screen_transform.matrix().get(0, 0) * last_tile_width, 594 last_screen_transform.matrix().get(0, 0) * last_bundle_width,
474 last_screen_transform.matrix().get(1, 0) * last_tile_width); 595 last_screen_transform.matrix().get(1, 0) * last_bundle_width);
475 gfx::Vector2dF last_vertical( 596 gfx::Vector2dF last_vertical(
476 last_screen_transform.matrix().get(0, 1) * last_tile_height, 597 last_screen_transform.matrix().get(0, 1) * last_bundle_height,
477 last_screen_transform.matrix().get(1, 1) * last_tile_height); 598 last_screen_transform.matrix().get(1, 1) * last_bundle_height);
478 599
479 for (TilingData::Iterator iter(&tiling_data_, interest_rect); 600 for (TilingData::Iterator iter(&bundle_tiling_data_, interest_rect);
480 iter; ++iter) { 601 iter; ++iter) {
481 TileMap::iterator find = tiles_.find(iter.index()); 602 int bundle_x = iter.index_x();
482 if (find == tiles_.end()) 603 int bundle_y = iter.index_y();
604 TileBundle* bundle = TileBundleAt(bundle_x, bundle_y);
605 if (!bundle)
483 continue; 606 continue;
484 607
485 Tile* tile = find->second.get(); 608 gfx::PointF current_bundle_origin = current_screen_space_origin +
486 609 ScaleVector2d(current_horizontal, bundle_x) +
487 int i = iter.index_x(); 610 ScaleVector2d(current_vertical, bundle_y);
488 int j = iter.index_y(); 611 gfx::PointF last_bundle_origin = last_screen_space_origin +
489 gfx::PointF current_tile_origin = current_screen_space_origin + 612 ScaleVector2d(last_horizontal, bundle_x) +
490 ScaleVector2d(current_horizontal, i) + 613 ScaleVector2d(last_vertical, bundle_y);
491 ScaleVector2d(current_vertical, j);
492 gfx::PointF last_tile_origin = last_screen_space_origin +
493 ScaleVector2d(last_horizontal, i) +
494 ScaleVector2d(last_vertical, j);
495 614
496 gfx::RectF current_screen_rect = gfx::QuadF( 615 gfx::RectF current_screen_rect = gfx::QuadF(
497 current_tile_origin, 616 current_bundle_origin,
498 current_tile_origin + current_horizontal, 617 current_bundle_origin + current_horizontal,
499 current_tile_origin + current_horizontal + current_vertical, 618 current_bundle_origin + current_horizontal + current_vertical,
500 current_tile_origin + current_vertical).BoundingBox(); 619 current_bundle_origin + current_vertical).BoundingBox();
501 620
502 gfx::RectF last_screen_rect = gfx::QuadF( 621 gfx::RectF last_screen_rect = gfx::QuadF(
503 last_tile_origin, 622 last_bundle_origin,
504 last_tile_origin + last_horizontal, 623 last_bundle_origin + last_horizontal,
505 last_tile_origin + last_horizontal + last_vertical, 624 last_bundle_origin + last_horizontal + last_vertical,
506 last_tile_origin + last_vertical).BoundingBox(); 625 last_bundle_origin + last_vertical).BoundingBox();
507 626
508 float distance_to_visible_in_pixels = 627 float distance_to_visible_in_pixels =
509 TilePriority::manhattanDistance(current_screen_rect, view_rect); 628 TilePriority::manhattanDistance(current_screen_rect, view_rect);
510 629
511 float time_to_visible_in_seconds = 630 float time_to_visible_in_seconds =
512 TilePriority::TimeForBoundsToIntersect( 631 TilePriority::TimeForBoundsToIntersect(
513 last_screen_rect, current_screen_rect, time_delta, view_rect); 632 last_screen_rect, current_screen_rect, time_delta, view_rect);
514 TilePriority priority( 633 TilePriority priority(
515 resolution_, 634 resolution_,
516 time_to_visible_in_seconds, 635 time_to_visible_in_seconds,
517 distance_to_visible_in_pixels); 636 distance_to_visible_in_pixels);
518 tile->SetPriority(tree, priority); 637
638 bundle->SetPriority(tree, priority);
519 } 639 }
520 } else { 640 } else {
521 for (TilingData::Iterator iter(&tiling_data_, interest_rect); 641 for (TilingData::Iterator iter(&bundle_tiling_data_, interest_rect);
522 iter; ++iter) { 642 iter; ++iter) {
523 TileMap::iterator find = tiles_.find(iter.index()); 643 int bundle_x = iter.index_x();
524 if (find == tiles_.end()) 644 int bundle_y = iter.index_y();
645 TileBundle* bundle = TileBundleAt(bundle_x, bundle_y);
646 if (!bundle)
525 continue; 647 continue;
526 Tile* tile = find->second.get();
527 648
528 gfx::Rect tile_bounds = 649 gfx::Rect bundle_bounds =
529 tiling_data_.TileBounds(iter.index_x(), iter.index_y()); 650 bundle_tiling_data_.TileBounds(bundle_x, bundle_y);
530 gfx::RectF current_layer_content_rect = gfx::ScaleRect( 651 gfx::RectF current_layer_content_rect = gfx::ScaleRect(
531 tile_bounds, 652 bundle_bounds,
532 current_scale, 653 current_scale,
533 current_scale); 654 current_scale);
534 gfx::RectF current_screen_rect = MathUtil::MapClippedRect( 655 gfx::RectF current_screen_rect = MathUtil::MapClippedRect(
535 current_screen_transform, current_layer_content_rect); 656 current_screen_transform, current_layer_content_rect);
536 gfx::RectF last_layer_content_rect = gfx::ScaleRect( 657 gfx::RectF last_layer_content_rect = gfx::ScaleRect(
537 tile_bounds, 658 bundle_bounds,
538 last_scale, 659 last_scale,
539 last_scale); 660 last_scale);
540 gfx::RectF last_screen_rect = MathUtil::MapClippedRect( 661 gfx::RectF last_screen_rect = MathUtil::MapClippedRect(
541 last_screen_transform, last_layer_content_rect); 662 last_screen_transform, last_layer_content_rect);
542 663
543 float distance_to_visible_in_pixels = 664 float distance_to_visible_in_pixels =
544 TilePriority::manhattanDistance(current_screen_rect, view_rect); 665 TilePriority::manhattanDistance(current_screen_rect, view_rect);
545 666
546 float time_to_visible_in_seconds = 667 float time_to_visible_in_seconds =
547 TilePriority::TimeForBoundsToIntersect( 668 TilePriority::TimeForBoundsToIntersect(
548 last_screen_rect, current_screen_rect, time_delta, view_rect); 669 last_screen_rect, current_screen_rect, time_delta, view_rect);
549 670
550 TilePriority priority( 671 TilePriority priority(
551 resolution_, 672 resolution_,
552 time_to_visible_in_seconds, 673 time_to_visible_in_seconds,
553 distance_to_visible_in_pixels); 674 distance_to_visible_in_pixels);
554 tile->SetPriority(tree, priority); 675
676 bundle->SetPriority(tree, priority);
555 } 677 }
556 } 678 }
557 679
558 last_impl_frame_time_in_seconds_ = current_frame_time_in_seconds; 680 last_impl_frame_time_in_seconds_ = current_frame_time_in_seconds;
559 } 681 }
560 682
561 void PictureLayerTiling::SetLiveTilesRect( 683 void PictureLayerTiling::SetLiveTilesRect(
562 gfx::Rect new_live_tiles_rect) { 684 WhichTree tree, gfx::Rect new_live_tiles_rect) {
enne (OOO) 2013/11/27 22:21:15 Shouldn't this only set the live tiles rect for th
vmpstr 2013/11/27 23:31:57 This gets set in UpdateTilePriorities, which takes
563 DCHECK(new_live_tiles_rect.IsEmpty() || 685 DCHECK(new_live_tiles_rect.IsEmpty() ||
564 ContentRect().Contains(new_live_tiles_rect)); 686 ContentRect().Contains(new_live_tiles_rect));
565 if (live_tiles_rect_ == new_live_tiles_rect) 687 if (live_tiles_rect_ == new_live_tiles_rect)
566 return; 688 return;
567 689
568 // Iterate to delete all tiles outside of our new live_tiles rect. 690 // Iterate to delete all tiles outside of our new live_tiles rect.
569 for (TilingData::DifferenceIterator iter(&tiling_data_, 691 for (TilingData::DifferenceIterator iter(&tiling_data_,
570 live_tiles_rect_, 692 live_tiles_rect_,
571 new_live_tiles_rect); 693 new_live_tiles_rect);
572 iter; 694 iter;
573 ++iter) { 695 ++iter) {
574 TileMapKey key(iter.index()); 696 int tile_x = iter.index_x();
575 TileMap::iterator found = tiles_.find(key); 697 int tile_y = iter.index_y();
698
576 // If the tile was outside of the recorded region, it won't exist even 699 // If the tile was outside of the recorded region, it won't exist even
577 // though it was in the live rect. 700 // though it was in the live rect.
578 if (found != tiles_.end()) 701 RemoveTile(tree, tile_x, tile_y);
579 tiles_.erase(found); 702 RemoveBundleIfEmptyContainingTileAt(tile_x, tile_y);
580 } 703 }
581 704
582 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this); 705 const PictureLayerTiling* twin_tiling = client_->GetTwinTiling(this);
583 706
584 // Iterate to allocate new tiles for all regions with newly exposed area. 707 // Iterate to allocate new tiles for all regions with newly exposed area.
585 for (TilingData::DifferenceIterator iter(&tiling_data_, 708 for (TilingData::DifferenceIterator iter(&tiling_data_,
586 new_live_tiles_rect, 709 new_live_tiles_rect,
587 live_tiles_rect_); 710 live_tiles_rect_);
588 iter; 711 iter;
589 ++iter) { 712 ++iter) {
590 TileMapKey key(iter.index()); 713 CreateTile(tree, iter.index_x(), iter.index_y(), twin_tiling);
591 CreateTile(key.first, key.second, twin_tiling);
592 } 714 }
593 715
594 live_tiles_rect_ = new_live_tiles_rect; 716 live_tiles_rect_ = new_live_tiles_rect;
595 } 717 }
596 718
597 void PictureLayerTiling::DidBecomeRecycled() { 719 void PictureLayerTiling::DidBecomeRecycled() {
598 // DidBecomeActive below will set the active priority for tiles that are 720 // DidBecomeActive below will set the active priority for tiles that are
599 // still in the tree. Calling this first on an active tiling that is becoming 721 // still in the tree. Calling this first on an active tiling that is becoming
600 // recycled takes care of tiles that are no longer in the active tree (eg. 722 // recycled takes care of tiles that are no longer in the active tree (eg.
601 // due to a pending invalidation). 723 // due to a pending invalidation).
602 for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { 724 for (TileBundleMap::const_iterator it = tile_bundles_.begin();
603 it->second->SetPriority(ACTIVE_TREE, TilePriority()); 725 it != tile_bundles_.end();
726 ++it) {
727 it->second->DidBecomeRecycled();
604 } 728 }
605 } 729 }
606 730
607 void PictureLayerTiling::DidBecomeActive() { 731 void PictureLayerTiling::DidBecomeActive() {
608 for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { 732 for (TileBundleMap::const_iterator it = tile_bundles_.begin();
609 it->second->SetPriority(ACTIVE_TREE, it->second->priority(PENDING_TREE)); 733 it != tile_bundles_.end();
610 it->second->SetPriority(PENDING_TREE, TilePriority()); 734 ++it) {
611 735 it->second->DidBecomeActive();
612 // Tile holds a ref onto a picture pile. If the tile never gets invalidated 736 for (TileBundle::Iterator tile_it(it->second.get(), ACTIVE_TREE);
enne (OOO) 2013/11/27 22:21:15 Thanks for this. It makes the loop a lot easier t
613 // and recreated, then that picture pile ref could exist indefinitely. To 737 tile_it;
614 // prevent this, ask the client to update the pile to its own ref. This 738 ++tile_it) {
615 // will cause PicturePileImpls and their clones to get deleted once the 739 // Tile holds a ref onto a picture pile. If the tile never gets
616 // corresponding PictureLayerImpl and any in flight raster jobs go out of 740 // invalidated and recreated, then that picture pile ref could exist
617 // scope. 741 // indefinitely. To prevent this, ask the client to update the pile to
618 client_->UpdatePile(it->second.get()); 742 // its own ref. This will cause PicturePileImpls and their clones to get
743 // deleted once the corresponding PictureLayerImpl and any in flight
744 // raster jobs go out of scope.
745 client_->UpdatePile(*tile_it);
746 }
619 } 747 }
620 } 748 }
621 749
622 void PictureLayerTiling::UpdateTilesToCurrentPile() { 750 void PictureLayerTiling::UpdateTilesToCurrentPile() {
623 for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { 751 for (TileBundleMap::const_iterator it = tile_bundles_.begin();
624 client_->UpdatePile(it->second.get()); 752 it != tile_bundles_.end();
753 ++it) {
754 for (TileBundle::Iterator tile_it(it->second.get(), PENDING_TREE);
755 tile_it;
756 ++tile_it) {
757 client_->UpdatePile(*tile_it);
758 }
625 } 759 }
626 } 760 }
627 761
628 scoped_ptr<base::Value> PictureLayerTiling::AsValue() const { 762 scoped_ptr<base::Value> PictureLayerTiling::AsValue() const {
629 scoped_ptr<base::DictionaryValue> state(new base::DictionaryValue()); 763 scoped_ptr<base::DictionaryValue> state(new base::DictionaryValue());
630 state->SetInteger("num_tiles", tiles_.size()); 764 state->SetInteger("num_tile_bundles", tile_bundles_.size());
631 state->SetDouble("content_scale", contents_scale_); 765 state->SetDouble("content_scale", contents_scale_);
632 state->Set("content_bounds", 766 state->Set("content_bounds",
633 MathUtil::AsValue(ContentRect().size()).release()); 767 MathUtil::AsValue(ContentRect().size()).release());
634 return state.PassAs<base::Value>(); 768 return state.PassAs<base::Value>();
635 } 769 }
636 770
637 size_t PictureLayerTiling::GPUMemoryUsageInBytes() const { 771 size_t PictureLayerTiling::GPUMemoryUsageInBytes() const {
638 size_t amount = 0; 772 size_t amount = 0;
639 for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { 773 for (TileBundleMap::const_iterator it = tile_bundles_.begin();
640 const Tile* tile = it->second.get(); 774 it != tile_bundles_.end();
641 amount += tile->GPUMemoryUsageInBytes(); 775 ++it) {
776 for (TileBundle::Iterator tile_it(it->second.get()); tile_it; ++tile_it)
777 amount += tile_it->GPUMemoryUsageInBytes();
642 } 778 }
643 return amount; 779 return amount;
644 } 780 }
645 781
646 PictureLayerTiling::RectExpansionCache::RectExpansionCache() 782 PictureLayerTiling::RectExpansionCache::RectExpansionCache()
647 : previous_target(0) { 783 : previous_target(0) {
648 } 784 }
649 785
650 namespace { 786 namespace {
651 787
(...skipping 134 matching lines...) Expand 10 before | Expand all | Expand 10 after
786 break; 922 break;
787 } 923 }
788 924
789 gfx::Rect result(origin_x, origin_y, width, height); 925 gfx::Rect result(origin_x, origin_y, width, height);
790 if (cache) 926 if (cache)
791 cache->previous_result = result; 927 cache->previous_result = result;
792 return result; 928 return result;
793 } 929 }
794 930
795 } // namespace cc 931 } // namespace cc
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698