// Copyright 2012 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "cc/resources/tile_manager.h" #include #include #include #include "base/bind.h" #include "base/json/json_writer.h" #include "base/logging.h" #include "base/metrics/histogram.h" #include "cc/debug/devtools_instrumentation.h" #include "cc/debug/traced_value.h" #include "cc/resources/image_raster_worker_pool.h" #include "cc/resources/pixel_buffer_raster_worker_pool.h" #include "cc/resources/tile.h" #include "third_party/skia/include/core/SkCanvas.h" #include "ui/gfx/rect_conversions.h" namespace cc { namespace { // Determine bin based on three categories of tiles: things we need now, // things we need soon, and eventually. inline TileManagerBin BinFromTilePriority(const TilePriority& prio, TreePriority tree_priority) { // The amount of time for which we want to have prepainting coverage. const float kPrepaintingWindowTimeSeconds = 1.0f; const float kBackflingGuardDistancePixels = 314.0f; // Don't let low res tiles be in the now bin unless we're in a mode where // we're prioritizing checkerboard prevention. bool can_be_in_now_bin = tree_priority == SMOOTHNESS_TAKES_PRIORITY || prio.resolution != LOW_RESOLUTION; if (prio.distance_to_visible_in_pixels == std::numeric_limits::infinity()) return NEVER_BIN; if (can_be_in_now_bin && prio.time_to_visible_in_seconds == 0) return NOW_BIN; if (prio.resolution == NON_IDEAL_RESOLUTION) return EVENTUALLY_BIN; if (prio.distance_to_visible_in_pixels < kBackflingGuardDistancePixels || prio.time_to_visible_in_seconds < kPrepaintingWindowTimeSeconds) return SOON_BIN; return EVENTUALLY_BIN; } } // namespace scoped_ptr TileManagerBinAsValue(TileManagerBin bin) { switch (bin) { case NOW_BIN: return scoped_ptr(base::Value::CreateStringValue( "NOW_BIN")); case SOON_BIN: return scoped_ptr(base::Value::CreateStringValue( "SOON_BIN")); case EVENTUALLY_BIN: return scoped_ptr(base::Value::CreateStringValue( "EVENTUALLY_BIN")); case NEVER_BIN: return scoped_ptr(base::Value::CreateStringValue( "NEVER_BIN")); default: DCHECK(false) << "Unrecognized TileManagerBin value " << bin; return scoped_ptr(base::Value::CreateStringValue( "")); } } scoped_ptr TileManagerBinPriorityAsValue( TileManagerBinPriority bin_priority) { switch (bin_priority) { case HIGH_PRIORITY_BIN: return scoped_ptr(base::Value::CreateStringValue( "HIGH_PRIORITY_BIN")); case LOW_PRIORITY_BIN: return scoped_ptr(base::Value::CreateStringValue( "LOW_PRIORITY_BIN")); default: DCHECK(false) << "Unrecognized TileManagerBinPriority value"; return scoped_ptr(base::Value::CreateStringValue( "")); } } // static scoped_ptr TileManager::Create( TileManagerClient* client, ResourceProvider* resource_provider, size_t num_raster_threads, bool use_color_estimator, RenderingStatsInstrumentation* rendering_stats_instrumentation, bool use_map_image) { return make_scoped_ptr( new TileManager(client, resource_provider, use_map_image ? ImageRasterWorkerPool::Create( resource_provider, num_raster_threads) : PixelBufferRasterWorkerPool::Create( resource_provider, num_raster_threads), num_raster_threads, use_color_estimator, rendering_stats_instrumentation, resource_provider->best_texture_format())); } TileManager::TileManager( TileManagerClient* client, ResourceProvider* resource_provider, scoped_ptr raster_worker_pool, size_t num_raster_threads, bool use_color_estimator, RenderingStatsInstrumentation* rendering_stats_instrumentation, GLenum texture_format) : client_(client), resource_pool_(ResourcePool::Create(resource_provider)), raster_worker_pool_(raster_worker_pool.Pass()), ever_exceeded_memory_budget_(false), rendering_stats_instrumentation_(rendering_stats_instrumentation), use_color_estimator_(use_color_estimator), did_initialize_visible_tile_(false), texture_format_(texture_format) { raster_worker_pool_->SetClient(this); } TileManager::~TileManager() { // Reset global state and manage. This should cause // our memory usage to drop to zero. global_state_ = GlobalStateThatImpactsTilePriority(); AssignGpuMemoryToTiles(); CleanUpUnusedImageDecodeTasks(); // This should finish all pending tasks and release any uninitialized // resources. raster_worker_pool_->Shutdown(); raster_worker_pool_->CheckForCompletedTasks(); DCHECK_EQ(0u, tiles_.size()); } void TileManager::SetGlobalState( const GlobalStateThatImpactsTilePriority& global_state) { global_state_ = global_state; resource_pool_->SetMaxMemoryUsageBytes( global_state_.memory_limit_in_bytes, global_state_.unused_memory_limit_in_bytes); } void TileManager::RegisterTile(Tile* tile) { DCHECK(std::find(tiles_.begin(), tiles_.end(), tile) == tiles_.end()); DCHECK(!tile->required_for_activation()); tiles_.push_back(tile); } void TileManager::UnregisterTile(Tile* tile) { TileVector::iterator raster_iter = std::find(tiles_that_need_to_be_rasterized_.begin(), tiles_that_need_to_be_rasterized_.end(), tile); if (raster_iter != tiles_that_need_to_be_rasterized_.end()) tiles_that_need_to_be_rasterized_.erase(raster_iter); tiles_that_need_to_be_initialized_for_activation_.erase(tile); DCHECK(std::find(tiles_.begin(), tiles_.end(), tile) != tiles_.end()); FreeResourcesForTile(tile); tiles_.erase(std::remove(tiles_.begin(), tiles_.end(), tile)); } bool TileManager::ShouldForceTasksRequiredForActivationToComplete() const { return client_->ShouldForceTileUploadsRequiredForActivationToComplete(); } class BinComparator { public: bool operator() (const Tile* a, const Tile* b) const { const ManagedTileState& ams = a->managed_state(); const ManagedTileState& bms = b->managed_state(); if (ams.bin[HIGH_PRIORITY_BIN] != bms.bin[HIGH_PRIORITY_BIN]) return ams.bin[HIGH_PRIORITY_BIN] < bms.bin[HIGH_PRIORITY_BIN]; if (ams.bin[LOW_PRIORITY_BIN] != bms.bin[LOW_PRIORITY_BIN]) return ams.bin[LOW_PRIORITY_BIN] < bms.bin[LOW_PRIORITY_BIN]; if (ams.required_for_activation != bms.required_for_activation) return ams.required_for_activation; if (ams.resolution != bms.resolution) return ams.resolution < bms.resolution; if (ams.time_to_needed_in_seconds != bms.time_to_needed_in_seconds) return ams.time_to_needed_in_seconds < bms.time_to_needed_in_seconds; if (ams.distance_to_visible_in_pixels != bms.distance_to_visible_in_pixels) { return ams.distance_to_visible_in_pixels < bms.distance_to_visible_in_pixels; } gfx::Rect a_rect = a->content_rect(); gfx::Rect b_rect = b->content_rect(); if (a_rect.y() != b_rect.y()) return a_rect.y() < b_rect.y(); return a_rect.x() < b_rect.x(); } }; void TileManager::AssignBinsToTiles() { const TreePriority tree_priority = global_state_.tree_priority; // Memory limit policy works by mapping some bin states to the NEVER bin. TileManagerBin bin_map[NUM_BINS]; if (global_state_.memory_limit_policy == ALLOW_NOTHING) { bin_map[NOW_BIN] = NEVER_BIN; bin_map[SOON_BIN] = NEVER_BIN; bin_map[EVENTUALLY_BIN] = NEVER_BIN; bin_map[NEVER_BIN] = NEVER_BIN; } else if (global_state_.memory_limit_policy == ALLOW_ABSOLUTE_MINIMUM) { bin_map[NOW_BIN] = NOW_BIN; bin_map[SOON_BIN] = NEVER_BIN; bin_map[EVENTUALLY_BIN] = NEVER_BIN; bin_map[NEVER_BIN] = NEVER_BIN; } else if (global_state_.memory_limit_policy == ALLOW_PREPAINT_ONLY) { bin_map[NOW_BIN] = NOW_BIN; bin_map[SOON_BIN] = SOON_BIN; bin_map[EVENTUALLY_BIN] = NEVER_BIN; bin_map[NEVER_BIN] = NEVER_BIN; } else { bin_map[NOW_BIN] = NOW_BIN; bin_map[SOON_BIN] = SOON_BIN; bin_map[EVENTUALLY_BIN] = EVENTUALLY_BIN; bin_map[NEVER_BIN] = NEVER_BIN; } // For each tree, bin into different categories of tiles. for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) { Tile* tile = *it; ManagedTileState& mts = tile->managed_state(); TilePriority prio[NUM_BIN_PRIORITIES]; switch (tree_priority) { case SAME_PRIORITY_FOR_BOTH_TREES: prio[HIGH_PRIORITY_BIN] = prio[LOW_PRIORITY_BIN] = tile->combined_priority(); break; case SMOOTHNESS_TAKES_PRIORITY: prio[HIGH_PRIORITY_BIN] = tile->priority(ACTIVE_TREE); prio[LOW_PRIORITY_BIN] = tile->priority(PENDING_TREE); break; case NEW_CONTENT_TAKES_PRIORITY: prio[HIGH_PRIORITY_BIN] = tile->priority(PENDING_TREE); prio[LOW_PRIORITY_BIN] = tile->priority(ACTIVE_TREE); break; } mts.resolution = prio[HIGH_PRIORITY_BIN].resolution; mts.time_to_needed_in_seconds = prio[HIGH_PRIORITY_BIN].time_to_visible_in_seconds; mts.distance_to_visible_in_pixels = prio[HIGH_PRIORITY_BIN].distance_to_visible_in_pixels; mts.required_for_activation = prio[HIGH_PRIORITY_BIN].required_for_activation; mts.bin[HIGH_PRIORITY_BIN] = BinFromTilePriority(prio[HIGH_PRIORITY_BIN], tree_priority); mts.bin[LOW_PRIORITY_BIN] = BinFromTilePriority(prio[LOW_PRIORITY_BIN], tree_priority); mts.gpu_memmgr_stats_bin = BinFromTilePriority(tile->combined_priority(), tree_priority); DidTileTreeBinChange(tile, bin_map[BinFromTilePriority( tile->priority(ACTIVE_TREE), tree_priority)], ACTIVE_TREE); DidTileTreeBinChange(tile, bin_map[BinFromTilePriority( tile->priority(PENDING_TREE), tree_priority)], PENDING_TREE); for (int i = 0; i < NUM_BIN_PRIORITIES; ++i) mts.bin[i] = bin_map[mts.bin[i]]; } } void TileManager::SortTiles() { TRACE_EVENT0("cc", "TileManager::SortTiles"); // Sort by bin, resolution and time until needed. std::sort(tiles_.begin(), tiles_.end(), BinComparator()); } void TileManager::ManageTiles() { TRACE_EVENT0("cc", "TileManager::ManageTiles"); AssignBinsToTiles(); SortTiles(); AssignGpuMemoryToTiles(); CleanUpUnusedImageDecodeTasks(); // This could have changed after AssignGpuMemoryToTiles. if (AreTilesRequiredForActivationReady()) client_->NotifyReadyToActivate(); TRACE_EVENT_INSTANT1( "cc", "DidManage", TRACE_EVENT_SCOPE_THREAD, "state", TracedValue::FromValue(BasicStateAsValue().release())); // Finally, schedule rasterizer tasks. ScheduleTasks(); } void TileManager::CheckForCompletedTileUploads() { raster_worker_pool_->CheckForCompletedTasks(); } void TileManager::GetMemoryStats( size_t* memory_required_bytes, size_t* memory_nice_to_have_bytes, size_t* memory_used_bytes) const { *memory_required_bytes = 0; *memory_nice_to_have_bytes = 0; *memory_used_bytes = resource_pool_->acquired_memory_usage_bytes(); for (TileVector::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { const Tile* tile = *it; const ManagedTileState& mts = tile->managed_state(); RasterMode mode = HIGH_QUALITY_NO_LCD_RASTER_MODE; if (tile->IsReadyToDraw(&mode) && !mts.tile_versions[mode].requires_resource()) continue; size_t tile_bytes = tile->bytes_consumed_if_allocated(); if (mts.gpu_memmgr_stats_bin == NOW_BIN) *memory_required_bytes += tile_bytes; if (mts.gpu_memmgr_stats_bin != NEVER_BIN) *memory_nice_to_have_bytes += tile_bytes; } } scoped_ptr TileManager::BasicStateAsValue() const { scoped_ptr state(new base::DictionaryValue()); state->SetInteger("tile_count", tiles_.size()); state->Set("global_state", global_state_.AsValue().release()); state->Set("memory_requirements", GetMemoryRequirementsAsValue().release()); return state.PassAs(); } scoped_ptr TileManager::AllTilesAsValue() const { scoped_ptr state(new base::ListValue()); for (TileVector::const_iterator it = tiles_.begin(); it != tiles_.end(); it++) { state->Append((*it)->AsValue().release()); } return state.PassAs(); } scoped_ptr TileManager::GetMemoryRequirementsAsValue() const { scoped_ptr requirements( new base::DictionaryValue()); size_t memory_required_bytes; size_t memory_nice_to_have_bytes; size_t memory_used_bytes; GetMemoryStats(&memory_required_bytes, &memory_nice_to_have_bytes, &memory_used_bytes); requirements->SetInteger("memory_required_bytes", memory_required_bytes); requirements->SetInteger("memory_nice_to_have_bytes", memory_nice_to_have_bytes); requirements->SetInteger("memory_used_bytes", memory_used_bytes); return requirements.PassAs(); } void TileManager::AddRequiredTileForActivation(Tile* tile) { DCHECK(std::find(tiles_that_need_to_be_initialized_for_activation_.begin(), tiles_that_need_to_be_initialized_for_activation_.end(), tile) == tiles_that_need_to_be_initialized_for_activation_.end()); tiles_that_need_to_be_initialized_for_activation_.insert(tile); } RasterMode TileManager::DetermineRasterMode(const Tile* tile) const { DCHECK(tile); DCHECK(tile->picture_pile()); const ManagedTileState& mts = tile->managed_state(); RasterMode current_mode = mts.raster_mode; RasterMode raster_mode = HIGH_QUALITY_RASTER_MODE; if (tile->managed_state().resolution == LOW_RESOLUTION) raster_mode = LOW_QUALITY_RASTER_MODE; else if (tile->can_use_lcd_text()) raster_mode = HIGH_QUALITY_RASTER_MODE; else if (mts.tile_versions[current_mode].has_text_ || !mts.tile_versions[current_mode].IsReadyToDraw()) raster_mode = HIGH_QUALITY_NO_LCD_RASTER_MODE; return std::min(raster_mode, current_mode); } void TileManager::AssignGpuMemoryToTiles() { TRACE_EVENT0("cc", "TileManager::AssignGpuMemoryToTiles"); // Now give memory out to the tiles until we're out, and build // the needs-to-be-rasterized queue. tiles_that_need_to_be_rasterized_.clear(); tiles_that_need_to_be_initialized_for_activation_.clear(); size_t bytes_releasable = 0; for (TileVector::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) { const Tile* tile = *it; const ManagedTileState& mts = tile->managed_state(); for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { if (mts.tile_versions[mode].resource_) bytes_releasable += tile->bytes_consumed_if_allocated(); } } // Cast to prevent overflow. int64 bytes_available = static_cast(bytes_releasable) + static_cast(global_state_.memory_limit_in_bytes) - static_cast(resource_pool_->acquired_memory_usage_bytes()); size_t bytes_allocatable = std::max(static_cast(0), bytes_available); size_t bytes_that_exceeded_memory_budget_in_now_bin = 0; size_t bytes_left = bytes_allocatable; size_t bytes_oom_in_now_bin_on_pending_tree = 0; TileVector tiles_requiring_memory_but_oomed; bool higher_priority_tile_oomed = false; for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) { Tile* tile = *it; ManagedTileState& mts = tile->managed_state(); mts.raster_mode = DetermineRasterMode(tile); ManagedTileState::TileVersion& tile_version = mts.tile_versions[mts.raster_mode]; // If this tile doesn't need a resource, then nothing to do. if (!tile_version.requires_resource()) continue; // If the tile is not needed, free it up. if (mts.is_in_never_bin_on_both_trees()) { FreeResourcesForTile(tile); continue; } size_t tile_bytes = 0; // It costs to maintain a resource. for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { if (mts.tile_versions[mode].resource_) tile_bytes += tile->bytes_consumed_if_allocated(); } // If we don't have the required version, and it's not in flight // then we'll have to pay to create a new task. if (!tile_version.resource_ && tile_version.raster_task_.is_null()) tile_bytes += tile->bytes_consumed_if_allocated(); // Tile is OOM. if (tile_bytes > bytes_left) { mts.tile_versions[mts.raster_mode].set_rasterize_on_demand(); if (mts.tree_bin[PENDING_TREE] == NOW_BIN) { tiles_requiring_memory_but_oomed.push_back(tile); bytes_oom_in_now_bin_on_pending_tree += tile_bytes; } FreeResourcesForTile(tile); higher_priority_tile_oomed = true; continue; } tile_version.set_use_resource(); bytes_left -= tile_bytes; // Tile shouldn't be rasterized if we've failed to assign // gpu memory to a higher priority tile. This is important for // two reasons: // 1. Tile size should not impact raster priority. // 2. Tile with unreleasable memory could otherwise incorrectly // be added as it's not affected by |bytes_allocatable|. if (higher_priority_tile_oomed) continue; if (!tile_version.resource_) tiles_that_need_to_be_rasterized_.push_back(tile); if (!tile->IsReadyToDraw(NULL) && tile->required_for_activation()) { AddRequiredTileForActivation(tile); } } // In OOM situation, we iterate tiles_, remove the memory for active tree // and not the now bin. And give them to bytes_oom_in_now_bin_on_pending_tree if (!tiles_requiring_memory_but_oomed.empty()) { size_t bytes_freed = 0; for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) { Tile* tile = *it; ManagedTileState& mts = tile->managed_state(); ManagedTileState::TileVersion& tile_version = mts.tile_versions[mts.raster_mode]; if (mts.tree_bin[PENDING_TREE] == NEVER_BIN && mts.tree_bin[ACTIVE_TREE] != NOW_BIN) { size_t bytes_that_can_be_freed = 0; // If the tile is in the to-rasterize list, but it has no task, // then it means that we have assigned memory for it. TileVector::iterator raster_it = std::find(tiles_that_need_to_be_rasterized_.begin(), tiles_that_need_to_be_rasterized_.end(), tile); if (raster_it != tiles_that_need_to_be_rasterized_.end() && tile_version.raster_task_.is_null()) { bytes_that_can_be_freed += tile->bytes_consumed_if_allocated(); } // Also consider all of the completed resources for freeing. for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { ManagedTileState::TileVersion& tile_version = mts.tile_versions[mode]; if (tile_version.resource_) { DCHECK(!tile->required_for_activation()); bytes_that_can_be_freed += tile->bytes_consumed_if_allocated(); } } // If we can free anything, then do so. if (bytes_that_can_be_freed > 0) { FreeResourcesForTile(tile); bytes_freed += bytes_that_can_be_freed; mts.tile_versions[mts.raster_mode].set_rasterize_on_demand(); if (raster_it != tiles_that_need_to_be_rasterized_.end()) tiles_that_need_to_be_rasterized_.erase(raster_it); } } if (bytes_oom_in_now_bin_on_pending_tree <= bytes_freed) break; } for (TileVector::iterator it = tiles_requiring_memory_but_oomed.begin(); it != tiles_requiring_memory_but_oomed.end() && bytes_freed > 0; ++it) { Tile* tile = *it; ManagedTileState& mts = tile->managed_state(); size_t bytes_needed = tile->bytes_consumed_if_allocated(); if (bytes_needed > bytes_freed) continue; mts.tile_versions[mts.raster_mode].set_use_resource(); bytes_freed -= bytes_needed; tiles_that_need_to_be_rasterized_.push_back(tile); if (tile->required_for_activation()) AddRequiredTileForActivation(tile); } } ever_exceeded_memory_budget_ |= bytes_that_exceeded_memory_budget_in_now_bin > 0; if (ever_exceeded_memory_budget_) { TRACE_COUNTER_ID2("cc", "over_memory_budget", this, "budget", global_state_.memory_limit_in_bytes, "over", bytes_that_exceeded_memory_budget_in_now_bin); } memory_stats_from_last_assign_.total_budget_in_bytes = global_state_.memory_limit_in_bytes; memory_stats_from_last_assign_.bytes_allocated = bytes_allocatable - bytes_left; memory_stats_from_last_assign_.bytes_unreleasable = bytes_allocatable - bytes_releasable; memory_stats_from_last_assign_.bytes_over = bytes_that_exceeded_memory_budget_in_now_bin; } void TileManager::CleanUpUnusedImageDecodeTasks() { // Calculate a set of layers that are used by at least one tile. base::hash_set used_layers; for (TileVector::iterator it = tiles_.begin(); it != tiles_.end(); ++it) used_layers.insert((*it)->layer_id()); // Now calculate the set of layers in |image_decode_tasks_| that are not used // by any tile. std::vector unused_layers; for (LayerPixelRefTaskMap::iterator it = image_decode_tasks_.begin(); it != image_decode_tasks_.end(); ++it) { if (used_layers.find(it->first) == used_layers.end()) unused_layers.push_back(it->first); } // Erase unused layers from |image_decode_tasks_|. for (std::vector::iterator it = unused_layers.begin(); it != unused_layers.end(); ++it) { image_decode_tasks_.erase(*it); } } void TileManager::FreeResourceForTile(Tile* tile, RasterMode mode) { ManagedTileState& mts = tile->managed_state(); if (mts.tile_versions[mode].resource_) { resource_pool_->ReleaseResource( mts.tile_versions[mode].resource_.Pass()); } } void TileManager::FreeResourcesForTile(Tile* tile) { for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { FreeResourceForTile(tile, static_cast(mode)); } } void TileManager::FreeUnusedResourcesForTile(Tile* tile) { RasterMode used_mode = HIGH_QUALITY_RASTER_MODE; bool version_is_used = tile->IsReadyToDraw(&used_mode); for (int mode = 0; mode < NUM_RASTER_MODES; ++mode) { if (!version_is_used || mode != used_mode) FreeResourceForTile(tile, static_cast(mode)); } } void TileManager::ScheduleTasks() { TRACE_EVENT0("cc", "TileManager::ScheduleTasks"); RasterWorkerPool::RasterTask::Queue tasks; // Build a new task queue containing all task currently needed. Tasks // are added in order of priority, highest priority task first. for (TileVector::iterator it = tiles_that_need_to_be_rasterized_.begin(); it != tiles_that_need_to_be_rasterized_.end(); ++it) { Tile* tile = *it; ManagedTileState& mts = tile->managed_state(); ManagedTileState::TileVersion& tile_version = mts.tile_versions[mts.raster_mode]; DCHECK(tile_version.requires_resource()); DCHECK(!tile_version.resource_); if (tile_version.raster_task_.is_null()) tile_version.raster_task_ = CreateRasterTask(tile); tasks.Append(tile_version.raster_task_, tile->required_for_activation()); } // Schedule running of |tasks|. This replaces any previously // scheduled tasks and effectively cancels all tasks not present // in |tasks|. raster_worker_pool_->ScheduleTasks(&tasks); } RasterWorkerPool::Task TileManager::CreateImageDecodeTask( Tile* tile, skia::LazyPixelRef* pixel_ref) { TRACE_EVENT0("cc", "TileManager::CreateImageDecodeTask"); return RasterWorkerPool::CreateImageDecodeTask( pixel_ref, tile->layer_id(), rendering_stats_instrumentation_, base::Bind(&TileManager::OnImageDecodeTaskCompleted, base::Unretained(this), tile->layer_id(), base::Unretained(pixel_ref))); } RasterTaskMetadata TileManager::GetRasterTaskMetadata( const Tile& tile) const { RasterTaskMetadata metadata; const ManagedTileState& mts = tile.managed_state(); metadata.is_tile_in_pending_tree_now_bin = mts.tree_bin[PENDING_TREE] == NOW_BIN; metadata.tile_resolution = mts.resolution; metadata.layer_id = tile.layer_id(); metadata.tile_id = &tile; metadata.source_frame_number = tile.source_frame_number(); return metadata; } RasterWorkerPool::RasterTask TileManager::CreateRasterTask(Tile* tile) { TRACE_EVENT0("cc", "TileManager::CreateRasterTask"); ManagedTileState& mts = tile->managed_state(); scoped_ptr resource = resource_pool_->AcquireResource(tile->tile_size_.size(), texture_format_); const Resource* const_resource = resource.get(); // Create and queue all image decode tasks that this tile depends on. RasterWorkerPool::Task::Set decode_tasks; PixelRefTaskMap& existing_pixel_refs = image_decode_tasks_[tile->layer_id()]; for (PicturePileImpl::PixelRefIterator iter(tile->content_rect(), tile->contents_scale(), tile->picture_pile()); iter; ++iter) { skia::LazyPixelRef* pixel_ref = *iter; uint32_t id = pixel_ref->getGenerationID(); // Append existing image decode task if available. PixelRefTaskMap::iterator decode_task_it = existing_pixel_refs.find(id); if (decode_task_it != existing_pixel_refs.end()) { decode_tasks.Insert(decode_task_it->second); continue; } // Create and append new image decode task for this pixel ref. RasterWorkerPool::Task decode_task = CreateImageDecodeTask( tile, pixel_ref); decode_tasks.Insert(decode_task); existing_pixel_refs[id] = decode_task; } RasterTaskMetadata metadata = GetRasterTaskMetadata(*tile); return RasterWorkerPool::CreateRasterTask( const_resource, tile->picture_pile(), tile->content_rect(), tile->contents_scale(), mts.raster_mode, use_color_estimator_, metadata, rendering_stats_instrumentation_, base::Bind(&TileManager::OnRasterTaskCompleted, base::Unretained(this), make_scoped_refptr(tile), base::Passed(&resource), mts.raster_mode), &decode_tasks); } void TileManager::OnImageDecodeTaskCompleted( int layer_id, skia::LazyPixelRef* pixel_ref, bool was_canceled) { // If the task was canceled, we need to clean it up // from |image_decode_tasks_|. if (!was_canceled) return; LayerPixelRefTaskMap::iterator layer_it = image_decode_tasks_.find(layer_id); if (layer_it == image_decode_tasks_.end()) return; PixelRefTaskMap& pixel_ref_tasks = layer_it->second; PixelRefTaskMap::iterator task_it = pixel_ref_tasks.find(pixel_ref->getGenerationID()); if (task_it != pixel_ref_tasks.end()) pixel_ref_tasks.erase(task_it); } void TileManager::OnRasterTaskCompleted( scoped_refptr tile, scoped_ptr resource, RasterMode raster_mode, const PicturePileImpl::Analysis& analysis, bool was_canceled) { TRACE_EVENT1("cc", "TileManager::OnRasterTaskCompleted", "was_canceled", was_canceled); ManagedTileState& mts = tile->managed_state(); ManagedTileState::TileVersion& tile_version = mts.tile_versions[raster_mode]; DCHECK(!tile_version.raster_task_.is_null()); tile_version.raster_task_.Reset(); if (was_canceled) { resource_pool_->ReleaseResource(resource.Pass()); return; } tile_version.set_has_text(analysis.has_text); if (analysis.is_solid_color) { tile_version.set_solid_color(analysis.solid_color); resource_pool_->ReleaseResource(resource.Pass()); } else { tile_version.resource_ = resource.Pass(); } FreeUnusedResourcesForTile(tile.get()); DidFinishTileInitialization(tile.get()); } void TileManager::DidFinishTileInitialization(Tile* tile) { if (tile->priority(ACTIVE_TREE).distance_to_visible_in_pixels == 0) did_initialize_visible_tile_ = true; if (tile->required_for_activation()) { // It's possible that a tile required for activation is not in this list // if it was marked as being required after being dispatched for // rasterization but before AssignGPUMemory was called again. tiles_that_need_to_be_initialized_for_activation_.erase(tile); if (AreTilesRequiredForActivationReady()) client_->NotifyReadyToActivate(); } } void TileManager::DidTileTreeBinChange(Tile* tile, TileManagerBin new_tree_bin, WhichTree tree) { ManagedTileState& mts = tile->managed_state(); mts.tree_bin[tree] = new_tree_bin; } } // namespace cc