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 ierr = PetscLogEventBegin(MAT_Convert,A,0,0,0);CHKERRQ(ierr); 105 if (aijsell->S) { 106 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_REUSE_MATRIX,&aijsell->S);CHKERRQ(ierr); 107 } else { 108 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_INITIAL_MATRIX,&aijsell->S);CHKERRQ(ierr); 109 } 110 ierr = PetscLogEventEnd(MAT_Convert,A,0,0,0);CHKERRQ(ierr); 111 112 /* Record the ObjectState so that we can tell when the shadow matrix needs updating */ 113 ierr = PetscObjectStateGet((PetscObject)A,&aijsell->state);CHKERRQ(ierr); 114 115 PetscFunctionReturn(0); 116 } 117 118 PetscErrorCode MatDuplicate_SeqAIJSELL(Mat A, MatDuplicateOption op, Mat *M) 119 { 120 PetscErrorCode ierr; 121 Mat_SeqAIJSELL *aijsell; 122 Mat_SeqAIJSELL *aijsell_dest; 123 124 PetscFunctionBegin; 125 ierr = MatDuplicate_SeqAIJ(A,op,M);CHKERRQ(ierr); 126 aijsell = (Mat_SeqAIJSELL*) A->spptr; 127 aijsell_dest = (Mat_SeqAIJSELL*) (*M)->spptr; 128 ierr = PetscMemcpy(aijsell_dest,aijsell,sizeof(Mat_SeqAIJSELL));CHKERRQ(ierr); 129 /* We don't duplicate the shadow matrix -- that will be constructed as needed. */ 130 aijsell_dest->S = NULL; 131 if (aijsell->eager_shadow) { 132 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 133 } 134 PetscFunctionReturn(0); 135 } 136 137 PetscErrorCode MatAssemblyEnd_SeqAIJSELL(Mat A, MatAssemblyType mode) 138 { 139 PetscErrorCode ierr; 140 Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data; 141 Mat_SeqAIJSELL *aijsell; 142 143 PetscFunctionBegin; 144 if (mode == MAT_FLUSH_ASSEMBLY) PetscFunctionReturn(0); 145 146 /* I disable the use of the inode routines so that the AIJSELL ones will be 147 * used instead, but I wonder if it might make sense (and is feasible) to 148 * use some of them. */ 149 a->inode.use = PETSC_FALSE; 150 151 /* Since a MATSEQAIJSELL matrix is really just a MATSEQAIJ with some 152 * extra information and some different methods, call the AssemblyEnd 153 * routine for a MATSEQAIJ. 154 * I'm not sure if this is the best way to do this, but it avoids 155 * a lot of code duplication. */ 156 157 ierr = MatAssemblyEnd_SeqAIJ(A, mode);CHKERRQ(ierr); 158 159 /* If the user has requested "eager" shadowing, create the SELL shadow matrix (if needed; the function checks). 160 * (The default is to take a "lazy" approach, deferring this until something like MatMult() is called.) */ 161 aijsell = (Mat_SeqAIJSELL*) A->spptr; 162 if (aijsell->eager_shadow) { 163 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 164 } 165 166 PetscFunctionReturn(0); 167 } 168 169 PetscErrorCode MatMult_SeqAIJSELL(Mat A,Vec xx,Vec yy) 170 { 171 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 172 PetscErrorCode ierr; 173 174 PetscFunctionBegin; 175 176 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 177 ierr = MatMult_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 178 179 PetscFunctionReturn(0); 180 } 181 182 PetscErrorCode MatMultTranspose_SeqAIJSELL(Mat A,Vec xx,Vec yy) 183 { 184 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 185 PetscErrorCode ierr; 186 187 PetscFunctionBegin; 188 189 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 190 ierr = MatMultTranspose_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 191 192 PetscFunctionReturn(0); 193 } 194 195 PetscErrorCode MatMultAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 196 { 197 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 198 PetscErrorCode ierr; 199 200 PetscFunctionBegin; 201 202 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 203 ierr = MatMultAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 204 205 PetscFunctionReturn(0); 206 } 207 208 PetscErrorCode MatMultTransposeAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 209 { 210 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 211 PetscErrorCode ierr; 212 213 PetscFunctionBegin; 214 215 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 216 ierr = MatMultTransposeAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 217 218 PetscFunctionReturn(0); 219 } 220 221 PetscErrorCode MatSOR_SeqAIJSELL(Mat A,Vec bb,PetscReal omega,MatSORType flag,PetscReal fshift,PetscInt its,PetscInt lits,Vec xx) 222 { 223 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 224 PetscErrorCode ierr; 225 226 PetscFunctionBegin; 227 228 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 229 ierr = MatSOR_SeqSELL(aijsell->S,bb,omega,flag,fshift,its,lits,xx);CHKERRQ(ierr); 230 231 PetscFunctionReturn(0); 232 } 233 234 /* This function prototype is needed in MatConvert_SeqAIJ_SeqAIJSELL(), below. */ 235 PETSC_INTERN PetscErrorCode MatPtAP_IS_XAIJ(Mat,Mat,MatReuse,PetscReal,Mat*); 236 237 /* MatConvert_SeqAIJ_SeqAIJSELL converts a SeqAIJ matrix into a 238 * SeqAIJSELL matrix. This routine is called by the MatCreate_SeqAIJSELL() 239 * routine, but can also be used to convert an assembled SeqAIJ matrix 240 * into a SeqAIJSELL one. */ 241 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJSELL(Mat A,MatType type,MatReuse reuse,Mat *newmat) 242 { 243 PetscErrorCode ierr; 244 Mat B = *newmat; 245 Mat_SeqAIJ *b; 246 Mat_SeqAIJSELL *aijsell; 247 PetscBool set; 248 PetscBool sametype; 249 250 PetscFunctionBegin; 251 if (reuse == MAT_INITIAL_MATRIX) { 252 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 253 } 254 255 ierr = PetscObjectTypeCompare((PetscObject)A,type,&sametype);CHKERRQ(ierr); 256 if (sametype) PetscFunctionReturn(0); 257 258 ierr = PetscNewLog(B,&aijsell);CHKERRQ(ierr); 259 b = (Mat_SeqAIJ*) B->data; 260 B->spptr = (void*) aijsell; 261 262 /* Disable use of the inode routines so that the AIJSELL ones will be used instead. 263 * This happens in MatAssemblyEnd_SeqAIJSELL as well, but the assembly end may not be called, so set it here, too. 264 * As noted elsewhere, I wonder if it might make sense and be feasible to use some of the inode routines. */ 265 b->inode.use = PETSC_FALSE; 266 267 /* Set function pointers for methods that we inherit from AIJ but override. 268 * We also parse some command line options below, since those determine some of the methods we point to. */ 269 B->ops->duplicate = MatDuplicate_SeqAIJSELL; 270 B->ops->assemblyend = MatAssemblyEnd_SeqAIJSELL; 271 B->ops->destroy = MatDestroy_SeqAIJSELL; 272 273 aijsell->S = NULL; 274 aijsell->eager_shadow = PETSC_FALSE; 275 276 /* Parse command line options. */ 277 ierr = PetscOptionsBegin(PetscObjectComm((PetscObject)A),((PetscObject)A)->prefix,"AIJSELL Options","Mat");CHKERRQ(ierr); 278 ierr = PetscOptionsBool("-mat_aijsell_eager_shadow","Eager Shadowing","None",(PetscBool)aijsell->eager_shadow,(PetscBool*)&aijsell->eager_shadow,&set);CHKERRQ(ierr); 279 ierr = PetscOptionsEnd();CHKERRQ(ierr); 280 281 /* If A has already been assembled and eager shadowing is specified, build the shadow matrix. */ 282 if (A->assembled && aijsell->eager_shadow) { 283 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 284 } 285 286 B->ops->mult = MatMult_SeqAIJSELL; 287 B->ops->multtranspose = MatMultTranspose_SeqAIJSELL; 288 B->ops->multadd = MatMultAdd_SeqAIJSELL; 289 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJSELL; 290 B->ops->sor = MatSOR_SeqAIJSELL; 291 292 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",MatConvert_SeqAIJSELL_SeqAIJ);CHKERRQ(ierr); 293 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMult_seqdense_seqaijsell_C",MatMatMult_SeqDense_SeqAIJ);CHKERRQ(ierr); 294 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultSymbolic_seqdense_seqaijsell_C",MatMatMultSymbolic_SeqDense_SeqAIJ);CHKERRQ(ierr); 295 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultNumeric_seqdense_seqaijsell_C",MatMatMultNumeric_SeqDense_SeqAIJ);CHKERRQ(ierr); 296 ierr = PetscObjectComposeFunction((PetscObject)B,"MatPtAP_is_seqaijsell_C",MatPtAP_IS_XAIJ);CHKERRQ(ierr); 297 298 ierr = PetscObjectChangeTypeName((PetscObject)B,MATSEQAIJSELL);CHKERRQ(ierr); 299 *newmat = B; 300 PetscFunctionReturn(0); 301 } 302 303 /*@C 304 MatCreateSeqAIJSELL - Creates a sparse matrix of type SEQAIJSELL. 305 This type inherits from AIJ and is largely identical, but keeps a "shadow" 306 copy of the matrix in SEQSELL format, which is used when this format 307 may be more suitable for a requested operation. Currently, SEQSELL format 308 is used for MatMult, MatMultTranspose, MatMultAdd, MatMultTransposeAdd, 309 and MatSOR operations. 310 Because SEQAIJSELL is a subtype of SEQAIJ, the option "-mat_seqaij_type seqaijsell" can be used to make 311 sequential AIJ matrices default to being instances of MATSEQAIJSELL. 312 313 Collective on MPI_Comm 314 315 Input Parameters: 316 + comm - MPI communicator, set to PETSC_COMM_SELF 317 . m - number of rows 318 . n - number of columns 319 . nz - number of nonzeros per row (same for all rows) 320 - nnz - array containing the number of nonzeros in the various rows 321 (possibly different for each row) or NULL 322 323 Output Parameter: 324 . A - the matrix 325 326 Options Database Keys: 327 . -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 328 329 Notes: 330 If nnz is given then nz is ignored 331 332 Level: intermediate 333 334 .keywords: matrix, sparse 335 336 .seealso: MatCreate(), MatCreateMPIAIJSELL(), MatSetValues() 337 @*/ 338 PetscErrorCode MatCreateSeqAIJSELL(MPI_Comm comm,PetscInt m,PetscInt n,PetscInt nz,const PetscInt nnz[],Mat *A) 339 { 340 PetscErrorCode ierr; 341 342 PetscFunctionBegin; 343 ierr = MatCreate(comm,A);CHKERRQ(ierr); 344 ierr = MatSetSizes(*A,m,n,m,n);CHKERRQ(ierr); 345 ierr = MatSetType(*A,MATSEQAIJSELL);CHKERRQ(ierr); 346 ierr = MatSeqAIJSetPreallocation_SeqAIJ(*A,nz,nnz);CHKERRQ(ierr); 347 PetscFunctionReturn(0); 348 } 349 350 PETSC_EXTERN PetscErrorCode MatCreate_SeqAIJSELL(Mat A) 351 { 352 PetscErrorCode ierr; 353 354 PetscFunctionBegin; 355 ierr = MatSetType(A,MATSEQAIJ);CHKERRQ(ierr); 356 ierr = MatConvert_SeqAIJ_SeqAIJSELL(A,MATSEQAIJSELL,MAT_INPLACE_MATRIX,&A);CHKERRQ(ierr); 357 PetscFunctionReturn(0); 358 } 359