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

cc/resources/tiling_set_raster_queue_required.cc

Index: cc/resources/tiling_set_raster_queue_required.cc
diff --git a/cc/resources/tiling_set_raster_queue_required.cc b/cc/resources/tiling_set_raster_queue_required.cc
new file mode 100644
index 0000000000000000000000000000000000000000..7d76d2c1367fbcb44b89f1c05101252ac01b3860
--- /dev/null
+++ b/cc/resources/tiling_set_raster_queue_required.cc
@@ -0,0 +1,136 @@
+// Copyright 2014 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/tiling_set_raster_queue_required.h"
+
+#include <utility>
+
+#include "cc/resources/picture_layer_tiling_set.h"
+#include "cc/resources/tile.h"
+#include "cc/resources/tile_priority.h"
+
+namespace cc {
+
+TilingSetRasterQueueRequired::TilingSetRasterQueueRequired(
+    PictureLayerTilingSet* tiling_set,
+    RasterTilePriorityQueue::Type type)
+    : type_(type) {
+  DCHECK_NE(static_cast<int>(type),
+            static_cast<int>(RasterTilePriorityQueue::Type::ALL));
+
+  // Any type of required tile would only come from a high resolution tiling.
+  // The functions that determine this value is
+  // PictureLayerTiling::IsTileRequiredFor*, which all return false if the
+  // resolution is not HIGH_RESOLUTION.
+  PictureLayerTiling* tiling =
+      tiling_set->FindTilingWithResolution(HIGH_RESOLUTION);
+  DCHECK(tiling);
+  iterator_ = TilingIterator(tiling, &tiling->tiling_data_);
+  while (!iterator_.done() && !IsTileRequired(*iterator_))
+    ++iterator_;
+}
+
+TilingSetRasterQueueRequired::~TilingSetRasterQueueRequired() {
+}
+
+bool TilingSetRasterQueueRequired::IsEmpty() const {
+  return iterator_.done();
+}
+
+void TilingSetRasterQueueRequired::Pop() {
+  DCHECK(!IsEmpty());
+  ++iterator_;
+  while (!iterator_.done() && !IsTileRequired(*iterator_))
+    ++iterator_;
+}
+
+Tile* TilingSetRasterQueueRequired::Top() {
+  DCHECK(!IsEmpty());
+  return *iterator_;
+}
+
+const Tile* TilingSetRasterQueueRequired::Top() const {
+  DCHECK(!IsEmpty());
+  return *iterator_;
+}
+
+bool TilingSetRasterQueueRequired::IsTileRequired(const Tile* tile) const {
+  return (type_ == RasterTilePriorityQueue::Type::REQUIRED_FOR_ACTIVATION &&
+          tile->required_for_activation()) ||
+         (type_ == RasterTilePriorityQueue::Type::REQUIRED_FOR_DRAW &&
+          tile->required_for_draw());
+}
+
+TilingSetRasterQueueRequired::TilingIterator::TilingIterator()
+    : tiling_(nullptr), current_tile_(nullptr) {
+}
+
+TilingSetRasterQueueRequired::TilingIterator::TilingIterator(
+    PictureLayerTiling* tiling,
+    TilingData* tiling_data)
+    : tiling_(tiling), tiling_data_(tiling_data), current_tile_(nullptr) {
+  if (!tiling_->has_visible_rect_tiles()) {
+    // Verify that if we would create the iterator, then it would be empty (ie
+    // it would return false when evaluated as a bool).
+    DCHECK(!TilingData::Iterator(tiling_data_, tiling->current_visible_rect(),
+                                 false));
+    return;
+  }
+
+  visible_iterator_ =
+      TilingData::Iterator(tiling_data_, tiling_->current_visible_rect(),
+                           false /* include_borders */);
+  if (!visible_iterator_)
+    return;
+
+  current_tile_ =
+      tiling_->TileAt(visible_iterator_.index_x(), visible_iterator_.index_y());
+
+  // If this is a valid tile, return it. Note that we have to use a tiling check
+  // for occlusion, since the tile's internal state has not yet been updated.
+  if (current_tile_ && current_tile_->NeedsRaster() &&
+      !tiling_->IsTileOccluded(current_tile_)) {
+    tiling_->UpdateTileAndTwinPriority(current_tile_);
+    return;
+  }
+  ++(*this);
+}
+
+TilingSetRasterQueueRequired::TilingIterator::~TilingIterator() {
+}
+
+TilingSetRasterQueueRequired::TilingIterator&
+    TilingSetRasterQueueRequired::TilingIterator::
+    operator++() {
+  while (true) {
+    ++visible_iterator_;
+    if (!visible_iterator_) {
+      current_tile_ = nullptr;
+      return *this;
+    }
+    std::pair<int, int> next_index = visible_iterator_.index();
+    current_tile_ = tiling_->TileAt(next_index.first, next_index.second);
+    // If the tile doesn't exist or if it exists but doesn't need raster work,
+    // we can move on to the next tile.
+    if (!current_tile_ || !current_tile_->NeedsRaster())
+      continue;
+
+    // If the tile is occluded, we also can skip it. Note that we use the tiling
+    // check for occlusion, since tile's internal state has not yet been updated
+    // (by UpdateTileAndTwinPriority). The tiling check does not rely on tile's
+    // internal state (it is, in fact, used to determine the tile's state).
+    if (tiling_->IsTileOccluded(current_tile_))
+      continue;
+
+    // If we get here, that means we have a valid tile that needs raster and is
+    // in the NOW bin, which means that it can be required.
+    break;
+  }
+
+  if (current_tile_)
+    tiling_->UpdateTileAndTwinPriority(current_tile_);
+  return *this;
+}
+
+}  // namespace cc