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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Copyright 2019-2020, Intel Corporation
//
// Modified to test pmem::obj containers
//
#include "list_wrapper.hpp"
#include "unittest.hpp"
#include <libpmemobj++/container/vector.hpp>
#include <libpmemobj++/make_persistent.hpp>
#include <iterator>
namespace nvobj = pmem::obj;
struct Throws;
using C = container_t<int>;
using C2 = container_t<Throws>;
using std::distance;
using std::next;
struct root {
nvobj::persistent_ptr<C> l1;
nvobj::persistent_ptr<C2> v;
};
struct Throws {
Throws() : v_(0)
{
}
Throws(int v) : v_(v)
{
}
Throws(const Throws &rhs) : v_(rhs.v_)
{
if (sThrows)
throw 1;
}
Throws(Throws &&rhs) : v_(rhs.v_)
{
if (sThrows)
throw 1;
}
Throws &
operator=(const Throws &rhs)
{
v_ = rhs.v_;
return *this;
}
Throws &
operator=(Throws &&rhs)
{
v_ = rhs.v_;
return *this;
}
int v_;
static bool sThrows;
};
bool Throws::sThrows = false;
static void
test(int argc, char *argv[])
{
if (argc < 2) {
UT_FATAL("usage: %s file-name", argv[0]);
}
auto path = argv[1];
auto pop = nvobj::pool<root>::create(path, "VectorTest: erase_iter",
PMEMOBJ_MIN_POOL * 2,
S_IWUSR | S_IRUSR);
auto r = pop.root();
{
int a1[] = {1, 2, 3};
try {
nvobj::transaction::run(pop, [&] {
r->l1 = nvobj::make_persistent<C>(a1, a1 + 3);
});
C::const_iterator i = r->l1->begin();
++i;
C::iterator j = r->l1->erase(i);
UT_ASSERT(r->l1->size() == 2);
UT_ASSERT(distance(r->l1->begin(), r->l1->end()) == 2);
UT_ASSERT(*j == 3);
UT_ASSERT(*r->l1->begin() == 1);
UT_ASSERT(*std::next(r->l1->begin()) == 3);
j = r->l1->erase(j);
UT_ASSERT(j == r->l1->end());
UT_ASSERT(r->l1->size() == 1);
UT_ASSERT(distance(r->l1->begin(), r->l1->end()) == 1);
UT_ASSERT(*r->l1->begin() == 1);
j = r->l1->erase(r->l1->begin());
UT_ASSERT(j == r->l1->end());
UT_ASSERT(r->l1->size() == 0);
UT_ASSERT(distance(r->l1->begin(), r->l1->end()) == 0);
nvobj::transaction::run(pop, [&] {
nvobj::delete_persistent<C>(r->l1);
});
} catch (std::exception &e) {
UT_FATALexc(e);
}
}
{
Throws arr[] = {1, 2, 3};
try {
nvobj::transaction::run(pop, [&] {
r->v = nvobj::make_persistent<C2>(arr, arr + 3);
});
Throws::sThrows = true;
r->v->erase(r->v->begin());
r->v->erase(--r->v->end());
r->v->erase(r->v->begin());
UT_ASSERT(r->v->size() == 0);
nvobj::transaction::run(pop, [&] {
nvobj::delete_persistent<C2>(r->v);
});
} catch (std::exception &e) {
UT_FATALexc(e);
}
}
pop.close();
}
int
main(int argc, char *argv[])
{
return run_test([&] { test(argc, argv); });
}
|
