aboutsummaryrefslogtreecommitdiffstats
path: root/vespalib/src/tests/stllike/cache_test.cpp
blob: 9171f923ecf23189f9baf1da8bcb604f00bcf2ce (plain) (blame)
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
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.

#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/vespalib/stllike/string.h>
#include <vespa/vespalib/stllike/cache.hpp>
#include <map>

using namespace vespalib;

template<typename K, typename V>
class Map : public std::map<K, V> {
    using const_iterator = typename std::map<K, V>::const_iterator;
    using M = std::map<K, V>;
public:
    bool read(const K & k, V & v) const {
        const_iterator found = M::find(k);
        bool ok(found != this->end());
        if (ok) {
            v = found->second;
        }
        return ok;
    }
    void write(const K & k, const V & v) {
        (*this)[k] = v;
    }
    void erase(const K & k) {
        M::erase(k);
    }
};

using P = LruParam<uint32_t, string>;
using B = Map<uint32_t, string>;

TEST("testCache") {
    B m;
    cache< CacheParam<P, B> > cache(m, -1);
    // Verfify start conditions.
    EXPECT_TRUE(cache.size() == 0);
    EXPECT_TRUE( ! cache.hasKey(1) );
    cache.write(1, "First inserted string");
    EXPECT_TRUE( cache.hasKey(1) );
    m[2] = "String inserted beneath";
    EXPECT_TRUE( ! cache.hasKey(2) );
    EXPECT_EQUAL( cache.read(2), "String inserted beneath");
    EXPECT_TRUE( cache.hasKey(2) );
    cache.erase(1);
    EXPECT_TRUE( ! cache.hasKey(1) );
    EXPECT_TRUE(cache.size() == 1);
}

TEST("testCacheSize")
{
    B m;
    cache< CacheParam<P, B> > cache(m, -1);
    cache.write(1, "10 bytes string");
    EXPECT_EQUAL(80u, cache.sizeBytes());
    cache.write(1, "10 bytes string"); // Still the same size
    EXPECT_EQUAL(80u, cache.sizeBytes());
}

TEST("testCacheSizeDeep")
{
    B m;
    cache< CacheParam<P, B, zero<uint32_t>, size<string> > > cache(m, -1);
    cache.write(1, "15 bytes string");
    EXPECT_EQUAL(95u, cache.sizeBytes());
    cache.write(1, "10 bytes s");
    EXPECT_EQUAL(90u, cache.sizeBytes());
    cache.write(1, "20 bytes string ssss");
    EXPECT_EQUAL(100u, cache.sizeBytes());
}

TEST("testCacheEntriesHonoured") {
    B m;
    cache< CacheParam<P, B, zero<uint32_t>, size<string> > > cache(m, -1);
    cache.maxElements(1);
    cache.write(1, "15 bytes string");
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_EQUAL(95u, cache.sizeBytes());
    cache.write(2, "16 bytes stringg");
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_TRUE( cache.hasKey(2) );
    EXPECT_FALSE( cache.hasKey(1) );
    EXPECT_EQUAL(96u, cache.sizeBytes());
}

TEST("testCacheMaxSizeHonoured") {
    B m;
    cache< CacheParam<P, B, zero<uint32_t>, size<string> > > cache(m, 200);
    cache.write(1, "15 bytes string");
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_EQUAL(95u, cache.sizeBytes());
    cache.write(2, "16 bytes stringg");
    EXPECT_EQUAL(2u, cache.size());
    EXPECT_EQUAL(191u, cache.sizeBytes());
    cache.write(3, "17 bytes stringgg");
    EXPECT_EQUAL(3u, cache.size());
    EXPECT_EQUAL(288u, cache.sizeBytes());
    cache.write(4, "18 bytes stringggg");
    EXPECT_EQUAL(3u, cache.size());
    EXPECT_EQUAL(291u, cache.sizeBytes());
}

