cc: Split tiling set raster queues into all and required.

cc/resources/tiling_set_raster_queue_all.cc

Index: cc/resources/tiling_set_raster_queue_all.cc
diff --git a/cc/resources/tiling_set_raster_queue.cc b/cc/resources/tiling_set_raster_queue_all.cc
similarity index 83%
rename from cc/resources/tiling_set_raster_queue.cc
rename to cc/resources/tiling_set_raster_queue_all.cc
index 08f7642b8c55ed51921d49ccc462967f93971452..1375fda4c9066198473100c47507f72c82949cba 100644
--- a/cc/resources/tiling_set_raster_queue.cc
+++ b/cc/resources/tiling_set_raster_queue_all.cc
@@ -2,16 +2,13 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "cc/resources/tiling_set_raster_queue.h"
+#include "cc/resources/tiling_set_raster_queue_all.h"
 
 namespace cc {
 
-TilingSetRasterQueue::TilingSetRasterQueue()
-    : tiling_set_(nullptr), current_stage_(arraysize(stages_)) {
-}
-
-TilingSetRasterQueue::TilingSetRasterQueue(PictureLayerTilingSet* tiling_set,
-                                           bool prioritize_low_res)
+TilingSetRasterQueueAll::TilingSetRasterQueueAll(
+    PictureLayerTilingSet* tiling_set,
+    bool prioritize_low_res)
     : tiling_set_(tiling_set), current_stage_(0) {
   DCHECK(tiling_set_);
 
@@ -61,14 +58,14 @@ TilingSetRasterQueue::TilingSetRasterQueue(PictureLayerTilingSet* tiling_set,
     AdvanceToNextStage();
 }
 
-TilingSetRasterQueue::~TilingSetRasterQueue() {
+TilingSetRasterQueueAll::~TilingSetRasterQueueAll() {
 }
 
-bool TilingSetRasterQueue::IsEmpty() const {
+bool TilingSetRasterQueueAll::IsEmpty() const {
   return current_stage_ >= arraysize(stages_);
 }
 
-void TilingSetRasterQueue::Pop() {
+void TilingSetRasterQueueAll::Pop() {
   IteratorType index = stages_[current_stage_].iterator_type;
   TilePriority::PriorityBin tile_type = stages_[current_stage_].tile_type;
 
@@ -81,7 +78,7 @@ void TilingSetRasterQueue::Pop() {
     AdvanceToNextStage();
 }
 
-Tile* TilingSetRasterQueue::Top() {
+Tile* TilingSetRasterQueueAll::Top() {
   DCHECK(!IsEmpty());
 
   IteratorType index = stages_[current_stage_].iterator_type;
@@ -91,7 +88,7 @@ Tile* TilingSetRasterQueue::Top() {
   return *iterators_[index];
 }
 
-const Tile* TilingSetRasterQueue::Top() const {
+const Tile* TilingSetRasterQueueAll::Top() const {
   DCHECK(!IsEmpty());
 
   IteratorType index = stages_[current_stage_].iterator_type;
@@ -101,7 +98,7 @@ const Tile* TilingSetRasterQueue::Top() const {
   return *iterators_[index];
 }
 
-void TilingSetRasterQueue::AdvanceToNextStage() {
+void TilingSetRasterQueueAll::AdvanceToNextStage() {
   DCHECK_LT(current_stage_, arraysize(stages_));
   ++current_stage_;
   while (current_stage_ < arraysize(stages_)) {