cc: Removed low priority bin from tile management.

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/resources/tile.h"
 #include "cc/resources/tile_priority.h"
 #include "cc/test/fake_output_surface.h"
 #include "cc/test/fake_output_surface_client.h"
 #include "cc/test/fake_picture_pile_impl.h"
@@ skipping 73 matching lines @@
   TilePriority GetTilePriorityFromBin(ManagedTileBin bin) {
     switch (bin) {
       case NOW_AND_READY_TO_DRAW_BIN:
       case NOW_BIN:
         return TilePriorityForNowBin();
       case SOON_BIN:
         return TilePriorityForSoonBin();
       case EVENTUALLY_AND_ACTIVE_BIN:
       case EVENTUALLY_BIN:
         return TilePriorityForEventualBin();
-      case NEVER_AND_ACTIVE_BIN:
+      case AT_LAST_BIN:
+      case AT_LAST_AND_ACTIVE_BIN:
       case NEVER_BIN:
         return TilePriority();
       default:
         NOTREACHED();
         return TilePriority();
     }
   }
 
   ManagedTileBin GetNextBin(ManagedTileBin bin) {
     switch (bin) {
       case NOW_AND_READY_TO_DRAW_BIN:
       case NOW_BIN:
         return SOON_BIN;
       case SOON_BIN:
         return EVENTUALLY_BIN;
       case EVENTUALLY_AND_ACTIVE_BIN:
       case EVENTUALLY_BIN:
         return NEVER_BIN;
-      case NEVER_AND_ACTIVE_BIN:
+      case AT_LAST_BIN:
+      case AT_LAST_AND_ACTIVE_BIN:
       case NEVER_BIN:
         return NOW_BIN;
       default:
         NOTREACHED();
         return NEVER_BIN;
     }
   }
 
   void CreateBinTiles(int count, ManagedTileBin bin, TileBinVector* tiles) {
     for (int i = 0; i < count; ++i) {
@@ skipping 18 matching lines @@
     int count_per_bin = count / NUM_BINS;
     CreateBinTiles(count_per_bin, NOW_BIN, tiles);
     CreateBinTiles(count_per_bin, SOON_BIN, tiles);
     CreateBinTiles(count_per_bin, EVENTUALLY_BIN, tiles);
     CreateBinTiles(count - 3 * count_per_bin, NEVER_BIN, tiles);
   }
 
   void RunManageTilesTest(const std::string test_name,
                           unsigned tile_count,
                           unsigned priority_change_percent) {
-    DCHECK_GE(100u, tile_count);
-    DCHECK_LE(100u, priority_change_percent);
+    DCHECK_GE(tile_count, 100u);
+    DCHECK_LE(priority_change_percent, 100u);
     num_runs_ = 0;
     TileBinVector tiles;
     CreateTiles(tile_count, &tiles);
     start_time_ = base::TimeTicks();
     do {
       if (priority_change_percent) {
         for (unsigned i = 0;
              i < tile_count;
              i += 100 / priority_change_percent) {
           Tile* tile = tiles[i].first;
@@ skipping 32 matching lines @@
   RunManageTilesTest("manage_tiles_1000_10", 1000, 10);
   RunManageTilesTest("manage_tiles_10000_10", 10000, 10);
   RunManageTilesTest("manage_tiles_100_100", 100, 100);
   RunManageTilesTest("manage_tiles_1000_100", 1000, 100);
   RunManageTilesTest("manage_tiles_10000_100", 10000, 100);
 }
 
 }  // namespace
 
 }  // namespace cc