blob: ced363c0314db737cbba7cbe011cdd7129e0b966 (
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
59
60
61
62
63
|
// 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/tile_manager.h"
#include "base/logging.h"
namespace cc {
TileManager::TileManager(TileManagerClient* client)
: client_(client)
, manage_tiles_pending_(false)
{
}
TileManager::~TileManager() {
ManageTiles();
DCHECK(tile_versions_.size() == 0);
}
void TileManager::SetGlobalState(const GlobalStateThatImpactsTilePriority& global_state) {
global_state_ = global_state;
ScheduleManageTiles();
}
void TileManager::ManageTiles() {
// Figure out how much memory we would be willing to give out.
// Free up memory.
// GC old versions.
}
void TileManager::DidCreateTileVersion(TileVersion* version) {
tile_versions_.push_back(version);
ScheduleManageTiles();
}
void TileManager::DidDeleteTileVersion(TileVersion* version) {
for (size_t i = 0; i < tile_versions_.size(); i++) {
if (tile_versions_[i] == version) {
tile_versions_.erase(tile_versions_.begin() + i);
return;
}
}
DCHECK(false) << "Could not find tile version.";
}
void TileManager::WillModifyTileVersionPriority(TileVersion*, const TilePriority& new_priority) {
// TODO(nduca): Do something smarter if reprioritization turns out to be
// costly.
ScheduleManageTiles();
}
void TileManager::ScheduleManageTiles() {
if (manage_tiles_pending_)
return;
ScheduleManageTiles();
manage_tiles_pending_ = true;
}
}
|
