1 2 #include <../src/mat/impls/baij/seq/baij.h> 3 4 PETSC_INTERN PetscErrorCode MatConvert_SeqBAIJ_SeqAIJ(Mat A, MatType newtype, MatReuse reuse, Mat *newmat) { 5 Mat B; 6 Mat_SeqAIJ *b; 7 PetscBool roworiented; 8 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; 9 PetscInt bs = A->rmap->bs, *ai = a->i, *aj = a->j, n = A->rmap->N / bs, i, j, k; 10 PetscInt *rowlengths, *rows, *cols, maxlen = 0, ncols; 11 MatScalar *aa = a->a; 12 13 PetscFunctionBegin; 14 if (reuse == MAT_REUSE_MATRIX) { 15 B = *newmat; 16 for (i = 0; i < n; i++) { maxlen = PetscMax(maxlen, (ai[i + 1] - ai[i])); } 17 } else { 18 PetscCall(PetscMalloc1(n * bs, &rowlengths)); 19 for (i = 0; i < n; i++) { 20 maxlen = PetscMax(maxlen, (ai[i + 1] - ai[i])); 21 for (j = 0; j < bs; j++) { rowlengths[i * bs + j] = bs * (ai[i + 1] - ai[i]); } 22 } 23 PetscCall(MatCreate(PetscObjectComm((PetscObject)A), &B)); 24 PetscCall(MatSetType(B, MATSEQAIJ)); 25 PetscCall(MatSetSizes(B, A->rmap->n, A->cmap->n, A->rmap->N, A->cmap->N)); 26 PetscCall(MatSetBlockSizes(B, A->rmap->bs, A->cmap->bs)); 27 PetscCall(MatSeqAIJSetPreallocation(B, 0, rowlengths)); 28 PetscCall(PetscFree(rowlengths)); 29 } 30 b = (Mat_SeqAIJ *)B->data; 31 roworiented = b->roworiented; 32 33 PetscCall(MatSetOption(B, MAT_ROW_ORIENTED, PETSC_FALSE)); 34 PetscCall(PetscMalloc1(bs, &rows)); 35 PetscCall(PetscMalloc1(bs * maxlen, &cols)); 36 for (i = 0; i < n; i++) { 37 for (j = 0; j < bs; j++) { rows[j] = i * bs + j; } 38 ncols = ai[i + 1] - ai[i]; 39 for (k = 0; k < ncols; k++) { 40 for (j = 0; j < bs; j++) { cols[k * bs + j] = bs * (*aj) + j; } 41 aj++; 42 } 43 PetscCall(MatSetValues(B, bs, rows, bs * ncols, cols, aa, INSERT_VALUES)); 44 aa += ncols * bs * bs; 45 } 46 PetscCall(PetscFree(cols)); 47 PetscCall(PetscFree(rows)); 48 PetscCall(MatAssemblyBegin(B, MAT_FINAL_ASSEMBLY)); 49 PetscCall(MatAssemblyEnd(B, MAT_FINAL_ASSEMBLY)); 50 PetscCall(MatSetOption(B, MAT_ROW_ORIENTED, roworiented)); 51 52 if (reuse == MAT_INPLACE_MATRIX) { 53 PetscCall(MatHeaderReplace(A, &B)); 54 } else *newmat = B; 55 PetscFunctionReturn(0); 56 } 57 58 #include <../src/mat/impls/aij/seq/aij.h> 59 60 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqBAIJ(Mat A, MatType newtype, MatReuse reuse, Mat *newmat) { 61 Mat B; 62 Mat_SeqAIJ *a = (Mat_SeqAIJ *)A->data; 63 Mat_SeqBAIJ *b; 64 PetscInt *ai = a->i, m = A->rmap->N, n = A->cmap->N, i, *rowlengths, bs = PetscAbs(A->rmap->bs); 65 66 PetscFunctionBegin; 67 if (reuse != MAT_REUSE_MATRIX) { 68 PetscCall(PetscMalloc1(m / bs, &rowlengths)); 69 for (i = 0; i < m / bs; i++) { rowlengths[i] = (ai[i * bs + 1] - ai[i * bs]) / bs; } 70 PetscCall(MatCreate(PetscObjectComm((PetscObject)A), &B)); 71 PetscCall(MatSetSizes(B, m, n, m, n)); 72 PetscCall(MatSetType(B, MATSEQBAIJ)); 73 PetscCall(MatSeqBAIJSetPreallocation(B, bs, 0, rowlengths)); 74 PetscCall(PetscFree(rowlengths)); 75 } else B = *newmat; 76 77 if (bs == 1) { 78 b = (Mat_SeqBAIJ *)(B->data); 79 80 PetscCall(PetscArraycpy(b->i, a->i, m + 1)); 81 PetscCall(PetscArraycpy(b->ilen, a->ilen, m)); 82 PetscCall(PetscArraycpy(b->j, a->j, a->nz)); 83 PetscCall(PetscArraycpy(b->a, a->a, a->nz)); 84 85 PetscCall(MatSetOption(B, MAT_ROW_ORIENTED, PETSC_TRUE)); 86 PetscCall(MatAssemblyBegin(B, MAT_FINAL_ASSEMBLY)); 87 PetscCall(MatAssemblyEnd(B, MAT_FINAL_ASSEMBLY)); 88 } else { 89 /* reuse may not be equal to MAT_REUSE_MATRIX, but the basic converter will reallocate or replace newmat if this value is not used */ 90 /* if reuse is equal to MAT_INITIAL_MATRIX, it has been appropriately preallocated before */ 91 /* MAT_INPLACE_MATRIX, it will be replaced with MatHeaderReplace below */ 92 PetscCall(MatConvert_Basic(A, newtype, MAT_REUSE_MATRIX, &B)); 93 } 94 95 if (reuse == MAT_INPLACE_MATRIX) { 96 PetscCall(MatHeaderReplace(A, &B)); 97 } else *newmat = B; 98 PetscFunctionReturn(0); 99 } 100