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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2016 Red Hat
*
* 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 <gtest/gtest.h>
#include "osd/PGTransaction.h"
using namespace std;
TEST(pgtransaction, simple)
{
hobject_t h;
PGTransaction t;
ASSERT_TRUE(t.empty());
t.nop(h);
ASSERT_FALSE(t.empty());
unsigned num = 0;
t.safe_create_traverse(
[&](const pair<const hobject_t, PGTransaction::ObjectOperation> &p) {
ASSERT_EQ(p.first, h);
using T = PGTransaction::ObjectOperation::Init;
ASSERT_TRUE(boost::get<T::None>(&p.second.init_type));
++num;
});
ASSERT_EQ(num, 1u);
}
TEST(pgtransaction, clone_safe_create_traverse)
{
hobject_t h, h2;
h2.snap = 1;
PGTransaction t;
ASSERT_TRUE(t.empty());
t.nop(h2);
ASSERT_FALSE(t.empty());
t.clone(h, h2);
unsigned num = 0;
t.safe_create_traverse(
[&](const pair<const hobject_t, PGTransaction::ObjectOperation> &p) {
using T = PGTransaction::ObjectOperation::Init;
if (num == 0) {
ASSERT_EQ(p.first, h);
ASSERT_TRUE(boost::get<T::Clone>(&p.second.init_type));
ASSERT_EQ(
boost::get<T::Clone>(&p.second.init_type)->source,
h2);
} else if (num == 1) {
ASSERT_EQ(p.first, h2);
ASSERT_TRUE(boost::get<T::None>(&p.second.init_type));
} else {
ASSERT_LT(num, 2u);
}
++num;
});
}
TEST(pgtransaction, clone_safe_create_traverse2)
{
hobject_t h, h2, h3;
h.snap = 10;
h2.snap = 5;
h3.snap = 3;
PGTransaction t;
ASSERT_TRUE(t.empty());
t.nop(h3);
ASSERT_FALSE(t.empty());
t.clone(h, h2);
t.remove(h2);
t.clone(h2, h3);
unsigned num = 0;
t.safe_create_traverse(
[&](const pair<const hobject_t, PGTransaction::ObjectOperation> &p) {
using T = PGTransaction::ObjectOperation::Init;
if (num == 0) {
ASSERT_EQ(p.first, h);
ASSERT_TRUE(boost::get<T::Clone>(&p.second.init_type));
ASSERT_EQ(
boost::get<T::Clone>(&p.second.init_type)->source,
h2);
} else if (num == 1) {
ASSERT_EQ(p.first, h2);
ASSERT_TRUE(boost::get<T::Clone>(&p.second.init_type));
ASSERT_EQ(
boost::get<T::Clone>(&p.second.init_type)->source,
h3);
} else if (num == 2) {
ASSERT_EQ(p.first, h3);
ASSERT_TRUE(boost::get<T::None>(&p.second.init_type));
} else {
ASSERT_LT(num, 3u);
}
++num;
});
}
TEST(pgtransaction, clone_safe_create_traverse3)
{
hobject_t h, h2, h3;
h.snap = 10;
h2.snap = 5;
h3.snap = 3;
PGTransaction t;
t.remove(h);
t.remove(h2);
t.clone(h2, h3);
unsigned num = 0;
t.safe_create_traverse(
[&](const pair<const hobject_t, PGTransaction::ObjectOperation> &p) {
using T = PGTransaction::ObjectOperation::Init;
if (p.first == h) {
ASSERT_TRUE(p.second.is_delete());
} else if (p.first == h2) {
ASSERT_TRUE(boost::get<T::Clone>(&p.second.init_type));
ASSERT_EQ(
boost::get<T::Clone>(&p.second.init_type)->source,
h3);
}
ASSERT_LT(num, 2u);
++num;
});
}
|
