1 /* 2 Defines basic operations for the MATSEQAIJSELL matrix class. 3 This class is derived from the MATAIJCLASS, but maintains a "shadow" copy 4 of the matrix stored in MATSEQSELL format, which is used as appropriate for 5 performing operations for which this format is more suitable. 6 */ 7 8 #include <../src/mat/impls/aij/seq/aij.h> 9 #include <../src/mat/impls/sell/seq/sell.h> 10 11 typedef struct { 12 Mat S; /* The SELL formatted "shadow" matrix. */ 13 PetscBool eager_shadow; 14 PetscObjectState state; /* State of the matrix when shadow matrix was last constructed. */ 15 } Mat_SeqAIJSELL; 16 17 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJSELL_SeqAIJ(Mat A,MatType type,MatReuse reuse,Mat *newmat) 18 { 19 /* This routine is only called to convert a MATAIJSELL to its base PETSc type, */ 20 /* so we will ignore 'MatType type'. */ 21 PetscErrorCode ierr; 22 Mat B = *newmat; 23 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 24 25 PetscFunctionBegin; 26 if (reuse == MAT_INITIAL_MATRIX) { 27 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 28 } 29 30 /* Reset the original function pointers. */ 31 B->ops->duplicate = MatDuplicate_SeqAIJ; 32 B->ops->assemblyend = MatAssemblyEnd_SeqAIJ; 33 B->ops->destroy = MatDestroy_SeqAIJ; 34 B->ops->mult = MatMult_SeqAIJ; 35 B->ops->multtranspose = MatMultTranspose_SeqAIJ; 36 B->ops->multadd = MatMultAdd_SeqAIJ; 37 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJ; 38 B->ops->sor = MatSOR_SeqAIJ; 39 40 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",NULL);CHKERRQ(ierr); 41 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMult_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 42 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultSymbolic_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 43 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultNumeric_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 44 ierr = PetscObjectComposeFunction((PetscObject)B,"MatPtAP_is_seqaijsell_C",NULL);CHKERRQ(ierr); 45 46 if (reuse == MAT_INITIAL_MATRIX) aijsell = (Mat_SeqAIJSELL*)B->spptr; 47 48 /* Clean up the Mat_SeqAIJSELL data structure. */ 49 if(aijsell->S) { 50 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 51 } 52 ierr = PetscFree(B->spptr);CHKERRQ(ierr); 53 54 /* Change the type of B to MATSEQAIJ. */ 55 ierr = PetscObjectChangeTypeName((PetscObject)B, MATSEQAIJ);CHKERRQ(ierr); 56 57 *newmat = B; 58 PetscFunctionReturn(0); 59 } 60 61 PetscErrorCode MatDestroy_SeqAIJSELL(Mat A) 62 { 63 PetscErrorCode ierr; 64 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 65 66 PetscFunctionBegin; 67 68 /* If MatHeaderMerge() was used, then this SeqAIJSELL matrix will not have an 69 * spptr pointer. */ 70 if (aijsell) { 71 /* Clean up everything in the Mat_SeqAIJSELL data structure, then free A->spptr. */ 72 if (aijsell->S) { 73 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 74 } 75 ierr = PetscFree(A->spptr);CHKERRQ(ierr); 76 } 77 78 /* Change the type of A back to SEQAIJ and use MatDestroy_SeqAIJ() 79 * to destroy everything that remains. */ 80 ierr = PetscObjectChangeTypeName((PetscObject)A, MATSEQAIJ);CHKERRQ(ierr); 81 /* Note that I don't call MatSetType(). I believe this is because that 82 * is only to be called when *building* a matrix. I could be wrong, but 83 * that is how things work for the SuperLU matrix class. */ 84 ierr = MatDestroy_SeqAIJ(A);CHKERRQ(ierr); 85 PetscFunctionReturn(0); 86 } 87 88 /* Build or update the shadow matrix if and only if needed. 89 * We track the ObjectState to determine when this needs to be done. */ 90 PETSC_INTERN PetscErrorCode MatSeqAIJSELL_build_shadow(Mat A) 91 { 92 PetscErrorCode ierr; 93 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 94 PetscObjectState state; 95 96 PetscFunctionBegin; 97 98 ierr = PetscObjectStateGet((PetscObject)A,&state);CHKERRQ(ierr); 99 if (aijsell->S && aijsell->state == state) { 100 /* The existing shadow matrix is up-to-date, so simply exit. */ 101 PetscFunctionReturn(0); 102 } 103 104 if (aijsell->S) { 105 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_REUSE_MATRIX,&aijsell->S);CHKERRQ(ierr); 106 } else { 107 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_INITIAL_MATRIX,&aijsell->S);CHKERRQ(ierr); 108 } 109 110 /* Record the ObjectState so that we can tell when the shadow matrix needs updating */ 111 ierr = PetscObjectStateGet((PetscObject)A,&aijsell->state);CHKERRQ(ierr); 112 113 PetscFunctionReturn(0); 114 } 115 116 PetscErrorCode MatDuplicate_SeqAIJSELL(Mat A, MatDuplicateOption op, Mat *M) 117 { 118 PetscErrorCode ierr; 119 Mat_SeqAIJSELL *aijsell; 120 Mat_SeqAIJSELL *aijsell_dest; 121 122 PetscFunctionBegin; 123 ierr = MatDuplicate_SeqAIJ(A,op,M);CHKERRQ(ierr); 124 aijsell = (Mat_SeqAIJSELL*) A->spptr; 125 aijsell_dest = (Mat_SeqAIJSELL*) (*M)->spptr; 126 ierr = PetscMemcpy(aijsell_dest,aijsell,sizeof(Mat_SeqAIJSELL));CHKERRQ(ierr); 127 /* We don't duplicate the shadow matrix -- that will be constructed as needed. */ 128 aijsell_dest->S = NULL; 129 if (aijsell->eager_shadow) { 130 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 131 } 132 PetscFunctionReturn(0); 133 } 134 135 PetscErrorCode MatAssemblyEnd_SeqAIJSELL(Mat A, MatAssemblyType mode) 136 { 137 PetscErrorCode ierr; 138 Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data; 139 Mat_SeqAIJSELL *aijsell; 140 141 PetscFunctionBegin; 142 if (mode == MAT_FLUSH_ASSEMBLY) PetscFunctionReturn(0); 143 144 /* I disable the use of the inode routines so that the AIJSELL ones will be 145 * used instead, but I wonder if it might make sense (and is feasible) to 146 * use some of them. */ 147 a->inode.use = PETSC_FALSE; 148 149 /* Since a MATSEQAIJSELL matrix is really just a MATSEQAIJ with some 150 * extra information and some different methods, call the AssemblyEnd 151 * routine for a MATSEQAIJ. 152 * I'm not sure if this is the best way to do this, but it avoids 153 * a lot of code duplication. */ 154 155 ierr = MatAssemblyEnd_SeqAIJ(A, mode);CHKERRQ(ierr); 156 157 /* If the user has requested "eager" shadowing, create the SELL shadow matrix (if needed; the function checks). 158 * (The default is to take a "lazy" approach, deferring this until something like MatMult() is called.) */ 159 aijsell = (Mat_SeqAIJSELL*) A->spptr; 160 if (aijsell->eager_shadow) { 161 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 162 } 163 164 PetscFunctionReturn(0); 165 } 166 167 PetscErrorCode MatMult_SeqAIJSELL(Mat A,Vec xx,Vec yy) 168 { 169 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 170 PetscErrorCode ierr; 171 172 PetscFunctionBegin; 173 174 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 175 ierr = MatMult_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 176 177 PetscFunctionReturn(0); 178 } 179 180 PetscErrorCode MatMultTranspose_SeqAIJSELL(Mat A,Vec xx,Vec yy) 181 { 182 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 183 PetscErrorCode ierr; 184 185 PetscFunctionBegin; 186 187 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 188 ierr = MatMultTranspose_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 189 190 PetscFunctionReturn(0); 191 } 192 193 PetscErrorCode MatMultAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 194 { 195 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 196 PetscErrorCode ierr; 197 198 PetscFunctionBegin; 199 200 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 201 ierr = MatMultAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 202 203 PetscFunctionReturn(0); 204 } 205 206 PetscErrorCode MatMultTransposeAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 207 { 208 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 209 PetscErrorCode ierr; 210 211 PetscFunctionBegin; 212 213 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 214 ierr = MatMultTransposeAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 215 216 PetscFunctionReturn(0); 217 } 218 219 PetscErrorCode MatSOR_SeqAIJSELL(Mat A,Vec bb,PetscReal omega,MatSORType flag,PetscReal fshift,PetscInt its,PetscInt lits,Vec xx) 220 { 221 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 222 PetscErrorCode ierr; 223 224 PetscFunctionBegin; 225 226 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 227 ierr = MatSOR_SeqSELL(aijsell->S,bb,omega,flag,fshift,its,lits,xx);CHKERRQ(ierr); 228 229 PetscFunctionReturn(0); 230 } 231 232 /* This function prototype is needed in MatConvert_SeqAIJ_SeqAIJSELL(), below. */ 233 PETSC_INTERN PetscErrorCode MatPtAP_IS_XAIJ(Mat,Mat,MatReuse,PetscReal,Mat*); 234 235 /* MatConvert_SeqAIJ_SeqAIJSELL converts a SeqAIJ matrix into a 236 * SeqAIJSELL matrix. This routine is called by the MatCreate_SeqAIJSELL() 237 * routine, but can also be used to convert an assembled SeqAIJ matrix 238 * into a SeqAIJSELL one. */ 239 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJSELL(Mat A,MatType type,MatReuse reuse,Mat *newmat) 240 { 241 PetscErrorCode ierr; 242 Mat B = *newmat; 243 Mat_SeqAIJ *b; 244 Mat_SeqAIJSELL *aijsell; 245 PetscBool set; 246 PetscBool sametype; 247 248 PetscFunctionBegin; 249 if (reuse == MAT_INITIAL_MATRIX) { 250 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 251 } 252 253 ierr = PetscObjectTypeCompare((PetscObject)A,type,&sametype);CHKERRQ(ierr); 254 if (sametype) PetscFunctionReturn(0); 255 256 ierr = PetscNewLog(B,&aijsell);CHKERRQ(ierr); 257 b = (Mat_SeqAIJ*) B->data; 258 B->spptr = (void*) aijsell; 259 260 /* Disable use of the inode routines so that the AIJSELL ones will be used instead. 261 * This happens in MatAssemblyEnd_SeqAIJSELL as well, but the assembly end may not be called, so set it here, too. 262 * As noted elsewhere, I wonder if it might make sense and be feasible to use some of the inode routines. */ 263 b->inode.use = PETSC_FALSE; 264 265 /* Set function pointers for methods that we inherit from AIJ but override. 266 * We also parse some command line options below, since those determine some of the methods we point to. */ 267 B->ops->duplicate = MatDuplicate_SeqAIJSELL; 268 B->ops->assemblyend = MatAssemblyEnd_SeqAIJSELL; 269 B->ops->destroy = MatDestroy_SeqAIJSELL; 270 271 aijsell->S = NULL; 272 aijsell->eager_shadow = PETSC_FALSE; 273 274 /* Parse command line options. */ 275 ierr = PetscOptionsBegin(PetscObjectComm((PetscObject)A),((PetscObject)A)->prefix,"AIJSELL Options","Mat");CHKERRQ(ierr); 276 ierr = PetscOptionsBool("-mat_aijsell_eager_shadow","Eager Shadowing","None",(PetscBool)aijsell->eager_shadow,(PetscBool*)&aijsell->eager_shadow,&set);CHKERRQ(ierr); 277 ierr = PetscOptionsEnd();CHKERRQ(ierr); 278 279 /* If A has already been assembled and eager shadowing is specified, build the shadow matrix. */ 280 if (A->assembled && aijsell->eager_shadow) { 281 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 282 } 283 284 B->ops->mult = MatMult_SeqAIJSELL; 285 B->ops->multtranspose = MatMultTranspose_SeqAIJSELL; 286 B->ops->multadd = MatMultAdd_SeqAIJSELL; 287 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJSELL; 288 B->ops->sor = MatSOR_SeqAIJSELL; 289 290 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",MatConvert_SeqAIJSELL_SeqAIJ);CHKERRQ(ierr); 291 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMult_seqdense_seqaijsell_C",MatMatMult_SeqDense_SeqAIJ);CHKERRQ(ierr); 292 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultSymbolic_seqdense_seqaijsell_C",MatMatMultSymbolic_SeqDense_SeqAIJ);CHKERRQ(ierr); 293 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultNumeric_seqdense_seqaijsell_C",MatMatMultNumeric_SeqDense_SeqAIJ);CHKERRQ(ierr); 294 ierr = PetscObjectComposeFunction((PetscObject)B,"MatPtAP_is_seqaijsell_C",MatPtAP_IS_XAIJ);CHKERRQ(ierr); 295 296 ierr = PetscObjectChangeTypeName((PetscObject)B,MATSEQAIJSELL);CHKERRQ(ierr); 297 *newmat = B; 298 PetscFunctionReturn(0); 299 } 300 301 /*@C 302 MatCreateSeqAIJSELL - Creates a sparse matrix of type SEQAIJSELL. 303 This type inherits from AIJ and is largely identical, but keeps a "shadow" 304 copy of the matrix in SEQSELL format, which is used when performing 305 operations for which this format is more suitable. 306 307 Collective on MPI_Comm 308 309 Input Parameters: 310 + comm - MPI communicator, set to PETSC_COMM_SELF 311 . m - number of rows 312 . n - number of columns 313 . nz - number of nonzeros per row (same for all rows) 314 - nnz - array containing the number of nonzeros in the various rows 315 (possibly different for each row) or NULL 316 317 Output Parameter: 318 . A - the matrix 319 320 Options Database Keys: 321 . -mat_aijsell_eager_shadow - Construct shadow matrix upon matrix assembly; default is to take a "lazy" approach, performing this step the first time the matrix is applied 322 323 Notes: 324 If nnz is given then nz is ignored 325 326 Level: intermediate 327 328 .keywords: matrix, sparse, parallel 329 330 .seealso: MatCreate(), MatCreateMPIAIJSELL(), MatSetValues() 331 @*/ 332 PetscErrorCode MatCreateSeqAIJSELL(MPI_Comm comm,PetscInt m,PetscInt n,PetscInt nz,const PetscInt nnz[],Mat *A) 333 { 334 PetscErrorCode ierr; 335 336 PetscFunctionBegin; 337 ierr = MatCreate(comm,A);CHKERRQ(ierr); 338 ierr = MatSetSizes(*A,m,n,m,n);CHKERRQ(ierr); 339 ierr = MatSetType(*A,MATSEQAIJSELL);CHKERRQ(ierr); 340 ierr = MatSeqAIJSetPreallocation_SeqAIJ(*A,nz,nnz);CHKERRQ(ierr); 341 PetscFunctionReturn(0); 342 } 343 344 PETSC_EXTERN PetscErrorCode MatCreate_SeqAIJSELL(Mat A) 345 { 346 PetscErrorCode ierr; 347 348 PetscFunctionBegin; 349 ierr = MatSetType(A,MATSEQAIJ);CHKERRQ(ierr); 350 ierr = MatConvert_SeqAIJ_SeqAIJSELL(A,MATSEQAIJSELL,MAT_INPLACE_MATRIX,&A);CHKERRQ(ierr); 351 PetscFunctionReturn(0); 352 } 353