+// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
/*
* Ceph - scalable distributed file system
*
}
// loop through all possible loss scenarios
- bool err = true;
int cnt_cf = 0;
for (int l1 = 0; l1 < (k + m); l1++) {
map<int, bufferlist> degraded = encoded;
set<int> want_to_decode;
+ bool err = true;
degraded.erase(l1);
want_to_decode.insert(l1);
err = DecodeAndVerify(Isa, degraded, want_to_decode, enc, length);
}
// loop through all possible loss scenarios
- bool err = true;
int cnt_cf = 0;
for (int l1 = 0; l1 < (k + m); l1++) {
map<int, bufferlist> degraded = encoded;
set<int> want_to_decode;
+ bool err = true;
degraded.erase(l1);
want_to_decode.insert(l1);
err = DecodeAndVerify(Isa, degraded, want_to_decode, enc, length);
}
// loop through all possible loss scenarios
- bool err = true;
int cnt_cf = 0;
for (int l1 = 0; l1 < (k + m); l1++) {
map<int, bufferlist> degraded = encoded;
set<int> want_to_decode;
+ bool err = true;
degraded.erase(l1);
want_to_decode.insert(l1);
err = DecodeAndVerify(Isa, degraded, want_to_decode, enc, length);
}
// loop through all possible loss scenarios
- bool err = true;
int cnt_cf = 0;
for (int l1 = 0; l1 < (k + m); l1++) {
map<int, bufferlist> degraded = encoded;
set<int> want_to_decode;
+ bool err = true;
degraded.erase(l1);
want_to_decode.insert(l1);
err = DecodeAndVerify(Isa, degraded, want_to_decode, enc, length);