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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
content / browser / code_cache / simple_lru_cache_unittest.cc [blame]
// Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/code_cache/simple_lru_cache.h"
#include "base/containers/to_vector.h"
#include "base/feature_list.h"
#include "base/test/scoped_feature_list.h"
#include "content/common/features.h"
#include "net/base/schemeful_site.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace content {
namespace {
constexpr auto kEmptyEntrySize = SimpleLruCache::kEmptyEntrySize;
class SimpleLruCacheTest : public testing::TestWithParam<bool> {
public:
SimpleLruCacheTest() {
scoped_feature_list_.InitWithFeatureState(features::kInMemoryCodeCache,
GetParam());
}
private:
base::test::ScopedFeatureList scoped_feature_list_;
};
TEST_P(SimpleLruCacheTest, Empty) {
const std::string kKey = "hello";
SimpleLruCache cache(/*capacity=*/100 * 1024);
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey));
}
TEST_P(SimpleLruCacheTest, PutAndGet) {
const std::string kKey1("key1");
const std::string kKey2("key2");
const std::string kKey3("key3");
const std::string kKey4("key4");
// Note that kKey{i} doesn't necessarily correspond to kData{i} or
// kResponseTime{i}.
const std::vector<uint8_t> kData1 = {0x08};
const std::vector<uint8_t> kData2 = {0x02, 0x09};
const std::vector<uint8_t> kData3 = {0x03, 0x0a, 0xf1};
const std::vector<uint8_t> kData4 = {0x04, 0x02, 0x00, 0x30};
const base::Time kResponseTime1 = base::Time::UnixEpoch() + base::Hours(1);
const base::Time kResponseTime2 = base::Time::UnixEpoch() + base::Hours(2);
const base::Time kResponseTime3 = base::Time::UnixEpoch() + base::Hours(3);
const base::Time kResponseTime4 = base::Time::UnixEpoch() + base::Hours(4);
SimpleLruCache cache(/*capacity=*/100 * 1024);
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_FALSE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
cache.Put(kKey1, kResponseTime1, base::make_span(kData1));
EXPECT_EQ(cache.GetSize(), 1 + 4 + kEmptyEntrySize);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_FALSE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
// Updates the entry.
cache.Put(kKey1, kResponseTime2, base::make_span(kData2));
EXPECT_EQ(cache.GetSize(), 2 + 4 + kEmptyEntrySize);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_FALSE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
cache.Put(kKey2, kResponseTime3, base::make_span(kData3));
EXPECT_EQ(cache.GetSize(), 5 + 8 + 2 * kEmptyEntrySize);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_TRUE(cache.Has(kKey2));
EXPECT_FALSE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
// We don't create an entry for `kKey3` intentionally.
cache.Put(kKey4, kResponseTime4, base::make_span(kData4));
EXPECT_EQ(cache.GetSize(), 9 + 12 + 3 * kEmptyEntrySize);
const auto result1 = cache.Get(kKey1);
ASSERT_TRUE(result1.has_value());
EXPECT_EQ(result1->response_time, kResponseTime2);
const auto result2 = cache.Get(kKey2);
ASSERT_TRUE(result2.has_value());
EXPECT_EQ(result2->response_time, kResponseTime3);
const auto result3 = cache.Get(kKey3);
ASSERT_FALSE(result3.has_value());
const auto result4 = cache.Get(kKey4);
ASSERT_TRUE(result4.has_value());
EXPECT_EQ(result4->response_time, kResponseTime4);
if (base::FeatureList::IsEnabled(features::kInMemoryCodeCache)) {
EXPECT_EQ(base::ToVector(result1->data), kData2);
EXPECT_EQ(base::ToVector(result2->data), kData3);
EXPECT_EQ(base::ToVector(result4->data), kData4);
} else {
EXPECT_EQ(result1->data.size(), 0u);
EXPECT_EQ(result2->data.size(), 0u);
EXPECT_EQ(result4->data.size(), 0u);
}
}
TEST_P(SimpleLruCacheTest, PutAndEvict) {
const std::string kKey("key1");
const uint8_t kData1[2] = {0x08, 0x09};
const uint8_t kData2[1] = {0x02};
const uint8_t kData3[2] = {0x03, 0x0a};
const base::Time kResponseTime1 = base::Time::UnixEpoch() + base::Hours(1);
const base::Time kResponseTime2 = base::Time::UnixEpoch() + base::Hours(2);
const base::Time kResponseTime3 = base::Time::UnixEpoch() + base::Hours(3);
SimpleLruCache cache(/*capacity=*/kEmptyEntrySize + kKey.size() + 1);
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey));
// This entry is immediately evicted because the size excceeds the capacity.
cache.Put(kKey, kResponseTime1, base::make_span(kData1));
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey));
// This entry stays.
cache.Put(kKey, kResponseTime2, base::make_span(kData2));
EXPECT_EQ(cache.GetSize(), 1 + kKey.size() + kEmptyEntrySize);
EXPECT_TRUE(cache.Has(kKey));
// An updated entry can also be evicted.
cache.Put(kKey, kResponseTime3, base::make_span(kData3));
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey));
}
TEST_P(SimpleLruCacheTest, LRU) {
const std::string kKey1("key1");
const std::string kKey2("key2");
const std::string kKey3("key3");
const std::string kKey4("key4");
const base::Time kResponseTime = base::Time::UnixEpoch();
SimpleLruCache cache(kEmptyEntrySize * 2 + 8);
cache.Put(kKey1, kResponseTime, base::span<uint8_t>());
cache.Put(kKey2, kResponseTime, base::span<uint8_t>());
cache.Put(kKey3, kResponseTime, base::span<uint8_t>());
cache.Put(kKey4, kResponseTime, base::span<uint8_t>());
// The last two entries are kept.
EXPECT_EQ(cache.GetSize(), 2 * kEmptyEntrySize + 8);
EXPECT_FALSE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_TRUE(cache.Has(kKey3));
EXPECT_TRUE(cache.Has(kKey4));
}
TEST_P(SimpleLruCacheTest, LRUAndGet) {
const std::string kKey1("key1");
const std::string kKey2("key2");
const std::string kKey3("key3");
const std::string kKey4("key4");
const base::Time kResponseTime = base::Time::UnixEpoch();
SimpleLruCache cache(kEmptyEntrySize * 2 + 8);
cache.Put(kKey1, kResponseTime, base::span<uint8_t>());
cache.Put(kKey2, kResponseTime, base::span<uint8_t>());
// This call updates the access time.
EXPECT_TRUE(cache.Has(kKey1));
cache.Put(kKey3, kResponseTime, base::span<uint8_t>());
EXPECT_EQ(cache.GetSize(), 2 * kEmptyEntrySize + 8);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_TRUE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
}
TEST_P(SimpleLruCacheTest, Delete) {
const base::Time kResponseTime = base::Time::UnixEpoch();
const std::string kKey1("key1");
const std::string kKey2("key2");
const std::string kKey3("key3");
const std::string kKey4("key4");
const uint8_t kData1[1] = {0x08};
const uint8_t kData2[2] = {0x02, 0x09};
const uint8_t kData3[3] = {0x03, 0x0a, 0xf1};
const uint8_t kData4[4] = {0x04, 0x02, 0x00, 0x30};
SimpleLruCache cache(/*capacity=*/1024 * 1024);
cache.Put(kKey1, kResponseTime, base::make_span(kData1));
cache.Put(kKey2, kResponseTime, base::make_span(kData2));
cache.Put(kKey3, kResponseTime, base::make_span(kData3));
cache.Put(kKey4, kResponseTime, base::make_span(kData4));
EXPECT_EQ(cache.GetSize(), 4 * kEmptyEntrySize + 16 + 10);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_TRUE(cache.Has(kKey2));
EXPECT_TRUE(cache.Has(kKey3));
EXPECT_TRUE(cache.Has(kKey4));
cache.Delete(kKey2);
EXPECT_EQ(cache.GetSize(), 3 * kEmptyEntrySize + 12 + 8);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_TRUE(cache.Has(kKey3));
EXPECT_TRUE(cache.Has(kKey4));
cache.Delete(kKey2);
EXPECT_EQ(cache.GetSize(), 3 * kEmptyEntrySize + 12 + 8);
EXPECT_TRUE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_TRUE(cache.Has(kKey3));
EXPECT_TRUE(cache.Has(kKey4));
cache.Delete(kKey1);
cache.Delete(kKey2);
cache.Delete(kKey3);
cache.Delete(kKey4);
EXPECT_EQ(cache.GetSize(), 0u);
EXPECT_FALSE(cache.Has(kKey1));
EXPECT_FALSE(cache.Has(kKey2));
EXPECT_FALSE(cache.Has(kKey3));
EXPECT_FALSE(cache.Has(kKey4));
}
TEST_P(SimpleLruCacheTest, Clear) {
const base::Time kResponseTime = base::Time::UnixEpoch();
const std::string kKey("key1");
const uint8_t kData[1] = {0x08};
SimpleLruCache cache(/*capacity=*/1024 * 1024);
cache.Put(kKey, kResponseTime, base::make_span(kData));
EXPECT_TRUE(cache.Has(kKey));
EXPECT_GT(cache.GetSize(), 0u);
cache.Clear();
EXPECT_FALSE(cache.Has(kKey));
EXPECT_EQ(cache.GetSize(), 0u);
}
INSTANTIATE_TEST_SUITE_P(SimpleLruCacheTest,
SimpleLruCacheTest,
testing::Bool());
} // namespace
} // namespace content