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
|
// Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/datastore/fixed_size_hash_map.h>
#include <vespa/vespalib/datastore/unique_store_allocator.h>
#include <vespa/vespalib/datastore/unique_store_comparator.h>
#include <vespa/vespalib/stllike/hash_map.h>
#include <vespa/vespalib/util/lambdatask.h>
#include <vespa/vespalib/util/rand48.h>
#include <vespa/vespalib/util/size_literals.h>
#include <vespa/vespalib/util/threadstackexecutor.h>
#include <vespa/vespalib/gtest/gtest.h>
#include <vespa/vespalib/datastore/unique_store_allocator.hpp>
#include <vespa/vespalib/stllike/hash_map.hpp>
#include <vespa/log/log.h>
LOG_SETUP("vespalib_fixed_size_hash_map_test");
using vespalib::datastore::EntryRef;
using RefT = vespalib::datastore::EntryRefT<22>;
using MyAllocator = vespalib::datastore::UniqueStoreAllocator<uint32_t, RefT>;
using MyDataStore = vespalib::datastore::DataStoreT<RefT>;
using MyCompare = vespalib::datastore::UniqueStoreComparator<uint32_t, RefT>;
using GenerationHandler = vespalib::GenerationHandler;
using vespalib::makeLambdaTask;
using vespalib::GenerationHolder;
using vespalib::datastore::FixedSizeHashMap;
class FixedSizeHashMapHeld : public vespalib::GenerationHeldBase
{
std::unique_ptr<const FixedSizeHashMap> _data;
public:
FixedSizeHashMapHeld(size_t size, std::unique_ptr<const FixedSizeHashMap> data);
~FixedSizeHashMapHeld();
};
FixedSizeHashMapHeld::FixedSizeHashMapHeld(size_t size, std::unique_ptr<const FixedSizeHashMap> data)
: GenerationHeldBase(size),
_data(std::move(data))
{
}
FixedSizeHashMapHeld::~FixedSizeHashMapHeld() = default;
struct DataStoreFixedSizeHashTest : public ::testing::Test
{
GenerationHandler _generation_handler;
GenerationHolder _generation_holder;
MyAllocator _allocator;
MyDataStore& _store;
std::unique_ptr<const vespalib::datastore::EntryComparator> _comp;
std::unique_ptr<FixedSizeHashMap> _hash_map;
vespalib::Rand48 _rnd;
DataStoreFixedSizeHashTest();
~DataStoreFixedSizeHashTest();
void commit();
size_t size() const noexcept;
void insert(uint32_t key);
void remove(uint32_t key);
bool has_key(uint32_t key);
void use_single_hash_chain();
void read_work(uint32_t cnt);
void read_work();
void write_work(uint32_t cnt);
};
DataStoreFixedSizeHashTest::DataStoreFixedSizeHashTest()
: _generation_handler(),
_generation_holder(),
_allocator(),
_store(_allocator.get_data_store()),
_comp(std::make_unique<MyCompare>(_store)),
_hash_map(),
_rnd()
{
_rnd.srand48(32);
_hash_map = std::make_unique<FixedSizeHashMap>(20, 40, 1);
}
DataStoreFixedSizeHashTest::~DataStoreFixedSizeHashTest()
{
commit();
}
void
DataStoreFixedSizeHashTest::commit()
{
_store.transferHoldLists(_generation_handler.getCurrentGeneration());
_hash_map->transfer_hold_lists(_generation_handler.getCurrentGeneration());
_generation_holder.transferHoldLists(_generation_handler.getCurrentGeneration());
_generation_handler.incGeneration();
_store.trimHoldLists(_generation_handler.getFirstUsedGeneration());
_hash_map->trim_hold_lists(_generation_handler.getFirstUsedGeneration());
_generation_holder.trimHoldLists(_generation_handler.getFirstUsedGeneration());
}
size_t
DataStoreFixedSizeHashTest::size() const noexcept
{
return _hash_map->size();
}
void
DataStoreFixedSizeHashTest::insert(uint32_t key)
{
MyCompare comp(_store, key);
std::function<EntryRef(void)> insert_entry([this, key]() -> EntryRef { return _allocator.allocate(key); });
auto& result = _hash_map->add(comp, insert_entry);
auto ref = result.first.load_relaxed();
auto &wrapped_entry = _allocator.get_wrapped(ref);
EXPECT_EQ(key, wrapped_entry.value());
}
void
DataStoreFixedSizeHashTest::remove(uint32_t key)
{
MyCompare comp(_store, key);
auto result = _hash_map->remove(comp, EntryRef());
if (result != nullptr) {
auto ref = result->first.load_relaxed();
auto &wrapped_entry = _allocator.get_wrapped(ref);
EXPECT_EQ(key, wrapped_entry.value());
_allocator.hold(ref);
}
}
bool
DataStoreFixedSizeHashTest::has_key(uint32_t key)
{
MyCompare comp(_store, key);
auto result = _hash_map->find(comp, EntryRef());
if (result != nullptr) {
auto ref = result->first.load_relaxed();
auto& wrapped_entry = _allocator.get_wrapped(ref);
EXPECT_EQ(key, wrapped_entry.value());
return true;
}
return false;
}
void
DataStoreFixedSizeHashTest::use_single_hash_chain()
{
_hash_map = std::make_unique<FixedSizeHashMap>(1, 40, 1);
}
TEST_F(DataStoreFixedSizeHashTest, smoke_test)
{
EXPECT_EQ(0, size());
insert(1);
EXPECT_EQ(1, size());
remove(2);
EXPECT_EQ(1, size());
insert(1);
EXPECT_EQ(1, size());
insert(5);
EXPECT_EQ(2, size());
insert(4);
EXPECT_EQ(3, size());
remove(3);
EXPECT_EQ(3, size());
remove(5);
EXPECT_EQ(2, size());
commit();
EXPECT_FALSE(has_key(3));
EXPECT_TRUE(has_key(4));
}
TEST_F(DataStoreFixedSizeHashTest, lookups_works_after_insert_and_remove)
{
use_single_hash_chain();
vespalib::hash_map<uint32_t, bool> expected;
vespalib::Rand48 &rnd(_rnd);
for (uint32_t i = 0; i < 40; ++i) {
uint32_t key = rnd.lrand48() % 10;
if ((rnd.lrand48() & 1) == 0) {
insert(key);
expected[key] = true;
} else {
remove(key);
expected[key] = false;
}
commit();
}
for (auto &kv : expected) {
MyCompare comp(_store, kv.first);
EXPECT_EQ(kv.second, _hash_map->find(comp, EntryRef()) != nullptr);
}
}
GTEST_MAIN_RUN_ALL_TESTS()
|
