cc: Separate the priority from the tile and put in new PrioritizedTile

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/location.h"
 #include "base/thread_task_runner_handle.h"
 #include "base/time/time.h"
 #include "cc/debug/lap_timer.h"
 #include "cc/resources/raster_buffer.h"
 #include "cc/resources/tile.h"
@@ skipping 203 matching lines @@
       layer->UpdateTiles(resourceless_software_draw);
 
     int priority_count = 0;
     timer_.Reset();
     do {
       int count = tile_count;
       scoped_ptr<RasterTilePriorityQueue> queue(host_impl_.BuildRasterQueue(
           priorities[priority_count], RasterTilePriorityQueue::Type::ALL));
       while (count--) {
         ASSERT_FALSE(queue->IsEmpty());
-        ASSERT_TRUE(queue->Top() != NULL);
+        ASSERT_TRUE(queue->Top().tile());
         queue->Pop();
       }
       priority_count = (priority_count + 1) % arraysize(priorities);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult(
         "tile_manager_raster_tile_queue_construct_and_iterate",
         "",
         test_name,
@@ skipping 54 matching lines @@
       }
     }
 
     timer_.Reset();
     do {
       int count = tile_count;
       scoped_ptr<EvictionTilePriorityQueue> queue(
           host_impl_.BuildEvictionQueue(priorities[priority_count]));
       while (count--) {
         ASSERT_FALSE(queue->IsEmpty());
-        ASSERT_TRUE(queue->Top() != NULL);
+        ASSERT_TRUE(queue->Top().tile());
         queue->Pop();
       }
       priority_count = (priority_count + 1) % arraysize(priorities);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult(
         "tile_manager_eviction_tile_queue_construct_and_iterate",
         "",
         test_name,
@@ skipping 166 matching lines @@
   RunEvictionQueueConstructAndIterateTest("10_64", 10, 64);
   RunEvictionQueueConstructAndIterateTest("10_128", 10, 128);
   RunEvictionQueueConstructAndIterateTest("50_16", 50, 16);
   RunEvictionQueueConstructAndIterateTest("50_32", 50, 32);
   RunEvictionQueueConstructAndIterateTest("50_64", 50, 64);
   RunEvictionQueueConstructAndIterateTest("50_128", 50, 128);
 }
 
 }  // namespace
 }  // namespace cc