diff --git a/Src/Core/FFmmAlgorithmThread.hpp b/Src/Core/FFmmAlgorithmThread.hpp
index 6d95f55ef836da75a1e91afe692bfedbfa3694b1..3d2b0e0c7fe15822a55bf8aba00fd2ed7868f1f1 100644
--- a/Src/Core/FFmmAlgorithmThread.hpp
+++ b/Src/Core/FFmmAlgorithmThread.hpp
@@ -90,6 +90,9 @@ public:
 
         FAbstractAlgorithm::setNbLevelsInTree(tree->getHeight());
 
+        for(int idxShape = 0 ; idxShape < SizeShape ; ++idxShape){
+            this->shapeLeaf[idxShape] = 0;
+        }
         FLOG(FLog::Controller << "FFmmAlgorithmThread (Max Thread " << omp_get_max_threads() << ")\n");
         FLOG(FLog::Controller << "\t static schedule " << (userChunkSize == -1 ? "static" : (userChunkSize == 0 ? "N/p^2" : std::to_string(userChunkSize))) << ")\n");
     }
diff --git a/Src/Kernels/Interpolation/FInterpSymmetries.hpp b/Src/Kernels/Interpolation/FInterpSymmetries.hpp
index f1d76b100455d465f53def93cff6afc0bd750859..3138664e28c531b0d9488ca3f79f9b01156dcb11 100644
--- a/Src/Kernels/Interpolation/FInterpSymmetries.hpp
+++ b/Src/Kernels/Interpolation/FInterpSymmetries.hpp
@@ -47,8 +47,9 @@ class FInterpSymmetries
 		unsigned int cones[8][nnodes];
 
 		// set quads and cones permutations
-		unsigned int evn[ORDER]; unsigned int odd[ORDER];
-		for (unsigned int o=0; o<ORDER; ++o) {evn[o] = o;	odd[o] = ORDER-1 - o;}
+		unsigned int evn[ORDER], odd[ORDER];
+		for (unsigned int o=0; o<ORDER; ++o)
+		  {evn[o] = o;	odd[o] = ORDER-1 - o;}
 
 		for (unsigned int i=0; i<ORDER; ++i) {
 			for (unsigned int j=0; j<ORDER; ++j) {
diff --git a/Src/Kernels/Uniform/FUnifM2LHandler.hpp b/Src/Kernels/Uniform/FUnifM2LHandler.hpp
index 0b81ab5d6637f4647c8d3cff64aa1b3f3cf54fd2..23a8956cb160c1124517c68c3e2a1f11b2e62a70 100644
--- a/Src/Kernels/Uniform/FUnifM2LHandler.hpp
+++ b/Src/Kernels/Uniform/FUnifM2LHandler.hpp
@@ -40,7 +40,7 @@ static void Compute(const MatrixKernelClass *const MatrixKernel, const FReal Cel
     TensorType::setRoots(FPoint<FReal>(0.,0.,0.), CellWidth, X);
 
     // allocate memory and compute 316 m2l operators (342 if separation equals 0, 343 if separation equals -1)
-    FReal    *_C;
+    FReal           *_C;
     FComplex<FReal> *_FC;
 
     // reduce storage from nnodes^2=order^6 to (2order-1)^3