QUICHE team | a6ef0a6 | 2019-03-07 20:34:33 -0500 | [diff] [blame] | 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 "net/third_party/quiche/src/quic/core/quic_lru_cache.h" |
| 6 | |
| 7 | #include "net/third_party/quiche/src/quic/platform/api/quic_test.h" |
| 8 | |
| 9 | namespace quic { |
| 10 | namespace test { |
| 11 | namespace { |
| 12 | |
| 13 | struct CachedItem { |
| 14 | explicit CachedItem(uint32_t new_value) : value(new_value) {} |
| 15 | |
| 16 | uint32_t value; |
| 17 | }; |
| 18 | |
| 19 | TEST(QuicLRUCacheTest, InsertAndLookup) { |
| 20 | QuicLRUCache<int, CachedItem> cache(5); |
| 21 | EXPECT_EQ(nullptr, 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)->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)->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 | EXPECT_EQ(13u, cache.Lookup(3)->value); |
| 41 | |
| 42 | // No memory leakage. |
| 43 | cache.Clear(); |
| 44 | EXPECT_EQ(0u, cache.Size()); |
| 45 | } |
| 46 | |
| 47 | TEST(QuicLRUCacheTest, Eviction) { |
| 48 | QuicLRUCache<int, CachedItem> cache(3); |
| 49 | |
| 50 | for (size_t i = 1; i <= 4; ++i) { |
| 51 | std::unique_ptr<CachedItem> item(new CachedItem(10 + i)); |
| 52 | cache.Insert(i, std::move(item)); |
| 53 | } |
| 54 | |
| 55 | EXPECT_EQ(3u, cache.Size()); |
| 56 | EXPECT_EQ(3u, cache.MaxSize()); |
| 57 | |
| 58 | // Make sure item 1 is evicted. |
| 59 | EXPECT_EQ(nullptr, cache.Lookup(1)); |
| 60 | EXPECT_EQ(14u, cache.Lookup(4)->value); |
| 61 | |
| 62 | EXPECT_EQ(12u, cache.Lookup(2)->value); |
| 63 | std::unique_ptr<CachedItem> item5(new CachedItem(15)); |
| 64 | cache.Insert(5, std::move(item5)); |
| 65 | // Make sure item 3 is evicted. |
| 66 | EXPECT_EQ(nullptr, cache.Lookup(3)); |
| 67 | EXPECT_EQ(15u, cache.Lookup(5)->value); |
| 68 | |
| 69 | // No memory leakage. |
| 70 | cache.Clear(); |
| 71 | EXPECT_EQ(0u, cache.Size()); |
| 72 | } |
| 73 | |
| 74 | } // namespace |
| 75 | } // namespace test |
| 76 | } // namespace quic |