aboutsummaryrefslogtreecommitdiff
path: root/redist/sba/sba_crsm.c
diff options
context:
space:
mode:
authorJustin Berger <j.david.berger@gmail.com>2018-04-20 22:31:18 -0600
committerJustin Berger <j.david.berger@gmail.com>2018-04-20 22:50:20 -0600
commita1027bceebb36afc4fa9d082277478abd8101eda (patch)
treef9692cad198f8e39e4fa0fe6cdd4cf1d5abcef5c /redist/sba/sba_crsm.c
parent3c007f47a30b70f00fd642b14ef8f4127c46ffc3 (diff)
downloadlibsurvive-a1027bceebb36afc4fa9d082277478abd8101eda.tar.gz
libsurvive-a1027bceebb36afc4fa9d082277478abd8101eda.tar.bz2
Enabled and then cleaned up warnings
Diffstat (limited to 'redist/sba/sba_crsm.c')
-rw-r--r--redist/sba/sba_crsm.c43
1 files changed, 0 insertions, 43 deletions
diff --git a/redist/sba/sba_crsm.c b/redist/sba/sba_crsm.c
index 9ba11f1..ea38042 100644
--- a/redist/sba/sba_crsm.c
+++ b/redist/sba/sba_crsm.c
@@ -22,9 +22,6 @@
#include "sba.h"
-static void sba_crsm_print(struct sba_crsm *sm, FILE *fp);
-static void sba_crsm_build(struct sba_crsm *sm, int *m, int nr, int nc);
-
/* allocate a sparse CRS matrix */
void sba_crsm_alloc(struct sba_crsm *sm, int nr, int nc, int nnz) {
int msz;
@@ -50,46 +47,6 @@ void sba_crsm_free(struct sba_crsm *sm) {
sm->val = sm->colidx = sm->rowptr = NULL;
}
-static void sba_crsm_print(struct sba_crsm *sm, FILE *fp) {
- register int i;
-
- fprintf(fp, "matrix is %dx%d, %d non-zeros\nval: ", sm->nr, sm->nc, sm->nnz);
- for (i = 0; i < sm->nnz; ++i)
- fprintf(fp, "%d ", sm->val[i]);
- fprintf(fp, "\ncolidx: ");
- for (i = 0; i < sm->nnz; ++i)
- fprintf(fp, "%d ", sm->colidx[i]);
- fprintf(fp, "\nrowptr: ");
- for (i = 0; i <= sm->nr; ++i)
- fprintf(fp, "%d ", sm->rowptr[i]);
- fprintf(fp, "\n");
-}
-
-/* build a sparse CRS matrix from a dense one. intended to serve as an example for sm creation */
-static void sba_crsm_build(struct sba_crsm *sm, int *m, int nr, int nc) {
- int nnz;
- register int i, j, k;
-
- /* count nonzeros */
- for (i = nnz = 0; i < nr; ++i)
- for (j = 0; j < nc; ++j)
- if (m[i * nc + j] != 0)
- ++nnz;
-
- sba_crsm_alloc(sm, nr, nc, nnz);
-
- /* fill up the sm structure */
- for (i = k = 0; i < nr; ++i) {
- sm->rowptr[i] = k;
- for (j = 0; j < nc; ++j)
- if (m[i * nc + j] != 0) {
- sm->val[k] = m[i * nc + j];
- sm->colidx[k++] = j;
- }
- }
- sm->rowptr[nr] = nnz;
-}
-
/* returns the index of the (i, j) element. No bounds checking! */
int sba_crsm_elmidx(struct sba_crsm *sm, int i, int j) {
register int low, high, mid, diff;