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

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

Issue 18581004: cc: Remove tile ref counting in tile manager. (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: review Created 7 years, 5 months 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
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/tile_manager.h" 5 #include "cc/resources/tile_manager.h"
6 6
7 #include <algorithm> 7 #include <algorithm>
8 #include <limits> 8 #include <limits>
9 #include <string> 9 #include <string>
10 10
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after
79 TileManager::TileManager( 79 TileManager::TileManager(
80 TileManagerClient* client, 80 TileManagerClient* client,
81 ResourceProvider* resource_provider, 81 ResourceProvider* resource_provider,
82 scoped_ptr<RasterWorkerPool> raster_worker_pool, 82 scoped_ptr<RasterWorkerPool> raster_worker_pool,
83 size_t num_raster_threads, 83 size_t num_raster_threads,
84 RenderingStatsInstrumentation* rendering_stats_instrumentation, 84 RenderingStatsInstrumentation* rendering_stats_instrumentation,
85 GLenum texture_format) 85 GLenum texture_format)
86 : client_(client), 86 : client_(client),
87 resource_pool_(ResourcePool::Create(resource_provider)), 87 resource_pool_(ResourcePool::Create(resource_provider)),
88 raster_worker_pool_(raster_worker_pool.Pass()), 88 raster_worker_pool_(raster_worker_pool.Pass()),
89 all_tiles_required_for_activation_have_been_initialized_(true),
90 all_tiles_required_for_activation_have_memory_(true),
89 ever_exceeded_memory_budget_(false), 91 ever_exceeded_memory_budget_(false),
90 rendering_stats_instrumentation_(rendering_stats_instrumentation), 92 rendering_stats_instrumentation_(rendering_stats_instrumentation),
91 did_initialize_visible_tile_(false), 93 did_initialize_visible_tile_(false),
92 texture_format_(texture_format) { 94 texture_format_(texture_format) {
93 raster_worker_pool_->SetClient(this); 95 raster_worker_pool_->SetClient(this);
94 } 96 }
95 97
96 TileManager::~TileManager() { 98 TileManager::~TileManager() {
97 // Reset global state and manage. This should cause 99 // Reset global state and manage. This should cause
98 // our memory usage to drop to zero. 100 // our memory usage to drop to zero.
99 global_state_ = GlobalStateThatImpactsTilePriority(); 101 global_state_ = GlobalStateThatImpactsTilePriority();
100 AssignGpuMemoryToTiles(); 102
101 CleanUpUnusedImageDecodeTasks(); 103 sorted_tiles_.clear();
104 DCHECK_EQ(0u, tiles_.size());
105
106 TileVector empty;
107 ScheduleTasks(empty);
108
102 // This should finish all pending tasks and release any uninitialized 109 // This should finish all pending tasks and release any uninitialized
103 // resources. 110 // resources.
104 raster_worker_pool_->Shutdown(); 111 raster_worker_pool_->Shutdown();
105 raster_worker_pool_->CheckForCompletedTasks(); 112 raster_worker_pool_->CheckForCompletedTasks();
106 DCHECK_EQ(0u, tiles_.size());
107 } 113 }
108 114
109 void TileManager::SetGlobalState( 115 void TileManager::SetGlobalState(
110 const GlobalStateThatImpactsTilePriority& global_state) { 116 const GlobalStateThatImpactsTilePriority& global_state) {
111 global_state_ = global_state; 117 global_state_ = global_state;
112 resource_pool_->SetMaxMemoryUsageBytes( 118 resource_pool_->SetMaxMemoryUsageBytes(
113 global_state_.memory_limit_in_bytes, 119 global_state_.memory_limit_in_bytes,
114 global_state_.unused_memory_limit_in_bytes); 120 global_state_.unused_memory_limit_in_bytes);
115 } 121 }
116 122
117 void TileManager::RegisterTile(Tile* tile) { 123 void TileManager::RegisterTile(Tile* tile) {
118 DCHECK(std::find(tiles_.begin(), tiles_.end(), tile) == tiles_.end());
119 DCHECK(!tile->required_for_activation()); 124 DCHECK(!tile->required_for_activation());
120 tiles_.push_back(tile); 125 DCHECK(tiles_.find(tile->id()) == tiles_.end());
126
127 tiles_[tile->id()] = tile;
121 } 128 }
122 129
123 void TileManager::UnregisterTile(Tile* tile) { 130 void TileManager::UnregisterTile(Tile* tile) {
124 TileVector::iterator raster_iter = 131 FreeResourcesForTile(tile);
125 std::find(tiles_that_need_to_be_rasterized_.begin(),
126 tiles_that_need_to_be_rasterized_.end(),
127 tile);
128 if (raster_iter != tiles_that_need_to_be_rasterized_.end())
129 tiles_that_need_to_be_rasterized_.erase(raster_iter);
130 132
131 tiles_that_need_to_be_initialized_for_activation_.erase(tile); 133 DCHECK(tiles_.find(tile->id()) != tiles_.end());
132 oom_tiles_that_need_to_be_initialized_for_activation_.erase(tile); 134 tiles_.erase(tile->id());
133
134 DCHECK(std::find(tiles_.begin(), tiles_.end(), tile) != tiles_.end());
135 FreeResourcesForTile(tile);
136 tiles_.erase(std::remove(tiles_.begin(), tiles_.end(), tile));
137 } 135 }
138 136
139 bool TileManager::ShouldForceTasksRequiredForActivationToComplete() const { 137 bool TileManager::ShouldForceTasksRequiredForActivationToComplete() const {
140 return GlobalState().tree_priority != SMOOTHNESS_TAKES_PRIORITY; 138 return GlobalState().tree_priority != SMOOTHNESS_TAKES_PRIORITY;
141 } 139 }
142 140
141 void TileManager::UpdateSortedTiles() {
142 TRACE_EVENT0("cc", "TileManager::UpdateSortedTiles");
143
144 // We need to first clear the current sorted tiles, since tiles that are
145 // only kept alive by |sorted_tiles_| need to be freed.
146 sorted_tiles_.clear();
147
148 TileRefVector tiles;
149 tiles.reserve(tiles_.size());
150 for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it)
151 tiles.push_back(make_scoped_refptr(it->second));
152
153 AssignBinsToTiles(&tiles);
154 SortTiles(&tiles);
155 sorted_tiles_.swap(tiles);
156 }
157
143 void TileManager::DidFinishedRunningTasks() { 158 void TileManager::DidFinishedRunningTasks() {
159 TRACE_EVENT0("cc", "TileManager::DidFinishedRunningTasks");
160
144 // When OOM, keep re-assigning memory until we reach a steady state 161 // When OOM, keep re-assigning memory until we reach a steady state
145 // where top-priority tiles are initialized. 162 // where top-priority tiles are initialized.
146 if (!memory_stats_from_last_assign_.bytes_over) 163 if (!memory_stats_from_last_assign_.bytes_over)
147 return; 164 return;
148 165
149 raster_worker_pool_->CheckForCompletedTasks(); 166 raster_worker_pool_->CheckForCompletedTasks();
150 167
151 AssignGpuMemoryToTiles(); 168 TileVector tiles_that_need_to_be_rasterized;
169 TileSet oom_tiles_required_for_activation;
170 AssignGpuMemoryToTiles(sorted_tiles_,
171 &tiles_that_need_to_be_rasterized,
172 &oom_tiles_required_for_activation);
152 173
153 if (!oom_tiles_that_need_to_be_initialized_for_activation_.empty()) 174 if (!oom_tiles_required_for_activation.empty()) {
154 ReassignGpuMemoryToOOMTilesRequiredForActivation(); 175 ReassignGpuMemoryToOOMTilesRequiredForActivation(
176 sorted_tiles_,
177 &tiles_that_need_to_be_rasterized,
178 &oom_tiles_required_for_activation);
179 }
180 all_tiles_required_for_activation_have_memory_ =
181 oom_tiles_required_for_activation.empty();
155 182
156 // |tiles_that_need_to_be_rasterized_| will be empty when we reach a 183 // |tiles_that_need_to_be_rasterized| will be empty when we reach a
157 // steady memory state. Keep scheduling tasks until we reach this state. 184 // steady memory state. Keep scheduling tasks until we reach this state.
158 if (!tiles_that_need_to_be_rasterized_.empty()) { 185 if (!tiles_that_need_to_be_rasterized.empty()) {
159 ScheduleTasks(); 186 ScheduleTasks(tiles_that_need_to_be_rasterized);
160 return; 187 return;
161 } 188 }
162 189
163 // Use on-demand raster for any tiles that have not been been assigned 190 // Use on-demand raster for any tiles that have not been been assigned
164 // memory after reaching a steady memory state. 191 // memory after reaching a steady memory state.
165 for (TileSet::iterator it = 192 for (TileSet::iterator it = oom_tiles_required_for_activation.begin();
166 oom_tiles_that_need_to_be_initialized_for_activation_.begin(); 193 it != oom_tiles_required_for_activation.end();
167 it != oom_tiles_that_need_to_be_initialized_for_activation_.end();
168 ++it) { 194 ++it) {
169 Tile* tile = *it; 195 Tile* tile = *it;
170 ManagedTileState& mts = tile->managed_state(); 196 ManagedTileState& mts = tile->managed_state();
171 mts.tile_versions[mts.raster_mode].set_rasterize_on_demand(); 197 mts.tile_versions[mts.raster_mode].set_rasterize_on_demand();
172 } 198 }
173 oom_tiles_that_need_to_be_initialized_for_activation_.clear();
174 199
175 DCHECK_EQ(0u, tiles_that_need_to_be_initialized_for_activation_.size()); 200 DCHECK(all_tiles_required_for_activation_have_been_initialized_);
176 client_->NotifyReadyToActivate(); 201 client_->NotifyReadyToActivate();
177 } 202 }
178 203
179 void TileManager::DidFinishedRunningTasksRequiredForActivation() { 204 void TileManager::DidFinishedRunningTasksRequiredForActivation() {
180 // This is only a true indication that all tiles required for 205 // This is only a true indication that all tiles required for
181 // activation are initialized when no tiles are OOM. We need to 206 // activation are initialized when no tiles are OOM. We need to
182 // wait for DidFinishRunningTasks() to be called, try to re-assign 207 // wait for DidFinishRunningTasks() to be called, try to re-assign
183 // memory and in worst case use on-demand raster when tiles 208 // memory and in worst case use on-demand raster when tiles
184 // required for activation are OOM. 209 // required for activation are OOM.
185 if (!oom_tiles_that_need_to_be_initialized_for_activation_.empty()) 210 if (!all_tiles_required_for_activation_have_memory_)
186 return; 211 return;
187 212
188 client_->NotifyReadyToActivate(); 213 client_->NotifyReadyToActivate();
189 } 214 }
190 215
191 class BinComparator { 216 class BinComparator {
192 public: 217 public:
193 bool operator() (const Tile* a, const Tile* b) const { 218 bool operator()(const scoped_refptr<Tile> a,
219 const scoped_refptr<Tile> b) const {
194 const ManagedTileState& ams = a->managed_state(); 220 const ManagedTileState& ams = a->managed_state();
195 const ManagedTileState& bms = b->managed_state(); 221 const ManagedTileState& bms = b->managed_state();
196 if (ams.bin[HIGH_PRIORITY_BIN] != bms.bin[HIGH_PRIORITY_BIN]) 222 if (ams.bin[HIGH_PRIORITY_BIN] != bms.bin[HIGH_PRIORITY_BIN])
197 return ams.bin[HIGH_PRIORITY_BIN] < bms.bin[HIGH_PRIORITY_BIN]; 223 return ams.bin[HIGH_PRIORITY_BIN] < bms.bin[HIGH_PRIORITY_BIN];
198 224
199 if (ams.bin[LOW_PRIORITY_BIN] != bms.bin[LOW_PRIORITY_BIN]) 225 if (ams.bin[LOW_PRIORITY_BIN] != bms.bin[LOW_PRIORITY_BIN])
200 return ams.bin[LOW_PRIORITY_BIN] < bms.bin[LOW_PRIORITY_BIN]; 226 return ams.bin[LOW_PRIORITY_BIN] < bms.bin[LOW_PRIORITY_BIN];
201 227
202 if (ams.required_for_activation != bms.required_for_activation) 228 if (ams.required_for_activation != bms.required_for_activation)
203 return ams.required_for_activation; 229 return ams.required_for_activation;
(...skipping 11 matching lines...) Expand all
215 } 241 }
216 242
217 gfx::Rect a_rect = a->content_rect(); 243 gfx::Rect a_rect = a->content_rect();
218 gfx::Rect b_rect = b->content_rect(); 244 gfx::Rect b_rect = b->content_rect();
219 if (a_rect.y() != b_rect.y()) 245 if (a_rect.y() != b_rect.y())
220 return a_rect.y() < b_rect.y(); 246 return a_rect.y() < b_rect.y();
221 return a_rect.x() < b_rect.x(); 247 return a_rect.x() < b_rect.x();
222 } 248 }
223 }; 249 };
224 250
225 void TileManager::AssignBinsToTiles() { 251 void TileManager::AssignBinsToTiles(TileRefVector* tiles) {
226 const TreePriority tree_priority = global_state_.tree_priority; 252 const TreePriority tree_priority = global_state_.tree_priority;
227 253
228 // Memory limit policy works by mapping some bin states to the NEVER bin. 254 // Memory limit policy works by mapping some bin states to the NEVER bin.
229 ManagedTileBin bin_map[NUM_BINS]; 255 ManagedTileBin bin_map[NUM_BINS];
230 if (global_state_.memory_limit_policy == ALLOW_NOTHING) { 256 if (global_state_.memory_limit_policy == ALLOW_NOTHING) {
231 bin_map[NOW_BIN] = NEVER_BIN; 257 bin_map[NOW_BIN] = NEVER_BIN;
232 bin_map[SOON_BIN] = NEVER_BIN; 258 bin_map[SOON_BIN] = NEVER_BIN;
233 bin_map[EVENTUALLY_BIN] = NEVER_BIN; 259 bin_map[EVENTUALLY_BIN] = NEVER_BIN;
234 bin_map[NEVER_BIN] = NEVER_BIN; 260 bin_map[NEVER_BIN] = NEVER_BIN;
235 } else if (global_state_.memory_limit_policy == ALLOW_ABSOLUTE_MINIMUM) { 261 } else if (global_state_.memory_limit_policy == ALLOW_ABSOLUTE_MINIMUM) {
236 bin_map[NOW_BIN] = NOW_BIN; 262 bin_map[NOW_BIN] = NOW_BIN;
237 bin_map[SOON_BIN] = NEVER_BIN; 263 bin_map[SOON_BIN] = NEVER_BIN;
238 bin_map[EVENTUALLY_BIN] = NEVER_BIN; 264 bin_map[EVENTUALLY_BIN] = NEVER_BIN;
239 bin_map[NEVER_BIN] = NEVER_BIN; 265 bin_map[NEVER_BIN] = NEVER_BIN;
240 } else if (global_state_.memory_limit_policy == ALLOW_PREPAINT_ONLY) { 266 } else if (global_state_.memory_limit_policy == ALLOW_PREPAINT_ONLY) {
241 bin_map[NOW_BIN] = NOW_BIN; 267 bin_map[NOW_BIN] = NOW_BIN;
242 bin_map[SOON_BIN] = SOON_BIN; 268 bin_map[SOON_BIN] = SOON_BIN;
243 bin_map[EVENTUALLY_BIN] = NEVER_BIN; 269 bin_map[EVENTUALLY_BIN] = NEVER_BIN;
244 bin_map[NEVER_BIN] = NEVER_BIN; 270 bin_map[NEVER_BIN] = NEVER_BIN;
245 } else { 271 } else {
246 bin_map[NOW_BIN] = NOW_BIN; 272 bin_map[NOW_BIN] = NOW_BIN;
247 bin_map[SOON_BIN] = SOON_BIN; 273 bin_map[SOON_BIN] = SOON_BIN;
248 bin_map[EVENTUALLY_BIN] = EVENTUALLY_BIN; 274 bin_map[EVENTUALLY_BIN] = EVENTUALLY_BIN;
249 bin_map[NEVER_BIN] = NEVER_BIN; 275 bin_map[NEVER_BIN] = NEVER_BIN;
250 } 276 }
251 277
252 // For each tree, bin into different categories of tiles. 278 // For each tree, bin into different categories of tiles.
253 for (TileVector::iterator it = tiles_.begin(); 279 for (TileRefVector::iterator it = tiles->begin(); it != tiles->end(); ++it) {
254 it != tiles_.end(); 280 Tile* tile = it->get();
255 ++it) {
256 Tile* tile = *it;
257 ManagedTileState& mts = tile->managed_state(); 281 ManagedTileState& mts = tile->managed_state();
258 282
259 TilePriority prio[NUM_BIN_PRIORITIES]; 283 TilePriority prio[NUM_BIN_PRIORITIES];
260 switch (tree_priority) { 284 switch (tree_priority) {
261 case SAME_PRIORITY_FOR_BOTH_TREES: 285 case SAME_PRIORITY_FOR_BOTH_TREES:
262 prio[HIGH_PRIORITY_BIN] = prio[LOW_PRIORITY_BIN] = 286 prio[HIGH_PRIORITY_BIN] = prio[LOW_PRIORITY_BIN] =
263 tile->combined_priority(); 287 tile->combined_priority();
264 break; 288 break;
265 case SMOOTHNESS_TAKES_PRIORITY: 289 case SMOOTHNESS_TAKES_PRIORITY:
266 prio[HIGH_PRIORITY_BIN] = tile->priority(ACTIVE_TREE); 290 prio[HIGH_PRIORITY_BIN] = tile->priority(ACTIVE_TREE);
(...skipping 26 matching lines...) Expand all
293 DidTileTreeBinChange(tile, 317 DidTileTreeBinChange(tile,
294 bin_map[BinFromTilePriority( 318 bin_map[BinFromTilePriority(
295 tile->priority(PENDING_TREE), tree_priority)], 319 tile->priority(PENDING_TREE), tree_priority)],
296 PENDING_TREE); 320 PENDING_TREE);
297 321
298 for (int i = 0; i < NUM_BIN_PRIORITIES; ++i) 322 for (int i = 0; i < NUM_BIN_PRIORITIES; ++i)
299 mts.bin[i] = bin_map[mts.bin[i]]; 323 mts.bin[i] = bin_map[mts.bin[i]];
300 } 324 }
301 } 325 }
302 326
303 void TileManager::SortTiles() { 327 void TileManager::SortTiles(TileRefVector* tiles) {
304 TRACE_EVENT0("cc", "TileManager::SortTiles"); 328 TRACE_EVENT0("cc", "TileManager::SortTiles");
305 329
306 // Sort by bin, resolution and time until needed. 330 // Sort by bin, resolution and time until needed.
307 std::sort(tiles_.begin(), tiles_.end(), BinComparator()); 331 std::sort(tiles->begin(), tiles->end(), BinComparator());
308 } 332 }
309 333
310 void TileManager::ManageTiles() { 334 void TileManager::ManageTiles() {
311 TRACE_EVENT0("cc", "TileManager::ManageTiles"); 335 TRACE_EVENT0("cc", "TileManager::ManageTiles");
312 AssignBinsToTiles(); 336
313 SortTiles(); 337 UpdateSortedTiles();
reveman 2013/07/09 01:15:37 I would prefer if you just moved the updatesortedt
tomhudson 2013/07/09 09:06:07 I like most of your other suggestions to get rid o
reveman 2013/07/09 15:54:03 We already have tracing for SortTiles and AssignBi
vmpstr 2013/07/09 16:48:18 I tend to agree with Tom for two reasons: 1. It's
reveman 2013/07/09 18:52:29 Not sure. This function is doing more than the nam
314 AssignGpuMemoryToTiles(); 338
339 TileVector tiles_that_need_to_be_rasterized;
340 TileSet oom_tiles_required_for_activation;
341 AssignGpuMemoryToTiles(sorted_tiles_,
342 &tiles_that_need_to_be_rasterized,
343 &oom_tiles_required_for_activation);
344 all_tiles_required_for_activation_have_memory_ =
345 oom_tiles_required_for_activation.empty();
315 CleanUpUnusedImageDecodeTasks(); 346 CleanUpUnusedImageDecodeTasks();
316 347
317 TRACE_EVENT_INSTANT1( 348 TRACE_EVENT_INSTANT1(
318 "cc", "DidManage", TRACE_EVENT_SCOPE_THREAD, 349 "cc", "DidManage", TRACE_EVENT_SCOPE_THREAD,
319 "state", TracedValue::FromValue(BasicStateAsValue().release())); 350 "state", TracedValue::FromValue(BasicStateAsValue().release()));
320 351
321 // Finally, schedule rasterizer tasks. 352 // Finally, schedule rasterizer tasks.
322 ScheduleTasks(); 353 ScheduleTasks(tiles_that_need_to_be_rasterized);
323 } 354 }
324 355
325 void TileManager::CheckForCompletedTileUploads() { 356 void TileManager::CheckForCompletedTileUploads() {
326 raster_worker_pool_->CheckForCompletedTasks(); 357 raster_worker_pool_->CheckForCompletedTasks();
327 358
328 if (did_initialize_visible_tile_) { 359 if (did_initialize_visible_tile_) {
329 client_->DidInitializeVisibleTile(); 360 client_->DidInitializeVisibleTile();
330 did_initialize_visible_tile_ = false; 361 did_initialize_visible_tile_ = false;
331 } 362 }
332 } 363 }
333 364
334 void TileManager::GetMemoryStats( 365 void TileManager::GetMemoryStats(
335 size_t* memory_required_bytes, 366 size_t* memory_required_bytes,
336 size_t* memory_nice_to_have_bytes, 367 size_t* memory_nice_to_have_bytes,
337 size_t* memory_used_bytes) const { 368 size_t* memory_used_bytes) const {
338 *memory_required_bytes = 0; 369 *memory_required_bytes = 0;
339 *memory_nice_to_have_bytes = 0; 370 *memory_nice_to_have_bytes = 0;
340 *memory_used_bytes = resource_pool_->acquired_memory_usage_bytes(); 371 *memory_used_bytes = resource_pool_->acquired_memory_usage_bytes();
341 for (TileVector::const_iterator it = tiles_.begin(); 372 for (TileMap::const_iterator it = tiles_.begin();
342 it != tiles_.end(); 373 it != tiles_.end();
343 ++it) { 374 ++it) {
344 const Tile* tile = *it; 375 const Tile* tile = it->second;
345 const ManagedTileState& mts = tile->managed_state(); 376 const ManagedTileState& mts = tile->managed_state();
346 377
347 const ManagedTileState::TileVersion& tile_version = 378 const ManagedTileState::TileVersion& tile_version =
348 tile->GetTileVersionForDrawing(); 379 tile->GetTileVersionForDrawing();
349 if (tile_version.IsReadyToDraw() && 380 if (tile_version.IsReadyToDraw() &&
350 !tile_version.requires_resource()) 381 !tile_version.requires_resource())
351 continue; 382 continue;
352 383
353 size_t tile_bytes = tile->bytes_consumed_if_allocated(); 384 size_t tile_bytes = tile->bytes_consumed_if_allocated();
354 if (mts.gpu_memmgr_stats_bin == NOW_BIN) 385 if (mts.gpu_memmgr_stats_bin == NOW_BIN)
355 *memory_required_bytes += tile_bytes; 386 *memory_required_bytes += tile_bytes;
356 if (mts.gpu_memmgr_stats_bin != NEVER_BIN) 387 if (mts.gpu_memmgr_stats_bin != NEVER_BIN)
357 *memory_nice_to_have_bytes += tile_bytes; 388 *memory_nice_to_have_bytes += tile_bytes;
358 } 389 }
359 } 390 }
360 391
361 scoped_ptr<base::Value> TileManager::BasicStateAsValue() const { 392 scoped_ptr<base::Value> TileManager::BasicStateAsValue() const {
362 scoped_ptr<base::DictionaryValue> state(new base::DictionaryValue()); 393 scoped_ptr<base::DictionaryValue> state(new base::DictionaryValue());
363 state->SetInteger("tile_count", tiles_.size()); 394 state->SetInteger("tile_count", tiles_.size());
364 state->Set("global_state", global_state_.AsValue().release()); 395 state->Set("global_state", global_state_.AsValue().release());
365 state->Set("memory_requirements", GetMemoryRequirementsAsValue().release()); 396 state->Set("memory_requirements", GetMemoryRequirementsAsValue().release());
366 return state.PassAs<base::Value>(); 397 return state.PassAs<base::Value>();
367 } 398 }
368 399
369 scoped_ptr<base::Value> TileManager::AllTilesAsValue() const { 400 scoped_ptr<base::Value> TileManager::AllTilesAsValue() const {
370 scoped_ptr<base::ListValue> state(new base::ListValue()); 401 scoped_ptr<base::ListValue> state(new base::ListValue());
371 for (TileVector::const_iterator it = tiles_.begin(); 402 for (TileMap::const_iterator it = tiles_.begin();
372 it != tiles_.end(); 403 it != tiles_.end();
373 it++) { 404 it++) {
374 state->Append((*it)->AsValue().release()); 405 state->Append(it->second->AsValue().release());
375 } 406 }
376 return state.PassAs<base::Value>(); 407 return state.PassAs<base::Value>();
377 } 408 }
378 409
379 scoped_ptr<base::Value> TileManager::GetMemoryRequirementsAsValue() const { 410 scoped_ptr<base::Value> TileManager::GetMemoryRequirementsAsValue() const {
380 scoped_ptr<base::DictionaryValue> requirements( 411 scoped_ptr<base::DictionaryValue> requirements(
381 new base::DictionaryValue()); 412 new base::DictionaryValue());
382 413
383 size_t memory_required_bytes; 414 size_t memory_required_bytes;
384 size_t memory_nice_to_have_bytes; 415 size_t memory_nice_to_have_bytes;
385 size_t memory_used_bytes; 416 size_t memory_used_bytes;
386 GetMemoryStats(&memory_required_bytes, 417 GetMemoryStats(&memory_required_bytes,
387 &memory_nice_to_have_bytes, 418 &memory_nice_to_have_bytes,
388 &memory_used_bytes); 419 &memory_used_bytes);
389 requirements->SetInteger("memory_required_bytes", memory_required_bytes); 420 requirements->SetInteger("memory_required_bytes", memory_required_bytes);
390 requirements->SetInteger("memory_nice_to_have_bytes", 421 requirements->SetInteger("memory_nice_to_have_bytes",
391 memory_nice_to_have_bytes); 422 memory_nice_to_have_bytes);
392 requirements->SetInteger("memory_used_bytes", memory_used_bytes); 423 requirements->SetInteger("memory_used_bytes", memory_used_bytes);
393 return requirements.PassAs<base::Value>(); 424 return requirements.PassAs<base::Value>();
394 } 425 }
395 426
396 void TileManager::AddRequiredTileForActivation(Tile* tile) { 427 void TileManager::AddRequiredTileForActivation(Tile* tile) {
reveman 2013/07/09 01:15:37 I don't think this helper function adds much. The
vmpstr 2013/07/09 16:48:18 Done.
397 DCHECK(std::find(tiles_that_need_to_be_initialized_for_activation_.begin(), 428 all_tiles_required_for_activation_have_been_initialized_ = false;
398 tiles_that_need_to_be_initialized_for_activation_.end(),
399 tile) ==
400 tiles_that_need_to_be_initialized_for_activation_.end());
401 tiles_that_need_to_be_initialized_for_activation_.insert(tile);
402 } 429 }
403 430
404 RasterMode TileManager::DetermineRasterMode(const Tile* tile) const { 431 RasterMode TileManager::DetermineRasterMode(const Tile* tile) const {
405 DCHECK(tile); 432 DCHECK(tile);
406 DCHECK(tile->picture_pile()); 433 DCHECK(tile->picture_pile());
407 434
408 const ManagedTileState& mts = tile->managed_state(); 435 const ManagedTileState& mts = tile->managed_state();
409 RasterMode current_mode = mts.raster_mode; 436 RasterMode current_mode = mts.raster_mode;
410 437
411 RasterMode raster_mode = HIGH_QUALITY_RASTER_MODE; 438 RasterMode raster_mode = HIGH_QUALITY_RASTER_MODE;
412 if (tile->managed_state().resolution == LOW_RESOLUTION) 439 if (tile->managed_state().resolution == LOW_RESOLUTION)
413 raster_mode = LOW_QUALITY_RASTER_MODE; 440 raster_mode = LOW_QUALITY_RASTER_MODE;
414 else if (tile->can_use_lcd_text()) 441 else if (tile->can_use_lcd_text())
415 raster_mode = HIGH_QUALITY_RASTER_MODE; 442 raster_mode = HIGH_QUALITY_RASTER_MODE;
416 else if (mts.tile_versions[current_mode].has_text_ || 443 else if (mts.tile_versions[current_mode].has_text_ ||
417 !mts.tile_versions[current_mode].IsReadyToDraw()) 444 !mts.tile_versions[current_mode].IsReadyToDraw())
418 raster_mode = HIGH_QUALITY_NO_LCD_RASTER_MODE; 445 raster_mode = HIGH_QUALITY_NO_LCD_RASTER_MODE;
419 446
420 return std::min(raster_mode, current_mode); 447 return std::min(raster_mode, current_mode);
421 } 448 }
422 449
423 void TileManager::AssignGpuMemoryToTiles() { 450 void TileManager::AssignGpuMemoryToTiles(
451 const TileRefVector& sorted_tiles,
452 TileVector* tiles_that_need_to_be_rasterized,
453 TileSet* oom_tiles_required_for_activation) {
424 TRACE_EVENT0("cc", "TileManager::AssignGpuMemoryToTiles"); 454 TRACE_EVENT0("cc", "TileManager::AssignGpuMemoryToTiles");
425 455
456 // Reset activation tiles flag, to ensure we can activate
457 // if we don't have any required-for-activation tiles here.
458 all_tiles_required_for_activation_have_been_initialized_ = true;
459
426 // Now give memory out to the tiles until we're out, and build 460 // Now give memory out to the tiles until we're out, and build
427 // the needs-to-be-rasterized queue. 461 // the needs-to-be-rasterized queue.
428 tiles_that_need_to_be_rasterized_.clear();
429 tiles_that_need_to_be_initialized_for_activation_.clear();
430 oom_tiles_that_need_to_be_initialized_for_activation_.clear();
431
432 size_t bytes_releasable = 0; 462 size_t bytes_releasable = 0;
433 for (TileVector::const_iterator it = tiles_.begin(); 463 for (TileRefVector::const_iterator it = sorted_tiles.begin();
434 it != tiles_.end(); 464 it != sorted_tiles.end();
435 ++it) { 465 ++it) {
436 const Tile* tile = *it; 466 const Tile* tile = it->get();
437 const ManagedTileState& mts = tile->managed_state(); 467 const ManagedTileState& mts = tile->managed_state();
438 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { 468 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) {
439 if (mts.tile_versions[mode].resource_) 469 if (mts.tile_versions[mode].resource_)
440 bytes_releasable += tile->bytes_consumed_if_allocated(); 470 bytes_releasable += tile->bytes_consumed_if_allocated();
441 } 471 }
442 } 472 }
443 473
444 // Cast to prevent overflow. 474 // Cast to prevent overflow.
445 int64 bytes_available = 475 int64 bytes_available =
446 static_cast<int64>(bytes_releasable) + 476 static_cast<int64>(bytes_releasable) +
447 static_cast<int64>(global_state_.memory_limit_in_bytes) - 477 static_cast<int64>(global_state_.memory_limit_in_bytes) -
448 static_cast<int64>(resource_pool_->acquired_memory_usage_bytes()); 478 static_cast<int64>(resource_pool_->acquired_memory_usage_bytes());
449 479
450 size_t bytes_allocatable = 480 size_t bytes_allocatable =
451 std::max(static_cast<int64>(0), bytes_available); 481 std::max(static_cast<int64>(0), bytes_available);
452 482
453 size_t bytes_that_exceeded_memory_budget = 0; 483 size_t bytes_that_exceeded_memory_budget = 0;
454 size_t bytes_left = bytes_allocatable; 484 size_t bytes_left = bytes_allocatable;
455 size_t bytes_oom_tiles_that_need_to_be_initialized_for_activation = 0; 485 size_t bytes_oom_tiles_that_need_to_be_initialized_for_activation = 0;
456 bool higher_priority_tile_oomed = false; 486 bool higher_priority_tile_oomed = false;
457 for (TileVector::iterator it = tiles_.begin(); 487 for (TileRefVector::const_iterator it = sorted_tiles.begin();
458 it != tiles_.end(); 488 it != sorted_tiles.end();
459 ++it) { 489 ++it) {
460 Tile* tile = *it; 490 Tile* tile = it->get();
461 ManagedTileState& mts = tile->managed_state(); 491 ManagedTileState& mts = tile->managed_state();
462 492
463 mts.raster_mode = DetermineRasterMode(tile); 493 mts.raster_mode = DetermineRasterMode(tile);
464 494
465 ManagedTileState::TileVersion& tile_version = 495 ManagedTileState::TileVersion& tile_version =
466 mts.tile_versions[mts.raster_mode]; 496 mts.tile_versions[mts.raster_mode];
467 497
468 // If this tile doesn't need a resource, then nothing to do. 498 // If this tile doesn't need a resource, then nothing to do.
469 if (!tile_version.requires_resource()) 499 if (!tile_version.requires_resource())
470 continue; 500 continue;
(...skipping 18 matching lines...) Expand all
489 tile_bytes += tile->bytes_consumed_if_allocated(); 519 tile_bytes += tile->bytes_consumed_if_allocated();
490 520
491 // Tile is OOM. 521 // Tile is OOM.
492 if (tile_bytes > bytes_left) { 522 if (tile_bytes > bytes_left) {
493 if (tile->required_for_activation()) { 523 if (tile->required_for_activation()) {
494 // Immediately mark tiles for on-demand raster once the amount 524 // Immediately mark tiles for on-demand raster once the amount
495 // of memory for oom tiles required for activation exceeds our 525 // of memory for oom tiles required for activation exceeds our
496 // memory limit. 526 // memory limit.
497 if (bytes_oom_tiles_that_need_to_be_initialized_for_activation < 527 if (bytes_oom_tiles_that_need_to_be_initialized_for_activation <
498 global_state_.memory_limit_in_bytes) { 528 global_state_.memory_limit_in_bytes) {
499 oom_tiles_that_need_to_be_initialized_for_activation_.insert(tile); 529 oom_tiles_required_for_activation->insert(tile);
500 bytes_oom_tiles_that_need_to_be_initialized_for_activation += 530 bytes_oom_tiles_that_need_to_be_initialized_for_activation +=
501 tile_bytes; 531 tile_bytes;
502 } else { 532 } else {
503 tile_version.set_rasterize_on_demand(); 533 tile_version.set_rasterize_on_demand();
504 } 534 }
505 } 535 }
506 FreeResourcesForTile(tile); 536 FreeResourcesForTile(tile);
507 higher_priority_tile_oomed = true; 537 higher_priority_tile_oomed = true;
508 bytes_that_exceeded_memory_budget += tile_bytes; 538 bytes_that_exceeded_memory_budget += tile_bytes;
509 continue; 539 continue;
510 } 540 }
511 541
512 tile_version.set_use_resource(); 542 tile_version.set_use_resource();
513 bytes_left -= tile_bytes; 543 bytes_left -= tile_bytes;
514 544
515 // Tile shouldn't be rasterized if we've failed to assign 545 // Tile shouldn't be rasterized if we've failed to assign
516 // gpu memory to a higher priority tile. This is important for 546 // gpu memory to a higher priority tile. This is important for
517 // two reasons: 547 // two reasons:
518 // 1. Tile size should not impact raster priority. 548 // 1. Tile size should not impact raster priority.
519 // 2. Tile with unreleasable memory could otherwise incorrectly 549 // 2. Tile with unreleasable memory could otherwise incorrectly
520 // be added as it's not affected by |bytes_allocatable|. 550 // be added as it's not affected by |bytes_allocatable|.
521 if (higher_priority_tile_oomed) 551 if (higher_priority_tile_oomed)
522 continue; 552 continue;
523 553
524 if (!tile_version.resource_) 554 if (!tile_version.resource_)
525 tiles_that_need_to_be_rasterized_.push_back(tile); 555 tiles_that_need_to_be_rasterized->push_back(tile);
526 556
527 if (!tile->IsReadyToDraw() && 557 if (!tile->IsReadyToDraw() &&
528 tile->required_for_activation()) { 558 tile->required_for_activation()) {
529 AddRequiredTileForActivation(tile); 559 AddRequiredTileForActivation(tile);
530 } 560 }
531 } 561 }
532 562
533 ever_exceeded_memory_budget_ |= bytes_that_exceeded_memory_budget > 0; 563 ever_exceeded_memory_budget_ |= bytes_that_exceeded_memory_budget > 0;
534 if (ever_exceeded_memory_budget_) { 564 if (ever_exceeded_memory_budget_) {
535 TRACE_COUNTER_ID2("cc", "over_memory_budget", this, 565 TRACE_COUNTER_ID2("cc", "over_memory_budget", this,
536 "budget", global_state_.memory_limit_in_bytes, 566 "budget", global_state_.memory_limit_in_bytes,
537 "over", bytes_that_exceeded_memory_budget); 567 "over", bytes_that_exceeded_memory_budget);
538 } 568 }
539 memory_stats_from_last_assign_.total_budget_in_bytes = 569 memory_stats_from_last_assign_.total_budget_in_bytes =
540 global_state_.memory_limit_in_bytes; 570 global_state_.memory_limit_in_bytes;
541 memory_stats_from_last_assign_.bytes_allocated = 571 memory_stats_from_last_assign_.bytes_allocated =
542 bytes_allocatable - bytes_left; 572 bytes_allocatable - bytes_left;
543 memory_stats_from_last_assign_.bytes_unreleasable = 573 memory_stats_from_last_assign_.bytes_unreleasable =
544 bytes_allocatable - bytes_releasable; 574 bytes_allocatable - bytes_releasable;
545 memory_stats_from_last_assign_.bytes_over = 575 memory_stats_from_last_assign_.bytes_over =
546 bytes_that_exceeded_memory_budget; 576 bytes_that_exceeded_memory_budget;
547 } 577 }
548 578
549 void TileManager::ReassignGpuMemoryToOOMTilesRequiredForActivation() { 579 void TileManager::ReassignGpuMemoryToOOMTilesRequiredForActivation(
580 const TileRefVector& sorted_tiles,
581 TileVector* tiles_that_need_to_be_rasterized,
582 TileSet* oom_tiles_required_for_activation) {
550 TRACE_EVENT0( 583 TRACE_EVENT0(
551 "cc", "TileManager::ReassignGpuMemoryToOOMTilesRequiredForActivation"); 584 "cc", "TileManager::ReassignGpuMemoryToOOMTilesRequiredForActivation");
552 585
553 size_t bytes_oom_for_required_tiles = 0; 586 size_t bytes_oom_for_required_tiles = 0;
554 TileVector tiles_requiring_memory_but_oomed; 587 TileVector tiles_requiring_memory_but_oomed;
555 for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) { 588 for (TileRefVector::const_iterator it = sorted_tiles.begin();
556 Tile* tile = *it; 589 it != sorted_tiles.end();
557 if (oom_tiles_that_need_to_be_initialized_for_activation_.find(tile) == 590 ++it) {
558 oom_tiles_that_need_to_be_initialized_for_activation_.end()) 591 Tile* tile = it->get();
592 if (oom_tiles_required_for_activation->find(tile) ==
593 oom_tiles_required_for_activation->end())
559 continue; 594 continue;
560 595
561 tiles_requiring_memory_but_oomed.push_back(tile); 596 tiles_requiring_memory_but_oomed.push_back(tile);
562 bytes_oom_for_required_tiles += tile->bytes_consumed_if_allocated(); 597 bytes_oom_for_required_tiles += tile->bytes_consumed_if_allocated();
563 } 598 }
564 599
565 if (tiles_requiring_memory_but_oomed.empty()) 600 if (tiles_requiring_memory_but_oomed.empty())
566 return; 601 return;
567 602
568 // In OOM situation, we iterate tiles_, remove the memory for active tree 603 // In OOM situation, we iterate sorted_tiles, remove the memory for active
569 // and not the now bin. And give them to bytes_oom_for_required_tiles 604 // tree and not the now bin. And give them to bytes_oom_for_required_tiles
570 size_t bytes_freed = 0; 605 size_t bytes_freed = 0;
571 for (TileVector::reverse_iterator it = tiles_.rbegin(); 606 for (TileRefVector::const_reverse_iterator it = sorted_tiles.rbegin();
572 it != tiles_.rend(); ++it) { 607 it != sorted_tiles.rend();
573 Tile* tile = *it; 608 ++it) {
609 Tile* tile = it->get();
574 ManagedTileState& mts = tile->managed_state(); 610 ManagedTileState& mts = tile->managed_state();
575 if (mts.tree_bin[PENDING_TREE] == NEVER_BIN && 611 if (mts.tree_bin[PENDING_TREE] == NEVER_BIN &&
576 mts.tree_bin[ACTIVE_TREE] != NOW_BIN) { 612 mts.tree_bin[ACTIVE_TREE] != NOW_BIN) {
577 ManagedTileState::TileVersion& tile_version = 613 ManagedTileState::TileVersion& tile_version =
578 mts.tile_versions[mts.raster_mode]; 614 mts.tile_versions[mts.raster_mode];
579 615
580 // If the tile is in the to-rasterize list, but it has no task, 616 // If the tile is in the to-rasterize list, but it has no task,
581 // then it means that we have assigned memory for it. 617 // then it means that we have assigned memory for it.
582 TileVector::iterator raster_it = 618 TileVector::iterator raster_it =
583 std::find(tiles_that_need_to_be_rasterized_.begin(), 619 std::find(tiles_that_need_to_be_rasterized->begin(),
584 tiles_that_need_to_be_rasterized_.end(), 620 tiles_that_need_to_be_rasterized->end(),
585 tile); 621 tile);
586 if (raster_it != tiles_that_need_to_be_rasterized_.end() && 622 if (raster_it != tiles_that_need_to_be_rasterized->end() &&
587 tile_version.raster_task_.is_null()) { 623 tile_version.raster_task_.is_null()) {
588 bytes_freed += tile->bytes_consumed_if_allocated(); 624 bytes_freed += tile->bytes_consumed_if_allocated();
589 tiles_that_need_to_be_rasterized_.erase(raster_it); 625 tiles_that_need_to_be_rasterized->erase(raster_it);
590 } 626 }
591 627
592 // Also consider all of the completed resources for freeing. 628 // Also consider all of the completed resources for freeing.
593 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { 629 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) {
594 if (mts.tile_versions[mode].resource_) { 630 if (mts.tile_versions[mode].resource_) {
595 DCHECK(!tile->required_for_activation()); 631 DCHECK(!tile->required_for_activation());
596 FreeResourceForTile(tile, static_cast<RasterMode>(mode)); 632 FreeResourceForTile(tile, static_cast<RasterMode>(mode));
597 bytes_freed += tile->bytes_consumed_if_allocated(); 633 bytes_freed += tile->bytes_consumed_if_allocated();
598 } 634 }
599 } 635 }
600 } 636 }
601 637
602 if (bytes_oom_for_required_tiles <= bytes_freed) 638 if (bytes_oom_for_required_tiles <= bytes_freed)
603 break; 639 break;
604 } 640 }
605 641
606 for (TileVector::iterator it = tiles_requiring_memory_but_oomed.begin(); 642 for (TileVector::iterator it = tiles_requiring_memory_but_oomed.begin();
607 it != tiles_requiring_memory_but_oomed.end() && bytes_freed > 0; 643 it != tiles_requiring_memory_but_oomed.end() && bytes_freed > 0;
608 ++it) { 644 ++it) {
609 Tile* tile = *it; 645 Tile* tile = *it;
610 ManagedTileState& mts = tile->managed_state(); 646 ManagedTileState& mts = tile->managed_state();
611 size_t bytes_needed = tile->bytes_consumed_if_allocated(); 647 size_t bytes_needed = tile->bytes_consumed_if_allocated();
612 if (bytes_needed > bytes_freed) 648 if (bytes_needed > bytes_freed)
613 continue; 649 continue;
614 mts.tile_versions[mts.raster_mode].set_use_resource(); 650 mts.tile_versions[mts.raster_mode].set_use_resource();
615 bytes_freed -= bytes_needed; 651 bytes_freed -= bytes_needed;
616 tiles_that_need_to_be_rasterized_.push_back(tile); 652 tiles_that_need_to_be_rasterized->push_back(tile);
617 DCHECK(tile->required_for_activation()); 653 DCHECK(tile->required_for_activation());
618 AddRequiredTileForActivation(tile); 654 AddRequiredTileForActivation(tile);
619 oom_tiles_that_need_to_be_initialized_for_activation_.erase(tile); 655 oom_tiles_required_for_activation->erase(tile);
620 } 656 }
621 } 657 }
622 658
623 void TileManager::CleanUpUnusedImageDecodeTasks() { 659 void TileManager::CleanUpUnusedImageDecodeTasks() {
624 // Calculate a set of layers that are used by at least one tile. 660 // Calculate a set of layers that are used by at least one tile.
625 base::hash_set<int> used_layers; 661 base::hash_set<int> used_layers;
626 for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) 662 for (TileMap::iterator it = tiles_.begin(); it != tiles_.end(); ++it)
627 used_layers.insert((*it)->layer_id()); 663 used_layers.insert(it->second->layer_id());
628 664
629 // Now calculate the set of layers in |image_decode_tasks_| that are not used 665 // Now calculate the set of layers in |image_decode_tasks_| that are not used
630 // by any tile. 666 // by any tile.
631 std::vector<int> unused_layers; 667 std::vector<int> unused_layers;
632 for (LayerPixelRefTaskMap::iterator it = image_decode_tasks_.begin(); 668 for (LayerPixelRefTaskMap::iterator it = image_decode_tasks_.begin();
633 it != image_decode_tasks_.end(); 669 it != image_decode_tasks_.end();
634 ++it) { 670 ++it) {
635 if (used_layers.find(it->first) == used_layers.end()) 671 if (used_layers.find(it->first) == used_layers.end())
636 unused_layers.push_back(it->first); 672 unused_layers.push_back(it->first);
637 } 673 }
(...skipping 30 matching lines...) Expand all
668 break; 704 break;
669 } 705 }
670 } 706 }
671 707
672 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { 708 for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) {
673 if (mode != used_mode) 709 if (mode != used_mode)
674 FreeResourceForTile(tile, static_cast<RasterMode>(mode)); 710 FreeResourceForTile(tile, static_cast<RasterMode>(mode));
675 } 711 }
676 } 712 }
677 713
678 void TileManager::ScheduleTasks() { 714 void TileManager::ScheduleTasks(
715 const TileVector& tiles_that_need_to_be_rasterized) {
679 TRACE_EVENT1("cc", "TileManager::ScheduleTasks", 716 TRACE_EVENT1("cc", "TileManager::ScheduleTasks",
680 "count", tiles_that_need_to_be_rasterized_.size()); 717 "count", tiles_that_need_to_be_rasterized.size());
681 RasterWorkerPool::RasterTask::Queue tasks; 718 RasterWorkerPool::RasterTask::Queue tasks;
682 719
683 // Build a new task queue containing all task currently needed. Tasks 720 // Build a new task queue containing all task currently needed. Tasks
684 // are added in order of priority, highest priority task first. 721 // are added in order of priority, highest priority task first.
685 for (TileVector::iterator it = tiles_that_need_to_be_rasterized_.begin(); 722 for (TileVector::const_iterator it = tiles_that_need_to_be_rasterized.begin();
686 it != tiles_that_need_to_be_rasterized_.end(); 723 it != tiles_that_need_to_be_rasterized.end();
687 ++it) { 724 ++it) {
688 Tile* tile = *it; 725 Tile* tile = *it;
689 ManagedTileState& mts = tile->managed_state(); 726 ManagedTileState& mts = tile->managed_state();
690 ManagedTileState::TileVersion& tile_version = 727 ManagedTileState::TileVersion& tile_version =
691 mts.tile_versions[mts.raster_mode]; 728 mts.tile_versions[mts.raster_mode];
692 729
693 DCHECK(tile_version.requires_resource()); 730 DCHECK(tile_version.requires_resource());
694 DCHECK(!tile_version.resource_); 731 DCHECK(!tile_version.resource_);
695 732
696 if (tile_version.raster_task_.is_null()) 733 if (tile_version.raster_task_.is_null())
(...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after
756 tile->contents_scale(), 793 tile->contents_scale(),
757 mts.raster_mode, 794 mts.raster_mode,
758 mts.tree_bin[PENDING_TREE] == NOW_BIN, 795 mts.tree_bin[PENDING_TREE] == NOW_BIN,
759 mts.resolution, 796 mts.resolution,
760 tile->layer_id(), 797 tile->layer_id(),
761 &tile, 798 &tile,
762 tile->source_frame_number(), 799 tile->source_frame_number(),
763 rendering_stats_instrumentation_, 800 rendering_stats_instrumentation_,
764 base::Bind(&TileManager::OnRasterTaskCompleted, 801 base::Bind(&TileManager::OnRasterTaskCompleted,
765 base::Unretained(this), 802 base::Unretained(this),
766 make_scoped_refptr(tile), 803 tile->id(),
767 base::Passed(&resource), 804 base::Passed(&resource),
768 mts.raster_mode), 805 mts.raster_mode),
769 &decode_tasks); 806 &decode_tasks);
770 } 807 }
771 808
772 void TileManager::OnImageDecodeTaskCompleted( 809 void TileManager::OnImageDecodeTaskCompleted(
773 int layer_id, 810 int layer_id,
774 skia::LazyPixelRef* pixel_ref, 811 skia::LazyPixelRef* pixel_ref,
775 bool was_canceled) { 812 bool was_canceled) {
776 // If the task was canceled, we need to clean it up 813 // If the task was canceled, we need to clean it up
777 // from |image_decode_tasks_|. 814 // from |image_decode_tasks_|.
778 if (!was_canceled) 815 if (!was_canceled)
779 return; 816 return;
780 817
781 LayerPixelRefTaskMap::iterator layer_it = 818 LayerPixelRefTaskMap::iterator layer_it =
782 image_decode_tasks_.find(layer_id); 819 image_decode_tasks_.find(layer_id);
783 820
784 if (layer_it == image_decode_tasks_.end()) 821 if (layer_it == image_decode_tasks_.end())
785 return; 822 return;
786 823
787 PixelRefTaskMap& pixel_ref_tasks = layer_it->second; 824 PixelRefTaskMap& pixel_ref_tasks = layer_it->second;
788 PixelRefTaskMap::iterator task_it = 825 PixelRefTaskMap::iterator task_it =
789 pixel_ref_tasks.find(pixel_ref->getGenerationID()); 826 pixel_ref_tasks.find(pixel_ref->getGenerationID());
790 827
791 if (task_it != pixel_ref_tasks.end()) 828 if (task_it != pixel_ref_tasks.end())
792 pixel_ref_tasks.erase(task_it); 829 pixel_ref_tasks.erase(task_it);
793 } 830 }
794 831
795 void TileManager::OnRasterTaskCompleted( 832 void TileManager::OnRasterTaskCompleted(
796 scoped_refptr<Tile> tile, 833 Tile::Id tile_id,
797 scoped_ptr<ResourcePool::Resource> resource, 834 scoped_ptr<ResourcePool::Resource> resource,
798 RasterMode raster_mode, 835 RasterMode raster_mode,
799 const PicturePileImpl::Analysis& analysis, 836 const PicturePileImpl::Analysis& analysis,
800 bool was_canceled) { 837 bool was_canceled) {
801 TRACE_EVENT1("cc", "TileManager::OnRasterTaskCompleted", 838 TRACE_EVENT1("cc", "TileManager::OnRasterTaskCompleted",
802 "was_canceled", was_canceled); 839 "was_canceled", was_canceled);
803 840
841 TileMap::iterator it = tiles_.find(tile_id);
842 if (it == tiles_.end()) {
843 resource_pool_->ReleaseResource(resource.Pass());
844 return;
845 }
846
847 Tile* tile = it->second;
804 ManagedTileState& mts = tile->managed_state(); 848 ManagedTileState& mts = tile->managed_state();
805 ManagedTileState::TileVersion& tile_version = 849 ManagedTileState::TileVersion& tile_version =
806 mts.tile_versions[raster_mode]; 850 mts.tile_versions[raster_mode];
807 DCHECK(!tile_version.raster_task_.is_null()); 851 DCHECK(!tile_version.raster_task_.is_null());
808 tile_version.raster_task_.Reset(); 852 tile_version.raster_task_.Reset();
809 853
810 if (was_canceled) { 854 if (was_canceled) {
811 resource_pool_->ReleaseResource(resource.Pass()); 855 resource_pool_->ReleaseResource(resource.Pass());
812 return; 856 return;
813 } 857 }
814 858
815 tile_version.set_has_text(analysis.has_text); 859 tile_version.set_has_text(analysis.has_text);
816 if (analysis.is_solid_color) { 860 if (analysis.is_solid_color) {
817 tile_version.set_solid_color(analysis.solid_color); 861 tile_version.set_solid_color(analysis.solid_color);
818 resource_pool_->ReleaseResource(resource.Pass()); 862 resource_pool_->ReleaseResource(resource.Pass());
819 } else { 863 } else {
820 tile_version.resource_ = resource.Pass(); 864 tile_version.resource_ = resource.Pass();
821 } 865 }
822 866
823 FreeUnusedResourcesForTile(tile.get()); 867 FreeUnusedResourcesForTile(tile);
824 DidFinishTileInitialization(tile.get()); 868 DidFinishTileInitialization(tile);
825 } 869 }
826 870
827 void TileManager::DidFinishTileInitialization(Tile* tile) { 871 void TileManager::DidFinishTileInitialization(Tile* tile) {
reveman 2013/07/09 01:15:37 I don't think this helper function is worth much a
vmpstr 2013/07/09 16:48:18 Done.
828 if (tile->priority(ACTIVE_TREE).distance_to_visible_in_pixels == 0) 872 if (tile->priority(ACTIVE_TREE).distance_to_visible_in_pixels == 0)
829 did_initialize_visible_tile_ = true; 873 did_initialize_visible_tile_ = true;
830 if (tile->required_for_activation()) {
831 // It's possible that a tile required for activation is not in this list
832 // if it was marked as being required after being dispatched for
833 // rasterization but before AssignGPUMemory was called again.
834 tiles_that_need_to_be_initialized_for_activation_.erase(tile);
835 }
836 } 874 }
837 875
838 void TileManager::DidTileTreeBinChange(Tile* tile, 876 void TileManager::DidTileTreeBinChange(Tile* tile,
839 ManagedTileBin new_tree_bin, 877 ManagedTileBin new_tree_bin,
840 WhichTree tree) { 878 WhichTree tree) {
reveman 2013/07/09 01:15:37 looks like this helper is also just making the cod
vmpstr 2013/07/09 16:48:18 Done.
841 ManagedTileState& mts = tile->managed_state(); 879 ManagedTileState& mts = tile->managed_state();
842 mts.tree_bin[tree] = new_tree_bin; 880 mts.tree_bin[tree] = new_tree_bin;
843 } 881 }
844 882
845 } // namespace cc 883 } // namespace cc
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698