1 // Copyright (c) 2011 The LevelDB 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. See the AUTHORS file for names of contributors.
5 #include "leveldb/cache.h"
8 #include "util/coding.h"
9 #include "util/testharness.h"
13 // Conversions between numeric keys/values and the types expected by Cache.
14 static std::string EncodeKey(int k) {
16 PutFixed32(&result, k);
19 static int DecodeKey(const Slice& k) {
20 assert(k.size() == 4);
21 return DecodeFixed32(k.data());
23 static void* EncodeValue(uintptr_t v) { return reinterpret_cast<void*>(v); }
24 static int DecodeValue(void* v) { return reinterpret_cast<uintptr_t>(v); }
28 static CacheTest* current_;
30 static void Deleter(const Slice& key, void* v) {
31 current_->deleted_keys_.push_back(DecodeKey(key));
32 current_->deleted_values_.push_back(DecodeValue(v));
35 static const int kCacheSize = 1000;
36 std::vector<int> deleted_keys_;
37 std::vector<int> deleted_values_;
40 CacheTest() : cache_(NewLRUCache(kCacheSize)) {
49 Cache::Handle* handle = cache_->Lookup(EncodeKey(key));
50 const int r = (handle == NULL) ? -1 : DecodeValue(cache_->Value(handle));
52 cache_->Release(handle);
57 void Insert(int key, int value, int charge = 1) {
58 cache_->Release(cache_->Insert(EncodeKey(key), EncodeValue(value), charge,
59 &CacheTest::Deleter));
63 cache_->Erase(EncodeKey(key));
66 CacheTest* CacheTest::current_;
68 TEST(CacheTest, HitAndMiss) {
69 ASSERT_EQ(-1, Lookup(100));
72 ASSERT_EQ(101, Lookup(100));
73 ASSERT_EQ(-1, Lookup(200));
74 ASSERT_EQ(-1, Lookup(300));
77 ASSERT_EQ(101, Lookup(100));
78 ASSERT_EQ(201, Lookup(200));
79 ASSERT_EQ(-1, Lookup(300));
82 ASSERT_EQ(102, Lookup(100));
83 ASSERT_EQ(201, Lookup(200));
84 ASSERT_EQ(-1, Lookup(300));
86 ASSERT_EQ(1, deleted_keys_.size());
87 ASSERT_EQ(100, deleted_keys_[0]);
88 ASSERT_EQ(101, deleted_values_[0]);
91 TEST(CacheTest, Erase) {
93 ASSERT_EQ(0, deleted_keys_.size());
98 ASSERT_EQ(-1, Lookup(100));
99 ASSERT_EQ(201, Lookup(200));
100 ASSERT_EQ(1, deleted_keys_.size());
101 ASSERT_EQ(100, deleted_keys_[0]);
102 ASSERT_EQ(101, deleted_values_[0]);
105 ASSERT_EQ(-1, Lookup(100));
106 ASSERT_EQ(201, Lookup(200));
107 ASSERT_EQ(1, deleted_keys_.size());
110 TEST(CacheTest, EntriesArePinned) {
112 Cache::Handle* h1 = cache_->Lookup(EncodeKey(100));
113 ASSERT_EQ(101, DecodeValue(cache_->Value(h1)));
116 Cache::Handle* h2 = cache_->Lookup(EncodeKey(100));
117 ASSERT_EQ(102, DecodeValue(cache_->Value(h2)));
118 ASSERT_EQ(0, deleted_keys_.size());
121 ASSERT_EQ(1, deleted_keys_.size());
122 ASSERT_EQ(100, deleted_keys_[0]);
123 ASSERT_EQ(101, deleted_values_[0]);
126 ASSERT_EQ(-1, Lookup(100));
127 ASSERT_EQ(1, deleted_keys_.size());
130 ASSERT_EQ(2, deleted_keys_.size());
131 ASSERT_EQ(100, deleted_keys_[1]);
132 ASSERT_EQ(102, deleted_values_[1]);
135 TEST(CacheTest, EvictionPolicy) {
139 // Frequently used entry must be kept around
140 for (int i = 0; i < kCacheSize + 100; i++) {
141 Insert(1000+i, 2000+i);
142 ASSERT_EQ(2000+i, Lookup(1000+i));
143 ASSERT_EQ(101, Lookup(100));
145 ASSERT_EQ(101, Lookup(100));
146 ASSERT_EQ(-1, Lookup(200));
149 TEST(CacheTest, HeavyEntries) {
150 // Add a bunch of light and heavy entries and then count the combined
151 // size of items still in the cache, which must be approximately the
152 // same as the total capacity.
153 const int kLight = 1;
154 const int kHeavy = 10;
157 while (added < 2*kCacheSize) {
158 const int weight = (index & 1) ? kLight : kHeavy;
159 Insert(index, 1000+index, weight);
164 int cached_weight = 0;
165 for (int i = 0; i < index; i++) {
166 const int weight = (i & 1 ? kLight : kHeavy);
169 cached_weight += weight;
170 ASSERT_EQ(1000+i, r);
173 ASSERT_LE(cached_weight, kCacheSize + kCacheSize/10);
176 TEST(CacheTest, NewId) {
177 uint64_t a = cache_->NewId();
178 uint64_t b = cache_->NewId();
182 } // namespace leveldb
184 int main(int argc, char** argv) {
185 return leveldb::test::RunAllTests();