File: persistent_cache_collection_unittest.cc

package info (click to toggle)
chromium 141.0.7390.107-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 6,246,132 kB
  • sloc: cpp: 35,264,965; ansic: 7,169,920; javascript: 4,250,185; python: 1,460,635; asm: 950,788; xml: 751,751; pascal: 187,972; sh: 89,459; perl: 88,691; objc: 79,953; sql: 53,924; cs: 44,622; fortran: 24,137; makefile: 22,313; tcl: 15,277; php: 14,018; yacc: 8,995; ruby: 7,553; awk: 3,720; lisp: 3,096; lex: 1,330; ada: 727; jsp: 228; sed: 36
file content (162 lines) | stat: -rw-r--r-- 6,009 bytes parent folder | download | duplicates (4)
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
// Copyright 2025 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "components/persistent_cache/persistent_cache_collection.h"

#include "base/containers/span.h"
#include "base/files/file_util.h"
#include "base/files/scoped_temp_dir.h"
#include "base/strings/string_number_conversions.h"
#include "components/persistent_cache/backend_params_manager.h"
#include "components/persistent_cache/entry.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace persistent_cache {
namespace {

// Default value large enough to no interfere with functioning of tests.
constexpr size_t kTargetFootprint = 1024 * 1024 * 100;

TEST(PersistentCacheCollection, Retrieval) {
  base::ScopedTempDir temp_dir;
  CHECK(temp_dir.CreateUniqueTempDir());
  PersistentCacheCollection collection(
      std::make_unique<BackendParamsManager>(temp_dir.GetPath()),
      kTargetFootprint);

  constexpr char first_cache_id[] = "first_cache_id";
  constexpr char second_cache_id[] = "second_cache_id";

  constexpr char first_key[] = "first_key";
  constexpr char second_key[] = "second_key";

  constexpr const char first_content[] = "first_content";

  // At first there is nothing in the collection.
  EXPECT_EQ(collection.Find(first_cache_id, first_key), nullptr);
  EXPECT_EQ(collection.Find(first_cache_id, second_key), nullptr);
  EXPECT_EQ(collection.Find(second_cache_id, first_key), nullptr);
  EXPECT_EQ(collection.Find(second_cache_id, second_key), nullptr);

  // Inserting for a certain cache id allows retrieval for this id and this id
  // only.
  collection.Insert(first_cache_id, first_key,
                    base::byte_span_from_cstring(first_content));
  auto entry = collection.Find(first_cache_id, first_key);
  ASSERT_NE(entry, nullptr);
  EXPECT_EQ(entry->GetContentSpan(),
            base::byte_span_from_cstring(first_content));
  EXPECT_EQ(collection.Find(second_cache_id, first_key), nullptr);
}

TEST(PersistentCacheCollection, RetrievalAfterClear) {
  base::ScopedTempDir temp_dir;
  CHECK(temp_dir.CreateUniqueTempDir());
  PersistentCacheCollection collection(
      std::make_unique<BackendParamsManager>(temp_dir.GetPath()),
      kTargetFootprint);

  std::string first_cache_id = "first_cache_id";
  std::string first_key = "first_key";
  constexpr const char first_content[] = "first_content";

  // Test basic retrieval.
  EXPECT_EQ(collection.Find(first_cache_id, first_key), nullptr);
  collection.Insert(first_cache_id, first_key,
                    base::byte_span_from_cstring(first_content));
  EXPECT_NE(collection.Find(first_cache_id, first_key), nullptr);

  // Retrieval still works after clear because data persistence is unnafected by
  // lifetime of PersistentCache instances.
  collection.ClearForTesting();
  EXPECT_NE(collection.Find(first_cache_id, first_key), nullptr);
}

TEST(PersistentCacheCollection, DeleteAllFiles) {
  base::ScopedTempDir temp_dir;
  CHECK(temp_dir.CreateUniqueTempDir());
  PersistentCacheCollection collection(
      std::make_unique<BackendParamsManager>(temp_dir.GetPath()),
      kTargetFootprint);

  std::string first_cache_id = "first_cache_id";
  std::string first_key = "first_key";
  constexpr const char first_content[] = "first_content";

  // Inserting an entry makes it available.
  collection.Insert(first_cache_id, first_key,
                    base::byte_span_from_cstring(first_content));
  EXPECT_NE(collection.Find(first_cache_id, first_key), nullptr);

  collection.DeleteAllFiles();

  // After deletion the content is not available anymore.
  EXPECT_EQ(collection.Find(first_cache_id, first_key), nullptr);
}

TEST(PersistentCacheCollection, ContinuousFootPrintReduction) {
  base::ScopedTempDir temp_dir;
  CHECK(temp_dir.CreateUniqueTempDir());
  constexpr int64_t kSmallFootprint = 128;

  PersistentCacheCollection collection(
      std::make_unique<BackendParamsManager>(temp_dir.GetPath()),
      kSmallFootprint);

  int i = 0;
  int64_t added_footprint = 0;

  // Add things right up to the limit where files start to be deleted.
  while (added_footprint < kSmallFootprint) {
    std::string number = base::NumberToString(i);

    // Account for size of key and value.
    int64_t footprint_after_insertion = added_footprint + number.length() * 2;

    if (footprint_after_insertion < kSmallFootprint) {
      int64_t directory_size_before =
          base::ComputeDirectorySize(temp_dir.GetPath());

      collection.Insert(number, number, base::as_byte_span(number));

      int64_t directory_size_after =
          base::ComputeDirectorySize(temp_dir.GetPath());

      // If there's no footprint reduction and the new values are being stored
      // then directory size is just going up.
      EXPECT_GT(directory_size_after, directory_size_before);
    }

    added_footprint = footprint_after_insertion;
    ++i;
  }

  // If `kSmallFootprint` is not large enough to trigger at least two successful
  // insertions into the cache the test does not provide sufficient coverage.
  ASSERT_GT(i, 2);

  int64_t directory_size_before =
      base::ComputeDirectorySize(temp_dir.GetPath());

  // Since no footprint reduction should have been triggered all values added
  // should still be available.
  for (int j = 0; j < i - 1; ++j) {
    std::string number = base::NumberToString(j);
    EXPECT_NE(collection.Find(number, number), nullptr);
  }

  // Add one more item which should bring things over the limit.
  std::string number = base::NumberToString(i + 1);
  collection.Insert(number, number, base::as_byte_span(number));

  int64_t directory_size_after = base::ComputeDirectorySize(temp_dir.GetPath());

  // Footprint reduction happened automatically. Note that's it's not possible
  // to specifically know what the current footprint is since the last insert
  // took place after the footprint reduction.
  EXPECT_LT(directory_size_after, directory_size_before);
}

}  // namespace
}  // namespace persistent_cache