TEST("testThatMultipleRemoveOnOverflowIsFine") {
    B m;
    cache< CacheParam<P, B, zero<uint32_t>, size<string> > > cache(m, 2000);
    
    for (size_t j(0); j < 5; j++) {
        for (size_t i(0); cache.size() == i; i++) {
            cache.write(j*53+i, "a");
        }
    }
    EXPECT_EQUAL(25u, cache.size());
    EXPECT_EQUAL(2025u, cache.sizeBytes());
    EXPECT_FALSE( cache.hasKey(0) );
    string ls("long string aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
              "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
              "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
              "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
              "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
              "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
    string vls=ls+ls+ls+ls+ls+ls;
    cache.write(53+5, ls);
    EXPECT_EQUAL(25u, cache.size());
    EXPECT_EQUAL(2498u, cache.sizeBytes());
    EXPECT_FALSE( cache.hasKey(1) );
    cache.write(53*7+5, ls);
    EXPECT_EQUAL(19u, cache.size());
    EXPECT_EQUAL(2485u, cache.sizeBytes());
    EXPECT_FALSE( cache.hasKey(2) );
    cache.write(53*8+5, vls);
    EXPECT_EQUAL(14u, cache.size());
    EXPECT_EQUAL(4923u, cache.sizeBytes());
    cache.write(53*9+6, vls);
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_EQUAL(2924u, cache.sizeBytes());
}

class ExtendedCache : public cache< CacheParam<P, B> > {
public:
    ExtendedCache(BackingStore & b, size_t maxBytes)
        : cache<CacheParam<P, B>>(b, maxBytes),
          _insert_count(0),
          _remove_count(0)
    {}
    size_t _insert_count;
    size_t _remove_count;
private:
    void onRemove(const K &) override {
        _remove_count++;
    }

    void onInsert(const K &) override {
        _insert_count++;
    }
};

TEST("testOnInsertonRemoveCalledWhenFull") {
    B m;
    ExtendedCache cache(m, 200);
    EXPECT_EQUAL(0u, cache._insert_count);
    EXPECT_EQUAL(0u, cache._remove_count);
    cache.write(1, "15 bytes string");
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_EQUAL(80u, cache.sizeBytes());
    EXPECT_EQUAL(1u, cache._insert_count);
    EXPECT_EQUAL(0u, cache._remove_count);
    cache.write(2, "16 bytes stringg");
    EXPECT_EQUAL(2u, cache.size());
    EXPECT_EQUAL(160u, cache.sizeBytes());
    EXPECT_EQUAL(2u, cache._insert_count);
    EXPECT_EQUAL(0u, cache._remove_count);
    cache.write(3, "17 bytes stringgg");
    EXPECT_EQUAL(3u, cache.size());
    EXPECT_EQUAL(240u, cache.sizeBytes());
    EXPECT_EQUAL(3u, cache._insert_count);
    EXPECT_EQUAL(0u, cache._remove_count);
    EXPECT_TRUE(cache.hasKey(1));
    cache.write(4, "18 bytes stringggg");
    EXPECT_EQUAL(3u, cache.size());
    EXPECT_EQUAL(240u, cache.sizeBytes());
    EXPECT_EQUAL(4u, cache._insert_count);
    EXPECT_EQUAL(1u, cache._remove_count);
    EXPECT_FALSE(cache.hasKey(1));
    cache.invalidate(2);
    EXPECT_EQUAL(2u, cache.size());
    EXPECT_EQUAL(160u, cache.sizeBytes());
    EXPECT_EQUAL(4u, cache._insert_count);
    EXPECT_EQUAL(2u, cache._remove_count);
    EXPECT_FALSE(cache.hasKey(2));
    cache.invalidate(3);
    EXPECT_EQUAL(1u, cache.size());
    EXPECT_EQUAL(80u, cache.sizeBytes());
    EXPECT_EQUAL(4u, cache._insert_count);
    EXPECT_EQUAL(3u, cache._remove_count);
    EXPECT_FALSE(cache.hasKey(3));
}

TEST_MAIN() { TEST_RUN_ALL(); }