From 54aa23a699ed7fe1b7dbf42b39136184eae50dd4 Mon Sep 17 00:00:00 2001 From: Danny Al-Gaaf Date: Thu, 5 Mar 2015 06:15:26 +0100 Subject: [PATCH] ErasureCodeShec::minimum_to_decode: reduce scope of variables Signed-off-by: Danny Al-Gaaf --- src/erasure-code/shec/ErasureCodeShec.cc | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/erasure-code/shec/ErasureCodeShec.cc b/src/erasure-code/shec/ErasureCodeShec.cc index 2ad82ec0e29..6f2c1945329 100644 --- a/src/erasure-code/shec/ErasureCodeShec.cc +++ b/src/erasure-code/shec/ErasureCodeShec.cc @@ -86,11 +86,6 @@ int ErasureCodeShec::minimum_to_decode(const set &want_to_decode, const set &available_chunks, set *minimum_chunks) { - int erased[k + m]; - int avails[k + m]; - int minimum[k + m]; - int dm_ids[k]; - if (!minimum_chunks) return -EINVAL; for (set::iterator it = available_chunks.begin(); it != available_chunks.end(); ++it){ @@ -101,6 +96,11 @@ int ErasureCodeShec::minimum_to_decode(const set &want_to_decode, want_to_decode.begin(), want_to_decode.end())) { *minimum_chunks = want_to_decode; } else { + int erased[k + m]; + int avails[k + m]; + int minimum[k + m]; + int dm_ids[k]; + for (int i = 0; i < k + m; i++) { erased[i] = 0; if (available_chunks.find(i) == available_chunks.end()) { -- 2.47.3