blob: 31727cd808c9d6cc370756cf63b20909fd2ffccc (
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
|
// Copyright 2012 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/resource_update_queue.h"
#include "cc/resources/prioritized_resource.h"
namespace cc {
ResourceUpdateQueue::ResourceUpdateQueue() {}
ResourceUpdateQueue::~ResourceUpdateQueue() {}
void ResourceUpdateQueue::AppendFullUpload(const ResourceUpdate& upload) {
full_entries_.push_back(upload);
}
void ResourceUpdateQueue::AppendPartialUpload(const ResourceUpdate& upload) {
partial_entries_.push_back(upload);
}
void ResourceUpdateQueue::ClearUploadsToEvictedResources() {
ClearUploadsToEvictedResources(&full_entries_);
ClearUploadsToEvictedResources(&partial_entries_);
}
void ResourceUpdateQueue::ClearUploadsToEvictedResources(
std::deque<ResourceUpdate>* entry_queue) {
std::deque<ResourceUpdate> temp;
entry_queue->swap(temp);
while (temp.size()) {
ResourceUpdate upload = temp.front();
temp.pop_front();
if (!upload.texture->BackingResourceWasEvicted())
entry_queue->push_back(upload);
}
}
ResourceUpdate ResourceUpdateQueue::TakeFirstFullUpload() {
ResourceUpdate first = full_entries_.front();
full_entries_.pop_front();
return first;
}
ResourceUpdate ResourceUpdateQueue::TakeFirstPartialUpload() {
ResourceUpdate first = partial_entries_.front();
partial_entries_.pop_front();
return first;
}
bool ResourceUpdateQueue::HasMoreUpdates() const {
return !full_entries_.empty() || !partial_entries_.empty();
}
} // namespace cc
|
