OLD | NEW |
1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 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_TILE_MANAGER_H_ | 5 #ifndef CC_RESOURCES_TILE_MANAGER_H_ |
6 #define CC_RESOURCES_TILE_MANAGER_H_ | 6 #define CC_RESOURCES_TILE_MANAGER_H_ |
7 | 7 |
8 #include <deque> | 8 #include <deque> |
9 #include <queue> | 9 #include <queue> |
10 #include <set> | 10 #include <set> |
(...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
54 // examples are: | 54 // examples are: |
55 // - Tile version initialized. | 55 // - Tile version initialized. |
56 // - Tile resources freed. | 56 // - Tile resources freed. |
57 // - Tile marked for on-demand raster. | 57 // - Tile marked for on-demand raster. |
58 virtual void NotifyTileStateChanged(const Tile* tile) = 0; | 58 virtual void NotifyTileStateChanged(const Tile* tile) = 0; |
59 | 59 |
60 // Given an empty raster tile priority queue, this will build a priority queue | 60 // Given an empty raster tile priority queue, this will build a priority queue |
61 // that will return tiles in order in which they should be rasterized. | 61 // that will return tiles in order in which they should be rasterized. |
62 // Note if the queue was previous built, Reset must be called on it. | 62 // Note if the queue was previous built, Reset must be called on it. |
63 virtual void BuildRasterQueue(RasterTilePriorityQueue* queue, | 63 virtual void BuildRasterQueue(RasterTilePriorityQueue* queue, |
64 TreePriority tree_priority) = 0; | 64 TreePriority tree_priority, |
| 65 RasterTilePriorityQueue::Type type) = 0; |
65 | 66 |
66 // Given an empty eviction tile priority queue, this will build a priority | 67 // Given an empty eviction tile priority queue, this will build a priority |
67 // queue that will return tiles in order in which they should be evicted. | 68 // queue that will return tiles in order in which they should be evicted. |
68 // Note if the queue was previous built, Reset must be called on it. | 69 // Note if the queue was previous built, Reset must be called on it. |
69 virtual void BuildEvictionQueue(EvictionTilePriorityQueue* queue, | 70 virtual void BuildEvictionQueue(EvictionTilePriorityQueue* queue, |
70 TreePriority tree_priority) = 0; | 71 TreePriority tree_priority) = 0; |
71 | 72 |
72 protected: | 73 protected: |
73 virtual ~TileManagerClient() {} | 74 virtual ~TileManagerClient() {} |
74 }; | 75 }; |
(...skipping 233 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
308 | 309 |
309 bool did_notify_ready_to_activate_; | 310 bool did_notify_ready_to_activate_; |
310 bool did_notify_ready_to_draw_; | 311 bool did_notify_ready_to_draw_; |
311 | 312 |
312 DISALLOW_COPY_AND_ASSIGN(TileManager); | 313 DISALLOW_COPY_AND_ASSIGN(TileManager); |
313 }; | 314 }; |
314 | 315 |
315 } // namespace cc | 316 } // namespace cc |
316 | 317 |
317 #endif // CC_RESOURCES_TILE_MANAGER_H_ | 318 #endif // CC_RESOURCES_TILE_MANAGER_H_ |
OLD | NEW |