forked from nodejs/node
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_network_requests_buffer.cc
More file actions
181 lines (155 loc) · 5.33 KB
/
test_network_requests_buffer.cc
File metadata and controls
181 lines (155 loc) · 5.33 KB
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
#include "gtest/gtest.h"
#include "inspector/network_requests_buffer.h"
namespace node {
namespace inspector {
static uint8_t kDummyData[] = "long enough dummy data suitable for tests.";
TEST(RequestEntry, BufferSize) {
auto entry = RequestEntry(0, Charset::kBinary, false, 10);
EXPECT_EQ(entry.buffer_size(), 0u);
entry.push_request_data_blob(protocol::Binary::fromSpan(kDummyData, 5));
EXPECT_EQ(entry.buffer_size(), 5u);
entry.push_response_data_blob(protocol::Binary::fromSpan(kDummyData, 3));
EXPECT_EQ(entry.buffer_size(), 8u);
// Exceeds the per-resource buffer size limit, ignore it.
entry.push_request_data_blob(protocol::Binary::fromSpan(kDummyData, 3));
EXPECT_EQ(entry.buffer_size(), 8u);
entry.push_response_data_blob(protocol::Binary::fromSpan(kDummyData, 3));
EXPECT_EQ(entry.buffer_size(), 8u);
entry.clear_response_data_blobs();
EXPECT_EQ(entry.buffer_size(), 5u);
}
TEST(RequestsBuffer, Basic) {
RequestsBuffer buffer(10);
EXPECT_FALSE(buffer.contains("1"));
EXPECT_TRUE(
buffer.emplace("1", RequestEntry(0, Charset::kBinary, false, 10)));
EXPECT_TRUE(buffer.contains("1"));
// Duplicate entry, ignore it.
EXPECT_FALSE(
buffer.emplace("1", RequestEntry(0, Charset::kBinary, false, 10)));
EXPECT_TRUE(buffer.contains("1"));
EXPECT_TRUE(
buffer.emplace("2", RequestEntry(0, Charset::kBinary, false, 10)));
EXPECT_TRUE(buffer.contains("2"));
buffer.erase("1");
EXPECT_FALSE(buffer.contains("1"));
EXPECT_TRUE(buffer.contains("2"));
}
TEST(RequestsBuffer, Find) {
RequestsBuffer buffer(10);
EXPECT_FALSE(buffer.contains("1"));
EXPECT_TRUE(
buffer.emplace("1", RequestEntry(0, Charset::kBinary, false, 10)));
EXPECT_TRUE(buffer.contains("1"));
{
auto it = buffer.find("1");
EXPECT_NE(it, buffer.end());
EXPECT_EQ(it->first, "1");
EXPECT_EQ(it->second.buffer_size(), 0u);
it->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
it->second.push_response_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
EXPECT_EQ(it->second.buffer_size(), 10u);
EXPECT_EQ(buffer.total_buffer_size(), 0u);
// Update the total buffer size when the iterator is destroyed.
}
EXPECT_EQ(buffer.total_buffer_size(), 10u);
// Shrink
{
auto it = buffer.find("1");
EXPECT_NE(it, buffer.end());
EXPECT_EQ(it->first, "1");
EXPECT_EQ(it->second.buffer_size(), 10u);
it->second.clear_response_data_blobs();
EXPECT_EQ(it->second.buffer_size(), 5u);
}
EXPECT_EQ(buffer.total_buffer_size(), 5u);
// const find
{
auto it = buffer.cfind("1");
EXPECT_NE(it, buffer.end());
EXPECT_EQ(it->first, "1");
EXPECT_EQ(it->second.buffer_size(), 5u);
}
// Non-existing entry.
{
auto it = buffer.find("2");
EXPECT_EQ(it, buffer.end());
}
{
auto it = buffer.cfind("2");
EXPECT_EQ(it, buffer.end());
}
}
TEST(RequestsBuffer, Erase) {
RequestsBuffer buffer(10);
EXPECT_FALSE(buffer.contains("1"));
EXPECT_TRUE(
buffer.emplace("1", RequestEntry(0, Charset::kBinary, false, 10)));
EXPECT_TRUE(buffer.contains("1"));
{
auto it = buffer.find("1");
EXPECT_NE(it, buffer.end());
EXPECT_EQ(it->first, "1");
EXPECT_EQ(it->second.buffer_size(), 0u);
it->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
it->second.push_response_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
EXPECT_EQ(it->second.buffer_size(), 10u);
EXPECT_EQ(buffer.total_buffer_size(), 0u);
// Update the total buffer size when the iterator is destroyed.
}
EXPECT_EQ(buffer.total_buffer_size(), 10u);
buffer.erase("1");
EXPECT_FALSE(buffer.contains("1"));
EXPECT_EQ(buffer.total_buffer_size(), 0u);
// Non-existing entry.
buffer.erase("2");
EXPECT_EQ(buffer.total_buffer_size(), 0u);
}
TEST(RequestsBuffer, EnforceLimit) {
RequestsBuffer buffer(15);
{
EXPECT_TRUE(
buffer.emplace("1", RequestEntry(0, Charset::kBinary, false, 15)));
buffer.find("1")->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 10));
EXPECT_EQ(buffer.total_buffer_size(), 10u);
}
{
EXPECT_TRUE(
buffer.emplace("2", RequestEntry(0, Charset::kBinary, false, 15)));
buffer.find("2")->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
EXPECT_EQ(buffer.total_buffer_size(), 15u);
}
// Exceeds the limit, the oldest entry is removed.
{
EXPECT_TRUE(
buffer.emplace("3", RequestEntry(0, Charset::kBinary, false, 15)));
buffer.find("3")->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 5));
// "2" and "3" are kept.
EXPECT_EQ(buffer.total_buffer_size(), 10u);
}
EXPECT_FALSE(buffer.contains("1"));
EXPECT_TRUE(buffer.contains("2"));
EXPECT_TRUE(buffer.contains("3"));
// Exceeds the limit, the oldest entry is removed.
{
EXPECT_TRUE(
buffer.emplace("4", RequestEntry(0, Charset::kBinary, false, 15)));
buffer.find("4")->second.push_request_data_blob(
protocol::Binary::fromSpan(kDummyData, 10));
// "3" and "4" are kept.
EXPECT_EQ(buffer.total_buffer_size(), 15u);
}
EXPECT_FALSE(buffer.contains("1"));
EXPECT_FALSE(buffer.contains("2"));
EXPECT_TRUE(buffer.contains("3"));
EXPECT_TRUE(buffer.contains("4"));
}
} // namespace inspector
} // namespace node