cc: Rework how picture layer tiling set gets into raster queues.

cc/resources/eviction_tile_priority_queue.cc

 // Copyright 2014 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/eviction_tile_priority_queue.h"
 
+#include "base/containers/hash_tables.h"
+
 namespace cc {
 
 namespace {
 
 class EvictionOrderComparator {
  public:
   explicit EvictionOrderComparator(TreePriority tree_priority)
       : tree_priority_(tree_priority) {}
 
   bool operator()(
@@ skipping 54 matching lines @@
     // b is lower priorty if it is farther from visible.
     return b_priority.distance_to_visible > a_priority.distance_to_visible;
   }
 
  private:
   TreePriority tree_priority_;
 };
 
 }  // namespace
 
+// static
+scoped_ptr<EvictionTilePriorityQueue> EvictionTilePriorityQueue::Create(
+    const base::hash_map<int, PictureLayerTilingSet::Pair>&
+        paired_picture_layer_tiling_sets,
+    bool has_pending_tree,
+    TreePriority tree_priority) {
+  scoped_ptr<EvictionTilePriorityQueue> queue(new EvictionTilePriorityQueue);
+  queue->Build(paired_picture_layer_tiling_sets, has_pending_tree,
+               tree_priority);
+  return queue;
+}
+
 EvictionTilePriorityQueue::EvictionTilePriorityQueue() {
 }
 
 EvictionTilePriorityQueue::~EvictionTilePriorityQueue() {
 }
 
 void EvictionTilePriorityQueue::Build(
-    const std::vector<PictureLayerImpl::Pair>& paired_layers,
+    const base::hash_map<int, PictureLayerTilingSet::Pair>&
+        paired_picture_layer_tiling_sets,
+    bool has_pending_tree,
     TreePriority tree_priority) {
   tree_priority_ = tree_priority;
 
-  for (std::vector<PictureLayerImpl::Pair>::const_iterator it =
-           paired_layers.begin();
-       it != paired_layers.end();
-       ++it) {
-    paired_queues_.push_back(
-        make_scoped_ptr(new PairedTilingSetQueue(*it, tree_priority_)));
+  for (const auto& paired_tiling_set_pair : paired_picture_layer_tiling_sets) {
+    const auto& paired_tiling_set = paired_tiling_set_pair.second;
+    PictureLayerTilingSet* active = paired_tiling_set.active;
+    PictureLayerTilingSet* pending =
+        has_pending_tree ? paired_tiling_set.pending : nullptr;
+    paired_queues_.push_back(make_scoped_ptr(
+        new PairedTilingSetQueue(active, pending, tree_priority_)));
   }
 
   paired_queues_.make_heap(EvictionOrderComparator(tree_priority_));
 }
 
 bool EvictionTilePriorityQueue::IsEmpty() const {
   return paired_queues_.empty() || paired_queues_.front()->IsEmpty();
 }
 
 Tile* EvictionTilePriorityQueue::Top() {
   DCHECK(!IsEmpty());
   return paired_queues_.front()->Top(tree_priority_);
 }
 
 void EvictionTilePriorityQueue::Pop() {
   DCHECK(!IsEmpty());
 
   paired_queues_.pop_heap(EvictionOrderComparator(tree_priority_));
   PairedTilingSetQueue* paired_queue = paired_queues_.back();
   paired_queue->Pop(tree_priority_);
   paired_queues_.push_heap(EvictionOrderComparator(tree_priority_));
 }
 
 EvictionTilePriorityQueue::PairedTilingSetQueue::PairedTilingSetQueue() {
 }
 
 EvictionTilePriorityQueue::PairedTilingSetQueue::PairedTilingSetQueue(
-    const PictureLayerImpl::Pair& layer_pair,
+    PictureLayerTilingSet* active_set,
+    PictureLayerTilingSet* pending_set,
     TreePriority tree_priority) {
-  bool skip_shared_out_of_order_tiles = layer_pair.active && layer_pair.pending;
-  if (layer_pair.active) {
+  bool skip_shared_out_of_order_tiles = active_set && pending_set;
+  if (active_set) {
     active_queue = make_scoped_ptr(new TilingSetEvictionQueue(
-        layer_pair.active->picture_layer_tiling_set(), tree_priority,
-        skip_shared_out_of_order_tiles));
+        active_set, tree_priority, skip_shared_out_of_order_tiles));
   }
-  if (layer_pair.pending) {
+  if (pending_set) {
     pending_queue = make_scoped_ptr(new TilingSetEvictionQueue(
-        layer_pair.pending->picture_layer_tiling_set(), tree_priority,
-        skip_shared_out_of_order_tiles));
+        pending_set, tree_priority, skip_shared_out_of_order_tiles));
   }
 }
 
 EvictionTilePriorityQueue::PairedTilingSetQueue::~PairedTilingSetQueue() {
 }
 
 bool EvictionTilePriorityQueue::PairedTilingSetQueue::IsEmpty() const {
   return (!active_queue || active_queue->IsEmpty()) &&
          (!pending_queue || pending_queue->IsEmpty());
 }
@@ skipping 58 matching lines @@
     return active_tile->required_for_activation() ? PENDING_TREE : ACTIVE_TREE;
   }
 
   // Return tile with a lower priority.
   if (pending_priority.IsHigherPriorityThan(active_priority))
     return ACTIVE_TREE;
   return PENDING_TREE;
 }
 
 }  // namespace cc