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
|
// -*- 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) 2013 Cloudwatt <libre.licensing@cloudwatt.com>
*
* Author: Loic Dachary <loic@dachary.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
*/
#include "global/global_init.h"
#include "ErasureCodeExample.h"
#include "common/ceph_argparse.h"
#include "global/global_context.h"
#include "gtest/gtest.h"
TEST(ErasureCodeExample, minimum_to_decode)
{
ErasureCodeExample example;
set<int> available_chunks;
set<int> want_to_read;
want_to_read.insert(1);
{
set<int> minimum;
EXPECT_EQ(-EIO, example.minimum_to_decode(want_to_read,
available_chunks,
&minimum));
}
available_chunks.insert(0);
available_chunks.insert(2);
{
set<int> minimum;
EXPECT_EQ(0, example.minimum_to_decode(want_to_read,
available_chunks,
&minimum));
EXPECT_EQ(available_chunks, minimum);
EXPECT_EQ(2u, minimum.size());
EXPECT_EQ(1u, minimum.count(0));
EXPECT_EQ(1u, minimum.count(2));
}
{
set<int> minimum;
available_chunks.insert(1);
EXPECT_EQ(0, example.minimum_to_decode(want_to_read,
available_chunks,
&minimum));
EXPECT_EQ(1u, minimum.size());
EXPECT_EQ(1u, minimum.count(1));
}
}
TEST(ErasureCodeExample, minimum_to_decode_with_cost)
{
ErasureCodeExample example;
map<int,int> available;
set<int> want_to_read;
want_to_read.insert(1);
{
set<int> minimum;
EXPECT_EQ(-EIO, example.minimum_to_decode_with_cost(want_to_read,
available,
&minimum));
}
available[0] = 1;
available[2] = 1;
{
set<int> minimum;
EXPECT_EQ(0, example.minimum_to_decode_with_cost(want_to_read,
available,
&minimum));
EXPECT_EQ(2u, minimum.size());
EXPECT_EQ(1u, minimum.count(0));
EXPECT_EQ(1u, minimum.count(2));
}
{
set<int> minimum;
available[1] = 1;
EXPECT_EQ(0, example.minimum_to_decode_with_cost(want_to_read,
available,
&minimum));
EXPECT_EQ(1u, minimum.size());
EXPECT_EQ(1u, minimum.count(1));
}
{
set<int> minimum;
available[1] = 2;
EXPECT_EQ(0, example.minimum_to_decode_with_cost(want_to_read,
available,
&minimum));
EXPECT_EQ(2u, minimum.size());
EXPECT_EQ(1u, minimum.count(0));
EXPECT_EQ(1u, minimum.count(2));
}
}
TEST(ErasureCodeExample, encode_decode)
{
ErasureCodeExample example;
bufferlist in;
in.append("ABCDE");
int want_to_encode[] = { 0, 1, 2 };
map<int, bufferlist> encoded;
EXPECT_EQ(0, example.encode(set<int>(want_to_encode, want_to_encode+3),
in,
&encoded));
EXPECT_EQ(3u, encoded.size());
EXPECT_EQ(3u, encoded[0].length());
EXPECT_EQ('A', encoded[0][0]);
EXPECT_EQ('B', encoded[0][1]);
EXPECT_EQ('C', encoded[0][2]);
EXPECT_EQ('D', encoded[1][0]);
EXPECT_EQ('E', encoded[1][1]);
EXPECT_EQ('A'^'D', encoded[2][0]);
EXPECT_EQ('B'^'E', encoded[2][1]);
EXPECT_EQ('C'^0, encoded[2][2]);
// all chunks are available
{
int want_to_decode[] = { 0, 1 };
map<int, bufferlist> decoded;
EXPECT_EQ(0, example.decode(set<int>(want_to_decode, want_to_decode+2),
encoded,
&decoded));
EXPECT_EQ(2u, decoded.size());
EXPECT_EQ(3u, decoded[0].length());
EXPECT_EQ('A', decoded[0][0]);
EXPECT_EQ('B', decoded[0][1]);
EXPECT_EQ('C', decoded[0][2]);
EXPECT_EQ('D', decoded[1][0]);
EXPECT_EQ('E', decoded[1][1]);
}
// one chunk is missing
{
map<int, bufferlist> degraded = encoded;
degraded.erase(0);
EXPECT_EQ(2u, degraded.size());
int want_to_decode[] = { 0, 1 };
map<int, bufferlist> decoded;
EXPECT_EQ(0, example.decode(set<int>(want_to_decode, want_to_decode+2),
degraded,
&decoded));
EXPECT_EQ(2u, decoded.size());
EXPECT_EQ(3u, decoded[0].length());
EXPECT_EQ('A', decoded[0][0]);
EXPECT_EQ('B', decoded[0][1]);
EXPECT_EQ('C', decoded[0][2]);
EXPECT_EQ('D', decoded[1][0]);
EXPECT_EQ('E', decoded[1][1]);
}
}
int main(int argc, char **argv) {
vector<const char*> args;
argv_to_vec(argc, (const char **)argv, args);
global_init(NULL, args, CEPH_ENTITY_TYPE_CLIENT, CODE_ENVIRONMENT_UTILITY, 0);
common_init_finish(g_ceph_context);
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
// Local Variables:
// compile-command: "cd ../.. ; make -j4 && make unittest_erasure_code_example && valgrind --leak-check=full --tool=memcheck ./unittest_erasure_code_example --gtest_filter=*.* --log-to-stderr=true --debug-osd=20"
// End:
|
