cc: Split RasterTilePriorityQueue into required and all based on type.

cc/trees/layer_tree_host_impl.cc

 // Copyright 2011 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/trees/layer_tree_host_impl.h"
 
 #include <algorithm>
 #include <limits>
 
 #include "base/basictypes.h"
@@ skipping 1221 matching lines @@
     if (layer->GetTree() == ACTIVE_TREE) {
       DCHECK_IMPLIES(twin_layer, twin_layer->GetTree() == PENDING_TREE);
       layer_pairs->push_back(PictureLayerImpl::Pair(layer, twin_layer));
     } else if (!twin_layer) {
       DCHECK(layer->GetTree() == PENDING_TREE);
       layer_pairs->push_back(PictureLayerImpl::Pair(NULL, layer));
     }
   }
 }
 
-void LayerTreeHostImpl::BuildRasterQueue(RasterTilePriorityQueue* queue,
-                                         TreePriority tree_priority,
-                                         RasterTilePriorityQueue::Type type) {
+scoped_ptr<RasterTilePriorityQueue> LayerTreeHostImpl::BuildRasterQueue(
+    TreePriority tree_priority,
+    RasterTilePriorityQueue::Type type) {
   TRACE_EVENT0("cc", "LayerTreeHostImpl::BuildRasterQueue");
   picture_layer_pairs_.clear();
   GetPictureLayerImplPairs(&picture_layer_pairs_, true);
-  queue->Build(picture_layer_pairs_, tree_priority, type);
+  scoped_ptr<RasterTilePriorityQueue> queue(RasterTilePriorityQueue::Create(
+      picture_layer_pairs_, tree_priority, type));
 
   if (!queue->IsEmpty()) {
     // Only checking the Top() tile here isn't a definite answer that there is
     // or isn't something required for draw in this raster queue. It's just a
     // heuristic to let us hit the common case and proactively tell the
     // scheduler that we expect to draw within each vsync until we get all the
     // tiles ready to draw. If we happen to miss a required for draw tile here,
     // then we will miss telling the scheduler each frame that we intend to draw
     // so it may make worse scheduling decisions.
     required_for_draw_tile_is_top_of_raster_queue_ =
         queue->Top()->required_for_draw();
   } else {
     required_for_draw_tile_is_top_of_raster_queue_ = false;
   }
+  return queue;
 }
 
 void LayerTreeHostImpl::BuildEvictionQueue(EvictionTilePriorityQueue* queue,
                                            TreePriority tree_priority) {
   TRACE_EVENT0("cc", "LayerTreeHostImpl::BuildEvictionQueue");
   picture_layer_pairs_.clear();
   GetPictureLayerImplPairs(&picture_layer_pairs_, false);
   queue->Build(picture_layer_pairs_, tree_priority);
 }
 
@@ skipping 2234 matching lines @@
 }
 
 void LayerTreeHostImpl::UnregisterPictureLayerImpl(PictureLayerImpl* layer) {
   std::vector<PictureLayerImpl*>::iterator it =
       std::find(picture_layers_.begin(), picture_layers_.end(), layer);
   DCHECK(it != picture_layers_.end());
   picture_layers_.erase(it);
 }
 
 }  // namespace cc