1 #define PETSCMAT_DLL 2 3 #include "src/mat/impls/aij/seq/aij.h" 4 #include "src/mat/impls/baij/seq/baij.h" 5 #include "src/mat/impls/sbaij/seq/sbaij.h" 6 7 EXTERN_C_BEGIN 8 #undef __FUNCT__ 9 #define __FUNCT__ "MatConvert_SeqSBAI_SeqAIJ" 10 PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqSBAIJ_SeqAIJ(Mat A,const MatType newtype,MatReuse reuse,Mat *newmat) 11 { 12 Mat B; 13 Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data; 14 Mat_SeqAIJ *b; 15 PetscErrorCode ierr; 16 PetscInt *ai=a->i,*aj=a->j,m=A->m,n=A->n,i,j,k,*bi,*bj,*rowlengths,nz,*rowstart,itmp; 17 PetscInt bs=A->bs,bs2=bs*bs,mbs=A->m/bs; 18 PetscScalar *av,*bv; 19 20 PetscFunctionBegin; 21 22 /* compute rowlengths of newmat */ 23 ierr = PetscMalloc((2*m+1)*sizeof(PetscInt),&rowlengths);CHKERRQ(ierr); 24 rowstart = rowlengths + m; 25 26 for (i=0; i<mbs; i++) rowlengths[i*bs] = 0; 27 aj = a->j; 28 k = 0; 29 for (i=0; i<mbs; i++) { 30 nz = ai[i+1] - ai[i]; 31 aj++; /* skip diagonal */ 32 for (j=1; j<nz; j++) { /* no. of lower triangular blocks */ 33 rowlengths[(*aj)*bs]++; aj++; 34 } 35 rowlengths[k] += nz; /* no. of upper triangular blocks */ 36 rowlengths[k] *= bs; 37 for (j=1; j<bs; j++) { 38 rowlengths[k+j] = rowlengths[k]; 39 } 40 k += bs; 41 /* printf(" rowlengths[%d]: %d\n",i, rowlengths[i]); */ 42 } 43 44 ierr = MatCreate(A->comm,m,n,m,n,&B);CHKERRQ(ierr); 45 ierr = MatSetType(B,newtype);CHKERRQ(ierr); 46 ierr = MatSeqAIJSetPreallocation(B,0,rowlengths);CHKERRQ(ierr); 47 ierr = MatSetOption(B,MAT_COLUMN_ORIENTED);CHKERRQ(ierr); 48 ierr = MatSetOption(B,MAT_ROWS_SORTED);CHKERRQ(ierr); 49 ierr = MatSetOption(B,MAT_COLUMNS_SORTED);CHKERRQ(ierr); 50 B->bs = A->bs; 51 52 b = (Mat_SeqAIJ*)(B->data); 53 bi = b->i; 54 bj = b->j; 55 bv = b->a; 56 57 /* set b->i */ 58 bi[0] = 0; rowstart[0] = 0; 59 for (i=0; i<mbs; i++){ 60 for (j=0; j<bs; j++){ 61 b->ilen[i*bs+j] = rowlengths[i*bs]; 62 rowstart[i*bs+j+1] = rowstart[i*bs+j] + rowlengths[i*bs]; 63 } 64 bi[i+1] = bi[i] + rowlengths[i*bs]/bs; 65 } 66 if (bi[mbs] != 2*a->nz - mbs) SETERRQ2(PETSC_ERR_PLIB,"bi[mbs]: %D != 2*a->nz-mbs: %D\n",bi[mbs],2*a->nz - mbs); 67 68 /* set b->j and b->a */ 69 aj = a->j; av = a->a; 70 for (i=0; i<mbs; i++) { 71 /* diagonal block */ 72 for (j=0; j<bs; j++){ /* row i*bs+j */ 73 itmp = i*bs+j; 74 for (k=0; k<bs; k++){ /* col i*bs+k */ 75 *(bj + rowstart[itmp]) = (*aj)*bs+k; 76 *(bv + rowstart[itmp]) = *(av+k*bs+j); 77 rowstart[itmp]++; 78 } 79 } 80 aj++; av += bs2; 81 82 nz = ai[i+1] - ai[i] -1; 83 while (nz--){ 84 /* lower triangular blocks */ 85 for (j=0; j<bs; j++){ /* row (*aj)*bs+j */ 86 itmp = (*aj)*bs+j; 87 for (k=0; k<bs; k++){ /* col i*bs+k */ 88 *(bj + rowstart[itmp]) = i*bs+k; 89 *(bv + rowstart[itmp]) = *(av+k*bs+j); 90 rowstart[itmp]++; 91 } 92 } 93 /* upper triangular blocks */ 94 for (j=0; j<bs; j++){ /* row i*bs+j */ 95 itmp = i*bs+j; 96 for (k=0; k<bs; k++){ /* col (*aj)*bs+k */ 97 *(bj + rowstart[itmp]) = (*aj)*bs+k; 98 *(bv + rowstart[itmp]) = *(av+k*bs+j); 99 rowstart[itmp]++; 100 } 101 } 102 aj++; av += bs2; 103 } 104 } 105 ierr = PetscFree(rowlengths);CHKERRQ(ierr); 106 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 107 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 108 109 if (reuse == MAT_REUSE_MATRIX) { 110 ierr = MatHeaderReplace(A,B);CHKERRQ(ierr); 111 } else { 112 *newmat = B; 113 } 114 PetscFunctionReturn(0); 115 } 116 EXTERN_C_END 117 118 EXTERN_C_BEGIN 119 #undef __FUNCT__ 120 #define __FUNCT__ "MatConvert_SeqAIJ_SeqSBAIJ" 121 PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqAIJ_SeqSBAIJ(Mat A,const MatType newtype,MatReuse reuse,Mat *newmat) { 122 Mat B; 123 Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data; 124 Mat_SeqSBAIJ *b; 125 PetscErrorCode ierr; 126 PetscInt *ai=a->i,*aj,m=A->M,n=A->N,i,j,*bi,*bj,*rowlengths; 127 PetscScalar *av,*bv; 128 129 PetscFunctionBegin; 130 if (n != m) SETERRQ(PETSC_ERR_ARG_WRONG,"Matrix must be square"); 131 ierr = MatMarkDiagonal_SeqAIJ(A);CHKERRQ(ierr); /* check for missing diagonals, then mark diag */ 132 133 ierr = PetscMalloc(m*sizeof(PetscInt),&rowlengths);CHKERRQ(ierr); 134 for (i=0; i<m; i++) { 135 rowlengths[i] = ai[i+1] - a->diag[i]; 136 } 137 ierr = MatCreate(A->comm,m,n,m,n,&B);CHKERRQ(ierr); 138 ierr = MatSetType(B,newtype);CHKERRQ(ierr); 139 ierr = MatSeqSBAIJSetPreallocation(B,1,0,rowlengths);CHKERRQ(ierr); 140 141 ierr = MatSetOption(B,MAT_ROW_ORIENTED);CHKERRQ(ierr); 142 ierr = MatSetOption(B,MAT_ROWS_SORTED);CHKERRQ(ierr); 143 ierr = MatSetOption(B,MAT_COLUMNS_SORTED);CHKERRQ(ierr); 144 145 b = (Mat_SeqSBAIJ*)(B->data); 146 bi = b->i; 147 bj = b->j; 148 bv = b->a; 149 150 bi[0] = 0; 151 for (i=0; i<m; i++) { 152 aj = a->j + a->diag[i]; 153 av = a->a + a->diag[i]; 154 for (j=0; j<rowlengths[i]; j++){ 155 *bj = *aj; bj++; aj++; 156 *bv = *av; bv++; av++; 157 } 158 bi[i+1] = bi[i] + rowlengths[i]; 159 b->ilen[i] = rowlengths[i]; 160 } 161 162 ierr = PetscFree(rowlengths);CHKERRQ(ierr); 163 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 164 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 165 166 if (reuse == MAT_REUSE_MATRIX) { 167 ierr = MatHeaderReplace(A,B);CHKERRQ(ierr); 168 } else { 169 *newmat = B; 170 } 171 PetscFunctionReturn(0); 172 } 173 EXTERN_C_END 174 175 EXTERN_C_BEGIN 176 #undef __FUNCT__ 177 #define __FUNCT__ "MatConvert_SeqSBAI_SeqBAIJ" 178 PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqSBAIJ_SeqBAIJ(Mat A,const MatType newtype,MatReuse reuse,Mat *newmat) 179 { 180 Mat B; 181 Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data; 182 Mat_SeqBAIJ *b; 183 PetscErrorCode ierr; 184 PetscInt *ai=a->i,*aj=a->j,m=A->m,n=A->n,i,k,*bi,*bj,*browlengths,nz,*browstart,itmp; 185 PetscInt bs=A->bs,bs2=bs*bs,mbs=m/bs; 186 PetscScalar *av,*bv; 187 188 PetscFunctionBegin; 189 /* compute browlengths of newmat */ 190 ierr = PetscMalloc(2*mbs*sizeof(PetscInt),&browlengths);CHKERRQ(ierr); 191 browstart = browlengths + mbs; 192 for (i=0; i<mbs; i++) browlengths[i] = 0; 193 aj = a->j; 194 for (i=0; i<mbs; i++) { 195 nz = ai[i+1] - ai[i]; 196 aj++; /* skip diagonal */ 197 for (k=1; k<nz; k++) { /* no. of lower triangular blocks */ 198 browlengths[*aj]++; aj++; 199 } 200 browlengths[i] += nz; /* no. of upper triangular blocks */ 201 } 202 203 ierr = MatCreate(A->comm,m,n,m,n,&B);CHKERRQ(ierr); 204 ierr = MatSetType(B,newtype);CHKERRQ(ierr); 205 ierr = MatSeqBAIJSetPreallocation(B,bs,0,browlengths);CHKERRQ(ierr); 206 ierr = MatSetOption(B,MAT_ROW_ORIENTED);CHKERRQ(ierr); 207 ierr = MatSetOption(B,MAT_ROWS_SORTED);CHKERRQ(ierr); 208 ierr = MatSetOption(B,MAT_COLUMNS_SORTED);CHKERRQ(ierr); 209 210 b = (Mat_SeqBAIJ*)(B->data); 211 bi = b->i; 212 bj = b->j; 213 bv = b->a; 214 215 /* set b->i */ 216 bi[0] = 0; 217 for (i=0; i<mbs; i++){ 218 b->ilen[i] = browlengths[i]; 219 bi[i+1] = bi[i] + browlengths[i]; 220 browstart[i] = bi[i]; 221 } 222 if (bi[mbs] != 2*a->nz - mbs) SETERRQ2(PETSC_ERR_PLIB,"bi[mbs]: %D != 2*a->nz - mbs: %D\n",bi[mbs],2*a->nz - mbs); 223 224 /* set b->j and b->a */ 225 aj = a->j; av = a->a; 226 for (i=0; i<mbs; i++) { 227 /* diagonal block */ 228 *(bj + browstart[i]) = *aj; aj++; 229 itmp = bs2*browstart[i]; 230 for (k=0; k<bs2; k++){ 231 *(bv + itmp + k) = *av; av++; 232 } 233 browstart[i]++; 234 235 nz = ai[i+1] - ai[i] -1; 236 while (nz--){ 237 /* lower triangular blocks */ 238 *(bj + browstart[*aj]) = i; 239 itmp = bs2*browstart[*aj]; 240 for (k=0; k<bs2; k++){ 241 *(bv + itmp + k) = *(av + k); 242 } 243 browstart[*aj]++; 244 245 /* upper triangular blocks */ 246 *(bj + browstart[i]) = *aj; aj++; 247 itmp = bs2*browstart[i]; 248 for (k=0; k<bs2; k++){ 249 *(bv + itmp + k) = *av; av++; 250 } 251 browstart[i]++; 252 } 253 } 254 ierr = PetscFree(browlengths);CHKERRQ(ierr); 255 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 256 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 257 258 if (reuse == MAT_REUSE_MATRIX) { 259 ierr = MatHeaderReplace(A,B);CHKERRQ(ierr); 260 } else { 261 *newmat = B; 262 } 263 PetscFunctionReturn(0); 264 } 265 EXTERN_C_END 266 267 EXTERN_C_BEGIN 268 #undef __FUNCT__ 269 #define __FUNCT__ "MatConvert_SeqBAIJ_SeqSBAIJ" 270 PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqBAIJ_SeqSBAIJ(Mat A,const MatType newtype,MatReuse reuse,Mat *newmat) 271 { 272 Mat B; 273 Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data; 274 Mat_SeqSBAIJ *b; 275 PetscErrorCode ierr; 276 PetscInt *ai=a->i,*aj,m=A->m,n=A->n,i,j,k,*bi,*bj,*browlengths; 277 PetscInt bs=A->bs,bs2=bs*bs,mbs=m/bs; 278 PetscScalar *av,*bv; 279 280 PetscFunctionBegin; 281 if (n != m) SETERRQ(PETSC_ERR_ARG_WRONG,"Matrix must be square"); 282 ierr = MatMissingDiagonal_SeqBAIJ(A);CHKERRQ(ierr); /* check for missing diagonals, then mark diag */ 283 284 ierr = PetscMalloc(mbs*sizeof(PetscInt),&browlengths);CHKERRQ(ierr); 285 for (i=0; i<mbs; i++) { 286 browlengths[i] = ai[i+1] - a->diag[i]; 287 } 288 289 ierr = MatCreate(A->comm,m,n,m,n,&B);CHKERRQ(ierr); 290 ierr = MatSetType(B,newtype);CHKERRQ(ierr); 291 ierr = MatSeqSBAIJSetPreallocation(B,bs,0,browlengths);CHKERRQ(ierr); 292 ierr = MatSetOption(B,MAT_ROW_ORIENTED);CHKERRQ(ierr); 293 ierr = MatSetOption(B,MAT_ROWS_SORTED);CHKERRQ(ierr); 294 ierr = MatSetOption(B,MAT_COLUMNS_SORTED);CHKERRQ(ierr); 295 296 b = (Mat_SeqSBAIJ*)(B->data); 297 bi = b->i; 298 bj = b->j; 299 bv = b->a; 300 301 bi[0] = 0; 302 for (i=0; i<mbs; i++) { 303 aj = a->j + a->diag[i]; 304 av = a->a + (a->diag[i])*bs2; 305 for (j=0; j<browlengths[i]; j++){ 306 *bj = *aj; bj++; aj++; 307 for (k=0; k<bs2; k++){ 308 *bv = *av; bv++; av++; 309 } 310 } 311 bi[i+1] = bi[i] + browlengths[i]; 312 b->ilen[i] = browlengths[i]; 313 } 314 ierr = PetscFree(browlengths);CHKERRQ(ierr); 315 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 316 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 317 318 if (reuse == MAT_REUSE_MATRIX) { 319 ierr = MatHeaderReplace(A,B);CHKERRQ(ierr); 320 } else { 321 *newmat = B; 322 } 323 324 PetscFunctionReturn(0); 325 } 326 EXTERN_C_END 327