Merge branch 'xiaoyeli:master' into fix/cmake-test-setup

xiaoyeli · Sep 12, 2023 · 990dcdb · 990dcdb
2 parents 697e256 + f63265a
commit 990dcdb
Show file tree

Hide file tree

Showing 5 changed files with 5 additions and 5 deletions.
diff --git a/SRC/cgstrf.c b/SRC/cgstrf.c
@@ -417,7 +417,7 @@ cgstrf (superlu_options_t *options, SuperMatrix *A,
     if (m > k) {
         /* if k == m, then all the row permutations are complete and
            we can short circuit looking through the rest of the vector */
-        for (i = k; i < m && k < m; ++i) {
+        for (i = 0; i < m && k < m; ++i) {
             if (perm_r[i] == EMPTY) {
                 perm_r[i] = k;
                 ++k;

diff --git a/SRC/dgstrf.c b/SRC/dgstrf.c
@@ -417,7 +417,7 @@ dgstrf (superlu_options_t *options, SuperMatrix *A,
     if (m > k) {
         /* if k == m, then all the row permutations are complete and
            we can short circuit looking through the rest of the vector */
-        for (i = k; i < m && k < m; ++i) {
+        for (i = 0; i < m && k < m; ++i) {
             if (perm_r[i] == EMPTY) {
                 perm_r[i] = k;
                 ++k;

diff --git a/SRC/sgstrf.c b/SRC/sgstrf.c
@@ -417,7 +417,7 @@ sgstrf (superlu_options_t *options, SuperMatrix *A,
     if (m > k) {
         /* if k == m, then all the row permutations are complete and
            we can short circuit looking through the rest of the vector */
-        for (i = k; i < m && k < m; ++i) {
+        for (i = 0; i < m && k < m; ++i) {
             if (perm_r[i] == EMPTY) {
                 perm_r[i] = k;
                 ++k;

diff --git a/SRC/superlu_config.h b/SRC/superlu_config.h
@@ -9,7 +9,7 @@
 /* #undef HAVE_COLAMD */
 
 /* enable 64bit index mode */
-#define XSDK_INDEX_SIZE 64
+/* #undef XSDK_INDEX_SIZE */
 
 /* Integer type for indexing sparse matrix meta structure */
 #if (XSDK_INDEX_SIZE == 64)

diff --git a/SRC/zgstrf.c b/SRC/zgstrf.c
@@ -417,7 +417,7 @@ zgstrf (superlu_options_t *options, SuperMatrix *A,
     if (m > k) {
         /* if k == m, then all the row permutations are complete and
            we can short circuit looking through the rest of the vector */
-        for (i = k; i < m && k < m; ++i) {
+        for (i = 0; i < m && k < m; ++i) {
             if (perm_r[i] == EMPTY) {
                 perm_r[i] = k;
                 ++k;