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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab ft=cpp
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2020 Red Hat, Inc
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*/
#include "rgw_bucket_sync_cache.h"
#include <gtest/gtest.h>
using namespace rgw::bucket_sync;
// helper function to construct rgw_bucket_shard
static rgw_bucket_shard make_key(const std::string& tenant,
const std::string& bucket, int shard)
{
auto key = rgw_bucket_key{tenant, bucket};
return rgw_bucket_shard{std::move(key), shard};
}
TEST(BucketSyncCache, ReturnCachedPinned)
{
auto cache = Cache::create(0);
const auto key = make_key("", "1", 0);
auto h1 = cache->get(key, std::nullopt); // pin
h1->counter = 1;
auto h2 = cache->get(key, std::nullopt);
EXPECT_EQ(1, h2->counter);
}
TEST(BucketSyncCache, ReturnNewUnpinned)
{
auto cache = Cache::create(0);
const auto key = make_key("", "1", 0);
cache->get(key, std::nullopt)->counter = 1; // pin+unpin
EXPECT_EQ(0, cache->get(key, std::nullopt)->counter);
}
TEST(BucketSyncCache, DistinctTenant)
{
auto cache = Cache::create(2);
const auto key1 = make_key("a", "bucket", 0);
const auto key2 = make_key("b", "bucket", 0);
cache->get(key1, std::nullopt)->counter = 1;
EXPECT_EQ(0, cache->get(key2, std::nullopt)->counter);
}
TEST(BucketSyncCache, DistinctShards)
{
auto cache = Cache::create(2);
const auto key1 = make_key("", "bucket", 0);
const auto key2 = make_key("", "bucket", 1);
cache->get(key1, std::nullopt)->counter = 1;
EXPECT_EQ(0, cache->get(key2, std::nullopt)->counter);
}
TEST(BucketSyncCache, DistinctGen)
{
auto cache = Cache::create(2);
const auto key = make_key("", "bucket", 0);
std::optional<uint64_t> gen1; // empty
std::optional<uint64_t> gen2 = 5;
cache->get(key, gen1)->counter = 1;
EXPECT_EQ(0, cache->get(key, gen2)->counter);
}
TEST(BucketSyncCache, DontEvictPinned)
{
auto cache = Cache::create(0);
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
auto h1 = cache->get(key1, std::nullopt);
EXPECT_EQ(key1, h1->key.first);
auto h2 = cache->get(key2, std::nullopt);
EXPECT_EQ(key2, h2->key.first);
EXPECT_EQ(key1, h1->key.first); // h1 unchanged
}
TEST(BucketSyncCache, HandleLifetime)
{
const auto key = make_key("", "1", 0);
Handle h; // test that handles keep the cache referenced
{
auto cache = Cache::create(0);
h = cache->get(key, std::nullopt);
}
EXPECT_EQ(key, h->key.first);
}
TEST(BucketSyncCache, TargetSize)
{
auto cache = Cache::create(2);
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
const auto key3 = make_key("", "3", 0);
// fill cache up to target_size=2
cache->get(key1, std::nullopt)->counter = 1;
cache->get(key2, std::nullopt)->counter = 2;
// test that each unpinned entry is still cached
EXPECT_EQ(1, cache->get(key1, std::nullopt)->counter);
EXPECT_EQ(2, cache->get(key2, std::nullopt)->counter);
// overflow the cache and recycle key1
cache->get(key3, std::nullopt)->counter = 3;
// test that the oldest entry was recycled
EXPECT_EQ(0, cache->get(key1, std::nullopt)->counter);
}
TEST(BucketSyncCache, HandleMoveAssignEmpty)
{
auto cache = Cache::create(0);
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
Handle j1;
{
auto h1 = cache->get(key1, std::nullopt);
j1 = std::move(h1); // assign over empty handle
EXPECT_EQ(key1, j1->key.first);
}
auto h2 = cache->get(key2, std::nullopt);
EXPECT_EQ(key1, j1->key.first); // j1 stays pinned
}
TEST(BucketSyncCache, HandleMoveAssignExisting)
{
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
Handle h1;
{
auto cache1 = Cache::create(0);
h1 = cache1->get(key1, std::nullopt);
} // j1 has the last ref to cache1
{
auto cache2 = Cache::create(0);
auto h2 = cache2->get(key2, std::nullopt);
h1 = std::move(h2); // assign over existing handle
}
EXPECT_EQ(key2, h1->key.first);
}
TEST(BucketSyncCache, HandleCopyAssignEmpty)
{
auto cache = Cache::create(0);
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
Handle j1;
{
auto h1 = cache->get(key1, std::nullopt);
j1 = h1; // assign over empty handle
EXPECT_EQ(&*h1, &*j1);
}
auto h2 = cache->get(key2, std::nullopt);
EXPECT_EQ(key1, j1->key.first); // j1 stays pinned
}
TEST(BucketSyncCache, HandleCopyAssignExisting)
{
const auto key1 = make_key("", "1", 0);
const auto key2 = make_key("", "2", 0);
Handle h1;
{
auto cache1 = Cache::create(0);
h1 = cache1->get(key1, std::nullopt);
} // j1 has the last ref to cache1
{
auto cache2 = Cache::create(0);
auto h2 = cache2->get(key2, std::nullopt);
h1 = h2; // assign over existing handle
EXPECT_EQ(&*h1, &*h2);
}
EXPECT_EQ(key2, h1->key.first);
}
|
