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