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
|
// SPDX-License-Identifier: BSD-3-Clause
/* Copyright 2018-2020, Intel Corporation */
/*
* concurrent_hash_map_rehash_check.cpp -- pmem::obj::concurrent_hash_map test
*
*/
#include "unittest.hpp"
#include <libpmemobj++/make_persistent.hpp>
#include <libpmemobj++/make_persistent_atomic.hpp>
#include <libpmemobj++/p.hpp>
#include <libpmemobj++/persistent_ptr.hpp>
#include <libpmemobj++/pool.hpp>
#include <iterator>
#include <thread>
#include <vector>
#include <libpmemobj++/container/concurrent_hash_map.hpp>
#define LAYOUT "concurrent_hash_map"
namespace nvobj = pmem::obj;
namespace
{
typedef nvobj::concurrent_hash_map<nvobj::p<int>, nvobj::p<int>>
persistent_map_type;
struct root {
nvobj::persistent_ptr<persistent_map_type> cons;
};
static constexpr size_t CONCURRENCY = 4;
void
check_elements(nvobj::pool<root> &pop, size_t number_items_insert)
{
auto map = pop.root()->cons;
for (int i = 0; i < static_cast<int>(number_items_insert); ++i) {
UT_ASSERTeq(map->count(i), 1);
persistent_map_type::accessor acc;
UT_ASSERTeq(map->find(acc, i), true);
UT_ASSERTeq(acc->first, i);
UT_ASSERTeq(acc->second, i);
}
}
void
run_inserts(nvobj::pool<root> &pop, size_t from, size_t number_items_insert)
{
std::vector<std::thread> threads;
threads.reserve(CONCURRENCY);
auto map = pop.root()->cons;
for (size_t i = 0; i < CONCURRENCY; ++i) {
threads.emplace_back([&]() {
for (int i = static_cast<int>(from);
i < static_cast<int>(from + number_items_insert);
++i) {
map->insert(
persistent_map_type::value_type(i, i));
}
});
}
for (auto &t : threads) {
t.join();
}
}
/*
* rehash_test -- (internal) test rehash operation and verify all elements
* are accessible.
*/
void
rehash_test(nvobj::pool<root> &pop)
{
auto map = pop.root()->cons;
UT_ASSERT(map != nullptr);
map->runtime_initialize();
run_inserts(pop, 0, 100);
map->rehash(1024);
check_elements(pop, 100);
run_inserts(pop, 100, 2048);
map->rehash(1024 * (1 << 1));
check_elements(pop, 2148);
run_inserts(pop, 2148, 100);
map->rehash(1024 * (1 << 3));
check_elements(pop, 2248);
}
}
static void
test(int argc, char *argv[])
{
if (argc < 2) {
UT_FATAL("usage: %s file-name", argv[0]);
}
const char *path = argv[1];
nvobj::pool<root> pop;
try {
pop = nvobj::pool<root>::create(
path, LAYOUT, PMEMOBJ_MIN_POOL * 20, S_IWUSR | S_IRUSR);
pmem::obj::transaction::run(pop, [&] {
pop.root()->cons =
nvobj::make_persistent<persistent_map_type>();
});
} catch (pmem::pool_error &pe) {
UT_FATAL("!pool::create: %s %s", pe.what(), path);
}
rehash_test(pop);
pop.close();
}
int
main(int argc, char *argv[])
{
return run_test([&] { test(argc, argv); });
}
|
