OLD | NEW |
(Empty) | |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #include "cc/resources/tiling_set_raster_queue_required.h" |
| 6 |
| 7 namespace cc { |
| 8 |
| 9 TilingSetRasterQueueRequired::TilingSetRasterQueueRequired( |
| 10 PictureLayerTilingSet* tiling_set, |
| 11 RasterTilePriorityQueue::Type type) |
| 12 : type_(type) { |
| 13 DCHECK(type != RasterTilePriorityQueue::Type::ALL); |
| 14 DCHECK(tiling_set); |
| 15 |
| 16 PictureLayerTiling* tiling = |
| 17 tiling_set->FindTilingWithResolution(HIGH_RESOLUTION); |
| 18 DCHECK(tiling); |
| 19 iterator_ = PictureLayerTiling::TilingRasterTileIterator(tiling); |
| 20 while (iterator_ && iterator_.get_type() == TilePriority::NOW) { |
| 21 if (IsTileRequired(*iterator_)) |
| 22 break; |
| 23 ++iterator_; |
| 24 } |
| 25 } |
| 26 |
| 27 TilingSetRasterQueueRequired::~TilingSetRasterQueueRequired() { |
| 28 } |
| 29 |
| 30 bool TilingSetRasterQueueRequired::IsEmpty() const { |
| 31 return !iterator_ || iterator_.get_type() != TilePriority::NOW; |
| 32 } |
| 33 |
| 34 void TilingSetRasterQueueRequired::Pop() { |
| 35 DCHECK(!IsEmpty()); |
| 36 ++iterator_; |
| 37 while (iterator_ && iterator_.get_type() == TilePriority::NOW) { |
| 38 if (IsTileRequired(*iterator_)) |
| 39 break; |
| 40 ++iterator_; |
| 41 } |
| 42 } |
| 43 |
| 44 Tile* TilingSetRasterQueueRequired::Top() { |
| 45 DCHECK(!IsEmpty()); |
| 46 return *iterator_; |
| 47 } |
| 48 |
| 49 const Tile* TilingSetRasterQueueRequired::Top() const { |
| 50 DCHECK(!IsEmpty()); |
| 51 return *iterator_; |
| 52 } |
| 53 |
| 54 bool TilingSetRasterQueueRequired::IsTileRequired(const Tile* tile) const { |
| 55 return (type_ == RasterTilePriorityQueue::Type::REQUIRED_FOR_ACTIVATION && |
| 56 tile->required_for_activation()) || |
| 57 (type_ == RasterTilePriorityQueue::Type::REQUIRED_FOR_DRAW && |
| 58 tile->required_for_draw()); |
| 59 } |
| 60 |
| 61 } // namespace cc |
OLD | NEW |