| OLD | NEW |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 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_ALL_H_ | 5 #ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_ |
| 6 #define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_ | 6 #define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_ |
| 7 | 7 |
| 8 #include <set> | 8 #include <set> |
| 9 #include <utility> | 9 #include <utility> |
| 10 #include <vector> | 10 #include <vector> |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 PairedTilingSetQueue(); | 24 PairedTilingSetQueue(); |
| 25 PairedTilingSetQueue(const PictureLayerImpl::Pair& layer_pair, | 25 PairedTilingSetQueue(const PictureLayerImpl::Pair& layer_pair, |
| 26 TreePriority tree_priority); | 26 TreePriority tree_priority); |
| 27 ~PairedTilingSetQueue(); | 27 ~PairedTilingSetQueue(); |
| 28 | 28 |
| 29 bool IsEmpty() const; | 29 bool IsEmpty() const; |
| 30 Tile* Top(TreePriority tree_priority); | 30 Tile* Top(TreePriority tree_priority); |
| 31 void Pop(TreePriority tree_priority); | 31 void Pop(TreePriority tree_priority); |
| 32 | 32 |
| 33 WhichTree NextTileIteratorTree(TreePriority tree_priority) const; | 33 WhichTree NextTileIteratorTree(TreePriority tree_priority) const; |
| 34 void SkipTilesReturnedByTwin(TreePriority tree_priority); | |
| 35 | 34 |
| 36 scoped_refptr<base::trace_event::ConvertableToTraceFormat> StateAsValue() | 35 scoped_refptr<base::trace_event::ConvertableToTraceFormat> StateAsValue() |
| 37 const; | 36 const; |
| 38 | 37 |
| 39 const TilingSetRasterQueueAll* active_queue() const { | 38 const TilingSetRasterQueueAll* active_queue() const { |
| 40 return active_queue_.get(); | 39 return active_queue_.get(); |
| 41 } | 40 } |
| 42 const TilingSetRasterQueueAll* pending_queue() const { | 41 const TilingSetRasterQueueAll* pending_queue() const { |
| 43 return pending_queue_.get(); | 42 return pending_queue_.get(); |
| 44 } | 43 } |
| 45 | 44 |
| 46 private: | 45 private: |
| 47 scoped_ptr<TilingSetRasterQueueAll> active_queue_; | 46 scoped_ptr<TilingSetRasterQueueAll> active_queue_; |
| 48 scoped_ptr<TilingSetRasterQueueAll> pending_queue_; | 47 scoped_ptr<TilingSetRasterQueueAll> pending_queue_; |
| 49 bool has_both_layers_; | |
| 50 | 48 |
| 51 // Set of returned tiles (excluding the current one) for DCHECKing. | 49 // Set of returned tiles (excluding the current one) for DCHECKing. |
| 52 std::set<const Tile*> returned_tiles_for_debug_; | 50 std::set<const Tile*> returned_tiles_for_debug_; |
| 53 }; | 51 }; |
| 54 | 52 |
| 55 RasterTilePriorityQueueAll(); | 53 RasterTilePriorityQueueAll(); |
| 56 ~RasterTilePriorityQueueAll() override; | 54 ~RasterTilePriorityQueueAll() override; |
| 57 | 55 |
| 58 bool IsEmpty() const override; | 56 bool IsEmpty() const override; |
| 59 Tile* Top() override; | 57 Tile* Top() override; |
| (...skipping 10 matching lines...) Expand all Loading... |
| 70 // objects directly (ie std::vector<PairedTilingSetQueue>. | 68 // objects directly (ie std::vector<PairedTilingSetQueue>. |
| 71 ScopedPtrVector<PairedTilingSetQueue> paired_queues_; | 69 ScopedPtrVector<PairedTilingSetQueue> paired_queues_; |
| 72 TreePriority tree_priority_; | 70 TreePriority tree_priority_; |
| 73 | 71 |
| 74 DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueueAll); | 72 DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueueAll); |
| 75 }; | 73 }; |
| 76 | 74 |
| 77 } // namespace cc | 75 } // namespace cc |
| 78 | 76 |
| 79 #endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_ | 77 #endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_ |
| OLD | NEW |