cc: Add DEFINE_ENUM macro.

cc/resources/prioritized_tile_set.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 "cc/resources/prioritized_tile_set.h"
 
 #include <algorithm>
 
 #include "cc/resources/managed_tile_state.h"
 #include "cc/resources/tile.h"
@@ skipping 33 matching lines @@
   }
 };
 
 namespace {
 
 typedef std::vector<Tile*> TileVector;
 
 void SortBinTiles(ManagedTileBin bin, TileVector* tiles) {
   switch (bin) {
     case NOW_AND_READY_TO_DRAW_BIN:
-      break;
+      return;
     case NOW_BIN:
     case SOON_BIN:
     case EVENTUALLY_AND_ACTIVE_BIN:
     case EVENTUALLY_BIN:
     case NEVER_AND_ACTIVE_BIN:
     case NEVER_BIN:
       std::sort(tiles->begin(), tiles->end(), BinComparator());
-      break;
-    default:
-      NOTREACHED();
+      return;
   }
+  NOTREACHED();
 }
 
 }  // namespace
 
 PrioritizedTileSet::PrioritizedTileSet() {
-  for (int bin = 0; bin < NUM_BINS; ++bin)
+  for (int bin = 0; bin < ManagedTileBin_ARRAYSIZE; ++bin)
     bin_sorted_[bin] = true;
 }
 
 PrioritizedTileSet::~PrioritizedTileSet() {}
 
 void PrioritizedTileSet::InsertTile(Tile* tile, ManagedTileBin bin) {
   tiles_[bin].push_back(tile);
   bin_sorted_[bin] = false;
 }
 
 void PrioritizedTileSet::Clear() {
-  for (int bin = 0; bin < NUM_BINS; ++bin) {
+  for (int bin = 0; bin < ManagedTileBin_ARRAYSIZE; ++bin) {
     tiles_[bin].clear();
     bin_sorted_[bin] = true;
   }
 }
 
 void PrioritizedTileSet::SortBinIfNeeded(ManagedTileBin bin) {
   if (!bin_sorted_[bin]) {
     SortBinTiles(bin, &tiles_[bin]);
     bin_sorted_[bin] = true;
   }
@@ skipping 42 matching lines @@
     if (use_priority_ordering_)
       tile_set_->SortBinIfNeeded(current_bin_);
 
     iterator_ = tile_set_->tiles_[current_bin_].begin();
     if (iterator_ != tile_set_->tiles_[current_bin_].end())
       break;
   }
 }
 
 }  // namespace cc