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
|
// 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 "components/sync_sessions/tab_node_pool.h"
#include <algorithm>
#include "base/logging.h"
#include "components/sync/base/model_type.h"
#include "components/sync/protocol/session_specifics.pb.h"
#include "components/sync/protocol/sync.pb.h"
#include "components/sync_sessions/synced_tab_delegate.h"
namespace sync_sessions {
const size_t TabNodePool::kFreeNodesLowWatermark = 25;
const size_t TabNodePool::kFreeNodesHighWatermark = 100;
TabNodePool::TabNodePool() : max_used_tab_node_id_(kInvalidTabNodeID) {}
// static
// We start vending tab node IDs at 0.
const int TabNodePool::kInvalidTabNodeID = -1;
TabNodePool::~TabNodePool() {}
void TabNodePool::AddTabNode(int tab_node_id) {
DCHECK_GT(tab_node_id, kInvalidTabNodeID);
DCHECK(nodeid_tabid_map_.find(tab_node_id) == nodeid_tabid_map_.end());
DVLOG(1) << "Adding tab node " << tab_node_id << " to pool.";
max_used_tab_node_id_ = std::max(max_used_tab_node_id_, tab_node_id);
free_nodes_pool_.insert(tab_node_id);
}
void TabNodePool::AssociateTabNode(int tab_node_id, SessionID::id_type tab_id) {
DCHECK_GT(tab_node_id, kInvalidTabNodeID);
DCHECK_GT(tab_id, kInvalidTabID);
// This is a new node association, the sync node should be free.
// Remove node from free node pool and then associate it with the tab.
std::set<int>::iterator it = free_nodes_pool_.find(tab_node_id);
DCHECK(it != free_nodes_pool_.end());
free_nodes_pool_.erase(it);
DCHECK(nodeid_tabid_map_.find(tab_node_id) == nodeid_tabid_map_.end());
DVLOG(1) << "Associating tab node " << tab_node_id << " with tab " << tab_id;
nodeid_tabid_map_[tab_node_id] = tab_id;
tabid_nodeid_map_[tab_id] = tab_node_id;
}
bool TabNodePool::GetTabNodeForTab(SessionID::id_type tab_id,
int* tab_node_id) {
if (tabid_nodeid_map_.find(tab_id) != tabid_nodeid_map_.end()) {
*tab_node_id = tabid_nodeid_map_[tab_id];
return true;
}
if (free_nodes_pool_.empty()) {
// Tab pool has no free nodes, allocate new one.
*tab_node_id = ++max_used_tab_node_id_;
AddTabNode(*tab_node_id);
AssociateTabNode(*tab_node_id, tab_id);
return false;
} else {
// Return the next free node.
*tab_node_id = *free_nodes_pool_.begin();
AssociateTabNode(*tab_node_id, tab_id);
return true;
}
}
void TabNodePool::FreeTab(int tab_id) {
DCHECK_GT(tab_id, kInvalidTabID);
TabIDToTabNodeIDMap::iterator it = tabid_nodeid_map_.find(tab_id);
if (it == tabid_nodeid_map_.end()) {
return; // Already freed.
}
int tab_node_id = it->second;
DVLOG(1) << "Freeing tab " << tab_id << " at node " << tab_node_id;
nodeid_tabid_map_.erase(nodeid_tabid_map_.find(tab_node_id));
tabid_nodeid_map_.erase(it);
free_nodes_pool_.insert(tab_node_id);
}
void TabNodePool::ReassociateTabNode(int tab_node_id,
SessionID::id_type tab_id) {
DCHECK_GT(tab_node_id, kInvalidTabNodeID);
DCHECK_GT(tab_id, kInvalidTabID);
auto tabid_it = tabid_nodeid_map_.find(tab_id);
if (tabid_it != tabid_nodeid_map_.end()) {
if (tabid_it->second == tab_node_id) {
return; // Already associated properly.
} else {
// Another node is already associated with this tab. Free it.
FreeTab(tab_id);
}
}
auto nodeid_it = nodeid_tabid_map_.find(tab_node_id);
if (nodeid_it != nodeid_tabid_map_.end()) {
// This node was already associated with another tab. Free it.
FreeTab(nodeid_it->second);
} else {
// This is a new tab node. Add it before association.
AddTabNode(tab_node_id);
}
AssociateTabNode(tab_node_id, tab_id);
}
SessionID::id_type TabNodePool::GetTabIdFromTabNodeId(int tab_node_id) const {
TabNodeIDToTabIDMap::const_iterator it = nodeid_tabid_map_.find(tab_node_id);
if (it != nodeid_tabid_map_.end()) {
return it->second;
}
return kInvalidTabID;
}
void TabNodePool::CleanupTabNodes(std::set<int>* deleted_node_ids) {
// If number of free nodes exceed kFreeNodesHighWatermark,
// delete sync nodes till number reaches kFreeNodesLowWatermark.
// Note: This logic is to mitigate temporary disassociation issues with old
// clients: https://crbug.com/259918. Newer versions do not need this.
if (free_nodes_pool_.size() > kFreeNodesHighWatermark) {
for (std::set<int>::iterator free_it = free_nodes_pool_.begin();
free_it != free_nodes_pool_.end();) {
deleted_node_ids->insert(*free_it);
free_nodes_pool_.erase(free_it++);
if (free_nodes_pool_.size() <= kFreeNodesLowWatermark) {
return;
}
}
}
}
// Clear tab pool.
void TabNodePool::Clear() {
free_nodes_pool_.clear();
nodeid_tabid_map_.clear();
tabid_nodeid_map_.clear();
max_used_tab_node_id_ = kInvalidTabNodeID;
}
size_t TabNodePool::Capacity() const {
return nodeid_tabid_map_.size() + free_nodes_pool_.size();
}
bool TabNodePool::Empty() const {
return free_nodes_pool_.empty();
}
bool TabNodePool::Full() {
return nodeid_tabid_map_.empty();
}
} // namespace sync_sessions
|
