blob: 7c028d1d81fa545f5badf4855230b9b7db91e4f9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
// 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.
#ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
#define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
#include <utility>
#include <vector>
#include "cc/base/cc_export.h"
#include "cc/layers/picture_layer_impl.h"
#include "cc/resources/tile_priority.h"
namespace cc {
class CC_EXPORT RasterTilePriorityQueue {
public:
struct PairedPictureLayerQueue {
PairedPictureLayerQueue();
PairedPictureLayerQueue(const PictureLayerImpl::Pair& layer_pair,
TreePriority tree_priority);
~PairedPictureLayerQueue();
bool IsEmpty() const;
Tile* Top(TreePriority tree_priority);
void Pop(TreePriority tree_priority);
WhichTree NextTileIteratorTree(TreePriority tree_priority) const;
PictureLayerImpl::LayerRasterTileIterator active_iterator;
PictureLayerImpl::LayerRasterTileIterator pending_iterator;
// TODO(vmpstr): Investigate removing this.
std::vector<Tile*> returned_shared_tiles;
};
RasterTilePriorityQueue();
~RasterTilePriorityQueue();
void Build(const std::vector<PictureLayerImpl::Pair>& paired_layers,
TreePriority tree_priority);
void Reset();
bool IsEmpty() const;
Tile* Top();
void Pop();
private:
std::vector<PairedPictureLayerQueue> paired_queues_;
TreePriority tree_priority_;
DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueue);
};
} // namespace cc
#endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
|
