File fix-warn-test.diff of Package superlu
Index: SuperLU_3.0/TESTING/MATGEN/slaruv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/slaruv.c
+++ SuperLU_3.0/TESTING/MATGEN/slaruv.c
@@ -92,9 +92,9 @@
249,3917,2481,3941,2217,2749,3041,1877,345,2861,1809,3141,2825,
157,2881,3637,1465,2829,2161,3365,361,2685,3745,2325,3609,3821,
3537,517,3017,2141,1537 };
/* System generated locals */
- integer i__1;
+ //integer i__1;
/* Local variables */
static integer i, i1, i2, i3, i4, it1, it2, it3, it4;
@@ -109,9 +109,9 @@
i2 = ISEED(2);
i3 = ISEED(3);
i4 = ISEED(4);
- i__1 = min(*n,128);
+ //i__1 = min(*n,128);
for (i = 1; i <= min(*n,128); ++i) {
/* Multiply the seed by i-th power of the multiplier modulo 2**
48 */
Index: SuperLU_3.0/TESTING/MATGEN/slarnv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/slarnv.c
+++ SuperLU_3.0/TESTING/MATGEN/slarnv.c
@@ -52,9 +52,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2, i__3;
+ integer /*i__1,*/ i__2, i__3;
/* Builtin functions */
double log(doublereal), sqrt(doublereal), cos(doublereal);
/* Local variables */
static integer i;
@@ -66,9 +66,9 @@
#define X(I) x[(I)-1]
#define ISEED(I) iseed[(I)-1]
- i__1 = *n;
+ //i__1 = *n;
for (iv = 1; iv <= *n; iv += 64) {
/* Computing MIN */
i__2 = 64, i__3 = *n - iv + 1;
il = min(i__2,i__3);
Index: SuperLU_3.0/TESTING/MATGEN/slaset.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/slaset.c
+++ SuperLU_3.0/TESTING/MATGEN/slaset.c
@@ -61,9 +61,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer a_dim1, a_offset, i__1, i__2, i__3;
+ // integer a_dim1, a_offset, i__1, i__2, i__3;
/* Local variables */
static integer i, j;
extern logical lsame_(char *, char *);
@@ -76,13 +76,13 @@
/* Set the strictly upper triangular or trapezoidal part of the
array to ALPHA. */
- i__1 = *n;
+ //i__1 = *n;
for (j = 2; j <= *n; ++j) {
/* Computing MIN */
- i__3 = j - 1;
- i__2 = min(i__3,*m);
+ //i__3 = j - 1;
+ //i__2 = min(i__3,*m);
for (i = 1; i <= min(j-1,*m); ++i) {
A(i,j) = *alpha;
/* L10: */
}
@@ -94,11 +94,11 @@
/* Set the strictly lower triangular or trapezoidal part of the
array to ALPHA. */
- i__1 = min(*m,*n);
+ //i__1 = min(*m,*n);
for (j = 1; j <= min(*m,*n); ++j) {
- i__2 = *m;
+ //i__2 = *m;
for (i = j + 1; i <= *m; ++i) {
A(i,j) = *alpha;
/* L30: */
}
@@ -108,11 +108,11 @@
} else {
/* Set the leading m-by-n submatrix to ALPHA. */
- i__1 = *n;
+ //i__1 = *n;
for (j = 1; j <= *n; ++j) {
- i__2 = *m;
+ //i__2 = *m;
for (i = 1; i <= *m; ++i) {
A(i,j) = *alpha;
/* L50: */
}
@@ -121,9 +121,9 @@
}
/* Set the first min(M,N) diagonal elements to BETA. */
- i__1 = min(*m,*n);
+ //i__1 = min(*m,*n);
for (i = 1; i <= min(*m,*n); ++i) {
A(i,i) = *beta;
/* L70: */
}
Index: SuperLU_3.0/TESTING/MATGEN/lsamen.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/lsamen.c
+++ SuperLU_3.0/TESTING/MATGEN/lsamen.c
@@ -33,9 +33,9 @@ logical lsamen_(integer *n, char *ca, ch
=====================================================================
*/
/* System generated locals */
- integer i__1;
+ //integer i__1;
logical ret_val;
/* Local variables */
static integer i;
extern logical lsame_(char *, char *);
@@ -47,9 +47,9 @@ logical lsamen_(integer *n, char *ca, ch
}
/* Do for each character in the two strings. */
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
/* Test if the characters are equal using LSAME. */
Index: SuperLU_3.0/TESTING/MATGEN/dlaruv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/dlaruv.c
+++ SuperLU_3.0/TESTING/MATGEN/dlaruv.c
@@ -92,9 +92,9 @@
249,3917,2481,3941,2217,2749,3041,1877,345,2861,1809,3141,2825,
157,2881,3637,1465,2829,2161,3365,361,2685,3745,2325,3609,3821,
3537,517,3017,2141,1537 };
/* System generated locals */
- integer i__1;
+ //integer i__1;
/* Local variables */
static integer i, i1, i2, i3, i4, it1, it2, it3, it4;
@@ -109,9 +109,9 @@
i2 = ISEED(2);
i3 = ISEED(3);
i4 = ISEED(4);
- i__1 = min(*n,128);
+ //i__1 = min(*n,128);
for (i = 1; i <= min(*n,128); ++i) {
/* Multiply the seed by i-th power of the multiplier modulo 2**
48 */
Index: SuperLU_3.0/TESTING/MATGEN/cdotc.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/cdotc.c
+++ SuperLU_3.0/TESTING/MATGEN/cdotc.c
@@ -8,9 +8,9 @@
/* Complex */ VOID cdotc_(complex * ret_val, integer *n, complex *cx, integer
*incx, complex *cy, integer *incy)
{
/* System generated locals */
- integer i__1, i__2;
+ //integer i__1, i__2;
complex q__1, q__2, q__3;
/* Builtin functions */
void r_cnjg(complex *, complex *);
@@ -52,12 +52,12 @@
}
if (*incy < 0) {
iy = (-(*n) + 1) * *incy + 1;
}
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
r_cnjg(&q__3, &cx[ix]);
- i__2 = iy;
+ //i__2 = iy;
q__2.r = q__3.r * cy[iy].r - q__3.i * cy[iy].i, q__2.i = q__3.r *
cy[iy].i + q__3.i * cy[iy].r;
q__1.r = ctemp.r + q__2.r, q__1.i = ctemp.i + q__2.i;
ctemp.r = q__1.r, ctemp.i = q__1.i;
@@ -70,12 +70,12 @@
/* code for both increments equal to 1 */
L20:
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
r_cnjg(&q__3, &cx[i]);
- i__2 = i;
+ //i__2 = i;
q__2.r = q__3.r * cy[i].r - q__3.i * cy[i].i, q__2.i = q__3.r *
cy[i].i + q__3.i * cy[i].r;
q__1.r = ctemp.r + q__2.r, q__1.i = ctemp.i + q__2.i;
ctemp.r = q__1.r, ctemp.i = q__1.i;
Index: SuperLU_3.0/TESTING/MATGEN/dlarnv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/dlarnv.c
+++ SuperLU_3.0/TESTING/MATGEN/dlarnv.c
@@ -52,9 +52,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2, i__3;
+ integer /*i__1,*/ i__2, i__3;
/* Builtin functions */
double log(doublereal), sqrt(doublereal), cos(doublereal);
/* Local variables */
static integer i;
@@ -68,9 +68,9 @@
#define X(I) x[(I)-1]
#define ISEED(I) iseed[(I)-1]
- i__1 = *n;
+ //i__1 = *n;
for (iv = 1; iv <= *n; iv += 64) {
/* Computing MIN */
i__2 = 64, i__3 = *n - iv + 1;
il = min(i__2,i__3);
Index: SuperLU_3.0/TESTING/MATGEN/dlaset.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/dlaset.c
+++ SuperLU_3.0/TESTING/MATGEN/dlaset.c
@@ -57,9 +57,9 @@
=====================================================================
Function Body */
/* System generated locals */
- integer i__1, i__2, i__3;
+ //integer i__1, i__2, i__3;
/* Local variables */
static integer i, j;
extern logical lsame_(char *, char *);
@@ -71,13 +71,13 @@
/* Set the strictly upper triangular or trapezoidal part of the
array to ALPHA. */
- i__1 = *n;
+ //i__1 = *n;
for (j = 2; j <= *n; ++j) {
/* Computing MIN */
- i__3 = j - 1;
- i__2 = min(i__3,*m);
+ //i__3 = j - 1;
+ //i__2 = min(i__3,*m);
for (i = 1; i <= min(j-1,*m); ++i) {
A(i,j) = *alpha;
/* L10: */
}
@@ -89,11 +89,11 @@
/* Set the strictly lower triangular or trapezoidal part of the
array to ALPHA. */
- i__1 = min(*m,*n);
+ //i__1 = min(*m,*n);
for (j = 1; j <= min(*m,*n); ++j) {
- i__2 = *m;
+ //i__2 = *m;
for (i = j + 1; i <= *m; ++i) {
A(i,j) = *alpha;
/* L30: */
}
@@ -103,11 +103,11 @@
} else {
/* Set the leading m-by-n submatrix to ALPHA. */
- i__1 = *n;
+ //i__1 = *n;
for (j = 1; j <= *n; ++j) {
- i__2 = *m;
+ //i__2 = *m;
for (i = 1; i <= *m; ++i) {
A(i,j) = *alpha;
/* L50: */
}
@@ -116,9 +116,9 @@
}
/* Set the first min(M,N) diagonal elements to BETA. */
- i__1 = min(*m,*n);
+ //i__1 = min(*m,*n);
for (i = 1; i <= min(*m,*n); ++i) {
A(i,i) = *beta;
/* L70: */
}
Index: SuperLU_3.0/TESTING/MATGEN/clacgv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/clacgv.c
+++ SuperLU_3.0/TESTING/MATGEN/clacgv.c
@@ -34,9 +34,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2;
+ //integer i__1, i__2;
complex q__1;
/* Builtin functions */
void r_cnjg(complex *, complex *);
/* Local variables */
@@ -46,11 +46,11 @@
#define X(I) x[(I)-1]
if (*incx == 1) {
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
- i__2 = i;
+ //i__2 = i;
r_cnjg(&q__1, &X(i));
X(i).r = q__1.r, X(i).i = q__1.i;
/* L10: */
}
@@ -58,11 +58,11 @@
ioff = 1;
if (*incx < 0) {
ioff = 1 - (*n - 1) * *incx;
}
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
- i__2 = ioff;
+ //i__2 = ioff;
r_cnjg(&q__1, &X(ioff));
X(ioff).r = q__1.r, X(ioff).i = q__1.i;
ioff += *incx;
/* L20: */
Index: SuperLU_3.0/TESTING/MATGEN/clarnv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/clarnv.c
+++ SuperLU_3.0/TESTING/MATGEN/clarnv.c
@@ -55,9 +55,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2, i__3, i__4, i__5;
+ integer /*i__1,*/ i__2, i__3; //, i__4, i__5;
doublereal d__1, d__2;
complex q__1, q__2, q__3;
/* Builtin functions */
double log(doublereal), sqrt(doublereal);
@@ -72,9 +72,9 @@
#define X(I) x[(I)-1]
#define ISEED(I) iseed[(I)-1]
- i__1 = *n;
+ //i__1 = *n;
for (iv = 1; iv <= *n; iv += 64) {
/* Computing MIN */
i__2 = 64, i__3 = *n - iv + 1;
il = min(i__2,i__3);
@@ -92,10 +92,10 @@
i__2 = il;
for (i = 1; i <= il; ++i) {
i__3 = iv + i - 1;
- i__4 = (i << 1) - 2;
- i__5 = (i << 1) - 1;
+ //i__4 = (i << 1) - 2;
+ //i__5 = (i << 1) - 1;
q__1.r = u[(i<<1)-2], q__1.i = u[(i<<1)-1];
X(iv+i-1).r = q__1.r, X(iv+i-1).i = q__1.i;
/* L10: */
}
Index: SuperLU_3.0/TESTING/MATGEN/zdotc.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/zdotc.c
+++ SuperLU_3.0/TESTING/MATGEN/zdotc.c
@@ -8,9 +8,9 @@
/* Double Complex */ VOID zdotc_(doublecomplex * ret_val, integer *n,
doublecomplex *zx, integer *incx, doublecomplex *zy, integer *incy)
{
/* System generated locals */
- integer i__1, i__2;
+ //integer i__1, i__2;
doublecomplex z__1, z__2, z__3;
/* Builtin functions */
void d_cnjg(doublecomplex *, doublecomplex *);
@@ -50,12 +50,12 @@
}
if (*incy < 0) {
iy = (-(*n) + 1) * *incy + 1;
}
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
d_cnjg(&z__3, &zx[ix]);
- i__2 = iy;
+ //i__2 = iy;
z__2.r = z__3.r * zy[iy].r - z__3.i * zy[iy].i, z__2.i = z__3.r *
zy[iy].i + z__3.i * zy[iy].r;
z__1.r = ztemp.r + z__2.r, z__1.i = ztemp.i + z__2.i;
ztemp.r = z__1.r, ztemp.i = z__1.i;
@@ -68,12 +68,12 @@
/* code for both increments equal to 1 */
L20:
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
d_cnjg(&z__3, &zx[i]);
- i__2 = i;
+ //i__2 = i;
z__2.r = z__3.r * zy[i].r - z__3.i * zy[i].i, z__2.i = z__3.r *
zy[i].i + z__3.i * zy[i].r;
z__1.r = ztemp.r + z__2.r, z__1.i = ztemp.i + z__2.i;
ztemp.r = z__1.r, ztemp.i = z__1.i;
Index: SuperLU_3.0/TESTING/MATGEN/zlarnv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/zlarnv.c
+++ SuperLU_3.0/TESTING/MATGEN/zlarnv.c
@@ -55,9 +55,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2, i__3, i__4, i__5;
+ integer /*i__1,*/ i__2, i__3; //, i__4, i__5;
doublereal d__1, d__2;
doublecomplex z__1, z__2, z__3;
/* Builtin functions */
double log(doublereal), sqrt(doublereal);
@@ -73,9 +73,9 @@
#define X(I) x[(I)-1]
#define ISEED(I) iseed[(I)-1]
- i__1 = *n;
+ //i__1 = *n;
for (iv = 1; iv <= *n; iv += 64) {
/* Computing MIN */
i__2 = 64, i__3 = *n - iv + 1;
il = min(i__2,i__3);
@@ -93,10 +93,10 @@
i__2 = il;
for (i = 1; i <= il; ++i) {
i__3 = iv + i - 1;
- i__4 = (i << 1) - 2;
- i__5 = (i << 1) - 1;
+ //i__4 = (i << 1) - 2;
+ //i__5 = (i << 1) - 1;
z__1.r = U((i<<1)-2), z__1.i = U((i<<1)-1);
X(iv+i-1).r = z__1.r, X(iv+i-1).i = z__1.i;
/* L10: */
}
Index: SuperLU_3.0/TESTING/MATGEN/zlacgv.c
===================================================================
--- SuperLU_3.0.orig/TESTING/MATGEN/zlacgv.c
+++ SuperLU_3.0/TESTING/MATGEN/zlacgv.c
@@ -34,9 +34,9 @@
Parameter adjustments
Function Body */
/* System generated locals */
- integer i__1, i__2;
+ //integer i__1, i__2;
doublecomplex z__1;
/* Builtin functions */
void d_cnjg(doublecomplex *, doublecomplex *);
/* Local variables */
@@ -46,11 +46,11 @@
#define X(I) x[(I)-1]
if (*incx == 1) {
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
- i__2 = i;
+ //i__2 = i;
d_cnjg(&z__1, &X(i));
X(i).r = z__1.r, X(i).i = z__1.i;
/* L10: */
}
@@ -58,11 +58,11 @@
ioff = 1;
if (*incx < 0) {
ioff = 1 - (*n - 1) * *incx;
}
- i__1 = *n;
+ //i__1 = *n;
for (i = 1; i <= *n; ++i) {
- i__2 = ioff;
+ //i__2 = ioff;
d_cnjg(&z__1, &X(ioff));
X(ioff).r = z__1.r, X(ioff).i = z__1.i;
ioff += *incx;
/* L20: */
Index: SuperLU_3.0/TESTING/sdrive.c
===================================================================
--- SuperLU_3.0.orig/TESTING/sdrive.c
+++ SuperLU_3.0/TESTING/sdrive.c
@@ -27,9 +27,9 @@ static void
parse_command_line(int argc, char *argv[], char *matrix_type,
int *n, int *w, int *relax, int *nrhs, int *maxsuper,
int *rowblk, int *colblk, int *lwork, double *u);
-main(int argc, char *argv[])
+int main(int argc, char *argv[])
{
/*
* Purpose
* =======
@@ -65,14 +65,15 @@ main(int argc, char *argv[])
float rpg, rcond;
int i, j, k1;
float rowcnd, colcnd, amax;
int maxsuper, rowblk, colblk;
- int prefact, nofact, equil, iequed;
+ int prefact, /*nofact,*/ equil, iequed;
int nt, nrun, nfail, nerrs, imat, fimat, nimat;
int nfact, ifact, itran;
int kl, ku, mode, lda;
int zerot, izero, ioff;
- float anorm, cndnum, u, drop_tol = 0.;
+ float anorm, cndnum, drop_tol = 0.;
+ double u;
float *Afull;
float result[NTESTS];
superlu_options_t options;
fact_t fact;
@@ -260,9 +261,9 @@ main(int argc, char *argv[])
options.Equil = equil;
prefact = ( options.Fact == FACTORED ||
options.Fact == SamePattern_SameRowPerm );
/* Need a first factor */
- nofact = (options.Fact != FACTORED); /* Not factored */
+ //nofact = (options.Fact != FACTORED); /* Not factored */
/* Restore the matrix A. */
sCopy_CompCol_Matrix(&ASAV, &A);
Index: SuperLU_3.0/TESTING/sp_sget01.c
===================================================================
--- SuperLU_3.0.orig/TESTING/sp_sget01.c
+++ SuperLU_3.0/TESTING/sp_sget01.c
@@ -50,9 +50,9 @@ int sp_sget01(int m, int n, SuperMatrix
/* Local variables */
float zero = 0.0;
int i, j, k, arow, lptr,isub, urow, superno, fsupc, u_part;
- float utemp, comp_temp;
+ float utemp; //, comp_temp;
float anorm, tnorm, cnorm;
float eps;
float *work;
SCformat *Lstore;
Index: SuperLU_3.0/TESTING/ddrive.c
===================================================================
--- SuperLU_3.0.orig/TESTING/ddrive.c
+++ SuperLU_3.0/TESTING/ddrive.c
@@ -26,9 +26,9 @@ static void
parse_command_line(int argc, char *argv[], char *matrix_type,
int *n, int *w, int *relax, int *nrhs, int *maxsuper,
int *rowblk, int *colblk, int *lwork, double *u);
-main(int argc, char *argv[])
+int main(int argc, char *argv[])
{
/*
* Purpose
* =======
@@ -64,9 +64,9 @@ main(int argc, char *argv[])
double rpg, rcond;
int i, j, k1;
double rowcnd, colcnd, amax;
int maxsuper, rowblk, colblk;
- int prefact, nofact, equil, iequed;
+ int prefact, /*nofact,*/ equil, iequed;
int nt, nrun, nfail, nerrs, imat, fimat, nimat;
int nfact, ifact, itran;
int kl, ku, mode, lda;
int zerot, izero, ioff;
@@ -259,9 +259,9 @@ main(int argc, char *argv[])
options.Equil = equil;
prefact = ( options.Fact == FACTORED ||
options.Fact == SamePattern_SameRowPerm );
/* Need a first factor */
- nofact = (options.Fact != FACTORED); /* Not factored */
+ //nofact = (options.Fact != FACTORED); /* Not factored */
/* Restore the matrix A. */
dCopy_CompCol_Matrix(&ASAV, &A);
Index: SuperLU_3.0/TESTING/sp_dget01.c
===================================================================
--- SuperLU_3.0.orig/TESTING/sp_dget01.c
+++ SuperLU_3.0/TESTING/sp_dget01.c
@@ -50,9 +50,9 @@ int sp_dget01(int m, int n, SuperMatrix
/* Local variables */
double zero = 0.0;
int i, j, k, arow, lptr,isub, urow, superno, fsupc, u_part;
- double utemp, comp_temp;
+ double utemp; //, comp_temp;
double anorm, tnorm, cnorm;
double eps;
double *work;
SCformat *Lstore;
Index: SuperLU_3.0/TESTING/cdrive.c
===================================================================
--- SuperLU_3.0.orig/TESTING/cdrive.c
+++ SuperLU_3.0/TESTING/cdrive.c
@@ -26,9 +26,9 @@ static void
parse_command_line(int argc, char *argv[], char *matrix_type,
int *n, int *w, int *relax, int *nrhs, int *maxsuper,
int *rowblk, int *colblk, int *lwork, double *u);
-main(int argc, char *argv[])
+int main(int argc, char *argv[])
{
/*
* Purpose
* =======
@@ -64,14 +64,15 @@ main(int argc, char *argv[])
float rpg, rcond;
int i, j, k1;
float rowcnd, colcnd, amax;
int maxsuper, rowblk, colblk;
- int prefact, nofact, equil, iequed;
+ int prefact, /*nofact,*/ equil, iequed;
int nt, nrun, nfail, nerrs, imat, fimat, nimat;
int nfact, ifact, itran;
int kl, ku, mode, lda;
int zerot, izero, ioff;
- float anorm, cndnum, u, drop_tol = 0.;
+ float anorm, cndnum, drop_tol = 0.;
+ double u;
complex *Afull;
float result[NTESTS];
superlu_options_t options;
fact_t fact;
@@ -259,9 +260,9 @@ main(int argc, char *argv[])
options.Equil = equil;
prefact = ( options.Fact == FACTORED ||
options.Fact == SamePattern_SameRowPerm );
/* Need a first factor */
- nofact = (options.Fact != FACTORED); /* Not factored */
+ //nofact = (options.Fact != FACTORED); /* Not factored */
/* Restore the matrix A. */
cCopy_CompCol_Matrix(&ASAV, &A);
Index: SuperLU_3.0/TESTING/zdrive.c
===================================================================
--- SuperLU_3.0.orig/TESTING/zdrive.c
+++ SuperLU_3.0/TESTING/zdrive.c
@@ -26,9 +26,9 @@ static void
parse_command_line(int argc, char *argv[], char *matrix_type,
int *n, int *w, int *relax, int *nrhs, int *maxsuper,
int *rowblk, int *colblk, int *lwork, double *u);
-main(int argc, char *argv[])
+int main(int argc, char *argv[])
{
/*
* Purpose
* =======
@@ -64,9 +64,9 @@ main(int argc, char *argv[])
double rpg, rcond;
int i, j, k1;
double rowcnd, colcnd, amax;
int maxsuper, rowblk, colblk;
- int prefact, nofact, equil, iequed;
+ int prefact, /*nofact,*/ equil, iequed;
int nt, nrun, nfail, nerrs, imat, fimat, nimat;
int nfact, ifact, itran;
int kl, ku, mode, lda;
int zerot, izero, ioff;
@@ -259,9 +259,9 @@ main(int argc, char *argv[])
options.Equil = equil;
prefact = ( options.Fact == FACTORED ||
options.Fact == SamePattern_SameRowPerm );
/* Need a first factor */
- nofact = (options.Fact != FACTORED); /* Not factored */
+ //nofact = (options.Fact != FACTORED); /* Not factored */
/* Restore the matrix A. */
zCopy_CompCol_Matrix(&ASAV, &A);
