cc: Change TileManager iterators to be queues.

cc/resources/tile_manager_perftest.cc

 // Copyright 2013 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 "base/time/time.h"
 #include "cc/debug/lap_timer.h"
 #include "cc/resources/tile.h"
 #include "cc/resources/tile_priority.h"
 #include "cc/test/fake_impl_proxy.h"
 #include "cc/test/fake_layer_tree_host_impl.h"
@@ skipping 162 matching lines @@
     active_root_layer_->SetAllTilesVisible();
     pending_root_layer_->CreateDefaultTilingsAndTiles();
     pending_root_layer_->SetAllTilesVisible();
   }
 
   void RunRasterIteratorTest(const std::string& test_name,
                              unsigned tile_count) {
     timer_.Reset();
     do {
       int count = tile_count;
-      for (TileManager::RasterTileIterator it(tile_manager(),
-                                              SAME_PRIORITY_FOR_BOTH_TREES);
-           it && count;
-           ++it) {
-        --count;
+      RasterTilePriorityQueue queue;
+      host_impl_.BuildRasterQueue(&queue, SAME_PRIORITY_FOR_BOTH_TREES);
+      while (count--) {
+        ASSERT_FALSE(queue.IsEmpty());
+        ASSERT_TRUE(queue.Top() != NULL);
+        queue.Pop();
       }
-      ASSERT_EQ(0, count);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult("tile_manager_raster_tile_iterator",
                            "",
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
   }
@@ skipping 130 matching lines @@
 
   RunRasterIteratorTest("2_16", 16);
   RunRasterIteratorTest("2_32", 32);
   RunRasterIteratorTest("2_64", 64);
   RunRasterIteratorTest("2_128", 128);
 }
 
 }  // namespace
 
 }  // namespace cc