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
|
// SPDX-License-Identifier: BSD-3-Clause
/* Copyright 2018-2020, Intel Corporation */
#include "unittest.hpp"
#include <algorithm>
#include <iterator>
#include <libpmemobj++/container/array.hpp>
#include <libpmemobj++/make_persistent.hpp>
#include <libpmemobj++/pool.hpp>
#include <libpmemobj++/transaction.hpp>
struct TestSort {
#ifdef NO_GCC_AGGREGATE_INITIALIZATION_BUG
pmem::obj::array<double, 10> c = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
#else
pmem::obj::array<double, 10> c = {{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}};
#endif
void
sort_single_element_snapshot()
{
std::sort(c.begin(), c.end());
pmem::obj::array<double, 10> expected = {1, 2, 3, 4, 5,
6, 7, 8, 9, 10};
UT_ASSERT(c == expected);
}
void
sort_range_snapshot()
{
auto slice = c.range(0, c.size(), 2);
std::sort(slice.begin(), slice.end());
pmem::obj::array<double, 10> expected = {1, 2, 3, 4, 5,
6, 7, 8, 9, 10};
UT_ASSERT(c == expected);
}
};
struct root {
pmem::obj::persistent_ptr<TestSort> test_sort;
};
void
test_sort_single_element(pmem::obj::pool<struct root> &pop)
{
auto r = pop.root();
try {
pmem::obj::transaction::run(pop, [&] {
r->test_sort = pmem::obj::make_persistent<TestSort>();
});
} catch (...) {
UT_ASSERT(0);
}
try {
pmem::obj::transaction::run(pop, [&] {
r->test_sort->sort_single_element_snapshot();
pmem::obj::transaction::abort(0);
UT_ASSERT(0);
});
} catch (pmem::manual_tx_abort &) {
pmem::obj::array<double, 10> expected = {10, 9, 8, 7, 6,
5, 4, 3, 2, 1};
UT_ASSERT(r->test_sort->c == expected);
} catch (...) {
UT_ASSERT(0);
}
try {
pmem::obj::transaction::run(pop, [&] {
pmem::obj::delete_persistent<TestSort>(r->test_sort);
});
} catch (...) {
UT_ASSERT(0);
}
}
void
test_sort_range(pmem::obj::pool<struct root> &pop)
{
auto r = pop.root();
try {
pmem::obj::transaction::run(pop, [&] {
r->test_sort = pmem::obj::make_persistent<TestSort>();
});
} catch (...) {
UT_ASSERT(0);
}
try {
pmem::obj::transaction::run(pop, [&] {
r->test_sort->sort_range_snapshot();
pmem::obj::transaction::abort(0);
UT_ASSERT(0);
});
} catch (pmem::manual_tx_abort &) {
pmem::obj::array<double, 10> expected = {10, 9, 8, 7, 6,
5, 4, 3, 2, 1};
UT_ASSERT(r->test_sort->c == expected);
} catch (...) {
UT_ASSERT(0);
}
try {
pmem::obj::transaction::run(pop, [&] {
pmem::obj::delete_persistent<TestSort>(r->test_sort);
});
} catch (...) {
UT_ASSERT(0);
}
}
static void
test(int argc, char *argv[])
{
if (argc < 2) {
UT_FATAL("usage: %s file-name", argv[0]);
}
auto path = argv[1];
auto pop = pmem::obj::pool<root>::create(
path, "ArrayTest", PMEMOBJ_MIN_POOL, S_IWUSR | S_IRUSR);
test_sort_single_element(pop);
test_sort_range(pop);
pop.close();
}
int
main(int argc, char *argv[])
{
return run_test([&] { test(argc, argv); });
}
|
