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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
|
// 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.
#include "cc/resources/raster_tile_priority_queue.h"
namespace cc {
namespace {
class RasterOrderComparator {
public:
explicit RasterOrderComparator(TreePriority tree_priority)
: tree_priority_(tree_priority) {}
bool operator()(
const RasterTilePriorityQueue::PairedPictureLayerQueue& a,
const RasterTilePriorityQueue::PairedPictureLayerQueue& b) const {
if (a.IsEmpty())
return true;
if (b.IsEmpty())
return false;
WhichTree a_tree = a.NextTileIteratorTree(tree_priority_);
const PictureLayerImpl::LayerRasterTileIterator* a_iterator =
a_tree == ACTIVE_TREE ? &a.active_iterator : &a.pending_iterator;
WhichTree b_tree = b.NextTileIteratorTree(tree_priority_);
const PictureLayerImpl::LayerRasterTileIterator* b_iterator =
b_tree == ACTIVE_TREE ? &b.active_iterator : &b.pending_iterator;
const Tile* a_tile = **a_iterator;
const Tile* b_tile = **b_iterator;
const TilePriority& a_priority =
a_tile->priority_for_tree_priority(tree_priority_);
const TilePriority& b_priority =
b_tile->priority_for_tree_priority(tree_priority_);
bool prioritize_low_res = tree_priority_ == SMOOTHNESS_TAKES_PRIORITY;
// Now we have to return true iff b is higher priority than a.
// If the bin is the same but the resolution is not, then the order will be
// determined by whether we prioritize low res or not.
// TODO(vmpstr): Remove this when TilePriority is no longer a member of Tile
// class but instead produced by the iterators.
if (b_priority.priority_bin == a_priority.priority_bin &&
b_priority.resolution != a_priority.resolution) {
// Non ideal resolution should be sorted lower than other resolutions.
if (a_priority.resolution == NON_IDEAL_RESOLUTION)
return true;
if (b_priority.resolution == NON_IDEAL_RESOLUTION)
return false;
if (prioritize_low_res)
return b_priority.resolution == LOW_RESOLUTION;
return b_priority.resolution == HIGH_RESOLUTION;
}
return b_priority.IsHigherPriorityThan(a_priority);
}
private:
TreePriority tree_priority_;
};
} // namespace
RasterTilePriorityQueue::RasterTilePriorityQueue() {
}
RasterTilePriorityQueue::~RasterTilePriorityQueue() {
}
void RasterTilePriorityQueue::Build(
const std::vector<PictureLayerImpl::Pair>& paired_layers,
TreePriority tree_priority) {
tree_priority_ = tree_priority;
for (std::vector<PictureLayerImpl::Pair>::const_iterator it =
paired_layers.begin();
it != paired_layers.end();
++it) {
paired_queues_.push_back(PairedPictureLayerQueue(*it, tree_priority_));
}
std::make_heap(paired_queues_.begin(),
paired_queues_.end(),
RasterOrderComparator(tree_priority_));
}
void RasterTilePriorityQueue::Reset() {
paired_queues_.clear();
}
bool RasterTilePriorityQueue::IsEmpty() const {
return paired_queues_.empty() || paired_queues_.front().IsEmpty();
}
Tile* RasterTilePriorityQueue::Top() {
DCHECK(!IsEmpty());
return paired_queues_.front().Top(tree_priority_);
}
void RasterTilePriorityQueue::Pop() {
DCHECK(!IsEmpty());
std::pop_heap(paired_queues_.begin(),
paired_queues_.end(),
RasterOrderComparator(tree_priority_));
PairedPictureLayerQueue& paired_queue = paired_queues_.back();
paired_queue.Pop(tree_priority_);
std::push_heap(paired_queues_.begin(),
paired_queues_.end(),
RasterOrderComparator(tree_priority_));
}
RasterTilePriorityQueue::PairedPictureLayerQueue::PairedPictureLayerQueue() {
}
RasterTilePriorityQueue::PairedPictureLayerQueue::PairedPictureLayerQueue(
const PictureLayerImpl::Pair& layer_pair,
TreePriority tree_priority)
: active_iterator(layer_pair.active
? PictureLayerImpl::LayerRasterTileIterator(
layer_pair.active,
tree_priority == SMOOTHNESS_TAKES_PRIORITY)
: PictureLayerImpl::LayerRasterTileIterator()),
pending_iterator(layer_pair.pending
? PictureLayerImpl::LayerRasterTileIterator(
layer_pair.pending,
tree_priority == SMOOTHNESS_TAKES_PRIORITY)
: PictureLayerImpl::LayerRasterTileIterator()) {
}
RasterTilePriorityQueue::PairedPictureLayerQueue::~PairedPictureLayerQueue() {
}
bool RasterTilePriorityQueue::PairedPictureLayerQueue::IsEmpty() const {
return !active_iterator && !pending_iterator;
}
Tile* RasterTilePriorityQueue::PairedPictureLayerQueue::Top(
TreePriority tree_priority) {
DCHECK(!IsEmpty());
WhichTree next_tree = NextTileIteratorTree(tree_priority);
PictureLayerImpl::LayerRasterTileIterator* next_iterator =
next_tree == ACTIVE_TREE ? &active_iterator : &pending_iterator;
DCHECK(*next_iterator);
Tile* tile = **next_iterator;
DCHECK(std::find(returned_shared_tiles.begin(),
returned_shared_tiles.end(),
tile) == returned_shared_tiles.end());
return tile;
}
void RasterTilePriorityQueue::PairedPictureLayerQueue::Pop(
TreePriority tree_priority) {
DCHECK(!IsEmpty());
WhichTree next_tree = NextTileIteratorTree(tree_priority);
PictureLayerImpl::LayerRasterTileIterator* next_iterator =
next_tree == ACTIVE_TREE ? &active_iterator : &pending_iterator;
DCHECK(*next_iterator);
returned_shared_tiles.push_back(**next_iterator);
++(*next_iterator);
if (IsEmpty())
return;
next_tree = NextTileIteratorTree(tree_priority);
next_iterator =
next_tree == ACTIVE_TREE ? &active_iterator : &pending_iterator;
while (std::find(returned_shared_tiles.begin(),
returned_shared_tiles.end(),
**next_iterator) != returned_shared_tiles.end()) {
++(*next_iterator);
if (IsEmpty())
break;
next_tree = NextTileIteratorTree(tree_priority);
next_iterator =
next_tree == ACTIVE_TREE ? &active_iterator : &pending_iterator;
}
}
WhichTree
RasterTilePriorityQueue::PairedPictureLayerQueue::NextTileIteratorTree(
TreePriority tree_priority) const {
DCHECK(!IsEmpty());
// If we only have one iterator with tiles, return it.
if (!active_iterator)
return PENDING_TREE;
if (!pending_iterator)
return ACTIVE_TREE;
// Now both iterators have tiles, so we have to decide based on tree priority.
switch (tree_priority) {
case SMOOTHNESS_TAKES_PRIORITY:
return ACTIVE_TREE;
case NEW_CONTENT_TAKES_PRIORITY:
return PENDING_TREE;
case SAME_PRIORITY_FOR_BOTH_TREES: {
const Tile* active_tile = *active_iterator;
const Tile* pending_tile = *pending_iterator;
if (active_tile == pending_tile)
return ACTIVE_TREE;
const TilePriority& active_priority = active_tile->priority(ACTIVE_TREE);
const TilePriority& pending_priority =
pending_tile->priority(PENDING_TREE);
if (active_priority.IsHigherPriorityThan(pending_priority))
return ACTIVE_TREE;
return PENDING_TREE;
}
default:
NOTREACHED();
}
NOTREACHED();
// Keep the compiler happy.
return ACTIVE_TREE;
}
} // namespace cc
|
