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
|
// 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 <vector>
#include "testing/gtest/include/gtest/gtest.h"
namespace sync_sessions {
class SyncTabNodePoolTest : public testing::Test {
protected:
SyncTabNodePoolTest() {}
int GetMaxUsedTabNodeId() const { return pool_.max_used_tab_node_id_; }
void AddFreeTabNodes(size_t size, const int node_ids[]);
TabNodePool pool_;
};
void SyncTabNodePoolTest::AddFreeTabNodes(size_t size, const int node_ids[]) {
for (size_t i = 0; i < size; ++i) {
pool_.free_nodes_pool_.insert(node_ids[i]);
}
}
namespace {
const int kTabNodeId1 = 10;
const int kTabNodeId2 = 5;
const int kTabNodeId3 = 1000;
const SessionID kTabId1 = SessionID::FromSerializedValue(1);
const SessionID kTabId2 = SessionID::FromSerializedValue(2);
const SessionID kTabId3 = SessionID::FromSerializedValue(3);
TEST_F(SyncTabNodePoolTest, TabNodeIdIncreases) {
std::set<int> deleted_node_ids;
// max_used_tab_node_ always increases.
pool_.ReassociateTabNode(kTabNodeId1, kTabId1);
EXPECT_EQ(kTabNodeId1, GetMaxUsedTabNodeId());
pool_.ReassociateTabNode(kTabNodeId2, kTabId2);
EXPECT_EQ(kTabNodeId1, GetMaxUsedTabNodeId());
pool_.ReassociateTabNode(kTabNodeId3, kTabId3);
EXPECT_EQ(kTabNodeId3, GetMaxUsedTabNodeId());
// Freeing a tab node does not change max_used_tab_node_id_.
pool_.FreeTab(kTabId3);
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
pool_.FreeTab(kTabId2);
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
pool_.FreeTab(kTabId1);
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
for (int i = 0; i < 3; ++i) {
int tab_node_id = -1;
EXPECT_TRUE(pool_.GetTabNodeForTab(SessionID::FromSerializedValue(i + 1),
&tab_node_id));
EXPECT_EQ(kTabNodeId3, GetMaxUsedTabNodeId());
}
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
EXPECT_EQ(kTabNodeId3, GetMaxUsedTabNodeId());
EXPECT_TRUE(pool_.Empty());
}
TEST_F(SyncTabNodePoolTest, Reassociation) {
// Reassociate tab node 1 with tab id 1.
pool_.ReassociateTabNode(kTabNodeId1, kTabId1);
EXPECT_EQ(1U, pool_.Capacity());
EXPECT_TRUE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_EQ(kTabId1, pool_.GetTabIdFromTabNodeId(kTabNodeId1));
EXPECT_FALSE(pool_.GetTabIdFromTabNodeId(kTabNodeId2).is_valid());
// Introduce a new tab node associated with the same tab. The old tab node
// should get added to the free pool
pool_.ReassociateTabNode(kTabNodeId2, kTabId1);
EXPECT_EQ(2U, pool_.Capacity());
EXPECT_FALSE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_FALSE(pool_.GetTabIdFromTabNodeId(kTabNodeId1).is_valid());
EXPECT_EQ(kTabId1, pool_.GetTabIdFromTabNodeId(kTabNodeId2));
// Reassociating the same tab node/tab should have no effect.
pool_.ReassociateTabNode(kTabNodeId2, kTabId1);
EXPECT_EQ(2U, pool_.Capacity());
EXPECT_FALSE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_FALSE(pool_.GetTabIdFromTabNodeId(kTabNodeId1).is_valid());
EXPECT_EQ(kTabId1, pool_.GetTabIdFromTabNodeId(kTabNodeId2));
// Reassociating the new tab node with a new tab should just update the
// association tables.
pool_.ReassociateTabNode(kTabNodeId2, kTabId2);
EXPECT_EQ(2U, pool_.Capacity());
EXPECT_FALSE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_FALSE(pool_.GetTabIdFromTabNodeId(kTabNodeId1).is_valid());
EXPECT_EQ(kTabId2, pool_.GetTabIdFromTabNodeId(kTabNodeId2));
// Reassociating the first tab node should make the pool empty.
pool_.ReassociateTabNode(kTabNodeId1, kTabId1);
EXPECT_EQ(2U, pool_.Capacity());
EXPECT_TRUE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_EQ(kTabId1, pool_.GetTabIdFromTabNodeId(kTabNodeId1));
EXPECT_EQ(kTabId2, pool_.GetTabIdFromTabNodeId(kTabNodeId2));
}
TEST_F(SyncTabNodePoolTest, ReassociateThenFree) {
std::set<int> deleted_node_ids;
// Verify old tab nodes are reassociated correctly.
pool_.ReassociateTabNode(kTabNodeId1, kTabId1);
pool_.ReassociateTabNode(kTabNodeId2, kTabId2);
pool_.ReassociateTabNode(kTabNodeId3, kTabId3);
EXPECT_EQ(3u, pool_.Capacity());
EXPECT_TRUE(pool_.Empty());
// Free tabs 2 and 3.
pool_.FreeTab(kTabId2);
pool_.FreeTab(kTabId3);
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
// Free node pool should have 2 and 3.
EXPECT_FALSE(pool_.Empty());
EXPECT_EQ(3u, pool_.Capacity());
// Free all nodes
pool_.FreeTab(kTabId1);
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
EXPECT_TRUE(pool_.Full());
std::set<int> free_sync_ids;
for (int i = 1; i <= 3; ++i) {
int tab_node_id = -1;
EXPECT_TRUE(pool_.GetTabNodeForTab(SessionID::FromSerializedValue(i),
&tab_node_id));
free_sync_ids.insert(tab_node_id);
}
EXPECT_TRUE(pool_.Empty());
EXPECT_EQ(3u, free_sync_ids.size());
EXPECT_EQ(1u, free_sync_ids.count(kTabNodeId1));
EXPECT_EQ(1u, free_sync_ids.count(kTabNodeId2));
EXPECT_EQ(1u, free_sync_ids.count(kTabNodeId3));
}
TEST_F(SyncTabNodePoolTest, Init) {
EXPECT_TRUE(pool_.Empty());
EXPECT_TRUE(pool_.Full());
}
TEST_F(SyncTabNodePoolTest, AddGet) {
int free_nodes[] = {5, 10};
AddFreeTabNodes(2, free_nodes);
EXPECT_EQ(2U, pool_.Capacity());
int tab_node_id = -1;
EXPECT_TRUE(pool_.GetTabNodeForTab(kTabId1, &tab_node_id));
EXPECT_EQ(5, tab_node_id);
EXPECT_FALSE(pool_.Empty());
EXPECT_FALSE(pool_.Full());
EXPECT_EQ(2U, pool_.Capacity());
// 5 is now used, should return 10.
EXPECT_TRUE(pool_.GetTabNodeForTab(kTabId2, &tab_node_id));
EXPECT_EQ(10, tab_node_id);
}
TEST_F(SyncTabNodePoolTest, GetTabNodeForTabCreate) {
int tab_node_id = -1;
EXPECT_FALSE(pool_.GetTabNodeForTab(kTabId1, &tab_node_id));
EXPECT_EQ(0, tab_node_id);
}
TEST_F(SyncTabNodePoolTest, TabPoolFreeNodeLimits) {
std::set<int> deleted_node_ids;
// Allocate TabNodePool::kFreeNodesHighWatermark + 1 nodes and verify that
// freeing the last node reduces the free node pool size to
// kFreeNodesLowWatermark.
std::vector<int> used_sync_ids;
for (size_t i = 1; i <= TabNodePool::kFreeNodesHighWatermark + 1; ++i) {
int sync_id = -1;
EXPECT_FALSE(
pool_.GetTabNodeForTab(SessionID::FromSerializedValue(i), &sync_id));
used_sync_ids.push_back(sync_id);
}
// Free all except one node.
used_sync_ids.pop_back();
for (size_t i = 1; i <= used_sync_ids.size(); ++i) {
pool_.FreeTab(SessionID::FromSerializedValue(i));
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_TRUE(deleted_node_ids.empty());
}
// Except one node all nodes should be in FreeNode pool.
EXPECT_FALSE(pool_.Full());
EXPECT_FALSE(pool_.Empty());
// Total capacity = 1 Associated Node + kFreeNodesHighWatermark free node.
EXPECT_EQ(TabNodePool::kFreeNodesHighWatermark + 1, pool_.Capacity());
// Freeing the last sync node should drop the free nodes to
// kFreeNodesLowWatermark.
pool_.FreeTab(
SessionID::FromSerializedValue(TabNodePool::kFreeNodesHighWatermark + 1));
pool_.CleanupTabNodes(&deleted_node_ids);
EXPECT_EQ(TabNodePool::kFreeNodesHighWatermark + 1 -
TabNodePool::kFreeNodesLowWatermark,
deleted_node_ids.size());
EXPECT_FALSE(pool_.Empty());
EXPECT_TRUE(pool_.Full());
EXPECT_EQ(TabNodePool::kFreeNodesLowWatermark, pool_.Capacity());
}
} // namespace
} // namespace sync_sessions
|
