set<int> avail;
for ([[maybe_unused]] auto& [node, bl] : chunks) {
avail.insert(node);
+ (void)bl; // silence -Wunused-variable
}
if (is_repair(want_to_read, avail) &&
// check across all erasures and aloof nodes
for ([[maybe_unused]] auto& [node, bl] : recovered_data) {
if (node % q == z_vec[node / q]) order++;
+ (void)bl; // silence -Wunused-variable
}
for (auto node : aloof_nodes) {
if (node % q == z_vec[node / q]) order++;
for ([[maybe_unused]] auto& [node, bl] : recovered_data) {
lost_chunk = node;
count++;
+ (void)bl; // silence -Wunused-variable
}
ceph_assert(count == 1);
for (int i = k+nu; (num_erasures < m) && (i < q*t); i++) {
if ([[maybe_unused]] auto [it, added] = erased_chunks.emplace(i); added) {
num_erasures++;
+ (void)it; // silence -Wunused-variable
}
}
ceph_assert(num_erasures == m);