| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 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 | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ | 5 #ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ |
| 6 #define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ | 6 #define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ |
| 7 | 7 |
| 8 #include <set> |
| 8 #include <utility> | 9 #include <utility> |
| 9 #include <vector> | 10 #include <vector> |
| 10 | 11 |
| 11 #include "cc/base/cc_export.h" | 12 #include "cc/base/cc_export.h" |
| 12 #include "cc/layers/picture_layer_impl.h" | 13 #include "cc/layers/picture_layer_impl.h" |
| 13 #include "cc/resources/tile_priority.h" | 14 #include "cc/resources/tile_priority.h" |
| 14 | 15 |
| 15 namespace cc { | 16 namespace cc { |
| 16 | 17 |
| 17 class CC_EXPORT RasterTilePriorityQueue { | 18 class CC_EXPORT RasterTilePriorityQueue { |
| 18 public: | 19 public: |
| 19 struct PairedPictureLayerQueue { | 20 struct PairedPictureLayerQueue { |
| 20 PairedPictureLayerQueue(); | 21 PairedPictureLayerQueue(); |
| 21 PairedPictureLayerQueue(const PictureLayerImpl::Pair& layer_pair, | 22 PairedPictureLayerQueue(const PictureLayerImpl::Pair& layer_pair, |
| 22 TreePriority tree_priority); | 23 TreePriority tree_priority); |
| 23 ~PairedPictureLayerQueue(); | 24 ~PairedPictureLayerQueue(); |
| 24 | 25 |
| 25 bool IsEmpty() const; | 26 bool IsEmpty() const; |
| 26 Tile* Top(TreePriority tree_priority); | 27 Tile* Top(TreePriority tree_priority); |
| 27 void Pop(TreePriority tree_priority); | 28 void Pop(TreePriority tree_priority); |
| 28 | 29 |
| 29 WhichTree NextTileIteratorTree(TreePriority tree_priority) const; | 30 WhichTree NextTileIteratorTree(TreePriority tree_priority) const; |
| 31 WhichTree PrimarySharedTileTree(TreePriority tree_priority, |
| 32 const Tile* tile) const; |
| 30 | 33 |
| 31 PictureLayerImpl::LayerRasterTileIterator active_iterator; | 34 PictureLayerImpl::LayerRasterTileIterator active_iterator; |
| 32 PictureLayerImpl::LayerRasterTileIterator pending_iterator; | 35 PictureLayerImpl::LayerRasterTileIterator pending_iterator; |
| 36 bool has_both_layers; |
| 33 | 37 |
| 34 // TODO(vmpstr): Investigate removing this. | 38 // Set of returned tiles (excluding the current one) for DCHECKing. |
| 35 std::vector<Tile*> returned_shared_tiles; | 39 std::set<const Tile*> returned_tiles_for_debug; |
| 36 }; | 40 }; |
| 37 | 41 |
| 38 RasterTilePriorityQueue(); | 42 RasterTilePriorityQueue(); |
| 39 ~RasterTilePriorityQueue(); | 43 ~RasterTilePriorityQueue(); |
| 40 | 44 |
| 41 void Build(const std::vector<PictureLayerImpl::Pair>& paired_layers, | 45 void Build(const std::vector<PictureLayerImpl::Pair>& paired_layers, |
| 42 TreePriority tree_priority); | 46 TreePriority tree_priority); |
| 43 void Reset(); | 47 void Reset(); |
| 44 | 48 |
| 45 bool IsEmpty() const; | 49 bool IsEmpty() const; |
| 46 Tile* Top(); | 50 Tile* Top(); |
| 47 void Pop(); | 51 void Pop(); |
| 48 | 52 |
| 49 private: | 53 private: |
| 50 // TODO(vmpstr): This is potentially unnecessary if it becomes the case that | 54 // TODO(vmpstr): This is potentially unnecessary if it becomes the case that |
| 51 // PairedPictureLayerQueue is fast enough to copy. In that case, we can use | 55 // PairedPictureLayerQueue is fast enough to copy. In that case, we can use |
| 52 // objects directly (ie std::vector<PairedPictureLayerQueue>. | 56 // objects directly (ie std::vector<PairedPictureLayerQueue>. |
| 53 ScopedPtrVector<PairedPictureLayerQueue> paired_queues_; | 57 ScopedPtrVector<PairedPictureLayerQueue> paired_queues_; |
| 54 TreePriority tree_priority_; | 58 TreePriority tree_priority_; |
| 55 | 59 |
| 56 DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueue); | 60 DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueue); |
| 57 }; | 61 }; |
| 58 | 62 |
| 59 } // namespace cc | 63 } // namespace cc |
| 60 | 64 |
| 61 #endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ | 65 #endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_ |
| OLD | NEW |