1 // Copyright (c) 2016 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4
5 #include "quiche/quic/core/quic_lru_cache.h"
6
7 #include "quiche/quic/platform/api/quic_test.h"
8
9 namespace quic {
10 namespace test {
11 namespace {
12
13 struct CachedItem {
CachedItemquic::test::__anoneca751060111::CachedItem14 explicit CachedItem(uint32_t new_value) : value(new_value) {}
15
16 uint32_t value;
17 };
18
TEST(QuicLRUCacheTest,InsertAndLookup)19 TEST(QuicLRUCacheTest, InsertAndLookup) {
20 QuicLRUCache<int, CachedItem> cache(5);
21 EXPECT_EQ(cache.end(), cache.Lookup(1));
22 EXPECT_EQ(0u, cache.Size());
23 EXPECT_EQ(5u, cache.MaxSize());
24
25 // Check that item 1 was properly inserted.
26 std::unique_ptr<CachedItem> item1(new CachedItem(11));
27 cache.Insert(1, std::move(item1));
28 EXPECT_EQ(1u, cache.Size());
29 EXPECT_EQ(11u, cache.Lookup(1)->second->value);
30
31 // Check that item 2 overrides item 1.
32 std::unique_ptr<CachedItem> item2(new CachedItem(12));
33 cache.Insert(1, std::move(item2));
34 EXPECT_EQ(1u, cache.Size());
35 EXPECT_EQ(12u, cache.Lookup(1)->second->value);
36
37 std::unique_ptr<CachedItem> item3(new CachedItem(13));
38 cache.Insert(3, std::move(item3));
39 EXPECT_EQ(2u, cache.Size());
40 auto iter = cache.Lookup(3);
41 ASSERT_NE(cache.end(), iter);
42 EXPECT_EQ(13u, iter->second->value);
43 cache.Erase(iter);
44 ASSERT_EQ(cache.end(), cache.Lookup(3));
45 EXPECT_EQ(1u, cache.Size());
46
47 // No memory leakage.
48 cache.Clear();
49 EXPECT_EQ(0u, cache.Size());
50 }
51
TEST(QuicLRUCacheTest,Eviction)52 TEST(QuicLRUCacheTest, Eviction) {
53 QuicLRUCache<int, CachedItem> cache(3);
54
55 for (size_t i = 1; i <= 4; ++i) {
56 std::unique_ptr<CachedItem> item(new CachedItem(10 + i));
57 cache.Insert(i, std::move(item));
58 }
59
60 EXPECT_EQ(3u, cache.Size());
61 EXPECT_EQ(3u, cache.MaxSize());
62
63 // Make sure item 1 is evicted.
64 EXPECT_EQ(cache.end(), cache.Lookup(1));
65 EXPECT_EQ(14u, cache.Lookup(4)->second->value);
66
67 EXPECT_EQ(12u, cache.Lookup(2)->second->value);
68 std::unique_ptr<CachedItem> item5(new CachedItem(15));
69 cache.Insert(5, std::move(item5));
70 // Make sure item 3 is evicted.
71 EXPECT_EQ(cache.end(), cache.Lookup(3));
72 EXPECT_EQ(15u, cache.Lookup(5)->second->value);
73
74 // No memory leakage.
75 cache.Clear();
76 EXPECT_EQ(0u, cache.Size());
77 }
78
79 } // namespace
80 } // namespace test
81 } // namespace quic
82