ARRAY_OFFSET needed

src/maths/sparse/spFactor.c

@@ -1845,7 +1845,7 @@ register  int  I, Size = Matrix->Size;
 register  ElementPtr  pElement;
 int  NumberOfTies = 0;
 long  Product, MinMarkowitzProduct;
-ElementPtr  ChosenPivot, pLargestElement;
+ElementPtr  ChosenPivot, pLargestElement = NULL;
 RealNumber  Magnitude, LargestElementMag, Ratio, RatioOfAccepted = 0, LargestInCol;
 RealNumber  FindLargestInCol();
 

src/maths/sparse/spOutput.c

@@ -159,6 +159,8 @@ int  *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
     SP_CALLOC( PrintOrdToIntColMap, int, Top + 1 );
     if ( PrintOrdToIntRowMap == NULL OR PrintOrdToIntColMap == NULL)
     {   Matrix->Error = spNO_MEMORY;
+        SP_FREE(PrintOrdToIntColMap);
+        SP_FREE(PrintOrdToIntRowMap);
         return;
     }
     for (I = 1; I <= Size; I++)

src/maths/sparse/spSMP.c

@@ -431,10 +431,10 @@ SMPcDProd(SMPmatrix *Matrix, SPcomplex *pMantissa, int *pExponent)
     if (y < z)
     y = z;
 
+#ifdef debug_print
     *pExponent = (int)(x + y);
     x = scalbn(re, (int) -y);
     z = scalbn(im, (int) -y);
-#ifdef debug_print
     printf(" ** values are: re %g, im %g, y %g, re' %g, im' %g\n",
         re, im, y, x, z);
 #endif

src/maths/sparse/spUtils.c

@@ -2192,7 +2192,8 @@ int Row, Col, Error;
     }
     else ABORT();
 
-    Matrix->Error = spOKAY;
+    if (Matrix != NULL)
+        Matrix->Error = spOKAY;
     return;
 }
 #endif /* DOCUMENTATION */